ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach
IEEE Transactions on Knowledge and Data Engineering
A fast high utility itemsets mining algorithm
UBDM '05 Proceedings of the 1st international workshop on Utility-based data mining
Isolated items discarding strategy for discovering high utility itemsets
Data & Knowledge Engineering
Mining Cluster-Based Mobile Sequential Patterns in Location-Based Service Environments
MDM '09 Proceedings of the 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware
Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases
IEEE Transactions on Knowledge and Data Engineering
UP-Growth: an efficient algorithm for high utility itemset mining
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Cluster-Based Temporal Mobile Sequential Patterns in Location-Based Service Environments
IEEE Transactions on Knowledge and Data Engineering
Mining high utility mobile sequential patterns in mobile commerce environments
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Discovering valuable user behavior patterns in mobile commerce environments
PAKDD'11 Proceedings of the 15th international conference on New Frontiers in Applied Data Mining
Mining Mobile Sequential Patterns in a Mobile Commerce Environment
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Mining interesting user behavior patterns in mobile commerce environments
Applied Intelligence
Hi-index | 0.00 |
Mobile sequential pattern mining is an emerging topic in data mining fields with wide applications, such as planning mobile commerce environments and managing online shopping websites. However, an important factor, i.e., actual utilities (i.e., profit here) of items, is not considered and thus some valuable patterns cannot be found. Therefore, previous researches [8, 9] addressed the problem of mining high utility mobile sequential patterns (abbreviated as UMSPs). Nevertheless the tree-based algorithms may not perform efficiently since mobile transaction sequences are often too complex to form compress tree structures. A novel algorithm, namely UM-Span (high Utility Mobile Sequential Pattern mining), is proposed for efficiently mining UMSPs in this work. UM-Span finds UMSPs by a projected database based framework. It does not need additional database scans to find actual UMSPs, which is the bottleneck of utility mining. Experimental results show that UM-Span outperforms the state-of-the-art UMSP mining algorithms under various conditions.