A survey of clustering large probabilistic graphs: Techniques, evaluations, and applications.
Saved in:
| Title: | A survey of clustering large probabilistic graphs: Techniques, evaluations, and applications. |
|---|---|
| Authors: | Danesh, Malihe1,2 (AUTHOR), Dorrigiv, Morteza2 (AUTHOR) dorrigiv@semnan.ac.ir, Yaghmaee, Farzin2 (AUTHOR) |
| Source: | Expert Systems. Jul2023, Vol. 40 Issue 6, p1-20. 20p. |
| Subjects: | Probabilistic databases, Cluster analysis (Statistics), Graph algorithms, Taxonomy |
| Abstract: | Given the growth of uncertainty in the real world, analysing probabilistic graphs is crucial. Clustering is one of the most fundamental methods of mining probabilistic graphs to discover the hidden patterns in them. This survey examines an extensive and organized analysis of the clustering techniques of large probabilistic graphs proposed in the literature. First, the definition of probabilistic graphs and modelling them are introduced. Second, the clustering of such graphs and their challenges, such as uncertainty of edges, high dimensions, and the impossibility of applying certain graph clustering techniques directly, are expressed. Then, a taxonomy of clustering approaches is discussed in two main categories: threshold‐based and possible worlds‐based methods. The techniques presented in each category are explained and examined. Here, these methods are evaluated on real datasets, and their performance is compared with each other. Finally, the survey is summarized by describing some of the applications of probabilistic graph clustering and future research directions. [ABSTRACT FROM AUTHOR] |
| Copyright of Expert Systems is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | Given the growth of uncertainty in the real world, analysing probabilistic graphs is crucial. Clustering is one of the most fundamental methods of mining probabilistic graphs to discover the hidden patterns in them. This survey examines an extensive and organized analysis of the clustering techniques of large probabilistic graphs proposed in the literature. First, the definition of probabilistic graphs and modelling them are introduced. Second, the clustering of such graphs and their challenges, such as uncertainty of edges, high dimensions, and the impossibility of applying certain graph clustering techniques directly, are expressed. Then, a taxonomy of clustering approaches is discussed in two main categories: threshold‐based and possible worlds‐based methods. The techniques presented in each category are explained and examined. Here, these methods are evaluated on real datasets, and their performance is compared with each other. Finally, the survey is summarized by describing some of the applications of probabilistic graph clustering and future research directions. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 02664720 |
| DOI: | 10.1111/exsy.13248 |
