Sciweavers

1340 search results - page 126 / 268
» Structure learning of Bayesian networks using constraints
Sort
View
144
Voted
ECML
2005
Springer
15 years 9 months ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...
135
Voted
NIPS
1997
15 years 5 months ago
Nonlinear Markov Networks for Continuous Variables
We address the problem of learning structure in nonlinear Markov networks with continuous variables. This can be viewed as non-Gaussian multidimensional density estimation exploit...
Reimar Hofmann, Volker Tresp
ICDIM
2008
IEEE
15 years 10 months ago
Unsupervised key-phrases extraction from scientific papers using domain and linguistic knowledge
The domain of Digital Libraries presents specific challenges for unsupervised information extraction to support both the automatic classification of documents and the enhancement ...
Mikalai Krapivin, Maurizio Marchese, Andrei Yadran...
MLMI
2007
Springer
15 years 10 months ago
Using Prosodic Features in Language Models for Meetings
Abstract. Prosody has been actively studied as an important knowledge source for speech recognition and understanding. In this paper, we are concerned with the question of exploiti...
Songfang Huang, Steve Renals
CVPR
2010
IEEE
15 years 9 months ago
Anatomical Parts-Based Regression Using Non-Negative Matrix Factorization
Non-negative matrix factorization (NMF) is an excellent tool for unsupervised parts-based learning, but proves to be ineffective when parts of a whole follow a specific pattern. ...
Swapna Joshi, Karthikeyan Shanmugavadivel, B.S. Ma...