FRINK Linked Data Fragments server

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

• W3198608925 endingPage "123846" @default.
• W3198608925 startingPage "123827" @default.
• W3198608925 abstract "Community search is a fundamental problem in graph analysis. In many applications, network nodes have specific properties that are essential for making sense of communities. In these networks, attributes are associated with nodes to capture their properties. The community influence is a key property of the community that can be employed to sort the communities in a network based on the relevance/importance of certain attributes. Unfortunately, most of the previously introduced community search algorithms over attributed networks neglected the community influence. In this paper, we study the influential attributed community search problem. Different factors for measuring the influence are discussed. Also, different Influential Attributed Community (InfACom) algorithms based on the concept of k-clique are proposed. Two techniques are presented one for sequential implementation with three variations and one for parallel implementation. In addition, we propose efficient algorithms for maintaining the proposed algorithms on dynamic graphs. The proposed algorithms are evaluated on different real datasets. The experimental results show that the summarization technique reduces the size of the graph by approximately half. In addition, it shows that the proposed algorithms $EnhancedExact$ and $Approximate$ outperform the state-of-the-art approaches Incremental Time efficient $(Inc-T)$ , Incremental Space efficient $(Inc-S)$ , $Exact$ , and 2-Approximation $(AppInc)$ in both efficiency and effectiveness. For the $EnhancedExact$ algorithm, the results show that the efficiency is at least 7 times faster than the $Inc-S$ algorithm, at least 4.5 times faster than the $Inc-T$ algorithm, and 2 times faster than the $AppInc$ algorithm. For the $Approximate$ algorithm, the results show that its efficiency is at least 10 times faster than the $Inc-S$ algorithm, at least 6.4 times faster than the $Inc-T$ algorithm, and 3 times faster than the $AppInc$ algorithm. Finally, the results show that the proposed algorithms retrieve cohesive communities with a smaller diameter than all the state-of-the-art approaches." @default.
• W3198608925 created "2021-09-13" @default.
• W3198608925 creator A5040843591 @default.
• W3198608925 creator A5048405773 @default.
• W3198608925 creator A5063190396 @default.
• W3198608925 date "2021-01-01" @default.
• W3198608925 modified "2023-09-25" @default.
• W3198608925 title "Influential Attributed Communities Search in Large Networks (InfACom)" @default.
• W3198608925 cites W1836071589 @default.
• W3198608925 cites W1964405426 @default.
• W3198608925 cites W1964419312 @default.
• W3198608925 cites W1974515660 @default.
• W3198608925 cites W1984903982 @default.
• W3198608925 cites W2037487875 @default.
• W3198608925 cites W2112947018 @default.
• W3198608925 cites W2119757574 @default.
• W3198608925 cites W2125895010 @default.
• W3198608925 cites W2127048411 @default.
• W3198608925 cites W2131681506 @default.
• W3198608925 cites W2142599626 @default.
• W3198608925 cites W2164928285 @default.
• W3198608925 cites W2165515835 @default.
• W3198608925 cites W2207622687 @default.
• W3198608925 cites W2212315060 @default.
• W3198608925 cites W2291620117 @default.
• W3198608925 cites W2297833300 @default.
• W3198608925 cites W2432087854 @default.
• W3198608925 cites W2436321460 @default.
• W3198608925 cites W248604449 @default.
• W3198608925 cites W2533110648 @default.
• W3198608925 cites W2547646153 @default.
• W3198608925 cites W2574388534 @default.
• W3198608925 cites W2594188495 @default.
• W3198608925 cites W2614213223 @default.
• W3198608925 cites W2615043415 @default.
• W3198608925 cites W2619090416 @default.
• W3198608925 cites W2621145626 @default.
• W3198608925 cites W2735638351 @default.
• W3198608925 cites W2753758798 @default.
• W3198608925 cites W2770448129 @default.
• W3198608925 cites W2799241431 @default.
• W3198608925 cites W2941473391 @default.
• W3198608925 cites W2946100359 @default.
• W3198608925 cites W2962936633 @default.
• W3198608925 cites W2963674482 @default.
• W3198608925 cites W2963985215 @default.
• W3198608925 cites W3035103671 @default.
• W3198608925 cites W3102137745 @default.
• W3198608925 cites W3106306756 @default.
• W3198608925 cites W776559747 @default.
• W3198608925 doi "https://doi.org/10.1109/access.2021.3109862" @default.
• W3198608925 hasPublicationYear "2021" @default.
• W3198608925 type Work @default.
• W3198608925 sameAs 3198608925 @default.
• W3198608925 citedByCount "1" @default.
• W3198608925 countsByYear W31986089252022 @default.
• W3198608925 crossrefType "journal-article" @default.
• W3198608925 hasAuthorship W3198608925A5040843591 @default.
• W3198608925 hasAuthorship W3198608925A5048405773 @default.
• W3198608925 hasAuthorship W3198608925A5063190396 @default.
• W3198608925 hasBestOaLocation W31986089251 @default.
• W3198608925 hasConcept C41008148 @default.
• W3198608925 hasConceptScore W3198608925C41008148 @default.
• W3198608925 hasLocation W31986089251 @default.
• W3198608925 hasLocation W31986089252 @default.
• W3198608925 hasOpenAccess W3198608925 @default.
• W3198608925 hasPrimaryLocation W31986089251 @default.
• W3198608925 hasRelatedWork W2049775471 @default.
• W3198608925 hasRelatedWork W2093578348 @default.
• W3198608925 hasRelatedWork W2350741829 @default.
• W3198608925 hasRelatedWork W2358668433 @default.
• W3198608925 hasRelatedWork W2376932109 @default.
• W3198608925 hasRelatedWork W2382290278 @default.
• W3198608925 hasRelatedWork W2390279801 @default.
• W3198608925 hasRelatedWork W2748952813 @default.
• W3198608925 hasRelatedWork W2899084033 @default.
• W3198608925 hasRelatedWork W3004735627 @default.
• W3198608925 hasVolume "9" @default.
• W3198608925 isParatext "false" @default.
• W3198608925 isRetracted "false" @default.
• W3198608925 magId "3198608925" @default.
• W3198608925 workType "article" @default.