On the public citation graph

AC-Close: Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery

0 signed · 42 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/3-540-45372-5_8openalex-snapshot
Approximation of Frequency Queries by Means of Free-Sets
inferredcites →https://doi.org/10.1007/s10115-003-0133-6openalex-snapshot
Mining Condensed Frequent-Pattern Bases
inferredcites →https://doi.org/10.1109/69.846291openalex-snapshot
Scalable algorithms for association mining
inferredcites →https://doi.org/10.1137/1.9781611972764.36openalex-snapshot
Mining Approximate Frequent Itemsets In the Presence of Noise: Algorithm and Analysis
inferredcites →https://doi.org/10.1145/1014052.1014086openalex-snapshot
Support envelopes
inferredcites →https://doi.org/10.1145/1014052.1014140openalex-snapshot
Dense itemsets
inferredcites →https://doi.org/10.1145/276304.276313openalex-snapshot
Efficiently mining long patterns from databases
inferredcites →https://doi.org/10.1145/335191.335372openalex-snapshot
Mining frequent patterns without candidate generation
inferredcites →https://doi.org/10.1145/342009.335372openalex-snapshot
Mining frequent patterns without candidate generation
inferredcites →https://doi.org/10.1145/502512.502539openalex-snapshot
Efficient discovery of error-tolerant frequent itemsets in high dimensions

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-0-387-69935-6_15openalex-snapshot
Approximate Frequent Itemset Mining In the Presence of Random Noise
inferred← citeshttps://doi.org/10.1007/978-1-4419-7738-0_5openalex-snapshot
Generalizing Itemset Mining in a Constraint Programming Setting
inferred← citeshttps://doi.org/10.1007/978-3-319-05461-2_1openalex-snapshot
Introduction to Pattern Mining
inferred← citeshttps://doi.org/10.1007/978-3-319-22729-0_7openalex-snapshot
Supervised Evaluation of Top-k Itemset Mining Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-43946-4_8openalex-snapshot
Evaluating Top-K Approximate Patterns via Text Clustering
inferred← citeshttps://doi.org/10.1007/978-3-540-78137-0_2openalex-snapshot
Actionability and Formal Concepts: A Data Mining Perspective
inferred← citeshttps://doi.org/10.1007/978-3-642-00727-9_1openalex-snapshot
Association Analysis Techniques for Bioinformatics Problems
inferred← citeshttps://doi.org/10.1007/s10115-010-0329-5openalex-snapshot
Efficient mining of all margin-closed itemsets with applications in temporal knowledge discovery and classification by compression
inferred← citeshttps://doi.org/10.1007/s10115-010-0369-xopenalex-snapshot
Application-independent feature construction based on almost-closedness properties
inferred← citeshttps://doi.org/10.1016/j.datak.2007.10.003openalex-snapshot
Discovering frequent itemsets by support approximation and itemset clustering
inferred← citeshttps://doi.org/10.1016/j.is.2009.03.001openalex-snapshot
Emerging Cubes: Borders, size estimations and lossless reductions
inferred← citeshttps://doi.org/10.1080/0305215x.2014.995177openalex-snapshot
Mining constraint relationships and redundancies with association analysis for optimization problem formulation
inferred← citeshttps://doi.org/10.1080/18756891.2013.819179openalex-snapshot
Clustering bipartite graphs in terms of approximate formal concepts and sub-contexts
inferred← citeshttps://doi.org/10.1109/bwcca.2015.29openalex-snapshot
Mining Approximate Frequent Patterns from Noisy Databases
inferred← citeshttps://doi.org/10.1109/ccem48484.2019.00015openalex-snapshot
Compressing Closed Frequent Itemsets with Controlled Information Loss
inferred← citeshttps://doi.org/10.1109/dsaa.2014.7058115openalex-snapshot
Mining approximate multi-relational patterns
inferred← citeshttps://doi.org/10.1109/icdm.2011.69openalex-snapshot
Finding Robust Itemsets under Subsampling
inferred← citeshttps://doi.org/10.1109/incos.2015.87openalex-snapshot
A Model of Mining Noise-Tolerant Frequent Itemset in Transactional Databases
inferred← citeshttps://doi.org/10.1109/rcis.2010.5507360openalex-snapshot
A tree-based approach for efficiently mining approximate frequent itemsets
inferred← citeshttps://doi.org/10.1109/tcbb.2018.2864564openalex-snapshot
Exploring Frequented Regions in Pan-Genomic Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2013.181openalex-snapshot
A Unifying Framework for Mining Approximate Top- $k$ Binary Patterns
inferred← citeshttps://doi.org/10.1137/1.9781611972795.87openalex-snapshot
Efficient Computation of Partial-Support for Mining Interesting Itemsets
inferred← citeshttps://doi.org/10.1137/1.9781611972801.15openalex-snapshot
Mining Top-K Patterns from Binary Datasets in presence of Noise
inferred← citeshttps://doi.org/10.1145/1401890.1401930openalex-snapshot
Quantitative evaluation of approximate frequent pattern mining algorithms
inferred← citeshttps://doi.org/10.1145/1774088.1774320openalex-snapshot
A generative pattern model for mining binary datasets
inferred← citeshttps://doi.org/10.1145/1816112.1816116openalex-snapshot
CloseViz
inferred← citeshttps://doi.org/10.1145/2656261openalex-snapshot
Finding Robust Itemsets under Subsampling
inferred← citeshttps://doi.org/10.1145/3107411.3107427openalex-snapshot
Exploring Frequented Regions in Pan-Genomic Graphs
inferred← citeshttps://doi.org/10.1186/1471-2105-12-s12-s1openalex-snapshot
Discovery of error-tolerant biclusters from noisy gene expression data
inferred← citeshttps://doi.org/10.2991/ijcis.d.200715.002openalex-snapshot
Climbing the Hill with ILP to Grow Patterns in Fuzzy Tensors
inferred← citeshttps://doi.org/10.5755/j01.itc.50.4.29060openalex-snapshot
Mining Approximate Frequent Itemsets Using Pattern Growth Approach
inferred← citeshttps://doi.org/10.70675/2fdc7386z77fdz4810z9a7czba871e96a446openalex-snapshot
Extraction multidimensionnelle et multicritère de données émergentes pour l'équilibrage de jeux vidéo
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.