Description
The implementation in SPARK-6487 might have scalability issues when the number of frequent items is very small. In this case, we can generate candidate sets of higher orders using Apriori-like algorithms and count them, until we collect enough prefixes.
Attachments
Issue Links
- blocks
-
SPARK-8999 Support non-temporal sequence in PrefixSpan
- Resolved
- depends upon
-
SPARK-6487 Add sequential pattern mining algorithm PrefixSpan to Spark MLlib
- Resolved
- links to