CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Efficient algorithms for mining clickstream patterns using pseudo-IDLists
Authors
Tzung-Pei Hong
Huy M. Huynh
+4 more
Zuzana Komínková Oplatková
Loan T.T. Nguyen
Bay Vo
Unil Yun
Publication date
2 March 2020
Publisher
Elsevier B.V.
Abstract
Sequential pattern mining is an important task in data mining. Its subproblem, clickstream pattern mining, is starting to attract more research due to the growth of the Internet and the need to analyze online customer behaviors. To date, only few works are dedicately proposed for the problem of mining clickstream patterns. Although one approach is to use the general algorithms for sequential pattern mining, those algorithms’ performance may suffer and the resources needed are more than would be necessary with a dedicated method for mining clickstreams. In this paper, we present pseudo-IDList, a novel data structure that is more suitable for clickstream pattern mining. Based on this structure, a vertical format algorithm named CUP (Clickstream pattern mining Using Pseudo-IDList) is proposed. Furthermore, we propose a pruning heuristic named DUB (Dynamic intersection Upper Bound) to improve our proposed algorithm. Four real-life clickstream databases are used for the experiments and the results show that our proposed methods are effective and efficient regarding runtimes and memory consumption. © 2020 Elsevier B.V.Vietnam National Foundation for Science and Technology Development (NAFOSTED)National Foundation for Science & Technology Development (NAFOSTED) [02/2019/TN
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Institutional repository of Tomas Bata University Library
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:publikace.k.utb.cz:10563/1...
Last time updated on 16/03/2020