基于粗集与位阵的关联规则挖掘算法研究-计算机应用技术专业论文.docxVIP

对此，本文提出了一种增量式更新最大频繁项集算法FAUMFI 对此，本文提出了一种增量式更新最大频繁项集算法FAUMFI (Fast Algorithm for Updating Maximum Frequent Itemsets)，该 算法将充分利用已有的一切信息(如旧的最大频繁项集、原来的 BitMatrix等)，以高效地发现最新事务数据库中所有的最大频繁项 集，并分析了算法的效率。 关键词数据挖掘，关联规则，粗集，位阵，频繁项集 VI ABSTRACTKnowledge ABSTRACT Knowledge discovery in database(KDD)has received increasing attention and has been recognized as a promising field of database research．It is defined as the non-trivial process of identifying valid， novel，potentially useful and ultimately understandable paaems in data． Mining association rules from large databases plays an essential role in many data mining tasks and has broad applications．Hi曲一performance scalable computing is crucial for ensuring system scalability and interactivity as datasets grow inexorably in size and complexity． The association rule mining algorithm use lattice-theoretic combinatorial properties to decompose the original problem into small independent sub-problems．The most famous and influential algorithms are Apriori and FP．growth．When all maximal frequent itemsets are short， these algorithms perform reasonably well．However，performance drastically decreases when any of the maximal itemsets becomes longer． In data mining applications where items are correlated，maximal frequent itemsets could be long． Algorithm DM．—．R is one mining algorithm proposed to deal with association rules．Algorithm DM—R lies on the concept of equivalent class in Rough Set Theory．Considering the localization of Association rules setting single minimum support threshold，it brings forward the discovery of numerous item class through many minimum supports and evaluating rule though interestingness．Algorithm DM_R significantly reduces the time for pattern match and is more efficient than the previous algorithms． The problem of Incremental updming of MFI is also introduced，and corresponding algorithms，FAUMFI，is proposed．The proposed algorithm makes full use of a built—up B itMatrix and max frequent itemsets(MFI)，thus it Can