基于闭模式的关联规则产生算法研究-计算机应用技术专业论文.docxVIP

江苏大学硕士研究生学位论文ABSTRACT 江苏大学硕士研究生学位论文 ABSTRACT Data Mining is a hot research topic in database and artificial intelligence fields tO find the useful knowledge hidden in the vast data．Association rules are an important． part of data mining，which could describe the relationships between multi items that may be useful in market analysis and business decision-making． Mining dosed patterns can produce much smaller equivalent result sets than mining frequent patterns．Now，there have been many algorithms tO mining frequent closed paaerns．But they can’t provide a best approach to mining dosed paRems． They must couserve the dosed patterns in memory or traverse the dill-set and compute the closure relation，s0 they can’t get the h谫efficiency and good scalability． The number of produced rules is very large，and many of them are useless to users．In order to resolve these problems，we do some researches on association rules mining based on closed patterns． This paper first introduces some theory knowledge，such弱the background knowledge of data mining and association rules．Next we interpret the definition of dosed patterns which provide a minimal representation of itemsets without losing support information．After that，based on the theoretical framework of Formal Concept Analysis and Iceberg Concept Lattice，we discuss how to extract relatively small bases for association rules from which all rules can be deduced．Then，a new algorithm for mining frequent closed paRems based Oil frequent pattern tree，FCIM algorithm is presented．The algorithm is in accordance with the divide—and-conquer method．We advance a concept of equal·child in the algorithm，with it we could utilize the foregone information tO reduce redundant complicated operations according tO the order from bottom tO top，and then fmd out every frequent dosed pattem without duplicates generation and memory conservation．We also take two measures to predict and extract the closed patterns嬲soon勰possible．It helps tO solve a number of p