0


频繁图挖掘的问题是什么?

Frequent graph mining - what is the question?
课程网址: http://videolectures.net/sicgt07_turan_fgm/  
主讲教师: Gyorgy Turan
开课单位: 伊利诺伊大学
开课时间: 2007-09-07
课程语种: 英语
中文简介:
数据挖掘的目标是在大型数据集中查找规则或有趣的模式,例如业务事务。最近,人们对将这项工作扩展到结构化数据(例如图表)非常感兴趣。域可以是分子图或网络图的数据库,问题可能是找到数据中频繁出现的子图。算法通常列出频繁的子图或其他模式。这个问题有许多不同的表述。在该领域的发展的这个阶段,将不同变体的总体图片放在一起似乎是有意义的。在这次演讲中,我们试图朝这个方向努力。
课程简介: The objective of data mining is to find regularities, or interesting patterns in large data sets, such as business transactions. More recently, there has been great interest in extending this work to structured data, such as graphs. The domain could be a database of molecular graphs, or the web graph, and the question could be to find subgraphs which occur frequently in the data. Algorithms usually list frequent subgraphs or other patterns. There are many different formulations of this problem. At this stage of the development of the field, it appears to be of some interest to put together a general picture of the different variants. In this talk we present an attempt towards this direction.
关 键 词: 计算机科学; 数据挖; 数学; 图论
课程来源: 视频讲座网
最后编审: 2020-06-10:yumf
阅读次数: 101