Matches in SemOpenAlex for { <https://semopenalex.org/work/W2949349735> ?p ?o ?g. }
- W2949349735 abstract "Enumerating maximal cliques from an uncertain graph is a fundamental problem in uncertain graph analysis. Given an uncertain graph G, a set of nodes C in G is a maximal (k, τ)-clique if (1) |C|>k and C is a clique with probability at least τ, and (2) C is a maximal node set meeting (1). The state-of-the-art algorithm for enumerating all maximal (k, τ)-cliques is very costly when handling large uncertain graphs, as its time complexity is proportional to 2^n where n is the number of nodes in the uncertain graph. To overcome this issue, we propose two new core-based pruning algorithms to reduce the uncertain graph size without missing any maximal (k, τ)-clique. We also develop a novel cut-based optimization technique to further improve the pruning performance of the core-based pruning algorithms. Based on these pruning techniques, we propose an improved algorithm to enumerate all maximal (k, τ)-cliques, and a new algorithm with several novel upper-bounding techniques to compute one of maximum (k, τ)-cliques from the pruned uncertain graph. The results of extensive experiments on six real-world datasets demonstrate the efficiency and effectiveness of the proposed algorithms." @default.
- W2949349735 created "2019-06-27" @default.
- W2949349735 creator A5017054985 @default.
- W2949349735 creator A5030519392 @default.
- W2949349735 creator A5046220908 @default.
- W2949349735 creator A5054991337 @default.
- W2949349735 creator A5070014390 @default.
- W2949349735 creator A5075642293 @default.
- W2949349735 date "2019-04-01" @default.
- W2949349735 modified "2023-10-16" @default.
- W2949349735 title "Improved Algorithms for Maximal Clique Search in Uncertain Networks" @default.
- W2949349735 cites W1485742133 @default.
- W2949349735 cites W1516453703 @default.
- W2949349735 cites W1823437338 @default.
- W2949349735 cites W1890592509 @default.
- W2949349735 cites W1951702208 @default.
- W2949349735 cites W1963605141 @default.
- W2949349735 cites W1964043357 @default.
- W2949349735 cites W1984291654 @default.
- W2949349735 cites W1997987084 @default.
- W2949349735 cites W1998341696 @default.
- W2949349735 cites W1998369386 @default.
- W2949349735 cites W2029682635 @default.
- W2949349735 cites W2046112356 @default.
- W2949349735 cites W2057272970 @default.
- W2949349735 cites W2057463094 @default.
- W2949349735 cites W2066303519 @default.
- W2949349735 cites W2080182143 @default.
- W2949349735 cites W2101434765 @default.
- W2949349735 cites W2116007667 @default.
- W2949349735 cites W2116117181 @default.
- W2949349735 cites W2120286774 @default.
- W2949349735 cites W2125895010 @default.
- W2949349735 cites W2133238553 @default.
- W2949349735 cites W2134277721 @default.
- W2949349735 cites W2137442080 @default.
- W2949349735 cites W2139694815 @default.
- W2949349735 cites W2147991930 @default.
- W2949349735 cites W2148606255 @default.
- W2949349735 cites W2150902060 @default.
- W2949349735 cites W2160429376 @default.
- W2949349735 cites W2164928285 @default.
- W2949349735 cites W2244851978 @default.
- W2949349735 cites W2328058578 @default.
- W2949349735 cites W2432087854 @default.
- W2949349735 cites W2440113929 @default.
- W2949349735 cites W248604449 @default.
- W2949349735 cites W2588222785 @default.
- W2949349735 cites W2595853853 @default.
- W2949349735 cites W2750598393 @default.
- W2949349735 cites W2794823917 @default.
- W2949349735 cites W2799241431 @default.
- W2949349735 cites W2893695676 @default.
- W2949349735 cites W2963054764 @default.
- W2949349735 doi "https://doi.org/10.1109/icde.2019.00108" @default.
- W2949349735 hasPublicationYear "2019" @default.
- W2949349735 type Work @default.
- W2949349735 sameAs 2949349735 @default.
- W2949349735 citedByCount "21" @default.
- W2949349735 countsByYear W29493497352019 @default.
- W2949349735 countsByYear W29493497352020 @default.
- W2949349735 countsByYear W29493497352021 @default.
- W2949349735 countsByYear W29493497352022 @default.
- W2949349735 countsByYear W29493497352023 @default.
- W2949349735 crossrefType "proceedings-article" @default.
- W2949349735 hasAuthorship W2949349735A5017054985 @default.
- W2949349735 hasAuthorship W2949349735A5030519392 @default.
- W2949349735 hasAuthorship W2949349735A5046220908 @default.
- W2949349735 hasAuthorship W2949349735A5054991337 @default.
- W2949349735 hasAuthorship W2949349735A5070014390 @default.
- W2949349735 hasAuthorship W2949349735A5075642293 @default.
- W2949349735 hasConcept C108010975 @default.
- W2949349735 hasConcept C11413529 @default.
- W2949349735 hasConcept C114614502 @default.
- W2949349735 hasConcept C122818955 @default.
- W2949349735 hasConcept C132525143 @default.
- W2949349735 hasConcept C149530733 @default.
- W2949349735 hasConcept C150997102 @default.
- W2949349735 hasConcept C154945302 @default.
- W2949349735 hasConcept C189239283 @default.
- W2949349735 hasConcept C203776342 @default.
- W2949349735 hasConcept C2777035058 @default.
- W2949349735 hasConcept C33923547 @default.
- W2949349735 hasConcept C41008148 @default.
- W2949349735 hasConcept C43517604 @default.
- W2949349735 hasConcept C63584917 @default.
- W2949349735 hasConcept C6557445 @default.
- W2949349735 hasConcept C86803240 @default.
- W2949349735 hasConceptScore W2949349735C108010975 @default.
- W2949349735 hasConceptScore W2949349735C11413529 @default.
- W2949349735 hasConceptScore W2949349735C114614502 @default.
- W2949349735 hasConceptScore W2949349735C122818955 @default.
- W2949349735 hasConceptScore W2949349735C132525143 @default.
- W2949349735 hasConceptScore W2949349735C149530733 @default.
- W2949349735 hasConceptScore W2949349735C150997102 @default.
- W2949349735 hasConceptScore W2949349735C154945302 @default.
- W2949349735 hasConceptScore W2949349735C189239283 @default.
- W2949349735 hasConceptScore W2949349735C203776342 @default.
- W2949349735 hasConceptScore W2949349735C2777035058 @default.
- W2949349735 hasConceptScore W2949349735C33923547 @default.