Talent Mapping on Human Asset Value (HAV) Matrix Using K-Means Algorithm


(*) Corresponding author


Authors' affiliations


DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)

Abstract


The Human Resource Department (HRD) in PT.XYZ is responsible in developing and managing human resources. One of the most common management processes is employee performance appraisal. Companies can evaluate the potential and performance of employees’ work through performance appraisal, where HRD can provide information to assist the executive in making administrative decision and employees’ management. However, the results of performance appraisal alone are not sufficientto know the suitable treatment needed by the company in planning the employees’ management and development. To answer these needs, talent mapping on Human Asset Value (HAV) Matrix is needed. HAV is a matrix which determines positions based on employee’s potential and performance. Mapping using the conventional method was done based on determining the coordinate boundaries of each category in the HAV matrix but was still susceptible to the exact set of data within the category boundaries. This research proposes K-means Algorithm to perform talent mapping. Clustering was based on the midpoint of each category in the HAV Matrix. Employees as objects formed clusters according to the closest distance to the centroid. The K-means algorithm iterated until there was no object displacement in each cluster. The resulting cluster was the average object in each category, so the cluster result was adjusted to the human resource conditions in PT.XYZ. The result of this study can be used as a basis in the implementation of talent mapping on Human Resource Information System.
Copyright © 2017 Praise Worthy Prize - All rights reserved.

Keywords


HRD; Talent Mapping; Human Asset Value (HAV) Matrix; Clustering; K-means Algorithm

Full Text:

PDF


References


W, Ratna. An Integrated Talent Management System: Challenges for Competitive Advantage.Full Paper Proceeding GTAR-2014, Vol. 1, 194-205.

Preeti Khatri,dkk. Talent Management in HR. 2010. Journal of Management and Strategy. Vol. 1, No. 1.
http://dx.doi.org/10.5430/jms.v1n1p39

G. Eva, dkk. Human Resource Management Review. 2013
http://dx.doi.org/10.1016/j.hrmr.2013.05.002

V. Yalcin, Vardarlier, A. Abdullah. The Effects of Using Talent Mana gement With Performance Evaluation System Over Employee Commitment. 2012. Social and Behavioral Sciences 58,340 – 349.
http://dx.doi.org/10.1016/j.sbspro.2012.09.1009

A. Erdem, dkk. Personel Selection Based on Talent Management. 2013. Social and Behavioral Sciences 73, 68 – 72.
http://dx.doi.org/10.1016/j.sbspro.2013.02.021

C. Ian. Talent management: making it real, Development and Learning in Organizations: An International Journal, 2007. Vol. 21 Issue: 2, pp.4-6.
http://dx.doi.org/10.1108/14777280710727307

Z. Chunfei, F. Zhiyi. An Improved K-means Clustering Algorithm. 2013. Journal of Information & Computational Science 10: 1.
http://dx.doi.org/10.12733/jics20102193

J.B. Dibya, K.G. Anil. Effect of Different Distance Measures on the Performance of K-means Algorithm: An Experimental Study in Matlab. 2014. International Journal of Computer Science and Information Technologies, Vol. 5 (2).
http://dx.doi.org/10.14445/22312803/ijctt-v10p119

Y. Jyoti, S. Monika. A Review of K-mean Algorithm.2013. International Journal of Engineering Trends and Technology (IJETT) – Volume 4 Issue 7- 07.

Achieving Human Capital Excellence.2013. Human capital journal. No.27 tahun III, pp 13-18.

P, Abhinn. Study and Analysis of K-means Clustering Algorithm Using Rapidminer.2014. pp.60-64.

M. Shaik,dkk. Optimising Data Using K-means Clustering Algorithm.2015.
http://dx.doi.org/10.1109/telfor.2015.7377608

N. Shi, Y. Guan, X. Liu. Research on K-means Clustering Algorithm, An Improved K-means Clustering Algorithm. 2010. Third International Symposium on Intelligent Information Technology and Security Informatics. IEEE.
http://dx.doi.org/10.1109/iitsi.2010.74

S. Ahamed, Hareesha K S. Dynamic Clustering of Data with Modified KMeans Algorithm. 2012. International Conference on Information and Computer Networks. IPCSIT vol. 27.
http://dx.doi.org/10.1109/icina.2010.5636772

Z. Fengqin., Y. Youlong., Z. Weiwei. Adaptive Clustering Algorithm Based on Max-min Distance and Bayesian Decision Theory, 2017. International Journal of Computer Science, Vol. 44, No. 2.
http://dx.doi.org/10.1007/978-3-642-39112-5_95

Q. Jianpeng., dkk. An effective and Efficient HierarchicalK-means Clustering Algorithm. 2017. International Journal of Distributed Sensor Networks, Vol. 13 no.8
http://dx.doi.org/10.1177/1550147717728627

H. Mathias. Quid pro quo? Examining talent management through the lens of psychological contracts, 2012. Personnel Review, Vol. 41 Issue: 2, pp.126-142.
http://dx.doi.org/10.1108/00483481211199991

P. Sylke.Performance and Talent: Essentials of International Talent Development. 2016
http://dx.doi.org/10.1007/978-3-662-44152-7_41


Refbacks

  • There are currently no refbacks.



Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2024 Praise Worthy Prize