2006
DOI: 10.1007/11811305_38
|View full text |Cite
|
Sign up to set email alerts
|

Clustering Mixed Data Based on Evidence Accumulation

Abstract: Abstract. An Evidence-Based Spectral Clustering (EBSC) algorithm that works well for data with mixed numeric and nominal features is presented. A similarity measure based on evidence accumulation is adopted to define the similarity measure between pairs of objects, which makes no assumptions of the underlying distributions of the feature values. A spectral clustering algorithm is employed on the similarity matrix to extract a partition of the data. The performance of EBSC has been studied on real data sets. Re… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 26 publications
(11 citation statements)
references
References 9 publications
0
11
0
Order By: Relevance
“…For scalable clustering of mixed data, orthogonal partitioning clustering algorithm [13] was introduced which was later extended by the authors in [14] for the purpose of clustering large databases with numeric and nominal values using orthogonal projections. To achieve a similar objective, a fuzzy clustering algorithm [15] based on probabilistic distance feature, an agglomerative algorithm based on distinctness heuristics as well as the Evidence Based Spectral Clustering (EBSC) algorithm [16] based on evidence accumulation were introduced in the recent past. On the other hand, authors in [17] introduced three different distance measure functions based on Mahalanobis-type distance measure for the efficient analysis of mixed data.…”
Section: Related Workmentioning
confidence: 99%
“…For scalable clustering of mixed data, orthogonal partitioning clustering algorithm [13] was introduced which was later extended by the authors in [14] for the purpose of clustering large databases with numeric and nominal values using orthogonal projections. To achieve a similar objective, a fuzzy clustering algorithm [15] based on probabilistic distance feature, an agglomerative algorithm based on distinctness heuristics as well as the Evidence Based Spectral Clustering (EBSC) algorithm [16] based on evidence accumulation were introduced in the recent past. On the other hand, authors in [17] introduced three different distance measure functions based on Mahalanobis-type distance measure for the efficient analysis of mixed data.…”
Section: Related Workmentioning
confidence: 99%
“…However, doing this does not reveal the original similarity structure of the data sets. In [27], an Evidence-Based Spectral Clustering algorithm is proposed for mixed data by integrating the evidence-based similarity measure into spectral clustering structure. The algorithm [28] assumes a classical finite mixture distribution model on mixed data and utilizes a Bayesian model to derive the most probable class distribution for the data given with prior information.…”
Section: Related Workmentioning
confidence: 99%
“…Improved k-prototypes [16] can cluster incomplete mixed-type data directly and eliminate the sensitivity of initial prototypes. Evidence-Based Spectral Clustering algorithm [17] integrates the spectral clustering frame and evidence-based similarity computation method to cluster mixed-type data. Moreover, some similarity or dissimilarity of mixed-type data was proposed.…”
Section: Mixed-type Data Clustering Algorithmsmentioning
confidence: 99%