960 search results - page 45 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
161
Voted
BMCBI
2010
15 years 1 months ago
2010
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...
197
Voted
VLDB
1999
ACM
1999
ACM
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
15 years 8 months ago
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
254
Voted
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
128
Voted
BTW
2007
Springer
2007
Springer
TopX - Efficient and Versatile Top-k Query Process-ing for Text, Semistructured, and Structured Data
15 years 7 months ago
: This paper presents a comprehensive overview of the TopX search engine, an extensive framework for unified indexing and querying large collections of unstructured, semistructured...
130
Voted
CSCLP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...