Results 21 to 30 of about 10,424,890 (336)

Mining Conjunctive Sequential Patterns [PDF]

open access: yesData Mining and Knowledge Discovery, 2008
In this paper we aim at extending the non-derivable condensed representation in frequent itemset mining to sequential pattern mining. We start by showing a negative example: in the context of frequent sequences, the notion of non-derivability is meaningless. Therefore, we extend our focus to the mining of conjunctions of sequences.
Chedy Raïssi   +2 more
openaire   +5 more sources

Mining Weighted Sequential Patterns Based on Prefix-Tree and Prism Encoding

open access: yesVietnam Journal of Computer Science, 2023
The purpose of mining sequential patterns problem with weighted constraints is to find high-valued patterns, including infrequent patterns but having items which appear in the pattern of high importance in the sequence database (SD).
Thi-Thiet Pham   +4 more
doaj   +1 more source

CCSpan: Mining closed contiguous sequential patterns

open access: yesKnowledge-Based Systems, 2015
Yinglin Wang, Dingyu Yang
exaly   +2 more sources

Enhanced parallel mining algorithm for frequent sequential rules

open access: yesAin Shams Engineering Journal, 2022
Sequential rule mining is an important data mining technique that discovers relationships between occurrences of sequential patterns. The main challenge is to avoid time-consuming, especially in large search spaces.
Nesma Youssef   +2 more
doaj   +1 more source

Sequential patterns for text categorization [PDF]

open access: yesIntelligent Data Analysis, 2006
Text categorization is a well-known task based essentially on statistical approaches using neural networks, Support Vector Machines and other machine learning algorithms. Texts are generally considered as bags of words without any order. Although these approaches have proven to be efficient, they do not provide users with comprehensive and reusable ...
Jaillet, Simon   +2 more
openaire   +2 more sources

Affinity Analysis Models of Transactional and Behavioral Customer Data for Personalized Content Generation in B2B E-commerce Systems

open access: yesTrudy Odesskogo Politehničeskogo Universiteta
The growing financial significance and structural complexity of the B2B e-commerce market segment, coupled with the necessity to enhance its efficiency, have necessitated a systematic analysis of existing affinity analysis models for transactional and ...
Олена Олександрівна Арсірій   +1 more
doaj   +5 more sources

Progressive CFM-Miner: An Algorithm to Mine CFM – Sequential Patterns from a Progressive Database [PDF]

open access: yesInternational Journal of Computational Intelligence Systems, 2013
Sequential pattern mining is a vital data mining task to discover the frequently occurring patterns in sequence databases. As databases develop, the problem of maintaining sequential patterns over an extensively long period of time turn into essential ...
Bhawna Mallick   +2 more
doaj   +1 more source

An Efficient Method for Mining Top-K Closed Sequential Patterns

open access: yesIEEE Access, 2020
The problem of exploiting Closed Sequential Patterns (CSPs) is an essential task in data mining, with many different applications. It is used to resolve the situations of huge databases or low minimum support (minsup) thresholds in mining sequential ...
Thi-Thiet Pham   +4 more
doaj   +1 more source

Mining Transactional Databases for Frequent and High-Utility Fuzzy Sequential Patterns With Time Intervals

open access: yesIEEE Access, 2022
The field of data mining is progressing rapidly presenting researchers with many opportunities for research. Sequential pattern mining is a popular and long established technique in data mining which extracts data in the form of sequential patterns ...
Ritika, Sunil Kumar Gupta
doaj   +1 more source

On the use of the Rademacher complexity in mining sequential patterns [PDF]

open access: yes, 2022
A sequential pattern is a sequence of sets of items. Mining sequential patterns from very large datasets is a fundamental problem in data mining. This thesis formally proves the first rigorous and efficiently computable bound on the Rademacher complexity
Santoro, Diego
core  

Home - About - Disclaimer - Privacy