arrow
Return

Efficient data structures for fast and low-cost first-order logic rule mining

delete2026-01-21
delete0
PRE
AI
R
Ruoyu Wang
R
R Wong *
D
Daniel Sun
DOI:10.1016/j.is.2026.102690delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• We optimize logic rule mining from the perspective of data efficiency. • Inducing first-order logic rules from large-scale KBs is practical with normal PC hardwares. • Cache fragments implicitly represent Cartesian product of variable substitutions. • Integer tables build compact and efficient index for rule mining cache. • Cache components are pooled to avoid duplications.

Journal

I
Information Systems
IF:
3.4
Papers:
113
Citations:
0

Organization

U
University of New South Wales
Scholars:
2.5K
Papers: 1.3K
Citations: 0
N
Newcastle University
Scholars:
1.3K
Papers: 773
Citations: 3.7W