mlsanityData to 7 Oct 2026

FOLD-RM: A Scalable, Efficient, and Explainable Inductive Learning Algorithm for Multi-Category Classification of Mixed Data

arXiv 2202.06913 ↗First posted 14 Feb 2022cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

FOLD-RM is an automated inductive learning algorithm for learning default rules for mixed (numerical and categorical) data. It generates an (explainable) answer set programming (ASP) rule set for multi-category classification tasks while maintaining efficiency and scalability. The FOLD-RM algorithm is competitive in performance with the widely-used, state-of-the-art algorithms such as XGBoost and multi-layer perceptrons (MLPs), however, unlike these algorithms, the FOLD-RM algorithm produces an explainable model. FOLD-RM outperforms XGBoost on some datasets, particularly large ones. FOLD-RM also provides human-friendly explanations for predictions.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 8 of its 36 references that are in the map. First posted on arXiv 14 Feb 2022.

Builds on

8 of 36 references.

References · 8

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2020Metrics for Multi-Class Classification: an Overviewcited by 140
  3. 2020Inductive logic programming at 30: a new introductioncited by 83
  4. 2018Constraint Answer Set Programming without Groundingcited by 38
  5. 2017A New Algorithm to Automate Inductive Learning of Default Theoriescited by 14
  6. 2020Justifications for Goal-Directed Constraint Answer Set Programmingcited by 14
  7. 2018Heuristic Based Induction of Answer Set Programs: From Default theories to combinatorial problemscited by 4
  8. 2021Generating Explainable Rule Sets from Tree-Ensemble Learning Methods by Answer Set Programmingcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 1; 2024: 3; 2025: 0; 2026: 1.

7 papers.