基于概念格的Web日志挖掘的研究-计算机应用技术专业论文.docxVIP

ABSTRACTWith ABSTRACT With constant increment of Web resource．the framework of Web sites become more and more complicate nowadays．The presem Web sites are not intelligent and active,SO ifs very dimcult for users to find their needed information rapidly in front of such huge and complex World Wide Web．Meanwhile the design of Web sites becomes very hard．So Web sites should be improved to provide better and intelligent Web services，such as Personalized W曲Service。Adaptive W曲Site and SO Oil． One of the most important reliance of improving Wbb sites iS user access information，which is recorded in W曲log files format，SO Web log mining Can discover user access patterns efficiently and therefore resolve the problems above． In this thesis，the process of W曲log mining including data preprocessing，patterns discovery and patterns analysis is discussed．We analyze all tasks of data preprocessing and kinds of pattern discovery techrIelegy．We analyze the deficiencies of Godin algorithm that it needs to traverse all the concept nodes to find the generator of the new concept， therefore propose a new algorithm based on tree structure to update concept lattice，which Can reduce the search-range of generators and parent nodes，SO it has better efficiency than Godin algorithm．We apply concept lattice theory to discover patterns in Web log mining．which can resolve incremental mining problem．We research association rules mining based on concept lattice,optimizing the generation of strong association rules by maximun frequent itemsets，which Can reduce the time of finding frequent item_sets and unnecessary rules，therefore impmves the efficiency ofpatterns discovery． The advantage of incremental concept formation algorithm is that it call update the original concept lattice SO that 0111method of pattern discovery is meaningful to update the pattern database of intelligent Wreb services． KEY WORDS Web log mining，concept lattice，pattem disvovery Ⅱ 原创性声明本人声明，所呈交的学位论文是本人在导师指导下进行的研究工 原创性声明 本人声明，所呈交的学位论