On clusterings: Good, bad and spectral
Journal of the ACM (JACM)
Special Issue: The First Provenance Challenge
Concurrency and Computation: Practice & Experience - The First Provenance Challenge
Bridging centrality: graph mining from element level to group level
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Approximate lineage for probabilistic databases
Proceedings of the VLDB Endowment
Centralities: capturing the fuzzy notion of importance in social graphs
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems
A graph model of data and workflow provenance
TAPP'10 Proceedings of the 2nd conference on Theory and practice of provenance
Layering in provenance systems
USENIX'09 Proceedings of the 2009 conference on USENIX Annual technical conference
Future Generation Computer Systems
Computer Science Review
Hi-index | 0.00 |
Systems that capture and store data provenance, the record of how an object has arrived at its current state, accumulate historical metadata over time, forming a large graph. Local clustering in these graphs, in which we start with a seed vertex and grow a cluster around it, is of paramount importance because it supports critical provenance applications such as identifying semantically meaningful tasks in an object's history. However, generic graph clustering algorithms are not effective at these tasks. We identify three key properties of provenance graphs and exploit them to justify two new centrality metrics we developed for use in performing local clustering on provenance graphs.