Cited 0 time in
Exploiting job transition patterns for effective job recommendation
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lee, Yujin | - |
| dc.contributor.author | Lee,Yeon-Chang | - |
| dc.contributor.author | Hong, Jiwon | - |
| dc.contributor.author | Kim, Sang-Wook | - |
| dc.date.accessioned | 2022-07-12T20:17:26Z | - |
| dc.date.available | 2022-07-12T20:17:26Z | - |
| dc.date.created | 2021-05-13 | - |
| dc.date.issued | 2017-12 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/151039 | - |
| dc.description.abstract | E-recruitment sites such as LinkedIn, Reed, and Indeed have a huge number of professional resumes from job seekers and job openings posted by recruiters. In this situation, it is a very time-consuming task for job seekers to find job openings that are well matched to their careers and desired conditions. Accordingly, active studies on job recommendation (JR) have been conducted recently. In this paper, we address the important property of transition patterns in JR that previous studies have overlooked. To incorporate the property into JR, we first propose two data modeling methods of adjacent pairing and all paring that represent a career path of a job seeker as a set of job pairs. Then, we propose frequency-based and graph-based methods of preference inference based on the data modeling methods. Finally, we develop four recommendation approaches, AdjacentFreq, AllFreq, AdjacentGraph, and AllGraph, each of which is a combination of two data modeling methods and two preference inference methods. Through extensive experiments using a real-life dataset, we show that our proposed approaches effectively address the unique property of JR. Also, we show that JR utilizing the transition information provides accuracy higher than JR not using the information. | - |
| dc.language | 영어 | - |
| dc.language.iso | en | - |
| dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
| dc.title | Exploiting job transition patterns for effective job recommendation | - |
| dc.type | Article | - |
| dc.contributor.affiliatedAuthor | Kim, Sang-Wook | - |
| dc.identifier.doi | 10.1109/SMC.2017.8122984 | - |
| dc.identifier.scopusid | 2-s2.0-85044368663 | - |
| dc.identifier.bibliographicCitation | 2017 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2017, v.2017-January, pp.2414 - 2419 | - |
| dc.relation.isPartOf | 2017 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2017 | - |
| dc.citation.title | 2017 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2017 | - |
| dc.citation.volume | 2017-January | - |
| dc.citation.startPage | 2414 | - |
| dc.citation.endPage | 2419 | - |
| dc.type.rims | ART | - |
| dc.type.docType | Conference Paper | - |
| dc.description.journalClass | 1 | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.subject.keywordPlus | Cybernetics | - |
| dc.subject.keywordPlus | Graphic methods | - |
| dc.subject.keywordPlus | Career paths | - |
| dc.subject.keywordPlus | Desired conditions | - |
| dc.subject.keywordPlus | Graph-based methods | - |
| dc.subject.keywordPlus | Inference methods | - |
| dc.subject.keywordPlus | Job-openings | - |
| dc.subject.keywordPlus | Model method | - |
| dc.subject.keywordPlus | Time-consuming tasks | - |
| dc.subject.keywordPlus | Transition patterns | - |
| dc.subject.keywordPlus | Information analysis | - |
| dc.identifier.url | https://ieeexplore.ieee.org/document/8122984 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1366
COPYRIGHT © 2024 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
