A survey on feature weighting based K-means algorithms
From MaRDI portal
Publication:333337
DOI10.1007/S00357-016-9208-4zbMATH Open1349.62291arXiv1601.03483OpenAlexW2238173180MaRDI QIDQ333337FDOQ333337
Publication date: 28 October 2016
Published in: Journal of Classification (Search for Journal in Brave)
Abstract: In a real-world data set there is always the possibility, rather high in our opinion, that different features may have different degrees of relevance. Most machine learning algorithms deal with this fact by either selecting or deselecting features in the data preprocessing phase. However, we maintain that even among relevant features there may be different degrees of relevance, and this should be taken into account during the clustering process. With over 50 years of history, K-Means is arguably the most popular partitional clustering algorithm there is. The first K-Means based clustering algorithm to compute feature weights was designed just over 30 years ago. Various such algorithms have been designed since but there has not been, to our knowledge, a survey integrating empirical evidence of cluster recovery ability, common flaws, and possible directions for future research. This paper elaborates on the concept of feature weighting and addresses these issues by critically analysing some of the most popular, or innovative, feature weighting mechanisms based in K-Means.
Full work available at URL: https://arxiv.org/abs/1601.03483
Recommendations
- Feature weighting in \(k\)-means clustering
- Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm
- Feature-weighted clustering with inner product induced norm based dissimilarity measures: an optimization perspective
- Further improvements in feature-weighted fuzzy C-means
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Clustering in the social and behavioral sciences (91C20)
Cites Work
- A feature group weighting method for subspace clustering of high-dimensional data
- Wrappers for feature subset selection
- Title not available (Why is that?)
- 10.1162/153244303322753616
- Title not available (Why is that?)
- NP-hardness of Euclidean sum-of-squares clustering
- Title not available (Why is that?)
- Fuzzy sets
- Title not available (Why is that?)
- Weighting and selection of variables for cluster analysis
- Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm
- Synthesized clustering: A method for amalgamating alternative clustering bases with differential weighting of variables
- Feature weighting in \(k\)-means clustering
- An optimization algorithm for clustering using weighted dissimilarity measures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A maximum likelihood methodology for clusterwise linear regression
- Clustering large graphs via the singular value decomposition
- Computational methods in optimization. A unified approach.
- Optimal variable weighting for ultrametric and additive trees and \(K\)-means partitioning: Methods and software.
- Clustering categorical data sets using tabu search techniques
- Clustering
- Title not available (Why is that?)
- Title not available (Why is that?)
- Direct reading algorithm for hierarchical clustering
- Selecting the Minkowski Exponent for Intelligent K-Means with Feature Weighting
- A Novel Fuzzy C-Means Clustering Algorithm
- Constrained classification: The use of a priori information in cluster analysis
- Selection of variables in cluster analysis: An empirical comparison of eight procedures
Cited In (14)
- Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm
- Feature weighting as a tool for unsupervised feature selection
- Feature weighting in \(k\)-means clustering
- Biconvex Clustering
- Modeling Decisions for Artificial Intelligence
- A data envelopment analysis-based clustering approach under dynamic situations
- Simultaneous variable weighting and determining the number of clusters -- a weighted Gaussian means algorithm
- On efficient model selection for sparse hard and fuzzy center-based clustering algorithms
- An ensemble feature ranking algorithm for clustering analysis
- Core clustering as a tool for tackling noise in cluster labels
- Cluster validation for mixtures of regressions via the total sum of squares decomposition
- Multiclass classification based on multi-criteria decision-making
- A Bayesian non-parametric approach for automatic clustering with feature weighting
- On the strong consistency of feature-weighted \(k\)-means clustering in a nearmetric space
Uses Software
This page was built for publication: A survey on feature weighting based K-means algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q333337)
