Efficiency and consistency study on Carma

Yuan Huang, Xing Wang, Ben Chang Shia

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Carma is a type of online association algorithm, designed to facilitate association rule with online data flow and successively changing support thresholds. In this paper we study the factors that contribute to the efficiency of Carma and how data flow distribution give effects on the performance of Carma. We design several experiments with two kinds of data. In fixed support threshold situations, we compare Carma with that of Apriori. We find the sets generated by Carma are subsets of those generated by Apriori. We find that if the support threshold is reasonably defined, these two algorithms reach the same results. On the other hand, as the support threshold increases, Phase I generates less items and the number of deleted sets from Phase II first increases and then declines. Carma behaves consistently towards changing support. We notice the earlier the items enter into a lattice, the more accurate the estimations are. If base stone elements show up early in the transaction, the performance of Phase II is mainly influenced by the late-entered item sets. Based on the discussion with Carma, we propose a new procedure to improve Carma. Simulations reveal that the modified algorithm works well.

Original languageEnglish
Title of host publicationNCM 2009 - 5th International Joint Conference on INC, IMS, and IDC
Pages589-594
Number of pages6
DOIs
Publication statusPublished - 2009
Externally publishedYes
EventNCM 2009 - 5th International Joint Conference on Int. Conf. on Networked Computing, Int. Conf. on Advanced Information Management and Service, and Int. Conf. on Digital Content, Multimedia Technology and its Applications - Seoul, Korea, Republic of
Duration: Aug 25 2009Aug 27 2009

Other

OtherNCM 2009 - 5th International Joint Conference on Int. Conf. on Networked Computing, Int. Conf. on Advanced Information Management and Service, and Int. Conf. on Digital Content, Multimedia Technology and its Applications
CountryKorea, Republic of
CitySeoul
Period8/25/098/27/09

Fingerprint

Association rules
Experiments

Keywords

  • Apriori
  • Association rule algorithm
  • Carma

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Computer Science Applications
  • Software

Cite this

Huang, Y., Wang, X., & Shia, B. C. (2009). Efficiency and consistency study on Carma. In NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC (pp. 589-594). [5331786] https://doi.org/10.1109/NCM.2009.241

Efficiency and consistency study on Carma. / Huang, Yuan; Wang, Xing; Shia, Ben Chang.

NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC. 2009. p. 589-594 5331786.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Huang, Y, Wang, X & Shia, BC 2009, Efficiency and consistency study on Carma. in NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC., 5331786, pp. 589-594, NCM 2009 - 5th International Joint Conference on Int. Conf. on Networked Computing, Int. Conf. on Advanced Information Management and Service, and Int. Conf. on Digital Content, Multimedia Technology and its Applications, Seoul, Korea, Republic of, 8/25/09. https://doi.org/10.1109/NCM.2009.241
Huang Y, Wang X, Shia BC. Efficiency and consistency study on Carma. In NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC. 2009. p. 589-594. 5331786 https://doi.org/10.1109/NCM.2009.241
Huang, Yuan ; Wang, Xing ; Shia, Ben Chang. / Efficiency and consistency study on Carma. NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC. 2009. pp. 589-594
@inproceedings{d89f693f31c34b4aa6e157711443b577,
title = "Efficiency and consistency study on Carma",
abstract = "Carma is a type of online association algorithm, designed to facilitate association rule with online data flow and successively changing support thresholds. In this paper we study the factors that contribute to the efficiency of Carma and how data flow distribution give effects on the performance of Carma. We design several experiments with two kinds of data. In fixed support threshold situations, we compare Carma with that of Apriori. We find the sets generated by Carma are subsets of those generated by Apriori. We find that if the support threshold is reasonably defined, these two algorithms reach the same results. On the other hand, as the support threshold increases, Phase I generates less items and the number of deleted sets from Phase II first increases and then declines. Carma behaves consistently towards changing support. We notice the earlier the items enter into a lattice, the more accurate the estimations are. If base stone elements show up early in the transaction, the performance of Phase II is mainly influenced by the late-entered item sets. Based on the discussion with Carma, we propose a new procedure to improve Carma. Simulations reveal that the modified algorithm works well.",
keywords = "Apriori, Association rule algorithm, Carma",
author = "Yuan Huang and Xing Wang and Shia, {Ben Chang}",
year = "2009",
doi = "10.1109/NCM.2009.241",
language = "English",
isbn = "9780769537696",
pages = "589--594",
booktitle = "NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC",

}

TY - GEN

T1 - Efficiency and consistency study on Carma

AU - Huang, Yuan

AU - Wang, Xing

AU - Shia, Ben Chang

PY - 2009

Y1 - 2009

N2 - Carma is a type of online association algorithm, designed to facilitate association rule with online data flow and successively changing support thresholds. In this paper we study the factors that contribute to the efficiency of Carma and how data flow distribution give effects on the performance of Carma. We design several experiments with two kinds of data. In fixed support threshold situations, we compare Carma with that of Apriori. We find the sets generated by Carma are subsets of those generated by Apriori. We find that if the support threshold is reasonably defined, these two algorithms reach the same results. On the other hand, as the support threshold increases, Phase I generates less items and the number of deleted sets from Phase II first increases and then declines. Carma behaves consistently towards changing support. We notice the earlier the items enter into a lattice, the more accurate the estimations are. If base stone elements show up early in the transaction, the performance of Phase II is mainly influenced by the late-entered item sets. Based on the discussion with Carma, we propose a new procedure to improve Carma. Simulations reveal that the modified algorithm works well.

AB - Carma is a type of online association algorithm, designed to facilitate association rule with online data flow and successively changing support thresholds. In this paper we study the factors that contribute to the efficiency of Carma and how data flow distribution give effects on the performance of Carma. We design several experiments with two kinds of data. In fixed support threshold situations, we compare Carma with that of Apriori. We find the sets generated by Carma are subsets of those generated by Apriori. We find that if the support threshold is reasonably defined, these two algorithms reach the same results. On the other hand, as the support threshold increases, Phase I generates less items and the number of deleted sets from Phase II first increases and then declines. Carma behaves consistently towards changing support. We notice the earlier the items enter into a lattice, the more accurate the estimations are. If base stone elements show up early in the transaction, the performance of Phase II is mainly influenced by the late-entered item sets. Based on the discussion with Carma, we propose a new procedure to improve Carma. Simulations reveal that the modified algorithm works well.

KW - Apriori

KW - Association rule algorithm

KW - Carma

UR - http://www.scopus.com/inward/record.url?scp=73549110648&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=73549110648&partnerID=8YFLogxK

U2 - 10.1109/NCM.2009.241

DO - 10.1109/NCM.2009.241

M3 - Conference contribution

SN - 9780769537696

SP - 589

EP - 594

BT - NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC

ER -