FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2607129247> ?p ?o ?g. }

• W2607129247 endingPage "116" @default.
• W2607129247 startingPage "87" @default.
• W2607129247 abstract "Graphs play an important role in modern world, due to their widespread use for modeling, representing and organizing linked data. Taking into consideration that most of the “killer” applications require a graph-based representation (e.g., the Web, social network management, protein-protein interaction networks), efficient query processing and analysis techniques are required, not only because these graphs are massive but also because the operations that must be supported are complex, requiring significant computational resources. In many cases, each graph edge e is annotated by a probability value p(e), expressing its existential uncertainty. This means that with probability p(e) the edge will be present in the graph and with probability $$1-p(e)$$ the edge will be absent. This gives rise to the concept of probabilistic graphs (also known as uncertain graphs). Formally, a probabilistic graph $$mathcal{G}$$ is a triplet (V, E, p) where V is the set of nodes, E is the set of edges and $$p: E rightarrow (0,1]$$ . The main challenge posed by this formulation is that problems that are relatively easy to solve in exact graphs become very difficult (or even intractable) in probabilistic graphs. In this paper, we perform an overview of the algorithmic techniques proposed in the literature for uncertain graph analysis. In particular, we center our focus on the following graph mining tasks: clustering, maximal cliques, k-nearest neighbors and core decomposition. We conclude the paper with a short discussion related to distributed mining of uncertain graphs which is expected to achieve significant performance improvements." @default.
• W2607129247 created "2017-04-28" @default.
• W2607129247 creator A5007708004 @default.
• W2607129247 creator A5011211191 @default.
• W2607129247 creator A5067758248 @default.
• W2607129247 creator A5086706681 @default.
• W2607129247 date "2017-01-01" @default.
• W2607129247 modified "2023-10-01" @default.
• W2607129247 title "Mining Uncertain Graphs: An Overview" @default.
• W2607129247 cites W1550457191 @default.
• W2607129247 cites W1555834419 @default.
• W2607129247 cites W1567562836 @default.
• W2607129247 cites W1588510915 @default.
• W2607129247 cites W1739450634 @default.
• W2607129247 cites W1888358353 @default.
• W2607129247 cites W1951702208 @default.
• W2607129247 cites W1972714715 @default.
• W2607129247 cites W1997987084 @default.
• W2607129247 cites W1998369386 @default.
• W2607129247 cites W2001125165 @default.
• W2607129247 cites W2002368644 @default.
• W2607129247 cites W2006023152 @default.
• W2607129247 cites W2028438572 @default.
• W2607129247 cites W2029682635 @default.
• W2607129247 cites W2043354831 @default.
• W2607129247 cites W2055285298 @default.
• W2607129247 cites W2057046770 @default.
• W2607129247 cites W2057272970 @default.
• W2607129247 cites W2084619201 @default.
• W2607129247 cites W2091858563 @default.
• W2607129247 cites W2098084730 @default.
• W2607129247 cites W2104670598 @default.
• W2607129247 cites W2106855819 @default.
• W2607129247 cites W2107223449 @default.
• W2607129247 cites W2115826669 @default.
• W2607129247 cites W2116117181 @default.
• W2607129247 cites W2124200646 @default.
• W2607129247 cites W2124354935 @default.
• W2607129247 cites W2125580539 @default.
• W2607129247 cites W2127048411 @default.
• W2607129247 cites W2133238553 @default.
• W2607129247 cites W2133695619 @default.
• W2607129247 cites W2136618432 @default.
• W2607129247 cites W2136850043 @default.
• W2607129247 cites W2137442080 @default.
• W2607129247 cites W2147192365 @default.
• W2607129247 cites W2148606255 @default.
• W2607129247 cites W2150061878 @default.
• W2607129247 cites W2150902060 @default.
• W2607129247 cites W2151936673 @default.
• W2607129247 cites W2164928285 @default.
• W2607129247 cites W2166470254 @default.
• W2607129247 cites W2240933082 @default.
• W2607129247 cites W2266714125 @default.
• W2607129247 cites W2293358305 @default.
• W2607129247 cites W2295256067 @default.
• W2607129247 cites W2314247963 @default.
• W2607129247 cites W2328058578 @default.
• W2607129247 cites W2331877186 @default.
• W2607129247 cites W2432087854 @default.
• W2607129247 cites W2497849059 @default.
• W2607129247 cites W2914959486 @default.
• W2607129247 cites W4234390533 @default.
• W2607129247 cites W4239766041 @default.
• W2607129247 cites W631140850 @default.
• W2607129247 doi "https://doi.org/10.1007/978-3-319-57045-7_6" @default.
• W2607129247 hasPublicationYear "2017" @default.
• W2607129247 type Work @default.
• W2607129247 sameAs 2607129247 @default.
• W2607129247 citedByCount "16" @default.
• W2607129247 countsByYear W26071292472018 @default.
• W2607129247 countsByYear W26071292472019 @default.
• W2607129247 countsByYear W26071292472020 @default.
• W2607129247 countsByYear W26071292472021 @default.
• W2607129247 countsByYear W26071292472022 @default.
• W2607129247 countsByYear W26071292472023 @default.
• W2607129247 crossrefType "book-chapter" @default.
• W2607129247 hasAuthorship W2607129247A5007708004 @default.
• W2607129247 hasAuthorship W2607129247A5011211191 @default.
• W2607129247 hasAuthorship W2607129247A5067758248 @default.
• W2607129247 hasAuthorship W2607129247A5086706681 @default.
• W2607129247 hasConcept C118615104 @default.
• W2607129247 hasConcept C132525143 @default.
• W2607129247 hasConcept C154945302 @default.
• W2607129247 hasConcept C160446614 @default.
• W2607129247 hasConcept C187407849 @default.
• W2607129247 hasConcept C203776342 @default.
• W2607129247 hasConcept C33923547 @default.
• W2607129247 hasConcept C41008148 @default.
• W2607129247 hasConcept C43517604 @default.
• W2607129247 hasConcept C49937458 @default.
• W2607129247 hasConcept C73555534 @default.
• W2607129247 hasConcept C80444323 @default.
• W2607129247 hasConceptScore W2607129247C118615104 @default.
• W2607129247 hasConceptScore W2607129247C132525143 @default.
• W2607129247 hasConceptScore W2607129247C154945302 @default.
• W2607129247 hasConceptScore W2607129247C160446614 @default.
• W2607129247 hasConceptScore W2607129247C187407849 @default.

• next