期刊文献+

基于概念格的Web日志路径挖掘算法 被引量:13

An Algorithm for Path Mining of Web Log Based on Concept Lattice
下载PDF
导出
摘要 路径挖掘适用于探索用户沿超连接寻找和浏览网页的规律,而Web日志的完美结构使挖掘更加容易和有效。由二元关系导出的概念格作为一种非常有用的形式化工具,体现了概念内涵和外延的统一,反映了对象和特征间的联系以及概念的泛化与例化关系,因此非常适于发现数据中潜在的信息。本文通过概念格模型,提出了一种Web日志的路径挖掘算法,并进行了相关的分析与展望。 Path Mining is used to discover the regularities when Web users browse and select Web pages along hyperlinks. The perfect structure of Web log make Web mining easier and more efficient. Concept lattice,induced from a binary relation between objects and features, is a very useful formal tool and has been used in many fields. It realizes the unification of concept intension and concept extension, represents the association between objects and features, and reflects the relationship of generalization and the specialization among concepts, so it is fit for discovering the potential information of the data- In this paper, based on the Concept lattice, an algorithm of Web log path mining is presented. And the related analysis and expectation are given.
作者 杨飞
出处 《计算机科学》 CSCD 北大核心 2004年第3期115-117,共3页 Computer Science
关键词 事务数据库 关联规则 概念格 WEB日志 路径挖掘算法 数据挖掘 Web mining,Web log mining,Association rules,Path mining,Concept lattice
  • 相关文献

参考文献11

  • 1王志海,胡可云,胡学钢,刘宗田,张奠成.概念格上规则提取的一般算法与渐进式算法[J].计算机学报,1999,22(1):66-70. 被引量:66
  • 2谢志鹏,刘宗田.概念格与关联规则发现[J].计算机研究与发展,2000,37(12):1415-1421. 被引量:97
  • 3宋爱波,胡孔法,董逸生.Web日志挖掘[J].东南大学学报(自然科学版),2002,32(1):15-18. 被引量:30
  • 4杨飞.基于概念格的Web日志路径挖掘算法[J].计算机科学,2004,31(3):115-117. 被引量:13
  • 5Agrawal R, Imielinski T,Swami A. Mining associations between sets of items in large databases [A]. In: Buneman Peter,ed . Proc.of the 1993 ACM-SIGMOD Intl. Conf. on Management of Data 1993.207
  • 6Borges J, Levene M. Mining association rules in hypertext databases. http://citeseer. nj. nec. com/article/borges 99 mining.html. 2001-01-21
  • 7Wille R. Restructuring lattice theory: An approach based on hierarchies of concepts. In: I Rival, ed . Ordered Set. Dordrecht Boston:Reidel ,1982.445-470
  • 8Godin R, Missaoui R,Alaui H.Incremetal concept formation algorithms based on Galois (concept)lattices. Computational Intelligence, 1995, 11 (2):246-267
  • 9Nourine L,Raynaud O. Afast algorithm for building lattices.Information Processing Letters, 1999, 71(5-6): 199-204
  • 10Chen M-S,Park J S,Yu P. Efficient data mining for path traversal patterns. IEEE Trans on Knowledge and Data Engineering, 1998,

二级参考文献14

  • 1Cheung D W,Proc of 1996 Int’l Conf on Data Engineering (ICDE’96 ),1996年
  • 2Agrawal R, Imielinski T,Swami A. Mining associations between sets of items in large databases [A]. In: Buneman Peter,ed . Proc.of the 1993 ACM-SIGMOD Intl. Conf. on Management of Data 1993.207
  • 3Borges J, Levene M. Mining association rules in hypertext databases. http://citeseer. nj. nec. com/article/borges 99 mining.html. 2001-01-21
  • 4Wille R. Restructuring lattice theory: An approach based on hierarchies of concepts. In: I Rival, ed . Ordered Set. Dordrecht Boston:Reidel ,1982.445-470
  • 5Godin R, Missaoui R,Alaui H.Incremetal concept formation algorithms based on Galois (concept)lattices. Computational Intelligence, 1995, 11 (2):246-267
  • 6Nourine L,Raynaud O. Afast algorithm for building lattices.Information Processing Letters, 1999, 71(5-6): 199-204
  • 7Chen M-S,Park J S,Yu P. Efficient data mining for path traversal patterns. IEEE Trans on Knowledge and Data Engineering, 1998,
  • 8Perkowitz M, Etzioni O. Adaptive Web sites: automatically synthesizing Web pages. http://citeseer. nj. nec. com/perkowitz98adaptive.html.2001-03-11
  • 9王志海,马光胜.一种求解多值逻辑函数接近最小覆盖的算法[J].计算机学报,1990,13(11):875-877. 被引量:5
  • 10王志海,胡可云,胡学钢,刘宗田,张奠成.概念格上规则提取的一般算法与渐进式算法[J].计算机学报,1999,22(1):66-70. 被引量:66

共引文献178

同被引文献98

引证文献13

二级引证文献40

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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