Sciweavers

216 search results - page 18 / 44
» Using a Hash-Based Method for Apriori-Based Graph Mining
Sort
View
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 2 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 10 months ago
Proximity Tracking on Time-Evolving Bipartite Graphs
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
Hanghang Tong, Spiros Papadimitriou, Philip S. Yu,...
CSMR
2010
IEEE
13 years 3 months ago
Does the Past Say It All? Using History to Predict Change Sets in a CMDB
To avoid unnecessary maintenance costs in large IT systems resulting from poorly planned changes, it is essential to manage and control changes to the system and to verify that all...
Sarah Nadi, Richard C. Holt, Serge Mankovski
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
14 years 8 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han
SDM
2011
SIAM
269views Data Mining» more  SDM 2011»
12 years 11 months ago
Semi-Supervised Convolution Graph Kernels for Relation Extraction
Extracting semantic relations between entities is an important step towards automatic text understanding. In this paper, we propose a novel Semi-supervised Convolution Graph Kerne...
Xia Ning, Yanjun Qi