Sciweavers

37 search results - page 3 / 8
» Neighbor query friendly compression of social networks
Sort
View
PVLDB
2010
152views more  PVLDB 2010»
13 years 4 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
SIGIR
2008
ACM
13 years 5 months ago
Efficient top-k querying over social-tagging networks
Online communities have become popular for publishing and searching content, as well as for finding and connecting to other users. User-generated content includes, for example, pe...
Ralf Schenkel, Tom Crecelius, Mouna Kacimi, Sebast...
KDD
2009
ACM
164views Data Mining» more  KDD 2009»
14 years 6 months ago
Social influence analysis in large-scale networks
In large social networks, nodes (users, entities) are influenced by others for various reasons. For example, the colleagues have strong influence on one's work, while the fri...
Jie Tang, Jimeng Sun, Chi Wang, Zi Yang
JSAC
2007
155views more  JSAC 2007»
13 years 5 months ago
Semantic social overlay networks
— Peer selection for query routing is a core task in peer-to-peer networks. Unstructured peer-to-peer systems (like Gnutella) ignore this problem, leading to an abundance of netw...
Alexander Löser, Steffen Staab, Christoph Tem...
MOBICOM
2005
ACM
13 years 11 months ago
PeopleNet: engineering a wireless virtual social network
People often seek information by asking other people even when they have access to vast reservoirs of information such as the Internet and libraries. This is because people are gr...
Mehul Motani, Vikram Srinivasan, Pavan Nuggehalli