An Efficient Approximation of Betweenness Centrality for Uncertain Graphs
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Access"
DOI: 10.1109/access.2019.2915974
Abstract: Betweenness centrality measures the centrality of nodes and edges in a graph based on the concept of shortest paths. However, such a definition is unsuitable for uncertain graphs due to the uncertainty of links. In… read more here.
Keywords: uncertain graphs; centrality; centrality uncertain; shortest paths ... See more keywords
Efficient Mining of Frequent Patterns on Uncertain Graphs
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Transactions on Knowledge and Data Engineering"
DOI: 10.1109/tkde.2018.2830336
Abstract: Uncertainty is intrinsic to a wide spectrum of real-life applications, which inevitably applies to graph data. Representative uncertain graphs are seen in bio-informatics, social networks, etc. This paper motivates the problem of frequent subgraph mining… read more here.
Keywords: frequent; uncertain graphs; problem; mining ... See more keywords