Skip to main content

An Efficient Approach for Discovering Closed Frequent Patterns in High Dimensional Data Sets

  • Conference paper
Advanced Computing, Networking and Informatics- Volume 1

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 27))

  • 1957 Accesses

Abstract

The growth in the new technology in the field of e-commerce and bioinformatics has resulted in production of large data sets with few new uniqueness. Microarray datasets consist of a very large number of features (nearly thousands of features) but very less number of rows because of its application type. ARM can be used to analyze such data and find the characteristics hidden in these data. However, most state-of-the-art ARM methods are not able to tackle a datasets containing large number of attributes effectively. In this paper, we have proposed and implemented a modified Carpenter algorithm with different consideration of data structure, which in result give us the better time complexity in compare to simple implementation of Carpenter.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Wright, A., McCoy, A., Henkin, S., Flaherty, M., Sittig, D.: Validation of an Association Rule Mining-Based Method to Infer Associations Between Medications and Problems. Ppl Clin. Inf. 4, 100–109 (2013)

    Article  Google Scholar 

  2. Pan, F., Cong, G., Tung, A.K.H.: Carpenter: Finding closed patterns in long biological datasets. In: Proceedings of ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 637–642 (2003)

    Google Scholar 

  3. Pei, J., Han, J., Mao, R.: CLOSET: An efficient algorithm for mining frequent closed item sets. In: Proceedings of ACM-SIGMOD International Workshop Data Mining and Knowledge Discovery, pp. 11–20 (2000)

    Google Scholar 

  4. Pan, F., Cong, G., Xin, X., Tung, A.K.H.: COBBLER: Combining Column and Row Enu-meration for Closed Pattern Discovery. In: International Conference on Scientific and Statistical Database Management, pp. 21–30 (2004)

    Google Scholar 

  5. Zaki, M., Hsiao, C.: Charm: An efficient algorithm for closed association rule mining. In: Proceedings of SDM, pp. 457–473 (2002)

    Google Scholar 

  6. Wang, J., Han, J., Pei, J.: Closet+: Searching for the best strategies for mining frequent closed item sets. In: Proceedings of 2003 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2003)

    Google Scholar 

  7. Chen, E.S., Hripcsak, G., Xu, H., Markatou, M., Friedma, C.: Automated Acquisition of Disease: Drug Knowledge from Biomedical and Clinical Documents: An Initial Study. J. Am. Med. Inform. Assoc., 87–98 (2008)

    Google Scholar 

  8. Sim, S., Gopalkrishnan, V., Zimek, A., Cong, G.: A survey on enhanced subspace clustering. Data Mining Knowl. Disc. 26, 332–397 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  9. Cheeseman, P.: Auto class: A Bayesian classification system. In: 5th International Conference on Machine Learning. Morgan Kaufmann (1988)

    Google Scholar 

  10. Associates, D.S.: The new direct marketing. Business One Irwin, Illinois (1990)

    Google Scholar 

  11. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of 1994 International Conference on Very Large Data Bases (VLDB 1994), pp. 487–499 (1994)

    Google Scholar 

  12. Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining frequent closed itemsets with counting inference. SIGKDD Explorations 2(2), 71–80 (2000)

    Article  Google Scholar 

  13. Hongyan, L., Han, J.W.: Mining frequent Patterns from Very High Dimensional Data: A Top-down Row Enumeration Approach. In: Proceedings of the Sixth SIAM International Conference on Data Mining, pp. 20–22 (2006)

    Google Scholar 

  14. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Proceedings of 7th International Conference on Database Theory, pp. 398–416 (1999)

    Google Scholar 

  15. Kriegel, H.P., Kröger, P., Zimek, A.: Clustering high-dimensional data: A survey on sub-space clustering, pattern-based clustering, and correlation clustering. ACM Transactions on Knowledge Discovery from Data 3(1), 1–58 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bharat Singh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Singh, B., Singh, R., Kushwaha, N., Vyas, O.P. (2014). An Efficient Approach for Discovering Closed Frequent Patterns in High Dimensional Data Sets. In: Kumar Kundu, M., Mohapatra, D., Konar, A., Chakraborty, A. (eds) Advanced Computing, Networking and Informatics- Volume 1. Smart Innovation, Systems and Technologies, vol 27. Springer, Cham. https://doi.org/10.1007/978-3-319-07353-8_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07353-8_60

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07352-1

  • Online ISBN: 978-3-319-07353-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics