PIVOTMiner and PIVOTRanker: Interval-Based Sequential Pattern Mining and Ranking

An algorithm evaluation dataset from RWTH Aachen University by Marwan Hassani, focusing on interval-based sequential patterns. The description discusses synthetic and real-world datasets used to evaluate the PIVOTMiner algorithm for mining frequent sequences and the PIVOTRanker algorithm for ranking rare patterns based on outlierness. The work addresses the challenge of finding meaningful patterns in time-interval data.

Use Cases

• Benchmarking interval-based sequential pattern mining algorithms based on execution time comparisons.
• Evaluating ranking algorithms for rare patterns based on their outlierness from frequent ones.
• Testing pattern mining approaches on data where activities have timing durations.

Strengths

• Includes both synthetic and real-world datasets for evaluation, as stated in the description.
• Focuses on interval-based sequential patterns, a specific and described data type often overlooked.

Limitations

• Column-level documentation is absent; field semantics must be inferred after download.
• Row count is unknown, which may limit suitability assessment.
• Last update date is unknown; freshness unverified.

Provenance

Source

RWTH Aachen University

Collection Method

Algorithm evaluation datasets, likely generated synthetically and collected from real-world sources.