357 search results - page 37 / 72 » Fast Hypergraph Partition |
112
click to vote
ADBIS
1998
Springer
15 years 6 months ago
1998
Springer
Mining association rules is an important data mining problem. Association rules are usually mined repeatedly in different parts of a database. Current algorithms for mining associa...
164
click to vote
DMKD
1997
ACM
15 years 6 months ago
1997
ACM
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
135
click to vote
CATA
2000
15 years 3 months ago
2000
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
122
click to vote
ALT
2010
Springer
15 years 3 months ago
2010
Springer
: The ability to distinguish, differentiate and contrast between different data sets is a key objective in data mining. Such ability can assist domain experts to understand their d...
173
click to vote
JMLR
2012
13 years 4 months ago
2012
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model...