Sciweavers

888 search results - page 115 / 178
» Data Mining for Community Dynamics
Sort
View
CONCURRENCY
2006
142views more  CONCURRENCY 2006»
15 years 4 months ago
A Grid service broker for scheduling e-Science applications on global data Grids
: The next generation of scientific experiments and studies, popularly called e-Science, is carried out by large collaborations of researchers distributed around the world engaged ...
Srikumar Venugopal, Rajkumar Buyya, Lyle J. Winton
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
15 years 4 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
15 years 10 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
2007
SIAM
73views Data Mining» more  SDM 2007»
15 years 5 months ago
Sketching Landscapes of Page Farms
The Web is a very large social network. It is important and interesting to understand the “ecology” of the Web: the general relations of Web pages to their environment. The un...
Bin Zhou 0002, Jian Pei
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 7 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon