hide
Free keywords:
-
Abstract:
We propose a general regularization framework for transductive
inference. The given data are thought of as a graph, where the
edges encode the pairwise relationships among data. We develop
discrete analysis and geometry on graphs, and then naturally adapt
the classical regularization in the continuous case to the graph
situation. A new and effective algorithm is derived from this
general framework, as well as an approach we developed before.
