Sciweavers

436 search results - page 23 / 88
» Lightweight Rule Induction
Sort
View
112
Voted
ICANN
2003
Springer
15 years 8 months ago
Learning Rule Representations from Boolean Data
We discuss a Probably Approximate Correct (PAC) learning paradigm for Boolean formulas, which we call PAC meditation, where the class of formulas to be learnt is not known in advan...
Bruno Apolloni, Andrea Brega, Dario Malchiodi, Gio...
135
Voted
ICRE
2000
IEEE
15 years 7 months ago
A Lightweight Approach to Consistency of Scenarios and Class Models
Today, object-oriented requirements specifications typically combine a scenario (or use case) model and a class model for expressing functional requirements. With any such combina...
Martin Glinz
135
Voted
BTW
1999
Springer
145views Database» more  BTW 1999»
15 years 8 months ago
A Multi-Tier Architecture for High-Performance Data Mining
Data mining has been recognised as an essential element of decision support, which has increasingly become a focus of the database industry. Like all computationally expensive data...
Ralf Rantzau, Holger Schwarz
132
Voted
KDD
1995
ACM
227views Data Mining» more  KDD 1995»
15 years 7 months ago
Applying a Data Miner To Heterogeneous Schema Integration
Anapplication of data miningtechniques to heterogeneous database schemaintegration is introduced. We use attribute-oriented induction to minefor characteristic and classification ...
Son Dao, Brad Perry
154
Voted
JAR
2010
122views more  JAR 2010»
14 years 10 months ago
Partial and Nested Recursive Function Definitions in Higher-order Logic
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...
Alexander Krauss