Skip to main content

Conceptual Distance for Association Rules Post-processing

  • Conference paper
Model and Data Engineering (MEDI 2011)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6918))

Included in the following conference series:

  • 744 Accesses

Abstract

Data-mining methods have the drawbacks to generate a very large number of rules, sometimes obvious, useless or not very interesting to the user. In this paper we propose a new approach to find unexpected rules from a set of discovered association rules. This technique is characterized by analyzing the discovered association rules using the user’s existing knowledge about the domain represented by a fuzzy domain ontology and then ranking the discovered rules according to the conceptual distance of the rule.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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.: Database mining: A performance perspective. IEEE Transactions on Knowledge and Data Engineering 5(6), 914–925 (1993)

    Article  Google Scholar 

  2. Usama, M.: Fayyad, Gregory Piatetsky-Shapiro, and Padhraic Smyth. From data mining to knowledge discovery: An overview. In: Advances in Knowledge Discovery and Data Mining, pp. 1–34 (1996)

    Google Scholar 

  3. Liu, B., Hsu, W.: Post-analysis of learned rules. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, Menlo Park, August 4-8, pp. 828–834. AAAI Press/MIT Press (1996)

    Google Scholar 

  4. Liu, B., Hsu, W., Mun, L.-F., Lee, H.-Y.: Finding interesting patterns using user expectations. IEEE Trans. Knowl. Data Eng. 11(6), 817–832 (1999)

    Article  Google Scholar 

  5. Padmanabhan, B., Tuzhilin, A.: On the discovery of unexpected rules in data mining applications. In: On the Discovery of Unexpected Rules in Data Mining Applications, pp. 81–90 (1997); Procs. of the Workshop on Information Technology and Systems (WITS 1997)

    Google Scholar 

  6. Padmanabhan, B., Tuzhilin, A.: On characterization and discovery of minimal unexpected patterns in rule discovery. IEEE Trans. Knowl. Data Eng. 18(2), 202–216 (2006)

    Article  Google Scholar 

  7. Rada, R., Mili, H., Bicknell, E., Blettner, M.: Development and application of a metric on semantic nets. IEEE Transactions on Systems, Man, and Cybernetics 19(1), 17–30 (1989)

    Article  Google Scholar 

  8. Silberschatz, A., Tuzhilin, A.: What makes patterns interesting in knowledge discovery systems. IEEE Transactions on Knowledge and Data Engineering 8(6), 970–974 (1996)

    Article  Google Scholar 

  9. Uthurusamy, R., Fayyad, U.M., Spangler, W.S.: Learning useful rules from inconclusive data. In: Knowledge Discovery in Databases, pp. 141–158 (1991)

    Google Scholar 

  10. Richardson, R., Smeaton, A.F.: Using WordNet in a knowledge-based approach to information retrieval. Technical Report CA-0395, School of Computer Applications, Dublin City University, Dublin, Ireland (1995)

    Google Scholar 

  11. Huttenlocher, D.P., Kl, G.A., Rucklidge, W.J.: Comparing images using the hausdorff distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 15, 850–863 (1993)

    Article  Google Scholar 

  12. Borgelt, C.: http://www.borgelt.net/software.html

  13. Census income, ftp://ftp.ics.uci.edu/pub/machine-learning-databases/census-income/

  14. Ng, R.T., Lakshmanan, L.V.S., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained associatino rules. In: SIGMOD 1998 (1998)

    Google Scholar 

  15. http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

  16. Guarino, N.: Formal ontology and information systems. In: Guarino, N. (ed.) Proceedings FOIS 1998, pp. 3–15. IOS Press, Amsterdam (1998)

    Google Scholar 

  17. Sahar, S.: On incorporating subjective interestingness into the mining process. In: ICDM, pp. 681–684 (2002)

    Google Scholar 

  18. Mansingh, G., Osei-Bryson, K.-M., Reichgelt, H.: Using ontologies to facilitate post-processing of association rules by domain experts. Inf. Sci. 181(3), 419–434 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maamri, R., Hamani, M.s. (2011). Conceptual Distance for Association Rules Post-processing. In: Bellatreche, L., Mota Pinto, F. (eds) Model and Data Engineering. MEDI 2011. Lecture Notes in Computer Science, vol 6918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24443-8_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24443-8_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24442-1

  • Online ISBN: 978-3-642-24443-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics