1013 search results - page 10 / 203 » Comparisons Between Data Clustering Algorithms |
ER
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
In many real-world applications, data cannot be accurately represented by vectors. In those situations, one possible solution is to rely on dissimilarity measures that enable a se...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
1 A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a dat...
KDD
2010
ACM
13 years 5 months ago
2010
ACM
One essential issue of document clustering is to estimate the appropriate number of clusters for a document collection to which documents should be partitioned. In this paper, we ...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
Projected clustering has become a hot research topic due to its ability to cluster high-dimensional data. However, most existing projected clustering algorithms depend on some cri...