Targeted and contextual redescription set exploration

DOI10.1007/s10994-018-5738-9zbMath1475.68287OpenAlexW2850100550MaRDI QIDQ1631833

Tomislav Šmuc, Matej Mihelčić

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)

Related Items (1)

On the complexity of redescription mining

Uses Software

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

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
• From black and white to full color: extending redescription mining outside the Boolean world
• Mining Compressing Sequential Patterns
• Finding the K Shortest Loopless Paths in a Network
• Self-organizing maps.

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