Abstract | ||
---|---|---|
The Web is a typical example of a social network. One of the most intriguing features of the Web is its self-organization behavior, which is usually faced through the existence of communities. The dis- covery of the communities in a Web-graph can be used to improve the eectiv eness of search engines, for purposes of prefetching, bibliographic citation ranking, spam detection, creation of road-maps and site graphs, etc. Correspondingly, a citation graph is also a social network which con- sists of communities. The identication of communities in citation graphs can enhance the bibliography search as well as the data-mining. In this paper we will present a fast algorithm which can identify the communi- ties over a given unweighted/undirected graph. This graph may represent a Web-graph or a citation graph. |
Year | Venue | Keywords |
---|---|---|
2006 | Advances in Databases and Information Systems | social network,search engine,data mining,self organization |
DocType | Volume | Citations |
Conference | abs/1208.5464 | 0 |
PageRank | References | Authors |
0.34 | 9 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Antonis Sidiropoulos | 1 | 380 | 27.27 |