Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Weighted Voting-Based Associative Classification Algorithm

A Weighted Voting-Based Associative Classification Algorithm A new associative classification algorithm based on weighted voting (ACWV) is presented. ACWV takes advantage of two methods: the optimal rule method preferring high-quality rules and the voting method considering the majority of the rules. Moreover, the method takes into account both the length and convictions of rules to calculate their weights. First, ACWV builds a class-count FP-tree (called CCFP-tree) from the given historical data. After that, the weighted voting result for a new instance can be obtained from the CCFP-tree directly without storing, retrieving and sorting rules explicitly. The label of the class with maximal sum of weighted votes is then that of the new instance. Results of the experiments with 36 data sets selected from the UCI machine learning repository show that the proposed method has its advantages in comparison with previous methods in terms of classification accuracy. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The Computer Journal Oxford University Press

A Weighted Voting-Based Associative Classification Algorithm

The Computer Journal , Volume 53 (6) – Jul 25, 2010

Loading next page...
 
/lp/oxford-university-press/a-weighted-voting-based-associative-classification-algorithm-m1QZ0riG13

References (32)

Publisher
Oxford University Press
Copyright
The Author 2009. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissionsoxfordjournals.org
Subject
Section A
ISSN
0010-4620
eISSN
1460-2067
DOI
10.1093/comjnl/bxp074
Publisher site
See Article on Publisher Site

Abstract

A new associative classification algorithm based on weighted voting (ACWV) is presented. ACWV takes advantage of two methods: the optimal rule method preferring high-quality rules and the voting method considering the majority of the rules. Moreover, the method takes into account both the length and convictions of rules to calculate their weights. First, ACWV builds a class-count FP-tree (called CCFP-tree) from the given historical data. After that, the weighted voting result for a new instance can be obtained from the CCFP-tree directly without storing, retrieving and sorting rules explicitly. The label of the class with maximal sum of weighted votes is then that of the new instance. Results of the experiments with 36 data sets selected from the UCI machine learning repository show that the proposed method has its advantages in comparison with previous methods in terms of classification accuracy.

Journal

The Computer JournalOxford University Press

Published: Jul 25, 2010

Keywords: classification association rule associative classification weighted voting

There are no references for this article.