On the public citation graph

A transaction mapping algorithm for frequent itemsets mining

0 signed · 89 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.1006/jpdc.2000.1693openalex-snapshot
A Tree Projection Algorithm for Generation of Frequent Item Sets
inferredcites →https://doi.org/10.1109/icde.2001.914857openalex-snapshot
MAFIA: a maximal frequent itemset algorithm for transactional databases
inferredcites →https://doi.org/10.1109/icdm.2001.989550openalex-snapshot
H-mine: hyper-structure mining of frequent patterns in large databases
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/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/335191.335376openalex-snapshot
Turbo-charging vertical mining of large databases
inferredcites →https://doi.org/10.1145/956750.956788openalex-snapshot
Fast vertical mining using diffsets

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-1-4614-4981-2_219openalex-snapshot
Alarm Association Rules Mining in Distributed Database
inferred← citeshttps://doi.org/10.1007/978-3-030-39033-4_23openalex-snapshot
A Survey of the Different Itemset Representation for Candidate Generation
inferred← citeshttps://doi.org/10.1007/978-3-319-09339-0_59openalex-snapshot
A Hybrid Solution of Mining Frequent Itemsets from Uncertain Database
inferred← citeshttps://doi.org/10.1007/978-3-540-69209-6_16openalex-snapshot
Suspect Vehicle Identification for Border Safety
inferred← citeshttps://doi.org/10.1007/978-3-642-02568-6_77openalex-snapshot
iTM: An Efficient Algorithm for Frequent Pattern Mining in the Incremental Database without Rescanning
inferred← citeshttps://doi.org/10.1007/978-3-642-04985-9_18openalex-snapshot
An Empirical Study of Unsupervised Rule Set Extraction of Clustered Categorical Data Using a Simulated Bee Colony Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-31488-9_18openalex-snapshot
ML-DS: A Novel Deterministic Sampling Algorithm for Association Rules Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-32281-5_8openalex-snapshot
A High-Performance Algorithm for Frequent Itemset Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-38333-5_26openalex-snapshot
Searching Frequent Itemsets by Clustering Data: Towards a Parallel Approach Using Mapreduce
inferred← citeshttps://doi.org/10.1007/978-94-007-6996-0_76openalex-snapshot
Using MapReduce Framework for Mining Association Rules
inferred← citeshttps://doi.org/10.1007/978-981-13-0514-6_76openalex-snapshot
Efficient High-Utility Itemset Mining Over Variety of Databases: A Survey
inferred← citeshttps://doi.org/10.1007/978-981-15-0633-8_123openalex-snapshot
Bit Representation for Candidate Itemset Generation
inferred← citeshttps://doi.org/10.1007/978-981-15-1081-6_14openalex-snapshot
A Survey on Representation for Itemsets in Association Rule Mining
inferred← citeshttps://doi.org/10.1007/978-981-15-4409-5_46openalex-snapshot
Set Representation of Itemset for Candidate Generation with Binary Search Technique
inferred← citeshttps://doi.org/10.1007/978-981-15-6695-0_4openalex-snapshot
Pattern Mining Algorithms
inferred← citeshttps://doi.org/10.1007/978-981-15-6695-0_5openalex-snapshot
Extracting Association Rules: Meta-Heuristic and Closeness Preference Approach
inferred← citeshttps://doi.org/10.1007/978-981-287-585-3_4openalex-snapshot
Indonesian Retail Market Analysis Using Frequent Pattern Data Mining
inferred← citeshttps://doi.org/10.1007/s10462-018-9629-zopenalex-snapshot
Algorithms for frequent itemset mining: a literature review
inferred← citeshttps://doi.org/10.1007/s10489-009-0188-5openalex-snapshot
HUC-Prune: an efficient candidate pruning technique to mine high utility patterns
inferred← citeshttps://doi.org/10.1007/s10618-013-0304-3openalex-snapshot
A time-efficient breadth-first level-wise lattice-traversal algorithm to discover rare itemsets
inferred← citeshttps://doi.org/10.1007/s13042-013-0172-6openalex-snapshot
Efficient mining frequent itemsets algorithms
inferred← citeshttps://doi.org/10.1016/j.datak.2013.10.002openalex-snapshot
Mining frequent itemsets in data streams within a time horizon
inferred← citeshttps://doi.org/10.1016/j.ins.2010.04.013openalex-snapshot
Novel alarm correlation analysis system based on association rules mining in telecommunication networks
inferred← citeshttps://doi.org/10.1016/j.ins.2014.02.060openalex-snapshot
A frequent itemset mining algorithm based on the Principle of Inclusion–Exclusion and transaction mapping
inferred← citeshttps://doi.org/10.1016/j.jlp.2016.03.022openalex-snapshot
Association rules mining based analysis of consequential alarm sequences in chemical processes
inferred← citeshttps://doi.org/10.1016/j.knosys.2012.12.013openalex-snapshot
Interrelation analysis of celestial spectra data using constrained frequent pattern trees
inferred← citeshttps://doi.org/10.1016/j.techfore.2020.120375openalex-snapshot
Uncovering insights from healthcare archives to improve operations: An association analysis for cervical cancer screening
inferred← citeshttps://doi.org/10.1080/18756891.2013.859860openalex-snapshot
Sliding Window-based Frequent Itemsets Mining over Data Streams using Tail Pointer Table
inferred← citeshttps://doi.org/10.1109/access.2021.3065393openalex-snapshot
A Survey of Correlated High Utility Pattern Mining
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/dexa.2007.5openalex-snapshot
Author Identification Using Imbalanced and Limited Training Texts
inferred← citeshttps://doi.org/10.1109/fskd.2007.268openalex-snapshot
Efficiently Mining Maximal Frequent Itemsets Based on Digraph
inferred← citeshttps://doi.org/10.1109/iadcc.2015.7154874openalex-snapshot
Frequent itemset mining algorithms: A literature survey
inferred← citeshttps://doi.org/10.1109/icccnet.2008.4787769openalex-snapshot
Comparing and identifying common factors in frequent item set algorithms in association rule
inferred← citeshttps://doi.org/10.1109/icccnt.2012.6396074openalex-snapshot
An implementation for dynamic combination of frequent items in HCFPMINETREE
inferred← citeshttps://doi.org/10.1109/iccons.2018.8662898openalex-snapshot
Set Representation for Itemsets in Association Rule Mining
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/icetech.2016.7569337openalex-snapshot
A novelty approach to compression of frequent transaction items by using statistical methods in vertical data layout
inferred← citeshttps://doi.org/10.1109/icicic.2008.36openalex-snapshot
A High Performance Frequent Itemset Mining Algorithm Using Confidence Frequent Pattern Tree
inferred← citeshttps://doi.org/10.1109/icicisys.2009.5357805openalex-snapshot
A tree structure frequent pattern mining algorithm based on hybrid search strategy and bitmap
inferred← citeshttps://doi.org/10.1109/iciea.2010.5515373openalex-snapshot
GLFMiner: Global and local frequent pattern mining with temporal intervals
inferred← citeshttps://doi.org/10.1109/icmla.2007.87openalex-snapshot
Discover the power of social and hidden curriculum to decision making: experiments with enron email and movie newsgroups
inferred← citeshttps://doi.org/10.1109/ictai.2016.0031openalex-snapshot
Representative Itemset Mining
inferred← citeshttps://doi.org/10.1109/isda.2008.46openalex-snapshot
Efficient Mining of Frequent Closed Itemsets without Closure Checking
inferred← citeshttps://doi.org/10.1109/isda.2009.167openalex-snapshot
Vertical Mining of Frequent Patterns Using Diffset Groups
inferred← citeshttps://doi.org/10.1109/isda.2013.6920703openalex-snapshot
On the efficient traversal of the itemset lattice: A literature review
inferred← citeshttps://doi.org/10.1109/nabic.2009.5393655openalex-snapshot
Transaction mapping based approach for mining software specifications
inferred← citeshttps://doi.org/10.1109/pervasive.2015.7087122openalex-snapshot
Frequent itemset mining for Big Data in social media using ClustBigFIM algorithm
inferred← citeshttps://doi.org/10.1109/sceecs.2012.6184770openalex-snapshot
Voice of customer analysis using parallel association rule mining
inferred← citeshttps://doi.org/10.1109/tkde.2009.46openalex-snapshot
Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases
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.1109/tnano.2010.2089531openalex-snapshot
Efficient Algorithms for Computing With Protein-Based Volumetric Memory Processors
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.1145/1839490.1839493openalex-snapshot
BISC
inferred← citeshttps://doi.org/10.1145/1858378.1858397openalex-snapshot
Efficient temporal pattern mining for humanoid robot
inferred← citeshttps://doi.org/10.11591/ijeecs.v13.i1.pp41-47openalex-snapshot
Design and development of an algorithm for mining rare item sets
inferred← citeshttps://doi.org/10.1186/s40537-021-00473-3openalex-snapshot
A scalable association rule learning heuristic for large datasets
inferred← citeshttps://doi.org/10.12785/amis/080446openalex-snapshot
Association Rule Mining Considering Local Frequent Patterns with Temporal Intervals
inferred← citeshttps://doi.org/10.1504/ijahuc.2016.079263openalex-snapshot
Effective algorithms for vertical mining probabilistic frequent patterns in uncertain mobile environments
inferred← citeshttps://doi.org/10.15680/ijircce.2015.0308008openalex-snapshot
An Efficient Algorithm for Finding the Support Count of Frequent 1-Itemset in Frequent Pattern Mining
inferred← citeshttps://doi.org/10.17485/ijst/2017/v10i17/114477openalex-snapshot
Big Data in Health Care using Frequent Set Extraction
inferred← citeshttps://doi.org/10.19026/rjaset.7.865openalex-snapshot
An Extensive Review of Significant Researches in Data Mining
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.2478/s13537-011-0016-yopenalex-snapshot
Analysis of the progressive sampling-based approach using real life datasets
inferred← citeshttps://doi.org/10.32628/cseit1833244openalex-snapshot
Analytical Study of Association Rule Mining Methods in Data Mining
inferred← citeshttps://doi.org/10.32657/10356/20922openalex-snapshot
Frequent pattern space maintenance : theories and algorithms
inferred← citeshttps://doi.org/10.3390/math9010035openalex-snapshot
Mining High Utility Itemsets Based on Pattern Growth without Candidate Generation
inferred← citeshttps://doi.org/10.4018/jgim.20210701.oa1openalex-snapshot
A Rule-Based Quality Analytics System for the Global Wine Industry
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.610.291openalex-snapshot
Efficiently Mining Maximal Frequent Itemsets Based on Digraph
inferred← citeshttps://doi.org/10.4304/jcp.8.6.1417-1426openalex-snapshot
AT-Mine: An Efficient Algorithm of Frequent Itemset Mining on Uncertain Dataset
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.48550/arxiv.1209.3089openalex-snapshot
Pattern Detection with Rare Item-set Mining
inferred← citeshttps://doi.org/10.48550/arxiv.1211.4658openalex-snapshot
An Effective Method for Fingerprint Classification
inferred← citeshttps://doi.org/10.5120/13967-1698openalex-snapshot
Association Rule Mining and Medical Application: A Detailed Survey
inferred← citeshttps://doi.org/10.5120/1478-1995openalex-snapshot
A Novelty Approach for Finding Frequent Itemsets in Horizontal and Vertical Layout- HVCFPMINETREE
inferred← citeshttps://doi.org/10.5120/1674-2258openalex-snapshot
Software Specifications Mining using Transaction Mapping Algorithm
inferred← citeshttps://doi.org/10.5120/3296-4502openalex-snapshot
Mining Frequent Itemsets by using Binary Search Tree Approach
inferred← citeshttps://doi.org/10.5120/ijca2016909219openalex-snapshot
Frequent Itemset Mining in Data Mining: A Survey
inferred← citeshttps://doi.org/10.5120/ijca2016910462openalex-snapshot
Eclat with Large Data base Parallel Algorithm and Improve its Efficiency
inferred← citeshttps://doi.org/10.5539/cis.v3n2p171openalex-snapshot
Vertical Mining of Frequent Patterns from Uncertain Data
inferred← citeshttps://doi.org/10.59628/jast.v1i4.663openalex-snapshot
Analysis Of Mining Algorithms for Patterns of Frequent Item sets and Hidden
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.