NARFO Algorithm: Mining Non-redundant and Generalized Association Rules Based on Fuzzy Ontologies

  • Rafael Garcia Miani
  • Cristiane A. Yaguinuma
  • Marilde T. P. Santos
  • Mauro Biajiz
Part of the Lecture Notes in Business Information Processing book series (LNBIP, volume 24)


Traditional approaches for mining generalized association rules are based only on database contents, and focus on exact matches among items. However, in many applications, the use of some background knowledge, as ontologies, can enhance the discovery process and generate semantically richer rules. In this way, this paper proposes the NARFO algorithm, a new algorithm for mining non-redundant and generalized association rules based on fuzzy ontologies. Fuzzy ontology is used as background knowledge, to support the discovery process and the generation of rules. One contribution of this work is the generalization of non-frequent itemsets that helps to extract important and meaningful knowledge. NARFO algorithm also contributes at post-processing stage with its generalization and redundancy treatment. Our experiments showed that the number of rules had been reduced considerably, without redundancy, obtaining 63.63% average reduction in comparison with XSSDM algorithm.


Data Mining Generalized Association Rules Redundant Rules Fuzzy Ontology 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chen, G., Wei, Q., Kerre, E.E.: Fuzzy Data Mining: Discovery of Fuzzy Generalized Association Rules. In: Bordogna, G., Pasi, G. (eds.) Recent Issues on Fuzzy Databases, pp. 45–66. Physica-Verlag, Würzburg (2000)Google Scholar
  2. 2.
    Farzanyar, Z., Kangavari, M., Hashemi, S.: A New Algorithm for Mining Fuzzy Association Rules in the Large Databases Based on Ontology. In: Sixth IEEE International Conference on Data Mining – Workshops, Hong Kong, China, December 18-22 (2006)Google Scholar
  3. 3.
    Srikant, R., Agrawal, R.: Mining Generalized Association Rules. In: Proceedings of the International Conference of Very Large Data Bases, Zurich, Switzerland, September 11-15 (1995)Google Scholar
  4. 4.
    Hou, X., Gu, J., Shen, X., Yan, W.: Application of Data Mining in Fault Diagnosis Based on Ontology. In: 3th Third International Conference on Information Technology and Applications, Sydney, Australia, July 4-7 (2005)Google Scholar
  5. 5.
    Zadeh, L.: Similarity Relations and Fuzzy Orderings. In: Yager, R.R., Ovchinnikov, S., Tong, R.M., Nguyen, H.T. (eds.) Fuzzy Sets and Applications: Select Papers by L. A. Zadeh, pp. 81–104. Wiley Interscience, New York (1987a)Google Scholar
  6. 6.
    Zadeh, L.: Fuzzy Sets. In: Yager, R.R., Ovchinnikov, S., Tong, R.M., Nguyen, H.T. (eds.) Fuzzy sets and applications: Selected Papers by L.A. Zadeh, pp. 29–44. Wiley-Interscience, New York (1987b)Google Scholar
  7. 7.
    Chen, X., Zhou, X., Scherl, R.B., Geller, J.: Using an Interesting Ontology for Improved Support in Rule Mining. In: 5th InternationalConference on Data Warehousing and Knowledge Discovery, Prague, Czech Republic, September 3-5 (2003)Google Scholar
  8. 8.
    Escovar, E.L.G., Yaguinuma, C.A., Biajiz, M.: Using Fuzzy Ontologies to Extend Semantically Similar Data Mining. In: 21st Brazilian Symposium of Databases, Florianópolis, Brazil, October 16-20 (2006)Google Scholar
  9. 9.
    Brisson, L., Collard, M., Pasquier, N.: Improving Knowledge Discovery Process Using Ontologies. In: International Workshop on Mining Complex Data, Houston, USA, November 27-30 (2005)Google Scholar
  10. 10.
    Han, J., Fu, Y.: Mining Multiple-Level Association Rules in Large Databases. IEEE Transactions on Knowledge and Data Engeneering 11(5), 798–805 (1999)CrossRefGoogle Scholar
  11. 11.
    Sriphaew, K., Theeramunkong, T.: Fast algorithms for mining generalized frequent patterns of generalized association rules. IEICE Transactions on Information and Systems E87-D(3), 761–770 (2004)Google Scholar
  12. 12.
    Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Proceedings of the International Conference on Database Theory, Jerusalém, Israel, January 10-12 (1999)Google Scholar
  13. 13.
    Kunkle, D., Zhang, D.H., Cooperman, G.: Mining Generalized Frequent Itemsets and Generalized Association Rules Without Redundancy. Journal of Computer Science and Technology 23(1), 77–102 (2008)CrossRefGoogle Scholar
  14. 14.
    Bayardo, J.R.J.: Efficiently mining long patterns from databases. In: Proceedings of the 1998 Annual Conference on Management of Data, Seattle, USA, June 2-4 (1998)Google Scholar
  15. 15.
    Oliveira, V.C., Rezende, S.O., Castro, M.: Evaluating Generalized Association Rules Through Objective Measures. In: Proceedings of 25th International Multi-Conference on Artificial Intelligence and Applications, Innsbruck, Austria, February 12-14 (2007)Google Scholar
  16. 16.
    Escovar, E.L.G., Biajiz, M., Vieira, M.T.P.: SSDM: A Semantically Similar Data Mining Algorithm. In: 20th Brazilian Symposium of Databases, Uberlândia, Brazil, October 3-7 (2005)Google Scholar
  17. 17.
    Carrol, J.J., Dickinson, I., Dollin, C., Reynolds, D., Seaborn, A., Wilkinson, K.: Jena: implementing the semantic web recommendations. In: International World Wide Web Conference, New York, USA, May 19-21 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Rafael Garcia Miani
    • 1
  • Cristiane A. Yaguinuma
    • 1
  • Marilde T. P. Santos
    • 1
  • Mauro Biajiz
    • 1
  1. 1.Department of Computer ScienceFederal University of São Carlos (UFSCar)São CarlosBrazil

Personalised recommendations