Sciweavers

18 search results - page 4 / 4
» Finding Most Probable Worlds of Probabilistic Logic Programs
Sort
View
BMCBI
2005
124views more  BMCBI 2005»
13 years 6 months ago
Probabilistic annotation of protein sequences based on functional classifications
: One of the most evident achievements of bioinformatics is the development of methods that transfer biological knowledge from characterised proteins to uncharacterised sequences. ...
Emmanuel D. Levy, Christos A. Ouzounis, Walter R. ...
AGI
2008
13 years 7 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov
KDD
2007
ACM
141views Data Mining» more  KDD 2007»
14 years 6 months ago
Detecting anomalous records in categorical datasets
We consider the problem of detecting anomalies in high arity categorical datasets. In most applications, anomalies are defined as data points that are 'abnormal'. Quite ...
Kaustav Das, Jeff G. Schneider