Mining top-N high-utility operation patterns for taxi drivers

作者：

Highlights：

• Propose a framework for top-N high-utility order sequences mining.

• Construct a function to calculate the utility of the order sequence.

• Construct a high-utility sequence tree to mine taxi driver’s operation patterns.

• Propose two pruning strategies to reduce the size of candidate set.

• Validate the proposed algorithm on real world dataset.

摘要

•Propose a framework for top-N high-utility order sequences mining.•Construct a function to calculate the utility of the order sequence.•Construct a high-utility sequence tree to mine taxi driver’s operation patterns.•Propose two pruning strategies to reduce the size of candidate set.•Validate the proposed algorithm on real world dataset.

论文关键词：Top-N,High-utility,Operation pattern,Order sequence,Dynamic update

论文评审过程：Received 15 October 2020, Revised 21 December 2020, Accepted 25 December 2020, Available online 1 January 2021, Version of Record 23 January 2021.

论文官网地址：https://doi.org/10.1016/j.eswa.2020.114546