115 search results - page 10 / 23 » Scalable Discovery of Best Clusters on Large Graphs |
CIKM
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
APNOMS
2007
Springer
13 years 11 months ago
2007
Springer
Network topology discovery for the large IP networks is a very well studied area of research. Most of the previous work focus on improving the efficiency in terms of time and compl...
LCN
2002
IEEE
14 years 12 days ago
2002
IEEE
It has become increasingly popular to construct large parallel computers by connecting many inexpensive nodes built with commercial-off-the-shelf (COTS) parts. These clusters can ...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We present a simple and scalable graph clustering method called power iteration clustering (PIC). PIC finds a very low-dimensional embedding of a dataset using truncated power ite...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We continue the line of research on graph compression started in [BV04], but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the app...