Using the dual of proximity graphs for binary decision tree design

DOI10.1007/3-540-44522-6_50MaRDI QIDQ4536524zbMATH OpenFDO

Authors Johan S. Sánchez, Fernand Pla, M. C. Herrero

Publication date 5 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44522-6_50

zbMATH Keywords

classificationdecision treeGabriel graphnearest neighbourrelative neighbourhood graph

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Recommendations

• A method for the design of binary tree classifiers
• Decision tree design from a communication theory standpoint
• On the Difficulty of Designing Good Classifiers
• scientific article; zbMATH DE number 1156666
• Decision trees based on neural networks

Cited in

(3)

• Decision tree design from a communication theory standpoint
• scientific article; zbMATH DE number 2101365 (Why is no real title available?)
• A method for the design of binary tree classifiers

This page was built for publication: Using the dual of proximity graphs for binary decision tree design

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