960 search results - page 14 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
191
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
DEXA
2008
Springer
15 years 1 months ago
2008
Springer
The paper presents a novel method for compressing large database workloads for purpose of autonomic, continuous index selection. The compressed workload contains a small subset of ...
PAMI
2010
14 years 10 months ago
2010
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
123
click to vote
DEXA
2010
Springer
15 years 24 days ago
2010
Springer
Abstract. The problems of finding alternative clusterings and avoiding bias have gained popularity over the last years. In this paper we put the focus on the quality of these alter...
ISBRA
2007
Springer
15 years 5 months ago
2007
Springer
Clustering algorithms are employed in many bioinformatics tasks, including categorization of protein sequences and analysis of gene-expression data. Although these algorithms are r...