A clustering validity criteria-guided unsupervised sparse subset selection algorithm
Authors: 
Xiaobin Zhi, Qian Ren, Tongjun YuAuthors Info & Claims
Xiaobin Zhi, Qian Ren, Tongjun YuAuthors Info & ClaimsPages 1270 - 1275
Abstract
The newly proposed sparse subset selection (DS3) algorithm can effectively perform the clustering of data and the selection of representatives for each cluster (i.e. a subset of the entire data set) simultaneously. It can be formulated as a row-sparsity of membership matrix and minimizing coding loss problem. However, the regularization parameter in DS3 has a great impact on the performance of the algorithm. Different regularization parameter values will lead the algorithm to select a different number of representatives or clusters. However, for a given data set, which can have a definite number of classes, the DS3 algorithm can not automatically select the optimal regularization parameter. In view of this problem that DS3 has, noting that clustering validity criteria can be used to determine the number of clusters and the close relationship between the number of clusters and the value of the regularization parameter, we propose to use the clustering validity criteria to determine the optimal regularization parameter and thus propose an unsupervised DS3 (UDS3) algorithm that can automatically determine the regularization parameter. Compared with the original DS3 algorithm, the proposed UDS3 algorithm will give more constructive clustering results when the number of classes of the data set to be clustered is not given. Video summarization experiments on several Youtube data sets show the effectiveness of the proposed UDS3 algorithm.
References
[1]
Webb A R, Copsey K D, Cawley G. Statistical pattern recognition[M]. New York: wiley, 2011.
[2]
Bezdek J C, Keller J, Krisnapuram R, Fuzzy models and algorithms for pattern recognition and image processing[M]. Springer Science & Business Media, 1999.
[3]
Hartigan J A, Wong M A. Algorithm AS 136: A k-means clustering algorithm[J]. Journal of the royal statistical society. series c (applied statistics), 1979, 28(1): 100-108.
[4]
Rdusseeun L, Kaufman P. Clustering by means of medoids[C]//Proceedings of the statistical data analysis based on the norm conference, neuchatel, switzerland. 1987, 31.
[5]
Frey B J, Dueck D. Clustering by passing messages between data points[J]. science, 2007, 315(5814): 972-976.
[6]
Elhamifar E, Sapiro G, Sastry S S. Dissimilarity-based sparse subset selection[J]. IEEE transactions on pattern analysis and machine intelligence, 2015, 38(11): 2182-2197.
[7]
Boyd S, Parikh N, Chu E, Distributed optimization and statistical learning via the alternating direction method of multipliers[J]. Foundations and Trends® in Machine learning, 2011, 3(1): 1-122.
[8]
Wang H, Kawahara Y, Weng C, Representative selection with structured sparsity[J]. Pattern Recognition, 2017, 63: 268-278.
[9]
Zhang X, Zhu Z, Zhao Y, Seeing All From a Few: -Norm-Induced Discriminative Prototype Selection[J]. IEEE transactions on neural networks and learning systems, 2018, 30(7): 1954-1966.
[10]
Zhao J, Yi S, Liang Y, Robust active representation via -norm constraints[J]. Knowledge-Based Systems, 2022, 235: 107639.
[11]
Rousseeuw P J. Silhouettes: a graphical aid to the interpretation and validation of cluster analysis[J]. Journal of computational and applied mathematics, 1987, 20: 53-65.
[12]
Davies D L, Bouldin D W. A cluster separation measure[J]. IEEE transactions on pattern analysis and machine intelligence, 1979 (2): 224-227.
[13]
Caliński T, Harabasz J. A dendrite method for cluster analysis[J]. Communications in Statistics-theory and Methods, 1974, 3(1): 1-27.
[14]
Krzanowski W J, Lai Y T. A criterion for determining the number of groups in a data set using sum-of-squares clustering[J]. Biometrics, 1988: 23-34.
[15]
De Avila S E F, Lopes A P B, da Luz Jr A, VSUMM: A mechanism designed to produce static video summaries and a novel evaluation method[J]. Pattern recognition letters, 2011, 32(1): 56-68.
[16]
Lazebnik S, Schmid C, Ponce J. Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories[C]//2006 IEEE computer society conference on computer vision and pattern recognition (CVPR'06). IEEE, 2006, 2: 2169-2178.
Index Terms
- A clustering validity criteria-guided unsupervised sparse subset selection algorithm
Recommendations
An improved unsupervised clustering algorithm based on population Markov chain
GA-based clustering approaches have the advantage of automatically determining the optimal number of clusters. In a previous work, we proposed an efficient GA-based clustering algorithm, the PMCC method, and compared it with a representative GA-based ...
A comparative study of unsupervised image clustering systems
The purpose of clustering algorithms is to give sense and extract value from large sets of structured and unstructured data. Thus, clustering is present in all science areas that use automatic learning. Therefore, we present in this paper a comparative ...
A unifying criterion for unsupervised clustering and feature selection
Exploratory data analysis methods are essential for getting insight into data. Identifying the most important variables and detecting quasi-homogenous groups of data are problems of interest in this context. Solving such problems is a difficult task, ...
Comments
Information & Contributors
Information
Published In
September 2023
1540 pages
ISBN:9798400707674
DOI:10.1145/3641584
Copyright © 2023 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 14 June 2024
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
AIPR 2023
AIPR 2023: 2023 6th International Conference on Artificial Intelligence and Pattern Recognition
September 22 - 24, 2023
Xiamen, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 7Total Downloads
- Downloads (Last 12 months)7
- Downloads (Last 6 weeks)2
Reflects downloads up to 07 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format