Sciweavers

733 search results - page 122 / 147
» Recommending random walks
Sort
View
ITA
2006
163views Communications» more  ITA 2006»
14 years 9 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
TON
2008
149views more  TON 2008»
14 years 9 months ago
Building heterogeneous peer-to-peer networks: protocol and analysis
In this paper, we propose a simple protocol for building heterogeneous unstructured peer-to-peer (P2P) networks. The protocol consists of two parts--the joining process and the reb...
Kin Wah Kwong, Danny H. K. Tsang
SIGIR
2002
ACM
14 years 9 months ago
PageRank, HITS and a unified framework for link analysis
Two popular webpage ranking algorithms are HITS and PageRank. HITS emphasizes mutual reinforcement between authority and hub webpages, while PageRank emphasizes hyperlink weight n...
Chris H. Q. Ding, Xiaofeng He, Parry Husbands, Hon...
CCS
2010
ACM
14 years 8 months ago
Designs to account for trust in social network-based sybil defenses
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
Abedelaziz Mohaisen, Nicholas Hopper, Yongdae Kim
ESWA
2010
118views more  ESWA 2010»
14 years 8 months ago
Integrating independent component analysis-based denoising scheme with neural network for stock price prediction
The forecasting of stock price is one of the most challenging tasks in investment/financial decision-making since stock prices/indices are inherently noisy and non-stationary. In ...
Chi-Jie Lu