Candidate groups search for K-harmonic means data clustering

Applied Mathematical Modelling

Volumn 37, Issue 24, 2013, Pages 10123-10128

  Hung, Cheng Huang ^a   Chiou, Hua Min ^a   Yang, Wei Ning ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Candidate groups search (CGS); Clustering; K harmonic means; K means

Indexed keywords

BETTER PERFORMANCE; CANDIDATE GROUPS SEARCH (CGS); CLUSTERING; CLUSTERING PROBLEMS; COMPUTATIONAL RESULTS; K-HARMONIC MEANS; K-HARMONIC MEANS CLUSTERING; K-MEANS;

CLUSTERING ALGORITHMS;

HARMONIC ANALYSIS;

EID: 84887409450     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2013.05.052     Document Type: Article

References (18)

1. Anderberg M.R. Cluster Analysis for Application 1973, Academic Press, New York.
2. L. Kaufmann, P. Rousseeuw, Finding groups in data wiley series in probability and statistics, New York, 2005.
3. Mirkin B. Clustering for Data Mining: A Data Recovery Approach 2005, Taylor and Francis group and FL.
4. Aloise D., Hansen P. Clustering. Handbook of Discrete and Combinatorial Mathematics 2009, CRC Press.
5. Hansen P., Jaumard B. Cluster analysis and mathematical programming. Math. Program. 1997, 79:191-215.
6. Hansen P., Mladenovic N. J-means: a new local search heuristic for minimum sum of squares clustering. Pattern Recogn. 2001, 34:405-413.
7. B. Zhang, M. Hsu, U. Dayal, K-harmonic means - a data clustering algorithm, Technical Report HPL-1999-124, Hewlett-Packard Laboratories, 1999.
8. B. Zhang, Generalized k-harmonic means - boosting in unsupervised learning, Technical Report HPL-2000-137, Hewlett-Packard Laboratories, 2000.
9. Gungor Z., Unler A. K-harmonic means data clustering with tabu-search method. Appl. Math. Model. 2008, 32:1115-1125.
10. Gungor Z., Unler A. K-harmonic means data clustering with simulated annealing heuristic. Appl. Math. Comput. 2007, 184:199-209.
11. Jiang H., Yi S., Li J., Yang F., Hu X. Ant clustering algorithm with k-harmonic means clustering. Expert Syst. Appl. 2010, 37:8679-8684.
12. Mladenovic N., Hansen P. Variable neighborhood search. Comput. Oper. Res. 1997, 24:1097-1110.
13. Hansen P., Mladenovic N. Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 2001, 130:449-467.
14. Hansen P., Mladenovic N., Moreno Perez J.A. Variable neighborhood search: methods and application. 4OR: A Q. J. Oper. Res. 2008, 6:319-360.
15. Brimberg J., Hansen P., Mladenovic N. Attraction probabilities in variable neighborhood search. 4OR 2010, 8:181-194.
16. Alguwaizani A., Mladenovic N., Hansen P., Ngai E. Variable neighborhood search for harmonic means clustering. Appl. Math. Model. 2011, 35(6):2688-2694.
17. Reinelt G. Tsp-lib - a traveling salesman library. ORSA J. Comput. 1991, 3(3):376-384.
18. Blake C.L., Merz C.J. UCI Repository of Machine Learning Databases 1998, University of California. http://archive.ics.uci.edu/ml/datasets.html.