Analysis of the modified alternative decision rule in the preclustering algorithm
DOI:
https://doi.org/10.15587/1729-4061.2015.51214Keywords:
preclustering algorithm, precluster, modified decision rule, validity criteria, clusterAbstract
The preclustering algorithm as opposed to other existed algorithms does not require a priori information about cluster location and about additional means of control. Preclustering algorithm is multipurpose and promising for a primary analysis of investigated input data. In this article the main part of the preclustering algorithm – the modified decision rule has been presented. The modification consisted to the replacement of the calculation of mean distances in a precluster (like in the classical decision rule) by the mean distances from the center of the precluster to all objects in the chosen precluster. The proposed decision rule determines the centre of the group as a local density maximum of the group of objects (before clustering) or of the precluster (after clustering). The results obtained during the testing of the decision rule were compared with the results obtained with the use of criteria of spherical resolution. Also, from the analysis, the advantages and disadvantages of the proposed decision rule have been identified.
References
- North, M.A. (2012). Data mining for the masses. A global text project book, 264.
- Aggarwal, C. C. (2013). Data Clustering: Algorithms and Applications 1st Edition. Chapman & Hall, 652.
- 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, 169–178. doi: 10.1145/347090.347123
- Kovács, L., Bednarik, L. (2011). Parameter Optimization for BIRCH Pre-Clustering Algorithm. 12th IEEE International Symposium on Computational Intelligence and Informatics, 475–480.
- Khan, M. A. H. (2015). Pre-processing for K-means Clustering Algorithm. Senior Projects Spring, 260.
- Everitt, B. S., Landau, S., Leese, M., Stahl, D. (2011). Data Clustering 5th Edition. Willey Series In Probability And Statistics, 348.
- Gan, G., Ma, C., Wu, J. (2007). Data clustering Theory, Algorithms, and Applications. ASA-SIAM Series on Statistics And Applied Probability, 488.
- Hofmann, M., Klinkenberg, R. (2013). RapidMiner: Data Mining Use Cases and Business Analytics Applications. Chapman & Hall/CRC, 431.
- Kovács, F., Legány, C., Babos, A. (2006). Cluster Validity Measurement Techniques. Proceeding AIKED’06 Proceedings of the 5th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases.
- Rendón, E., Abundez, I., Arizmendi, A., Quiroz, I. M. (2011). Internal versus External cluster validation indexes. International journal of computers and communications, 1 (5), 25–34.
- Liu, Y., Li, Z., Xiong, H., Gao, X., Wu, J. (2010). Understanding of Internal Clustering Validation Measures. IEEE International Conference on Data Mining, 911–916. doi: 10.1109/icdm.2010.35
- 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
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2015 Volodymyr Mosorov, Sebastian Biedron, Taras Panskyi
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.