SIGKDD(KDD) 2010 论文列表Proceedings of the Eighth Workshop on Mining and Learning with Graphs, MLG '10, Washington, D.C., USA, July 24-25, 2010. |
Frequent subgraph mining on a single large graph using sampling techniques.
Querying graphs with uncertain predicates.
Frequent subgraph discovery in dynamic networks.
Network quantification despite biased labels.
Community evolution detection in dynamic heterogeneous information networks.
Meaningful selection of temporal resolution for dynamic networks.
Structural correlation pattern mining for large graphs.
Pruthak: mining and analyzing graph substructures.
Relational motif discovery via graph spectral ranking.
Graph visualization with latent variable models.
Document classification utilising ontologies and relations between documents.
Design patterns for efficient graph algorithms in MapReduce.
Centrality metric for dynamic networks.
An efficient block model for clustering sparse graphs.
Bayesian block modelling for weighted networks.
Multi-network fusion for collective inference.
Analyzing graph databases by aggregate queries.
Network community discovery: solving modularity clustering via normalized cut.
Enhancing link-based similarity through the use of non-numerical labels and prior information.
A compact representation of graph databases.
Structure, tie persistence and event detection in large phone and SMS networks.
Time-based sampling of social network activity graphs.