A Robust k-Means Type Algorithm for Soft Subspace Clustering and Its Application to Text Clustering

Tiantian Yang, Jun Wang

Abstract


Soft subspace clustering are effective clustering techniques for high dimensional datasets. In this work, a novel soft subspace clustering algorithm RSSKM are proposed. It is based on the incorporation of the alternative distance metric into the framework of k-means type algorithm for soft subspace clustering and can automatically calculates the feature weights of each cluster in the clustering process. The properties of RSSKM are also investigated. Experiments on real world text datasets are conducted and the results show that RSSKM outperformed some popular clustering algorithms for text mining, while still maintaining efficiency of the k-means clustering process.

Keywords


k-means, soft subspace clustering, text clustering

Full Text:

PDF


DOI: http://doi.org/10.11591/ijeecs.v12.i9.pp6993-6998

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

shopify stats IJEECS visitor statistics