Name
Abstract | ||
|---|---|---|
The transitive closure method is one of the most frequently used fuzzy clustering techniques. It has O(n3log2n) time complexity and O(n2) space complexity for matrix compositions while building transitive closures. These drawbacks limit its further applications to large-scale databases. In this paper, we proposed a fast fuzzy clustering algorithm to avoid matrix multiplications and gave a principle, where the clustering results were directly obtained from the λ-cut of the fuzzy similar relation of objects. Moreover, it was dispensable to compute and store the similar matrix of objects beforehand. The time complexity of the presented algorithm is O(n2) at most and the space complexity is O(1). Theoretical analysis and experiments demonstrate that although the new algorithm is equivalent to the transitive closure method, the former is more suitable to treat large-scale datasets because of its high computing efficiency. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11527503_24 | ADMA |
Keywords | Field | DocType |
matrix composition,transitive closure method,matrix multiplication,fuzzy similar relation,new algorithm,clustering result,fuzzy clustering technique,fast fuzzy clustering algorithm,time complexity,space complexity,large-scale datasets,fuzzy clustering,transitive closure | Fuzzy clustering,Canopy clustering algorithm,CURE data clustering algorithm,Correlation clustering,Computer science,Algorithm,FLAME clustering,Transitive closure,Time complexity,Cluster analysis | Conference |
Volume | ISSN | ISBN |
3584 | 0302-9743 | 3-540-27894-X |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
2 | ||