Constrained Ant Colony Optimization for data clustering

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3157, Issue , 2004, Pages 534-543

  Chu, Shu Chuan ^a,b   Roddick, John F ^a   Su, Che Jen ^b   Pan, Jeng Shyang ^b,c  

^a FLINDERS UNIVERSITY   (Australia)

^b NATIONAL KAOHSIUNG UNIVERSITY OF APPLIED SCIENCES   (Taiwan)

^c HARBIN INSTITUTE OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONSTRAINT THEORY; DATA REDUCTION; HEURISTIC METHODS; MATRIX ALGEBRA; ANT COLONY OPTIMIZATION; ARTIFICIAL INTELLIGENCE; CLUSTER ANALYSIS; CONSTRAINED OPTIMIZATION; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; NEAREST NEIGHBOR SEARCH; OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO);

ANT COLONY OPTIMIZATION; DATA CLUSTERING; EUCLIDEAN DISTANCE; META-HEURISTIC ALGORITHMS; ANT COLONY OPTIMIZATION ALGORITHMS; ANT COLONY SYSTEMS; BETWEEN CLUSTERS; DISTANCE METRICS; K-NEAREST NEIGHBORS; MATHEMATICAL SOLUTIONS; META HEURISTIC ALGORITHM; NATURAL PHENOMENA;

OPTIMIZATION; CLUSTERING ALGORITHMS;

EID: 22944449331     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-28633-2_57     Document Type: Conference Paper

References (22)

1. Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. on Systems, Man, and Cybernetics-Part B: Cybernetics 26 (1996) 29-41
2. Dorigo, J.M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. on Evolutionary Computation 1 (1997) 53-66
3. Maniezzo, V., Colorni, A.: The ant system applied to the quadratic assignment problem. IEEE Trans. on Knowledge and Data Engineering 11 (1999) 769-778
4. Parpinelli, R.S., Lopes, H.S., Freitas, A.A.: Data mining with an ant colony optimization algorithm. IEEE Trans. on Evolutionary Computation 6 (2002) 321-332
5. Bland, J.A.: Space-planning by ant colony optimization. International Journal of Computer Applications in Technology 12 (1999) 320-328
6. Chu, S.C., Roddick, J.F., Pan, J.S., Su, C.J.: Parallel ant colony systems. In Zhong, N., Raś, Z.W., Tsumoto, S., Suzuki, E., eds.: 14th International Symposium on Methodologies for Intelligent Systems. Volume 2871., Maebashi City, Japan, LNCS, Springer-Verlag (2003) 279-284
7. Chu, S.C., Roddick, J.F., Pan, J.S.: Ant colony system with communication strategies. Information Sciences (2004) (to appear)
8. MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: 5th Berkeley symposium on mathematics, statistics and Probability. Volume 1. (1967) 281-296
9. Kaufman, L., Rousseeuw, P.J.: Finding groups in data: an introduction to cluster analysis. John Wiley and Sons, New York (1990)
10. Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: An efficient clustering method for very large databases. In: ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, Montreal, Canada (1996) 103-114
11. Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large databases. In: ACM SIGMOD International Conference on the Management of Data, Seattle, WA, USA (1998) 73-84
12. Karypis, G., Han, E.H., Kumar, V.: CHAMELEON: a hierarchical clustering algorithm using dynamic modeling. Computer 32 (1999) 32-68
13. Ganti, V., Gehrke, J., Ramakrishnan, R.: CACTUS - clustering categorical data using summaries. In Chaudhuri, S., Madigan, D., eds.: Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, ACM Press (1999) 73-83
14. Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In Simoudis, E., Han, J., Fayyad, U., eds.: Second International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, AAAI Press (1996) 226-231
15. Sheikholeslami, G., Chatterjee, S., Zhang, A.: WaveCluster: A multiresolution clustering approach for very large spatial databases. In: 1998 International Conference Very Large Data Bases (VLDB'98), New York (1998) 428-439
16. C, A.C., S, Y.P.: Redefining clustering for high-dimensional applications. IEEE Trans. on Knowledge and Data Engineering 14 (2002) 210-225
17. Estivill-Castro, V., Lee, L: AUTOCLUST+: Automatic clustering of point-data sets in the presence of obstacles. In Roddick, J.F., Hornsby, K., eds.: International Workshop on Temporal, Spatial and Spatio-Temporal Data Mining, TSDM2000. Volume 2007., Lyon, France, LNCS, Springer-Verlag (2000) 133-146
18. Ng, R.T., Han, J.: Clarans: A method for clustering objects for spatical data mining. IEEE Transactions on Knowledge and Data Engineering 14 (2002) 1003-1016
19. Tsai, C.F., Wu, H.C., Tsai, C.W.: A new data clustering approach for data mining in large databases. In: International Symposium on Parallel Architectures, Algorithms and Networks, IEEE Press (2002) 278-283
20. Kirkpatrick, S., Gelatt, J.C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220 (1983) 671-680
21. 21, A.: Genetic algorithms for function optimization. PhD thesis, University of Alberta, Edmonton, Canada (1981)
22. Pan, J.S., McInnes, F.R., Jack, M.A.: Bound for minkowski metric or quadratic metric applied to VQ codeword search. IEE Proc. Vision Image and Signal Processing 143 (1996) 67-71