Name
Abstract | ||
|---|---|---|
There have been considerable recent interest algorithms for finding communities in networks. This paper presents an algorithm based on link mining. The algorithm is very fast, since calculating the clustering coefficient can be done with local information only. With the algorithm, the community structure from the Enron email corpus is detected. And the visualization of the graph is showed. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ISDA.2006.253723 | ISDA |
Keywords | Field | DocType |
data mining,social networks,community structure,graph visualization,internet,clustering coefficient,graph theory | Graph theory,Graph drawing,Data mining,Community structure,Social network,Visualization,Computer science,Link mining,Clustering coefficient,The Internet | Conference |
Volume | Issue | ISSN |
2 | null | null |
ISBN | Citations | PageRank |
0-7695-2528-8 | 2 | 0.41 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rong Qian | 1 | 5 | 1.21 |
| Wei Zhang | 2 | 5 | 1.55 |
| Bingru Yang | 3 | 186 | 26.67 |