Hierarchical clustering methods have exhibited extremely high performance in a wide variety of learning tasks. However, when processing today’s complex data sets they still face many challenges, such as the lack of the prior knowledge and difficulty in parameter tuning. In order
to solve these problems, this paper presents an effective hierarchical clustering algorithm called DMHC, which is based on the divide-and-merge methodology. In DMHC, a data set is first divided into some small homogeneous subsets called data blocks, and then the cluster hierarchy is built
according to the merging relationship of these data blocks. This approach needs less prior knowledge and its parameters can be easily tuned. It can not only effectively discover the clusters and the noises in a computationally efficient way, but also provide the cluster hierarchy. Experimental
results on several UCI and real world data sets demonstrate the effectiveness of the proposed algorithm.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
Document Type: Research Article
School of Mathematics and Computer Science, Gannan Normal University, Ganzhou 341000, P. R. China
Modern Education Technology Center, Gannan Normal University, Ganzhou 341000, P. R. China
Publication date: December 1, 2015
More about this publication?
Journal of Computational and Theoretical Nanoscience is an international peer-reviewed journal with a wide-ranging coverage, consolidates research activities in all aspects of computational and theoretical nanoscience into a single reference source. This journal offers scientists and engineers peer-reviewed research papers in all aspects of computational and theoretical nanoscience and nanotechnology in chemistry, physics, materials science, engineering and biology to publish original full papers and timely state-of-the-art reviews and short communications encompassing the fundamental and applied research.
- Editorial Board
- Information for Authors
- Submit a Paper
- Subscribe to this Title
- Terms & Conditions
- Ingenta Connect is not responsible for the content or availability of external websites