DOI: 10.1007/978-3-540-73499-4_26
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Rule Ordering Approach in Classification Association Rule Mining

Abstract: Abstract.A Classification Association Rule (CAR), a common type of mined knowledge in Data Mining, describes an implicative co-occurring relationship between a set of binary-valued data-attributes (items) and a pre-defined class, expressed in the form of an "antecedent ⇒ consequent-class" rule. Classification Association Rule Mining (CARM) is a recent Classification Rule Mining (CRM) approach that builds an Association Rule Mining (ARM) based classifier using CARs. Regardless of which particular methodology is… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
37
0
1

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 29 publications
(38 citation statements)
references
References 12 publications
0
37
0
1
Order By: Relevance
“…Association rules derived depends on confidence. Frequent item set generation is done using data mining algorithms like Apriori [4], FP-Growth Algorithm [5], Eclat [6] and K-Apriori [7]. Apriori algorithm for frequent item set mining is given below.…”
Section: Market Basket Analysis Using Fast Algorithmsmentioning
confidence: 99%
“…Association rules derived depends on confidence. Frequent item set generation is done using data mining algorithms like Apriori [4], FP-Growth Algorithm [5], Eclat [6] and K-Apriori [7]. Apriori algorithm for frequent item set mining is given below.…”
Section: Market Basket Analysis Using Fast Algorithmsmentioning
confidence: 99%
“…그러나 그룹 별 관측치 의 개수가 균등하게 분포된 데이터일 경우 기존 분류정확도와 의 차이가 없기 때문에 이러한 문제점까지 보완하여 고안된 기 법이 가중 상대적 분류정확도(Weighted Relative Accuracy : WRACC)이며 식 (6)과 같다 (Lavrač et al, 1999). (Lavrač et al, 1999;Coenen et al, 2004;Wang et al, 2007). 식 (7)에서 는 데이터의 클래스 개 수이다.…”
Section: 룰 정렬 방식unclassified
“…Hence, the highest-order rules are tested in advance and then inserted into the classifier for predicting test data objects. For rule re-ordering, there are five popular mechanisms [31]: (1) Confidence Support size of Antecedent (CSA), (2) size of Antecedent Confidence Support (ACS), (3) Weighted Relative Accuracy (WRA), (4) Laplace Accuracy, and (5) χ 2 (chi-square) measure. CSA and ACS are belong to the pure "support-confidence" framework and have been used by CBA and CMAR for rule ranking.…”
Section: Post-processing For Associative Classifier Constructionmentioning
confidence: 99%
“…We use "Best First Rule" [31] method to predict the new file samples. We select the first best rule that satisfies the new file sample according to the rule list based on our hybrid CSA/χ 2 rule re-ordering method to predict whether the new case is malware or not.…”
Section: Post-processing For Associative Classifier Constructionmentioning
confidence: 99%