Interesting Rough Lattice-based Implication Rules Discovery

  • Yi Zhao
  • Jianliang Shi
  • Da Ruan
  • Pengfei Shi
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 76)


As an important data mining technique, implication rules help to explore the dependencies among attributes of a database. In this paper, we aim at finding an efficient algorithm to discover the implication rules in a data set. This algorithm first extends the concept lattice theory by building the lattice according to the data set with the interesting attributes to improve user interaction and mining efficiency. The interesting concept lattice, together with the rough set theory, is then incorporated into our method to implement a new interesting rough lattice-based implication rules discovery (IRLIRD) approach to interactively acquire the rules with the specific rough upper and lower approximation. It generates implication rules without multiple passes over the data set and computing frequent itemsets. For the application of the proposed method to the transaction data set of the large-scale supermarkets, a novel data structure, which is based on the numeric attribute and termed as linked list of transaction set, is introduced here to reduce the needed memory. A simulation is implemented to illustrate the whole mining process, which demonstrates that the approach reduces the computational time greatly comparing with that of the classical Apriori algorithm. The algorithm can also be extended to many other application areas such as stock analysis, credit card distribution and agricultural application, etc.


Frequent Itemsets Concept Lattice Support Threshold Transaction Data Hasse Diagram 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Pawlak Z. Rough Sets. Kluwer Academic Publishers, Dordrecht, 1991.CrossRefGoogle Scholar
  2. [2]
    Ziarko W. Variable precision rough set model. Journal of Computer and System Scientifics 46, 1993, 39–59.CrossRefGoogle Scholar
  3. [3]
    Njiwoua P., Nguifo E.M. IGLUE: an instance-based learning system over lattice theory. In Proceedings of International Conference on Tools with Artificial Intelligence, Newport Beach, California, 1997: 75–76.CrossRefGoogle Scholar
  4. [4]
    Njiwoua P., Nguifo E.M. A parallel algorithm to build concept lattice. In Proceedings of 4th Groningen International Information Technique Conference for students, 1997: 103–107.Google Scholar
  5. [5]
    Frawley W.J., Shapiro GP., et al. Knowledge discovery in databases: an overview. In Shapiro G.P. and Frawley W.J., editors, Knowledge Discovery in Databases. AAAI/MIT, Cambridge, MA, 1991: 1–27.Google Scholar
  6. [6]
    Missaoui R., Godin R. Search for concepts and dependencies in databases. International Workshop on Rough Sets and Knowledge Discovery, Banff, Alberta, Springer-Verlag. 1994: 17–23.Google Scholar
  7. [7]
    Agrawal R, Mannila H, Srikant R et al. Fast Discovery of Association Rules. In: Fayyad M, Piatetsky-Shapiro G, Smyth P Eds. Advances in Knowledge Discovery and Data Mining, Menlo Park, AAAI Press, 1996: 307–328.Google Scholar
  8. [8]
    Hu X, Cercone N. Mining Knowledge Rules from Databases: A Rough Set Approach. In: Proceedings of the 12th International Conference on Data Engineering, New Orleans, Louiseana, 1996: 96–105.Google Scholar
  9. [9]
    Wille R. Concept lattice & Conceptual knowledge system. Computer Mathematics Applied, 23 (6–9), 1992: 493–515.CrossRefGoogle Scholar
  10. [10]
    Pawlak Z., Ziarko W. Rough Sets. Communication of the ACM, 38 (11), Nov. 1995: 36–41.CrossRefGoogle Scholar
  11. [11]
    Oosthuizen G.D. Rough sets and concept lattices. In Proceedings of International Conference on Rough Sets and Knowledge Discovery, Bannf, 1993.Google Scholar
  12. [12]
    Wu X. Induction as pre-processing. In Proceedings of 3`d PAKDD-99, Beijing, China, Springer, 1999: 114–122.Google Scholar

Copyright information

© Physica-Verlag Heidelberg 2001

Authors and Affiliations

  • Yi Zhao
    • 1
  • Jianliang Shi
    • 2
  • Da Ruan
    • 3
  • Pengfei Shi
    • 1
  1. 1.Institute of Image Processing & Pattern RecognitionShanghai Jiaotong UniversityShanghaiChina
  2. 2.Guoxin Lucent Technologies Network Technologies Co., Ltd.PudongShanghaiChina
  3. 3.Reactor Physics & Myrrha DepartmentBelgian Nuclear Research Centre (SCK•CEN)Mol, Boeretang 200Belgium

Personalised recommendations