On the complexity of redescription mining

DOI10.1016/J.TCS.2022.12.023MaRDI QIDQ2680177zbMATH OpenOpenAlexFDO

Authors Matej Mihelčić, Adrian Satja Kurdija

Publication date 30 January 2023

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2022.12.023

zbMATH Keywords

CLIQUE problemdata miningNP-completenessredescription miningset cover problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Finding relational redescriptions
• Targeted and contextual redescription set exploration
• scientific article; zbMATH DE number 23766
• On the time complexity of the problem related to reducts of consistent decision tables
• Some NP-complete problems for attribute reduction in consistent decision tables

Cites work

• Finding relational redescriptions
• Foundations of Rule Learning
• From black and white to full color: extending redescription mining outside the Boolean world
• scientific article; zbMATH DE number 3617544 (Why is no real title available?)
• scientific article; zbMATH DE number 1946861 (Why is no real title available?)
• Norm statistics and the complexity of clustering problems
• NP-hardness of Euclidean sum-of-squares clustering
• On Grouping for Maximum Homogeneity
• Targeted and contextual redescription set exploration
• The Planar k-Means Problem is NP-Hard

Cited in

(2)

• Targeted and contextual redescription set exploration
• Finding relational redescriptions

This page was built for publication: On the complexity of redescription mining

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680177)