Inducing decision trees via concept lattices1
From MaRDI portal
Publication:3631389
DOI10.1080/03081070902857563zbMATH Open1183.68462DBLPjournals/ijgs/BelohlavekBOV09OpenAlexW2160279356WikidataQ60257646 ScholiaQ60257646MaRDI QIDQ3631389FDOQ3631389
Authors: Radim Belohlavek, B. De Baets, Jan Outrata, Vilem Vychodil 
Publication date: 9 June 2009
Published in: International Journal of General Systems (Search for Journal in Brave)
Full work available at URL: http://www.informaworld.com/smpp/./content~db=all~content=a910426029
Recommendations
Cites Work
Cited In (14)
- On Algebraic Approach of R. Wille and B. Ganter in the Investigation of Texts
- Knowledge reduction in formal decision contexts based on an order-preserving mapping
- Description quivers for compact representation of concept lattices and ensembles of decision trees
- Decision concept lattice vs. decision trees and random forests
- CHARACTERIZING TREES IN CONCEPT LATTICES
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interval-valued linguistic variables: an application to the L-fuzzy contexts with absent values
- Trees in Concept Lattices
- Induction Graphs for Data Mining
- Generating decision tree from lattice for classification
- Triadic formal concept analysis and triclustering: searching for optimal patterns
- From Meaningful Orderings in the Web of Data to Multi-level Pattern Structures
- Generalized decision directed acyclic graphs for classification tasks
Uses Software
This page was built for publication: Inducing decision trees via concept lattices1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3631389)
