Analytics in Human Resource Management The OpenSKIMR Approach

Abstract Matching skill sets of individuals with highly demanded skill sets of jobs or occupations in the IT area is a great challenge – adding necessary learning items and visualizing the result is a very promising end to end approach. With the “Open Skill Match Maker” (OpenSKIMR) young people shall be able to plan and simulate their individual learning and career routes towards their desired career destination, like with classical route planning software. Using the ESCO, a multilingual classification of occupations, skills, competences and qualifications, will ensure a consistent understanding of the skills and qualification of the talents. This paper aims at showcasing the possibility of matching data about skills, learning items and job offers. It opens up the opportunity to simulate career paths through visualization in order to support decision making in a world of imperfect data and information and overall this project shall also support the Europe 2020 target for inclusive growth as it aims to motivate people in acquiring new digital skills.

[1]  Sebastian Wernicke,et al.  FANMOD: a tool for fast network motif detection , 2006, Bioinform..

[2]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[3]  Roberto De Virgilio,et al.  Finding All Maximal Cliques in Very Large Social Networks , 2016, EDBT.

[4]  Srinivasan Parthasarathy,et al.  Discovering frequent topological structures from graph datasets , 2005, KDD '05.

[5]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[6]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[7]  Ben Y. Zhao,et al.  User interactions in social networks and their implications , 2009, EuroSys '09.

[8]  Maoguo Gong,et al.  An efficient shortest path approach for social networks based on community structure , 2016, CAAI Trans. Intell. Technol..

[9]  Sahar Asadi,et al.  Kavosh: a new algorithm for finding network motifs , 2009, BMC Bioinformatics.

[10]  Dean Abbott,et al.  Applied Predictive Analytics: Principles and Techniques for the Professional Data Analyst , 2014 .

[11]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[12]  Minas Gjoka,et al.  Walking in Facebook: A Case Study of Unbiased Sampling of OSNs , 2010, 2010 Proceedings IEEE INFOCOM.

[13]  Robert E. Krider,et al.  Customer and Business Analytics: Applied Data Mining for Business Decision Making Using R , 2012 .

[14]  Long Jin,et al.  Understanding Graph Sampling Algorithms for Social Network Analysis , 2011, 2011 31st International Conference on Distributed Computing Systems Workshops.

[15]  Ronald Rousseau,et al.  Social network analysis: a powerful strategy, also for the information sciences , 2002, J. Inf. Sci..

[16]  Agis Papantoniou,et al.  ESCO: Towards a Semantic Web for the European Labor Market , 2015, LDOW@WWW.

[17]  Josep-Lluís Larriba-Pey,et al.  Benchmarking database systems for social network applications , 2013, GRADES.

[18]  Donald F. Towsley,et al.  Estimating and sampling graphs with multidimensional random walks , 2010, IMC '10.