On the public citation graph

Mining High Utility Itemsets Based on Pattern Growth without Candidate Generation

0 signed · 41 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/11430919_79openalex-snapshot
A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets
inferredcites →https://doi.org/10.1007/978-3-319-14717-8_6openalex-snapshot
High Utility Episode Mining Made Practical and Fast
inferredcites →https://doi.org/10.1007/978-3-540-24571-1_38openalex-snapshot
An Efficient Approach for Maintaining Association Rules Based on Adjusting FP-Tree Structures
inferredcites →https://doi.org/10.1007/978-3-540-68125-0_108openalex-snapshot
CP-Tree: A Tree Structure for Single-Pass Frequent Pattern Mining
inferredcites →https://doi.org/10.1007/978-3-642-35452-6_26openalex-snapshot
Mining High Utility Itemsets Based on the Pre-large Concept
inferredcites →https://doi.org/10.1007/s00500-019-03829-3openalex-snapshot
Hiding sensitive itemsets with multiple objective optimization
inferredcites →https://doi.org/10.1007/s10618-010-0204-8openalex-snapshot
Mining frequent itemsets over distributed data streams by continuously maintaining a global synopsis
inferredcites →https://doi.org/10.1016/j.datak.2005.10.004openalex-snapshot
Mining itemset utilities from transaction databases
inferredcites →https://doi.org/10.1016/j.datak.2007.06.009openalex-snapshot
Isolated items discarding strategy for discovering high utility itemsets
inferredcites →https://doi.org/10.1016/j.eswa.2010.12.082openalex-snapshot
An effective tree structure for mining high utility itemsets
inferredcites →https://doi.org/10.1016/j.ins.2017.08.043openalex-snapshot
Combining Apriori heuristic and bio-inspired algorithms for solving the frequent itemsets mining problem
inferredcites →https://doi.org/10.1016/j.knosys.2019.03.022openalex-snapshot
Mining high-utility itemsets in dynamic profit databases
inferredcites →https://doi.org/10.1016/j.patcog.2007.02.003openalex-snapshot
High-utility pattern mining: A method for discovery of high-utility item sets
inferredcites →https://doi.org/10.1023/b:dami.0000005258.31418.83openalex-snapshot
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
inferredcites →https://doi.org/10.1109/cit.2007.120openalex-snapshot
CTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach
inferredcites →https://doi.org/10.1109/icde.2019.00163openalex-snapshot
Highly Efficient Pattern Mining Based on Transaction Decomposition
inferredcites →https://doi.org/10.1109/icdm.2012.20openalex-snapshot
Direct Discovery of High Utility Itemsets without Candidate Generation
inferredcites →https://doi.org/10.1109/icmlc.2005.1527191openalex-snapshot
New algorithm for mining frequent itemsets in sparse database
inferredcites →https://doi.org/10.1109/tkde.2005.166openalex-snapshot
Fast algorithms for frequent itemset mining using FP-trees
inferredcites →https://doi.org/10.1109/tkde.2006.1599386openalex-snapshot
A transaction mapping algorithm for frequent itemsets mining
inferredcites →https://doi.org/10.1109/tkde.2006.52openalex-snapshot
A transaction mapping algorithm for frequent itemsets mining
inferredcites →https://doi.org/10.1109/tkde.2009.46openalex-snapshot
Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases
inferredcites →https://doi.org/10.1109/tkde.2012.59openalex-snapshot
Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases
inferredcites →https://doi.org/10.1109/tkde.2015.2458860openalex-snapshot
Efficient Algorithms for Mining Top-K High Utility Itemsets
inferredcites →https://doi.org/10.1137/1.9781611972740.51openalex-snapshot
A Foundational Approach to Mining Itemset Utilities from Databases
inferredcites →https://doi.org/10.1145/1835804.1835839openalex-snapshot
UP-Growth
inferredcites →https://doi.org/10.1145/2339530.2339546openalex-snapshot
Mining top-K high utility itemsets
inferredcites →https://doi.org/10.1145/2339530.2339724openalex-snapshot
Fast algorithms for maximal clique enumeration with limited memory
inferredcites →https://doi.org/10.1145/2396761.2396773openalex-snapshot
Mining high utility itemsets without candidate generation

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-031-46781-3_23openalex-snapshot
MFG-HUI: An Efficient Algorithm for Mining Frequent Generators of High Utility Itemsets
inferred← citeshttps://doi.org/10.1007/978-981-95-2872-1_8openalex-snapshot
A Hash-Based Nature-Inspired Algorithm for High-Utility Itemset Mining
inferred← citeshttps://doi.org/10.1007/978-981-97-7083-0_6openalex-snapshot
A Novel Approach of Mining High Utility Itemsets
inferred← citeshttps://doi.org/10.1007/s13198-022-01676-4openalex-snapshot
A novel way to compute association rules
inferred← citeshttps://doi.org/10.1016/j.engappai.2023.107111openalex-snapshot
Efficient mining of concise and informative representations of frequent high utility itemsets
inferred← citeshttps://doi.org/10.1016/j.engappai.2024.109742openalex-snapshot
U-HPAUSM: Mining high probability average utility sequences in uncertain quantitative sequential databases
inferred← citeshttps://doi.org/10.1016/j.knosys.2022.109921openalex-snapshot
Efficient algorithms for mining closed and maximal high utility itemsets
inferred← citeshttps://doi.org/10.1016/j.knosys.2024.111796openalex-snapshot
Mining Interesting Sequential Patterns using a Novel Balanced Utility Measure
inferred← citeshttps://doi.org/10.1109/icdmw58026.2022.00071openalex-snapshot
Mining High Utility Itemset with Multiple Minimum Utility Thresholds Based on Utility Deviation
inferred← citeshttps://doi.org/10.1109/icpcsn68523.2026.11544029openalex-snapshot
High Utility Pattern Mining in Certain Data with Advanced Filtering Strategy
inferred← citeshttps://doi.org/10.23919/jsee.2024.000020openalex-snapshot
PHUI-GA: GPU-Based Efficiency Evolutionary Algorithm for Mining High Utility Itemsets
inferred← citeshttps://doi.org/10.3390/math13040659openalex-snapshot
Mining High-Efficiency Itemsets with Negative Utilities
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.