2017
DOI: 10.1016/j.procs.2017.11.370
|View full text |Cite
|
Sign up to set email alerts
|

An Entropy based Method for Overlapping Subspace Clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…Figure 4 shows that this algorithm cannot identify better cluster groups or centroids when applied to the Dataset. This algorithm uses GKFK with entropy regularization [25]. Figure 5 shows the clustering procedure used to the specified Dataset if standardization is stand=1.…”
Section: Cluster Formation Using Variant Fuzzy Clustering Algorithmsmentioning
confidence: 99%
“…Figure 4 shows that this algorithm cannot identify better cluster groups or centroids when applied to the Dataset. This algorithm uses GKFK with entropy regularization [25]. Figure 5 shows the clustering procedure used to the specified Dataset if standardization is stand=1.…”
Section: Cluster Formation Using Variant Fuzzy Clustering Algorithmsmentioning
confidence: 99%
“…They claim that it can be applied for solving problems of frequent itemset mining and subspace clustering to enhance e±ciency and accuracy. Puri and Kumar (2017) present a subspace clustering method based on entropy and modi¯cation of Gustafson-Kessel clustering in which each cluster and its attributes are represented through gradation in memberships. A Transformation Invariant Subspace Clustering framework is proposed by Qi et al (2016), in which data samples are aligned so that they become highly correlated and then better similarity matrix can be obtained.…”
Section: Recent Related Workmentioning
confidence: 99%