Sciweavers

2004 search results - page 106 / 401
» Sampling from large graphs
Sort
View
ICDM
2009
IEEE
137views Data Mining» more  ICDM 2009»
15 years 9 months ago
A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
Kanishka Bhaduri, Ashok N. Srivastava
BMCBI
2008
114views more  BMCBI 2008»
15 years 3 months ago
Visualization of large influenza virus sequence datasets using adaptively aggregated trees with sampling-based subscale represen
Background: With the amount of influenza genome sequence data growing rapidly, researchers need machine assistance in selecting datasets and exploring the data. Enhanced visualiza...
Leonid Zaslavsky, Yiming Bao, Tatiana A. Tatusova
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
16 years 3 months ago
Modeling relationships at multiple scales to improve accuracy of large recommender systems
The collaborative filtering approach to recommender systems predicts user preferences for products or services by learning past useritem relationships. In this work, we propose no...
Robert M. Bell, Yehuda Koren, Chris Volinsky
INFOCOM
2008
IEEE
15 years 9 months ago
Turbo King: Framework for Large-Scale Internet Delay Measurements
—Distance estimation and topological proximity in the Internet have recently emerged as important problems for many distributed applications [1], [10], [11], [19], [29], [31], [4...
Derek Leonard, Dmitri Loguinov
SIGCOMM
2005
ACM
15 years 8 months ago
On the predictability of large transfer TCP throughput
Predicting the throughput of large TCP transfers is important for a broad class of applications. This paper focuses on the design, empirical evaluation, and analysis of TCP throug...
Qi He, Constantinos Dovrolis, Mostafa H. Ammar