Sciweavers

104 search results - page 9 / 21
» An Improved Random Neighborhood Graph Approach
Sort
View
EMNLP
2010
14 years 7 months ago
Efficient Graph-Based Semi-Supervised Learning of Structured Tagging Models
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...
Amarnag Subramanya, Slav Petrov, Fernando Pereira
MSWIM
2006
ACM
15 years 3 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
EMNLP
2011
13 years 9 months ago
Random Walk Inference and Learning in A Large Scale Knowledge Base
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
Ni Lao, Tom M. Mitchell, William W. Cohen
78
Voted
ICTAI
2006
IEEE
15 years 3 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
CVPR
2012
IEEE
13 years 19 hour ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould