Sciweavers

1419 search results - page 115 / 284
» Approximation Methods for Supervised Learning
Sort
View
82
Voted
AAAI
2008
15 years 2 months ago
Latent Tree Models and Approximate Inference in Bayesian Networks
We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and wh...
Yi Wang, Nevin Lianwen Zhang, Tao Chen
97
Voted
IJCNN
2007
IEEE
15 years 6 months ago
Preference Learning for Category-Ranking based Interactive Text Categorization
— Category Ranking is a variant of the multi-label classification problem, in which, rather than performing a (hard) assignment to an object of categories from a predefined set...
Fabio Aiolli, Fabrizio Sebastiani, Alessandro Sper...
99
Voted
ACL
2007
15 years 2 months ago
A Seed-driven Bottom-up Machine Learning Framework for Extracting Relations of Various Complexity
A minimally supervised machine learning framework is described for extracting relations of various complexity. Bootstrapping starts from a small set of n-ary relation instances as...
Feiyu Xu, Hans Uszkoreit, Hong Li
86
Voted
EMNLP
2007
15 years 2 months ago
Learning to Merge Word Senses
It has been widely observed that different NLP applications require different sense granularities in order to best exploit word sense distinctions, and that for many applications ...
Rion Snow, Sushant Prakash, Daniel Jurafsky, Andre...
105
Voted
SEMWEB
2009
Springer
15 years 7 months ago
Actively Learning Ontology Matching via User Interaction
Ontology matching plays a key role for semantic interoperability. Many methods have been proposed for automatically finding the alignment between heterogeneous ontologies. However...
Feng Shi, Juanzi Li, Jie Tang, Guo Tong Xie, Hanyu...