Sciweavers

1658 search results - page 272 / 332
» Learning Unknown Graphs
Sort
View
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
14 years 2 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
AIRWEB
2009
Springer
14 years 2 months ago
Tag spam creates large non-giant connected components
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...
Nicolas Neubauer, Robert Wetzker, Klaus Obermayer
PLDI
2011
ACM
12 years 11 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
WWW
2003
ACM
14 years 8 months ago
Adaptive on-line page importance computation
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance, or page rank is defined as the fixpoint o...
Serge Abiteboul, Mihai Preda, Gregory Cobena
KDD
2009
ACM
181views Data Mining» more  KDD 2009»
14 years 2 months ago
An exploration of climate data using complex networks
To discover patterns in historical data, climate scientists have applied various clustering methods with the goal of identifying regions that share some common climatological beha...
Karsten Steinhaeuser, Nitesh V. Chawla, Auroop R. ...