ML Anthology

Local Search for Diversified Top-K S-Plex Search Problem (Student Abstract)

Jun Wu, Minghao Yin
AAAI 2021 pp. 15929-15930
doi:10.1609/AAAI.V35I18.17961 /aaai/2021/wu2021aaai-local/

Abstract

The diversified top-k s-plex (DTKSP) search problem aims to find k maximal s-plexes that cover the maximum number of vertices with lower overlapping in a given graph. In this paper, we first formalize the diversified top-k s-plex search problem and prove the NP-hardness of it. Second, we proposed a local search algorithm for solving the diversified top-k s-plex search problem based on some novel ideas. Experiments on real-world massive graphs show the effectiveness of our algorithm.

PDF AAAI Semantic Scholar

Cite

Text

Wu and Yin. "Local Search for Diversified Top-K S-Plex Search Problem (Student Abstract)." AAAI Conference on Artificial Intelligence, 2021. doi:10.1609/AAAI.V35I18.17961

Markdown

[Wu and Yin. "Local Search for Diversified Top-K S-Plex Search Problem (Student Abstract)." AAAI Conference on Artificial Intelligence, 2021.](https://mlanthology.org/aaai/2021/wu2021aaai-local/) doi:10.1609/AAAI.V35I18.17961

BibTeX

@inproceedings{wu2021aaai-local,
  title     = {{Local Search for Diversified Top-K S-Plex Search Problem (Student Abstract)}},
  author    = {Wu, Jun and Yin, Minghao},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2021},
  pages     = {15929-15930},
  doi       = {10.1609/AAAI.V35I18.17961},
  url       = {https://mlanthology.org/aaai/2021/wu2021aaai-local/}
}