skip to main content
10.1145/2905055.2905335acmotherconferencesArticle/Chapter ViewAbstractPublication PagesictcsConference Proceedingsconference-collections
research-article

Unique Constrained Class labeled Association Rule Mining

Published: 04 March 2016 Publication History

Abstract

Class labeled Association Rules (CARs) represents the relationship between attribute-valued pairs and frequent item set mining. These rules are mostly used in diabetes healthcare management for reducing the uncertainty factor of co-morbidities. Moreover the user selects mostly subsets of class based association rules. In this paper we proposed an algorithm named as unique constraint class labeled association rule based tree (UCCAR-tree), which contains three steps. In the first step identifying frequent unique item set constrained. Later, UCCAR tree is constructed. Finally Class labeled Association Rules are obtained from the tree by satisfying minimum confidence user specified threshold value. The experimental results are performed based on German and Chess datasets. The execution time and the scalability of UCCAR for both the datasets are experimented along with describing the characteristics of dataset. Diabetes healthcare management application is demonstrated for the proposed algorithm.

References

[1]
Centers for Disease Control and Prevention. "National diabetes fact sheet: National estimates and general infor- mation on diabetes and prediabetes in the United States," U.S. Department of Health and Human Services, Centers for Disease Control and Prevention, 2011 {Online}. Available: http://www.cdc.gov/diabetes/pubs/factsheet11.htm
[2]
Nguyen, L. T., Vo, B., Hong, T.-P., & Thanh, H. C. (2012). Classification based on association rules: A lattice-based approach. Expert Systems with Applications, 39, 11357--11366.
[3]
P. W. Wilson et al., "Pediction of incident diabetes mellitus in middle-aged adults-the framingham offspring study," Arch. Intern. Med., vol. 167, no. 10, pp. 1068--1074, May 2007.
[4]
Schlegel, B., Karnagel, T., Kiefer, T., & Lehner, W. (2013). Scalable frequent itemset mining on many-core processors. In The 9th International Workshop on Data Management on New Hardware. ACM. Article No. 3.
[5]
Srikant, R., Vu, Q., Agrawal, R., 1997. Mining association rules with item constraints. In: Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining (KDD 1997), pp. 67--73.
[6]
Vo, B., Le, B., 2009. A novel classification algorithm based on association rules mining, knowledge acquisition: approaches, algorithms and applications. In: Proceedings of Pacific Rim Knowledge Acquisition Workshop (PKAW 2008), Springer, Hanoi, Vietnam, pp. 61--75.
[7]
Wojciechowski, M., Zakrzewicz, M., 2002. Dataset filtering techniques in constraint-based frequent pattern mining. In: Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery, Springer, pp. 77--91.
[8]
Zhao, M., Cheng, X., He, Q., 2009. An algorithm of mining class association rules, Advances in Computation and Intelligence. In: Proceedings of the 4th International Symposium (ISICA 2009), Springer, Huangshi, China, pp. 269--275.
  1. Unique Constrained Class labeled Association Rule Mining

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    ICTCS '16: Proceedings of the Second International Conference on Information and Communication Technology for Competitive Strategies
    March 2016
    843 pages
    ISBN:9781450339629
    DOI:10.1145/2905055
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 04 March 2016

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Association rule
    2. Frequent Item sets
    3. Unique constrained

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Conference

    ICTCS '16

    Acceptance Rates

    Overall Acceptance Rate 97 of 270 submissions, 36%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 60
      Total Downloads
    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 02 Mar 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media