Computational complexity reduction and interpretability improvement of distance-based decision trees

&
In Emilio Corchado, Vaclav Snasel, Ajith Abraham, Michał Woźniak, Manuel Grana & Sung-Bae Cho (eds.), Hybrid Artificial Intelligent Systems. Springer. pp. 288--297 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Feature Selection for a Rich HPSG Grammar Using Decision Trees.Christopher D. Manning & Kristina Toutanova - unknown
Game Trees For Decision Analysis.Prakash P. Shenoy - 1998 - Theory and Decision 44 (2):149-171.
Deterministic chaos and computational complexity: The case of methodological complexity reductions. [REVIEW]Theodor Leiber - 1999 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 30 (1):87-101.
Some decision problems of enormous complexity.Harvey Friedman - manuscript
Strong isomorphism reductions in complexity theory.Sam Buss, Yijia Chen, Jörg Flum, Sy-David Friedman & Moritz Müller - 2011 - Journal of Symbolic Logic 76 (4):1381-1402.
Computational vs. causal complexity.Matthias Scheutz - 2001 - Minds and Machines 11 (4):543-566.
Computational and dynamic complexity in economics.Barkley Rosser - manuscript
Complexity and postmodernism: understanding complex systems.Paul Cilliers - 1998 - New York: Routledge.
Ultrametric Distance in Syntax.Mark D. Roberts - manuscript
Analyzing Godel's T Via Expanded Head Reduction Trees.Arnold Beckmann & Andreas Weiermann - 2000 - Mathematical Logic Quarterly 46 (4):517-536.
Computation models for parameterized complexity.Marco Cesati & Miriam Dilanni - 1997 - Mathematical Logic Quarterly 43 (2):179-202.
Moral distance in dictators games.Fernando Aguiar, Pablo Brañas-Garza & Luis Miller - 2008 - Judgment and Decision Making 3 (4):344-354.
Satisfiability testing for Boolean formulas using δ-trees.G. Gutiérrez, I. P. de Guzmán, J. Martínez, M. Ojeda-Aciego & A. Valverde - 2002 - Studia Logica 72 (1):85 - 112.

Analytics

Added to PP
2014-01-28

Downloads
38 (#409,607)

6 months
7 (#411,886)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references