Projects per year
Abstract
We propose graph-pattern association rules (GPARs) for social media marketing. Extending association rules for itemsets, GPARs help us discover regularities between entities in social graphs, and identify potential customers by exploring social influence. We study the problem of discovering top-k diversified GPARs. While this problem is NP-hard, we develop a parallel algorithm with accuracy bound. We also study the problem of identifying potential customers with GPARs. While it is also NP-hard, we provide a parallel scalable algorithm that guarantees a polynomial speedup over sequential algorithms with the increase of processors. Using real-life and synthetic graphs, we experimentally verify the scalability and effectiveness of the algorithms.
Original language | English |
---|---|
Pages (from-to) | 1502-1513 |
Number of pages | 12 |
Journal | Proceedings of the VLDB Endowment (PVLDB) |
Volume | 8 |
Issue number | 12 |
DOIs | |
Publication status | Published - 1 Aug 2015 |
Fingerprint
Dive into the research topics of 'Association Rules with Graph Patterns'. Together they form a unique fingerprint.Projects
- 2 Finished
-
VADA: Value Added Data Systems: Principles and Architecture
Libkin, L. (Principal Investigator), Buneman, P. (Co-investigator), Fan, W. (Co-investigator) & Pieris, A. (Co-investigator)
1/04/15 → 30/09/20
Project: Research
-
Querying Graph Structured Data: Principles and Techniques
Libkin, L. (Principal Investigator) & Fan, W. (Co-investigator)
1/11/13 → 31/10/16
Project: Research
Profiles
-
Wenfei Fan
- School of Informatics - Personal Chair in Web Data Management
- Laboratory for Foundations of Computer Science
- Foundations of Computation
Person: Academic: Research Active