Discovering Signature of Potential Web Communities from Clusters of MCL
Lin Frank Song · Chinese Journal of Computers · 2007
Web community is an important social activity in the evolution of Web.The paper an- alyzes typical algorithms of present Web communities' discovery.Under the condition of non-top- ic pre-defined and implicit communities,a new method is proposed,which combine both charac- teristic structure of community and the clusters of Markov Graph Clustering(MCL)to find im- plicit communities.The procedure of deleting mirror or near-mirror pages is arranged behind graph clustering so that decrease comparing cost considerably.Then a community member select algorithm is used to produce the set of community candidates.The experimental results show the new method works properly and many Web communities are inferred.