Sciweavers

194 search results - page 7 / 39
» Learning whom to trust: using graphical models for learning ...
Sort
View
AAAI
2011
12 years 7 months ago
Using Semantic Cues to Learn Syntax
We present a method for dependency grammar induction that utilizes sparse annotations of semantic relations. This induction set-up is attractive because such annotations provide u...
Tahira Naseem, Regina Barzilay
ICML
2009
IEEE
14 years 8 months ago
Learning from measurements in exponential families
Given a model family and a set of unlabeled examples, one could either label specific examples or state general constraints--both provide information about the desired model. In g...
Percy Liang, Michael I. Jordan, Dan Klein
CHI
2009
ACM
14 years 8 months ago
Why and why not explanations improve the intelligibility of context-aware intelligent systems
Context-aware intelligent systems employ implicit inputs, and make decisions based on complex rules and machine learning models that are rarely clear to users. Such lack of system...
Brian Y. Lim, Anind K. Dey, Daniel Avrahami
JMLR
2012
11 years 9 months ago
Structured Output Learning with High Order Loss Functions
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
Daniel Tarlow, Richard S. Zemel
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 8 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro