Abstract
The paper presents rough fuzzy subspace clustering algorithm and experimental results of clustering. In this algorithm three approaches for handling missing values are used: marginalisation, imputation and rough sets. The algorithm also assigns weights to attributes in each cluster; this leads to subspace clustering. The parameters of clusters are elaborated in the iterative procedure based on minimising of criterion function. The crucial parameter of the proposed algorithm is the parameter having the influence on the sharpness of elaborated subspace cluster. The lower values of the parameter lead to selection of the most important attribute. The higher values create clusters in the global space, not in subspaces. The paper is accompanied by results of clustering of synthetic and real life data sets.
| Original language | English |
|---|---|
| Pages (from-to) | 131-153 |
| Number of pages | 23 |
| Journal | Computing and Informatics |
| Volume | 33 |
| Issue number | 1 |
| Publication status | Published - 2014 |
Keywords
- Clustering
- Imputation
- Marginalisation
- Missing values
- Rough fuzzy subspace clustering
- Rough set
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'Rough fuzzy subspace clustering for data with missing values'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver