Basic theory of feature trees

DOI10.1145/1013560.1013561MaRDI QIDQ5277702zbMATH OpenOpenAlexFDO

Authors Pawel Mielniczuk

Publication date 12 July 2017

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1013560.1013561

zbMATH Keywords

complexitydecision algorithmfeature tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• Feature minimization within decision trees
• Dendrograms, minimum spanning trees and feature selection
• Complete search for feature selection in decision trees
• Feature automata and recognizable sets of feature trees
• A complete and recursive feature theory
• About the theory of tree embedding

Cited in

(2)

• Decidable first-order transition logics for PA-processes
• An improved lower bound for the elementary theories of trees

This page was built for publication: Basic theory of feature trees

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