Supervised random walks: predicting and recommending links in social networks

L Backstrom, J Leskovec - Proceedings of the fourth ACM international …, 2011 - dl.acm.org
Predicting the occurrence of links is a fundamental problem in networks. In the link
prediction problem we are given a snapshot of a network and would like to infer which …

DA DA: Degree-Aware Algorithms for Network-Based Disease Gene Prioritization

S Erten, G Bebek, RM Ewing, M Koyutürk - BioData mining, 2011 - Springer
Background High-throughput molecular interaction data have been used effectively to
prioritize candidate genes that are linked to a disease, based on the observation that the …

Clustering large attributed graphs: A balance between structural and attribute similarities

H Cheng, Y Zhou, JX Yu - … on Knowledge Discovery from Data (TKDD), 2011 - dl.acm.org
Social networks, sensor networks, biological networks, and many other information networks
can be modeled as a large graph. Graph vertices represent entities, and graph edges …

Market basket analysis with networks

T Raeder, NV Chawla - Social network analysis and mining, 2011 - Springer
The field of market basket analysis, the search for meaningful associations in customer
purchase data, is one of the oldest areas of data mining. The typical solution involves the …

Rex: explaining relationships between entity pairs

L Fang, AD Sarma, C Yu, P Bohannon - arXiv preprint arXiv:1111.7170, 2011 - arxiv.org
Knowledge bases of entities and relations (either constructed manually or automatically) are
behind many real world search engines, including those at Yahoo!, Microsoft, and Google …

Vavien: An Algorithm for Prioritizing Candidate Disease Genes Based on Topological Similarity of Proteins in Interaction Networks

S Erten, G Bebek, M Koyutürk - Journal of computational biology, 2011 - liebertpub.com
Genome-wide linkage and association studies have demonstrated promise in identifying
genetic factors that influence health and disease. An important challenge is to narrow down …

Fast graph query processing with a low-cost index

J Cheng, Y Ke, AWC Fu, JX Yu - The VLDB journal, 2011 - Springer
This paper studies the problem of processing supergraph queries, that is, given a database
containing a set of graphs, find all the graphs in the database of which the query graph is a …

Summary graphs for relational database schemas

X Yang, CM Procopiuc, D Srivastava - Proceedings of the VLDB …, 2011 - dl.acm.org
Increasingly complex databases need ever more sophisticated tools to help users
understand their schemas and interact with the data. Existing tools fall short of either …

Index design and query processing for graph conductance search

S Chakrabarti, A Pathak, M Gupta - The VLDB Journal, 2011 - Springer
Graph conductance queries, also known as personalized PageRank and related to random
walks with restarts, were originally proposed to assign a hyperlink-based prestige score to …

Distance preserving graph simplification

N Ruan, R Jin, Y Huang - 2011 IEEE 11th International …, 2011 - ieeexplore.ieee.org
Large graphs are difficult to represent, visualize, and understand. In this paper, we
introduce" gate graph" a new approach to perform graph simplification. A gate graph …