Sciweavers

450 search results - page 65 / 90
» Mining Antagonistic Communities from Social Networks
Sort
View
SIGSOFT
2008
ACM
14 years 8 months ago
Latent social structure in open source projects
Commercial software project managers design project organizational structure carefully, mindful of available skills, division of labour, geographical boundaries, etc. These organi...
Christian Bird, David S. Pattison, Raissa M. D'Sou...
MASS
2010
157views Communications» more  MASS 2010»
13 years 5 months ago
Spatial extension of the Reality Mining Dataset
Data captured from a live cellular network with the real users during their common daily routine help to understand how the users move within the network. Unlike the simulations wi...
Michal Ficek, Lukas Kencl
KDD
2007
ACM
154views Data Mining» more  KDD 2007»
14 years 8 months ago
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and m...
Sitaram Asur, Srinivasan Parthasarathy, Duygu Ucar
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 8 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
CORR
2012
Springer
209views Education» more  CORR 2012»
12 years 3 months ago
Densest Subgraph in Streaming and MapReduce
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii