An efficient lattice-based approach for generator mining
Mining frequent closed itemsets and theirs corresponding generators seem to be the most effective way to mine frequent itemsets and association rules from large datasets since it helps reduce the risks of low performance, big storage and redundancy. However, generator mining has not been studi...
Đã lưu trong:
| Những tác giả chính: | , |
|---|---|
| Định dạng: | Journal article |
| Ngôn ngữ: | English |
| Được phát hành: |
2023
|
| Những chủ đề: | |
| Truy cập trực tuyến: | https://scholar.dlu.edu.vn/handle/123456789/2712 |
| Các nhãn: |
Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
| Tóm tắt: | Mining frequent closed itemsets and theirs
corresponding generators seem to be the most
effective way to mine frequent itemsets and
association rules from large datasets since it helps
reduce the risks of low performance, big storage
and redundancy. However, generator mining has
not been studied as much as frequent closed
itemsets mining and it has not reached the ultraoptimization yet. In this paper, we consider the
problem of enumerating generators from the lattice
of frequent closed itemsets as the problem of
“distributing M machines to solve N jobs” in order
to introduce a close and legible point of view. From
this, it is easy to infer some interesting
mathematical results to solve the problem easily.
Our proposed algorithm, GDP, can efficiently find
all generators in very low complexity without
duplicated or useless consideration. Experiments
show that our approach is reasonable and effective. |
|---|