Sciweavers

1351 search results - page 9 / 271
» An Analysis of Inference with the Universum
Sort
View
COGSCI
2008
75views more  COGSCI 2008»
14 years 8 months ago
Exemplars, Prototypes, Similarities, and Rules in Category Representation: An Example of Hierarchical Bayesian Analysis
This article demonstrates the potential of using hierarchical Bayesian methods to relate models and data in the cognitive sciences. This is done using a worked example that consid...
Michael D. Lee, Wolf Vanpaemel
LPAR
2001
Springer
15 years 2 months ago
Inferring Termination Conditions for Logic Programs Using Backwards Analysis
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
Samir Genaim, Michael Codish
ILP
2007
Springer
15 years 3 months ago
Bias/Variance Analysis for Relational Domains
Bias/variance analysis is a useful tool for investigating the performance of machine learning algorithms. Conventional analysis decomposes loss into errors due to aspects of the le...
Jennifer Neville, David Jensen
73
Voted
IJCAT
2010
93views more  IJCAT 2010»
14 years 8 months ago
FAETON: Form Analysis and Extraction Tool for ONtology construction
Abstract: This paper presents a method for semi-automatically building tailored application ontologies from a set of data acquisition forms. Such ontologies are intended to facilit...
Rafael Berlanga Llavori, Ernesto Jiménez-Ru...
SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
15 years 2 months ago
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
Frédéric Mesnard, Ulrich Neumerkel