Please use this identifier to cite or link to this item:
https://dspace.ctu.edu.vn/jspui/handle/123456789/26577
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tran, Huy Duong | - |
dc.contributor.author | Nguyen, Truong Thang | - |
dc.contributor.author | Vu, Duc Thi | - |
dc.contributor.author | Tran, The Anh | - |
dc.date.accessioned | 2020-06-26T02:59:25Z | - |
dc.date.available | 2020-06-26T02:59:25Z | - |
dc.date.issued | 2020 | - |
dc.identifier.issn | 1813-9663 | - |
dc.identifier.uri | http://dspace.ctu.edu.vn/jspui/handle/123456789/26577 | - |
dc.description.abstract | High utility sequential pattern mining is a popular topic in data mining with the main purpose is to extract sequential patterns with high utility in the sequence database. Many recent works have proposed methods to solve this problem. However, most of them does not consider item intervals of sequential patterns which can lead to the extraction of sequential patterns with too long item interval, thus making little sense. In this paper, we propose a High Utility Item Interval Sequential Pattern (HUISP) algorithm to solve this problem. Our algorithm uses pattern growth approach and some techniques to increase algorithm’s performance. | vi_VN |
dc.language.iso | en | vi_VN |
dc.relation.ispartofseries | Journal of Computer Science and Cybernetics;Vol.36(01) .- P.01–15 | - |
dc.subject | Sequential pattern | vi_VN |
dc.subject | Item interval | vi_VN |
dc.subject | High utility | vi_VN |
dc.title | High utility item interval sequential pattern mining algorithm | vi_VN |
dc.type | Article | vi_VN |
Appears in Collections: | Tin học và Điều khiển học (Journal of Computer Science and Cybernetics) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
_file_ Restricted Access | 2.95 MB | Adobe PDF | ||
Your IP: 18.119.235.107 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.