2009
DOI: 10.1007/s11518-009-5097-y
|View full text |Cite
|
Sign up to set email alerts
|

Efficient subspace clustering for higher dimensional data using fuzzy entropy

Abstract: In this paper we propose a novel method for identifying relevant subspaces using fuzzy entropy and perform clustering. This measure discriminates the real distribution better by using membership functions for measuring class match degrees. Hence the fuzzy entropy reflects more information in the actual distribution of patterns in the subspaces. We use a heuristic procedure based on the silhouette criterion to find the number of clusters. The presented theories and algorithms are evaluated through experiments o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
9
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(9 citation statements)
references
References 13 publications
0
9
0
Order By: Relevance
“…This algorithm was named as Entropy-Based Fuzzy Clustering (EFC). Palanisamy and Selvan (2009) developed an entropy-based fuzzy clustering method to identify relevant subspaces in the functional workspace. A heuristic method based on the Silhouette criterion was used to find the number of clusters.…”
Section: Literature Surveymentioning
confidence: 99%
“…This algorithm was named as Entropy-Based Fuzzy Clustering (EFC). Palanisamy and Selvan (2009) developed an entropy-based fuzzy clustering method to identify relevant subspaces in the functional workspace. A heuristic method based on the Silhouette criterion was used to find the number of clusters.…”
Section: Literature Surveymentioning
confidence: 99%
“…Fuzzy subsethood and entropy functions can be used in a variety of applications (image processing, feature selection, fuzzy classification, fuzzy controllers, fuzzy rules, similarity measures) and there are several presentations dealing with such measures (e.g., [7][8][9][10][11][12][13][14][15][16][17][18][19], to name a few after 2000). In [2], while examining the behavior of our measures, we saw that some of them had some interesting attributes which could offer additional information when specific applications are concerned.…”
Section: Introductionmentioning
confidence: 99%
“…The extended version of Shannon entropy is fuzzy entropy, which is non-probabilistic entropy [25]. It adopts a new term named matchdegree to estimate entropy value [26] [27]. Match degree satisfies the four properties of de Luca-Termini axioms [25] [27].…”
Section: Introductionmentioning
confidence: 99%
“…It adopts a new term named matchdegree to estimate entropy value [26] [27]. Match degree satisfies the four properties of de Luca-Termini axioms [25] [27]. The probability of the entropy is computed using the number of occurring terms.…”
Section: Introductionmentioning
confidence: 99%