FRINK Linked Data Fragments server

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

• W1992461601 endingPage "33" @default.
• W1992461601 startingPage "1" @default.
• W1992461601 abstract "We present efficient algorithms for releasing useful statistics about graph data while providing rigorous privacy guarantees. Our algorithms work on datasets that consist of relationships between individuals, such as social ties or email communication. The algorithms satisfy edge differential privacy , which essentially requires that the presence or absence of any particular relationship be hidden. Our algorithms output approximate answers to subgraph counting queries . Given a query graph H , for example, a triangle, k -star, or k -triangle, the goal is to return the number of edge-induced isomorphic copies of H in the input graph. The special case of triangles was considered by Nissim et al. [2007] and a more general investigation of arbitrary query graphs was initiated by Rastogi et al. [2009]. We extend the approach of Nissim et al. to a new class of statistics, namely k -star queries. We also give algorithms for k -triangle queries using a different approach based on the higher-order local sensitivity. For the specific graph statistics we consider (i.e., k -stars and k -triangles), we significantly improve on the work of Rastogi et al.: our algorithms satisfy a stronger notion of privacy that does not rely on the adversary having a particular prior distribution on the data, and add less noise to the answers before releasing them. We evaluate the accuracy of our algorithms both theoretically and empirically, using a variety of real and synthetic datasets. We give explicit, simple conditions under which these algorithms add a small amount of noise. We also provide the average-case analysis in the Erdős-Rényi-Gilbert G ( n , p ) random graph model. Finally, we give hardness results indicating that the approach Nissim et al. used for triangles cannot easily be extended to k -triangles (hence justifying our development of a new algorithmic approach)." @default.
• W1992461601 created "2016-06-24" @default.
• W1992461601 creator A5001984674 @default.
• W1992461601 creator A5079131956 @default.
• W1992461601 creator A5080839778 @default.
• W1992461601 creator A5086016834 @default.
• W1992461601 date "2014-10-07" @default.
• W1992461601 modified "2023-09-27" @default.
• W1992461601 title "Private Analysis of Graph Structure" @default.
• W1992461601 cites W1526797722 @default.
• W1992461601 cites W1557833142 @default.
• W1992461601 cites W1586209290 @default.
• W1992461601 cites W1592775138 @default.
• W1992461601 cites W1873763122 @default.
• W1992461601 cites W1925003247 @default.
• W1992461601 cites W1977843657 @default.
• W1992461601 cites W2017509273 @default.
• W1992461601 cites W2022097286 @default.
• W1992461601 cites W2032005951 @default.
• W1992461601 cites W2037289762 @default.
• W1992461601 cites W2050164782 @default.
• W1992461601 cites W2054922243 @default.
• W1992461601 cites W2055411402 @default.
• W1992461601 cites W2080900058 @default.
• W1992461601 cites W2101771965 @default.
• W1992461601 cites W2109059328 @default.
• W1992461601 cites W2136676173 @default.
• W1992461601 cites W2138865266 @default.
• W1992461601 cites W2145067884 @default.
• W1992461601 cites W2150611147 @default.
• W1992461601 cites W2159675343 @default.
• W1992461601 cites W2160113380 @default.
• W1992461601 cites W2160268549 @default.
• W1992461601 cites W2163263459 @default.
• W1992461601 cites W2165081249 @default.
• W1992461601 cites W2169861334 @default.
• W1992461601 cites W2406036028 @default.
• W1992461601 cites W2486096428 @default.
• W1992461601 cites W2496163386 @default.
• W1992461601 cites W2911978475 @default.
• W1992461601 doi "https://doi.org/10.1145/2611523" @default.
• W1992461601 hasPublicationYear "2014" @default.
• W1992461601 type Work @default.
• W1992461601 sameAs 1992461601 @default.
• W1992461601 citedByCount "64" @default.
• W1992461601 countsByYear W19924616012012 @default.
• W1992461601 countsByYear W19924616012013 @default.
• W1992461601 countsByYear W19924616012014 @default.
• W1992461601 countsByYear W19924616012015 @default.
• W1992461601 countsByYear W19924616012016 @default.
• W1992461601 countsByYear W19924616012017 @default.
• W1992461601 countsByYear W19924616012018 @default.
• W1992461601 countsByYear W19924616012019 @default.
• W1992461601 countsByYear W19924616012020 @default.
• W1992461601 countsByYear W19924616012021 @default.
• W1992461601 countsByYear W19924616012022 @default.
• W1992461601 countsByYear W19924616012023 @default.
• W1992461601 crossrefType "journal-article" @default.
• W1992461601 hasAuthorship W1992461601A5001984674 @default.
• W1992461601 hasAuthorship W1992461601A5079131956 @default.
• W1992461601 hasAuthorship W1992461601A5080839778 @default.
• W1992461601 hasAuthorship W1992461601A5086016834 @default.
• W1992461601 hasBestOaLocation W19924616012 @default.
• W1992461601 hasConcept C11413529 @default.
• W1992461601 hasConcept C132525143 @default.
• W1992461601 hasConcept C23130292 @default.
• W1992461601 hasConcept C41008148 @default.
• W1992461601 hasConcept C80444323 @default.
• W1992461601 hasConceptScore W1992461601C11413529 @default.
• W1992461601 hasConceptScore W1992461601C132525143 @default.
• W1992461601 hasConceptScore W1992461601C23130292 @default.
• W1992461601 hasConceptScore W1992461601C41008148 @default.
• W1992461601 hasConceptScore W1992461601C80444323 @default.
• W1992461601 hasFunder F4320306076 @default.
• W1992461601 hasFunder F4320337387 @default.
• W1992461601 hasFunder F4320337405 @default.
• W1992461601 hasIssue "3" @default.
• W1992461601 hasLocation W19924616011 @default.
• W1992461601 hasLocation W19924616012 @default.
• W1992461601 hasOpenAccess W1992461601 @default.
• W1992461601 hasPrimaryLocation W19924616011 @default.
• W1992461601 hasRelatedWork W2919589499 @default.
• W1992461601 hasRelatedWork W2999324419 @default.
• W1992461601 hasRelatedWork W3035493623 @default.
• W1992461601 hasRelatedWork W3120912508 @default.
• W1992461601 hasRelatedWork W4288055350 @default.
• W1992461601 hasRelatedWork W4307537046 @default.
• W1992461601 hasRelatedWork W4311410896 @default.
• W1992461601 hasRelatedWork W4313200733 @default.
• W1992461601 hasRelatedWork W4320502856 @default.
• W1992461601 hasRelatedWork W4225838250 @default.
• W1992461601 hasVolume "39" @default.
• W1992461601 isParatext "false" @default.
• W1992461601 isRetracted "false" @default.
• W1992461601 magId "1992461601" @default.
• W1992461601 workType "article" @default.