?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=Generalized+Louvain+Method+for+Community+Detection+in+Large+Networks&rft.creator=De+Meo%2C+Pasquale&rft.creator=Ferrara%2C+Emilio&rft.creator=Fiumara%2C+Giacomo&rft.creator=Provetti%2C+Alessandro&rft.subject=Artificial+Intelligence&rft.subject=Dynamical+Systems&rft.description=In+this+paper+we+present+a+novel+strategy+to+discover+the+community+structure+of+(possibly%2C+large)+networks.+This+approach+is+based+on+the+well-know+concept+of+network+modularity+optimization.+To+do+so%2C+our+algorithm+exploits+a+novel+measure+of+edge+centrality%2C+based+on+the+k-paths.+This+technique+allows+to+efficiently+compute+a+edge+ranking+in+large+networks+in+near+linear+time.+Once+the+centrality+ranking+is+calculated%2C+the+algorithm+computes+the+pairwise+proximity+between+nodes+of+the+network.+Finally%2C+it+discovers+the+community+structure+adopting+a+strategy+inspired+by+the+well-known+state-of-the-art+Louvain+method+(henceforth%2C+LM)%2C+efficiently+maximizing+the+network+modularity.+The+experiments+we+carried+out+show+that+our+algorithm+outperforms+other+techniques+and+slightly+improves+results+of+the+original+LM%2C+providing+reliable+results.+Another+advantage+is+that+its+adoption+is+naturally+extended+even+to+unweighted+networks%2C+differently+with+respect+to+the+LM.%0D%0A&rft.date=2011&rft.type=Conference+Paper&rft.type=PeerReviewed&rft.format=application%2Fpdf&rft.identifier=http%3A%2F%2Fcogprints.org%2F7667%2F1%2Fisda2011-k-path.pdf&rft.identifier=++De+Meo%2C+Pasquale+and+Ferrara%2C+Emilio+and+Fiumara%2C+Giacomo+and+Provetti%2C+Alessandro++(2011)+Generalized+Louvain+Method+for+Community+Detection+in+Large+Networks.++%5BConference+Paper%5D+++++&rft.relation=http%3A%2F%2Fcogprints.org%2F7667%2F