Sciweavers

723 search results - page 9 / 145
» Learning a Hidden Subgraph
Sort
View
WWW
2009
ACM
14 years 8 months ago
Towards context-aware search by learning a very large variable length hidden markov model from search logs
Capturing the context of a user's query from the previous queries and clicks in the same session may help understand the user's information need. A context-aware approac...
Huanhuan Cao, Daxin Jiang, Jian Pei, Enhong Chen, ...
COLT
2004
Springer
14 years 25 days ago
Learning a Hidden Graph Using O(log n) Queries Per Edge
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
Dana Angluin, Jiang Chen
ICDAR
2009
IEEE
14 years 2 months ago
Learning Rich Hidden Markov Models in Document Analysis: Table Location
Hidden Markov Models (HMM) are probabilistic graphical models for interdependent classification. In this paper we experiment with different ways of combining the components of an ...
Ana Costa e Silva
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 7 months ago
Active Learning for Hidden Attributes in Networks
In many networks, vertices have hidden attributes that are correlated with the network's topology. For instance, in social networks, people are more likely to be friends if t...
Xiaoran Yan, Yaojia Zhu, Jean-Baptiste Rouquier, C...
ECCV
2006
Springer
14 years 9 months ago
Located Hidden Random Fields: Learning Discriminative Parts for Object Detection
This paper introduces the Located Hidden Random Field (LHRF), a conditional model for simultaneous part-based detection and segmentation of objects of a given class. Given a traini...
Ashish Kapoor, John M. Winn