Boolean reasoning scheme with some applications in data mining

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1704, Issue , 1999, Pages 107-115

  Skowron, Andrzej ^a   Nguyen, Hung Son ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EXTRACTION; FEATURE EXTRACTION; MULTI AGENT SYSTEMS; SEARCH ENGINES;

ASSOCIATION RULE GENERATIONS; BOOLEAN REASONING; CONFLICT RESOLUTION; DECISION RULES; ENCODING SCHEMES; PATTERN EXTRACTION;

DATA MINING;

EID: 84956853339     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48247-5_12     Document Type: Conference Paper

References (15)

1. Agrawal R., Mannila H., Srikant R., Toivonen H., Verkamo A.I., 1996. Fast discovery of assocation rules. In V.M. Fayad, G.Piatetsky Shapiro, P. Smyth, R. Uthurusamy (eds): Advanced in Knowledge Discovery and Data Mining, AAAI/MIT Press, pp. 307-328.
2. J. Bazan. A comparison of dynamic non-dynamic rough set methods for extracting laws from decision tables. In: L. Polkowski and A. Skowron (Eds.), Rough Sets in Knowledge Discovery 1: Methodology and Applications, Physica-Verlag, Heidelberg, 1998, 321–365.
3. E.M. Brown. Boolean Reasoning, Kluwer Academic Publishers, Dordrecht, 1990.
4. U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, R. Uthurusamy (Eds.). Advances in Knowledge Discovery and Data Mining. MIT/AAAI Press, Menlo Park, 1996.
5. J. Friedman, R. Kohavi, Y. Yun. Lazy decision trees, Proc. AAAI-96, 717–724.
6. H.S. Nguyen and S.H. Nguyen. Pattern extraction from data, Fundamenta Informaticae 34, 1998, pp. 129–144.
7. H.S. Nguyen and A. Skowron. Boolean reasoning for feature extraction problems, Proc. ISMIS’97, LNAI 1325, Springer–verlag, Berlin, 117–126.
8. Nguyen S. Hoa, A. Skowron, P. Synak. Discovery of data pattern with applications to Decomposition and classification problems. In L. Polkowski, A. Skowron (eds.): Rough Sets in Knowledge Discovery 2. Physica-Verlag, Heidelberg 1998, pp. 55–97.
9. Z. Pawlak. Rough Sets – Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht, 1991.
10. L. Polkowski and A. Skowron. Rough sets: A perspective. In: L. Polkowski and A. Skowron (Eds.). Rough Sets in Knowledge Discovery 1: Methodology and Applications. Physica-Verlag, Heidelberg, 1998, 31–56.
11. J.R. Quinlan. C4.5. Programs for machine learning, Morgan Kaufmann, San Mateo, CA, 1993.
12. B. Selman, H. Kautz and D. McAllester. Ten Challenges in Propositional Reasoning and Search, Proc. IJCAI’97, Japan.
13. Skowron A. Synthesis of adaptive decision systems from experimental data. In A. Aamodt, J. Komorowski (eds), Proc. of the 5th Scandinavian Conference on AI (SCAI’95), IOS Press, May 1995, Trondheim, Norway, 220–238.
14. A. Skowron and C. Rauszer. The discernibility matrices and functions in information systems, in: R. Słowiński (Ed.), Intelligent decision support: Handbook of applications and advances of the rough sets theory, Kluwer Academic Publishers, Dordrecht, 1992, 331-362.
15. Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, Wei Li. New Parallel Algorithms for Fast Discovery of Association Rules. In Data Mining and Knowledge Discovery: An International Journal, special issue on Scalable High-Performance Computing for KDD, Vol. 1, No. 4, Dec. 1997, pp 343-373.