Approximate boolean reasoning approach to rough sets and data mining

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

Volumn 3642 LNAI, Issue , 2005, Pages 12-22

  Nguyen, Hung Son ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Boolean reasoning; Data mining; Rough sets

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; DATA MINING; PROBLEM SOLVING;

APPROXIMATE BOOLEAN REASONING (ABR) APPROACH; BOOLEAN REASONING; ROUGH SETS; SPACE AND TIME COMPLEXITY;

ROUGH SET THEORY;

EID: 33645961307     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11548706_2     Document Type: Conference Paper

References (24)

1. Agrawal R., Imielinski T., Suami A.: Mining Assocation Rules Between Sets of Items in Large Datatabes, ACM SIGMOD. Conference on Management of Data, Washington, D.C., 1993, pp. 207-216.
2. Bazan J., Nguyen H.S., Skowron A., Szczuka M.: A view on rough set concept approximation. In proceedings of the 9th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC'2003), Chongqing, China. LNAI 2639, Heidelberg, Germany, Springer-Verlag, 2003, pp. 181-188
3. Brown E.M.: Boolean Reasoning, Kluwer Academic Publishers, Dordrecht, 1990.
4. Kloesgen W., Żytkow J., eds.: Handbook of Knowledge Discovery and Data Mining. Oxford University Press, Oxford, 2002.
5. Nguyen H. S.: Discretization problems for rough set methods. In L. Polkowski and A. Skowron, editors, New Direction in Rough Sets, Data Mining and Granular-Soft Computing (Proc. of RSCTC'98, Warsaw, Poland), LNAI 1424, Springer-Verlag, Berlin Heidelberg, 1998, pp. 545-552.
6. Nguyen H. S., Nguyen S. H.: Discretization methods for data mining. In L. Polkowski and A. Skowron, editors, Rough Sets in Knowledge Discovery, Physica-Verlag, Heidelberg New York, 1998, pp. 451-482.
7. Nguyen H. S., Nguyen S. H.: Rough sets and association rule generation. Fundamenta Informaticae, 40(4), 1999, pp. 310-318.
8. Nguyen H. S.: Efficient sql-querying method for data mining in large data bases. In Proc. of Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99, Stockholm, Sweden, Morgan Kaufmann, 1999, pp. 806-811.
9. Nguyen H. S.: From optimal hyperplanes to optimal decision trees. Fundamenta Informaticae, 34(1-2), 1998, pp. 145-174.
10. Nguyen H. S., Slezak D.: Approximate reducts and association rules - correspondence and complexity results. In Proc. of RSFDGrC'99, Yamaguchi, Japan, LNAI 1711, Springer-Verlag, Berlin Heidelberg, 1999, pp. 107-115.
11. Nguyen H. S.: On efficient handling of continuous attributes in large data bases. Fundamenta Informaticae, 48(1), 2001, pp. 61-81.
12. Nguyen H. S.: On exploring soft discretization of continuous attributes. In Sankar K. Pal, Lech Polkowski, and Andrzej Skowron, editors, Rough-Neural Computing Techniques for Computing with Words, chapter 13, Springer, 2004, pages 333-350.
13. Nguyen S. H., Bazan J., Skowron A., and Nguyen H.S.: Layered learning for concept synthesis. In Peters at al. (eds), Transactions on Rough Sets I, volume LNCS 3100, Springer, 2004, pages 187-208.
14. Pawlak Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Volume 9 of System Theory, Knowledge Engineering and Problem Solving. Kluwer Academic Publishers, Dordrecht, The Netherlands (1991)
15. Pizzuti C.: Computing Prime Implicants by Integer Programming. In Proceedings of IEEE International Conference on Tools with Artificial Intelligence, 1996.
16. Sen S.: Minimal cost set covering using probabilistic methods In Proceedings 1993 ACM/SIGAPP Symposium on Applied Computing, 1993, pp. 157-194.
17. Selman B., Kautz H., McAllester D.: Ten Challenges in Propositional Reasoning and Search. In Proc. IJCAI'97, Japan, 1997.
18. Skowron A., Nguyen H. S.: Boolean reasoning schema with some applications in data mining. In J. Zytkow and J. Rauch, editors, Principple of Data Mining and Knowledge Discovery (Proc. of PKDD'1999, Praga, Czech), LNAI 1704, Springer-Verlag, Berlin Heidelberg, 1999, pp. 107-115.
19. th Scandinavian Conference on AI (SCAI'95), IOS Press, May 1995, Trondheim, Norway, pp. 220-238.
20. Skowron A., Rauszer C.: 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, pp. 331-362.
21. Skowron A., Stepaniuk J.: Tolerance approximation spaces. Fundamenta Informaticae 27, 1996, pp. 245-253
22. Słowiński R., Vanderpooten D., 1995. Similarity Relation as a Basis for Rough Approximations, In: P. Wang (Ed.): Advances in Machine Intelligence & Soft Computing, Bookwrights, Raleigh NC, 1997, pp. 17-33.
23. Wróblewski J.: Covering with reducts - a fast algorithm for rule generation. In: Polkowski L., Skowron A.(eds.): Proc. of RSCTC'98, Warsaw, Poland. Springer-Verlag, Berlin, 1998, pp. 402-407.
24. Ziarko W.: Variable Precision Rough Set Model. In Journal of Computer and System Sciences, Vol. 46, 1993, pp. 39-59.