A rough set based subspace clustering technique for high dimensional data
Subspace clustering aims at identifying subspaces for cluster formation so that the data is categorized in different perspectives. The conventional subspace clustering algorithms explore dense clusters in all the possible subspaces. These algorithms suffer from the curse of dimensionality. That is,...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2020-03-01
|
| Series: | Journal of King Saud University: Computer and Information Sciences |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S1319157817300654 |