Sciweavers

1246 search results - page 38 / 250
» High Performance Clustering Based on the Similarity Join
Sort
View
CN
2006
113views more  CN 2006»
14 years 9 months ago
Failure recovery for structured p2p networks: Protocol design and performance under churn
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured...
Simon S. Lam, Huaiyu Liu
ICTAI
2005
IEEE
15 years 3 months ago
Cellular Ants: Combining Ant-Based Clustering with Cellular Automata
This paper proposes a novel data clustering algorithm, coined ‘cellular ants’, which combines principles of cellular automata and ant colony optimization algorithms to group s...
Andrew Vande Moere, Justin James Clayden
CSB
2003
IEEE
150views Bioinformatics» more  CSB 2003»
15 years 3 months ago
Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
ISMIR
2005
Springer
206views Music» more  ISMIR 2005»
15 years 3 months ago
Improving Content-Based Similarity Measures by Training a Collaborative Model
We observed that for multimedia data – especially music - collaborative similarity measures perform much better than similarity measures derived from content-based sound feature...
Richard Stenzel, Thomas Kamps
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
15 years 10 months ago
Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
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...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...