Affiliation:
1. University of Edinburgh and Shenzhen Institute of Computing Sciences and Beihang University
2. University of Edinburgh
3. Beihang University
4. Chinese Academy of Sciences
Abstract
This paper tackles two challenges to discovery of graph rules. Existing discovery methods often (a) return an excessive number of rules, and (b) do not scale with large graphs given the intractability of the discovery problem. We propose an application-driven strategy to cut back rules and data that are irrelevant to users' interests, by training a machine learning (ML) model to identify data pertaining to a given application. Moreover, we introduce a sampling method to reduce a big graph
G
to a set
H
of small sample graphs. Given expected support and recall bounds, the method is able to deduce samples in
H
and mine rules from
H
to satisfy the bounds in the entire
G
. As proof of concept, we develop an algorithm to discover Graph Association Rules (GARs), which are a combination of graph patterns and attribute dependencies, and may embed ML classifiers as predicates. We show that the algorithm is parallelly scalable,
i.e.
, it guarantees to reduce runtime when more machines are used. We experimentally verify that the method is able to discover rules with recall above 91% when using sample ratio 10%, with speedup of 61 times.
Publisher
Association for Computing Machinery (ACM)
Subject
General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development
Reference78 articles.
1. 2021. DBLP collaboration network. https://snap.stanford.edu/data/com-DBLP.html. 2021. DBLP collaboration network. https://snap.stanford.edu/data/com-DBLP.html.
2. 2021. DBpedia. http://wiki.dbpedia.org. 2021. DBpedia. http://wiki.dbpedia.org.
3. 2021. DingTalk. https://www.dingtalk.com. 2021. DingTalk. https://www.dingtalk.com.
4. 2021. IMDB. https://www.imdb.com/interfaces. 2021. IMDB. https://www.imdb.com/interfaces.
5. Charu C. Aggarwal Mansurul Bhuiyan and Mohammad Al Hasan. 2014. Frequent Pattern Mining Algorithms: A Survey. In Frequent Pattern Mining. Charu C. Aggarwal Mansurul Bhuiyan and Mohammad Al Hasan. 2014. Frequent Pattern Mining Algorithms: A Survey. In Frequent Pattern Mining.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献