AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Explainable Data Decompositions

Sebastian Dalleiger, Jilles Vreeken

AAAI 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristic and local search 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 DESC instead of MTV for the same scorepattern miner · 17 real-world datasetsruntime: 0.24% of MTV runtimeImproved
use DESC instead of SLIMpattern miner · 17 real-world datasetsruntime: 16% of SLIM runtimeImproved
use DESC instead of DIFFNORMpattern miner · labeled datasetsruntime: 13% of DIFFNORM runtimeImproved
use DESC instead of SLIM for number of patternspattern miner · 17 real-world datasetsnumber of patternsImproved
DESC instead of MTV on the same objectivepattern miner · 17 real-world datasetslikelihood ratioImproved
learn components with DISC instead of DBSCAN-based DBDESC/DBDESC2DISC · 17 real-world datasetslikelihood ratioImproved
decompose by DISC components instead of class labelsDESC · 9 labeled datasetslikelihood ratioImproved
class-based composition instead of DISC componentsDESC · 9 labeled datasetsPSKL divergenceHurt
DISC on Pumsb Star with only 10 componentsDISC · Pumsb StarPSKL divergenceMixed

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