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...
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...
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...
We observed that for multimedia data – especially music - collaborative similarity measures perform much better than similarity measures derived from content-based sound feature...
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...