{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:06:38Z","timestamp":1742911598728,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031209796"},{"type":"electronic","value":"9783031209802"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20980-2_53","type":"book-chapter","created":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T19:03:09Z","timestamp":1668279789000},"page":"626-640","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exploring the Use of Machine Learning for Resume Recommendations"],"prefix":"10.1007","author":[{"given":"Anna","family":"Shestakova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Corradini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,10]]},"reference":[{"key":"53_CR1","doi-asserted-by":"crossref","unstructured":"Schein, A.I., Popescul, A., Ungar, L.H., Pennock, D.M.: Methods and metrics for cold-start recommendations. In: Proceedings of the 25th International ACM SIGIR Conference on Research and Development in Information Retrieval, New York, USA, pp. 253\u2013260 (2002)","DOI":"10.1145\/564376.564421"},{"key":"53_CR2","doi-asserted-by":"crossref","unstructured":"Roy, P., Chowdhary, S., Bhatia, R.: A machine learning approach for automation of resume recommendation system. In: International Conference on Computational Intelligence and Data Science, Procedia Computer Science 2020 (2020)","DOI":"10.1016\/j.procs.2020.03.284"},{"key":"53_CR3","unstructured":"Axelrod, J.: A robot reading your resume? 10 tips for vets to beat job screening software (2019). https:\/\/www.militarytimes.com\/veterans\/2019\/03\/28\/a-robot-reading-your-resume-10-tips-for-vets-to-beat-job-screening-software\/ Accessed 16 Sep 2022"},{"key":"53_CR4","unstructured":"Hawkins, A.J.: Uber unveils new products for business travellers, wedding parties, and EVs (2022). https:\/\/www.theverge.com\/2022\/5\/16\/23071034\/uber-product-travel-wedding-eats-av-ev-delivery-features Accessed 18 Sep 2022"},{"key":"53_CR5","unstructured":"Choy, M.: What Netflix\u2019s Recommendation Systems Can Teach Us About the Computing Challenges of the Near Future (2021). https:\/\/www.forbes.com\/sites\/forbestechcouncil\/2021\/02\/19\/what-netflixs-recommendation-systems-can-teach-us-about-the-computing-challenges-of-the-near-future\/?sh=271173c87489 Accessed 18 Sep 2022"},{"key":"53_CR6","unstructured":"Lin, Y., Lei, H., Addo, P., Li, X.: Machine Learned Resume-Job Matching Solution (2016). https:\/\/arxiv.org\/abs\/1607.07657. Accessed 18 Sep 2022"},{"key":"53_CR7","doi-asserted-by":"crossref","unstructured":"Shalaby, W., et al.: Help me find a job: A graph-based approach for job recommendation at scale. In: Proceedings of the IEEE International Conference on Big Data, 1544\u20131553 (2017)","DOI":"10.1109\/BigData.2017.8258088"},{"key":"53_CR8","doi-asserted-by":"crossref","unstructured":"McNee, S., Riedl, J., Konstan, J.: Being accurate is not enough: How accuracy metrics have hurt recommender systems. CHI\u201906, pp. 1097\u20131101 (2006)","DOI":"10.1145\/1125451.1125659"},{"key":"53_CR9","doi-asserted-by":"crossref","unstructured":"Geetha, S., Fancy, C., Saranya, D.A.: Hybrid approach using collaborative filtering and content based filtering for recommender system. In: Journal of Physics: Conference Series, Volume 1000, National Conference on Mathematical Techniques and its Applications, Kattankulathur, India, 5\u20136 January 2018 (2018)","DOI":"10.1088\/1742-6596\/1000\/1\/012101"},{"key":"53_CR10","unstructured":"Ghazanfar, M.A.: Robust, scalable, and practical algorithms for recommender systems. University of Southampton, Faculty of Physical and Applied Science, Doctoral Thesis (2012)"},{"key":"53_CR11","unstructured":"Hao, M., et al.: Sorec: social recommendation using probabilistic matrix factorization. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, CA, USA, October 26\u201330 (2008)"},{"key":"53_CR12","unstructured":"Hao, M., King, I., Lyu, M.R.: Learning to recommend with social trust ensemble. In: Proceedings of the 32nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Boston, MA, USA, July 19\u201323, (2009)"},{"key":"53_CR13","doi-asserted-by":"crossref","unstructured":"Jamali, M., Ester, M.: A matrix factorization technique with trust propagation for recommendation in social networks. In: ACM Conference on Recommender Systems (2010)","DOI":"10.1145\/1864708.1864736"},{"key":"53_CR14","unstructured":"Hao, M., et al.: Recommender systems with social regularization. In: Proceedings of the 4th International Conference on Web Search and Web Data Mining, Hong Kong, China (2011)"},{"key":"53_CR15","doi-asserted-by":"crossref","unstructured":"Ying, R., et al.: Graph Convolutional Neural Networks for Web-Scale Recommender Systems. ACM (2018)","DOI":"10.1145\/3219819.3219890"},{"key":"53_CR16","unstructured":"Wu, L., et al.: DiffNet++: A Neural Influence and Interest Diffusion Network for Social Recommendation (2020)"},{"issue":"11","key":"53_CR17","doi-asserted-by":"publisher","first-page":"992","DOI":"10.14778\/3402707.3402736","volume":"4","author":"Y Sun","year":"2011","unstructured":"Sun, Y., et al.: PathSim: meta path-based Top-K similarity search in heterogeneous information networks. In Proceedings of the Vldb Endowment 4(11), 992\u20131003 (2011)","journal-title":"In Proceedings of the Vldb Endowment"},{"key":"53_CR18","doi-asserted-by":"crossref","unstructured":"Fu, T.Y., Lee, W.C., Lei, Z.: HIN2Vec: Explore Meta-paths in Heterogeneous Information Networks for Representation Learning (2017)","DOI":"10.1145\/3132847.3132953"},{"key":"53_CR19","doi-asserted-by":"crossref","unstructured":"Song, C., et al.: Social recommendation with implicit social influence. In: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval (2021)","DOI":"10.1145\/3404835.3463043"},{"key":"53_CR20","doi-asserted-by":"crossref","unstructured":"Ferrari Dacrema, M., Cremonesi, P., Jannach, D.: Are we really making much progress? a worrying analysis of recent neural recommendation approaches. In: Proceedings of the 13th ACM Conference on Recommender Systems (RecSys\u201919). Association for Computing Machinery, New York, NY, USA, 101\u2013109 (2019)","DOI":"10.1145\/3298689.3347058"},{"key":"53_CR21","doi-asserted-by":"crossref","unstructured":"Ahmed, S., Hasan, M., Hoq, M.N., Adnan, M.A.: User interaction analysis to recommend suitable jobs in career-oriented social networking sites. In: 2016 IEEE International Conference on Data and Software Engineering, pp. 1\u20136 (2016)","DOI":"10.1109\/ICODSE.2016.7936143"},{"issue":"1","key":"53_CR22","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s11280-018-0568-z","volume":"22","author":"M Jiang","year":"2018","unstructured":"Jiang, M., Fang, Y., Xie, H., Chong, J., Meng, M.: User click prediction for personalized job recommendation. World Wide Web 22(1), 325\u2013345 (2018)","journal-title":"World Wide Web"},{"key":"53_CR23","doi-asserted-by":"publisher","unstructured":"Ravita, M., Sheetal, R.: Efficient and Scalable Job Recommender System Using Collaborative Filtering. https:\/\/doi.org\/10.1007\/978-981-15-1420-3_91. ICDSMLA 2019, pp. 842\u2013856 (2020)","DOI":"10.1007\/978-981-15-1420-3_91"},{"key":"53_CR24","doi-asserted-by":"crossref","unstructured":"Al-bashiri, H., Abdulgabber, M., Romli, A., Hujainah, F.: Collaborative Filtering Recommender System: Overview and Challenges. Advanced Science Letters (2017)","DOI":"10.1166\/asl.2017.10020"},{"key":"53_CR25","doi-asserted-by":"crossref","unstructured":"Yadalam, T.V., Gowda, V.M., Kumar, V.S., Girish, D.: Career recommendation systems using content based filtering. In: 5th International Conference on Communication and Electronics Systems (ICCES), 2020, pp. 660\u2013665 (2020)","DOI":"10.1109\/ICCES48766.2020.9137992"},{"key":"53_CR26","doi-asserted-by":"crossref","unstructured":"Ghidini, C.: The Semantic Web - ISWC 2019: 18th International Semantic Web Conference: Auckland, New Zealand, October 26\u201330, (2019)","DOI":"10.1007\/978-3-030-30796-7"},{"key":"53_CR27","unstructured":"Dan, M.: Vector space model for document representation in information retrieval. Annals of Dunarea de Jos. (2007)"},{"key":"53_CR28","doi-asserted-by":"crossref","unstructured":"Chen, S.: K-Nearest Neighbor Algorithm Optimization in Text Categorization. IOP Conference Series: Earth and Environmental Science. 108 (2018)","DOI":"10.1088\/1755-1315\/108\/5\/052074"},{"key":"53_CR29","unstructured":"Sanh, V., Debut, L., Chaumond, J., Wolf, T.: DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter. arXiv preprint https:\/\/arxiv.org\/abs\/1910.01108 (2019)"},{"issue":"2022","key":"53_CR30","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.susoc.2021.11.001","volume":"3","author":"B Parida","year":"2022","unstructured":"Parida, B., Kumar Patra, P., Mohanty, S.: Prediction of recommendations for employment utilizing machine learning procedures and geoarea-based recommender framework. Sustainable Operations and Computers 3(2022), 83\u201392 (2022)","journal-title":"Sustainable Operations and Computers"},{"key":"53_CR31","doi-asserted-by":"crossref","unstructured":"Wojciechowski, J., Wandresen, R.R., Mantovani Fontana, R., Marynowski, J.E., Kutzke, A.R.: Is products recommendation good? an experiment on user satisfaction. In: Proceedings of the 19th International Conference on Enterprise Information Systems, Volume 2, pp. 713\u2013720 (2017)","DOI":"10.5220\/0006316307130720"}],"container-title":["Lecture Notes in Computer Science","Speech and Computer"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20980-2_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T19:10:03Z","timestamp":1668280203000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20980-2_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031209796","9783031209802"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20980-2_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPECOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Speech and Computer","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gurugram","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"specom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.specom.co.in","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"99","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}