Sciweavers

412 search results - page 56 / 83
» Bootstrapping Rule Induction
Sort
View
AAAI
1994
13 years 11 months ago
Inducing Deterministic Prolog Parsers from Treebanks: A Machine Learning Approach
or untagged treebanks. ' When trained on an untagged This paper presents a method for constructing deterministic Prolog parsers from corpora of parsed sentences. Our approach ...
John M. Zelle, Raymond J. Mooney
RAID
1999
Springer
14 years 2 months ago
Combining Knowledge Discovery and Knowledge Engineering to Build IDSs
We have been developing a data mining (i.e., knowledge discovery) framework, MADAM ID, for Mining Audit Data for Automated Models for Intrusion Detection [LSM98, LSM99b, LSM99a]. ...
Wenke Lee, Salvatore J. Stolfo
ICML
2006
IEEE
14 years 11 months ago
Using query-specific variance estimates to combine Bayesian classifiers
Many of today's best classification results are obtained by combining the responses of a set of base classifiers to produce an answer for the query. This paper explores a nov...
Chi-Hoon Lee, Russell Greiner, Shaojun Wang
IIE
2006
101views more  IIE 2006»
13 years 10 months ago
Random Factors in IOI 2005 Test Case Scoring
We examine the precision with which the cumulative score from a suite of test cases ranks participants in the International Olympiad in Informatics (IOI). Our concern is the abilit...
Gordon V. Cormack
POPL
2008
ACM
14 years 10 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...