图 书 馆
在单个图中挖掘频繁子图的支持计算Support Computation for Mining Frequent Subgraphs in a Single Graph |
|
| 课程网址: | http://videolectures.net/mlg07_fiedler_scfmfs/ |
| 主讲教师: | Mathias Fiedler |
| 开课单位: | 欧洲软计算中心 |
| 开课时间: | 2007-09-05 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. However, if the input is one large graph, it is surprisingly difficult to find an appropriate support definition. In this paper we study the core problem, namely overlapping embeddings of the subgraph, in detail and suggest a definition that relies on the non-existence of equivalent ancestor embeddings in order to guarantee that the resulting support is anti-monotone. We prove this property and describe a method to compute the support defined in this way. |
| 关 键 词: | 定义子图; 图表数据库; 支持定义 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-06-30：cjy |
| 阅读次数: | 35 |