An efficient algorithm for hiding high utility sequential patterns

DOI10.1016/J.IJAR.2018.01.005MaRDI QIDQ1642767zbMATH OpenOpenAlexFDO

Authors Bac Le, Duy-Tai Dinh, Van-Nam Huynh, Quang-Minh Nguyen, Philippe Fournier-Viger

Publication date 15 June 2018

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2018.01.005

zbMATH Keywords

data miningprivacy-preserving data mininghigh-utility sequential pattern hidinghigh-utility sequential pattern mining

Mathematics Subject Classification ID

Database theory (68P15) Privacy of data (68P27)

Recommendations

• A new algorithm for mining high utility sequential patterns based on pattern-growth
• scientific article; zbMATH DE number 6610875
• Memory-adaptive high utility sequential pattern mining over data streams
• Efficient approach of recent high utility stream pattern mining with indexed list structure and pruning strategy considering arrival times of transactions
• High-utility pattern mining: a method for discovery of high-utility item sets

Cites work

• SPMF: a Java open-source pattern mining library
• Security, privacy and trust in modern data management.

Cited in

(4)

• Editorial: Uncertainty management in machine learning applications
• A new algorithm for mining high utility sequential patterns based on pattern-growth
• Clustering mixed numerical and categorical data with missing values
• H-FHAUI: hiding frequent high average utility itemsets

Describes a project that uses

Uses Software

• PrefixSpan
• SPMF

This page was built for publication: An efficient algorithm for hiding high utility sequential patterns

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