Sciweavers

481 search results - page 18 / 97
» Learning relational probability trees
Sort
View
ENTCS
2007
123views more  ENTCS 2007»
13 years 7 months ago
Labelled Markov Processes as Generalised Stochastic Relations
Labelled Markov processes (LMPs) are labelled transition systems in which each transition has an associated probability. In this paper we present a universal LMP as the spectrum o...
Michael W. Mislove, Dusko Pavlovic, James Worrell
ICML
2006
IEEE
14 years 8 months ago
A graphical model for predicting protein molecular function
We present a simple statistical model of molecular function evolution to predict protein function. The model description encodes general knowledge of how molecular function evolve...
Barbara E. Engelhardt, Michael I. Jordan, Steven E...
ACL
2006
13 years 9 months ago
Trimming CFG Parse Trees for Sentence Compression Using Machine Learning Approaches
Sentence compression is a task of creating a short grammatical sentence by removing extraneous words or phrases from an original sentence while preserving its meaning. Existing me...
Yuya Unno, Takashi Ninomiya, Yusuke Miyao, Jun-ich...
ILP
2003
Springer
14 years 27 days ago
A Multi-relational Decision Tree Learning Algorithm - Implementation and Experiments
We describe an efficient implementation (MRDTL-2) of the Multi-relational decision tree learning (MRDTL) algorithm [23] which in turn was based on a proposal by Knobbe et al. [19] ...
Anna Atramentov, Hector Leiva, Vasant Honavar
ICDM
2008
IEEE
136views Data Mining» more  ICDM 2008»
14 years 2 months ago
Generalized Framework for Syntax-Based Relation Mining
Supervised approaches to Data Mining are particularly appealing as they allow for the extraction of complex relations from data objects. In order to facilitate their application i...
Bonaventura Coppola, Alessandro Moschitti, Daniele...