Browse State-of-the-Art › Community Search
Community Search
3 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Papers archive 2025-07-28
archive papers tagged: 11 · with a code link: 3 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (1 of 11 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 11 of 11, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.
-
15 Mar 2023 1 repository listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 3 harvested samples)The evolution of these networks over time has motivated several recent studies to identify local communities in temporal networks.
-
3 Apr 2022 1 repository listedMany algorithms are proposed in studying subgraph problems, where one common approach is by extracting the patterns and structures of a given graph.
-
4 Dec 2019 1 repository listedWe introduce a novel keyword-aware influential community query KICQ that finds the most influential communities from an attributed graph, where an influential community is defined as a closely connected group of…
-
Community Search in Time-dependent Road-social Attributed Networks18 May 2025 0 repositories listedReal-world networks often involve both keywords and locations, along with travel time variations between locations due to traffic conditions.
-
Pre-trained Prompt-driven Semi-supervised Local Community Detection18 May 2025 0 repositories listedSemi-supervised local community detection aims to leverage known communities to detect the community containing a given node.
-
How Cohesive Are Community Search Results on Online Social Networks?: An Experimental Evaluation28 Apr 2025 0 repositories listedRecently, numerous community search methods for large graphs have been proposed, at the core of which is defining and measuring cohesion.
-
Community search signatures as foundation features for human-centered geospatial modeling30 Oct 2024 0 repositories listedAggregated relative search frequencies offer a unique composite signal reflecting people's habits, concerns, interests, intents, and general information needs, which are not found in other readily available datasets.
-
An Effective Index for Truss-based Community Search on Large Directed Graphs19 Jan 2024 0 repositories listedCommunity search is a derivative of community detection that enables online and personalized discovery of communities and has found extensive applications in massive real-world networks.
-
Fast Butterfly-Core Community Search For Large Labeled Graphs19 Jan 2024 0 repositories listedCommunity Search (CS) aims to identify densely interconnected subgraphs corresponding to query vertices within a graph.
-
CS-MLGCN : Multiplex Graph Convolutional Networks for Community Search in Multiplex Networks17 Oct 2022 0 repositories listedCommunity Search (CS) is one of the fundamental tasks in network science and has attracted much attention due to its ability to discover personalized communities with a wide range of applications.
-
Query Driven-Graph Neural Networks for Community Search: From Non-Attributed, Attributed, to Interactive Attributed8 Apr 2021 0 repositories listedGiven one or more query vertices, Community Search (CS) aims to find densely intra-connected and loosely inter-connected structures containing query vertices.
Syntology lines on 1 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections