705 search results - page 36 / 141 » Proximity Cluster Trees |
BMCBI
2010
13 years 7 months ago
2010
Background: MapReduce is a parallel framework that has been used effectively to design largescale parallel applications for large computing clusters. In this paper, we evaluate th...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
Recently there has been an increasing interest in developing regression models for large datasets that are both accurate and easy to interpret. Regressors that have these properti...
GD
2004
Springer
14 years 1 months ago
2004
Springer
Compound-fisheye views are introduced as a method for the display and interaction with large graphs. The method relies on a hierarchical clustering of the graph, and a generalizat...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. Keywords Random Indexing, K-tree, Dimensionality Reduction, B-tree, Search T...