AI Paper Atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Approximate and Exact Enumeration of Rule Models

Satoshi Hara, Masakazu Ishihata

AAAI 2018 · Learning theory and algorithms › Submodular and game algorithms · approach: Streaming submodular algorithms · 8 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use greedy (1-1/e)-correct algorithm for rule sets instead of exact algorithmRule set enumeration · Mushroomoverlap of enumerated models (of 50): 40 out of 50 coincidedMixed
Use greedy approximate rule set enumerationRule set enumeration (S2) · COMPASenumeration order / exactnessNo clear effect
Use CORELS-based rule list enumeration on MushroomRule list enumeration (S1) · MushroomfeasibilityHurt
Enumerate several models instead of only the optimumRule set enumeration · Mushroomnumber of equally optimal modelsImproved
Use lower-ranked enumerated models instead of the single optimal modelRule set enumeration · Mushroomtest accuracyMixed
Use first few enumerated models instead of the optimal oneRule list and rule set enumeration · COMPAStest accuracyNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy