247 search results - page 4 / 50 » On Finding Large Conjunctive Clusters |
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
SDM
2003
SIAM
13 years 9 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
VLDB
1998
ACM
13 years 11 months ago
1998
ACM
Many applications require the management of spatial data. Clustering large spatial databases is an important problem which tries to find the densely populated regions in the featu...
FGR
2004
IEEE
13 years 11 months ago
2004
IEEE
We present a new unsupervised learning technique for the discovery of temporal clusters in large data sets. Our method performs hierarchical decomposition of the data to find stru...