Matches in SemOpenAlex for { <https://semopenalex.org/work/W2767579966> ?p ?o ?g. }
Showing items 1 to 47 of
47
with 100 items per page.
- W2767579966 abstract "In recent years, modeling the relation between two graphs has received unprecedented attention from researchers due to its wide applications in many areas, such as social analysis and bioinformatics. The nature of relations between two graphs can be divided into two categories: the vertex relation and the link relation. Many studies focus on modeling the vertex relation between graphs and try to find the vertex correspondence between two graphs. However, the link relation between graphs has not been fully studied. Specifically, we model the cross-graph link relation as cross-graph dependence, which reflects the dependence of a vertex in one graph on a vertex in the other graph. A generic problem, called Graph Dependence Minimization (GDM), is defined as: given two graphs with cross-graph dependence, how to select a subset of vertexes from one graph and copy them to the other, so as to minimize the cross-graph dependence. Many real applications can benefit from the solution to GDM. Examples include reducing the cross-language links in online encyclopedias, optimizing the cross-platform communication cost between different cloud services, and so on. This problem is trivial if we can select as many vertexes as we want to copy. But what if we can only choose a limited number of vertexes to copy so as to make the two graphs as independent as possible? We formulate GDM with a budget constraint into a combinatorial optimization problem, which is proven to be NP-hard. We propose two algorithms to solve GDM. Firstly, we prove the submodularity of the objective function of GDM and adopt the size-constrained submodular minimization (SSM) algorithm to solve it. Since the SSM-based algorithm cannot scale to large graphs, we design a heuristic algorithm with a provable approximation guarantee. We prove that the error achieved by the heuristic algorithm is bounded by an additive factor which is proportional to the square of the given budget. Extensive experiments on both synthetic and real-world graphs show that the proposed algorithms consistently outperform the well-studied graph centrality measure based solutions. Furthermore, we conduct a case study on the Wikipedia graphs with millions of vertexes and links to demonstrate the potential of GDM to solve real-world problems." @default.
- W2767579966 created "2017-11-17" @default.
- W2767579966 creator A5082572337 @default.
- W2767579966 creator A5085614235 @default.
- W2767579966 date "2017-11-06" @default.
- W2767579966 modified "2023-10-11" @default.
- W2767579966 title "Minimizing Dependence between Graphs" @default.
- W2767579966 cites W1886770168 @default.
- W2767579966 cites W1916698127 @default.
- W2767579966 cites W1984209790 @default.
- W2767579966 cites W2030035054 @default.
- W2767579966 cites W2039616005 @default.
- W2767579966 cites W2047532797 @default.
- W2767579966 cites W2107427454 @default.
- W2767579966 cites W2170569385 @default.
- W2767579966 cites W2336938381 @default.
- W2767579966 cites W2338981077 @default.
- W2767579966 cites W2469279958 @default.
- W2767579966 cites W4312512934 @default.
- W2767579966 cites W633744573 @default.
- W2767579966 doi "https://doi.org/10.1145/3132847.3132931" @default.
- W2767579966 hasPublicationYear "2017" @default.
- W2767579966 type Work @default.
- W2767579966 sameAs 2767579966 @default.
- W2767579966 citedByCount "0" @default.
- W2767579966 crossrefType "proceedings-article" @default.
- W2767579966 hasAuthorship W2767579966A5082572337 @default.
- W2767579966 hasAuthorship W2767579966A5085614235 @default.
- W2767579966 hasConcept C41008148 @default.
- W2767579966 hasConceptScore W2767579966C41008148 @default.
- W2767579966 hasLocation W27675799661 @default.
- W2767579966 hasOpenAccess W2767579966 @default.
- W2767579966 hasPrimaryLocation W27675799661 @default.
- W2767579966 hasRelatedWork W2093578348 @default.
- W2767579966 hasRelatedWork W2130043461 @default.
- W2767579966 hasRelatedWork W2350741829 @default.
- W2767579966 hasRelatedWork W2358668433 @default.
- W2767579966 hasRelatedWork W2376932109 @default.
- W2767579966 hasRelatedWork W2382290278 @default.
- W2767579966 hasRelatedWork W2390279801 @default.
- W2767579966 hasRelatedWork W2748952813 @default.
- W2767579966 hasRelatedWork W2899084033 @default.
- W2767579966 hasRelatedWork W3004735627 @default.
- W2767579966 isParatext "false" @default.
- W2767579966 isRetracted "false" @default.
- W2767579966 magId "2767579966" @default.
- W2767579966 workType "article" @default.