Apriori关联规则算法的C语言实现.pdf
13 1 大 连 民 族 学 院 学 报 Vo.l 13, No. 1
2011 1 Journal of Dalian NationalitiesUniversity January 2011
: 1009- 31 X(2011) 01- 00 2- 04
Apriori C
a b c
李 楠, 宁燕子 , 杨存志
(辽宁师范大学 a. 计算机与信息技术学院; b. 档案馆; c. 教务处, 辽宁大连 116029)
: Apriori, C ,
,
: ; ; Apriori; C
: TP312 : A
Research and Im plem entation ofAprioriRules A lgorithm Based on C
a b c
LI Nan , NING Yan- zi, YANG Cun- zhi
( a. College of Com puter and Inform ation Technology; b. Arch ives;
c. A cadem icA ffairs D ivision L iaon ing Norm alUn iversity, Dalian Liaon ing 116029, China)
Abstract: A ssociation rule is an effective w ay for know ledge d iscovery in datam ining, w here in
algorithms. TheA priori is a classical algorithm. Based on the analysis of the algorithm A priori,
we introduced the algorithm s realization of discovery of frequent itemsets and generation of as
sociation ru les by using C, and at last it performs a validation to d iscover the frequent itemsets
from the traditional marketbasket, and also the rules satisfying w ith the m in mi um support and
confidence. W hich provide a solid foundation for further research of association rules.
Ke words: data m in ing; association ru les; A priori algorithm; C lanuage
( D ataM in ing, DM ) , X
, Y , : Support
( X! Y ) = |{T: X# Y T, T∃ D } | / |D |
[ 1]
, , X
( Know ledge D iscovery in Database, KDD) DY , : Confidence( X
, KDD ! Y)