dc.contributor | 資科系 | |
dc.creator (作者) | Liu, Jyi-shane;Ning, Ke-Chih | |
dc.creator (作者) | 劉吉軒 | zh_TW |
dc.date (日期) | 2011 | |
dc.date.accessioned | 17-Jun-2015 16:42:45 (UTC+8) | - |
dc.date.available | 17-Jun-2015 16:42:45 (UTC+8) | - |
dc.date.issued (上傳時間) | 17-Jun-2015 16:42:45 (UTC+8) | - |
dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/75921 | - |
dc.description.abstract (摘要) | The main focus of this study is the computational evaluation of candidacy for an executive vacancy. We identified a new problem framework on bureaucratic promotion and proposed to tackle the problem with social network analysis that involved bipartite graph and link prediction. A bureaucratic career bipartite network model was developed to encode key information reflecting a candidate`s service merit and the aggregated merit standards of an executive position. This allowed us to approximate merit measurement with node similarity. We implemented this candidacy evaluation approach and conducted experiments with data from Taiwan`s bureaucratic career database. Empirical evaluation shows acceptable baseline performance and demonstrates feasibility of the link prediction approach to candidacy ranking. The results also seem to indicate that bureaucratic promotion for executive positions in Taiwan government is mostly a merit system, as opposed to at-will. | |
dc.format.extent | 130 bytes | - |
dc.format.mimetype | text/html | - |
dc.relation (關聯) | Advances in Social Network Analysis and Mining - ASONAM | |
dc.title (題名) | Applying Link Prediction to Ranking Candidates for High-Level Government Post | |
dc.type (資料類型) | conference | en |
dc.identifier.doi (DOI) | 10.1109/ASONAM.2011.54 | |
dc.doi.uri (DOI) | http://dx.doi.org/10.1109/ASONAM.2011.54 | |