A modified multilevel approach to the dynamic hierarchical clustering for complex types of shapes
DOI:
https://doi.org/10.15587/1729-4061.2012.3908Keywords:
Chameleon, data mining, clusteringAbstract
In this paper we present a modified hierarchical clustering algorithm that used the main idea of Chameleon and the effectiveness of suggested approach will be demonstrated by the experimental resultsReferences
- Alpert, C. J. Multilevel circuit partitioning [Text] / C. J. Alpert, J. H. Huang, A. B. Kahng // 34th ACM/IEEE Design Automation Conference – Anaheim, 1997 – pp. 530-533 .
- Guha S. ROCK: Robust Clustering using links [Text] / S. Guha, R. Rastogi, K. Shim // Proceedings of the International Conference on Data Engineering ICDE'99 – San Diego, 1999.
- Karypis G. Multilevel hypergraph partitioning: Application in VLSI domain [Text] / G. Karypis , R. Aggarwal, V. Kumar, Sh. Shekhar // Proceedings of the Design and Automation Conference – 1997.
- Karypis G. hMETIS 1.5.3: A hypergraph partitioning package .Technical report [Text] / G. Karypis V. Kumar // Department of Computer Science, University of Minnesota –1998.
- Karypis G. CHAMELEON: A Hierarchical Clustering Algorithms Using Dynamic Modeling [Text] / G. Karypis, E.-H. Han, V. Kumar // IEEE Computer – 1999 – 32(8) – pp. 68- 75.
- Karypis G. Multilevel k-way hypergraph partitioning [Text]/ G. Karypis, V. Kumar // Proceedings of the Design and Automation Conference –1999.
- Karypis G. CLUTO 2.1.1. A Clustering Toolkit. Technical report [Text] // Department of Computer Science, University of Minnesota – 2003.
- Computer Science & Engineering [Electronic resource] – Access mode : WWW/ URL: http://www.cs.umn.edu/˜karypis – Title from the screen.
- Mitchell T. M. Machine Learning [Text] / T. M. Mitchell – McGraw Hill, 1997 – 414 p.
- Zhang T. BIRCH: an efficient data clustering method for very large databases/ T. Zhang, R. Ramakrishnan, M. Livny// SIGMOD'96 – 1996 – pp. 103-114
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2014 Tetyana Shatovska, Oksana Onoprienko, Artem Fedorov
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.