Indexed by:
Abstract:
In recent years, the problem, which copes with high-dimensional data by the method of cluster analysis, has become a focus and difficulty in the field of artificial intelligence. 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. A novel soft subspace clustering with a multi-objective evolutionary approach (MOSSC) is proposed to this problem. First, two new objective function is constructed by minimizing the within-cluster compactness and maximizing the between-cluster separation based on the framework of soft subspace clustering algorithm. Based on this objective function, a new way of computing clusters’ feature weights, centers and membership is then derived by using Lagrange multiplier method. The properties of this algorithm are investigated and the performance is evaluated experimentally using UCI datasets. © 2018 Association for Computing Machinery.
Keyword:
Reprint Author's Address:
Email:
Source :
ACM International Conference Proceeding Series
ISSN: 9781450365291
Year: 2018
Publish Date: August 27, 2018
Language: English
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count: 1
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 5
Affiliated Colleges: