Sciweavers

151 search results - page 10 / 31
» Edge Anonymity in Social Network Graphs
Sort
View
PVLDB
2010
200views more  PVLDB 2010»
13 years 7 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
VLDB
2007
ACM
154views Database» more  VLDB 2007»
14 years 2 months ago
P2P Authority Analysis for Social Communities
PageRank-style authority analyses of Web graphs are of great importance for Web mining. Such authority analyses also apply to hot “Web 2.0” applications that exhibit a natural...
Josiane Xavier Parreira, Sebastian Michel, Matthia...
GD
2007
Springer
14 years 3 months ago
Multi-circular Layout of Micro/Macro Graphs
We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced b...
Michael Baur, Ulrik Brandes
ASUNAM
2011
IEEE
12 years 8 months ago
Probabilistic Subgraph Matching on Huge Social Networks
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
SDM
2011
SIAM
284views Data Mining» more  SDM 2011»
12 years 11 months ago
The Network Completion Problem: Inferring Missing Nodes and Edges in Networks
While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomp...
Myunghwan Kim 0002, Jure Leskovec