KHAI THÁC TOP-K TẬP HỮU ÍCH CAO CÓ TƯƠNG QUAN TRÊN CƠ SỞ DỮ LIỆU GIAO DỊCH

0 Người đánh giá. Xếp hạng trung bình 0

Tác giả: Thiên Lý Mạnh, Thị Thanh Thủy Nguyễn, Văn Lễ Nguyễn

Ngôn ngữ: vie

Ký hiệu phân loại:

Thông tin xuất bản: Tạp chí Khoa học Công nghệ và Thực phẩm (Tên mới: Tạp chí Khoa học Đại học Công Thương), 2023

Mô tả vật lý: tr.164

Bộ sưu tập: Metadata

ID: 338404

Thêm vào giỏ Liên kết toàn văn

In this paper, we propose a new research direction, which is to exploit the top-k Correlated High Utility Itemset (TCHUI) on the transaction database. Combination of mining Correlated High Utility Itemsets and mining Top-K High Utility Itemsets to find the top-k correlated high utility itemsets on the transaction database. To address this issue, we combine the Correlated High Utility Itemset (CoHUI) mining with the threshold raising strategies and propose the TCH algorithm. This algorithm uses the Utility List data structure to store data about the utility of itemsets, uses the Kulc threshold to measure correlation, and applies several pruning strategies such as U-Prune, TWU -Prune, LA-Prune to reduce the search space. Besides that, the threshold raising strategies are applied such as RIU, LIU-E, and RUC to exploit the TCHUI set effectively. Our experiment results on large datasets including Chess, Mushroom, Retail, and Chainstore and compare with the state-of-the-art THUI algorithm. The results show that the proposed algorithm has better performance than the THUI algorithm in terms of execution time and memory usage.Trong bài báo này, nhóm tác giả đề xuất một hướng nghiên cứu mới, đó là khai thác top[1]k tập hữu ích cao có tương quan (Top-k Correlated High Utility Itemset –TCHUI) trên cơ sở dữ liệu giao dịch. Kết hợp giữa bài toán khai thác tập hữu ích cao có tương quan và bài toán khai thác top-k nhằm tìm top-k tập mặt hàng có tính tương quan mà có độ hữu ích cao trong cơ sở dữ liệu giao. Để tìm kiếm tập ????????????????????, chúng tôi kết hợp khai thác tập hữu ích cao có tương quan (Correlated High Utility Itemset - CoHUI) với các chiến lược nâng ngưỡng và đề xuất thuật toán ????????????. Thuật toán này sử dụng cấu trúc dữ liệu Utility List để lưu trữ thông tin về độ hữu ích của các tập mặt hàng, sử dụng độ đo ???????????????? để đo lường tính tương quan và áp dụng các chiến lược tỉa: U-Prune, TWU-Prune, LA-Prune giúp giảm không gian tìm kiếm. Đồng thời, các chiến lược nâng ngưỡng như RIU, LIU-E, RUC cũng được sử dụng để khai thác tập ???????????????????? một cách hiệu quả. Thực nghiệm trên các bộ dữ liệu lớn gồm Chess, Mushroom, Retail, Chainstore và so sánh hiệu suất thực thi giữa thuật toán ???????????? với thuật toán gần đây là ????????????????. Kết quả thực nghiệm cho thấy thuật toán đề xuất ???????????? có hiệu suất thực thi tốt hơn thuật toán ???????????????? về thời gian thực thi và bộ nhớ sử dụng

1. Đọc trực tuyến

1. Đọc trực tuyến

Tạo bộ sưu tập với mã QR