Sciweavers

24 search results - page 4 / 5
» Probabilistic Subgraph Matching on Huge Social Networks
Sort
View
KDD
2012
ACM
242views Data Mining» more  KDD 2012»
11 years 7 months ago
Query-driven discovery of semantically similar substructures in heterogeneous networks
Heterogeneous information networks that contain multiple types of objects and links are ubiquitous in the real world, such as bibliographic networks, cyber-physical networks, and ...
Xiao Yu, Yizhou Sun, Peixiang Zhao, Jiawei Han
MLG
2007
Springer
13 years 11 months ago
Inferring Vertex Properties from Topology in Large Networks
: Network topology not only tells about tightly-connected “communities,” but also gives cues on more subtle properties of the vertices. We introduce a simple probabilistic late...
Janne Sinkkonen, Janne Aukia, Samuel Kaski
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 7 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
CSE
2009
IEEE
13 years 11 months ago
A Study of Information Diffusion over a Realistic Social Network Model
—Sociological models of human behavior can explain population-level phenomena within social systems; computer modeling can simulate a wide variety of scenarios and allow one to p...
Andrea Apolloni, Karthik Channakeshava, Lisa Durbe...
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
12 years 8 months ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...