1385 search results - page 61 / 277 » Clustering by Random Projections |
113
click to vote
SIGMOD
2001
ACM
15 years 12 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
101
click to vote
KDD
2007
ACM
16 years 7 days ago
2007
ACM
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
ICML
2005
IEEE
16 years 19 days ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
SIGMOD
2003
ACM
15 years 12 months ago
2003
ACM
We describe the design and implementation of a new data layout scheme, called multi-dimensional clustering, in DB2 Universal Database Version 8. Many applications, e.g., OLAP and ...
PEWASUN
2005
ACM
15 years 5 months ago
2005
ACM
Scalability issues for routing in mobile ad hoc networks (MANETs) have been typically addressed using hybrid routing schemes operating in a hierarchical network architecture. Seve...