会议专题

Finding Core Members in Virtual Communities

Finding the core members of a virtual community is an important problem in community analysis. Here we presented an simulated annealing algorithm to solve this problem by optimizing the user interests concentration ratio in user groups. As an example, we test this algorithm on a virtual community site and evaluate its results using human “gold standardmethod.

Virtual community core members finding simulated annealing

Haiqiang Chen Xueqi Cheng Yue Liu

Institute of Computing Technology P.O. Box 2704 Beijing, China

国际会议

第十七届国际万维网大会(the 17th International World Wide Web Conference)(WWW08)

北京

英文

2008-04-21(万方平台首次上网日期,不代表论文的发表时间)