Skip to main content
SpringerLink
Log in

Approximate Boolean Reasoning: Foundations and Applications in Data Mining

  • Conference paper
Transactions on Rough Sets V

Part of the book series: Lecture Notes in Computer Science ((TRS,volume 4100))

Abstract

Since its introduction by George Boole during the mid-1800s, Boolean algebra has become an important part of the lingua franca of mathematics, science, engineering, and research in artificial intelligence, machine learning and data mining. The Boolean reasoning approach has manifestly become a powerful tool for designing effective and accurate solutions for many problems in decision-making and approximate reasoning optimization. In recent years, Boolean reasoning has become a recognized technique for developing many interesting concept approximation methods in rough set theory. The problem considered in this paper is the creation of a general framework for concept approximation. The need for such a general framework arises in machine learning and data mining. This paper presents a solution to this problem by introducing a general framework for concept approximation which combines rough set theory, Boolean reasoning methodology and data mining. This general framework for approximate reasoning is called Rough Sets and Approximate Boolean Reasoning (RSABR). The contribution of this paper is the presentation of the theoretical foundation of RSABR as well as its application in solving many data mining problems and knowledge discovery in databases (KDD) such as feature selection, feature extraction, data preprocessing, classification of decision rules and decision trees, association analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Imielinski, T., Swami, A.N.: Mining Association Rules between Sets of Items in Large Databases. In: Buneman, P., Jajodia, S. (eds.) ACM SIGMOD International Conference on Management of Data, Washington, DC, 26-28, pp. 207–216 (1993)

    Google Scholar 

  2. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI Press/The MIT Press, Menlo Park (1996)

    Google Scholar 

  3. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Twentieth International Conference on Very Large Data Bases VLDB, May 12-15, 1994, pp. 487–499. Morgan Kaufmann, San Francisco (1994)

    Google Scholar 

  4. Alsabti, K., Ranka, S., Singh, V.: CLOUDS: A Decision Tree Classifier for Large Datasets. In: Knowledge Discovery and Data Mining, pp. 2–8 (1998)

    Google Scholar 

  5. Andrade, H., Kurc, T., Sussman, A., Saltz, J.: Decision tree construction for data mining on clusters of shared-memory multiprocessors. Technical Report CS-TR-4203 and UMIACS-TR-2000-78. University of Maryland, Department of Computer Science and UMIACS (December 2000)

    Google Scholar 

  6. Anthony, M., Biggs, N.: Computational learning theory: an introduction. Cambridge Tracts in Theoretical Computer Science, vol. 30. Cambridge University Press, Cambridge (1992)

    MATH  Google Scholar 

  7. Bazan, J.: A Comparison of Dynamic and non-Dynamic Rough Set Methods for Extracting Laws from Decision Tables. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery 1: Methodology and Applications. Studies in Fuzziness and Soft Computing ch.17, vol. 18, pp. 321–365. Springer, Heidelberg (1998)

    Google Scholar 

  8. Bazan, J., Nguyen, H.S., Nguyen, S.H., Synak, P., Wróblewski, J.: Rough set algorithms in classification problems. In: Polkowski, et al. (eds.) [116], pp. 49–88

    Google Scholar 

  9. Bazan, J., Nguyen, H.S., Skowron, A., Szczuka, M.: A View on Rough Set Concept Approximations. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 627–630. Springer, Heidelberg (2003)

    Google Scholar 

  10. Bazan, J., Skowron, A., Synak, P.: Dynamic reducts as a tool for extracting laws from decision tables. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS, vol. 869, pp. 346–355. Springer, Heidelberg (1994)

    Google Scholar 

  11. Bazan, J.G., Szczuka, M.S.: RSES and rSESlib - A collection of tools for rough set computations. In: Ziarko, W.P., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 106–113. Springer, Heidelberg (2001)

    Google Scholar 

  12. Blake, A.: Canonical Expressions in Boolean Algebra. PhD thesis, University of Chicago (1937)

    Google Scholar 

  13. Boole, G.: Mathematical Analysis of Logic, London (1847)

    Google Scholar 

  14. Boole, G.: The Law of Thought. MacMillan (Dover Publications, New-York) (1854)

    Google Scholar 

  15. Breiman, L., Friedman, J., Olshen, R., Stone, C.: Classification and Regression Trees. Wadsworth and Brooks, Monterey (1984)

    MATH  Google Scholar 

  16. Brown, F.: Boolean Reasoning. Kluwer Academic Publishers, Dordrecht (1990)

    MATH  Google Scholar 

  17. Catlett, J.: On Changing Continuous Attributes into Ordered Discrete Attributes. In: Kodratoff, Y. (ed.) EWSL 1991. LNCS, vol. 482, pp. 164–178. Springer, Heidelberg (1991)

    Google Scholar 

  18. Chandra, A.K., Markowsky, G.: On the number of prime implicants. Discrete Mathematics 24(1), 7–11 (1978)

    MATH  MathSciNet  Google Scholar 

  19. Chang, C.-L., Lee, R.C.-T.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, London (1973)

    MATH  Google Scholar 

  20. Chlebus, B.S., Nguyen, S.H.: On finding optimal discretizations for two attributes. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS, vol. 1424, pp. 537–544. Springer, Heidelberg (1998)

    Google Scholar 

  21. Chmielewski, M.R., Grzymała-Busse, J.W.: Global discretization of continuous attributes as preprocessing for machine learning. Int. J. Approx. Reasoning 15(4), 319–331 (1996)

    MATH  Google Scholar 

  22. Clark, P., Boswell, R.: Rule induction with CN2: Some recent improvements. In: Proc. Fifth European Working Session on Learning, pp. 151–163. Springer, Berlin (1991)

    Google Scholar 

  23. Clark, P., Niblett, T.: The CN2 induction algorithm. Machine Learning 3(4), 261–283 (1989)

    Google Scholar 

  24. Cohen, W.W.: Fast Effective Rule Induction. In: Proceedings of the Twelfth International Conference on Machine Learning (ICML 1995), San Francisco, CA, pp. 115–123 (1995)

    Google Scholar 

  25. Cohen, W.W.: Learning Trees and Rules with Set-Valued Features. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI 1996), Portland, OR, pp. 709–716 (August 1996)

    Google Scholar 

  26. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5(7), 394–397 (1962)

    MATH  MathSciNet  Google Scholar 

  27. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7(3), 201–215 (1960)

    MATH  MathSciNet  Google Scholar 

  28. Dougherty, J., Kohavi, R., Sahami, M.: Supervised and Unsupervised Discretization of Continuous Features. In: ICML, pp. 194–202 (1995)

    Google Scholar 

  29. Duentsch, I., Gediga, G., Nguyen, H.S.: Rough Set Data Analysis in the KDD Process. In: Proc. of 8th International Conference IPMU 2000, Madrid, Spain, July 2000, pp. 220–226. Universidad Politechnica de Madrid (2000)

    Google Scholar 

  30. Esposito, F., Malerba, D., Semeraro, G.: A Comparative Analysis of Methods for Pruning Decision Trees. IEEE Transactions on Pattern Analysis and Machine Intelligence 19(5), 476–491 (1997)

    Google Scholar 

  31. Fayyad, U.M., Irani, K.B.: Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning. In: IJCAI, pp. 1022–1029 (1993)

    Google Scholar 

  32. Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.): Advances in Knowledge Discovery and Data Mining. The AAAI Press/The MIT Pres, Cambridge (1996)

    Google Scholar 

  33. Friedman, J.H., Kohavi, R., Yun, Y.: Lazy Decision Trees. In: Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, AAAI/IAAI 1996, vol. 1, pp. 717–724 (1996)

    Google Scholar 

  34. Gallaire, H., Minker, J. (eds.): Logic and Databases. Plenum Press, New York (1978)

    Google Scholar 

  35. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)

    MATH  Google Scholar 

  36. Goldberg, E., Novikov, Y.: BerkMin: A fast and robust SAT-solver. In: Proceedings of DATE 2002, pp. 142–149 (2002)

    Google Scholar 

  37. Goldsmith, J., Hagen, M., Mundhenk, M.: Complexity of DNF and isomorphism of monotone formulas. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 410–421. Springer, Heidelberg (2005)

    Google Scholar 

  38. Greco, S., Matarazzo, B., Słowiński, R.: Data mining tasks and methods: Classification: multicriteria classification. In: Kloesgen, W., Żytkow, J. (eds.) Handbook of KDD, pp. 318–328. Oxford University Press, Oxford (2002)

    Google Scholar 

  39. Grzymała-Busse, J.W.: LERS – A System for Learning from Examples based on Rough Sets. In: Słowiński (ed.) [147], pp. 3–18

    Google Scholar 

  40. Grzymała-Busse, J.W.: LERS – A Data Mining System. In: Maimon, Rokach (eds.) [67], pp. 1347–1351

    Google Scholar 

  41. Grzymała-Busse, J.W.: Rule Induction. In: Maimon, Rokach (eds.) [67], pp. 277–294

    Google Scholar 

  42. Grzymała-Busse, J.W., Ziarko, W.: Data Mining and Rough Set Theory. Communications of the ACM 43, 108–109 (2000)

    Google Scholar 

  43. Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers Inc., San Francisco (2000)

    Google Scholar 

  44. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Chen, W., Naughton, J., Bernstein, P.A. (eds.) 2000 ACM SIGMOD Intl. Conference on Management of Data, pp. 1–12. ACM Press, New York (2000)

    Google Scholar 

  45. Hand, D., Mannila, H., Smyth, P.: Principles of Data Mining. MIT Press, Cambridge (2001)

    Google Scholar 

  46. Hayes-Roth, F., Waterman, D.A., Lenat, D.B.: An Overview of Expert Systems. In: Hayes-Roth, F., Waterman, D.A., Lenat, D.B. (eds.) Building Expert Systems, pp. 3–29. Addison-Wesley, London (1983)

    Google Scholar 

  47. Heath, D.G., Kasif, S., Salzberg, S.: Induction of Oblique Decision Trees. In: IJCAI, pp. 1002–1007 (1993)

    Google Scholar 

  48. Holte, R.C.: Very simple classification rules perform well on most commonly used datasets. Machine Learning 11, 63–91 (1993)

    MATH  Google Scholar 

  49. Huntington, E.V.: Boolean algebra. A correction. Transactions of AMS 35, 557–558 (1933)

    MATH  MathSciNet  Google Scholar 

  50. Jensen, R., Shen, Q., Tuson, A.: Finding rough set reducts with SAT. In: Ślęzak, D., Wang, G., Szczuka, M.S., Düntsch, I., Yao, Y. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3641, pp. 194–203. Springer, Heidelberg (2005)

    Google Scholar 

  51. Jeroslow, R.G.: Logic-Based Decision Support. Mixed Integer Model Formulation. Elsevier, Amsterdam (1988)

    Google Scholar 

  52. John, G.H., Langley, P.: Static Versus Dynamic Sampling for Data Mining. In: Simoudis, E., Han, J., Fayyad, U.M. (eds.) Proc. 2nd Int. Conf. Knowledge Discovery and Data Mining, KDD, 2–4, 1996, pp. 367–370. AAAI Press, Menlo Park (1996)

    Google Scholar 

  53. Kautz, H.A., Selman, B.: Planning as Satisfiability. In: Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI 1992), pp. 359–363 (1992)

    Google Scholar 

  54. Kautz, H.A., Selman, B.: Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. In: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI 1996), pp. 1194–1201 (1996)

    Google Scholar 

  55. Keefe, R.: Theories of Vagueness. Cambridge Studies in Philosophy, Cambridge, UK (2000)

    Google Scholar 

  56. Kerber, R.: ChiMerge: Discretization of Numeric Attributes. In: Proceedings of the Tenth National Conference on Artificial Intelligence, San Jose, CA, pp. 123–128. AAAI Press, Menlo Park (1992)

    Google Scholar 

  57. Kloesgen, W., Żytkow, J. (eds.): Handbook of Knowledge Discovery and Data Mining. Oxford University Press, Oxford (2002)

    MATH  Google Scholar 

  58. Komorowski, J., Pawlak, Z., Polkowski, L., Skowron, A.: Rough sets: a tutorial. In: Pal, S.K., Skowron, A. (eds.) Rough Fuzzy Hybridization: A New Trend in Decision-Making, pp. 3–98. Springer, Singapore (1999)

    Google Scholar 

  59. Kowalski, R.A.: Logic for problem solving. North Holland, New York (1980)

    Google Scholar 

  60. Kryszkiewicz, M.: Maintenance of reducts in the variable precision rough set model. In: Lin, T.Y., Cercone, N. (eds.) Rough Sets and Data Mining – Analysis of Imperfect Data, pp. 355–372. Kluwer Academic Publishers, Boston (1997)

    Google Scholar 

  61. Kryszkiewicz, M., Cichoń, K.: Towards Scalable Algorithms for Discovering Rough Set Reducts. In: Peters, J.F., Skowron, A., Dubois, D., Grzymała-Busse, J.W., Inuiguchi, M., Polkowski, L. (eds.) Transactions on Rough Sets II. LNCS, vol. 3135, pp. 120–143. Springer, Heidelberg (2004)

    Google Scholar 

  62. Liu, H., Hussain, F., Tan, C.L., Dash, M.: Discretization: An Enabling Technique. Data Mining Knowledge Discovery 6(4), 393–423 (2002)

    MathSciNet  Google Scholar 

  63. Liu, H., Motoda, H. (eds.): Feature Selection for Knowledge Discovery and Data Mining. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  64. Liu, H., Setiono, R.: Chi2: Feature Selection and Discretization of Numeric Attributes. In: TAI 1995: Proceedings of the Seventh International Conference on Tools with Artificial Intelligence, Washington, DC, USA, p. 88. IEEE Computer Society Press, Los Alamitos (1995)

    Google Scholar 

  65. Loveland, D.W.: Automated Theorem Proving. A Logical Basis. Fundamental Studies in Computer Science, vol. 6. North-Holland, Amsterdam (1978)

    MATH  Google Scholar 

  66. Moskewicz, Y.Z.M., Madigan, C., Zhang, L.: Chaff: Engineering and efficient SAT solver. In: Proceedings of 38th Design Automation Conference (DAC2001) (June 2001)

    Google Scholar 

  67. Maimon, O., Rokach, L. (eds.): The Data Mining and Knowledge Discovery Handbook. Springer, Heidelberg (2005)

    Google Scholar 

  68. Manquinho, V.M., Flores, P.F., Silva, J.P.M., Oliveira, A.L.: Prime Implicant Computation Using Satisfiability Algorithms. In: 9th International Conference on Tools with Artificial Intelligence (ICTAI 1997), pp. 232–239 (1997)

    Google Scholar 

  69. Marques-Silva, J.P., Sakallah, K.A.: GRASP – A New Search Algorithm for Satisfiability. In: Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pp. 220–227 (November 1996)

    Google Scholar 

  70. Mehta, M., Agrawal, R., Rissanen, J.: SLIQ: A Fast Scalable Classifier for Data Mining. In: Extending Database Technology, pp. 18–32 (1996)

    Google Scholar 

  71. Mehta, M., Rissanen, J., Agrawal, R.: MDL-Based Decision Tree Pruning. In: Proceedings of the First International Conference on Knowledge Discovery and Data Mining (KDD 1995), pp. 216–221 (1995)

    Google Scholar 

  72. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, New York (1994)

    MATH  Google Scholar 

  73. Michalski, R.: Discovery Classification Rules Using Variable-valued Logic System VL1. In: Proceedings of the Third International Conference on Artificial Intelligence, pp. 162–172. Stanford University (1973)

    Google Scholar 

  74. Michalski, R., Mozetič, I., Hong, J., Lavrač, N.: The multi-purpose incremental learning system AQ15 and its testing application on three medical domains. In: Proc. Fifth National Conference on Artificial Intelligence, San Mateo, CA, pp. 1041–1045. Morgan Kaufmann, San Francisco (1986)

    Google Scholar 

  75. Michie, D., Spiegelhalter, D.J., Taylor, C.: Machine learning, Neural and Statistical Classification. Ellis Horwood, New York (1994)

    MATH  Google Scholar 

  76. Mingers, J.: An empirical comparison of pruning methods for decision tree induction. Machine Learning 4(2), 227–243 (1989)

    Google Scholar 

  77. Mitchell, T.: Machine Learning. Mc Graw Hill, New York (1998)

    Google Scholar 

  78. Murthy, S.K., Kasif, S., Salzberg, S.: A System for Induction of Oblique Decision Trees. Journal of Artificial Intelligence Research 2, 1–32 (1994)

    MATH  Google Scholar 

  79. Nguyen, H.S.: Discretization of Real Value Attributes, Boolean Reasoning Approach. PhD thesis, Warsaw University, Warsaw, Poland (1997)

    Google Scholar 

  80. Nguyen, H.S.: Rule induction from Continuous Data: New Discretization Concepts. In: Proc. of the III Joint Conference on Information Sciences, NC, USA, March 1997, vol. 3, pp. 81–84. Duke University (1997)

    Google Scholar 

  81. Nguyen, H.S.: Discretization problem for rough sets methods. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 545–552. Springer, Heidelberg (1998)

    Google Scholar 

  82. Nguyen, H.S.: From Optimal Hyperplanes to Optimal Decision Trees. Fundamenta Informaticae 34(1–2), 145–174 (1998)

    MATH  MathSciNet  Google Scholar 

  83. 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 1999, Stockholm, Sweden, pp. 806–811. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  84. Nguyen, H.S.: On Efficient Handling of Continuous Attributes in Large Data Bases. Fundamenta Informaticae 48(1), 61–81 (2001)

    MATH  MathSciNet  Google Scholar 

  85. Nguyen, H.S.: On Exploring Soft Discretization of Continuous Attributes. In: Pal, S.K., Polkowski, L., Skowron, A. (eds.) Rough-Neuro-Computing Techniques for Computing with Words, pp. 333–350. Springer, New York (2002)

    Google Scholar 

  86. Nguyen, H.S.: Scalable classification method based on rough sets. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 433–440. Springer, Heidelberg (2002)

    Google Scholar 

  87. Nguyen, H.S.: A Soft Decision Tree. In: Kłopotek, M.A., Wierzchoń, S., Michalewicz, M. (eds.) Intelligent Information Systems 2002 (Proc. IIS 2002). Advanced in Soft Computing, pp. 57–66. Springer, Heidelberg (2002)

    Google Scholar 

  88. Nguyen, H.S.: On Exploring Soft Discretization of Continuous Attributes. In: Pal, S.K., Polkowski, L., Skowron, A. (eds.) Rough-Neural Computing: Techniques for Computing with Words. Cognitive Technologies, pp. 333–350. Springer, Heidelberg (2003)

    Google Scholar 

  89. Nguyen, H.S.: On the Decision Table with Maximal Number of Reducts. In: Skowron, A., Szczuka, M. (eds.) Electronic Notes in Theoretical Computer Science, vol. 82. Elsevier, Amsterdam (2003)

    Google Scholar 

  90. Nguyen, H.S.: Approximate boolean reasoning approach to rough sets and data mining. In: Ślęzak, D., Yao, J., Peters, J.F., Ziarko, W.P., Hu, X. (eds.) RSFDGrC 2005. LNCS, vol. 3642, pp. 12–22. Springer, Heidelberg (2005)

    Google Scholar 

  91. Nguyen, H.S.: Rough Sets Approach to Learning in MAS – A tutorial. In: IEEE/WIC/ACM international conference on web intelligence and intelligent agent technology. tutorial notes of the 2005, Compiegne University, Compiegne, France (2005)

    Google Scholar 

  92. Nguyen, H.S., Nguyen, S.H.: From Optimal Hyperplanes to Optimal Decision Trees. In: Tsumoto, S., Kobayashi, S., Yokomori, T., Tanaka, H., Nakamura, A. (eds.) Proceedings of the Fourth International Workshop on Rough Sets, Fuzzy Sets, and Machine Discovery (RSFD 1996), Tokyo, Japan, November 6-8, 1996, pp. 82–88, The University of Tokyo (1996)

    Google Scholar 

  93. Nguyen, H.S., Nguyen, S.H.: Discretization Methods for Data Mining. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery, pp. 451–482. Springer, Heidelberg (1998)

    Google Scholar 

  94. Nguyen, H.S., Nguyen, S.H.: Fast split selection method and its application in decision tree construction from large databases. International Journal of Hybrid Intelligent Systems 2(2), 149–160 (2005)

    MATH  Google Scholar 

  95. Nguyen, H.S., Skowron, A.: Quantization of Real Values Attributes, Rough set and Boolean Reasoning Approaches. In: Proc. of the Second Joint Conference on Information Sciences, Wrightsville Beach, NC, USA, pp. 34–37 (October 1995)

    Google Scholar 

  96. Nguyen, H.S., Ślęzak, D.: Approximate reducts and association rules. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 137–145. Springer, Heidelberg (1999)

    Google Scholar 

  97. Nguyen, H.S., Szczuka, M.: Rough Sets In Knowledge Discovery and Data Mining – A tutorial. In: Washio, T. (ed.) VAST-Vietnam academy of Science and Technology, Tutorial Notes of the 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Hanoi, Wietnam, May 18 (2005)

    Google Scholar 

  98. Nguyen, S.H.: Regularity analysis and its applications in Data Mining. In: Polkowski, L., Lin, T.Y., Tsumoto, S. (eds.) Rough Set Methods and Applications: New Developments in Knowledge Discovery in Information Systems. Studies in Fuzziness and Soft Computing, vol. 56, pp. 289–378. Springer, Heidelberg (2000)

    Google Scholar 

  99. Nguyen, S.H.: Regularity Analysis and Its Applications in Data Mining. PhD thesis, Warsaw University, Warsaw, Poland (2000)

    Google Scholar 

  100. Nguyen, S.H., Bazan, J.G., Skowron, A., Nguyen, H.S.: Layered learning for concept synthesis. In: Peters, J.F., Skowron, A., Grzymała-Busse, J.W., Kostek, B.z., Świniarski, R.W., Szczuka, M.S. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 187–208. Springer, Heidelberg (2004)

    Google Scholar 

  101. Nguyen, S.H., Nguyen, H.S.: Some Efficient Algorithms for Rough Set Methods. In: Sixth International Conference on Information Processing and Management of Uncertainty on Knowledge Based Systems IPMU 1996, Granada, Spain, July 1-5, 1996, vol. III, pp. 1451–1456 (1996)

    Google Scholar 

  102. Nguyen, S.H., Nguyen, H.S.: Some Efficient Algorithms for Rough Set Methods. In: Proceedings of the Conference of Information Processing and Management of Uncertainty in Knowledge-Based Systems IPMU 1996, Granada, Spain, pp. 1451–1456 (July 1996)

    Google Scholar 

  103. Nguyen, S.H., Nguyen, H.S.: Pattern Extraction from Data. Fundamenta Informaticae 34(1–2), 129–144 (1998)

    MATH  MathSciNet  Google Scholar 

  104. Nguyen, S.H., Nguyen, H.S.: Pattern Extraction from Data. In: Proceedings of the Conference of Information Processing and Management of Uncertainty in Knowledge-Based Systems IPMU 1998, Paris, France, pp. 1346–1353 (July 1998)

    Google Scholar 

  105. Nguyen, S.H., Skowron, A., Synak, P.: Discovery of data patterns with applications to decomposition and classification problems. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery 2: Applications, Case Studies and Software Systems. Studies in Fuzziness and Soft Computing, vol. 19, ch.4, pp. 55–97. Springer, Heidelberg (1998)

    Google Scholar 

  106. Øhrn, A., Komorowski, J., Skowron, A., Synak, P.: The ROSETTA software system. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery 2. Applications, Case Studies and Software Systems. Studies in Fuzziness and Soft Computing, vol. 19, pp. 572–576. Springer, Heidelberg (1998)

    Google Scholar 

  107. Pawlak, Z.: Classification of objects by means of attributes. Research Report PAS 429, Institute of Computer Science, Polish Academy of Sciences (1981) ISSN 138-0648

    Google Scholar 

  108. Pawlak, Z.: Information systems – theoretical foundations. Information Systems 6, 205–218 (1981)

    MATH  Google Scholar 

  109. Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)

    MATH  MathSciNet  Google Scholar 

  110. Pawlak, Z.: Rough Classification. International Journal of Man-Machine Studies 20(5), 469–483 (1984)

    MATH  Google Scholar 

  111. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. System Theory, Knowledge Engineering and Problem Solving, vol. 9. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  112. Pawlak, Z.: Some Issues on Rough Sets. Transactions on Rough Sets 1, 1–58 (2004)

    MathSciNet  Google Scholar 

  113. Pawlak, Z., Wong, S.K.M., Ziarko, W.: Rough Sets: Probabilistic Versus Deterministic Approach. In: Gaines, B., Boose, J. (eds.) Machine Learning and Uncertain Reasoning, vol. 3, pp. 227–242. Academic Press, London (1990)

    Google Scholar 

  114. Pfahringer, B.: Compression-Based Discretization of Continuous Attributes. In: Proceedings of the 12th International Conference on Machine Learning, pp. 456–463 (1995)

    Google Scholar 

  115. Pizzuti, C.: Computing Prime Implicants by Integer Programming. In: Eighth International Conference on Tools with Artificial Intelligence (ICTAI 1996), pp. 332–336 (1996)

    Google Scholar 

  116. Polkowski, L., Lin, T.Y., Tsumoto, S. (eds.): Rough Set Methods and Applications: New Developments in Knowledge Discovery in Information Systems. Studies in Fuzziness and Soft Computing, vol. 56. Springer, Heidelberg (2000)

    Google Scholar 

  117. Polkowski, L., Skowron, A. (eds.): Rough Sets in Knowledge Discovery 2: Applications, Case Studies and Software Systems. Studies in Fuzziness and Soft Computing, vol. 19. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  118. Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence 9(3), 268–299 (1993)

    Google Scholar 

  119. Provost, F.J., Fawcett, T.: Analysis and Visualization of Classifier Performance: Comparison under Imprecise Class and Cost Distributions. In: Knowledge Discovery and Data Mining, pp. 43–48 (1997)

    Google Scholar 

  120. Quafafou, M.: α-RST: A generalization of rough set theory. Information Sciences 124(1-4), 301–316 (2000)

    MATH  MathSciNet  Google Scholar 

  121. Quine, W.V.O.: On cores and prime implicants of truth functions. American Mathematical – Monthly 66, 755–760 (1959)

    MATH  MathSciNet  Google Scholar 

  122. Quine, W.V.O.: Mathematical Logic. Harward University Press, CambMass (1961)

    Google Scholar 

  123. Quinlan, J.: C4.5 – Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  124. Quinlan, R.: Induction of Decision Trees. Machine Learning 1, 81–106 (1986)

    Google Scholar 

  125. Richeldi, M., Rossotto, M.: Class-driven statistical discretization of continuous attributes. In: Lavrač, N., Wrobel, S. (eds.) ECML 1995. LNCS, vol. 912, pp. 335–338. Springer, Heidelberg (1995)

    Google Scholar 

  126. Rissanen, J.: Modeling by shortes data description. Automatica 14, 465–471 (1978)

    MATH  Google Scholar 

  127. Rissanen, J.: Minimum-description-length principle, pp. 523–527. John Wiley & Sons, New York (1985)

    Google Scholar 

  128. Rudeanu, S.: Boolean Functions and Equations. North-Holland/American Elsevier, Amsterdam (1974)

    MATH  Google Scholar 

  129. Ryan, L.O.: Efficient algorithms for clause-learning SAT solvers. Master’s thesis, Simon Fraser University, Burnaby, Canada (2004)

    Google Scholar 

  130. Sarle, W.: Stopped training and other remedies for overfitting. In: Proceedings of the 27th Symposium on Interface (1995)

    Google Scholar 

  131. Selman, B., Kautz, H.A., McAllester, D.A.: Ten Challenges in Propositional Reasoning and Search. In: Proceedings of Fifteenth International Joint Conference on Artificial Intelligence, pp. 50–54 (1997)

    Google Scholar 

  132. Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI 1992), pp. 459–465 (1992)

    Google Scholar 

  133. Sen, S.: Minimal cost set covering using probabilistic methods. In: SAC 1993: Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing, pp. 157–164. ACM Press, New York (1993)

    Google Scholar 

  134. Shafer, J.C., Agrawal, R., Mehta, M.: SPRINT: A Scalable Parallel Classifier for Data Mining. In: Vijayaraman, T.M., Buchmann, A.P., Mohan, C., Sarda, N.L. (eds.) Proc. 22nd Int. Conf. Very Large Databases, VLDB, pp. 544–555. Morgan Kaufmann, San Francisco (1996)

    Google Scholar 

  135. Shannon, C.E.: A symbolic analysis of relay and switching circuits. Transactions of AIEE 57, 713–723 (1938)

    Google Scholar 

  136. Shannon, C.E.: A symbolic analysis of relay and switching circuits. MIT, Dept. of Electrical Engineering (1940)

    Google Scholar 

  137. Skowron, A.: Boolean Reasoning for Decision Rules Generation. In: Komorowski, J., Raś, Z.W. (eds.) ISMIS 1993. LNCS (LNAI), vol. 689, pp. 295–305. Springer, Heidelberg (1993)

    Google Scholar 

  138. Skowron, A.: Synthesis of Adaptive Decision Systems from Experimental Data. In: Aamodt, A., Komorowski, J. (eds.) Fifth Scandinavian Conference on Artificial Intelligence SCAI’1995, Trondheim, Norway, May 29-31, 1995. Frontiers in Artificial Intelligence and Applications, vol. 28, pp. 220–238. IOS Press, Amsterdam (1995)

    Google Scholar 

  139. Skowron, A.: Rough sets in KDD – plenary talk. In: Shi, Z., Faltings, B., Musen, M. (eds.) 16-th World Computer Congress (IFIP 2000): Proceedings of Conference on Intelligent Information Processing (IIP 2000), pp. 1–14. Publishing House of Electronic Industry, Beijing (2000)

    Google Scholar 

  140. Skowron, A., Nguyen, H.S.: Boolean reasoning scheme with some applications in data mining. In: Żytkow, J.M., Rauch, J. (eds.) PKDD 1999. LNCS (LNAI), vol. 1704, pp. 107–115. Springer, Heidelberg (1999)

    Google Scholar 

  141. Skowron, A., Pal, S.K. (eds.): Special volume: Rough sets, pattern recognition and data mining. Pattern Recognition Letters 24(6) (2003)

    Google Scholar 

  142. Skowron, A., Pawlak, Z., Komorowski, J., Polkowski, L.: A rough set perspective on data and knowledge. In: Kloesgen, W., Żytkow, J. (eds.) Handbook of KDD, pp. 134–149. Oxford University Press, Oxford (2002)

    Google Scholar 

  143. Skowron, A., Rauszer, C.: The Discernibility Matrices and Functions in Information Systems. In: [147], ch. 3, pp. 331–362

    Google Scholar 

  144. Skowron, A., Stepaniuk, J.: Tolerance Approximation Spaces. Fundamenta Informaticae 27(2-3), 245–253 (1996)

    MATH  MathSciNet  Google Scholar 

  145. Ślȩzak, D.: Various approaches to reasoning with frequency-based decision reducts: a survey. In: Polkowski, et al. (eds.) [116], pp. 235–285

    Google Scholar 

  146. Ślȩzak, D.: Approximate Entropy Reducts. Fundamenta Informaticae 53, 365–387 (2002)

    MathSciNet  Google Scholar 

  147. Słowiński, R. (ed.): Intelligent Decision Support – Handbook of Applications and Advances of the Rough Sets Theory. Kluwer Academic Publishers, Dordrecht (1992)

    MATH  Google Scholar 

  148. Słowiński, R., Vanderpooten, D.: Similarity Relation as a Basis for Rough Approximations. In: Wang, P. (ed.) Advances in Machine Intelligence and Soft Computing, vol. 4, pp. 17–33. Duke University Press, Duke (1997)

    Google Scholar 

  149. Stefanowski, J., Tsoukiàs, A.: Incomplete Information Tables and Rough Classification. International Journal of Computational Intelligence 17(3), 545–566 (2001)

    Google Scholar 

  150. Stepaniuk, J.: Approximation spaces, reducts and representatives. In: Polkowski, Skowron (eds.) [117], ch. 6, pp. 109–126

    Google Scholar 

  151. Stolorz, P., Musick, R. (eds.): Scalable High Performance Computing for Knowledge Discovery and Data Mining. Kluwer Academic Publishers, Norwell (1998)

    MATH  Google Scholar 

  152. Stone, M.H.: The theory of representations for Boolean algebras. Transactions of AMS 40, 37–111 (1936)

    MATH  Google Scholar 

  153. Umans, C.: The minimum equivalent dnf problem and shortest implicants. Journal of Computer and System Sciences 63(4), 597–611 (2001)

    MATH  MathSciNet  Google Scholar 

  154. Vapnik, V.: Statistical Learning Theory. John Wiley & Sons, New York (1998)

    MATH  Google Scholar 

  155. Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann, San Francisco (2005)

    Google Scholar 

  156. Wnek, J., Michalski, R.S.: Hypothesis-Driven Constructive Induction in AQ17-HCI: A Method and Experiments. Machine Learning 14, 139–168 (1994)

    MATH  Google Scholar 

  157. Wróblewski, J.: Theoretical Foundations of Order-Based Genetic Algorithms. Fundamenta Informaticae 28(3-4), 423–430 (1996)

    MATH  MathSciNet  Google Scholar 

  158. Wróblewski, J.: Genetic Algorithms in Decomposition and Classification Problem. In: Polkowski, Skowron (eds.) [117], pp. 471–487

    Google Scholar 

  159. Wróblewski, J.: Adaptive Methods of Object Classification, Ph.D. Thesis. Warsaw University, Warsaw (2002)

    Google Scholar 

  160. Zadeh, L.: Fuzzy logic and the calculi of fuzzy rules, fuzzy graphs, and fuzzy probabilities. Comput. Math. Appl. 37(11-12) (1999)

    Google Scholar 

  161. Zaki, M.: Efficient Enumeration of Frequent Sequences. In: Seventh International Conference on Information and Knowledge Management, Washington DC, pp. 68–75 (1998)

    Google Scholar 

  162. Ziarko, W.: The Discovery, Analysis and Representation of Data Dependencies in Databases. In: Piatetsky-Shapiro, G., Frawley, W.J. (eds.) Knowledge Discovery in Databases, pp. 195–212. AAAI/MIT Press, Palo Alto (1991)

    Google Scholar 

  163. Ziarko, W.: Variable Precision Rough Set Model. Journal of Computer and System Sciences 46, 39–59 (1993)

    MATH  MathSciNet  Google Scholar 

  164. Ziarko, W. (ed.): Rough Sets, Fuzzy Sets and Knowledge Discovery: Proceedings of the Second International Workshop on Rough Sets and Knowledge Discovery RSKD 1993, Banff, Alberta, Canada, October 12–15, 1993. Workshops in Computing. Springer–Verlag & British Computer Society, London, Berlin (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Warsaw University Banacha 2, 02-097, Warsaw, Poland

    Hung Son Nguyen

Authors
  1. Hung Son Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Manitoba, R3T 5V6, Winnipeg, Manitoba, Canada

    James F. Peters

  2. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nguyen, H.S. (2006). Approximate Boolean Reasoning: Foundations and Applications in Data Mining. In: Peters, J.F., Skowron, A. (eds) Transactions on Rough Sets V. Lecture Notes in Computer Science, vol 4100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847465_16

Download citation

  • DOI: https://doi.org/10.1007/11847465_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-39382-5

  • Online ISBN: 978-3-540-39383-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation