http://10.10.120.238:8080/xmlui/handle/123456789/397
DC Field | Value | Language |
---|---|---|
dc.rights.license | All Open Access, Green | - |
dc.contributor.author | Banerjee S. | en_US |
dc.date.accessioned | 2023-11-30T08:31:42Z | - |
dc.date.available | 2023-11-30T08:31:42Z | - |
dc.date.issued | 2022 | - |
dc.identifier.issn | 0219-1377 | - |
dc.identifier.other | EID(2-s2.0-85133000760) | - |
dc.identifier.uri | https://dx.doi.org/10.1007/s10115-022-01681-w | - |
dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/397 | - |
dc.description.abstract | An uncertain graph (also known as probabilistic graph) is a generic model to represent many real-world networks from social to biological. In recent times, analysis and mining of uncertain graphs have drawn significant attention from the researchers of the data management community. Several noble problems have been introduced, and efficient methodologies have been developed to solve those problems. Hence, there is a need to summarize the existing results on this topic in a self-organized way. In this paper, we present a comprehensive survey on uncertain graph mining focusing on mainly three aspects: (i) different problems studied, (ii) computational challenges for solving those problems, and (iii) proposed methodologies. Finally, we list out important future research directions. © 2022, The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer Science and Business Media Deutschland GmbH | en_US |
dc.source | Knowledge and Information Systems | en_US |
dc.subject | Classification | en_US |
dc.subject | Clustering | en_US |
dc.subject | Node Similarity | en_US |
dc.subject | Reachability Query | en_US |
dc.subject | Reliability | en_US |
dc.subject | Uncertain graph | en_US |
dc.title | A survey on mining and analysis of uncertain graphs | en_US |
dc.type | Journal Article | en_US |
Appears in Collections: | Journal Article |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.