On the public citation graph
Compressed Hierarchical Mining of Frequent Closed Patterns from Dense Data Sets
0 signed · 30 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/978-3-540-24581-0_20openalex-snapshot
Efficiently Mining Frequent Patterns from Dense Datasets Using a Cluster of Computers
inferredcites →https://doi.org/10.1007/978-3-540-24775-3_73openalex-snapshot
Constraint-Based Mining of Formal Concepts in Transactional Data
inferredcites →https://doi.org/10.1093/bioinformatics/19.1.79openalex-snapshot
Mining gene expression databases for association rules
inferredcites →https://doi.org/10.1109/4434.806975openalex-snapshot
Parallel and distributed association mining: a survey
inferredcites →https://doi.org/10.1109/dexa.2003.1232075openalex-snapshot
Parallel association rule mining with minimum inter-processor communication
inferredcites →https://doi.org/10.1109/icdm.2004.10070openalex-snapshot
Mining Frequent Closed Patterns in Microarray Data
inferredcites →https://doi.org/10.1109/ssdbm.2004.21openalex-snapshot
COBBLER: combining column and row enumeration for closed pattern discovery
inferredcites →https://doi.org/10.1109/ssdm.2004.1311190openalex-snapshot
COBBLER: combining column and row enumeration for closed pattern discovery
inferredcites →https://doi.org/10.1109/tkde.2005.60openalex-snapshot
Efficient algorithms for mining closed itemsets and their lattice structure
inferredcites →https://doi.org/10.1137/1.9781611972726.27openalex-snapshot
CHARM: An Efficient Algorithm for Closed Itemset Mining
inferredcites →https://doi.org/10.1145/335191.335376openalex-snapshot
Turbo-charging vertical mining of large databases
inferredcites →https://doi.org/10.1145/342009.335376openalex-snapshot
Turbo-charging vertical mining of large databases
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-642-02568-6_78openalex-snapshot
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
inferred← citeshttps://doi.org/10.1007/978-3-642-03547-0_12openalex-snapshot
An Integrated Framework for Relational and Hierarchical Mining of Frequent Closed Patterns
inferred← citeshttps://doi.org/10.1007/978-981-10-0135-2_45openalex-snapshot
Partition-Based Frequent Closed Pattern Miner
inferred← citeshttps://doi.org/10.1007/s11704-014-3173-zopenalex-snapshot
Associative categorization of frequent patterns based on the probabilistic graphical model
inferred← citeshttps://doi.org/10.1109/adcom.2008.4760481openalex-snapshot
Efficient Mining of Maximal Patterns using Order Preserving Generators
inferred← citeshttps://doi.org/10.1109/iccsn.2011.6013538openalex-snapshot
Efficient algorithm for extreme maximal biclique mining in cognitive frequency decision making
inferred← citeshttps://doi.org/10.1109/icdmw.2014.59openalex-snapshot
HDminer: Efficient Mining of High Dimensional Frequent Closed Patterns from Dense Data
inferred← citeshttps://doi.org/10.1109/icdmw.2014.61openalex-snapshot
Mining Top-K Frequent Closed Patterns from Gene Expression Data
inferred← citeshttps://doi.org/10.1109/isacc.2015.7377320openalex-snapshot
3 dimensional Frequent Closed Pattern miner
inferred← citeshttps://doi.org/10.1109/tkde.2010.97openalex-snapshot
Efficient Mining of Large Maximal Bicliques from 3D Symmetric Adjacency Matrix
inferred← citeshttps://doi.org/10.1145/1517303.1517307openalex-snapshot
A framework for mining top-k frequent closed itemsets using order preserving generators
inferred← citeshttps://doi.org/10.21917/ijsc.2010.0010openalex-snapshot
PARALLEL MINING OF FREQUENT MAXIMAL ITEMSETS USING ORDER PRESERVING GENERATORS
inferred← citeshttps://doi.org/10.47839/ijc.8.3.691openalex-snapshot
PARALLEL MINING OF LARGE MAXIMAL BICLIQUES USING ORDER PRESERVING GENERATORS
inferred← citeshttps://doi.org/10.5120/210-353openalex-snapshot
Closed Pattern Mining from n-ary Relations
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.