Robust verification and analysis of the pre-clustering algorithm with a-priori non-specification of the number of clusters
DOI:
https://doi.org/10.15587/1729-4061.2015.47617Keywords:
clustering method, cluster, heuristic algorithm, verification, rule of thumb, decision making ruleAbstract
The range of the implementation of cluster analysis is wide, it extends from many technical applications to different branches of science, such as biology, medicine, computer sciences and psychology. The main purpose of the cluster analysis is dividing the investigated objects into homogeneous groups, or clusters, according to certain criteria and investigating the process of natural grouping of these objects. It means solving the task of grouping data and revealing in them a relevant structure.
The unsupervised learning methods (clusterization) as opposed to the supervised learning methods (classification), marks of output objects, that is, determining each object belonging to the certain cluster, as well as the number of the clusters are not given from the very beginning of the process. The created clustering algorithm without a-priori information about the number of the clusters belongs to the group of pre-clustering algorithms. Pre-clustering is the procedure of checking the possibility of clustering the input data. Checking this possibility answers the question whether data can be divided into more than one cluster.
The process of verification of the parameters of the pre-clustering algorithm concerns testing the rule of decision making for different types of input data. The selected cases of input data considered here are the input data with the normal distribution law having been grouped into one or two clusters.
References
- Han, J., Kamber, M. (2006). Data Mining: Concepts and Techniques. Ed. 2. Morgan Kaufmann Publishers, 703.
- Yan, M. (2005). Methods of Determining the Number of Clusters in a Data Set and a New Clustering Criterion. Blacksburg, Virginia, 120.
- Pérez-Suárez, A., Martínez-Trinidad, J. F., Carrasco-Ochoa, J. A., Medina-Pagola, J. E. (2013). An algorithm based on density and compactness for dynamic overlapping clustering. Pattern Recognition, 46 (11), 3040–3055. doi: 10.1016/j.patcog.2013.03.022
- HaiJiang, S. S. (2005). Model-based clustering. Ontario, Canada: University of Waterloo, 61.
- Dutta, M., Mahanta, A. K., Pujari, A. K. (2005). QROCK: A quick version of the ROCK algorithm for clustering of categorical data. Pattern Recognition Letters, 26 (15), 2364–2373. doi: 10.1016/j.patrec.2005.04.008
- Schikuta, E. (1996). Grid-clustering: an efficient hierarchical clustering method for very large data sets. Proceedings of 13th International Conference on Pattern Recognition, 2, 101–105. doi: 10.1109/icpr.1996.546732
- McCallum, A., Nigam, K., Ungar, L. H. (2000). Efficient clustering of high-dimensional data sets with application to reference matching. Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining – KDD ’00. Association for Computing Machinery (ACM), 169–178. doi: 10.1145/347090.347123
- Goutte, C., Hansen, L. K., Liptrot, M. G., Rostrup, E. (2001). Feature-space clustering for fMRI meta-analysis. Human Brain Mapping, 13 (3), 165–183. doi: 10.1002/hbm.1031
- Hofmann, M., Klinkenberg, R. (2013). RapidMiner: Data Mining Use Cases and Business Analytics Applications. Chapman & Hall/CRC, 431.
- Mosorov, V., Tomczak, L. (2014). Image Texture Defect Detection Method Using Fuzzy C-Means Clustering for Visual Inspection Systems. Arabian Journal for Science and Engineering, 39 (4), 3013–3022. doi: 10.1007/s13369-013-0920-7
- Sisodia, D., Singh, L., Sisodia, S., Saxena, K. (2012). Clustering Techniques: A Brief Survey of Different Clustering Algorithms. International Journal of Latest Trends in Engineering and Technology (IJLTET), 1 (3), 82–87.
- Qian, W., Zhou, A. (2002). Analyzing popular clustering algorithms from different viewpoints. Journal of Software, 13 (18), 1383–1394.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2015 Taras Panskyi, Volodymyr Mosorov, Sebastian Biedron
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.
