Matches in SemOpenAlex for { <https://semopenalex.org/work/W4298032188> ?p ?o ?g. }
Showing items 1 to 47 of
47
with 100 items per page.
- W4298032188 abstract "The sparsest cut problem consists of identifying a small set of edges that breaks the graph into balanced sets of vertices. The normalized cut problem balances the total degree, instead of the size, of the resulting sets. Applications of graph cuts include community detection and computer vision. However, cut problems were originally proposed for static graphs, an assumption that does not hold in many modern applications where graphs are highly dynamic. In this paper, we introduce the sparsest and normalized cut problems in temporal graphs, which generalize their standard definitions by enforcing the smoothness of cuts over time. We propose novel formulations and algorithms for computing temporal cuts using spectral graph theory, multiplex graphs, divide-and-conquer and low-rank matrix approximation. Furthermore, we extend our formulation to dynamic graph signals, where cuts also capture node values, as graph wavelets. Experiments show that our solutions are accurate and scalable, enabling the discovery of dynamic communities and the analysis of dynamic graph processes." @default.
- W4298032188 created "2022-10-01" @default.
- W4298032188 creator A5036639779 @default.
- W4298032188 creator A5057941268 @default.
- W4298032188 creator A5077074252 @default.
- W4298032188 date "2017-02-15" @default.
- W4298032188 modified "2023-10-16" @default.
- W4298032188 title "Spectral Algorithms for Temporal Graph Cuts" @default.
- W4298032188 doi "https://doi.org/10.48550/arxiv.1702.04746" @default.
- W4298032188 hasPublicationYear "2017" @default.
- W4298032188 type Work @default.
- W4298032188 citedByCount "0" @default.
- W4298032188 crossrefType "posted-content" @default.
- W4298032188 hasAuthorship W4298032188A5036639779 @default.
- W4298032188 hasAuthorship W4298032188A5057941268 @default.
- W4298032188 hasAuthorship W4298032188A5077074252 @default.
- W4298032188 hasBestOaLocation W42980321881 @default.
- W4298032188 hasConcept C11413529 @default.
- W4298032188 hasConcept C132525143 @default.
- W4298032188 hasConcept C33923547 @default.
- W4298032188 hasConcept C41008148 @default.
- W4298032188 hasConcept C48044578 @default.
- W4298032188 hasConcept C77088390 @default.
- W4298032188 hasConcept C80444323 @default.
- W4298032188 hasConceptScore W4298032188C11413529 @default.
- W4298032188 hasConceptScore W4298032188C132525143 @default.
- W4298032188 hasConceptScore W4298032188C33923547 @default.
- W4298032188 hasConceptScore W4298032188C41008148 @default.
- W4298032188 hasConceptScore W4298032188C48044578 @default.
- W4298032188 hasConceptScore W4298032188C77088390 @default.
- W4298032188 hasConceptScore W4298032188C80444323 @default.
- W4298032188 hasLocation W42980321881 @default.
- W4298032188 hasOpenAccess W4298032188 @default.
- W4298032188 hasPrimaryLocation W42980321881 @default.
- W4298032188 hasRelatedWork W1666765134 @default.
- W4298032188 hasRelatedWork W2116176106 @default.
- W4298032188 hasRelatedWork W2915336237 @default.
- W4298032188 hasRelatedWork W2964394077 @default.
- W4298032188 hasRelatedWork W2982368516 @default.
- W4298032188 hasRelatedWork W3039500550 @default.
- W4298032188 hasRelatedWork W3094989083 @default.
- W4298032188 hasRelatedWork W4288563611 @default.
- W4298032188 hasRelatedWork W4301846872 @default.
- W4298032188 hasRelatedWork W4309581948 @default.
- W4298032188 isParatext "false" @default.
- W4298032188 isRetracted "false" @default.
- W4298032188 workType "article" @default.