30 search results - page 5 / 6 » Online Structural Graph Clustering Using Frequent Subgraph M... |
WWW
2010
ACM
14 years 2 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Improving the precision of information retrieval has been a challenging issue on Chinese Web. As exemplified by Chinese recipes on the Web, it is not easy/natural for people to us...
KAIS
2011
13 years 2 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
IPPS
2008
IEEE
14 years 1 months ago
2008
IEEE
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...