Sciweavers

627 search results - page 103 / 126
» The Laplace-Jaynes approach to induction
Sort
View
ML
2006
ACM
131views Machine Learning» more  ML 2006»
14 years 10 months ago
Markov logic networks
We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge b...
Matthew Richardson, Pedro Domingos
112
Voted
ML
2000
ACM
154views Machine Learning» more  ML 2000»
14 years 10 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
88
Voted
AMAI
1999
Springer
14 years 10 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
118
Voted
DATAMINE
1999
152views more  DATAMINE 1999»
14 years 9 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen
92
Voted
SOFTWARE
2002
14 years 9 months ago
Temporal Probabilistic Concepts from Heterogeneous Data Sequences
We consider the problem of characterisation of sequences of heterogeneous symbolic data that arise from a common underlying temporal pattern. The data, which are subject to impreci...
Sally I. McClean, Bryan W. Scotney, Fiona Palmer