Comparing classification tree structures: a special case of comparing q-ary relations

DOI10.1051/RO:1999114zbMATH Open0948.05023OpenAlexW4242375238MaRDI QIDQ4497863FDOQ4497863

Authors: I-C. Lerman 

Publication date: 24 August 2000

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/197829

Recommendations

• Comparing classification tree structures: A special case of comparingq-ary relations II
• The comparison between classification trees through proximity measures
• Graph-Theoretic Concepts in Computer Science
• Characterizations of treelike comparability graphs
• scientific article; zbMATH DE number 3976336
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Comparing trees via crossing minimization

zbMATH Keywords

relationsclassification treemathematical representationrandom permutational model

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Trees (05C05) Combinatorial optimization (90C27)

Cited In (2)

• Distinguishing and classifying from \(n\)-ary properties
• Comparing classification tree structures: A special case of comparingq-ary relations II

This page was built for publication: Comparing classification tree structures: a special case of comparing q-ary relations

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