基于正相关关联规则的分类算法-计算机软件与理论专业论文.docxVIP

基于正相关关联规则的分类算法Abstract 基于正相关关联规则的分类算法 Abstract Classification is a basic task of data mining research，association rule miulng is all important area ofdata mining research,classification based on association rule mining break a new path in data classification．The normal classification based ON association rule algorithms usually mine all association rules set in training database．Then曲ey classify or predict the test database by a high p叮f湎柚ce classification rule set which is chosen in a11 asSOeiafion rules set． Previous studies propose that classification based Oil association rule has hi曲 classification accuracy and strong flexibility．However,there are huge classification rules in the classifier,and the most of it are hdpless in classification．And classification will be overfitting sometimes since it is based on only single high-confidence rule．So the key ofclassification based on association rule algorithms is the constructing of classifier i．e．classification rule set．We need different measurements to evaluate the performance ofthe classification rule set． The main content ofthis paper are how to get more meaning association rules and how to elassify test datasets by the meaning association rules．In this paper,we propose a new associative classification algorithm．CPCAR,i．e．Classification based on Positively Correlated Association Rules．The algorithm improves the FP·Growth algorithm,it estimates positively corrdation of frequent item sets when mey are gotten．So the final frequent itcmsets is positively correlated．The algorifl1=m can get the original classification rules set by positively correlated frequent itcmsets，For enhancing the accuracy and efficiency of classification,the algorithm selects the predictive rules in the original classification rule set by confidence to generate classifiers which are composed by positively correlated association rules。．When it classifies，at first,the algorithm selects all rules which can classify test transaction in each c