The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Machine learned job recommendation
Abstract
We address the problem of recommending suitable jobs to people who are seeking a new job. We formulate this recommendation problem as a supervised machine learning problem. Our technique exploits all past job transitions as well as the data associated with employees and institutions to predict an employee's next job transition. We train a machine learning model using a large number of job transitions extracted from the publicly available employee profiles in the Web. Experiments show that job transitions can be accurately predicted, significantly improving over a baseline that always predicts the most frequent institution in the data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
College Admissions and the Stability of Marriage
Gale, D., & Shapley, L. S. (1962) · The American Mathematical Monthly · doi:10.1080/00029890.1962.11989827 · Cited by 5,985
Myles, G. D. (1993) · European Journal of Political Economy · doi:10.1016/0176-2680(93)90012-j · Cited by 875
Cited by
A Survey of Graph Neural Networks for Recommender Systems: Challenges, Methods, and Directions
Gao, C., Zheng, Y., Li, N., Li, Y., Qin, Y., Piao, J., Quan, Y., Chang, J., Jin, D., He, X., et al. (2023) · ACM Transactions on Recommender Systems · doi:10.1145/3568022 · Cited by 1,082
The use of machine learning algorithms in recommender systems: a systematic review
Portugal, I., Alencar, P., & Cowan, D. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.12.020 · Cited by 743
“, 2015) Graphical Model 17 15 (Yuan et al., 2014; Aouay et al., 2014; Banerjee et al., 2012; Costa et al., 2012, 2013; De Gemmis et al., 2008; Hernández del Olmo et al., 2009; Lops et al., 2009; Musto et al., 2010; Paparrizos et al., 2011; Pecli et al., 2015; Pronoza et al., 2016; S.-Z. Zhang et al., 2007; Xin et al.,…”
Metadata
- Authors
- Paparrizos, I., Cambazoglu, B. B., & Gionis, A.
- Venue
- Proceedings of the fifth ACM conference on Recommender systems
- Publisher
- ACM
- Published
- 2011-10-23
- Pages
- 325-328
- OpenAlex
- W2105621451
- Cited by
- 165
- References
- 2
- FWCI
- 3.37
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.