Memory-adaptive high utility sequential pattern mining over data streams
From MaRDI portal
Recommendations
- Mining top-\(k\) high utility patterns over data streams
- A new algorithm for mining high utility sequential patterns based on pattern-growth
- scientific article; zbMATH DE number 6452791
- Efficient approach of recent high utility stream pattern mining with indexed list structure and pruning strategy considering arrival times of transactions
- Mining High Utility Itemsets in massive transactional datasets
Cites work
Cited in
(7)- A holistic approach for resource-aware adaptive data stream mining
- Efficient approach of recent high utility stream pattern mining with indexed list structure and pruning strategy considering arrival times of transactions
- An efficient algorithm for hiding high utility sequential patterns
- A new algorithm for mining high utility sequential patterns based on pattern-growth
- Recurring concept memory management in data streams: exploiting data stream concept evolution to improve performance and transparency
- Efficient algorithms for mining frequent high utility sequences with constraints
- Mining top-\(k\) high utility patterns over data streams
This page was built for publication: Memory-adaptive high utility sequential pattern mining over data streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699624)