Sciweavers

243 search results - page 16 / 49
» On randomized representations of graphs using short labels
Sort
View
JMLR
2006
186views more  JMLR 2006»
13 years 7 months ago
Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples
We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised...
Mikhail Belkin, Partha Niyogi, Vikas Sindhwani
AIRWEB
2007
Springer
14 years 1 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla
ICCTA
2007
IEEE
13 years 11 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
ICTAI
2006
IEEE
14 years 1 months ago
Outlier Detection Using Random Walks
The discovery of objects with exceptional behavior is an important challenge from a knowledge discovery standpoint and has attracted much attention recently. In this paper, we pre...
H. D. K. Moonesinghe, Pang-Ning Tan
ICCV
2003
IEEE
14 years 9 months ago
Comparison of Graph Cuts with Belief Propagation for Stereo, using Identical MRF Parameters
Recent stereo algorithms have achieved impressive results by modelling the disparity image as a Markov Random Field (MRF). An important component of an MRF-based approach is the i...
Marshall F. Tappen, William T. Freeman