Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2001
DOI: 10.1145/502512.502549
|View full text |Cite
|
Sign up to set email alerts
|

A robust and scalable clustering algorithm for mixed type attributes in large database environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
399
0
42

Year Published

2007
2007
2018
2018

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 515 publications
(442 citation statements)
references
References 6 publications
1
399
0
42
Order By: Relevance
“…To classify the different levels of CVCs' strategic and financial investment motivation, we employed cluster analysis to identify mutually exclusive segments of CVCs with a comparable investment motivation (Chiu et al 2001). The clustering method used is based on a two-step procedure, where subclusters are initially defined and subsequently merged until an optimal number of clusters is reached.…”
Section: Clustering Cvcs Based On Their Investment Motivationmentioning
confidence: 99%
“…To classify the different levels of CVCs' strategic and financial investment motivation, we employed cluster analysis to identify mutually exclusive segments of CVCs with a comparable investment motivation (Chiu et al 2001). The clustering method used is based on a two-step procedure, where subclusters are initially defined and subsequently merged until an optimal number of clusters is reached.…”
Section: Clustering Cvcs Based On Their Investment Motivationmentioning
confidence: 99%
“…This method is based on a distance measure that enables data with both categorical and continuous attributes to be clustered. This distance measure is derived from a probabilistic model in which the distance between two clusters is equivalent to the decrease in log-likelihood function as a result of merging (Chiu, Fang, Chen, Wang, & Jeris, 2001). …”
Section: Phase 2: Research Questionmentioning
confidence: 99%
“…The BIC is known as one of the most useful and objective selection criteria, because it essentially avoids the arbitrariness in traditional clustering techniques (Norusis, 2003). In addition, both background noise and outliers can be iden-tified and screened out in the algorithm (Chiu et al, 2001).…”
Section: Phase 2: Research Questionmentioning
confidence: 99%
“…The TURN* [4][2] algorithm locates the knee of a curve by location the point where the 2 nd derivative increases above a user specified threshold. A variant [2] of the BIRCH [23] algorithm uses a mixture of the Bayesian Information Criterion (BIC) and the ratio-change between inter-cluster distance and the number of clusters.…”
mentioning
confidence: 99%