Entropy Weighting K-Means for high-dimensional data analysis
Entropy Weighting K-Means (EWKM) clustering is a new k-means type algorithm for clustering high-dimensional objects in subspaces. In high dimensional data, clustering process to calculate a weight for each dimension in each cluster and use the weight values to identify the subsets of important dimen...
Saved in:
Main Author: | Leonel Rahman. |
---|---|
Other Authors: | Chen Lihui |
Format: | Final Year Project |
Language: | English |
Published: |
2010
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/39388 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Feature selection algorithms for very high dimensional data and mixed data
by: Tang, Wen Yin
Published: (2010) -
Robust feature selection for high-dimensional and small-sized gene expression data
by: Yang, Feng
Published: (2012) -
High-dimensional multi-view dataset pre-processing and clustering
by: Wei, Yaguang.
Published: (2012) -
Training algorithm design and weight convergence analysis for discrete-time recurrent neural networks
by: Xu, Zhao
Published: (2013) -
Proximity-based k-partitions clustering with ranking for document categorization and analysis
by: Mei, Jian-Ping, et al.
Published: (2015)