|
| next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 1 of 6 found articles
| Title: |
Algorithms for clustering high dimensional and distributed data |
| Author: |
Tao Li Shenghuo Zhu Mitsunori Ogihara |
| Appeared in: |
Intelligent data analysis |
| Paging: | Volume 7 (2003) nr. 4 pages 305-326 |
| Year: |
2003-09-02 |
| Contents: |
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. The clustering problem has been widely studied in machine learning, databases, and statistics. This paper studies the problem of clustering high dimensional data. The paper proposes an algorithm called the CoFD algorithm, which is a non-distance based clustering algorithm for high dimensional spaces. Based on the Maximum Likelihood Principle, CoFD attempts to optimize its parameter settings to maximize the likelihood between data points and the model generated by the parameters. The distributed versions of the problem, called the D-CoFD algorithms, are also proposed. Experimental results on both synthetic and real data sets show the efficiency and effectiveness of CoFD and D-CoFD algorithms. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 1 of 6 found articles
| next >> |