4.7 Article

Negative pattern discovery with individual support

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Artificial Intelligence

Approximate high utility itemset mining in noisy environments

Yoonji Baek et al.

Summary: A new technique for high utility pattern mining considering data noises is proposed in this paper, which calculates trustworthy ranges for patterns using a utility tolerance factor to extract robust high utility patterns from noisy databases. Experimental results demonstrate that the proposed algorithm outperforms competitors in terms of runtime, memory usage, and scalability.

KNOWLEDGE-BASED SYSTEMS (2021)

Article Computer Science, Information Systems

Periodicity-Oriented Data Analytics on Time-Series Data for Intelligence System

Heonho Kim et al.

Summary: This article proposes an efficient periodicity-oriented data analytics approach for analyzing patterns in time-series databases. The approach ignores intermediate events deliberately by adopting the concept of flexible periodic patterns, making it applicable to diverse real-life scenarios. Performance evaluations show that the proposed approach outperforms state-of-the-art methods in terms of runtime, memory usage, number of visited patterns, and sensitivity.

IEEE SYSTEMS JOURNAL (2021)

Article Computer Science, Artificial Intelligence

A Survey of Utility-Oriented Pattern Mining

Wensheng Gan et al.

Summary: The main purpose of data mining and analytics is to discover novel and potentially useful patterns. Utility-oriented pattern mining (UPM) has become increasingly important in various applications. This survey provides an overview of state-of-the-art methods for UPM, including techniques, applications, and challenges in the field.

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2021)

Article Computer Science, Information Systems

Utility Mining Across Multi-Dimensional Sequences

Wensheng Gan et al.

Summary: The article introduces a novel framework named MDUS for extracting useful patterns from multi-dimensional sequence databases. The framework integrates time-dependency, quantitative information, utility factor, and auxiliary dimensions. Two algorithms, MDUSEM and MDUSSD, effectively discover useful knowledge from the databases.

ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA (2021)

Article Computer Science, Information Systems

TKUS: Mining top-k high utility sequential patterns

Chunkai Zhang et al.

Summary: High-utility sequential pattern mining (HUSPM) has attracted significant research interest recently, with the main task of finding subsequences with high utility in a quantitative sequential database. The top-k HUSPM concept was introduced to address the challenge of specifying a minimum utility threshold. Existing strategies for top-k HUSPM require improvement in terms of efficiency and scalability.

INFORMATION SCIENCES (2021)

Article Computer Science, Theory & Methods

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

Unil Yun et al.

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2020)

Article Computer Science, Information Systems

ProUM: Projection-based utility mining on sequence data

Wensheng Gan et al.

INFORMATION SCIENCES (2020)

Article Automation & Control Systems

e-RNSP: An Efficient Method for Mining Repetition Negative Sequential Patterns

Xiangjun Dong et al.

IEEE TRANSACTIONS ON CYBERNETICS (2020)

Article Computer Science, Information Systems

A Survey of Parallel Sequential Pattern Mining

Wensheng Gan et al.

ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA (2019)

Article Computer Science, Information Systems

PSP-AMS: Progressive Mining of Sequential Patterns Across Multiple Streams

Bijay Prasad Jaysawal et al.

ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA (2019)

Article Automation & Control Systems

NOSEP: Nonoverlapping Sequence Pattern Mining With Gap Constraints

Youxi Wu et al.

IEEE TRANSACTIONS ON CYBERNETICS (2018)

Article Computer Science, Artificial Intelligence

Mining High Utility Sequential Patterns Using Multiple Minimum Utility

Tiantian Xu et al.

INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE (2018)

Article Computer Science, Artificial Intelligence

Mining sequential patterns with itemset constraints

Trang Van et al.

KNOWLEDGE AND INFORMATION SYSTEMS (2018)

Article Automation & Control Systems

Mining of frequent patterns with multiple minimum supports

Wensheng Gan et al.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2017)

Article Computer Science, Artificial Intelligence

Mining High Utility Sequential Patterns with Negative Item Values

Tiantian Xu et al.

INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE (2017)

Article Computer Science, Artificial Intelligence

E-msNSP: Effcient Negative Sequential Patterns Mining Based on Multiple Minimum Supports

Tiantian Xu et al.

INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE (2017)

Article Computer Science, Artificial Intelligence

e-NSP: Efficient negative sequential pattern mining

Longbing Cao et al.

ARTIFICIAL INTELLIGENCE (2016)

Article Computer Science, Artificial Intelligence

FHN: An efficient algorithm for mining high-utility itemsets with negative unit profits

Jerry Chun-Wei Lin et al.

KNOWLEDGE-BASED SYSTEMS (2016)

Article Computer Science, Theory & Methods

Sequential Pattern Mining - Approaches and Algorithms

Carl H. Mooney et al.

ACM COMPUTING SURVEYS (2013)

Article Computer Science, Software Engineering

An efficient tree-based algorithm for mining sequential patterns with multiple minimum supports

Ya-Han Hu et al.

JOURNAL OF SYSTEMS AND SOFTWARE (2013)

Article Computer Science, Artificial Intelligence

Frequent closed sequence mining without candidate maintenance

Jianyong Wang et al.

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2007)

Article Computer Science, Artificial Intelligence

SPADE: An efficient algorithm for mining frequent sequences

MJ Zaki

MACHINE LEARNING (2001)