Work

A Regularization Framework for Learning from Graph Data

Year: 2004
Type: conference-paper
Abstract: The data in many real-world problems can be thought of as a graph, such as the web, co-author networks, and biological networks. We propose a general regularization framework on graphs, which is applicable to the classification, ranking, and link prediction problems. We also show that the method can be explained as lazy random walks. We evaluate the method on a number of experiments. 1.
Language: English
Open Access status: green
OpenAlex ID: W2140408177
FWCI: 3.495
Cites: 21
Cited by: 260
Related to: 9