28 search results - page 3 / 6 » Learning Accurate, Compact, and Interpretable Tree Annotatio... |
DAGM
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Model-based image interpretation extracts high-level information from images using a priori knowledge about the object of interest. The computational challenge is to dete...
IJPRAI
2002
13 years 10 months ago
2002
Decision-tree algorithms are known to be unstable: small variations in the training set can result in different trees and different predictions for the same validation examples. B...
TSMC
2008
13 years 10 months ago
2008
Abstract-- This paper presents a method that uses gene ontologies, together with the paradigm of relational subgroup discovery, to find compactly described groups of genes differen...
FUZZIEEE
2007
IEEE
14 years 5 months ago
2007
IEEE
— DNA sequence basecalling is commonly regarded as a solved problem, despite significant error rates being reflected in inaccuracies in databases and genome annotations. This has...
JAIR
2010
13 years 9 months ago
2010
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...