Skip navigation

Please use this identifier to cite or link to this item: http://10.10.120.238:8080/xmlui/handle/123456789/397
Full metadata record
DC FieldValueLanguage
dc.rights.licenseAll Open Access, Green-
dc.contributor.authorBanerjee S.en_US
dc.date.accessioned2023-11-30T08:31:42Z-
dc.date.available2023-11-30T08:31:42Z-
dc.date.issued2022-
dc.identifier.issn0219-1377-
dc.identifier.otherEID(2-s2.0-85133000760)-
dc.identifier.urihttps://dx.doi.org/10.1007/s10115-022-01681-w-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/397-
dc.description.abstractAn 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.isoenen_US
dc.publisherSpringer Science and Business Media Deutschland GmbHen_US
dc.sourceKnowledge and Information Systemsen_US
dc.subjectClassificationen_US
dc.subjectClusteringen_US
dc.subjectNode Similarityen_US
dc.subjectReachability Queryen_US
dc.subjectReliabilityen_US
dc.subjectUncertain graphen_US
dc.titleA survey on mining and analysis of uncertain graphsen_US
dc.typeJournal Articleen_US
Appears in Collections:Journal Article

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.