Edinburgh Research Explorer

Big Graph Analyses: From Queries to Dependencies and Association Rules

Research output: Contribution to journalArticle

Related Edinburgh Organisations

Open Access permissions

Open

Documents

http://link.springer.com/article/10.1007%2Fs41019-016-0025-x
Original languageEnglish
Pages (from-to)36-55
Number of pages20
JournalData Science and Engineering
Volume2
Issue number1
Early online date7 Jan 2017
DOIs
Publication statusPublished - Mar 2017

Abstract

This position paper provides an overview of our recent advances in the study of big graphs, from theory to systems to applications. We introduce a theory of bounded evaluability, to query big graphs by accessing a bounded amount of the data. Based on this, we propose a framework to query big graphs with constrained resources. Beyond queries, we propose functional dependencies for graphs, to detect inconsistencies in knowledge bases and catch spams in social networks. As an example application of big graph analyses, we extend association rules from itemsets to graphs for social media marketing. We also identify open problems in connection with querying, cleaning and mining big graphs.

Download statistics

No data available

ID: 30073067