Sciweavers

450 search results - page 32 / 90
» Mining Antagonistic Communities from Social Networks
Sort
View
DASFAA
2009
IEEE
127views Database» more  DASFAA 2009»
14 years 2 months ago
Searching for Rising Stars in Bibliography Networks
Identifying the rising stars is an important but difficult human resource exercise in all organizations. Rising stars are those who currently have relatively low profiles but may e...
Xiaoli Li, Chuan Sheng Foo, Kar Leong Tew, See-Kio...
CSCW
2008
ACM
13 years 9 months ago
Representing community: knowing users in the face of changing constituencies
This paper traces the use of the concept 'community' by drawing attention to the ways in which it serves as an organizing principle within systems development. The data ...
David Ribes, Thomas A. Finholt
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
14 years 12 days ago
Parallel community detection on large networks with propinquity dynamics
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
Yuzhou Zhang, Jianyong Wang, Yi Wang, Lizhu Zhou
ECCV
2010
Springer
14 years 1 months ago
Learning Relations Among Movie Characters: A Social Network Perspective
If you have ever watched movies or television shows, you know how easy it is to tell the good characters from the bad ones. Little, however, is known “whether” or “how” com...
EPIA
2009
Springer
14 years 2 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...