Skip to main content

Extracting Semantically Similar Frequent Patterns Using Ontologies

  • Conference paper
Swarm, Evolutionary, and Memetic Computing (SEMCCO 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7077))

Included in the following conference series:

Abstract

Many methods were proposed to generate a large number of association rules efficiently. These methods are dependent on non-semantic information such as support, confidence. Also work on pattern analysis has been focused on frequent patterns, sequential patterns, closed patterns. Identifying semantic information and extracting semantically similar frequent patterns helps to interpret the meanings of the pattern and to further explore them at different levels of abstraction. This paper makes a study on existing semantic similarity measures and proposes a new measure for calculating semantic similarity using domain dependent and domain independent ontologies. This paper also proposes an algorithm SSFPOA (Semantically Similar Frequent Patterns extraction using Ontology Algorithm) for extracting and clustering semantically similar frequent patterns. The case study which is illustrated in this paper shows that the algorithm can be used to produce association rules at high level of abstraction.

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 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., Srikant, R.: Fast algorithms for mining association Trules. In: Proc. 20th Int’l Conf. on Very Large Databases, pp. 487–499 (1994)

    Google Scholar 

  2. Toivonen, H.: Sampling large databases for association rules. In: Int’l Conf. on Very Large Databases, pp. 134–145 (1996)

    Google Scholar 

  3. Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Proc. of the 3rd Int’l Conf. on KDD and Data Mining (KDD 1997), Newport Beach, California (August 1997)

    Google Scholar 

  4. Yang, G., Shimada, K., Mabu, S., Hirasawa, K., Hu, J.: Mining Equalized Association Rules from Multi Concept Layers of Ontology Using Genetic Network Programming. In: Proc. of IEEE Cong. on Evolutionary Computation (CEC 2007), Singapore, pp. 705–712 (September 2007)

    Google Scholar 

  5. Yang, G., Shimada, K., Mabu, S., Hirasawa, K., Hu, J.: A Genetic Network Progrmming Based Method to Mine Generalized Association Rules with Ontology. Journal of Advanced Computational Intelligence and Intelligent Informatics (2006)

    Google Scholar 

  6. Mannila, H., Toivonen, H., Verkamo, A.I.: Efficient algorithms for discovering association rules. In: Proc. of the AAAI Workshop on Knowledge Discovery in Databases, pp. 181–192 (July 1994)

    Google Scholar 

  7. Shimada, K., Hirasawa, K., Hu, J.: Class Association Rule Mining with Chi-Squared Test Using Genetic Network Programming. In: Proc. of IEEE Int’l Conf. on Systems, Man and Cybernetics (ICSMC 2006), pp. 5338–5344 (October 2006)

    Google Scholar 

  8. Shimada, K., Hirasawa, K., Hu, J.: Genetic Network Programming with Acquisition Mechanisms of Association Rules. Journal of Advanced Computational Intelligence and Intelligent Informatics 10(1), 102–111 (2006)

    Article  Google Scholar 

  9. Agrawal, R., Imieliski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207–216 (1993)

    Google Scholar 

  10. Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53–87 (2004)

    Article  MathSciNet  Google Scholar 

  11. Mei, Q., Xin, D., Cheng, H., Han, J., Xiang, C.: Semantic Annotation of Frequent Patterns (2007)

    Google Scholar 

  12. Resnik, P.: Using information content to evaluate semantic similarity in a taxonomy (1995)

    Google Scholar 

  13. http://www.wordnet.princeton.edu

  14. Basu, S., Mooney, R.J., Pasupuleti, K.V., Ghosh, J.: Evaluating the Novelty of TextMined Rules Using Lexical Knowledge. In: Proceedings of the Seventh International Converence on Knowledge Discovery and Data Mining (2001)

    Google Scholar 

  15. Yang, G., Shimada, K., Mabu, S., Hirasawa, K.: A Personalized Association Rule Ranking Method Based on Semantic Similarity And Evolutionary Computation (2008)

    Google Scholar 

  16. Vasavi, S.: Semantic interoperability within heterogeneous environments using schema matching. PhD Thesis (2010)

    Google Scholar 

  17. Magnus, N., Hamilton, H.: package apriori, Copyright: University of Regina, Nathan Magnus and Su Yibin (June 2009)

    Google Scholar 

  18. Han, J., Fu, Y.: Mining Multiple-Level Association Rules in Large Databases. IEEE Transactions on Knowledge and Data Engineering 11(5) (September/October 1999)

    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

Vasavi, S., Jayaprada, S., Srinivasa Rao, V. (2011). Extracting Semantically Similar Frequent Patterns Using Ontologies. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2011. Lecture Notes in Computer Science, vol 7077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27242-4_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27242-4_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27241-7

  • Online ISBN: 978-3-642-27242-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics