Skip to main content

On Possible Rules and Apriori Algorithm in Non-deterministic Information Systems: Part 2

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4482))

Abstract

A framework of Non-deterministic Information Systems (NISs) is known well for handling information incompleteness in Deter- ministic Information Systems (DISs). Apriori algorithm for the standard tables or DISs is also known as an algorithm to generate rules, which are characterized by criteria, support and accuracy. This paper extends Apriori algorithm in DISs to Apriori algorithm in NISs. This extended Apriori algorithm employs criteria, minimum support and minimum accuracy in NISs, and generates rules under the worst condition. A software tool is also implemented.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pawlak, Z.: Rough Sets - Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  2. Komorowski, J., et al.: Rough Sets: a tutorial. In: Rough Fuzzy Hybridization, pp. 3–98. Springer, Heidelberg (1999)

    Google Scholar 

  3. Lipski, W.: On Semantic Issues Connected with Incomplete Information Data Base. ACM Trans. DBS 4, 269–296 (1979)

    Google Scholar 

  4. Orłowska, E.: What You Always Wanted to Know about Rough Sets. In: Incomplete Information: Rough Set Analysis, pp. 1–20. Physica-Verlag, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Grzymala-Busse, J., Werbrouck, P.: On the Best Search Method in the LEM1 and LEM2 Algorithms. In: Incomplete Information: Rough Set Analysis, pp. 75–91. Physica-Verlag, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Stefanowski, J., Tsoukias, A.: On the Extension of Rough Sets under Incomplete Information. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 73–81. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Kryszkiewicz, M.: Rules in Incomplete Information Systems. Information Sciences 113, 271–292 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Sakai, H., Okuma, A.: Basic Algorithms and Tools for Rough Non-deterministic Information Analysis. In: Peters, J.F., et al. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 209–231. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. 20th Very Large Data Base, pp. 487–499 (1994)

    Google Scholar 

  10. Sakai, H., Nakata, M.: On Possible Rules and Apriori Algorithm in Non-deterministic Information Systems. In: Greco, S., et al. (eds.) RSCTC 2006. LNCS (LNAI), vol. 4259, pp. 264–273. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakai, H., Ishibashi, R., Koba, K., Nakata, M. (2007). On Possible Rules and Apriori Algorithm in Non-deterministic Information Systems: Part 2. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2007. Lecture Notes in Computer Science(), vol 4482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72530-5_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72530-5_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72529-9

  • Online ISBN: 978-3-540-72530-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics