Sciweavers

322 search results - page 24 / 65
» Structural and algorithmic aspects of massive social network...
Sort
View
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
15 years 10 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
PDCAT
2005
Springer
15 years 3 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu
CEC
2010
IEEE
14 years 10 months ago
Two novel Ant Colony Optimization approaches for Bayesian network structure learning
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
Yanghui Wu, John A. W. McCall, David W. Corne
JMLR
2012
13 years 3 days ago
Graphlet decomposition of a weighted network
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...
Hossein Azari Soufiani, Edo Airoldi
IAT
2009
IEEE
15 years 4 months ago
Social Trust-Aware Recommendation System: A T-Index Approach
Collaborative Filtering based on similarity suffers from a variety of problems such as sparsity and scalability. In this paper, we propose an ontological model of trust between us...
Alireza Zarghami, Soude Fazeli, Nima Dokoohaki, Mi...