1039 search results - page 132 / 208 » Kernels and Regularization on Graphs |
116
click to vote
AIRWEB
2008
Springer
15 years 1 months ago
2008
Springer
We present an algorithm, witch, that learns to detect spam hosts or pages on the Web. Unlike most other approaches, it simultaneously exploits the structure of the Web graph as we...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
We propose consensus propagation, an asynchronous distributed protocol for averaging numbers across a network. We establish convergence, characterize the convergence rate for regul...
109
click to vote
KDD
2005
ACM
16 years 8 days ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
160
click to vote
SIGMOD
2008
ACM
16 years 11 hour ago
2008
ACM
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...