The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Simultaneous feature selection and clustering using mixture models
Abstract
Clustering is a common unsupervised learning technique used to discover group structure in a set of data. While there exist many algorithms for clustering, the important issue of feature selection, that is, what attributes of the data should be used by the clustering algorithms, is rarely touched upon. Feature selection for clustering is difficult because, unlike in supervised learning, there are no class labels for the data and, thus, no obvious criteria to guide the search. Another important problem in clustering is the determination of the number of clusters, which clearly impacts and is influenced by the feature selection issue. In this paper, we propose the concept of feature saliency and introduce an expectation-maximization (EM) algorithm to estimate it, in the context of mixture-based clustering. Due to the introduction of a minimum message length model selection criterion, the saliency of irrelevant features is driven toward zero, which corresponds to performing feature selection. The criterion and algorithm are then extended to simultaneously estimate the feature saliencies and the number of clusters.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Rapid object detection using a boosted cascade of simple features
Viola, P., & Jones, M. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990517 · Cited by 18,300
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Self-citationEveritt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,168
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Statistical pattern recognition: a review
Jain, A. K., Duin, P. W., & Mao, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.824819 · Cited by 6,767
Self-citationAlgorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Abe, S. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0285-4 · Cited by 3,721
Selection of relevant features and examples in machine learning
Blum, A. L., & Langley, P. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00063-5 · Cited by 3,298
Floating search methods in feature selection
Pudil, P., Novovičová, J., & Kittler, J. (1994) · Pattern Recognition Letters · doi:10.1016/0167-8655(94)90127-9 · Cited by 3,098
Estimating attributes: Analysis and extensions of RELIEF
Kononenko, I. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-57868-4_57 · Cited by 2,958
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276314 · Cited by 2,412
X-means: Extending K-means with Efficient Estimation of the Number of Clusters
Pelleg, D., & Moore, A. (2000) · Cited by 2,245
Unsupervised texture segmentation using Gabor filters
Jain, A. K., & Farrokhnia, F. (1991) · Pattern Recognition · doi:10.1016/0031-3203(91)90143-s · Cited by 2,182
Self-citationFeature selection: evaluation, application, and small sample performance
Jain, A., & Zongker, D. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.574797 · Cited by 2,171
Self-citationUsing mutual information for selecting features in supervised neural net learning
Battiti, R. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.298224 · Cited by 2,148
Unsupervised learning of finite mixture models
Figueiredo, M. A. T., & Jain, A. K. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.990138 · Cited by 2,125
Self-citationMixture models : inference and applications to clustering
McLachlan, G. J., & Basford, K. E. (1988) · M. Dekker eBooks · Cited by 2,094
The feature selection problem: traditional methods and a new algorithm
Kira, K., & Rendell, L. A. (1992) · National Conference on Artificial Intelligence · Cited by 1,897
Toward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
Subset Selection in Regression
(2003) · Technometrics · doi:10.1198/tech.2003.s144 · Cited by 1,463
Unsupervised feature selection using feature similarity
Mitra, P., Murthy, C. A., & Pal, S. K. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.990133 · Cited by 1,460
Small sample size effects in statistical pattern recognition: Recommendations for practitioners
Raudys, S. J., & Jain, A. K. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.75512 · Cited by 1,384
Self-citationFeature subset selection using a genetic algorithm
Yang, J., & Honavar, V. (1998) · IEEE Intelligent Systems · doi:10.1109/5254.671091 · Cited by 1,362
Subset Selection in Regression
Miller, A. (2002) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420035933 · Cited by 929
Input feature selection by mutual information based on Parzen window
Kwak, N., & Choi, C.-H. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1114861 · Cited by 641
Feature selection for high-dimensional genomic microarray data
Xing, E. P., Jordan, M. I., & Karp, R. M. (2001) · Cited by 635
Image segmentation by clustering
Coleman, G. B., & Andrews, H. C. (1979) · Proceedings of the IEEE · doi:10.1109/proc.1979.11327 · Cited by 585
Caruana, R., & Freitag, D. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50012-x · Cited by 545
Estimation and Inference by Compact Coding
Wallace, C. S., & Freeman, P. R. (1987) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1987.tb01695.x · Cited by 523
A robust competitive clustering algorithm with applications in computer vision
Frigui, H., & Krishnapuram, R. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.765656 · Cited by 487
A Problem of Dimensionality: A Simple Example
Trunk, G. V. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766926 · Cited by 431
Feature selection for clustering - a filter solution
Dash, M., Choi, K., Scheuermann, P., & Liu, H. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1183893 · Cited by 383
Feature Weighting in k-Means Clustering
Modha, D. S., & Spangler, W. S. (2003) · Machine Learning · doi:10.1023/a:1024016609528 · Cited by 382
Variational Bayesian Model Selection for Mixture Distributions
Corduneanu, A., & Bishop, C. (2001) · Cited by 342
Feature selection in unsupervised learning via evolutionary search
Kim, Y., Street, W. N., & Menczer, F. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347169 · Cited by 288
Unsupervised feature selection applied to content-based retrieval of lung images
Dy, J. G., Brodley, C. E., Kak, A., Broderick, L. S., & Aisen, A. M. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1182100 · Cited by 255
DNA Microarrays and Gene Expression: From Experiments to Data Analysis and Modeling
Baldi, P., & Hatfield, G. W. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511541773 · Cited by 241
Cluster analysis in marketing research
Arabie, P. (1994) · Medical Entomology and Zoology · Cited by 236
Measures of Information and Their Applications.
Kapur, J. N. (1996) · Biometrics · doi:10.2307/2533186 · Cited by 236
Feature Subset Selection and Order Identification for Unsupervised Learning
Dy, J., & Brodley, C. E. (2000) · Cited by 234
MML clustering of multi-state, Poisson, von Mises circular and Gaussian distributions
Wallace, C. S., & Dowe, D. L. (2000) · Statistics and Computing · doi:10.1023/a:1008992619036 · Cited by 167
A Component-Wise EM Algorithm for Mixtures
Celeux, G., Chrétien, S., Forbes, F., & Mkhadri, A. (2001) · Journal of Computational and Graphical Statistics · doi:10.1198/106186001317243403 · Cited by 145
Feature selection from huge feature sets
Bins, J., & Draper, B. A. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2001.937619 · Cited by 140
Feature Selection in Clustering Problems
Röth, V., & Lange, T. (2003) · Cited by 140
A Feature-Based Approach to Market Segmentation Via Overlapping K-Centroids Clustering
Chaturvedi, A., Carroll, J. D., Green, P. E., & Rotondo, J. A. (1997) · Journal of Marketing Research · doi:10.1177/002224379703400306 · Cited by 111
Conceptual clustering in information retrieval
(1998) · doi:10.1109/3477.678640 · Cited by 84
Feature selection based on the approximation of class densities by finite mixtures of special type
Pudil, P., Novovičová, J., Choakjarernwanit, N., & Kittler, J. (1995) · Pattern Recognition · doi:10.1016/0031-3203(94)00009-b · Cited by 67
Dimensionality reduction in unsupervised learning of conditional Gaussian networks
Peña, J. M., Lozano, J. A., Larrañaga, P., & Inza, I. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.927460 · Cited by 65
Clustering very large databases using EM mixture models
Bradley, P. S., Fayyad, U. M., & Reina, C. (2002) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.2000.906021 · Cited by 57
Advances in Cluster Analysis Relevant to Marketing Research
Arabie, P., & Hubert, L. J. (1996) · Studies in classification, data analysis, and knowledge organization · doi:10.1007/978-3-642-79999-0_1 · Cited by 20
Cited by
A survey on feature selection methods
Chandrashekar, G., & Sahin, F. (2014) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2013.11.024 · Cited by 5,189
Unsupervised feature selection for multi-cluster data
Cai, D., Zhang, C., & He, X. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835848 · Cited by 1,112
MILES: Multiple-Instance Learning via Embedded Instance Selection
Chen, Y., Bi, J., & Wang, J. Z. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.248 · Cited by 752
A review of unsupervised feature selection methods
Solorio-Fernández, S., Carrasco-Ochoa, J. A., & Martínez-Trinidad, J. F. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-019-09682-y · Cited by 648
Model-based clustering of high-dimensional data: A review
Bouveyron, C., & Brunet-Saumard, C. (2014) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2012.12.008 · Cited by 467
Metadata
- Authors
- Law, M. H. C., Figueiredo, M. A. T., & Jain, A. K.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2004-09
- Volume
- 26
- Issue
- 9
- Pages
- 1154-1166
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2425246132
- Cited by
- 664
- References
- 54
- FWCI
- 28.13
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.