Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
This paper concerns a new approach to intelligent data analysis based on information flow distribution study in a flow graph. Branches of a flow graph are interpreted as decision rules, whereas a flow graph is supposed to describe a decision algorithm. We propose to model decision processes as flow graphs and analyze decisions in terms of flow spreading in a graph.
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Strony
369--377
Opis fizyczny
Bibliogr. 6 poz.
Twórcy
autor
- Institute for Theoretical and Applied Informatics, Polish Academy of Sciences, Batycka 5, 44-100 Gliwice, Poland
- Warsaw School of Information Technology ul. Newelska 6, 01-447 Warsaw, Poland
Bibliografia
- [1] M. Berthold, D.J. Hand, IntelligentData Analysis – An Introduction. Springer-Verlag, Berlin, Heidelberg,New York, 1999.
- [2] L.R. Ford, D.R. Fulkerson, Flows in Networks. Princeton University Press, Princeton, New Jersey, 1962.
- [3] J. Łukasiewicz, Die logishen Grundlagen derWahrscheinilchkeitsrechnung.Krak´ow (1913), in: L. Borkowski, Ed., Jan Łukasiewicz – Selected Works, North Holland Publishing Company, Amsterdam, London, Polish Scientific Publishers, Warsaw, 1970, 16–63.
- [4] S. Marcus, Tolerance rough sets, Čech topologies, learning processes, Bulletin of the Polish Academy of Sciences, Technical Sciences, 42 (1994), 471–487.
- [5] Z. Pawlak, Flow graphs and decision algorithms, In: Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, Proceedings, G. Wang, Y. Yao, and A. Skowron, Eds., Lecture Notes in Artificial Intelligence, 2639, Springer, 2003, 1–10.
- [6] R. Swinburne, Ed., Bayes’s Theorem, Proceedings of the British Academy - 113, Oxford University Press, 2002.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS2-0005-0136