Skip to main content

Efficient Algorithms for Video Association Mining

  • Conference paper

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

Abstract

Video Association Mining(VAM) is the process of discovering associations in a given video. Two key phases of VAM are (i) Transformation and (ii) Frequent Temporal Pattern Mining. The transformation phase converts the original input video to an alternate transactional format, namely a cluster sequence. Frequent temporal pattern mining phase concerns the generation of patterns subject to the temporal distance and support thresholds. The paper addresses the issue of frequent temporal pattern mining and studies algorithms for the same. The existing Apriori based algorithm is compared with three other approaches highlighting the case specific situations suited by each.

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. Han, J., Kamber, M.: Data Mining:Concepts and Techniques. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Very Large DataBases (VLDB), pp. 487–499 (1994)

    Google Scholar 

  3. Han, J., Pei, J., et al.: Mining Sequential Patterns by Pattern–Growth:The PrefixSpan Approach. IEEE Transactions of Knowledge and Data Engineering 16(11) (2004)

    Google Scholar 

  4. Han, J., Pei, J., et al.: Freespan: Frequent Pattern Projected Sequential Pattern Mining. In: ACM SIGKDD International Conference on Knowledge Discovery in Databases, pp. 355–359 (2000)

    Google Scholar 

  5. Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns Without Candidate Generation. In: ACM SIGMOD Conference, pp. 1–12 (2000)

    Google Scholar 

  6. Zaki, M.: SPADE: An Efficient Algorithm for Mining Frequent Sequences. Machine Learning 40, 31–60 (2001)

    Article  Google Scholar 

  7. Brin, S., Ullmann, J., Motwani, R., Tsur, S.: Dynamic Itemset Counting. In: ACM SIGMOD Conference, pp. 255–264 (1997)

    Google Scholar 

  8. Goethals, B.: Survey on Frequent Pattern Mining. Helsinki Technical Report 43 (2003)

    Google Scholar 

  9. Zhu, X., Wu, X.: Mining Video Associations for Efficient Database Management. In: 18th International Joint Conference on Artificial Intelligence, pp. 1422–1432 (2003)

    Google Scholar 

  10. Zaiane, O.R., Han, J., Li, Z., Chiang, J.: Multimedia Miner–A System Prototype for Multimedia Data Mining. In: ACM SIGMOD Conference, pp. 581–583 (2002)

    Google Scholar 

  11. Zaiane, O.R., Antonie, M.L., Coman, A.: Mammography Classification by an Association Rule based Classifier. In: International Workshop on MDM with ACM SIGKDD, pp. 62–69 (2002)

    Google Scholar 

  12. Zhu, X., Wu, X.: Sequential Association Mining for Video Summarization. In: ICME, Baltimore, pp. 333–336 (2003)

    Google Scholar 

  13. Tesic, J., Newsam, S., Manjunath, B.S.: Mining Image Datasets using Perceptual Association Rules. In: Mining Scientific and Engineering Datasets, pp. 71–77 (2003)

    Google Scholar 

  14. Zaiane, O.R., Han, J., Zhu, H.: Mining Recurrent items in Multimedia with Progressive Resolution Refinement. In: International Conference on Data Engineering, pp. 461–470 (2000)

    Google Scholar 

  15. Wijesekara, D., Barbara, D.: Mining Cinematic Knowledge–Work in Progress. In: International Workshop on MDM/KDD, pp. 98–103 (2000)

    Google Scholar 

  16. Zaiane, O.R., Han, J., Li, Z., Hou, J.: Mining Multimedia Data. In: CASCON, pp. 83–96 (1998)

    Google Scholar 

  17. Zaiane, O.R.: Resource and Knowledge Discovery from the Internet Multimedia Repositories. PhD thesis, Simon Fraser University (1999)

    Google Scholar 

  18. Zhu, X., Wu, X., et al.: Video Data Mining: Semantic Indexing and Event Detection from the Association Perspective. IEEE Transactions of Knowledge and Data Engineering 17(5) (2005)

    Google Scholar 

  19. Srikant, R., Agrawal, R.: Mining Sequential Patterns – Generalizations and Performance Improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 3–17. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  20. SivaSelvan, B., Krishnamurthi, I.: An Efficient Video Association Mining Algorithm. Journal of Computer Society of India 35(3), 56–67 (2005)

    Google Scholar 

  21. SivaSelvan, B., Gopalan, N.P.: An Efficient Frequent Temporal Pattern (EFTP) Mining Algorithm. Information Technology Journal 5(6), 1043–1047 (2006)

    Article  Google Scholar 

  22. Gopalan, N.P., SivaSelvan, B.: An m-ary tree based Frequent Temporal Pattern (FTP) Mining Algorithm. In: 6th IEEE INDICON International Conference (2006)

    Google Scholar 

  23. Sedgewick, R.: Permutation Generation Methods. ACM Computing Surveys 9(2), 137–164 (1977)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ziad Kobti Dan Wu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

SivaSelvan, B., Gopalan, N.P. (2007). Efficient Algorithms for Video Association Mining. In: Kobti, Z., Wu, D. (eds) Advances in Artificial Intelligence. Canadian AI 2007. Lecture Notes in Computer Science(), vol 4509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72665-4_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72665-4_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72664-7

  • Online ISBN: 978-3-540-72665-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics