Mikhail Moshkov  Home/Search
Context
Related
| mimuw.edu.pl/logic/pr...moshkov_FI97.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mimuw.edu.pl/logic/prace/1997/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . The paper is devoted to investigation of behavior of global Shannon functions which produce unimprovable upper bounds on time complexity of decision trees over arbitrary information systems. Keywords: Information system, decision tree, time complexity 1. Introduction Decision trees are used in different fields as algorithms and as a form of knowledge representation. Decision trees over finite (ordinary) information systems are widely studied. The notion of infinite information system is... (Update)
Active bibliography (related documents): More All
2.6: Comparative Analysis of Deterministic and Nondeterministic.. - Moshkov (1996) (Correct)
0.6: Rough Analysis of Tree-Programs - Mikhail Moshkov Research (1997) (Correct)
0.5: Optimal Bases for Some Closed Classes of Boolean Functions - Moshkov, Moshkova (1997) (Correct)
Similar documents based on text: More All
0.7: Bounds on Average Weighted Depth of Decision Trees - Mikhail Moshkov Research (1994) (Correct)
0.6: Some Relationships between Decision Trees and Decision.. - Mikhail Moshkov Research (1998) (Correct)
0.5: Bounds on Average Depth of Decision Trees - Moshkov, Chikalov (1997) (Correct)
BibTeX entry: (Update)
@article{ moshkov97unimprovable,
author = "Mikhail Moshkov",
title = "Unimprovable Upper Bounds on Time Complexity of Decision Trees",
journal = "Fundamenta Informaticae",
volume = "31",
number = "2",
pages = "157-184",
year = "1997",
url = "citeseer.ist.psu.edu/moshkov98unimprovable.html" }
Citations (may not include all citations):465 Learnability and the VapnikChervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989
454 the uniform convergence of relative frequencies of events to.. (context) - Vapnik, Ya et al. - 1971
220 Rough Sets - Theoretical Aspects of Reasoning about Data (context) - Pawlak - 1991
124 Lower bounds for algebraic computation trees (context) - Ben-Or - 1983
115 the density of families of sets (context) - Sauer - 1972
83 Generating production rules from decision trees (context) - Quinlan - 1987
82 The discernibility matrices and functions in information sys.. (context) - Skowron, Rauszer - 1992
49 Lower bounds for algebraic decision trees (context) - Steele, Yao - 1982
45 Multidimensional searching problems (context) - Dobkin, Lipton - 1976
36 Discovering rules by induction from large collections of exa.. (context) - Quinlan - 1979
26 the complexity of computations under varying sets of primiti.. (context) - Dobkin, Lipton - 1979
20 Information Systems - Theoretical Foundations (context) - Pawlak - 1981
12 stability and order for models and theories in infinitary la.. (context) - Shelah, problem - 1972
11 dimensional restrictions of hard problems (context) - auf, Fast et al. - 1988
11 A polynomial linear search algorithm for the n-dimensional k.. (context) - auf - 1984
9 On conditional tests (context) - Ju - 1982
9 Conditional tests (context) - Ju - 1983
7 Logical methods of electric circuit control (context) - Chegis, Yablonskii - 1958
6 Theory and Applications (context) - Ju, Decision - 1994
4 on linear search programs for the knapsack problem (context) - Dobkin, Lipton et al. - 1978
4 Theorie des Questionnaires (context) - Picard - 1965
2 London and American Elsevier (context) - Humby, Decision et al. - 1973
2 Decision trees with quasilinear checks (context) - Ju - 1994
2 Optimization problems for decision trees (context) - Ju - 1994
1 the complexity of discrete programming problems (context) - Moravek - 1969
1 the depth of conditional tests for tables from closed classe.. (context) - Ju, On - 1989
1 On entropy of two-dimensional fragmentary closed languages (context) - Alexeyev - 1987
1 Graphes et Questionnaires (context) - Picard - 1972
1 Test approach to extremal combinatorial problems (context) - Ju - 1982
1 Opponent Strategy Method in Optimal Search Problems (context) - Tarasova - 1988
1 a class of partial Boolean functions (context) - Zhuravlev - 1964
1 Nauka Publishers (context) - Soloviev, Theory et al. - 1978
1 the depth of decision trees over infinite information system.. (context) - Ju, On - 1996
1 Unimprovable Upper Bounds on Time Complexity of Decision Tre.. (context) - Quinlan, decision et al. - 1986
1 A localization problems in geometry and complexity of discre.. (context) - Moravek - 1972
1 On tests for electric circuits (context) - Yablonskii, Chegis - 1955
1 the depth of decision trees over arbitrary check system (context) - Ju, On - 1996
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC