4.7 Article

Soft and hard hybrid balanced clustering with innovative qualitative balancing approach

Related references

Note: Only part of the references are listed.
Article Computer Science, Information Systems

Adaptive Explicit Kernel Minkowski Weighted K-means

Amir Aradnia et al.

Summary: The K-means algorithm is commonly used for data clustering, but it is limited to linear separable clusters. Kernel K-means extends this method to capture nonlinear structures without storing large kernel matrices, improving clustering efficiency.

INFORMATION SCIENCES (2022)

Article Computer Science, Information Systems

Strategic oscillation for the balanced minimum sum-of-squares clustering problem

R. Martin-Santamaria et al.

Summary: In the age of connectivity, the constant production of large amounts of data by every person requires effective analysis and extraction of relevant features. This paper proposes a method to divide a set of elements into equally-sized clusters and demonstrates its superiority through computational experiments.

INFORMATION SCIENCES (2022)

Article Computer Science, Information Systems

r-Reference points based k-means algorithm

Ching -Lin Wang et al.

Summary: This research proposes an r-reference points based k-means (r-RPKM) algorithm, which speeds up the clustering process by excluding distant cluster centers. Additionally, a maximal distance based initial cluster center (MDICC) decider is introduced to further improve the efficiency. Experimental results show that the r-RPKM algorithm is faster than the traditional k-means algorithm while producing the same clustering result.

INFORMATION SCIENCES (2022)

Article Computer Science, Artificial Intelligence

A hybrid reciprocal model of PCA and K-means with an innovative approach of considering sub-datasets for the improvement of K-means initialization and step-by-step labeling to create clusters with high interpretability

Seyed Alireza Mousavian Anaraki et al.

Summary: The study explores the relationship between K-means algorithm and PCA, proposing two new methods, K-P and P-K, to improve the interpretability and results of clustering by creating sub-datasets and applying step-by-step labeling. Experimental results on a human resource dataset show that P-K method outperforms K-P method in terms of interpretability and run time.

PATTERN ANALYSIS AND APPLICATIONS (2021)

Article Computer Science, Information Systems

Local interpretation of supervised learning models based on high dimensional model representation

Xiaohang Zhang et al.

Summary: A model-agnostic method based on high dimensional model representation (HDMR) is proposed to interpret supervised learning models by determining local feature contribution. Compared to existing methods, this approach can better consider feature dependence.

INFORMATION SCIENCES (2021)

Article Engineering, Electrical & Electronic

Balanced Clustering with a Tree over Clusters

M. Sh Levin

Summary: The article addresses balanced clustering with a spanning tree over clusters, useful in network applications. Different types of elements are considered with a focus on the cluster element structure. Based on a vector objective function, four heuristic solution strategies are suggested with four solution schemes of spanning-balancing strategy described along with a numerical illustrative example.

JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS (2021)

Article Computer Science, Theory & Methods

HQCA-WSN: High-quality clustering algorithm and optimal cluster head selection using fuzzy logic in wireless sensor networks

Amir Abbas Baradaran et al.

FUZZY SETS AND SYSTEMS (2020)

Article Computer Science, Artificial Intelligence

Enhanced Balanced Min Cut

Xiaojun Chen et al.

INTERNATIONAL JOURNAL OF COMPUTER VISION (2020)

Article Computer Science, Artificial Intelligence

Unsupervised feature selection for balanced clustering

Peng Zhou et al.

KNOWLEDGE-BASED SYSTEMS (2020)

Proceedings Paper Computer Science, Artificial Intelligence

An Empirical Evaluation of K-Means Clustering Algorithm Using Different Distance/Similarity Metrics

Manoj Kumar Gupta et al.

PROCEEDINGS OF ICETIT 2019: EMERGING TRENDS IN INFORMATION TECHNOLOGY (2020)

Article Multidisciplinary Sciences

Optimizing MSE for Clustering with Balanced Size Constraints

Wei Tang et al.

SYMMETRY-BASEL (2019)

Article Computer Science, Artificial Intelligence

A Local and Global Discriminative Framework and Optimization for Balanced Clustering

Junwei Han et al.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2019)

Article Computer Science, Information Systems

Secure big data communication for energy efficient intra-cluster in WSNs

Anxi Wang et al.

INFORMATION SCIENCES (2019)

Proceedings Paper Computer Science, Artificial Intelligence

Deep Density Clustering of Unconstrained Faces

Wei-An Lin et al.

2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR) (2018)

Article Computer Science, Information Systems

Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering

Leandro R. Costa et al.

INFORMATION SCIENCES (2017)

Article Engineering, Electrical & Electronic

On Balanced Clustering (Indices, Models, Examples)

M. Sh Levin

JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS (2017)

Article Computer Science, Artificial Intelligence

The MinMax k-Means clustering algorithm

Grigorios Tzortzis et al.

PATTERN RECOGNITION (2014)

Article Computer Science, Artificial Intelligence

Submodular fractional programming for balanced clustering

Yoshinobu Kawahara et al.

PATTERN RECOGNITION LETTERS (2011)

Article Computer Science, Artificial Intelligence

Data clustering with size constraints

Shunzhi Zhu et al.

KNOWLEDGE-BASED SYSTEMS (2010)

Article Computer Science, Artificial Intelligence

NP-hardness of Euclidean sum-of-squares clustering

Daniel Aloise et al.

MACHINE LEARNING (2009)

Article Computer Science, Information Systems

Load balancing for clusters of VOD servers

YF Huang et al.

INFORMATION SCIENCES (2004)

Article Computer Science, Artificial Intelligence

Frequency-sensitive competitive learning for scalable balanced clustering on high-dimensional hyperspheres

A Banerjee et al.

IEEE TRANSACTIONS ON NEURAL NETWORKS (2004)

Article Computer Science, Artificial Intelligence

Random forests

L Breiman

MACHINE LEARNING (2001)