Name
Abstract | ||
|---|---|---|
Inductive Logic Programming (ILP) is a classic machine learning technique that learns first-order rules from relational-structured data. However, to-date most ILP systems can only be applied to small datasets (tens of thousands of examples). A long-standing challenge in the field is to scale ILP methods to larger data sets. This paper presents a method called QuickFOIL that addresses this limitation. QuickFOIL employs a new scoring function and a novel pruning strategy that enables the algorithm to find high-quality rules. QuickFOIL can also be implemented as an in-RDBMS algorithm. Such an implementation presents a host of query processing and optimization challenges that we address in this paper. Our empirical evaluation shows that QuickFOIL can scale to large datasets consisting of hundreds of millions tuples, and is often more than order of magnitude more efficient than other existing approaches. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.14778/2735508.2735510 | PVLDB |
DocType | Volume | Issue |
Journal | 8 | 3 |
ISSN | Citations | PageRank |
2150-8097 | 12 | 0.79 |
References | Authors | |
27 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zeng Qiang | 1 | 34 | 10.73 |
| Jignesh M. Patel | 2 | 4406 | 288.44 |
| David Page | 3 | 390 | 31.33 |