On the public citation graph
MAFIA: a maximal frequent itemset algorithm
0 signed · 279 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.1006/jpdc.2000.1693openalex-snapshot
A Tree Projection Algorithm for Generation of Frequent Item Sets
inferredcites →https://doi.org/10.1007/3-540-48912-6_8openalex-snapshot
LGen — A Lattice-Based Candidate Set Generation Algorithm for I/O Efficient Association Rule Mining
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/3-540-62222-5_47openalex-snapshot
Discovering all most specific sentences by randomized algorithms extended abstract
inferredcites →https://doi.org/10.1007/bfb0100980openalex-snapshot
Pincer-search: A new algorithm for discovering the maximum frequent set
inferredcites →https://doi.org/10.1016/s0167-739x(97)00019-8openalex-snapshot
Mining generalized association rules
inferredcites →https://doi.org/10.1093/bioinformatics/14.1.55openalex-snapshot
Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm.
inferredcites →https://doi.org/10.1109/69.846291openalex-snapshot
Scalable algorithms for association mining
inferredcites →https://doi.org/10.1109/69.908980openalex-snapshot
DEMON: mining and monitoring evolving data
inferredcites →https://doi.org/10.1109/icde.1998.655803openalex-snapshot
Online generation of association rules
inferredcites →https://doi.org/10.1109/icde.1998.655811openalex-snapshot
Mining association rules: anti-skew algorithms
inferredcites →https://doi.org/10.1109/icde.1998.655813openalex-snapshot
Mining optimized association rules with categorical and numeric attributes
inferredcites →https://doi.org/10.1109/icde.1999.754968openalex-snapshot
Data organization and access for efficient data mining
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.989514openalex-snapshot
Efficiently mining maximal frequent itemsets
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/223784.223813openalex-snapshot
An effective hash-based algorithm for mining association rules
inferredcites →https://doi.org/10.1145/253260.253325openalex-snapshot
Dynamic itemset counting and implication rules for market basket data
inferredcites →https://doi.org/10.1145/276304.276313openalex-snapshot
Efficiently mining long patterns from databases
inferredcites →https://doi.org/10.1145/276305.276313openalex-snapshot
Efficiently mining long patterns from databases
inferredcites →https://doi.org/10.1145/312129.312219openalex-snapshot
Mining the most interesting rules
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/342009.335372openalex-snapshot
Mining frequent patterns without candidate generation
inferredcites →https://doi.org/10.1145/342009.335376openalex-snapshot
Turbo-charging vertical mining of large databases
inferredcites →https://doi.org/10.1145/347090.347114openalex-snapshot
Depth first generation of long patterns
inferredcites →https://doi.org/10.1145/380995.381033openalex-snapshot
KDD-Cup 2000 organizers' report
inferredcites →https://doi.org/10.1145/568271.223813openalex-snapshot
An effective hash-based algorithm for mining association rules
inferredcites →https://doi.org/10.1613/jair.227openalex-snapshot
OPUS: An Efficient Admissible Algorithm for Unordered Search
inferredcites →https://doi.org/10.21236/ada401496openalex-snapshot
Data Mining Approaches for Intrusion Detection
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118617151.ch29openalex-snapshot
Microarray Data Analysis: From Preparation To Classification
inferred← citeshttps://doi.org/10.1002/int.21580openalex-snapshot
Mining Top-Rank-kErasable Itemsets by PID_lists
inferred← citeshttps://doi.org/10.1002/widm.1181openalex-snapshot
The lattice‐based approaches for mining association rules: a review
inferred← citeshttps://doi.org/10.1002/widm.1401openalex-snapshot
A comprehensive review on updating concept lattices and its application in updating association rules
inferred← citeshttps://doi.org/10.1007/978-0-387-09690-2_15openalex-snapshot
Frequent Pattern Mining Algorithms with Uncertain Data
inferred← citeshttps://doi.org/10.1007/978-1-4939-8561-6_8openalex-snapshot
SiBIC: A Tool for Generating a Network of Biclusters Captured by Maximal Frequent Itemset Mining
inferred← citeshttps://doi.org/10.1007/978-3-030-18579-4_12openalex-snapshot
Efficiently Mining Maximal Diverse Frequent Itemsets
inferred← citeshttps://doi.org/10.1007/978-3-030-63007-2_25openalex-snapshot
Efficient Method for Mining Maximal Inter-transaction Patterns
inferred← citeshttps://doi.org/10.1007/978-3-031-70816-9_27openalex-snapshot
nMITP-Miner: An Efficient Method for Mining Frequent Maximal Inter-transaction Patterns
inferred← citeshttps://doi.org/10.1007/978-3-319-02738-8_3openalex-snapshot
How Educational Data Mining Empowers State Policies to Reform Education: The Mexican Case Study
inferred← citeshttps://doi.org/10.1007/978-3-319-23826-5_5openalex-snapshot
Efficient Term Set Prediction Using the Bell-Wigner Inequality
inferred← citeshttps://doi.org/10.1007/978-3-319-46257-8_64openalex-snapshot
An Efficient Mining Algorithm for Maximal Weighted Frequent Patterns Based on WIdT-Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-95930-6_39openalex-snapshot
GridWall: A Novel Condensed Representation of Frequent Itemsets
inferred← citeshttps://doi.org/10.1007/978-3-540-73325-6_68openalex-snapshot
Solving a Committee Formation and Scheduling Problem by Frequent Itemset Mining
inferred← citeshttps://doi.org/10.1007/978-3-540-88192-6_14openalex-snapshot
Analysis of Alarm Sequences in a Chemical Plant
inferred← citeshttps://doi.org/10.1007/978-3-642-04091-7_3openalex-snapshot
Clustering of Windows Security Events by Means of Frequent Pattern Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-04180-8_11openalex-snapshot
Learning Multi-linear Representations of Distributions for Efficient Inference
inferred← citeshttps://doi.org/10.1007/978-3-642-11928-6_13openalex-snapshot
Constrained Closed Datacubes
inferred← citeshttps://doi.org/10.1007/978-3-642-15220-7_14openalex-snapshot
A Novel Bitmap-Based Algorithm for Frequent Itemsets Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-15883-4_30openalex-snapshot
Integrating Constraint Programming and Itemset Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-17316-5_20openalex-snapshot
An Efficient Algorithm for Mining Erasable Itemsets
inferred← citeshttps://doi.org/10.1007/978-3-642-19460-3_2openalex-snapshot
Association Rules and Sequential Patterns
inferred← citeshttps://doi.org/10.1007/978-3-642-20841-6_29openalex-snapshot
Mining Maximal Co-located Event Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_35openalex-snapshot
Itemset Mining as a Challenge Application for Answer Set Enumeration
inferred← citeshttps://doi.org/10.1007/978-3-642-29038-1_23openalex-snapshot
Privacy Preserving Mining Maximal Frequent Patterns in Transactional Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-29892-9_23openalex-snapshot
Finding Top-N Colossal Patterns Based on Clique Search with Dynamic Update of Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-37450-0_22openalex-snapshot
On Efficient Graph Substructure Selection
inferred← citeshttps://doi.org/10.1007/978-3-642-40235-7_25openalex-snapshot
Mining Co-locations under Uncertainty
inferred← citeshttps://doi.org/10.1007/978-81-8489-203-1_35openalex-snapshot
Minimizing Space Time Complexity by RSTDB a New Method for Frequent Pattern Mining
inferred← citeshttps://doi.org/10.1007/978-94-007-5860-5_113openalex-snapshot
Analyzing Efficient Algorithms of Frequent Pattern Mining
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-1081-6_8openalex-snapshot
Clustering of Association Rules on Microarray Gene Expression Data
inferred← citeshttps://doi.org/10.1007/978-981-16-6636-0_7openalex-snapshot
Early Stage Detection of Heart Failure Using Machine Learning Techniques
inferred← citeshttps://doi.org/10.1007/978-981-19-8234-7_32openalex-snapshot
dMITP-Miner: An Efficient Method for Mining Maximal Inter-transaction Patterns
inferred← citeshttps://doi.org/10.1007/s00500-021-06613-4openalex-snapshot
A survey on soft computing-based high-utility itemsets mining
inferred← citeshttps://doi.org/10.1007/s10115-010-0361-5openalex-snapshot
Discovering frequent behaviors: time is an essential element of the context
inferred← citeshttps://doi.org/10.1007/s10115-010-0363-3openalex-snapshot
Mining top−k frequent patterns without minimum support threshold
inferred← citeshttps://doi.org/10.1007/s10115-015-0854-3openalex-snapshot
Discovering compressing serial episodes from event sequences
inferred← citeshttps://doi.org/10.1007/s10115-015-0884-xopenalex-snapshot
CloFAST: closed sequential pattern mining using sparse and vertical id-lists
inferred← citeshttps://doi.org/10.1007/s10115-015-0907-7openalex-snapshot
Top-K Miner: top-K identical frequent itemsets discovery without user support threshold
inferred← citeshttps://doi.org/10.1007/s10115-021-01575-3openalex-snapshot
GrAFCI+ A fast generator-based algorithm for mining frequent closed itemsets
inferred← citeshttps://doi.org/10.1007/s10207-012-0163-8openalex-snapshot
A log mining approach for process monitoring in SCADA
inferred← citeshttps://doi.org/10.1007/s10489-014-0622-1openalex-snapshot
Associating absent frequent itemsets with infrequent items to identify abnormal transactions
inferred← citeshttps://doi.org/10.1007/s10489-015-0748-9openalex-snapshot
An efficient algorithm for mining top-rank-k frequent patterns
inferred← citeshttps://doi.org/10.1007/s10489-023-04811-1openalex-snapshot
A fundamental approach to discover closed periodic-frequent patterns in very large temporal databases
inferred← citeshttps://doi.org/10.1007/s10618-010-0203-9openalex-snapshot
Summarizing transactional databases with overlapped hyperrectangles
inferred← citeshttps://doi.org/10.1007/s10618-013-0319-9openalex-snapshot
Interesting pattern mining in multi-relational data
inferred← citeshttps://doi.org/10.1007/s10618-018-0591-9openalex-snapshot
Ranking evolution maps for Satellite Image Time Series exploration: application to crustal deformation and environmental monitoring
inferred← citeshttps://doi.org/10.1007/s10618-026-01270-3openalex-snapshot
Minimum length estimation in longest frequent itemsets mining
inferred← citeshttps://doi.org/10.1007/s10707-010-0107-2openalex-snapshot
Controlling patterns of geospatial phenomena
inferred← citeshttps://doi.org/10.1007/s10916-012-9896-1openalex-snapshot
Discovering Medical Knowledge using Association Rule Mining in Young Adults with Acute Myocardial Infarction
inferred← citeshttps://doi.org/10.1007/s10994-009-5130-xopenalex-snapshot
Learning multi-linear representations of distributions for efficient inference
inferred← citeshttps://doi.org/10.1007/s11042-012-1057-5openalex-snapshot
Computation time efficient approach for licenses validation in DRM systems
inferred← citeshttps://doi.org/10.1007/s11432-012-4638-zopenalex-snapshot
A new algorithm for fast mining frequent itemsets using N-lists
inferred← citeshttps://doi.org/10.1007/s12046-019-1158-1openalex-snapshot
An efficient approach based on selective partitioning for maximal frequent itemsets mining
inferred← citeshttps://doi.org/10.1007/s13042-020-01177-5openalex-snapshot
CL-MAX: a clustering-based approximation algorithm for mining maximal frequent itemsets
inferred← citeshttps://doi.org/10.1007/s13258-019-00789-8openalex-snapshot
Markov chain Monte Carlo simulation of a Bayesian mixture model for gene network inference
inferred← citeshttps://doi.org/10.1007/s13721-012-0009-3openalex-snapshot
Merging network patterns: a general framework to summarize biomedical network data
inferred← citeshttps://doi.org/10.1007/s13755-017-0024-yopenalex-snapshot
Mining comorbidity patterns using retrospective analysis of big collection of outpatient records
inferred← citeshttps://doi.org/10.1007/s41019-024-00241-2openalex-snapshot
Efficient Top-k Frequent Itemset Mining on Massive Data
inferred← citeshttps://doi.org/10.1016/j.asoc.2016.01.010openalex-snapshot
DiffNodesets: An efficient structure for fast mining frequent itemsets
inferred← citeshttps://doi.org/10.1016/j.datak.2005.10.004openalex-snapshot
Mining itemset utilities from transaction databases
inferred← citeshttps://doi.org/10.1016/j.engappai.2021.104477openalex-snapshot
UP-tree & UP-Mine: A fast method based on upper bound for frequent pattern mining from uncertain data
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.09.143openalex-snapshot
Fast mining erasable itemsets using NC_sets
inferred← citeshttps://doi.org/10.1016/j.eswa.2013.07.094openalex-snapshot
Sliding window based weighted maximal frequent pattern mining over data streams
inferred← citeshttps://doi.org/10.1016/j.eswa.2014.01.025openalex-snapshot
Fast mining frequent itemsets using Nodesets
inferred← citeshttps://doi.org/10.1016/j.eswa.2014.07.045openalex-snapshot
An efficient and effective algorithm for mining top-rank-k frequent patterns
inferred← citeshttps://doi.org/10.1016/j.eswa.2014.09.040openalex-snapshot
Towards better understanding of frequent itemset relationships through tree-like data structures
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.03.004openalex-snapshot
PrePost+: An efficient N-lists-based algorithm for mining frequent itemsets via Children–Parent Equivalence pruning
inferred← citeshttps://doi.org/10.1016/j.eswa.2016.01.049openalex-snapshot
Incremental mining of weighted maximal frequent itemsets from dynamic databases
inferred← citeshttps://doi.org/10.1016/j.eswa.2016.12.023openalex-snapshot
A novel approach for mining maximal frequent patterns
inferred← citeshttps://doi.org/10.1016/j.eswa.2017.01.001openalex-snapshot
A new multiple seeds based genetic algorithm for discovering a set of interesting Boolean association rules
inferred← citeshttps://doi.org/10.1016/j.eswa.2018.03.041openalex-snapshot
negFIN: An efficient algorithm for fast mining frequent itemsets
inferred← citeshttps://doi.org/10.1016/j.eswa.2019.01.034openalex-snapshot
Fast algorithms for mining maximal erasable patterns
inferred← citeshttps://doi.org/10.1016/j.eswa.2019.113046openalex-snapshot
An efficient pattern growth approach for mining fault tolerant frequent itemsets
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.114738openalex-snapshot
NEclatClosed: A vertical algorithm for mining frequent closed itemsets
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.ins.2014.03.023openalex-snapshot
Maintenance of prelarge trees for data mining with modified records
inferred← citeshttps://doi.org/10.1016/j.ins.2014.08.073openalex-snapshot
Scalable out-of-core itemset mining
inferred← citeshttps://doi.org/10.1016/j.ins.2017.11.064openalex-snapshot
Mining maximal frequent patterns in transactional databases and dynamic data streams: A spark-based approach
inferred← citeshttps://doi.org/10.1016/j.ipm.2016.04.011openalex-snapshot
Utilising a statistical inequality for efficiently finding term sets
inferred← citeshttps://doi.org/10.1016/j.jbi.2014.09.006openalex-snapshot
Integrating monitor alarms with laboratory test results to enhance patient deterioration prediction
inferred← citeshttps://doi.org/10.1016/j.knosys.2006.08.005openalex-snapshot
BitTableFI: An efficient mining frequent itemsets algorithm
inferred← citeshttps://doi.org/10.1016/j.knosys.2012.02.002openalex-snapshot
An efficient mining algorithm for maximal weighted frequent patterns in transactional databases
inferred← citeshttps://doi.org/10.1016/j.knosys.2013.10.011openalex-snapshot
Mining maximal frequent patterns by considering weight conditions over data streams
inferred← citeshttps://doi.org/10.1016/j.knosys.2013.10.013openalex-snapshot
Efficient frequent pattern mining based on Linear Prefix tree
inferred← citeshttps://doi.org/10.1016/j.knosys.2014.02.009openalex-snapshot
Discovering valuable frequent patterns based on RFM analysis without customer identification information
inferred← citeshttps://doi.org/10.1016/j.parco.2014.08.003openalex-snapshot
Novel parallel method for association rule mining on multi-core shared memory systems
inferred← citeshttps://doi.org/10.1016/j.patcog.2013.09.008openalex-snapshot
An efficient construction and application usefulness of rectangle greedy covers
inferred← citeshttps://doi.org/10.1016/j.procs.2018.05.105openalex-snapshot
Geo Map Visualization for Frequent Purchaser in Online Shopping Database Using an Algorithm LP-Growth for Mining Closed Frequent Itemsets
inferred← citeshttps://doi.org/10.1038/s41598-026-44941-3openalex-snapshot
A pattern-growth approach for mining maximal fault-tolerant frequent itemsets
inferred← citeshttps://doi.org/10.1038/s41746-019-0107-zopenalex-snapshot
An algorithm strategy for precise patient monitoring in a connected healthcare enterprise
inferred← citeshttps://doi.org/10.1063/1.5055469openalex-snapshot
MapDiff-FI : Map different sets for frequent itemsets mining
inferred← citeshttps://doi.org/10.1088/1742-6596/1773/1/012012openalex-snapshot
A New Algorithm for Extracting Textual Maximal Frequent Itemsets from Arabic Documents
inferred← citeshttps://doi.org/10.1088/1757-899x/434/1/012043openalex-snapshot
The concept of frequent itemset mining for text
inferred← citeshttps://doi.org/10.1109/access.2017.2788083openalex-snapshot
Selective Database Projections Based Approach for Mining High-Utility Itemsets
inferred← citeshttps://doi.org/10.1109/access.2018.2888627openalex-snapshot
TT-Miner: Topology-Transaction Miner for Mining Closed Itemset
inferred← citeshttps://doi.org/10.1109/access.2019.2957762openalex-snapshot
Differentially Private Top-$k$ Frequent Columns Publication for High-Dimensional Data
inferred← citeshttps://doi.org/10.1109/access.2019.2959878openalex-snapshot
TRICE: Mining Frequent Itemsets by Iterative TRimmed Transaction LattICE in Sparse Big Data
inferred← citeshttps://doi.org/10.1109/access.2020.2971834openalex-snapshot
D-GENE: Deferring the GENEration of Power Sets for Discovering Frequent Itemsets in Sparse Big Data
inferred← citeshttps://doi.org/10.1109/access.2020.2995719openalex-snapshot
A Fast Approach for Up-Scaling Frequent Itemsets
inferred← citeshttps://doi.org/10.1109/access.2020.3009667openalex-snapshot
Generalizability of SuperAlarm via Cross-Institutional Performance Evaluation
inferred← citeshttps://doi.org/10.1109/access.2024.3376477openalex-snapshot
Probabilistic Support Prediction: Fast Frequent Itemset Mining in Dense Data
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/bigdata50022.2020.9378215openalex-snapshot
Discovering Closed Periodic-Frequent Patterns in Very Large Temporal Databases
inferred← citeshttps://doi.org/10.1109/ccgrid.2013.104openalex-snapshot
An Adaptive Implementation Case Study of Apriori Algorithm for a Retail Scenario in a Cloud Environment
inferred← citeshttps://doi.org/10.1109/ccoms.2019.8821745openalex-snapshot
Transaction Item Embedding by Maximizing A Joint Probability
inferred← citeshttps://doi.org/10.1109/cicn.2012.123openalex-snapshot
High-Efficiency Algorithm for Mining Maximal Frequent Item Sets Based on Matrix
inferred← citeshttps://doi.org/10.1109/cits.2016.7546423openalex-snapshot
Spatial co-location pattern ordering
inferred← citeshttps://doi.org/10.1109/cts.2012.6261005openalex-snapshot
High performance frequent pattern mining on multi-core cluster
inferred← citeshttps://doi.org/10.1109/grc.2011.6122653openalex-snapshot
Efficient construction and usefulness of hyper-rectangle greedy covers
inferred← citeshttps://doi.org/10.1109/hase.2019.00016openalex-snapshot
Mining Accompanying Passing-Vehicles to Discover Suspected Gangs
inferred← citeshttps://doi.org/10.1109/iadcc.2015.7154874openalex-snapshot
Frequent itemset mining algorithms: A literature survey
inferred← citeshttps://doi.org/10.1109/ic-etite47903.2020.124openalex-snapshot
Association Rule Modeling using UML and Apriori Algorithm
inferred← citeshttps://doi.org/10.1109/icaiet.2014.19openalex-snapshot
Review of Frequent Itemsets Mining in High Dimensional Dataset
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/iccse.2009.5228155openalex-snapshot
Clustering algorithm based on optimal intervals division for high-dimension data streams
inferred← citeshttps://doi.org/10.1109/icdm.2007.32openalex-snapshot
Cross-Mining Binary and Numerical Attributes
inferred← citeshttps://doi.org/10.1109/icdm.2008.131openalex-snapshot
What Sperner Family Concept Class is Easy to Be Enumerated?
inferred← citeshttps://doi.org/10.1109/icdm.2017.128openalex-snapshot
Reductions for Frequency-Based Data Mining Problems
inferred← citeshttps://doi.org/10.1109/icdmw.2012.138openalex-snapshot
Constructing and Exploring Composite Items Using Max-valid Bundles
inferred← citeshttps://doi.org/10.1109/icectech.2011.5941876openalex-snapshot
Mining and post-mining of time stamped association rules
inferred← citeshttps://doi.org/10.1109/icectech.2011.5942031openalex-snapshot
A novel approach to prune mined association rules in large databases
inferred← citeshttps://doi.org/10.1109/icetect.2011.5760255openalex-snapshot
ARIPSO: Association rule interactive postmining Using Schemas And Ontologies
inferred← citeshttps://doi.org/10.1109/icfcc.2009.54openalex-snapshot
FIAST: A Novel Algorithm for Mining Frequent Itemsets
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/icinfa.2010.5512358openalex-snapshot
A novel method of mining frequent item sets
inferred← citeshttps://doi.org/10.1109/icmla.2007.11openalex-snapshot
Clustering Categorical Data Based on Maximal Frequent Itemsets
inferred← citeshttps://doi.org/10.1109/icmla.2007.28openalex-snapshot
Predicting Binding Sites in the Mouse Genome
inferred← citeshttps://doi.org/10.1109/icsdm.2011.5969013openalex-snapshot
Mining top-k closed co-location patterns
inferred← citeshttps://doi.org/10.1109/ictai.2015.118openalex-snapshot
Reframing in Frequent Pattern Mining
inferred← citeshttps://doi.org/10.1109/iraniancee.2017.7985413openalex-snapshot
A new data structure to enhance the speed of frequent pattern 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/isip.2008.60openalex-snapshot
MMFI: An Effective Algorithm for Mining Maximal Frequent Itemsets
inferred← citeshttps://doi.org/10.1109/ntict.2017.7976130openalex-snapshot
Maximal itemsets mining algorithm based on Bees' Algorithm
inferred← citeshttps://doi.org/10.1109/pdp.2012.94openalex-snapshot
gpuDCI: Exploiting GPUs in Frequent Itemset Mining
inferred← citeshttps://doi.org/10.1109/smc.2015.278openalex-snapshot
Data Analytics for Protein-DNA Binding Interactions
inferred← citeshttps://doi.org/10.1109/taai.2015.7407069openalex-snapshot
Considering high utilities for time interval sequential pattern mining
inferred← citeshttps://doi.org/10.1109/taai54685.2021.00047openalex-snapshot
A Fast Algorithm for Deriving Frequent Itemsets
inferred← citeshttps://doi.org/10.1109/tbme.2016.2586443openalex-snapshot
Is the Sequence of SuperAlarm Triggers More Predictive Than Sequence of the Currently Utilized Patient Monitor Alarms?
inferred← citeshttps://doi.org/10.1109/tcbb.2011.58openalex-snapshot
Transactional Database Transformation and Its Application in Prioritizing Human Disease Genes
inferred← citeshttps://doi.org/10.1109/tcbb.2015.2510011openalex-snapshot
Expectation Maximization of Frequent Patterns, a Specific, Local, Pattern-Based Biclustering Algorithm for Biological Datasets
inferred← citeshttps://doi.org/10.1109/tii.2012.2188804openalex-snapshot
Business Intelligence for Enterprise Systems: A Survey
inferred← citeshttps://doi.org/10.1109/tkde.2009.59openalex-snapshot
Discovering Transitional Patterns and Their Significant Milestones in Transaction Databases
inferred← citeshttps://doi.org/10.1109/tkde.2010.29openalex-snapshot
Knowledge-Based Interactive Postmining of Association Rules Using Ontologies
inferred← citeshttps://doi.org/10.1109/tkde.2020.3033519openalex-snapshot
Mining High Quality Patterns Using Multi-Objective Evolutionary Algorithm
inferred← citeshttps://doi.org/10.1109/tnsm.2021.3079326openalex-snapshot
A Neighborhood Aware Caching and Interest Dissemination Scheme for Content Centric Networks
inferred← citeshttps://doi.org/10.1109/tsmcb.2008.927730openalex-snapshot
PARM—An Efficient Algorithm to Mine Association Rules From Spatial Data
inferred← citeshttps://doi.org/10.1109/uksim.2012.29openalex-snapshot
Partition-Based Approach for Fast Mining of Transitional Patterns
inferred← citeshttps://doi.org/10.1109/waim.2008.81openalex-snapshot
A New Approach for Detecting Anonymity of Patterns
inferred← citeshttps://doi.org/10.1109/wccais.2014.6916550openalex-snapshot
An efficient approach for mining association rules from sparse and dense databases
inferred← citeshttps://doi.org/10.1109/wict.2011.6141255openalex-snapshot
Analysis on probabilistic and binary datasets through frequent itemset mining
inferred← citeshttps://doi.org/10.1109/wisa.2012.45openalex-snapshot
A Variable Granularity User Classification Algorithm Based on Multi-dimensional Features of Users
inferred← citeshttps://doi.org/10.1111/exsy.12158openalex-snapshot
Efficient representative pattern mining based on weight and maximality conditions
inferred← citeshttps://doi.org/10.1142/s0218001416500129openalex-snapshot
Approximate Maximal Frequent Pattern Mining with Weight Conditions and Error Tolerance
inferred← citeshttps://doi.org/10.1142/s021821300800390xopenalex-snapshot
INDEX-MAXMINER: A NEW MAXIMAL FREQUENT ITEMSET MINING ALGORITHM
inferred← citeshttps://doi.org/10.1145/1244002.1244094openalex-snapshot
Maintenance of maximal frequent itemsets in large databases
inferred← citeshttps://doi.org/10.1145/1363686.1363890openalex-snapshot
Frequent pattern mining for kernel trace data
inferred← citeshttps://doi.org/10.1145/1401890.1401919openalex-snapshot
Constraint programming for itemset mining
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/1557019.1557030openalex-snapshot
Frequent pattern mining with uncertain data
inferred← citeshttps://doi.org/10.1145/1807167.1807258openalex-snapshot
Constructing and exploring composite items
inferred← citeshttps://doi.org/10.1145/1835804.1835841openalex-snapshot
Mining uncertain data with probabilistic guarantees
inferred← citeshttps://doi.org/10.1145/1862372.1862381openalex-snapshot
Identifying cross-cutting concerns using software repository mining
inferred← citeshttps://doi.org/10.1145/2020408.2020459openalex-snapshot
From market baskets to mole rats
inferred← citeshttps://doi.org/10.1145/2108616.2108659openalex-snapshot
Interactive stream mining of maximal frequent itemsets allowing flexible time intervals and support thresholds
inferred← citeshttps://doi.org/10.1145/2344436.2344443openalex-snapshot
Aggregate licenses validation for digital rights violation detection
inferred← citeshttps://doi.org/10.1145/2534645.2534653openalex-snapshot
Novel parallel method for mining frequent patterns on multi-core shared memory systems
inferred← citeshttps://doi.org/10.1145/2649387.2649395openalex-snapshot
Mining massive SNP data for identifying associated SNPs and uncovering gene relationships
inferred← citeshttps://doi.org/10.1145/2740908.2741692openalex-snapshot
Important Events in the Past, Present, and Future
inferred← citeshttps://doi.org/10.1145/3448016.3457323openalex-snapshot
SliceLine: Fast, Linear-Algebra-based Slice Finding for ML Model Debugging
inferred← citeshttps://doi.org/10.1155/2022/6562649openalex-snapshot
Crash/Near-Crash Analysis of Naturalistic Driving Data Using Association Rule Mining
inferred← citeshttps://doi.org/10.1186/1476-4598-7-52openalex-snapshot
Involvement of GTA protein NC2β in Neuroblastoma pathogenesis suggests that it physiologically participates in the regulation of cell proliferation
inferred← citeshttps://doi.org/10.1186/1755-8794-1-15openalex-snapshot
Classification of human cancers based on DNA copy number amplification modeling
inferred← citeshttps://doi.org/10.1186/s40537-019-0169-4openalex-snapshot
Large-scale e-learning recommender system based on Spark and Hadoop
inferred← citeshttps://doi.org/10.12733/jics20103619openalex-snapshot
An Efficient Algorithm of Frequent Itemsets Mining Based on MapReduce
inferred← citeshttps://doi.org/10.12794/metadc1062799openalex-snapshot
Location Estimation and Geo-Correlated Information Trends
inferred← citeshttps://doi.org/10.1371/journal.pone.0069873openalex-snapshot
MIDClass: Microarray Data Classification by Association Rules and Gene Expression Intervals
inferred← citeshttps://doi.org/10.1371/journal.pone.0082890openalex-snapshot
SiBIC: A Web Server for Generating Gene Set Networks Based on Biclusters Obtained by Maximal Frequent Itemset Mining
inferred← citeshttps://doi.org/10.14529/cmse190104openalex-snapshot
Parallel Frequent Itemset Mining on the Intel MIC Accelerators
inferred← citeshttps://doi.org/10.1504/ijcat.2015.071419openalex-snapshot
Towards test suite reduction using maximal frequent data mining concept
inferred← citeshttps://doi.org/10.1504/ijista.2014.065181openalex-snapshot
An efficient approach for significant time intervals of frequent itemsets
inferred← citeshttps://doi.org/10.1515/jisys-2014-0040openalex-snapshot
Efficient Algorithms for Mining Frequent Patterns from Sparse and Dense Databases
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.15680/ijirset.2015.0407020openalex-snapshot
Ontology Based Post Mining of Association Rules
inferred← citeshttps://doi.org/10.17485/ijst/v16i36.463openalex-snapshot
Modified Associative Classification Model for Microarray Gene Expression Data using Maximal Frequent Itemsets and Probability Distribution
inferred← citeshttps://doi.org/10.17762/itii.v9i2.426openalex-snapshot
A SURVEY ON FREQUENT ITEM SET MINING FOR LARGE TRANSACTIONAL DATA
inferred← citeshttps://doi.org/10.18280/ria.380307openalex-snapshot
A New Algorithm for Arabic Document Clustering Utilizing Maximal Wordsets
inferred← citeshttps://doi.org/10.20532/cit.2018.1004382openalex-snapshot
Parallel Algorithm for Frequent Itemset Mining on Intel Many-core Systems
inferred← citeshttps://doi.org/10.20965/jaciii.2016.p1018openalex-snapshot
Mining Time-Interval Sequential Patterns with High Utility from Transaction Databases
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.2197/ipsjjip.21.607openalex-snapshot
Mining Botnet Coordinated Attacks using Apriori-PrefixSpan Hybrid Algorithm
inferred← citeshttps://doi.org/10.22266/ijies2023.0430.49openalex-snapshot
A Logic Design-based Approach for Frequent Itemsets Mining Using LCO Algorithm
showing the first 200 of 249 · page through all 249
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.