Sciweavers

702 search results - page 7 / 141
» Learning Probabilistic Models of Relational Structure
Sort
View
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
15 years 1 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens
ACL
2011
14 years 4 months ago
In-domain Relation Discovery with Meta-constraints via Posterior Regularization
We present a novel approach to discovering relations and their instantiations from a collection of documents in a single domain. Our approach learns relation types by exploiting m...
Harr Chen, Edward Benson, Tahira Naseem, Regina Ba...
93
Voted
AIPS
2007
15 years 2 months ago
Discovering Relational Domain Features for Probabilistic Planning
In sequential decision-making problems formulated as Markov decision processes, state-value function approximation using domain features is a critical technique for scaling up the...
Jia-Hong Wu, Robert Givan
SAC
2006
ACM
15 years 6 months ago
Facial emotion recognition by adaptive processing of tree structures
We present an emotion recognition system based on a probabilistic approach to adaptive processing of Facial Emotion Tree Structures (FETS). FETS are made up of localized Gabor fea...
Jia-Jun Wong, Siu-Yeung Cho
114
Voted
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
15 years 7 months ago
Learning Preferences with Hidden Common Cause Relations
Abstract. Gaussian processes have successfully been used to learn preferences among entities as they provide nonparametric Bayesian approaches for model selection and probabilistic...
Kristian Kersting, Zhao Xu