Sciweavers

40 search results - page 6 / 8
» Top-k Correlative Graph Mining.
Sort
View
CIKM
2009
Springer
13 years 10 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
SDM
2012
SIAM
294views Data Mining» more  SDM 2012»
11 years 8 months ago
Kernelized Probabilistic Matrix Factorization: Exploiting Graphs and Side Information
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...
Tinghui Zhou, Hanhuai Shan, Arindam Banerjee, Guil...
SIGKDD
2008
125views more  SIGKDD 2008»
13 years 5 months ago
Incremental pattern discovery on streams, graphs and tensors
Incremental pattern discovery targets streaming applications where the data continuously arrive incrementally. The questions are how to find patterns (main trends) incrementally; ...
Jimeng Sun
WWW
2010
ACM
13 years 6 months ago
Mining advertiser-specific user behavior using adfactors
Consider an online ad campaign run by an advertiser. The ad serving companies that handle such campaigns record users' behavior that leads to impressions of campaign ads, as ...
Nikolay Archak, Vahab S. Mirrokni, S. Muthukrishna...
CPHYSICS
2006
124views more  CPHYSICS 2006»
13 years 6 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...