Sciweavers

51 search results - page 11 / 11
» Estimating class probabilities in random forests
Sort
View
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
13 years 11 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen