Sciweavers

2714 search results - page 337 / 543
» Machine Learning for Information Extraction
Sort
View
ECML
2005
Springer
15 years 9 months ago
A Comparison of Approaches for Learning Probability Trees
Probability trees (or Probability Estimation Trees, PET’s) are decision trees with probability distributions in the leaves. Several alternative approaches for learning probabilit...
Daan Fierens, Jan Ramon, Hendrik Blockeel, Maurice...
138
Voted
ESWS
2008
Springer
15 years 5 months ago
Adding Data Mining Support to SPARQL Via Statistical Relational Learning Methods
Exploiting the complex structure of relational data enables to build better models by taking into account the additional information provided by the links between objects. We exten...
Christoph Kiefer, Abraham Bernstein, André ...
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 5 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
BICOB
2010
Springer
15 years 2 months ago
Multiple Kernel Learning for Fold Recognition
Fold recognition is a key problem in computational biology that involves classifying protein sharing structural similarities into classes commonly known as "folds". Rece...
Huzefa Rangwala
ECCV
2008
Springer
16 years 6 months ago
Training Hierarchical Feed-Forward Visual Recognition Models Using Transfer Learning from Pseudo-Tasks
Abstract. Building visual recognition models that adapt across different domains is a challenging task for computer vision. While feature-learning machines in the form of hierarchi...
Amr Ahmed, Kai Yu, Wei Xu, Yihong Gong, Eric P. Xi...