Sciweavers

91 search results - page 6 / 19
» Learning to Find Graph Pre-images
Sort
View
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 11 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
UIST
1994
ACM
14 years 1 months ago
Evolutionary Learning of Graph Layout Constraints from Examples
We propose a new evolutionary method of extracting user preferences from examples shown to an automatic graph layout system. Using stochastic methods such as simulated annealing a...
Toshiyuki Masui
EMNLP
2010
13 years 7 months ago
A Semi-Supervised Method to Learn and Construct Taxonomies Using the Web
Although many algorithms have been developed to harvest lexical resources, few organize the mined terms into taxonomies. We propose (1) a semi-supervised algorithm that uses a roo...
Zornitsa Kozareva, Eduard H. Hovy
NAACL
2010
13 years 7 months ago
Hitting the Right Paraphrases in Good Time
We present a random-walk-based approach to learning paraphrases from bilingual parallel corpora. The corpora are represented as a graph in which a node corresponds to a phrase, an...
Stanley Kok, Chris Brockett
NIPS
2008
13 years 11 months ago
Structure Learning in Human Sequential Decision-Making
We use graphical models and structure learning to explore how people learn policies in sequential decision making tasks. Studies of sequential decision-making in humans frequently...
Daniel Acuña, Paul R. Schrater