On the public citation graph

Efficiently mining erasable stream patterns for intelligent systems over uncertain data

0 signed · 73 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.1002/int.21644openalex-snapshot

Upgrading a Granular Computing Based Data Mining Framework to a Relational Case

inferredcites →https://doi.org/10.1002/int.21810openalex-snapshot

OWA Operator-Based Hybrid Framework for Outlier Reduction in Web Mining

inferredcites →https://doi.org/10.1002/int.21839openalex-snapshot

Properties of a Granular Computing Framework for Mining Relational Data

inferredcites →https://doi.org/10.1002/int.21899openalex-snapshot

Empirical Data Analytics

inferredcites →https://doi.org/10.1002/int.21901openalex-snapshot

Data Envelopment Analysis Based on Choquet Integral

inferredcites →https://doi.org/10.1002/int.21917openalex-snapshot

Fuzzy Quantification and Opinion Mining on Qualitative Data using Feature Reduction

inferredcites →https://doi.org/10.1002/int.22064openalex-snapshot

Online cluster validity indices for performance monitoring of streaming data clustering

inferredcites →https://doi.org/10.1002/int.22111openalex-snapshot

Aggregation of uncertainty data based on ordered weighting aggregation and generalized information quality

inferredcites →https://doi.org/10.1002/int.22161openalex-snapshot

Real‐time force doors detection system using distributed sensors and neural networks

inferredcites →https://doi.org/10.1002/int.22176openalex-snapshot

Measuring global prosperity using data envelopment analysis and OWA operator

inferredcites →https://doi.org/10.1002/int.22225openalex-snapshot

A decision‐making algorithm for online shopping using deep‐learning–based opinion pairs mining and q ‐rung orthopair fuzzy interaction Heronian mean operators

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/s10489-016-0890-zopenalex-snapshot

Efficient algorithm for mining high average-utility itemsets in incremental transaction databases

inferredcites →https://doi.org/10.1007/s10489-019-01412-9openalex-snapshot

Applying uncertain frequent pattern mining to improve ranking of retrieved images

inferredcites →https://doi.org/10.1016/j.engappai.2013.09.002openalex-snapshot

MEI: An efficient algorithm for mining erasable itemsets

inferredcites →https://doi.org/10.1016/j.engappai.2016.03.003openalex-snapshot

Erasable itemset mining over incremental databases with weight conditions

inferredcites →https://doi.org/10.1016/j.engappai.2017.09.010openalex-snapshot

Efficient algorithms for mining top-rank- k erasable patterns using pruning strategies and the subsume concept

inferredcites →https://doi.org/10.1016/j.engappai.2019.05.010openalex-snapshot

FMaxCloHUSM: An efficient algorithm for mining frequent closed and maximal high utility sequences

inferredcites →https://doi.org/10.1016/j.eswa.2011.09.087openalex-snapshot

A new mining approach for uncertain databases using CUFP trees

inferredcites →https://doi.org/10.1016/j.eswa.2011.09.143openalex-snapshot

Fast mining erasable itemsets using NC_sets

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.2016.12.023openalex-snapshot

A novel approach for mining maximal frequent patterns

inferredcites →https://doi.org/10.1016/j.eswa.2017.10.039openalex-snapshot

A weighted N-list-based method for mining frequent weighted itemsets

inferredcites →https://doi.org/10.1016/j.eswa.2018.07.051openalex-snapshot

Emerging topic detection in twitter stream based on high utility pattern mining

inferredcites →https://doi.org/10.1016/j.eswa.2018.09.051openalex-snapshot

Mining top-k high utility itemsets with effective threshold raising strategies

inferredcites →https://doi.org/10.1016/j.eswa.2019.01.034openalex-snapshot

Fast algorithms for mining maximal erasable patterns

inferredcites →https://doi.org/10.1016/j.eswa.2019.04.058openalex-snapshot

C3Ro: An efficient mining algorithm of extended-closed contiguous robust sequential patterns in noisy data

inferredcites →https://doi.org/10.1016/j.eswa.2019.05.013openalex-snapshot

A MapReduce solution for incremental mining of sequential patterns from big data

inferredcites →https://doi.org/10.1016/j.eswa.2019.112967openalex-snapshot

Distributed mining of high utility time interval sequential patterns using mapreduce approach

inferredcites →https://doi.org/10.1016/j.eswa.2019.112993openalex-snapshot

Efficient methods for mining weighted clickstream patterns

inferredcites →https://doi.org/10.1016/j.eswa.2019.113043openalex-snapshot

Top-K interesting preference rules mining based on MaxClique

inferredcites →https://doi.org/10.1016/j.eswa.2019.113087openalex-snapshot

Efficient approach for incremental weighted erasable pattern mining with list structure

inferredcites →https://doi.org/10.1016/j.future.2016.09.007openalex-snapshot

A new efficient approach for mining uncertain frequent patterns using minimum data structure without false positives

inferredcites →https://doi.org/10.1016/j.future.2018.12.029openalex-snapshot

Efficient approach for incremental high utility pattern mining with indexed list structure

inferredcites →https://doi.org/10.1016/j.future.2019.09.024openalex-snapshot

Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases

inferredcites →https://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

inferredcites →https://doi.org/10.1016/j.ins.2018.11.043openalex-snapshot

Mining conditional discriminative sequential patterns

inferredcites →https://doi.org/10.1016/j.knosys.2015.08.018openalex-snapshot

An uncertainty-based approach: Frequent itemset mining from uncertain data with different item importance

inferredcites →https://doi.org/10.1016/j.knosys.2017.12.029openalex-snapshot

Damped window based high average utility pattern mining over data streams

inferredcites →https://doi.org/10.1016/j.knosys.2018.04.001openalex-snapshot

Incremental mining maximal frequent patterns from univariate uncertain data

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.knosys.2019.07.018openalex-snapshot

Efficient high average-utility itemset mining using novel vertical weak upper-bounds

inferredcites →https://doi.org/10.1109/access.2019.2930004openalex-snapshot

Frequent Pattern Mining on Time and Location Aware Air Quality Data

inferredcites →https://doi.org/10.1109/smc.2013.388openalex-snapshot

An Efficient Algorithm for Mining Erasable Itemsets Using the Difference of NC-Sets

inferredcites →https://doi.org/10.1109/tie.2017.2682782openalex-snapshot

Efficient High Utility Pattern Mining for Establishing Manufacturing Plans With Sliding Window Control

inferredcites →https://doi.org/10.1109/tkde.2011.165openalex-snapshot

Efficient Mining of Frequent Item Sets on Large Uncertain Databases

inferredcites →https://doi.org/10.1142/s0219622019300027openalex-snapshot

A Systematic Survey on High Utility Itemset Mining

inferredcites →https://doi.org/10.3233/ifs-141398openalex-snapshot

Mining weighted erasable patterns by using underestimated constraint-based pruning technique

inferredcites →https://doi.org/10.4156/ijact.vol4.issue3.6openalex-snapshot

An Approximation Algorithm Of Mining Frequent Itemsets From Uncertain Dataset

inferredcites →https://doi.org/10.4304/jcp.8.6.1417-1426openalex-snapshot

AT-Mine: An Efficient Algorithm of Frequent Itemset Mining on Uncertain Dataset

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/int.22528openalex-snapshot

Average utility driven data analytics on damped windows for intelligent systems with data streams

inferred← citeshttps://doi.org/10.1002/int.22912openalex-snapshot

A novel belief χ2 ${\chi }^{2}$ divergence for multisource information fusion and its application in pattern classification

inferred← citeshttps://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

inferred← citeshttps://doi.org/10.1007/s10115-024-02185-5openalex-snapshot

An efficient approach for incremental erasable utility pattern mining from non-binary data

inferred← citeshttps://doi.org/10.1007/s10489-021-02290-wopenalex-snapshot

Weighted frequent sequential pattern mining

inferred← citeshttps://doi.org/10.1007/s10489-022-03580-7openalex-snapshot

A new approach for efficiently mining frequent weighted utility patterns

inferred← citeshttps://doi.org/10.1007/s10489-023-04554-zopenalex-snapshot

Mining frequent weighted utility patterns with dynamic weighted items from quantitative databases

inferred← citeshttps://doi.org/10.1007/s10660-022-09543-xopenalex-snapshot

Novel next-group recommendation approach based on sequential market basket information

inferred← citeshttps://doi.org/10.1016/j.asoc.2025.112902openalex-snapshot

Efficient fuzzy-based high utility pattern computing and analyzing approach with temporal properties

inferred← citeshttps://doi.org/10.1016/j.ins.2022.07.037openalex-snapshot

An efficient approach for mining maximized erasable utility patterns

inferred← citeshttps://doi.org/10.1016/j.knosys.2022.108134openalex-snapshot

Advanced uncertainty based approach for discovering erasable product patterns

inferred← citeshttps://doi.org/10.1016/j.knosys.2022.109702openalex-snapshot

Efficient approach of sliding window-based high average-utility pattern mining with list structures

inferred← citeshttps://doi.org/10.1016/j.knosys.2025.113161openalex-snapshot

Approximate erasable pattern discovery and analytics on stream data

inferred← citeshttps://doi.org/10.1016/j.knosys.2025.114555openalex-snapshot

An efficient method for maximal erasable itemset mining in incremental databases

inferred← citeshttps://doi.org/10.1016/j.patcog.2025.112283openalex-snapshot

Fusion of window controls to recognize and analyze erasable patterns over data streams

inferred← citeshttps://doi.org/10.1109/access.2021.3070132openalex-snapshot

A Sliding Window-Based Approach for Mining Frequent Weighted Patterns Over Data Streams

inferred← citeshttps://doi.org/10.1109/tsc.2025.3536359openalex-snapshot

Uncertainty-Driven Pattern Mining on Incremental Data for Stream Analyzing Service

inferred← citeshttps://doi.org/10.1109/tsmc.2024.3505904openalex-snapshot

Uncertainty Oriented-Incremental Erasable Pattern Mining Over Data Streams

inferred← citeshttps://doi.org/10.1145/3622940openalex-snapshot

Discovering Interesting Patterns from Hypergraphs

inferred← citeshttps://doi.org/10.17559/tv-20230719000815openalex-snapshot

A Parallel Mining Algorithm for Maximum Erasable Itemset Based on Multi-core Processor

inferred← citeshttps://doi.org/10.32604/cmc.2022.024765openalex-snapshot

A Fast Algorithm for Mining Top-Rank-k Erasable Closed Patterns

inferred← citeshttps://doi.org/10.3390/bdcc9100258openalex-snapshot

Data Organisation for Efficient Pattern Retrieval: Indexing, Storage, and Access Structures

inferred← citeshttps://doi.org/10.3390/math12213312openalex-snapshot

Enhancing Economic, Resilient, and Sustainable Outcomes Through Supplier Selection and Order Allocation in the Food Manufacturing Industry: A Hybrid Delphi-FAHP-FMOP Method

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.