4.6 Article

Choosing the number of clusters

出版社

WILEY PERIODICALS, INC
DOI: 10.1002/widm.15

关键词

-

资金

  1. Laboratory for Decision Choice and Analysis, Higher School of Economics, Moscow, Russian Federation

向作者/读者索取更多资源

The issue of determining 'the right number of clusters' is attracting ever growing interest. The paper reviews published work on the issue with respect to mixture of distributions, partition, especially in k-means clustering, and hierarchical cluster structures. Some perspective directions for further developments are outlined. (C) 2011 John Wiley & Sons, Inc. WIREs Data Mining Knowl Discov 2011 1 252- 260 DOI: 10.1002/widm.15

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Mathematics, Interdisciplinary Applications

Core Clustering as a Tool for Tackling Noise in Cluster Labels

Renato Cordeiro de Amorim, Vladimir Makarenkov, Boris Mirkin

JOURNAL OF CLASSIFICATION (2020)

Article Mathematics, Interdisciplinary Applications

Distance and Consensus for Preference Relations Corresponding to Ordered Partitions

Boris Mirkin, Trevor I. Fenner

JOURNAL OF CLASSIFICATION (2019)

Article Computer Science, Information Systems

Parsimonious generalization of fuzzy thematic sets in taxonomies applied to the analysis of tendencies of research in data science

Dmitry Frolov, Susana Nascimento, Trevor Fenner, Boris Mirkin

INFORMATION SCIENCES (2020)

Article Multidisciplinary Sciences

Least-squares community extraction in feature-rich networks using similarity data

Soroosh Shalileh, Boris Mirkin

Summary: In this study, a doubly-greedy approach was used for community detection in feature-rich networks. By converting feature-space data into similarity matrix format, four different algorithms were developed for automatic determination of the number of communities. Experimental results on real-world and synthetic datasets demonstrated the effectiveness and competitiveness of these algorithms.

PLOS ONE (2021)

Article Computer Science, Information Systems

Summable and nonsummable data-driven models for community detection in feature-rich networks

Soroosh Shalileh, Boris Mirkin

Summary: The study introduces a data-driven model for partitioning nodes in a network to approximate network link data and feature data, involving summary quantitative characteristics of both. The experiments show that the nonsummability version has its own niche and is faster than the other version.

SOCIAL NETWORK ANALYSIS AND MINING (2021)

Article Physics, Multidisciplinary

Community Partitioning over Feature-Rich Networks Using an Extended K-Means Method

Soroosh Shalileh, Boris Mirkin

Summary: This paper proposes a meaningful and effective extension of the K-means algorithm to detect communities in feature-rich networks. The method uses least-squares approximation to the inter-node links and feature values, resulting in a straightforward extension of the conventional K-means clustering method. The metric used is a weighted sum of squared Euclidean distances in both the feature and network spaces.

ENTROPY (2022)

Article Mathematics, Interdisciplinary Applications

Community Detection in Feature-Rich Networks Using Data Recovery Approach

Boris Mirkin, Soroosh Shalileh

Summary: The problem of community detection in a network with node features is addressed by applying the data recovery approach. The proposed method combines the least-squares recovery criteria for both the graph structure and node features, resulting in a new clustering criterion and algorithm. Experimental results on real-world and synthetic data demonstrate the effectiveness of the proposed method.

JOURNAL OF CLASSIFICATION (2022)

Proceedings Paper Computer Science, Artificial Intelligence

Novel Cluster Modeling for the Spatiotemporal Analysis of Coastal Upwelling

Susana Nascimento, Alexandre Martins, Paulo Relvas, Joaquim F. Luis, Boris Mirkin

Summary: This work proposes a spatiotemporal clustering approach using Core-Shell clustering algorithm to model coastal upwelling from satellite SST grid maps, enabling automated derivation of key parameters. Experiments show that the core-shell clustering accurately recognizes upwelling regions and presents consistent regularities across different upwelling seasons.

PROGRESS IN ARTIFICIAL INTELLIGENCE, EPIA 2022 (2022)

Proceedings Paper Computer Science, Interdisciplinary Applications

An Extension of K-Means for Least-Squares Community Detection in Feature-Rich Networks

Soroosh Shalileh, Boris Mirkin

Summary: We propose an extension of the K-means algorithm for community detection in feature-rich networks. By replacing the squared Euclidean distance with cosine distance, we effectively tackle the curse of dimensionality. Our experimental results show that the cosine distance-based version performs the best, especially on larger datasets.

COMPLEX NETWORKS & THEIR APPLICATIONS X, VOL 1 (2022)

Proceedings Paper Computer Science, Artificial Intelligence

A Data Recovery Method for Community Detection in Feature-Rich Networks

Soroosh Shalileh, Boris Mirkin

2020 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM) (2020)

Proceedings Paper Computer Science, Artificial Intelligence

Ordinal Equivalence Classes for Parallel Coordinates

Alexey Myachin, Boris Mirkin

INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2019, PT I (2019)

Proceedings Paper Computer Science, Artificial Intelligence

Computational Generalization in Taxonomies Applied to: (1) Analyze Tendencies of Research and (2) Extend User Audiences

Dmitry Frolov, Susana Nascimento, Trevor Fenner, Zina Taran, Boris Mirkin

INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING (IDEAL 2019), PT II (2019)

Proceedings Paper Computer Science, Information Systems

Deriving Corporate Social Responsibility Patterns in the MSCI Data

Zina Taran, Boris Mirkin

BUSINESS INFORMATION SYSTEMS, PT I (2019)

Proceedings Paper Computer Science, Artificial Intelligence

Method for Generalization of Fuzzy Sets

Dmitry Frolov, Boris Mirkin, Susana Nascimento, Trevor Fenner

ARTIFICIAL INTELLIGENCEAND SOFT COMPUTING, PT I (2019)

Proceedings Paper Computer Science, Artificial Intelligence

Braverman's Spectrum and Matrix Diagonalization Versus iK-Means: A Unified Framework for Clustering

Boris Mirkin

BRAVERMAN READINGS IN MACHINE LEARNING: KEY IDEAS FROM INCEPTION TO CURRENT STATE (2018)

暂无数据