default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMLG@KDD 2010: Washington, DC, USA
- Ulf Brefeld, Lise Getoor, Sofus A. Macskassy:
Proceedings of the Eighth Workshop on Mining and Learning with Graphs, MLG '10, Washington, D.C., USA, July 24-25, 2010. ACM 2010, ISBN 978-1-4503-0214-2 - Nesreen K. Ahmed, Fredrick J. Berchmans, Jennifer Neville, Ramana Rao Kompella:
Time-based sampling of social network activity graphs. 1-9 - Leman Akoglu, Bhavana Dalvi:
Structure, tie persistence and event detection in large phone and SMS networks. 10-17 - Sandra Álvarez-García, Nieves R. Brisaboa
, Susana Ladra, Oscar Pedreira:
A compact representation of graph databases. 18-25 - Christian Desrosiers, George Karypis:
Enhancing link-based similarity through the use of non-numerical labels and prior information. 26-33 - Linbin Yu, Chris H. Q. Ding:
Network community discovery: solving modularity clustering via normalized cut. 34-36 - Anton Dries, Siegfried Nijssen:
Analyzing graph databases by aggregate queries. 37-45 - Hoda Eldardiry, Jennifer Neville:
Multi-network fusion for collective inference. 46-54 - Ian Gallagher:
Bayesian block modelling for weighted networks. 55-61 - Ádám Gyenge, Janne Sinkkonen, András A. Benczúr:
An efficient block model for clustering sparse graphs. 62-69 - Kristina Lerman, Rumi Ghosh, Jeon-Hyung Kang:
Centrality metric for dynamic networks. 70-77 - Jimmy Lin, Michael Schatz:
Design patterns for efficient graph algorithms in MapReduce. 78-85 - Katariina Nyberg, Tapani Raiko, Teemu Tiinanen, Eero Hyvönen:
Document classification utilising ontologies and relations between documents. 86-93 - Juuso A. Parkkinen, Kristian Nybo, Jaakko Peltonen, Samuel Kaski:
Graph visualization with latent variable models. 94-101 - Alberto Pinto:
Relational motif discovery via graph spectral ranking. 102-109 - Swapnil Shrivastava, Kriti Kulshrestha, Pratibha Singh, Supriya N. Pal:
Pruthak: mining and analyzing graph substructures. 110-118 - Arlei Silva, Wagner Meira Jr., Mohammed J. Zaki:
Structural correlation pattern mining for large graphs. 119-126 - Rajmonda Sulo Caceres, Tanya Y. Berger-Wolf, Robert Grossman:
Meaningful selection of temporal resolution for dynamic networks. 127-136 - Yizhou Sun, Jie Tang, Jiawei Han, Manish Gupta, Bo Zhao:
Community evolution detection in dynamic heterogeneous information networks. 137-146 - Lei Tang, Huiji Gao, Huan Liu:
Network quantification despite biased labels. 147-154 - Bianca Wackersreuther, Peter Wackersreuther, Annahita Oswald, Christian Böhm, Karsten M. Borgwardt:
Frequent subgraph discovery in dynamic networks. 155-162 - Hao Zhou, Anna A. Shaverdian, H. V. Jagadish, George Michailidis:
Querying graphs with uncertain predicates. 163-170 - Ruoyu Zou, Lawrence B. Holder:
Frequent subgraph mining on a single large graph using sampling techniques. 171-178
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-09 23:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
