On the public citation graph

Set-Based Unified Approach for Attributed Graph Summarization

https://doi.org/10.1109/bdcloud.2014.108

0 signed · 37 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s00607-015-0454-9openalex-snapshot

Set-based approximate approach for lossless graph summarization

inferredcites →https://doi.org/10.1007/s10115-013-0648-4openalex-snapshot

Compressed representations for web and social graphs

inferredcites →https://doi.org/10.1016/0005-1098(78)90005-5openalex-snapshot

Modeling by shortest data description

inferredcites →https://doi.org/10.1016/j.cosrev.2007.05.001openalex-snapshot

Graph clustering

inferredcites →https://doi.org/10.1016/s0169-7552(97)00031-7openalex-snapshot

Syntactic clustering of the Web

inferredcites →https://doi.org/10.1073/pnas.122653799openalex-snapshot

Community structure in social and biological networks

inferredcites →https://doi.org/10.1109/icde.2010.5447830openalex-snapshot

Discovery-driven graph summarization

inferredcites →https://doi.org/10.1109/icdm.2011.26openalex-snapshot

Beyond 'Caveman Communities': Hubs and Spokes for Graph Compression and Mining

inferredcites →https://doi.org/10.1137/1.9781611973440.11openalex-snapshot

VOG: Summarizing and Understanding Large Graphs

inferredcites →https://doi.org/10.1145/1341531.1341547openalex-snapshot

A scalable pattern mining approach to web graph compression with communities

inferredcites →https://doi.org/10.1145/1376616.1376661openalex-snapshot

Graph summarization with bounded error

inferredcites →https://doi.org/10.1145/1376616.1376675openalex-snapshot

Efficient aggregation for graph summarization

inferredcites →https://doi.org/10.1145/1513876.1513879openalex-snapshot

Extraction and classification of dense implicit communities in the Web graph

inferredcites →https://doi.org/10.1145/1557019.1557049openalex-snapshot

On compressing social networks

inferredcites →https://doi.org/10.1145/1835804.1835873openalex-snapshot

Neighbor query friendly compression of social networks

inferredcites →https://doi.org/10.1145/1989323.1989399openalex-snapshot

Local graph sparsification for scalable clustering

inferredcites →https://doi.org/10.1145/2020408.2020566openalex-snapshot

Compression of weighted graphs

inferredcites →https://doi.org/10.1145/2213836.2213855openalex-snapshot

Query preserving graph compression

inferredcites →https://doi.org/10.1145/2488388.2488483openalex-snapshot

Efficient community detection in large networks using content and links

inferredcites →https://doi.org/10.1145/988672.988752openalex-snapshot

The webgraph framework I

inferredcites →https://doi.org/10.14778/1920841.1920930openalex-snapshot

Scalable discovery of best clusters on large graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-69781-9_16openalex-snapshot

Graph Summarization Based on Attribute-Connected Network

inferred← citeshttps://doi.org/10.1007/978-3-319-93040-4_57openalex-snapshot

HashAlign: Hash-Based Alignment of Multiple Graphs

inferred← citeshttps://doi.org/10.1007/s10618-022-00846-zopenalex-snapshot

The minimum description length principle for pattern mining: a survey

inferred← citeshttps://doi.org/10.1007/s11280-016-0388-yopenalex-snapshot

Set-based unified approach for summarization of a multi-attributed graph

inferred← citeshttps://doi.org/10.1016/j.eswa.2021.114921openalex-snapshot

Distributed aggregation-based attributed graph summarization for summary-based approximate attributed graph queries

inferred← citeshttps://doi.org/10.1016/j.ins.2022.08.008openalex-snapshot

CSPM: Discovering compressing stars in attributed graphs

inferred← citeshttps://doi.org/10.1109/icccbda49378.2020.9095755openalex-snapshot

Aggregation-Based Attributed Graph Summarization

inferred← citeshttps://doi.org/10.1109/icde53745.2022.00010openalex-snapshot

Discovering Representative Attribute-stars via Minimum Description Length

inferred← citeshttps://doi.org/10.1145/2837060.2837088openalex-snapshot

Analyzing Subgraph Isomorphism on Graphs with Diverse Structural Properties

inferred← citeshttps://doi.org/10.1145/3186727openalex-snapshot

Graph Summarization Methods and Applications

inferred← citeshttps://doi.org/10.1145/3308558.3313402openalex-snapshot

SWeG: Lossless and Lossy Summarization of Web-Scale Graphs

inferred← citeshttps://doi.org/10.1145/3494561openalex-snapshot

Multi-relation Graph Summarization

inferred← citeshttps://doi.org/10.32657/10356/137863openalex-snapshot

Querying and mining complex graphs : uncertainty and multi-relations

inferred← citeshttps://doi.org/10.48550/arxiv.1612.04883openalex-snapshot

Graph Summarization Methods and Applications: A Survey

inferred← citeshttps://doi.org/10.48550/arxiv.1806.01799openalex-snapshot

Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations

inferred← citeshttps://doi.org/10.70675/87fdd0ebzb635z419ezb1a6z22607b8201a7openalex-snapshot

Synthèse Graphique Multidimensionnelle : Application aux documents hétérogènes

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.