—Analysis and modeling of wireless networks greatly depend on understanding the structure of underlying mobile nodes. In this paper we present two clustering algorithms to determ...
Yung-Chih Chen, Elisha J. Rosensweig, Jim Kurose, ...
Document clustering is a powerful technique that has been widely used for organizing data into smaller and manageable information kernels. Several approaches have been proposed...
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...
Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. Keywords Random Indexing, K-tree, Dimensionality Reduction, B-tree, Search T...
Christopher M. De Vries, Lance De Vine, Shlomo Gev...
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure prod...