Name
Title | ||
|---|---|---|
Novel soft subspace clustering with multi-objective evolutionary approach for high-dimensional data |
Abstract | ||
|---|---|---|
Many conventional soft subspace clustering techniques merge several criteria into a single objective to improve performance; however, the weighting parameters become important but difficult to set. In this paper, a novel soft subspace clustering with a multi-objective evolutionary approach (MOEASSC) is proposed to this problem. This clustering method considers two types of criteria as multiple objectives and optimizes them simultaneously by using a modified multi-objective evolutionary algorithm with new encoding and operators. An indicator called projection similarity validity index (PSVIndex) is designed to select the best solution and cluster number. Experiments on many datasets demonstrate the usefulness of MOEASSC and PSVIndex, and show that our algorithm is insensitive to its parameters and is scalable to large datasets. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.patcog.2013.02.005 | Pattern Recognition |
Keywords | Field | DocType |
high-dimensional data,modified multi-objective evolutionary algorithm,multiple objective,best solution,new encoding,cluster number,conventional soft subspace,multi-objective evolutionary approach,large datasets,clustering method,novel soft subspace | Data mining,Fuzzy clustering,CURE data clustering algorithm,Artificial intelligence,Cluster analysis,Canopy clustering algorithm,Clustering high-dimensional data,Data stream clustering,Pattern recognition,Correlation clustering,Constrained clustering,Mathematics,Machine learning | Journal |
Volume | Issue | ISSN |
46 | 9 | 0031-3203 |
Citations | PageRank | References |
14 | 0.51 | 41 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hu Xia | 1 | 40 | 1.52 |
| Jian Zhuang | 2 | 104 | 15.09 |
| Dehong Yu | 3 | 42 | 3.41 |