Cumulativity as Inductive Bias

نویسندگان

  • Hendrik Blockeel
  • Luc Dehaspe
چکیده

An important di erence in inductive bias between machine learning approaches is whether they assume the e ects of di erent properties on a target variable to be cumulative or not. We believe this di erence may have an important in uence on the performance of machine learning or data mining techniques, and hence should be taken into account when deciding which techniques to use. We illustrate this point with some practical cases. We furthermore point out that in Inductive Logic Programming, most algoritms belong to the class that does not assume cumulativity. We argue for the use and/or development of ILP systems that do make this assumption.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

First Steps Towards Cumulative Inductive Types in CIC

We discuss our on-going research on making inductive types cumulative in the predicative calculus of inductive constructions (pCIC) – the logic of the Coq proof assistant. Having inductive types be cumulative alleviates some problems that occur while working with large inductive types, e.g., the category of small categories, in pCIC. We present the pCuIC system which adds cumulativity for induc...

متن کامل

Cumulative Inductive Types In Coq

In order to avoid well-know paradoxes associated with self-referential definitions, higher-order dependent type theories stratify the theory using a countably infinite hierarchy of universes (also known as sorts), Type0 : Type1 : · · · . Such type systems are called cumulative if for any type A we have that A : Typei implies A : Typei+1. The Predicative Calculus of Inductive Constructions (pCIC...

متن کامل

Consistency of the Predicative Calculus of Cumulative Inductive Constructions (pCuIC)

In order to avoid well-know paradoxes associated with self-referential definitions, higher-order dependent type theories stratify the theory using a countably infinite hierarchy of universes (also known as sorts), Type0 : Type1 : · · · . Such type systems are called cumulative if for any type A we have that A : Typei implies A : Typei+1. The predicative calculus of inductive constructions (pCIC...

متن کامل

Bias: Preference, Restriction or Core of Induction

In this paper, we aim to give a more precise deenition of bias in order to clarify diierent views. Since this deenition involves the problem setting of inductive learning, we have to take into account this deenition as well. A more precise deenition of the bias can be used to declare, to adapt and to shift the bias of an inductive system. We demonstrate these advantages by declaring and shiftin...

متن کامل

French schwa and gradient cumulativity

We model the interaction of two phonological factors that condition French schwa alternations: schwa is more likely after two consonants; and schwa is more likely in the penultimate syllable. Using new data from a judgment study, we show that both factors play a role in schwa epenthesis and deletion, confirming previous impressionistic descriptions, and that the two factors interact cumulativel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000