A classifier based on a decision tree with temporal cuts

DOI10.3233/FI-2019-1785MaRDI QIDQ5377327zbMATH OpenOpenAlexWikidataFDO

Authors Jan G. Bazan, Adam Szczur, Andrzej Skowron, Marian Rzepko, Paweł Król, Wojciech Bajorek, Wojciech Czarny

Publication date 24 May 2019

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2019-1785

zbMATH Keywords

classifiersdiscretizationrough setstemporal cutstemporal data

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• scientific article; zbMATH DE number 2079498
• scientific article; zbMATH DE number 2087979
• A novel approach to cutting decision trees
• Fast split selection method and its application in decision tree construction from large databases
• scientific article; zbMATH DE number 2087265

Cited in

(5)

• Interval temporal logic decision tree learning
• A novel approach to cutting decision trees
• AI*IA 2003: Advances in Artificial Intelligence
• Knowledge extraction with interval temporal logic decision trees
• Comparison of complexity of regular and oblivious decision trees for decision tables from closed classes

Describes a project that uses

Uses Software

• WEKA
• RSES

This page was built for publication: A classifier based on a decision tree with temporal cuts

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