arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.1152cs.DB
收藏

FS^3:一种基于采样的top-k频繁子图挖掘方法

FS^3: A Sampling based method for top-k Frequent Subgraph Mining

Tanay Kumar Saha, Mohammad Al Hasan

摘要:

标记子图挖掘是数据采掘中的一个热门研究课题,因为它在许多不同的科学领域都有潜在的应用。所有现有的方法都显式或隐式地解决了子图同构的问题,这是计算昂贵的,所以他们遭受缺乏可扩展性的问题时,在输入数据库中的图是大的。在这项工作中,我们提出了FS ^3,这是一种基于采样的方法。它挖掘一小部分概率意义上最频繁的子图。FS ^3在固定大小的子图空间上执行马尔可夫链蒙特卡罗(MCMC)采样,以便更频繁地对潜在频繁子图进行采样。此外,FS^3还配备了一个创新的队列管理器。它在挖掘过程中将采样子图存储在有限队列中,使得队列中的前k个位置包含最频繁的子图。我们在大型图数据库上的实验表明,FS ^3是有效的,它可以得到给定大小的子图中最频繁的子图。

英文摘要:

Mining labeled subgraph is a popular research task in data mining because of its potential application in many different scientific domains. All the existing methods for this task explicitly or implicitly solve the subgraph isomorphism task which is computationally expensive, so they suffer from the lack of scalability problem when the graphs in the input database are large. In this work, we propose FS^3, which is a sampling based method. It mines a small collection of subgraphs that are most frequent in the probabilistic sense. FS^3 performs a Markov Chain Monte Carlo (MCMC) sampling over the space of a fixed-size subgraphs such that the potentially frequent subgraphs are sampled more often. Besides, FS^3 is equipped with an innovative queue manager. It stores the sampled subgraph in a finite queue over the course of mining in such a manner that the top-k positions in the queue contain the most frequent subgraphs. Our experiments on database of large graphs show that FS^3 is efficient, and it obtains subgraphs that are the most frequent amongst the subgraphs of a given size.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑