{"id":"https://openalex.org/W4386729770","doi":"https://doi.org/10.1145/3604915.3610657","title":"An Exploration of Sentence-Pair Classification for Algorithmic Recruiting","display_name":"An Exploration of Sentence-Pair Classification for Algorithmic Recruiting","publication_year":2023,"publication_date":"2023-09-14","ids":{"openalex":"https://openalex.org/W4386729770","doi":"https://doi.org/10.1145/3604915.3610657"},"language":"en","primary_location":{"id":"doi:10.1145/3604915.3610657","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3604915.3610657","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM Conference on Recommender Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.itu.dk/ws/files/103513359/RecSys_LBR_2023.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046310758","display_name":"Mesut Kaya","orcid":"https://orcid.org/0000-0003-2305-6683"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Mesut Kaya","raw_affiliation_strings":["Department of Communication and Psychology, Aalborg University Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-2305-6683","affiliations":[{"raw_affiliation_string":"Department of Communication and Psychology, Aalborg University Copenhagen, Denmark","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012040328","display_name":"Toine Bogers","orcid":"https://orcid.org/0000-0003-0716-676X"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Toine Bogers","raw_affiliation_strings":["Department of Computer Science, IT University of Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-0716-676X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, IT University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046310758"],"corresponding_institution_ids":["https://openalex.org/I891191580"],"apc_list":null,"apc_paid":null,"fwci":0.8242,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.7508679,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1175","last_page":"1179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11714","display_name":"Multimodal Machine Learning Applications","score":0.9678999781608582,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11714","display_name":"Multimodal Machine Learning Applications","score":0.9678999781608582,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10028","display_name":"Topic Modeling","score":0.9621000289916992,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9578999876976013,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6932297945022583},{"id":"https://openalex.org/keywords/sentence","display_name":"Sentence","score":0.6394548416137695},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.4700649678707123},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.455363929271698}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6932297945022583},{"id":"https://openalex.org/C2777530160","wikidata":"https://www.wikidata.org/wiki/Q41796","display_name":"Sentence","level":2,"score":0.6394548416137695},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.4700649678707123},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.455363929271698}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3604915.3610657","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3604915.3610657","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM Conference on Recommender Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/51dcda29-f7d5-4d66-aa54-c314590eca98","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/51dcda29-f7d5-4d66-aa54-c314590eca98","pdf_url":"https://pure.itu.dk/ws/files/103513359/RecSys_LBR_2023.pdf","source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kaya, M & Bogers, T 2023, An Exploration of Sentence-Pair Classification for Algorithmic Recruiting. in Proceedings of the 17th ACM Conference on Recommender Systems, RecSys 2023. Association for Computing Machinery, United States, RecSys '23, pp. 1175\u20131179. https://doi.org/10.1145/3604915.3610657","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/4983ce4c-b250-4566-b9c6-b829c1781379","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/4983ce4c-b250-4566-b9c6-b829c1781379","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kaya , M & Bogers , T 2023 , An Exploration of Sentence-Pair Classification for Algorithmic Recruiting . in Proceedings of the 17th ACM Conference on Recommender Systems, RecSys 2023 . Association for Computing Machinery , RecSys '23 , pp. 1175\u20131179 . https://doi.org/10.1145/3604915.3610657","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/51dcda29-f7d5-4d66-aa54-c314590eca98","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/51dcda29-f7d5-4d66-aa54-c314590eca98","pdf_url":"https://pure.itu.dk/ws/files/103513359/RecSys_LBR_2023.pdf","source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kaya, M & Bogers, T 2023, An Exploration of Sentence-Pair Classification for Algorithmic Recruiting. in Proceedings of the 17th ACM Conference on Recommender Systems, RecSys 2023. Association for Computing Machinery, United States, RecSys '23, pp. 1175\u20131179. https://doi.org/10.1145/3604915.3610657","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4386729770.pdf","grobid_xml":"https://content.openalex.org/works/W4386729770.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1966644285","https://openalex.org/W1998563946","https://openalex.org/W2113339754","https://openalex.org/W2524229565","https://openalex.org/W2890410227","https://openalex.org/W2893564970","https://openalex.org/W2952396276","https://openalex.org/W2970641574","https://openalex.org/W2972428112","https://openalex.org/W2972470325","https://openalex.org/W3083784942","https://openalex.org/W3094607200","https://openalex.org/W3100612294","https://openalex.org/W3145281551","https://openalex.org/W3199188108","https://openalex.org/W4292420207"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W3204019825"],"abstract_inverted_index":{"Recent":[0],"years":[1],"have":[2],"seen":[3],"a":[4,38,41,73,116,144,154],"rapid":[5],"increase":[6],"in":[7,115],"the":[8,30,35,57,93,119],"application":[9],"of":[10,25,29,121,146],"computational":[11],"approaches":[12,172],"to":[13,47,59,66,76,112],"different":[14],"HR":[15],"tasks,":[16],"such":[17],"as":[18],"algorithmic":[19],"hiring,":[20],"skill":[21],"extraction,":[22],"and":[23,40,51,55,79,85,148,169],"monitoring":[24],"employee":[26],"satisfaction.":[27],"Much":[28],"recent":[31],"work":[32],"on":[33,92,130,151],"estimating":[34],"fit":[36],"between":[37,95,133],"person":[39],"job":[42,52,80,125,157],"has":[43],"used":[44],"representation":[45],"learning":[46],"represent":[48],"both":[49],"resumes":[50,78,123],"vacancies":[53],"computationally":[54],"determine":[56],"degree":[58],"which":[60,71],"they":[61,89],"match.":[62],"A":[63],"common":[64],"approach":[65,163],"this":[67,140,162],"task":[68,120],"is":[69,110],"Sentence-BERT,":[70],"uses":[72],"Siamese":[74],"network":[75],"encode":[77],"descriptions":[81],"into":[82],"fixed-length":[83],"vectors":[84],"estimates":[86],"how":[87],"well":[88],"match":[90],"based":[91],"similarity":[94],"those":[96],"vectors.":[97],"In":[98],"our":[99],"paper,":[100],"we":[101,136,159],"adapt":[102],"BERT\u2019s":[103],"next-sentence":[104],"prediction":[105],"task\u2014predicting":[106],"whether":[107],"one":[108],"sentence":[109],"likely":[111],"follow":[113],"another":[114],"given":[117],"context\u2014to":[118],"matching":[122],"with":[124],"descriptions.":[126],"Using":[127],"historical":[128],"data":[129,152],"past":[131],"(mis)matches":[132],"job-resume":[134],"pairs,":[135],"fine-tune":[137],"BERT":[138],"for":[139,173],"downstream":[141],"task.":[142],"Through":[143],"combination":[145],"offline":[147],"online":[149],"experiments":[150],"from":[153],"large":[155],"Scandinavian":[156],"portal,":[158],"show":[160],"that":[161],"performs":[164],"significantly":[165],"better":[166],"than":[167],"Sentence-BERT":[168],"other":[170],"state-of-the-art":[171],"determining":[174],"person-job":[175],"fit.":[176]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}