Sciweavers

581 search results - page 17 / 117
» Fast Hierarchical Clustering Based on Compressed Data
Sort
View
SDM
2007
SIAM
152views Data Mining» more  SDM 2007»
13 years 11 months ago
HP2PC: Scalable Hierarchically-Distributed Peer-to-Peer Clustering
In distributed data mining models, adopting a flat node distribution model can affect scalability. To address the problem of modularity, flexibility and scalability, we propose...
Khaled M. Hammouda, Mohamed S. Kamel
PAMI
2008
197views more  PAMI 2008»
13 years 10 months ago
LEGClust - A Clustering Algorithm Based on Layered Entropic Subgraphs
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity meas...
Jorge M. Santos, Joaquim Marques de Sá, Lu&...
CJ
1998
118views more  CJ 1998»
13 years 9 months ago
Least-Squares Structuring, Clustering and Data Processing Issues
Approximation structuring clustering is an extension of what is usually called square-error clustering" onto various cluster structures and data formats. It appears to be not...
Boris Mirkin
SIGIR
1998
ACM
14 years 2 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
EOR
2007
110views more  EOR 2007»
13 years 10 months ago
A hierarchical ant based clustering algorithm and its use in three real-world applications
In this paper is presented a new model for data clustering, which is inspired from the selfassembly behavior of real ants. Real ants can build complex structures by connecting the...
Hanene Azzag, Gilles Venturini, Antoine Oliver, Ch...