47 search results - page 7 / 10 » Nonmonotonic inductive logic programming by instance pattern... |
111
Voted
JASIS
2000
15 years 4 days ago
2000
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
193
click to vote
POPL
2006
ACM
16 years 19 days ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
TLDI
2005
ACM
15 years 5 months ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
105
click to vote
KES
2008
Springer
15 years 9 days ago
2008
Springer
This paper presents ontology-based architecture for pattern recognition in the context of static source code analysis. The proposed system has three subsystems: parser, OWL ontolog...
95
Voted
AIMSA
2008
Springer
15 years 6 months ago
2008
Springer
Relational instance-based learning (RIBL) algorithms offer high prediction capabilities. However, they do not scale up well, specially in domains where there is a time bound for c...