A survey on feature weighting based K-means algorithms
From MaRDI portal
Publication:333337
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.
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
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3129892 (Why is no real title available?)
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 3793445 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1222269 (Why is no real title available?)
- scientific article; zbMATH DE number 3994794 (Why is no real title available?)
- scientific article; zbMATH DE number 3448387 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- 10.1162/153244303322753616
- A Novel Fuzzy C-Means Clustering Algorithm
- A feature group weighting method for subspace clustering of high-dimensional data
- A maximum likelihood methodology for clusterwise linear regression
- An optimization algorithm for clustering using weighted dissimilarity measures
- Clustering categorical data sets using tabu search techniques
- Clustering large graphs via the singular value decomposition
- Clustering. A data recovery approach.
- Computational methods in optimization. A unified approach.
- Constrained classification: The use of a priori information in cluster analysis
- Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm
- Direct reading algorithm for hierarchical clustering
- Feature weighting in \(k\)-means clustering
- Fuzzy sets
- NP-hardness of Euclidean sum-of-squares clustering
- Optimal variable weighting for ultrametric and additive trees and \(K\)-means partitioning: Methods and software.
- Selecting the Minkowski exponent for intelligent K-means with feature weighting
- Selection of variables in cluster analysis: An empirical comparison of eight procedures
- Synthesized clustering: A method for amalgamating alternative clustering bases with differential weighting of variables
- Weighting and selection of variables for cluster analysis
- Wrappers for feature subset selection
Cited in
(20)- 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
- The intersection of location-allocation, partitional clustering and model-based clustering techniques -- a review
- 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
- A clustering ensemble framework based on elite selection of weighted clusters
- Multiclass classification based on multi-criteria decision-making
- Feature-weighted clustering with inner product induced norm based dissimilarity measures: an optimization perspective
- A note on weighted fuzzy K-means clustering for concept decomposition
- Sample-weighted clustering methods
- 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
- Selecting the Minkowski exponent for intelligent K-means with feature weighting
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)
