论文信息 - Decision Trees and Flow Graphs

Decision Trees and Flow Graphs

We consider association of decision trees and flow graphs, resulting in a new method of decision rule generation from data, and giving a better insight in data structure. The introduced flow graphs can also give a new look at the conception of probability. We show that in some cases the conception of probability can be eliminated and replaced by a study of deterministic flows in a flow network.

Zdzislaw Pawlak | Z. Pawlak

[1] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .

[2] P. Laplace. Théorie analytique des probabilités , 1995 .

[3] Alberto Maria Segre,et al. Programs for Machine Learning , 1994 .

[4] Zdzislaw Pawlak,et al. Flow Graphs and Data Mining , 2005, Trans. Rough Sets.

[5] P. Rousseeuw,et al. Wiley Series in Probability and Mathematical Statistics , 2005 .

[6] Mikhail Moshkov,et al. Time Complexity of Decision Trees , 2005, Trans. Rough Sets.

[7] Glenn Shafer,et al. The art of causal conjecture , 1996 .

[8] Roman Słowiński,et al. Generalized Decision Algorithms, Rough Inference Rules, and Flow Graphs , 2002, Rough Sets and Current Trends in Computing.

[9] Hans Reichenbach,et al. Wahrscheinlichkeitslehre : eine Untersuchung über die logischen und mathematischen Grundlagen der Wahrscheinlichkeitsrechnung , 1935 .

[10] Donald C. Williams,et al. The Theory of Probability: An Inquiry into the Logical and Mathematical Foundations of the Calculus of Probability. , 1950 .