Sciweavers

1407 search results - page 192 / 282
» Information Evolution in Social Networks
Sort
View
126
Voted
IPM
2006
94views more  IPM 2006»
15 years 17 days ago
Binary Pathfinder: An improvement to the Pathfinder algorithm
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
Vicente P. Guerrero Bote, Felipe Zapico-Alonso, Ma...
125
Voted
CIKM
2010
Springer
14 years 11 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
113
Voted
CIKM
2009
Springer
15 years 7 months ago
A mobile tourist assistance and recommendation system based on complex networks
In recent years, the tourism assistance community is gradually shifting its emphasis to digital, interactive systems. Our project aims for digital tourism assistance by combining ...
Alf-Christian Schering, Martin Dueffer, Andreas Fi...
AAAI
2008
15 years 2 months ago
Minimizing the Spread of Contamination by Blocking Links in a Network
We address the problem of minimizing the propagation of undesirable things, such as computer viruses or malicious rumors, by blocking a limited number of links in a network, a dua...
Masahiro Kimura, Kazumi Saito, Hiroshi Motoda
120
Voted
RECSYS
2009
ACM
15 years 7 months ago
FeedbackTrust: using feedback effects in trust-based recommendation systems
With the advent of online social networks, the trust-based approach to recommendation has emerged which exploits the trust network among users and makes recommendations based on t...
Samaneh Moghaddam, Mohsen Jamali, Martin Ester, Ja...