期刊文献+

A Novel Incremental Mining Algorithm of Frequent Patterns for Web Usage Mining 被引量:1

A Novel Incremental Mining Algorithm of Frequent Patterns for Web Usage Mining
下载PDF
导出
摘要 Because data warehouse is frequently changing, incremental data leads to old knowledge which is mined formerly unavailable. In order to maintain the discovered knowledge and patterns dynamically, this study presents a novel algorithm updating for global frequent patterns-IPARUC. A rapid clustering method is introduced to divide database into n parts in IPARUC firstly, where the data are similar in the same part. Then, the nodes in the tree are adjusted dynamically in inserting process by "pruning and laying back" to keep the frequency descending order so that they can be shared to approaching optimization. Finally local frequent itemsets mined from each local dataset are merged into global frequent itemsets. The results of experimental study are very encouraging. It is obvious from experiment that IPARUC is more effective and efficient than other two contrastive methods. Furthermore, there is significant application potential to a prototype of Web log Analyzer in web usage mining that can help us to discover useful knowledge effectively, even help managers making decision. Because data warehouse is frequently changing, incremental data leads to old knowledge which is mined formerly unavailable. In order to maintain the discovered knowledge and patterns dynamically, this study presents a novel algorithm updating for global frequent patterns-IPARUC. A rapid clustering method is introduced to divide database into n parts in IPARUC firstly, where the data are similar in the same part. Then, the nodes in the tree are adjusted dynamically in inserting process by "pruning and laying back" to keep the frequency descending order so that they can be shared to approaching optimization. Finally local frequent itemsets mined from each local dataset are merged into global frequent itemsets. The results of experimental study are very encouraging. It is obvious from experiment that IPARUC is more effective and efficient than other two contrastive methods. Furthermore, there is significant application potential to a prototype of Web log Analyzer in web usage mining that can help us to discover useful knowledge effectively, even help managers making decision.
出处 《Wuhan University Journal of Natural Sciences》 CAS 2007年第5期777-782,共6页 武汉大学学报(自然科学英文版)
基金 Supported by the National Natural Science Foundation of China(60472099) Ningbo Natural Science Foundation(2006A610017)
关键词 incremental algorithm association rule frequent pattern tree web usage mining incremental algorithm association rule frequent pattern tree web usage mining
  • 相关文献

参考文献3

二级参考文献14

  • 1RAgrawa1 TImie1inSki Aswami.Mining association ru1es between sets of items in 1arge database[J].The ACM SIGMOD Intemationa1 Conf on Management of Data, Washington, DC,1993,.
  • 2Han J.W.,Kamber M..Data Mining:Concepts and Techniques.Beijing:Higher Education Press,2001.
  • 3Agrawal R.,ImielinSki T.,Swami A..Mining association rules between sets of items in large database.In:Proceedings of the ACM SIGMOD International Conference on Managementof Data,Washington,DC,1993,2:207-216.
  • 4Srikant A.R..Fast algorithms for mining association rules.In:Proceedings of the 20th International Conference Very Large Data Bases(VLDB’94).Santiago,Chile,1994,487-499.
  • 5Han J.W.,Pei J.,Yin Y..Mining partial periodicity using frequent pattern tree.Simon Fraser University:Technical Report TR-99-10,1999.
  • 6Cheung D.,Han J.W.,Ng V.,Wong V..Maintenance of discovered association rules in large databases:An incremental updating technique.In:Proceedings of the 12th International Conference on Data Engineering(ICDE),New Orleans,Louisiana.1996.106-114.
  • 7Cheung D.LEE S.Kao B.A general incremental technique for maintaining discovered association rules.In:Proceedings of the 5th International Conference on Database Systems for Advanced Applications(DASFAA),Melbourne,Australia,World Scientific,1997,185-194.
  • 8Han J.W.,Pei J.,Yin Y..Mining frequent patterns without candidate generation.In:Proceedings of the 2000 ACM-SIG-MOD International Conference on Management of Data,Dal1as,2000,1-12.
  • 9Bayardo R.J..Efficiently mining long patterns from databases.In:Haas L.M.,Tiwary A.eds..Proceedings of the ACMSIGMOD International Conference on Management of Data.New York:ACM Press,1998,85-93.
  • 10Lin D.,Kedem Z.M..Pincer-Search:A new algorithm for discovering the maximum frequent set.In:Scheck H.J.,Saltot F.,Ramos I.et al,eds..Proceedings of the 6th European Conference on Extending Database Technology,Heidelberg:Snringer-Verlag.199R.105-119.

共引文献293

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部