Name
Title | ||
|---|---|---|
Revealing the densest communities of social networks efficiently through intelligent data space reduction. |
Abstract | ||
|---|---|---|
•Dealing with the densest subgraph problem (DSP) in social networks.•Intelligent data space reduction for efficient DSP computation.•Four main steps: sliding segmentation, pruning, incremental merge and data recovery.•Significant increase in computing efficiency without sacrifice of accuracy. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.eswa.2017.10.047 | Expert Systems with Applications |
Keywords | Field | DocType |
Densest subgraph,Graph,Space reduction,Sampling,Heuristics | Data mining,Digital signal processing,Data set,Intelligent decision support system,Computer science,Theoretical computer science,Artificial intelligence,Computation,Sliding window protocol,Sampling (statistics),Big data,Machine learning,Scalability | Journal |
Volume | Issue | ISSN |
94 | C | 0957-4174 |
Citations | PageRank | References |
1 | 0.34 | 27 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tao Han | 1 | 57 | 11.82 |
| Yu-Chu Tian | 2 | 550 | 59.35 |
| Lan Yuqing | 3 | 19 | 5.77 |
| Fenglian Li | 4 | 22 | 2.43 |
| Limin Xiao | 5 | 107 | 28.51 |