Efficient algorithms for mining frequent high utility sequences with constraints

DOI10.1016/J.INS.2021.01.060MaRDI QIDQ6086331zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• A new algorithm for mining high utility sequential patterns based on pattern-growth
• scientific article; zbMATH DE number 6610875
• Mining high-utility sequences with positive and negative values
• High-utility pattern mining: a method for discovery of high-utility item sets
• Memory-adaptive high utility sequential pattern mining over data streams

Cites work

• Discovering important sequential patterns with length-decreasing weighted support constraints
• Efficient strategies for tough aggregate constraint-based sequential pattern mining
• SPADE: An efficient algorithm for mining frequent sequences
• SPMF: a Java open-source pattern mining library

Cited in

(1)

• Mining high-utility sequences with positive and negative values

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)