41 search results - page 3 / 9 » Clustering Large Attributed Graphs: An Efficient Incremental... |
NIPS
2008
14 years 11 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
103
click to vote
ICDM
2009
IEEE
14 years 7 months ago
2009
IEEE
We propose a hybrid clustering strategy by integrating heterogeneous information sources as graphs. The hybrid clustering method is extended on the basis of modularity based Louva...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
Link Analysis has been a popular and widely used Web mining technique, especially in the area of Web search. Various ranking schemes based on link analysis have been proposed, of ...
167
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...