paper-with-me

홈 › Papers

An agglomerative hierarchical clustering method by optimizing the average silhouette width

2019-09-26 · Fatima Batool

An agglomerative hierarchical clustering (AHC) framework and algorithm named HOSil based on a new linkage metric optimized by the average silhouette width (ASW) index is proposed. A conscientious investigation of various clustering methods and estimation indices is conducted across a diverse verities of data structures for three aims: a) clustering quality, b) clustering recovery, and c) estimation of number of clusters. HOSil has shown better clustering quality for a range of artificial and real world data structures as compared to k-means, PAM, single, complete, average, Ward, McQuitty, spectral, model-based, and several estimation methods. It can identify clusters of various shapes including spherical, elongated, relatively small sized clusters, clusters coming from different distributions including uniform, t, gamma and others. HOSil has shown good recovery for correct determination of the number of clusters. For some data structures only HOSil was able to identify the correct number of clusters.

📄 PDF Abstract BibTeX arXiv:1909.12356

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Similar Papers 제목 키워드 기반

Versatile linkage: a family of space-conserving strategies for agglomerative hierarchical clustering

2019-06-21 · Alberto Fernández, Sergio Gómez

Agglomerative hierarchical clustering can be implemented with several strategies that differ in the way elements of a collection are grouped together to build a hierarchy of clusters. Here we introduce versatile linkage,…

Clustering

Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time

2021-06-10 · Laxman Dhulipala, David Eisenstat, Jakub Łącki, Vahab Mirrokni 외

We study the widely used hierarchical agglomerative clustering (HAC) algorithm on edge-weighted graphs. We define an algorithmic framework for hierarchical agglomerative graph clustering that provides the first efficient…

ClusteringGraph Clustering

Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search

2017-12-01 · NeurIPS 2017 12 · Benjamin Moseley, Joshua Wang

Hierarchical clustering is a data analysis method that has been used for decades. Despite its widespread use, the method has an underdeveloped analytical foundation. Having a well understood foundation would both support…

Clustering

On the cohesion and separability of average-link for hierarchical agglomerative clustering

2024-11-07 · Eduardo Sany Laber, Miguel Bastista

Average-link is widely recognized as one of the most popular and effective methods for building hierarchical agglomerative clustering. The available theoretical analyses show that this method has a much better approximat…

Clustering

Enhancing Affinity Propagation for Improved Public Sentiment Insights

2024-10-12 · Mayimunah Nagayi, Clement Nyirenda

With the large amount of data generated every day, public sentiment is a key factor for various fields, including marketing, politics, and social research. Understanding the public sentiment about different topics can pr…

ClusteringDimensionality ReductionMarketingSentiment Analysis