256 search results - page 15 / 52 » Sparse random graphs with clustering |
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
WAW
2009
Springer
14 years 2 months ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...