التفاصيل البيبلوغرافية
العنوان: |
k-Clique counting on large scale-graphs: a survey |
المؤلفون: |
Büşra Çalmaz, Belgin Ergenç Bostanoğlu |
المصدر: |
PeerJ Computer Science, Vol 10, p e2501 (2024) |
بيانات النشر: |
PeerJ Inc., 2024. |
سنة النشر: |
2024 |
المجموعة: |
LCC:Electronic computers. Computer science |
مصطلحات موضوعية: |
Graph mining, Subgraph enumeration, Graphlet counting, Network motifs, Clique counting, Local graphlet counting, Electronic computers. Computer science, QA75.5-76.95 |
الوصف: |
Clique counting is a crucial task in graph mining, as the count of cliques provides different insights across various domains, social and biological network analysis, community detection, recommendation systems, and fraud detection. Counting cliques is algorithmically challenging due to combinatorial explosion, especially for large datasets and larger clique sizes. There are comprehensive surveys and reviews on algorithms for counting subgraphs and triangles (three-clique), but there is a notable lack of reviews addressing k-clique counting algorithms for k > 3. This paper addresses this gap by reviewing clique counting algorithms designed to overcome this challenge. Also, a systematic analysis and comparison of exact and approximation techniques are provided by highlighting their advantages, disadvantages, and suitability for different contexts. It also presents a taxonomy of clique counting methodologies, covering approximate and exact methods and parallelization strategies. The paper aims to enhance understanding of this specific domain and guide future research of k-clique counting in large-scale graphs. |
نوع الوثيقة: |
article |
وصف الملف: |
electronic resource |
اللغة: |
English |
تدمد: |
2376-5992 |
Relation: |
https://peerj.com/articles/cs-2501.pdf; https://peerj.com/articles/cs-2501/; https://doaj.org/toc/2376-5992 |
DOI: |
10.7717/peerj-cs.2501 |
URL الوصول: |
https://doaj.org/article/4828b8843a704250b27134b1d60a0cfe |
رقم الانضمام: |
edsdoj.4828b8843a704250b27134b1d60a0cfe |
قاعدة البيانات: |
Directory of Open Access Journals |