1241 search results - page 45 / 249 » On detecting space-time clusters |
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
In this paper, we present a measure associated with detection and inference of statistically anomalous clusters of a graph based on the likelihood test of observed and expected ed...
SIGIR
2006
ACM
15 years 3 months ago
2006
ACM
The performance of document clustering systems depends on employing optimal text representations, which are not only difficult to determine beforehand, but also may vary from one ...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
121
click to vote
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
JDCTA
2010
14 years 4 months ago
2010
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...