On the public citation graph

ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns

0 signed · 48 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/11615576_4openalex-snapshot
A Survey on Condensed Representations for Frequent Sets
inferredcites →https://doi.org/10.1016/0166-218x(92)90177-copenalex-snapshot
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
inferredcites →https://doi.org/10.1016/s0167-8655(97)00060-3openalex-snapshot
On a relation between graph edit distance and maximum common subgraph
inferredcites →https://doi.org/10.1016/s0167-8655(97)00179-7openalex-snapshot
A graph distance metric based on the maximal common subgraph
inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1023/a:1021726221443openalex-snapshot
Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
inferredcites →https://doi.org/10.1109/icdm.2006.102openalex-snapshot
MARGIN: Maximal Frequent Subgraph Mining
inferredcites →https://doi.org/10.1137/1.9781611972757.13openalex-snapshot
Clustering With Constraints: Feasibility Issues and the k -Means Algorithm
inferredcites →https://doi.org/10.1145/1007568.1007607openalex-snapshot
Graph indexing
inferredcites →https://doi.org/10.1145/1014052.1014057openalex-snapshot
Approximating a collection of frequent sets
inferredcites →https://doi.org/10.1145/1014052.1014123openalex-snapshot
SPIN
inferredcites →https://doi.org/10.1145/1014052.1014134openalex-snapshot
A quickstart in frequent structure mining can make a difference
inferredcites →https://doi.org/10.1145/1150402.1150452openalex-snapshot
Extracting redundancy-aware top-k patterns
inferredcites →https://doi.org/10.1145/956750.956784openalex-snapshot
CloseGraph
inferredcites →https://doi.org/10.1613/jair.43openalex-snapshot
Substructure Discovery Using Minimum Description Length and Background Knowledge

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.5077openalex-snapshot
A possibilistic framework for the detection of terrorism‐related Twitter communities in social media
inferred← citeshttps://doi.org/10.1002/sam.11277openalex-snapshot
FS3: A sampling based method for top‐k frequent subgraph mining
inferred← citeshttps://doi.org/10.1007/978-3-030-23887-2_25openalex-snapshot
Sampling Rank Correlated Subgroups
inferred← citeshttps://doi.org/10.1007/978-3-319-12571-8_18openalex-snapshot
Instant Exceptional Model Mining Using Weighted Controlled Pattern Sampling
inferred← citeshttps://doi.org/10.1007/978-3-319-31750-2_16openalex-snapshot
Frequent Pattern Outlier Detection Without Exhaustive Mining
inferred← citeshttps://doi.org/10.1007/978-3-319-40596-4_46openalex-snapshot
POSGRAMI: Possibilistic Frequent Subgraph Mining in a Single Large Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-28047-4_16openalex-snapshot
A Journey in Pattern Mining
inferred← citeshttps://doi.org/10.1007/s10115-012-0528-3openalex-snapshot
Graph mining for discovering infrastructure patterns in configuration management databases
inferred← citeshttps://doi.org/10.1007/s10472-013-9335-0openalex-snapshot
A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
inferred← citeshttps://doi.org/10.1007/s10618-015-0409-yopenalex-snapshot
Sampling frequent and minimal boolean patterns: theory and application in classification
inferred← citeshttps://doi.org/10.1007/s10844-019-00555-yopenalex-snapshot
Rank correlated subgroup discovery
inferred← citeshttps://doi.org/10.1007/s10994-010-5193-8openalex-snapshot
Effective feature construction by maximum common subgraph sampling
inferred← citeshttps://doi.org/10.1007/s41060-016-0019-9openalex-snapshot
Anytime algorithm for frequent pattern outlier detection
inferred← citeshttps://doi.org/10.1016/j.is.2013.08.005openalex-snapshot
Density-based data partitioning strategy to approximate large-scale subgraph mining
inferred← citeshttps://doi.org/10.1016/j.is.2017.05.006openalex-snapshot
MR-SimLab: Scalable subgraph selection with label similarity for big data
inferred← citeshttps://doi.org/10.1016/j.jnca.2016.02.021openalex-snapshot
Mining social networks for anomalies: Methods and challenges
inferred← citeshttps://doi.org/10.1016/j.procs.2018.07.275openalex-snapshot
A New Framework of Frequent Uncertain Subgraph Mining
inferred← citeshttps://doi.org/10.1109/aiccsa.2015.7507186openalex-snapshot
A survey of uncertainty handling in frequent subgraph mining algorithms
inferred← citeshttps://doi.org/10.1109/aici.2009.314openalex-snapshot
A Novel Tree Cluster Approach Based on Least Closed Tree
inferred← citeshttps://doi.org/10.1109/bigdata.2014.7004359openalex-snapshot
FS3: A sampling based method for top-k frequent subgraph mining
inferred← citeshttps://doi.org/10.1109/icdm.2011.81openalex-snapshot
Infrastructure Pattern Discovery in Configuration Management Databases via Large Sparse Graph Mining
inferred← citeshttps://doi.org/10.1109/icis.2009.133openalex-snapshot
An Efficient Algorithm to Mine Unordered Trees
inferred← citeshttps://doi.org/10.1109/icst.2018.00019openalex-snapshot
Behavioral Fault Localization by Sampling Suspicious Dynamic Control Flow Subgraphs
inferred← citeshttps://doi.org/10.1109/iwsc.2017.7880512openalex-snapshot
Rethinking dependence clones
inferred← citeshttps://doi.org/10.1109/tcbb.2017.2756879openalex-snapshot
Discovery of Functional Motifs from the Interface Region of Oligomeric Proteins Using Frequent Subgraph Mining
inferred← citeshttps://doi.org/10.1145/3216122.3216172openalex-snapshot
WalDis
inferred← citeshttps://doi.org/10.1145/3394486.3403204openalex-snapshot
Diverse Rule Sets
inferred← citeshttps://doi.org/10.1186/s40537-021-00432-yopenalex-snapshot
Developing a mathematical model of the co-author recommender system using graph mining techniques and big data applications
inferred← citeshttps://doi.org/10.1590/0101-7438.2017.037.02.0387openalex-snapshot
QUALITY ANALYSIS FOR THE VRP SOLUTIONS USING COMPUTER VISION TECHNIQUES
inferred← citeshttps://doi.org/10.2991/nceece-15.2016.41openalex-snapshot
A Novel Tree Cluster and Classification Approach Based on Least Closed Tree
inferred← citeshttps://doi.org/10.3724/sp.j.1087.2010.00423openalex-snapshot
Novel tree cluster and classification approach based on least closed tree
inferred← citeshttps://doi.org/10.70675/b855a47dzedbcz4c70z8182z106e2b03e9e7openalex-snapshot
Les communautés dans les multigraphes de co-appartenance : Application aux listes Twitter
inferred← citeshttps://doi.org/10.70675/bd136949z93b4z422fz9252z7fff5fc5da11openalex-snapshot
Contribution à la découverte de sous-groupes corrélés : Application à l’analyse des systèmes territoriaux et des réseaux alimentaires
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.