Sciweavers

3017 search results - page 97 / 604
» On compressing social networks
Sort
View
ACL
2010
15 years 4 months ago
Extracting Social Networks from Literary Fiction
We present a method for extracting social networks from literature, namely, nineteenth-century British novels and serials. We derive the networks from dialogue interactions, and t...
David K. Elson, Nicholas Dames, Kathleen McKeown
ASUNAM
2011
IEEE
14 years 6 months ago
Probabilistic Subgraph Matching on Huge Social Networks
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
ECTEL
2010
Springer
15 years 5 months ago
Who Students Interact With? A Social Network Analysis Perspective on the Use of Twitter in Language Learning
Abstract. This paper reports student interaction patterns and self-reported results of using Twitter microblogging environment. The study employs longitudinal probabilistic social ...
Carsten Ullrich, Kerstin Borau, Karen Stepanyan
IPL
2010
139views more  IPL 2010»
15 years 3 months ago
A note on competitive diffusion through social networks
We introduce a game-theoretic model of diffusion of technologies, advertisements, or influence through a social network. The novelty in our model is that the players are intereste...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 8 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu