Efficient algorithms for mining frequent high utility sequences with constraints

DOI10.1016/J.INS.2021.01.060zbMATH Open1527.68196OpenAlexW3126907377MaRDI QIDQ6086331FDOQ6086331

Hai M. Duong, Philippe Fournier-Viger, Tin Truong, Unil Yun, Hamido Fujita, Bac Le

Publication date: 9 November 2023

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2021.01.060

zbMATH Keywords

frequent closed high-utility sequencefrequent generator high-utility sequencefrequent high-utility sequencemining patterns with constraintsquantitative sequential database

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• SPADE: An efficient algorithm for mining frequent sequences
• Title not available (Why is that?)
• Efficient strategies for tough aggregate constraint-based sequential pattern mining
• DISCOVERING IMPORTANT SEQUENTIAL PATTERNS WITH LENGTH-DECREASING WEIGHTED SUPPORT CONSTRAINTS

This page was built for publication: Efficient algorithms for mining frequent high utility sequences with constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6086331)