H. Tong

Publications
Influence

Fast Random Walk with Restart and Its Applications

H. Tong, C. Faloutsos, Jia-Yu Pan
Mathematics, Computer Science
Sixth International Conference on Data Mining…
18 December 2006

We propose a novel, fast, and practical solution to this problem by exploiting two properties shared by many real graphs: (a) linear correlations and (b) block- wise, community-like structure. Expand

Manifold-ranking based image retrieval

Jingrui He, Mingjing Li, H. Zhang, H. Tong, C. Zhang
Computer Science
MULTIMEDIA '04
10 October 2004

In this paper, we propose a novel transductive learning framework named manifold-ranking based image retrieval (MRBIR). Expand

FINAL: Fast Attributed Network Alignment

Si Zhang, H. Tong
Computer Science
KDD
13 August 2016

We formulate this problem from an optimization perspective based on the alignment consistency principle, and develop effective and scalable algorithms to solve it. Expand

Center-piece subgraphs: problem definition and fast solutions

H. Tong, C. Faloutsos
Mathematics, Computer Science
KDD '06
20 August 2006

We generalize the challenge in multiple dimensions: First, we allow more than two query nodes, and we allow a whole family of queries, ranging from 'OR' to 'AND', with 'softAND' in-between. Expand

Random walk with restart: fast solutions and applications

H. Tong, C. Faloutsos, Jia-Yu Pan
Mathematics, Computer Science
Knowledge and Information Systems
18 March 2008

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 score between two nodes… Expand

Blur detection for digital images using wavelet transform

H. Tong, Mingjing Li, H. Zhang, C. Zhang
Computer Science
IEEE International Conference on Multimedia and…
27 June 2004

A new blur detection scheme is proposed in this paper, which can determine whether an image is blurred or not and to what extent animage is blurred. Expand

Colibri: fast mining of large static and dynamic graphs

H. Tong, S. Papadimitriou, Jimeng Sun, Philip S. Yu, C. Faloutsos
Mathematics, Computer Science
KDD
24 August 2008

We propose the family of Colibri methods to deal with these challenges. Expand

Fast best-effort pattern matching in large attributed graphs

H. Tong, C. Faloutsos, Brian Gallagher, Tina Eliassi-Rad
Mathematics, Computer Science
KDD '07
12 August 2007

We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. Expand

BIG-ALIGN: Fast Bipartite Graph Alignment

Danai Koutra, H. Tong, D. Lubensky
Computer Science
IEEE 13th International Conference on Data Mining
1 December 2013

We introduce a new optimization formulation and propose an effective and fast algorithm to solve a problem that has been neglected in the literature: bipartite graphs. Expand

GBASE: a scalable and general graph management system

U. Kang, H. Tong, Jimeng Sun, Ching-Yung Lin, C. Faloutsos
Computer Science
KDD
21 August 2011

Graphs appear in numerous applications including cyber-security, the Internet, social networks, protein networks, recommendation systems, and many more. Expand

Recommended Authors