Sciweavers

148 search results - page 21 / 30
» Optimizing random walk search algorithms in P2P networks
Sort
View
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
16 years 1 days ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
WWW
2005
ACM
16 years 9 days ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
105
Voted
GECCO
2003
Springer
268views Optimization» more  GECCO 2003»
15 years 4 months ago
A Generalized Feedforward Neural Network Architecture and Its Training Using Two Stochastic Search Methods
Shunting Inhibitory Artificial Neural Networks (SIANNs) are biologically inspired networks in which the synaptic interactions are mediated via a nonlinear mechanism called shuntin...
Abdesselam Bouzerdoum, Rainer Mueller
116
Voted
KDD
2010
ACM
318views Data Mining» more  KDD 2010»
14 years 10 months ago
DivRank: the interplay of prestige and diversity in information networks
Information networks are widely used to characterize the relationships between data items such as text documents. Many important retrieval and mining tasks rely on ranking the dat...
Qiaozhu Mei, Jian Guo, Dragomir R. Radev
94
Voted
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 5 months ago
Takeover time curves in random and small-world structured populations
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
Mario Giacobini, Marco Tomassini, Andrea Tettamanz...