计算机光盘软件与应用
計算機光盤軟件與應用
계산궤광반연건여응용
COMPUTER CD SOFTWARE ADN APPLICATIONS
2011年
18期
190-191
,共2页
动态关联规则%链表%DLFP—growth算法%DLFP-crce
動態關聯規則%鏈錶%DLFP—growth算法%DLFP-crce
동태관련규칙%련표%DLFP—growth산법%DLFP-crce
Mining dynamic association ruleiLinked list%DLFP-growth algorithm%DLFP-tree
态关联规则EFP-growth算法，适宜于高密度海量数据的挖掘，但是这种算法对于冗余数据需要重复扫描。本文提出了基于链表的DLFP—growth算法，本算法利用链表过滤冗余项，并且当数据发生增量更新时，无需重新扫描事物数据库，只需要重新扫描一次增量数据，修改链表，重新构造DLFP-tree。通过实验结果分析，验证DLFP—growth算法相对于EFP—growth算法，大大降低了挖掘的时间复杂度。
態關聯規則EFP-growth算法，適宜于高密度海量數據的挖掘，但是這種算法對于冗餘數據需要重複掃描。本文提齣瞭基于鏈錶的DLFP—growth算法，本算法利用鏈錶過濾冗餘項，併且噹數據髮生增量更新時，無需重新掃描事物數據庫，隻需要重新掃描一次增量數據，脩改鏈錶，重新構造DLFP-tree。通過實驗結果分析，驗證DLFP—growth算法相對于EFP—growth算法，大大降低瞭挖掘的時間複雜度。
태관련규칙EFP-growth산법，괄의우고밀도해량수거적알굴，단시저충산법대우용여수거수요중복소묘。본문제출료기우련표적DLFP—growth산법，본산법이용련표과려용여항，병차당수거발생증량경신시，무수중신소묘사물수거고，지수요중신소묘일차증량수거，수개련표，중신구조DLFP-tree。통과실험결과분석，험증DLFP—growth산법상대우EFP—growth산법，대대강저료알굴적시간복잡도。
EEP-growth algorithm of Dynamic association rules,suitable for high density data mining,but redundant data need to be repeated scanning by using this algorithm.This paper presents the algorithm of DLFP-growth based on linked list,this algorithm uses the linked list to filter redundancy item,and when the data have incremental updates,no need to scan the object database,only needs to scan an incremental data,modifying the list,to reconstruct DLFP-tree.Through the analysis of experiment results,verify that the DLFP-growth algorithm is compared to EFP-growth algorithm,greatly reduces the time complexity of mining.
