Sciweavers

502 search results - page 71 / 101
» Streaming Random Forests
Sort
View
BMCBI
2010
183views more  BMCBI 2010»
13 years 10 months ago
Active learning for human protein-protein interaction prediction
Background: Biological processes in cells are carried out by means of protein-protein interactions. Determining whether a pair of proteins interacts by wet-lab experiments is reso...
Thahir P. Mohamed, Jaime G. Carbonell, Madhavi Gan...
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 10 months ago
On the bias of BFS
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
PDP
2008
IEEE
14 years 4 months ago
Internet-Scale Simulations of a Peer Selection Algorithm
The match between a peer-to-peer overlay and the physical Internet infrastructure is a constant issue. Time-constrained peer-to-peer applications such as live streaming systems ar...
Ali Boudani, Yiping Chen, Gilles Straub, Gwendal S...
CSDA
2008
128views more  CSDA 2008»
13 years 10 months ago
Classification tree analysis using TARGET
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
J. Brian Gray, Guangzhe Fan
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 4 months ago
Towards Unbiased BFS Sampling
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
Maciej Kurant, Athina Markopoulou, Patrick Thiran