图 书 馆
概率论下不确定图数据库中频繁子图的发现Discovering Frequent Subgraphs over Uncertain Graph Databases under Probabilistic Semantics |
|
| 课程网址: | http://videolectures.net/kdd2010_zou_dfs/ |
| 主讲教师: | Zhaonian Zou |
| 开课单位: | 哈尔滨工业大学 |
| 开课时间: | 2010-10-01 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Frequent subgraph mining has been extensively studied on certain graph data. However, uncertainties are inherently accompanied with graph data in practice, and there is very few work on mining uncertain graph data. This paper investigates frequent subgraph mining on uncertain graphs under probabilistic semantics. Specifically, a measure called varphi-frequent probability is introduced to evaluate the degree of recurrence of subgraphs. Given a set of uncertain graphs and two numbers 0 varphi,tau < 1, the goal is to quickly find all subgraphs with varphi-frequent probability at least tau. Due to the NP-hardness of the problem, an approximate mining algorithm is proposed for this problem. Let 0 < delta < 1 be a parameter. The algorithm guarantees to find any frequent subgraph S with probability at least \left(\frac{1 - \delta}{2}\right)s, where s is the number of edges of S. In addition, it is thoroughly discussed how to set $\delta$ to guarantee the overall approximation quality of the algorithm. The extensive experiments on real uncertain graph data verify that the algorithm is efficient and that the mining results have very high quality. |
| 关 键 词: | 子图挖掘; 频繁概率; 重现程度 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-05-11：cwx |
| 阅读次数: | 80 |