Sciweavers

220 search results - page 17 / 44
» Discovering Test Set Regularities in Relational Domains
Sort
View
FOSSACS
2000
Springer
15 years 1 months ago
On Recognizable Stable Trace Languages
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
Jean-François Husson, Rémi Morin
ML
2007
ACM
14 years 9 months ago
Feature space perspectives for learning the kernel
In this paper, we continue our study of learning an optimal kernel in a prescribed convex set of kernels, [18]. We present a reformulation of this problem within a feature space e...
Charles A. Micchelli, Massimiliano Pontil
BMCBI
2008
136views more  BMCBI 2008»
14 years 10 months ago
A comparison of machine learning algorithms for chemical toxicity classification using a simulated multi-scale data model
Background: Bioactivity profiling using high-throughput in vitro assays can reduce the cost and time required for toxicological screening of environmental chemicals and can also r...
Richard Judson, Fathi Elloumi, R. Woodrow Setzer, ...
CLA
2004
14 years 11 months ago
Ontology Design with Formal Concept Analysis
Ontologies, often defined as an explicit specification of conceptualization, are necessary for knowledge representation and knowledge exchange. Usually this means that ontology des...
Marek Obitko, Václav Snásel, Jan Smi...
JACM
2000
81views more  JACM 2000»
14 years 9 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin