Diversity-Driven Widening of Hierarchical Agglomerative Clustering
نویسندگان
چکیده
In this paper we show that diversity-driven widening, the parallel exploration of the model space with focus on developing diverse models, can improve hierarchical agglomerative clustering. Depending on the selected linkage method, the model that is found through the widened search achieves a better silhouette coefficient than its sequentially built counterpart.
منابع مشابه
Hierarchical cluster ensemble selection
Clustering ensemble performance is affected by two main factors: diversity and quality. Selection of a subset of available ensemble members based on diversity and quality often leads to a more accurate ensemble solution. However, there is not a certain relationship between diversity and quality in selection of subset of ensemble members. This paper proposes the Hierarchical Cluster Ensemble Sel...
متن کاملDocument Retrieval using Hierarchical Agglomerative Clustering with Multi-view point Similarity Measure Based on Correlation: Performance Analysis
Clustering is one of the most interesting and important tool for research in data mining and other disciplines. The aim of clustering is to find the relationship among the data objects, and classify them into meaningful subgroups. The effectiveness of clustering algorithms depends on the appropriateness of the similarity measure between the data in which the similarity can be computed. This pap...
متن کاملImplementing Agglomerative hierarchical clustering using multiple attribute
Agglomerative hierarchical clustering algorithm used with top down approach. It implement with multiple attributes. In multiple attributes frequency calculation is allocated. Memory requirements are less in this process. Hierarchical clustering produce accurate result than any other algorithm. This is very less time consuming process.
متن کامل2 Review of Agglomerative Hierarchical Clustering Algorithms
Hierarchical methods are well known clustering technique that can be potentially very useful for various data mining tasks. A hierarchical clustering scheme produces a sequence of clusterings in which each clustering is nested into the next clustering in the sequence. Since hierarchical clustering is a greedy search algorithm based on a local search, the merging decision made early in the agglo...
متن کاملComparison of Agglomerative and Partitional Document Clustering Algorithms
Fast and high-quality document clustering algorithms play an important role in providing intuitive navigation and browsing mechanisms by organizing large amounts of information into a small number of meaningful clusters, and in greatly improving the retrieval performance either via cluster-driven dimensionality reduction, term-weighting, or query expansion. This ever-increasing importance of do...
متن کامل