Skip to main content
SpringerLink
Log in
Book cover

International Conference on Data Warehousing and Knowledge Discovery

DaWaK 2012: Data Warehousing and Knowledge Discovery pp 291–302Cite as

Mining Popular Patterns from Transactional Databases

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7448))

Abstract

Since the introduction of the frequent pattern mining problem, researchers have extended frequent patterns to different useful patterns such as cyclic, emerging, periodic and regular patterns. In this paper, we introduce popular patterns, which captures the popularity of individuals, items, or events among their peers or groups. Moreover, we also propose (i) the Pop-tree structure to capture the essential information for the mining of popular patterns and (ii) the Pop-growth algorithm for mining popular patterns. Experimental results showed that our proposed tree structure is compact and space efficient and our proposed algorithm is time efficient.

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

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. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994, pp. 487–499 (1994)

    Google Scholar 

  2. Bailey, J., Manoukian, T., Ramamohanarao, K.: Fast Algorithms for Mining Emerging Patterns. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 39–50. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Cameron, J.J., Leung, C.K.-S., Tanbeer, S.K.: Finding strong groups of friends among friends in social networks. In: IEEE DASC 2011, pp. 824–831 (2011)

    Google Scholar 

  4. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD 2000, pp. 1–12 (2000)

    Google Scholar 

  5. Lakshmanan, L.V.S., Leung, C.K.-S., Ng, R.T.: Efficient dynamic mining of constrained frequent sets. ACM TODS 28(4), 337–389 (2003)

    Article  Google Scholar 

  6. Lee, Y.-K., Kim, W.-Y., Cai, Y.D., Han, J.: CoMine: efficient mining of correlated patterns. In: IEEE ICDM 2003, pp. 581–584 (2003)

    Google Scholar 

  7. Leung, C.K.-S., Hao, B.: Mining of frequent itemsets from streams of uncertain data. In: IEEE ICDE 2009, pp. 1663–1670 (2009)

    Google Scholar 

  8. Leung, C.K.-S., Jiang, F.: Frequent Pattern Mining from Time-Fading Streams of Uncertain Data. In: Cuzzocrea, A., Dayal, U. (eds.) DaWaK 2011. LNCS, vol. 6862, pp. 252–264. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Leung, C.K.-S., Sun, L.: A new class of constraints for constrained frequent pattern mining. In: ACM SAC 2012, pp. 199–204 (2012)

    Google Scholar 

  10. Leung, C.K.-S., Tanbeer, S.K.: Fast Tree-Based Mining of Frequent Itemsets from Uncertain Data. In: Lee, S.-g., Peng, Z., Zhou, X., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA 2012, Part I. LNCS, vol. 7238, pp. 272–287. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  11. Leung, C.K.-S., Tanbeer, S.K.: Mining Social Networks for Significant Friend Groups. In: Yu, H., Yu, G., Hsu, W., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA Workshops 2012. LNCS, vol. 7240, pp. 180–192. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  12. Rasheed, F., Alshalalfa, M., Alhajj, R.: Efficient periodicity mining in time series databases using suffix trees. IEEE TKDE 23(1), 79–94 (2011)

    Google Scholar 

  13. Rashid, M. M., Karim, M. R., Jeong, B.-S., Choi, H.-J.: Efficient Mining Regularly Frequent Patterns in Transactional Databases. In: Lee, S.-g., Peng, Z., Zhou, X., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA 2012, Part I. LNCS, vol. 7238, pp. 258–271. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  14. Wu, T., Chen, Y., Han, J.: Re-examination of interestingness measures in pattern mining: a unified framework. Data Mining and Knowledge Discovery 21(3), 371–397 (2010)

    Article  MathSciNet  Google Scholar 

  15. Xiong, H., Tan, P.-N., Kumar, V.: Hyperclique pattern discovery. Data Mining and Knowledge Discovery 13(2), 219–242 (2006)

    Article  MathSciNet  Google Scholar 

  16. Yao, H., Hamilton, H.J.: Mining itemset utilities from transaction databases. DKE 59(3), 603–626 (2006)

    Article  Google Scholar 

  17. Zhang, M., Kao, B., Cheung, D.W., Yip, K.Y.: Mining periodic patterns with gap requirement from sequences. ACM TKDD, 1(2), art. 7 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Manitoba, Winnipeg, MB, Canada

    Carson Kai-Sang Leung & Syed K. Tanbeer

Authors
  1. Carson Kai-Sang Leung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Syed K. Tanbeer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ICAR-CNR and University of Calabria, via P. Bucci 41C, 87036, Rende (CS), Italy

    Alfredo Cuzzocrea

  2. Hewlett Packard Labs, 1501 Page Mill Road, MS 1142, 94304, Palo Alto, CA, USA

    Umeshwar Dayal

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leung, C.KS., Tanbeer, S.K. (2012). Mining Popular Patterns from Transactional Databases. In: Cuzzocrea, A., Dayal, U. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2012. Lecture Notes in Computer Science, vol 7448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32584-7_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32584-7_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32583-0

  • Online ISBN: 978-3-642-32584-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation