4.7 Article

An Improved Three-Way Clustering Based on Ensemble Strategy

Journal

MATHEMATICS
Volume 10, Issue 9, Pages -

Publisher

MDPI
DOI: 10.3390/math10091457

Keywords

ensemble clustering; three-way decision; three-way clustering; voting

Categories

Funding

  1. National Natural Science Foundation of China [62076111, 61906078]
  2. Key Laboratory of Oceanographic Big Data Mining and Application of Zhejiang Province [OBDMA202002]

Ask authors/readers for more resources

Three-way clustering shows the uncertainty information in a dataset by adding the concept of a fringe region. This paper introduces an improved three-way clustering algorithm that generates diverse base clustering results based on a feature subset of samples and traditional clustering algorithm. The proposed algorithm uses labels matching and voting method to obtain the core region and the fringe region of the three-way clustering.
As a powerful data analysis technique, clustering plays an important role in data mining. Traditional hard clustering uses one set with a crisp boundary to represent a cluster, which cannot solve the problem of inaccurate decision-making caused by inaccurate information or insufficient data. In order to solve this problem, three-way clustering was presented to show the uncertainty information in the dataset by adding the concept of fringe region. In this paper, we present an improved three-way clustering algorithm based on an ensemble strategy. Different to the existing clustering ensemble methods by using various clustering algorithms to produce the base clustering results, the proposed algorithm randomly extracts a feature subset of samples and uses the traditional clustering algorithm to obtain the diverse base clustering results. Based on the base clustering results, labels matching is used to align all clustering results in a given order and voting method is used to obtain the core region and the fringe region of the three way clustering. The proposed algorithm can be applied on the top of any existing hard clustering algorithm to generate the base clustering results. As examples for demonstration, we apply the proposed algorithm on the top of K-means and spectral clustering, respectively. The experimental results show that the proposed algorithm is effective in revealing cluster structures.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available