Sciweavers

2252 search results - page 270 / 451
» A distributed machine learning framework
Sort
View
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 2 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
ICANN
2007
Springer
15 years 7 months ago
Structure Learning with Nonparametric Decomposable Models
Abstract. We present a novel approach to structure learning for graphical models. By using nonparametric estimates to model clique densities in decomposable models, both discrete a...
Anton Schwaighofer, Mathäus Dejori, Volker Tr...
109
Voted
ICGI
1998
Springer
15 years 5 months ago
Learning Stochastic Finite Automata from Experts
We present in this paper a new learning problem called learning distributions from experts. In the case we study the experts are stochastic deterministic finite automata (sdfa). W...
Colin de la Higuera
ICPR
2004
IEEE
16 years 1 months ago
A Probabilistic Approach to Learning Costs for Graph Edit Distance
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
Horst Bunke, Michel Neuhaus
85
Voted
EMNLP
2008
15 years 2 months ago
Soft-Supervised Learning for Text Classification
We propose a new graph-based semisupervised learning (SSL) algorithm and demonstrate its application to document categorization. Each document is represented by a vertex within a ...
Amarnag Subramanya, Jeff Bilmes