KHAI THÁC TẬP MỤC LỢI ÍCH CAO CÓ LỢI NHUẬN ÂM TRONG CƠ SỞ DỮ LIỆU PHÂN TÁN DỌC
High Utility Itemset (HUI) mining is an important problem in the data mining literature that considers the utilities for businesses of items (such as profits and margins) that are discovered from transactional databases. There are many algorithms for mining high utility itemsets (HUIs) by pruning ca...
Сохранить в:
| Главные авторы: | , , |
|---|---|
| Формат: | Статья |
| Язык: | Vietnamese |
| Опубликовано: |
Trường Đại học Đà Lạt
2023
|
| Online-ссылка: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/114368 https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/666 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
| Итог: | High Utility Itemset (HUI) mining is an important problem in the data mining literature that considers the utilities for businesses of items (such as profits and margins) that are discovered from transactional databases. There are many algorithms for mining high utility itemsets (HUIs) by pruning candidates based on estimated and transaction-weighted utilization values. These algorithms aim to reduce the search space. In this paper, we propose a method for mining HUIs with negative unit profits from vertically distributed databases. This method does not integrate databases from the relevant local databases to form a centralized database. Experiments show that the run-time of this method is more efficient than that of the centralized database. |
|---|