On the public citation graph
SOHUPDS+: An Efficient One-phase Algorithm for Mining High Utility Patterns over a Data Stream
0 signed · 51 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/3-540-44469-6openalex-snapshot
Database and Expert Systems Applications
inferredcites →https://doi.org/10.1007/978-3-030-27615-7_22openalex-snapshot
An Efficient Premiumness and Utility-Based Itemset Placement Scheme for Retail Stores
inferredcites →https://doi.org/10.1007/978-3-030-35231-8_1openalex-snapshot
Mining Emerging High Utility Itemsets over Streaming Database
inferredcites →https://doi.org/10.1007/978-3-319-07821-2_1openalex-snapshot
An Introduction to Frequent Pattern Mining
inferredcites →https://doi.org/10.1007/978-3-319-08326-1_9openalex-snapshot
FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning
inferredcites →https://doi.org/10.1007/978-3-319-27060-9_44openalex-snapshot
EFIM: A Highly Efficient Algorithm for High-Utility Itemset Mining
inferredcites →https://doi.org/10.1007/s10115-018-1207-9openalex-snapshot
DMHUPS: Discovering Multiple High Utility Patterns Simultaneously
inferredcites →https://doi.org/10.1007/s10115-019-01333-6openalex-snapshot
Mining frequent and top-K High Utility Time Interval-based Events with Duration patterns
inferredcites →https://doi.org/10.1007/s10115-020-01485-wopenalex-snapshot
An efficient projection-based method for high utility itemset mining using a novel pruning approach on the utility matrix
inferredcites →https://doi.org/10.1007/s10115-022-01763-9openalex-snapshot
An efficient algorithm for mining closed high utility itemsets over data streams with one dataset scan
inferredcites →https://doi.org/10.1007/s10489-017-0939-7openalex-snapshot
Mining top-k high-utility itemsets from a data stream under sliding window model
inferredcites →https://doi.org/10.1007/s10489-023-04925-6openalex-snapshot
High utility pattern mining algorithm over data streams using ext-list.
inferredcites →https://doi.org/10.1007/s41060-020-00221-5openalex-snapshot
An improved scheme for determining top-revenue itemsets for placement in retail businesses
inferredcites →https://doi.org/10.1016/j.eswa.2012.03.062openalex-snapshot
Interactive mining of high utility patterns over data streams
inferredcites →https://doi.org/10.1016/j.eswa.2012.05.035openalex-snapshot
Efficient algorithms for mining maximal high utility itemsets from data streams with different models
inferredcites →https://doi.org/10.1016/j.eswa.2013.11.038openalex-snapshot
High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates
inferredcites →https://doi.org/10.1016/j.eswa.2014.11.001openalex-snapshot
Pruning strategies for mining high utility itemsets
inferredcites →https://doi.org/10.1016/j.eswa.2015.02.051openalex-snapshot
An efficient approach for mining association rules from high utility itemsets
inferredcites →https://doi.org/10.1016/j.eswa.2016.03.001openalex-snapshot
High utility pattern mining over data streams with sliding window technique
inferredcites →https://doi.org/10.1016/j.eswa.2017.08.028openalex-snapshot
HMiner: Efficiently mining high utility itemsets
inferredcites →https://doi.org/10.1016/j.ins.2014.01.045openalex-snapshot
Mining top-k high utility patterns over data streams
inferredcites →https://doi.org/10.1016/j.neucom.2022.06.082openalex-snapshot
Hyper-class representation of data
inferredcites →https://doi.org/10.1109/access.2021.3128074openalex-snapshot
A Retail Itemset Placement Framework Based on Premiumness of Slots and Utility Mining
inferredcites →https://doi.org/10.1109/bigdata50022.2020openalex-snapshot
2020 IEEE International Conference on Big Data (Big Data)
inferredcites →https://doi.org/10.1109/bigdata50022.2020.9378288openalex-snapshot
TopHUI: Top-k high-utility itemset mining with negative utility
inferredcites →https://doi.org/10.1109/icdm21070.2012openalex-snapshot
2012 IEEE 12th International Conference on Data Mining
inferredcites →https://doi.org/10.1109/tcad.2023.3345251openalex-snapshot
Quantum KNN Classification With K Value Selection and Neighbor Selection
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.2014.2345377openalex-snapshot
Efficient Algorithms for Mining the Concise and Lossless Representation of High Utility Itemsets
inferredcites →https://doi.org/10.1109/tkde.2015.2458860openalex-snapshot
Efficient Algorithms for Mining Top-K High Utility Itemsets
inferredcites →https://doi.org/10.1109/tkde.2015.2510012openalex-snapshot
Mining High Utility Patterns in One Phase without Generating Candidates
inferredcites →https://doi.org/10.1109/tkde.2021.3119140openalex-snapshot
KNN Classification with One-step Computation
inferredcites →https://doi.org/10.1109/tkde.2022.3185149openalex-snapshot
Reachable Distance Function for KNN Classification
inferredcites →https://doi.org/10.1145/1401890openalex-snapshot
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
inferredcites →https://doi.org/10.1145/2396761openalex-snapshot
Proceedings of the 21st ACM international conference on Information and knowledge management
inferredcites →https://doi.org/10.1145/3363571openalex-snapshot
High-Utility Itemset Mining with Effective Pruning Strategies
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10115-026-02900-4openalex-snapshot
High utility itemsets mining in data stream using cuckoo search
inferred← citeshttps://doi.org/10.1007/s10489-025-06729-2openalex-snapshot
Efficient high utility itemsets mining over data streams with compact utility list structure
inferred← citeshttps://doi.org/10.1016/j.aej.2026.03.002openalex-snapshot
Exploring and detecting utility streams on prelarge and time fading properties
inferred← citeshttps://doi.org/10.1016/j.asej.2026.104451openalex-snapshot
Temporal importance and utility based pattern analysis with negative units for industrial data streams
inferred← citeshttps://doi.org/10.1016/j.datak.2026.102647openalex-snapshot
A matrix-based high-utility itemsets mining algorithm over streaming data using sliding windows
inferred← citeshttps://doi.org/10.1016/j.engappai.2025.113639openalex-snapshot
Mining high average-efficiency itemsets based on a compact list structure
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.130390openalex-snapshot
An efficient algorithm for high average-efficiency itemset mining over data streams
inferred← citeshttps://doi.org/10.1016/j.ipm.2026.104893openalex-snapshot
Mining temporally aware patterns with fuzzy utility measures under dynamically moving window environments
inferred← citeshttps://doi.org/10.1109/tfuzz.2026.3654110openalex-snapshot
Advanced Temporal Fuzzy Utility Pattern Analysis for Dynamic Uncertain Data Streams
inferred← citeshttps://doi.org/10.1186/s40537-025-01352-xopenalex-snapshot
Intelligent average utility pattern analysis using pre-large concept in dynamic stream 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.