| IEEE Access | |
| Weight-Based K-Truss Community Search via Edge Attachment | |
| Mohamed E. El-Sharkawi1  Wafaa M. A. Habib1  Hoda M. O. Mokhtar1  | |
| [1] Information Systems Department, Faculty of Computers and Artificial Intelligence, Cairo University, Cairo, Egypt; | |
| 关键词: Community search; query processing; | |
| DOI : 10.1109/ACCESS.2020.3016214 | |
| 来源: DOAJ | |
【 摘 要 】
Community search is the task of discovering dense subgraph that satisfy a set of given query parameters. Most community search algorithms consider link structure while ignoring link weight. A recent study proposed the idea of discovering weighted communities which focuses on both link structure and link weight using an online search approach and index-based approach. In this paper two online algorithms are proposed to scale-up the existing online approach efficiency. Performance evaluation of the proposed algorithms against the existing online approach over different datasets shows a great improvement in terms of search and query evaluation time.
【 授权许可】
Unknown