Skip to main content

Efficiently Finding the Best Parameter for the Emerging Pattern-Based Classifier PCL

  • Conference paper
Book cover Advances in Knowledge Discovery and Data Mining (PAKDD 2010)

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

Included in the following conference series:

Abstract

Emerging patterns are itemsets whose frequencies change sharply from one class to the other. PCL is an example of efficient classification algorithms that leverage the prediction power of emerging patterns. It first selects the top-K emerging patterns of each class that match a testing instance, and then uses these selected patterns to decide the class label of the testing instance. We study the impact of the parameter K on the accuracy of PCL. We have observed that in many cases, the value of K is critical to the performance of PCL. This motivates us to develop an algorithm to find the best value of K for PCL. Our results show that finding the best K can improve the accuracy of PCL greatly, and employing incremental frequent itemset maintenance techniques reduces the running time of our algorithm significantly.

Supported by A*STAR grant (SERC 072 101 0016).

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 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.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. Bailey, J., Manoukian, T., Ramamohanarao, K.: Classification using constrained emerging patterns. In: Dong, G., Tang, C., Wang, W. (eds.) WAIM 2003. LNCS, vol. 2762, pp. 226–237. Springer, Heidelberg (2003)

    Google Scholar 

  2. Cheng, H., et al.: Discriminative frequent pattern analysis for effective classification. In: Proc 23th ICDE, pp. 716–725 (2007)

    Google Scholar 

  3. Cheng, H., et al.: Direct discriminative pattern mining for effective classification. In: Proc 24th ICDE, pp. 169–178 (2008)

    Google Scholar 

  4. Dong, G., et al.: CAEP: Classification by Aggregating Emerging Patterns. In: Proc. 2nd Intl. Conf. on Discovery Science, pp. 30–42 (1999)

    Google Scholar 

  5. Feng, M.: Frequent Pattern Maintenance: Theories and Algorithms. PhD thesis, Nanyang Technological University (2009)

    Google Scholar 

  6. Feng, M., et al.: Negative generator border for effective pattern maintenance. In: Proc 4th Intl. Conf. on Advanced Data Mining and Applications, pp. 217–228 (2008)

    Google Scholar 

  7. Feng, M., et al.: Evolution and maintenance of frequent pattern space when transactions are removed. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4426, pp. 489–497. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Li, W., Han, J., Pei, J.: CMAR: Accurate and efficient classification based on multiple class-association rules. In: Proc 1st ICDM, pp. 369–376 (2001)

    Google Scholar 

  9. Li, J., Wong, L.: Solving the fragmentation problem of decision trees by discovering boundary emerging patterns. In: Proc. 2nd ICDM, pp. 653–656 (2002)

    Google Scholar 

  10. Li, J., Wong, L.: Structural geography of the space of emerging patterns. Intelligent Data Analysis 9(6), 567–588 (2005)

    Google Scholar 

  11. Li, J., Ramamohanarao, K., Dong, G.: The space of jumping emerging patterns and its incremental maintenance algorithms. In: Proc. of 17th ICML, pp. 551–558 (2000)

    Google Scholar 

  12. Li, J., et al.: Minimum description length principle: Generators are preferable to closed patterns. In: Proc. 21st Natl. Conf. on Artificial Intelligence, pp. 409–415 (2006)

    Google Scholar 

  13. Li, H., et al.: Relative risk and odds ratio: A data mining perspective. In: Proc 24th PODS, pp. 368–377 (2005)

    Google Scholar 

  14. Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rule mining. In: Proc. 4th KDD, pp. 80–86 (1998)

    Google Scholar 

  15. Ramamohanarao, K., Fan, H.: Patterns based classifiers. In: Proc. 16th WWW, pp. 71–83 (2007)

    Google Scholar 

  16. Ramamohanarao, K., Bailey, J.: Discovery of emerging patterns and their use in classification. In: Gedeon, T(T.) D., Fung, L.C.C. (eds.) AI 2003. LNCS (LNAI), vol. 2903, pp. 1–12. Springer, Heidelberg (2003)

    Google Scholar 

  17. Thabtah, F.A., Cowling, P., Peng, Y.: MMAC: A new Multi-class Multi-label Associative Classification approach. In: Proc. 4th ICDM, pp. 217–224 (2004)

    Google Scholar 

  18. Yin, X., Han, J.: CPAR: Classification based on Predictive Association Rules. In: Proc. 3rd SDM, pp. 331–335 (2003)

    Google Scholar 

  19. Wang, J., Karypis, G.: HARMONY: Efficiently mining the best rules for classification. In: Proc. 5th SDM, pp. 205–216 (2005)

    Google Scholar 

  20. Zhang, X., Dong, G., Ramamohanarao, K.: Information-based classification by aggregating emerging patterns. In: Proc. 2nd Intl. Conf. on Intelligent Data Engineering and Automated Learning, pp. 48–53 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ngo, TS., Feng, M., Liu, G., Wong, L. (2010). Efficiently Finding the Best Parameter for the Emerging Pattern-Based Classifier PCL. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2010. Lecture Notes in Computer Science(), vol 6118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13657-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13657-3_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13656-6

  • Online ISBN: 978-3-642-13657-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics