Sciweavers

2421 search results - page 405 / 485
» Approximate Flow-Aware Networking
Sort
View
KDD
2008
ACM
174views Data Mining» more  KDD 2008»
14 years 8 months ago
Effective label acquisition for collective classification
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
Mustafa Bilgic, Lise Getoor
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 8 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
14 years 8 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
WECWIS
2009
IEEE
104views ECommerce» more  WECWIS 2009»
14 years 2 months ago
Online Auctions: There Can Be Only One
—In recent years, the proliferation of the world wide web has lead to an increase in the number of public auctions on the internet. One of the characteristics of online auctions ...
Charu C. Aggarwal, Philip S. Yu
INFOCOM
2008
IEEE
14 years 2 months ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel