Sciweavers

415 search results - page 8 / 83
» Discovering communities in complex networks
Sort
View
EPIA
2009
Springer
16 years 1 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...
WWW
2006
ACM
16 years 7 months ago
Community discovery and analysis in blogspace
Weblog has quickly evolved into a new information and knowledge dissemination channel. Yet it is not easy to discover weblog communities through keyword search. The main contribut...
Ying Zhou, Joseph Davis
ACMSE
2005
ACM
16 years 4 days ago
Bibliometric approach to community discovery
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
Narsingh Deo, Hemant Balakrishnan
CVPR
2009
IEEE
17 years 1 months ago
Monitoring, Recognizing and Discovering Social Networks
This work addresses the important problem of the discovery and analysis of social networks from surveillance video. A computer vision approach to this problem is made possible b...
Ting Yu, Ser Nam Lim, Kedar A. Patwardhan, Nils Kr...
CORR
2002
Springer
102views Education» more  CORR 2002»
15 years 6 months ago
Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classificatio
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
Peter D. Turney