Research ArticleOpen AccessGoogle Scholar indexed
Document Clustering with Evolutionary Systems through Straight-Line Programs “<i>slp</i>”
Department of Computer Science, University of Alcala, Madrid, Spain.
Department of Computer Science, University of Alcala, Madrid, Spain.
Department of Computer Science, University of Alcala, Madrid, Spain.
- 1 Department of Computer Science, University of Alcala, Madrid, Spain.
- 2 Department of Computer Science, University of Alcala, Madrid, Spain.
- 3 Department of Computer Science, University of Alcala, Madrid, Spain.
Journal of Intelligent Learning Systems and Applications·Volume 04 (2012)·Pages 303–318·Published 28 November 2012·DOI10.4236/jilsa.2012.44032
Copy link · social · email
Abstract
In this paper, we show a clustering method supported on evolutionary algorithms with the paradigm of linear genetic programming. “ The Straight-Line Programs ( slp )”, which uses a data structure which will be useful to represent collections of documents. This data structure can be seen as a linear representation of programs, as well as representations in the form of graphs. It has been used as a theoretical model in Computer Algebra, and our purpose is to reuse it in a completely different context. In this case, we apply it to the field of grouping library collections through evolutionary algorithms. We show its efficiency with experimental data we got from traditional library collections.
KeywordsClusteringGenetic AlgorithmData MiningStraight Line Programs
- R. Baeza-Yates and B. Ribeiro Neto, “Modern Information Retrieval,” 2nd Edition, ACM Press Book Addison-Wesley, New York, 1999.
- Z. Michalewicz, “Genetic Algorithms + Data Structures = Evolution Program,” Third Edition, Springer-Verlag, Berlin, 1999.
- M. Aldaz, J. Heintz, G. Matera, J. L. Monta?a and L. M. Pardo, “Time-Space Tradeoffs in Algebraic Complexity Theory,” Journal of Complexity, Vol. 16, No. 1, 1998, pp. 2-49. doi:10.1006/jcom.1999.0526
- C. L. Alonso, J. L. Monta?a and J. Puente, “Straight Line Programs: A New Linear Genetic Programming Approach,” Proceedings of the 20th International Conference of the IEEE on Tools with Artificial Intelligence, ICTAI, Dayton, 3-5 November 2008, pp. 517-524.
- D. Goldberg, “Genetic Algorithms in Search, Optimization and Machine Learning,” First Edition, Addison-Wesley, 1989.
- J. Koza, “Genetic Programming: On the Programming Computers by Means of Natural Selection,” Massachusetts Institute of Technology, Cambridge, 1992.
- J. L. Castillo, J. R. Fernández del Castillo and L. González, “Feature Reduction for Document Clustering with NZIPF Method,” Proceedings of IADIS International Conference e-Society 2009, Barcelona, 25-28 February 2009, pp. 205-209.
- J. L. Castillo, J. R. Fernández del Castillo and L. González, “Methodology of Preprocessing of Documents for Systems of Recovery of Information,” Proceedings of IADIS International Conference, Information System 2008, Algarve, 9-11 April 2008, pp. 324-327.
- G. K. Zipf, “Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology,” Addison Wesley, Cambridge, 1949.
- J. A. Moreiro González, “Applications from Content Analysis of the Mathematical Theory of Information,” Journal of Documentation, Vol. 5, 2002, pp. 273-286.
- M. L. Pao, “Automatic Indexing Based on Goffman Transition of Word Occurrences,” American society for Information Science. Meeting 40th Information Management in the 1980’s: Proceedings of the ASIS Annual Meeting, Chicago, 26 September-1 October 1977.
- M. Berry and M. Castellanos, “Survey of Text Mining II,” Springer Verlag, London, 2008. doi:10.1007/978-1-84800-046-9
- J. Arabas, Z. Michalewicz Zbigniew and J. Mulawka “GAVaPs—A Genetic Algorithm with Varying Population Size,” Proceedings of the First Conference on Evolutionary Computation of the IEEE, orlando, 27-29 June 1994, pp. 73-79.