"You know because I know": a multidimensional network approach to human resources problem
Coscia M., Rossetti G., Pennachioli D., Ceccarelli D., Giannotti F.
Computer Science - Computers and Society Computer Science - Data Structures and Algorithms Social and Information Networks (cs.SI) Complex Networks FOS: Physical sciences Computers and Society (cs.CY) Computer Science - Social and Information Networks G.2.2 Graph Theory Ranking FOS: Computer and information sciences Graph Theory Physics - Physics and Society Complex networks Physics and Society (physics.soc-ph) Data Structures and Algorithms (cs.DS)
Finding talents, often among the people already hired, is an endemic challenge for organizations. The social networking revolution, with online tools like Linkedin, made possible to make explicit and accessible what we perceived, but not used, for thousands of years: the exact position and ranking of a person in a network of professional and personal connections. To search and mine where and how an employee is positioned on a global skill network will enable organizations to find unpredictable sources of knowledge, innovation and know- how. This data richness and hidden knowledge demands for a multidimensional and multiskill approach to the network ranking problem. Multidimensional networks are networks with multiple kinds of relations. To the best of our knowledge, no network-based ranking algorithm is able to handle multidimensional networks and multiple rankings over multiple attributes at the same time. In this paper we propose such an algorithm, whose aim is to address the node multi-ranking problem in multidimensional networks. We test our algorithm over several real world networks, extracted from DBLP and the Enron email corpus, and we show its usefulness in providing less trivial and more flexible rankings than the current state of the art algorithms.
Source: ASONAM - 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 434–441, Niagara Falls, Canada, 25-28 August 2013
Publisher: ACM, Association for computing machinery, New York, USA
[2] M. Berlingerio, M. Coscia, F. Giannotti, A. Monreale, and D. Pedreschi, “Foundations of multidimensional network analysis,” in ASONAM, 2011, pp. 485-489.
[3] D. J. Brass, “A social network perspective on human resources management,” Research in Personnel and Human Resources Management, vol. 13, no. 1, pp. 39-79, 1995.
[4] P. Bro´dka, P. Kazienko, K. Musiał, and K. Skibicki, “Analysis of neighbourhoods in multi-layered dynamic social networks,” Int. Journal of Computational Intelligence Systems, vol. 5, no. 3, pp. 582-596, 2012.
[5] G. R. Ferris, W. A. Hochwarter, C. Douglas, F. R. Blass, R. W. Kolodinsky, and D. C. Treadway, “Social influence processes in organizations and human resources systems,” vol. 21, pp. 65 - 127, 2002.
[6] G. Ghoshal and A. Baraba´si, “Ranking stability and super-stable nodes in complex networks,” Nature Communications, vol. 2, pp. 394+, 2011.
[7] T. Haveliwala, “Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search,” Knowledge and Data Engineering, IEEE Transactions on, vol. 15, no. 4, pp. 784-796, 2003.
[8] J. M. Kleinberg, “Authoritative sources in a hyperlinked environment,” J. ACM, vol. 46, no. 5, pp. 604-632, Sep. 1999.
[9] T. G. Kolda, B. W. Bader, and J. P. Kenny, “Higher-Order web link analysis using multilinear algebra,” in ICDM. Washington, DC, USA: IEEE Computer Society, 2005, pp. 242-249.
[10] R. Lempel and S. Moran, “The stochastic approach for link-structure analysis (SALSA) and the TKC effect,” Computer Networks (Amsterdam, Netherlands: 1999), vol. 33, no. 1-6, pp. 387-401, 2000.
[11] X. Li, M. K. Ng, and Y. Ye, “Har: Hub, authority and relevance scores in multi-relational data for query search,” in SDM, 2012, pp. 141-152.
[12] E. Moretti, “Estimating the social return to higher education: evidence from longitudinal and repeated cross-sectional data,” Journal of Econometrics, vol. 121, no. 1-2, pp. 175-212, 2004.
[13] M. K.-P. Ng, X. Li, and Y. Ye, “Multirank: co-ranking for objects and relations in multi-relational data,” in SIGKDD. New York, NY, USA: ACM, 2011, pp. 1217-1225.
[14] L. Page, S. Brin, R. Motwani, and T. Winograd, “The pagerank citation ranking: Bringing order to the web.” Stanford InfoLab, Technical Report 1999-66, November 1999, previous number = SIDL-WP-1999-0120.
[15] M. F. Porter, “An Algorithm for Suffix Stripping,” Program, vol. 14, no. 3, pp. 130-137, 1980.
[16] A. Sidiropoulos and Y. Manolopoulos, “Generalized comparison of graph-based ranking algorithms for publications and authors,” J. Syst. Softw., vol. 79, no. 12, 2006.
[17] J. Tang, J. Zhang, R. Jin, Z. Yang, K. Cai, L. Zhang, and Z. Su, “Topic level expertise search over heterogeneous networks,” Machine Learning, vol. 82, no. 2, pp. 211-237, 2011.
[18] A. Veloso, M. A. Gonc¸alves, and W. M. Jr., “Competence-conscious associative rank aggregation,” JIDM, vol. 2, no. 3, pp. 337-352, 2011.
Metrics
Back to previous page
@inproceedings{oai:it.cnr:prodotti:278953,
title = {"You know because I know": a multidimensional network approach to human resources problem},
author = {Coscia M. and Rossetti G. and Pennachioli D. and Ceccarelli D. and Giannotti F.},
publisher = {ACM, Association for computing machinery, New York, USA},
doi = {10.1145/2492517.2492537 and 10.48550/arxiv.1305.7146},
booktitle = {ASONAM - 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 434–441, Niagara Falls, Canada, 25-28 August 2013},
year = {2013}
}
0000-0003-3099-3835
