On the public citation graph
Finding Robust Itemsets under Subsampling
0 signed · 52 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11615576openalex-snapshot
Constraint-Based Mining and Inductive Databases
inferredcites →https://doi.org/10.1007/11615576_4openalex-snapshot
A Survey on Condensed Representations for Frequent Sets
inferredcites →https://doi.org/10.1007/11733492_9openalex-snapshot
Transaction Databases, Frequent Itemsets, and Their Condensed Representations
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/3-540-49257-7_25openalex-snapshot
Discovering Frequent Closed Itemsets for Association Rules
inferredcites →https://doi.org/10.1007/978-3-540-74976-9_44openalex-snapshot
MINI: Mining Informative Non-redundant Itemsets
inferredcites →https://doi.org/10.1007/978-3-540-75488-6_21openalex-snapshot
An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining
inferredcites →https://doi.org/10.1007/978-3-642-33486-3_42openalex-snapshot
A Framework for Evaluating the Smoothness of Data-Mining Results
inferredcites →https://doi.org/10.1007/s10115-008-0128-4openalex-snapshot
Maximum entropy based significance of itemsets
inferredcites →https://doi.org/10.1007/s10115-008-0136-4openalex-snapshot
One in a million: picking the right patterns
inferredcites →https://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
inferredcites →https://doi.org/10.1007/s10618-006-0054-6openalex-snapshot
Non-derivable itemset mining
inferredcites →https://doi.org/10.1007/s10618-010-0202-xopenalex-snapshot
Krimp: mining itemsets that compress
inferredcites →https://doi.org/10.1007/s10618-010-0209-3openalex-snapshot
Maximum entropy models and subjective interestingness: an application to tiles in binary databases
inferredcites →https://doi.org/10.1007/s10994-007-5006-xopenalex-snapshot
Discovering Significant Patterns
inferredcites →https://doi.org/10.1007/s10994-008-5045-yopenalex-snapshot
Discovering significant patterns
inferredcites →https://doi.org/10.1023/a:1021571501451openalex-snapshot
Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries
inferredcites →https://doi.org/10.1038/ncomms1396openalex-snapshot
Ranking stability and super-stable nodes in complex networks
inferredcites →https://doi.org/10.1109/icde.2001.914856openalex-snapshot
Mining frequent itemsets with convertible constraints
inferredcites →https://doi.org/10.1109/icde.2007.367917openalex-snapshot
Discriminative Frequent Pattern Analysis for Effective Classification
inferredcites →https://doi.org/10.1109/icdm.2006.10openalex-snapshot
AC-Close: Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery
inferredcites →https://doi.org/10.1109/icdm.2011.69openalex-snapshot
Finding Robust Itemsets under Subsampling
inferredcites →https://doi.org/10.1137/1.9781611972801.15openalex-snapshot
Mining Top-K Patterns from Binary Datasets in presence of Noise
inferredcites →https://doi.org/10.1137/1.9781611972818.69openalex-snapshot
The Odd One Out: Identifying and Characterising Anomalies
inferredcites →https://doi.org/10.1137/1.9781611977172openalex-snapshot
Proceedings of the 2022 SIAM International Conference on Data Mining (SDM)
inferredcites →https://doi.org/10.1145/1244002.1244097openalex-snapshot
Mining itemsets in the presence of missing values
inferredcites →https://doi.org/10.1145/1282480openalex-snapshot
Proceedings of the 1st International Conference on Very Large Data Bases - VLDB '75
inferredcites →https://doi.org/10.1145/1297332.1297338openalex-snapshot
Assessing data mining results via swap randomization
inferredcites →https://doi.org/10.1145/1401890.1401930openalex-snapshot
Quantitative evaluation of approximate frequent pattern mining algorithms
inferredcites →https://doi.org/10.1145/1557019.1557065openalex-snapshot
Tell me something I don't know
inferredcites →https://doi.org/10.1145/170035.170072openalex-snapshot
Mining association rules between sets of items in large databases
inferredcites →https://doi.org/10.1145/319950.320054openalex-snapshot
Clustering transactions using large items
inferredcites →https://doi.org/10.1145/360402.360421openalex-snapshot
Algorithms for association rule mining — a general survey and comparison
inferredcites →https://doi.org/10.1145/584792.584877openalex-snapshot
Evaluation of hierarchical clustering algorithms for document datasets
inferredcites →https://doi.org/10.48550/arxiv.2006.09467openalex-snapshot
Tell Me Something I Don't Know: Randomization Strategies for Iterative Data Mining
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-030-06167-8_13openalex-snapshot
Formal Concept Analysis: From Knowledge Discovery to Knowledge Processing
inferred← citeshttps://doi.org/10.1007/978-3-030-72610-2_3openalex-snapshot
On Interpretability and Similarity in Concept-Based Machine Learning
inferred← citeshttps://doi.org/10.1007/978-3-319-23525-7_10openalex-snapshot
Fast Generation of Best Interval Patterns for Nonmonotonic Constraints
inferred← citeshttps://doi.org/10.1007/s10472-022-09790-6openalex-snapshot
Knowledge cores in large formal contexts
inferred← citeshttps://doi.org/10.1016/j.dam.2019.03.002openalex-snapshot
Approximating concept stability using variance reduction techniques
inferred← citeshttps://doi.org/10.1016/j.inffus.2024.102427openalex-snapshot
Neural networks for intelligent multilevel control of artificial and natural objects based on data fusion: A survey
inferred← citeshttps://doi.org/10.1016/j.ins.2018.02.032openalex-snapshot
On interestingness measures of formal concepts
inferred← citeshttps://doi.org/10.1016/j.jocs.2023.102196openalex-snapshot
Mining actionable concepts in concept lattice using Interestingness Propagation
inferred← citeshttps://doi.org/10.1109/icde.2016.7498300openalex-snapshot
Interactive data exploration with smart drill-down
inferred← citeshttps://doi.org/10.1109/icdm.2017.88openalex-snapshot
Efficient Mining of Subsample-Stable Graph Patterns
inferred← citeshttps://doi.org/10.1109/tkde.2017.2685998openalex-snapshot
Interactive Data Exploration with Smart Drill-Down
inferred← citeshttps://doi.org/10.1134/s1995080226618709openalex-snapshot
On Calculation of Robustness and Stability of Formal Concepts Based on Delta Measure
inferred← citeshttps://doi.org/10.1142/s0219622025500294openalex-snapshot
Mining Nonderivable Association Rules Using a Genetic Algorithm and a Tree-Based Pruning Technique
inferred← citeshttps://doi.org/10.48550/arxiv.1611.02646openalex-snapshot
On interestingness measures of formal concepts
inferred← citeshttps://doi.org/10.48550/arxiv.1711.10427openalex-snapshot
Latent Association Mining in Binary Data
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.