Targeted and contextual redescription set exploration

DOI10.1007/S10994-018-5738-9MaRDI QIDQ1631833zbMATH OpenOpenAlexFDO

Authors Matej Mihelčić, Tomislav Šmuc

Publication date 7 December 2018

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10994-018-5738-9

zbMATH Keywords

knowledge discovery\(k\)-pathsredescription miningheatmapself-organising mapcrossfilterinteractive explorationredescription set

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Recommendations

• Finding relational redescriptions
• On the complexity of redescription mining
• Using redescriptions and formal concept analysis for mining definitions in linked data
• Formal Concept Analysis
• Problems for knowledge discovery in databases and their treatment in the statistics interpreter explora

Cites work

• A note on two problems in connexion with graphs
• Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
• Finding the K Shortest Loopless Paths in a Network
• From black and white to full color: extending redescription mining outside the Boolean world
• Mining Compressing Sequential Patterns
• Self-organizing maps.
• The arules R-package ecosystem: analyzing interesting patterns from large transaction data sets

Cited in

(3)

• Finding relational redescriptions
• On the complexity of redescription mining
• scientific article; zbMATH DE number 1808291 (Why is no real title available?)

Describes a project that uses

Uses Software

• eggNOG
• kohonen
• rapidminer
• arules
• KNIME
• ARVis

This page was built for publication: Targeted and contextual redescription set exploration

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