Web document clustering based on global-best harmony search, K-means, frequent term sets and Bayesian information criterion

2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010

Volumn , Issue , 2010, Pages

  Cobos, Carlos ^a   Andrade, Jennifer ^a   Constain, William ^a   Mendoza, Martha ^a   León, Elizabeth ^b  

^a UNIVERSIDAD DEL CAUCA   (Colombia)

^b UNIVERSIDAD NACIONAL DE COLOMBIA   (Colombia)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN INFORMATION CRITERION; DATA SETS; FITNESS FUNCTIONS; GLOBAL STRATEGIES; HARMONY SEARCH; HIGH DIMENSIONALITY; K-MEANS; K-MEANS ALGORITHM; LOCAL SEARCH SPACES; NUMBER OF CLUSTERS; OPTIMUM VALUE; REUTERS-21578; SINGULAR VALUE DECOMPOSITION ALGORITHMS; SOLUTION SPACE; SWARM INTELLIGENCE; WEB DOCUMENT CLUSTERING;

ARTIFICIAL INTELLIGENCE; CELLULAR AUTOMATA; INFORMATION RETRIEVAL; SINGULAR VALUE DECOMPOSITION; USER INTERFACES; WORLD WIDE WEB;

CLUSTERING ALGORITHMS;

EID: 79959415118     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2010.5586109     Document Type: Conference Paper

References (39)

1. R. Baeza-Yates, A. and B. Ribeiro-Neto, Modern Information Retrieval: Addison-Wesley Longman Publishing Co., Inc., 1999.
2. G. Mecca, S. Raunich, and A. Pappalardo, "A new algorithm for clustering search results," Data & Knowledge Engineering, vol. 62, pp. 504-522, 2007.
3. C. Carpineto, S. Osiński, G. Romano, and D. Weiss, "A survey of Web clustering engines," ACM Comput. Surv., vol. 41, pp. 1-38, 2009.
4. Z. Oren and E. Oren, "Web document clustering: a feasibility demonstration," in Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval Melbourne, Australia: ACM, 1998.
5. L. Jing, "Survey of Text Clustering," 2008.
6. K. Hammouda, "Web Mining: Clustering Web Documents A Preliminary Review," 2001.
7. A. K. Jain and R. C. Dubes, Algorithms for clustering data: Prentice-Hall, Inc., 1988.
8. A. K. Jain, M. N. Murty, and P. J. Flynn, "Data clustering: a review," ACM Comput. Surv., vol. 31, pp. 264-323, 1999.
9. M. Steinbach, G. Karypis, and V. Kumar, "A comparison of document clustering techniques," 2000.
10. Y. Li, S. M. Chung, and J. D. Holt, "Text document clustering based on frequent word meaning sequences," Data & Knowledge Engineering, vol. 64, pp. 381-404, 2008.
11. D. Zhang and Y. Dong, "Semantic, Hierarchical, Online Clustering of Web Search Results," in Advanced Web Technologies and Applications, 2004, pp. 69-78.
12. S. Osiński, "An Algorithm for clustering of web search results." vol. Master Poland: Poznań University of Technology, 2003, p. 91.
13. S. Osiński, J. Stefanowski, and D. Weiss, "Lingo: Search results clustering algorithm based on Singular Value Decomposition," in Proceedings of the International Conference on Intelligent Information Systems (IIPWM), 2004, pp. 359-368.
14. S. Osiński and D. Weiss, "Conceptual clustering using Lingo algorithm: Evaluation on Open Directory Project data," in Proceedings of the International Conference on Intelligent Information Systems (IIPWM), 2004, pp. 369-377.
15. S. Osiński and D. Weiss, "A concept-driven algorithm for clustering search results," Intelligent Systems, IEEE, vol. 20, pp. 48-54, 2005.
16. S. Osiński and D. Weiss, "Carrot 2: Design of a Flexible and Efficient Web Information Retrieval Framework," in Advances in Web Intelligence, 2005, pp. 439-444.
17. S. Osiński, "Improving quality of search results clustering with approximate matrix factorizations," in 28th European Conference on IR Research (ECIR 2006), London, UK, 2006, pp. 167-178.
18. F. Beil, M. Ester, and X. Xu, "Frequent term-based text clustering," in KDD '02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, Edmonton, Alberta, Canada, 2002, pp. 436-442.
19. B. Fung, K. Wang, and M. Ester, "Hierarchical document clustering using frequent itemsets," in Proceedings of the SIAM International Conference on Data Mining, 2003.
20. Z. Geem, J. Kim, and G. V. Loganathan, "A New Heuristic Optimization Algorithm: Harmony Search," SIMULATION, vol. 76, pp. 60-68, 2001.
21. R. Forsati, M. R. Meybodi, M. Mahdavi, and A. G. Neiat, "Hybridization of K-Means and Harmony Search Methods for Web Page Clustering," in Web Intelligence and Intelligent Agent Technology, 2008. WI-IAT '08. IEEE/WIC/ACM International Conference on, 2008, pp. 329-335.
22. M. Mahdavi and H. Abolhassani, "Harmony K-means algorithm for document clustering," Data Mining and Knowledge Discovery, vol. 18, pp. 370-391, 2009.
23. M. Mahdavi, M. H. Chehreghani, H. Abolhassani, and R. Forsati, "Novel meta-heuristic algorithms for clustering web documents," Applied Mathematics and Computation, vol. 201, pp. 441-451, 2008.
24. W. Song, C. H. Li, and S. C. Park, "Genetic algorithm for text clustering using ontology and evaluating the validity of various semantic similarity measures," Expert Systems with Applications, vol. 36, pp. 9095-9104, 2009.
25. W. Song and S. Park, "Genetic Algorithm-Based Text Clustering Technique," in Advances in Natural Computation, 2006, pp. 779-782.
26. K. Lee and Z. Geem, "A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice," Computer Methods in Applied Mechanics and Engineering, vol. 194, pp. 3902-3933, 2005.
27. L. d. Santos Coelho and D. L. de Andrade Bernert, "An improved harmony search algorithm for synchronization of discrete-time chaotic systems," Chaos, Solitons & Fractals, vol. In Press, Corrected Proof, 2008.
28. M. G. H. Omran and M. Mahdavi, "Global-best harmony search," Applied Mathematics and Computation, vol. 198, pp. 643-656, 2008.
29. J. Kennedy and R. C. Eberhart, "Particle Swarm Optimization," in IEEE Int'l. Conf. on Neural Networks., Perth, Australia, 1995, pp. 1942-1948.
30. P. Berkhin, "Survey Of Clustering Data Mining Techniques," Accrue Software, Inc. 2002.
31. J. Han, M. Kamber, and A. K. H. Tung, "Spatial Clustering Methods in Data Mining: A Survey," in Geographic Data Mining and Knowledge Discovery: Taylor and Francis, 2001.
32. G. H. O. Mahamed, P. E. Andries, and S. Ayed, "An overview of clustering methods," Intell. Data Anal., vol. 11, pp. 583-605, 2007.
33. S. J. Redmond and C. Heneghan, "A method for initialising the Kmeans clustering algorithm using kd-trees," Pattern Recognition Letters, vol. 28, pp. 965-973, 2007.
34. A. Webb, Statistical Pattern Recognition, 2nd Edition: {John Wiley & Sons}, 2002.
35. M. Mahdavi, M. Fesanghary, and E. Damangir, "An improved harmony search algorithm for solving optimization problems," Applied Mathematics and Computation, vol. 188, pp. 1567-1579, 2007.
36. X. Liu and P. He, "A Study on Text Clustering Algorithms Based on Frequent Term Sets," in Advanced Data Mining and Applications, 2005, pp. 347-354.
37. J. Han and M. Kamber, Data Mining: Concepts and Techniques, 2nd ed.: Morgan Kaufman Publishers, 2006.
38. H. Ralambondrainy, "A conceptual version of the K-means algorithm," Pattern Recognition Letters, vol. 16, pp. 1147-1157, 1995.
39. C. Fellbaum, WordNet: An Electronic Lexical Database: MIT Press, 1998.