A feature group weighting method for subspace clustering of high-dimensional data
DOI10.1016/J.PATCOG.2011.06.004zbMATH Open1225.68162OpenAlexW2044080809MaRDI QIDQ139002FDOQ139002
Authors: Xiaojun Chen, Yunming Ye, Xiaofei Xu, Joshua Zhexue Huang, Xiaojun Chen, Yunming Ye, Xiao-Fei Xu, Joshua Zhexue Huang
Publication date: January 2012
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2011.06.004
Recommendations
- Subspace clustering with automatic feature grouping
- scientific article; zbMATH DE number 6961881
- Reliability-based regularized weighted soft \(k\)-means algorithm for subspace clustering
- scientific article; zbMATH DE number 5951453
- A novel soft subspace clustering algorithm with noise detection for high dimensional datasets
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Cites Work
- Clustering Objects on Subsets of Attributes (with Discussion)
- High-dimensional data clustering
- 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
- Enhanced soft subspace clustering integrating within-cluster and between-cluster information
- Model-based subspace clustering
Cited In (16)
- Feature interaction in subspace clustering using the Choquet integral
- Unsupervised feature selection with ensemble learning
- A general framework for subspace detection in unordered multidimensional data
- Weighted random subspace method for high dimensional data classification
- Reliability-based regularized weighted soft \(k\)-means algorithm for subspace clustering
- Novel soft subspace clustering with multi-objective evolutionary approach for high-dimensional data
- Transfer learning-assisted multi-objective evolutionary clustering framework with decomposition for high-dimensional data
- Robust and sparse \(k\)-means clustering for high-dimensional data
- A survey on feature weighting based K-means algorithms
- Distance metric learning for soft subspace clustering in composite kernel space
- wskm
- Enhanced balanced min cut
- Subspace clustering with automatic feature grouping
- A survey on soft subspace clustering
- A novel soft subspace clustering algorithm with noise detection for high dimensional datasets
- Enhanced soft subspace clustering through hybrid dissimilarity
Uses Software
This page was built for publication: A feature group weighting method for subspace clustering of high-dimensional data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q139002)