Skip to main content

Mining Critical Least Association Rule from Oral Cancer Dataset

  • Conference paper
Recent Advances on Soft Computing and Data Mining

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 287))

  • 1488 Accesses

Abstract

Data mining has attracted many research attentions in the information industry. One of the important and interesting areas in data mining is mining infrequent or least association rule. Typically, least association rule is referred to the infrequent or uncommonness relationship among a set of item (itemset) in database. However, finding this rule is more difficult than frequent rule because they may contain only fewer data and thus require more specific measure. Therefore, in this paper we applied our novel measure called Critical Relative Support (CRS) to mine the critical least association rule from the medical dataset called Oral-Cancer-HUSM-S1. The result shows that CRS can be use to determine the least association rule and thus proven its scalability.

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

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. Han, J., Pei, H., Yin, Y.: Mining Frequent Patterns Without Candidate Generation. In: Proceeding SIGMOD 2000, Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, SIGMOD 2000, pp. 1–12 (2000)

    Google Scholar 

  2. Abdullah, Z., Herawan, T., Deris, M.M.: Detecting Definite Least Association Rule in Medical Database. In: Herawan, T., Deris, M.M., Abawajy, J. (eds.) Proceedings of the First International Conference on Advanced Data and Information Engineering (DaEng 2013). LNEE, vol. 285, pp. 127–134. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  3. Herawan, T., Vitasari, P., Abdullah, Z.: Mining Interesting Association Rules of Student Suffering Mathematics Anxiety. In: Zain, J.M., Wan Mohd, W.M.b., El-Qawasmeh, E. (eds.) ICSECS 2011, Part II. CCIS, vol. 180, pp. 495–508. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Herawan, T., Vitasari, P., Abdullah, Z.: Mining critical least association rules of student suffering language and social anxieties. Int. J. of Continuing Engineering Education and Life-Long Learning 23(2), 128–146 (2013)

    Google Scholar 

  5. Abdullah, Z., Herawan, T., Deris, M.M.: Mining Significant Least Association Rules Using Fast SLP-Growth Algorithm. In: Kim, T.-h., Adeli, H. (eds.) AST/UCMA/ISA/ACN 2010. LNCS, vol. 6059, pp. 324–336. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Kiran, R.U., Reddy, P.K.: An Improved Multiple Minimum Support Based Approach to Mine Rare Association Rules. In: Proceeding of IEEE Symposium on Computational Intelligence and Data Mining, pp. 340–347 (2009)

    Google Scholar 

  7. Zhou, L., Yau, S.: Assocation Rule and Quantative Association Rule Mining among Infrequent Items. In: Proceeding of ACM SIGKDD 2007, Article No. 9 (2007)

    Google Scholar 

  8. Koh, Y.S., Rountree, N.: Finding Sporadic Rules using Apriori-Inverse. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 97–106. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Yun, H., Ha, D., Hwang, B., Ryu, K.H.: Mining Association Rules on Significant Rare Data using Relative Support. The Journal of Systems and Software 67(3), 181–191 (2003)

    Article  Google Scholar 

  10. Herawan, T., Abdullah, Z., Mohd, W.M.W., Noraziah, A.: CLAR-Viz: Critical Least Association Rules Visualization. In: The 5th International Conference on Advanced Science and Technology (AST 2013), Hiddenbay Hotel, Yeosoo, South Korea, April 26-27 (2013)

    Google Scholar 

  11. Abdullah, Z., Herawan, T., Deris, M.M.: Detecting Critical Least Association Rules in Medical Databases. In: International Journal of Modern Physics: Conference Series, vol. 9, pp. 464–479. World Scientific Publishing Company (2012)

    Google Scholar 

  12. Szathmary, L., Valtchev, P., Napoli, A.: Generating Rare Association Rules Using the Minimal Rare Itemsets Family. Int. J. Software Informatics 4(3), 219–238 (2010)

    Google Scholar 

  13. Wang, K., Hee, Y., Han, J.: Pushing Support Constraints into Association Rules Mining. IEEE Transactions on Knowledge and Data Engineering 15(3), 642–658 (2003)

    Article  Google Scholar 

  14. Abdullah, Z., Herawan, T., Deris, M.M.: Tracing Significant Information using Critical Least Association Rules Model. International Journal of Innovative Computing and Applications, Inderscience 5, 3–17 (2013)

    Article  Google Scholar 

  15. Abdullah, Z., Herawan, T., Deris, M.M.: Mining Significant Least Association Rules Using Fast SLP-Growth Algorithm. In: Kim, T.-h., Adeli, H. (eds.) AST/UCMA/ISA/ACN 2010. LNCS, vol. 6059, pp. 324–336. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  16. Hoque, N., Nath, B., Bhattacharyya, D.K.: An Efficient Approach on Rare Association Rule Mining. In: Bansal, J.C., et al. (eds.) Proceedings of Seventh International Conference on Bio-Inspired Computing: Theories and Applications (BIC TA 2012). AISC, vol. 201, pp. 193–203. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  17. Tsang, S., Koh, Y.S., Dobbie, G.: Finding Interesting Rare Association Rules Using Rare Pattern Tree. In: Hameurlain, A., Küng, J., Wagner, R., Cuzzocrea, A., Dayal, U. (eds.) TLDKS VIII. LNCS, vol. 7790, pp. 157–173. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  18. Ding, J.: Efficient Association Rule Mining among Infrequent Items. Ph.D. Thesis, n University of Illinois at Chicago (2005)

    Google Scholar 

  19. Liu, B., Hsu, W., Ma, Y.: Mining Association Rules with Multiple Minimum Supports. In: Proceeding of ACM SIGKDD 1999, pp. 337–341 (1999)

    Google Scholar 

  20. Brin, S., Motwani, R., Silverstein, C.: Beyond Market Basket: Generalizing ARs to Correlations. In: Proceedings of the 1997 ACM-SIGMOD International Conference on the Management of Data (SIGMOD 1997), pp. 265–276 (1997)

    Google Scholar 

  21. Omniecinski, E.: Alternative Interest Measures for Mining Associations. IEEE Transaction on Knowledge and Data Engineering 15, 57–69 (2003)

    Article  Google Scholar 

  22. Lee, Y.-K., Kim, W.-Y., Cai, Y.D., Han, J.: CoMine: Efficient Mining of Correlated Patterns. In: The Proceeding of 2003 International Conference on Data Mining (ICDM 2003), pp. 581–584 (2003)

    Google Scholar 

  23. Herawan, T., Abdullah, Z., Mohd, W.M.W., Noraziah, A.: CLAR-Viz: Critical Least Association Rules Visualization. In: The 5th International Conference on Advanced Science and Technology (AST 2013), Hiddenbay Hotel, Yeosoo, South Korea, April 26-27 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zailani Abdullah .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Abdullah, Z., Mohd, F., Mohd Saman, M.Y., Deris, M.M., Herawan, T., Hamdan, A.R. (2014). Mining Critical Least Association Rule from Oral Cancer Dataset. In: Herawan, T., Ghazali, R., Deris, M. (eds) Recent Advances on Soft Computing and Data Mining. Advances in Intelligent Systems and Computing, vol 287. Springer, Cham. https://doi.org/10.1007/978-3-319-07692-8_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07692-8_50

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics