Sciweavers

1541 search results - page 155 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
16 years 5 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
CEC
2009
IEEE
15 years 11 months ago
Evolutionary design of the energy function for protein structure prediction
— Automatic protein structure predictors use the notion of energy to guide the search towards good candidate structures. The energy functions used by the state-of-the-art predict...
Pawel Widera, Jonathan M. Garibaldi, Natalio Krasn...
ICDE
2008
IEEE
168views Database» more  ICDE 2008»
15 years 11 months ago
Index Design for Dynamic Personalized PageRank
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
Amit Pathak, Soumen Chakrabarti, Manish S. Gupta
ICDM
2005
IEEE
190views Data Mining» more  ICDM 2005»
15 years 10 months ago
Neighborhood Formation and Anomaly Detection in Bipartite Graphs
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors ...
Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, Chri...
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 5 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg