kth.sePublikationer KTH
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Concise and interpretable multi-label rule sets
Department of Computer Science, Aalto University, Espoo, Finland.
Department of Computer Science, Aalto University, Espoo, Finland.
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Teoretisk datalogi, TCS.ORCID-id: 0000-0002-5211-112X
2023 (Engelska)Ingår i: Knowledge and Information Systems, ISSN 0219-1377, E-ISSN 0219-3116, Vol. 65, nr 12, s. 5657-5694Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

Multi-label classification is becoming increasingly ubiquitous, but not much attention has been paid to interpretability. In this paper, we develop a multi-label classifier that can be represented as a concise set of simple “if-then” rules, and thus, it offers better interpretability compared to black-box models. Notably, our method is able to find a small set of relevant patterns that lead to accurate multi-label classification, while existing rule-based classifiers are myopic and wasteful in searching rules, requiring a large number of rules to achieve high accuracy. In particular, we formulate the problem of choosing multi-label rules to maximize a target function, which considers not only discrimination ability with respect to labels, but also diversity. Accounting for diversity helps to avoid redundancy, and thus, to control the number of rules in the solution set. To tackle the said maximization problem, we propose a 2-approximation algorithm, which circumvents the exponential-size search space of rules using a novel technique to sample highly discriminative and diverse rules. In addition to our theoretical analysis, we provide a thorough experimental evaluation and a case study, which indicate that our approach offers a trade-off between predictive performance and interpretability that is unmatched in previous work.

Ort, förlag, år, upplaga, sidor
Springer Nature , 2023. Vol. 65, nr 12, s. 5657-5694
Nyckelord [en]
Interpretable machine learning, Multi-label classification, Rule sampling, Rule-based classification
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:kth:diva-338525DOI: 10.1007/s10115-023-01930-6ISI: 001039825900001Scopus ID: 2-s2.0-85166017990OAI: oai:DiVA.org:kth-338525DiVA, id: diva2:1811818
Anmärkning

QC 20231114

Tillgänglig från: 2023-11-14 Skapad: 2023-11-14 Senast uppdaterad: 2025-01-27Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Person

Gionis, Aristides

Sök vidare i DiVA

Av författaren/redaktören
Gionis, Aristides
Av organisationen
Teoretisk datalogi, TCS
I samma tidskrift
Knowledge and Information Systems
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 79 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf