DOI: https://doi.org/10.15587/2313-8416.2015.38743

The experimental results on the quality of clustering diverse set of data using a modified algorithm chameleon

Татьяна Борисовна Шатовская, Анастасия Александровна Заремская

Abstract


In this work results of modified Chameleon algorithm are discussed. Hierarchical multilevel algorithms consist of several stages: building the graph, coarsening, partitioning, recovering. Exploring of clustering quality for different data sets with different combinations of algorithms on different stages of the algorithm is the main aim of the article. And also aim is improving the construction phase through the optimization algorithm of choice k in the building the graph k-nearest neighbors


Keywords


clustering; algorithm Chameleon; building the graph; connectivity; k-nearest neighbors; hierarchical clustering

References


Asuncion, A., Newman, D. J. (2007). UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA. Available at: http://www.ics.uci.edu/~mlearn/MLRepository.html

Blake, C. L., Mer, C. J. (2001). UCI repository of machine learning databases. Available at: http://www.ics.uci.edu/~mlearn/ML - Repository.html

Pearson, S., Mont, M., Bramhall, P. (2004). An Adaptive Privacy Management System For Data Repositories. Trusted Systems Laboratory, Hewlett-Packard Laboratories, Bristol, UK. Available at: http://www.hpl.hp.com/techreports/2004/HPL-2004-211.pdf

Cunningham, K., Kenneth, R., Koedinger, Skogsholm, A., Leber, B. (2008). An open repository and analysis tools for fine-grained longitudinal learner data. Human Computer Interaction Institute, Carnegie Mellon University. Available at: http://www.educationaldatamining.org/EDM2008/uploads/proc/16_Koedinger_45.pdf

Xie, T., Pei (2006). JMAPO: mining API usages from open source repositories. In: Proceedings of the International Workshop on Mining Software Repositories (MSR '06), ACM Press, New York. Shanghai, China, 54–57. Available at: http://people.engr.ncsu.edu/txie/publications/msr06-mapo.pdf

Zimmermann, T. (2006). Knowledge Collaboration by Mining Software Repositories. Saarland University, Saarbrucken, Germany. Available at: http://thomas-zimmermann.com/publications/files/zimmermann-kcsd-2006.pdf


GOST Style Citations


1. Asuncion, A. UCI Machine Learning Repository [Electronic resource] / A. Asuncion, D. J. Newman. – University of California, School of Information and Computer Science, Irvine, CA, 2007. – Available at: http://www.ics.uci.edu/~mlearn/MLRepository.html

2. Blake, C. L., Mer, C. J. (2001): UCI repository of machine learning databases. Available at: http://www.ics.uci.edu/~mlearn/ML - Repository.html

3. Pearson, S. An Adaptive Privacy Management System For Data Repositories [Electronic resource] / S. Pearson, M. Mont, P. Bramhall. – Trusted Systems Laboratory, Hewlett-Packard Laboratories, Bristol, UK, 2004. – Available at: http://www.hpl.hp.com/techreports/2004/HPL-2004-211.pdf

4. Cunningham, K. An open repository and analysis tools for fine-grained longitudinal learner data [Electronic resource] / K. Cunningham, R. Kenneth, Koedinger, A. Skogsholm, B. Leber. – Human Computer Interaction Institute, Carnegie Mellon University, 2008. – Available at: http://www.educationaldatamining.org/EDM2008/uploads/proc/16_Koedinger_45.pdf

5. Xie T. JMAPO: mining API usages from open source repositories. In: Proceedings of the International Workshop on Mining Software Repositories (MSR '06) [Electronic resource] / T. Xie , Pei. – ACM Press, New York. Shanghai, Chinapp, 2006. – P. 54–57. – Available at: http://people.engr.ncsu.edu/txie/publications/msr06-mapo.pdf

6. Zimmermann, T. Knowledge Collaboration by Mining Software Repositories [Electronic resource] / T. Zimmermann. – Saarland University, Saarbrucken, Germany, 2006. – Available at: http://thomas-zimmermann.com/publications/files/zimmermann-kcsd-2006.pdf







Copyright (c) 2015 Татьяна Борисовна Шатовская, Анастасия Александровна Заремская

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

ISSN 2313-8416 (Online), ISSN 2313-6286 (Print)