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 |
---|
id |
oai:scholar.dlu.edu.vn:123456789-2712 |
---|---|
record_format |
dspace |
spelling |
oai:scholar.dlu.edu.vn:123456789-27122023-06-14T17:20:18Z An efficient lattice-based approach for generator mining Phạm, Quang Huy Truong, Chi Tin frequent itemset mining generators closed frequent itemsets lattice-based algorithm 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. 4 16 742-751 2023-06-14T17:20:10Z 2023-06-14T17:20:10Z 2014 Journal article Bài báo đăng trên tạp chí quốc tế (có ISSN), bao gồm book chapter https://scholar.dlu.edu.vn/handle/123456789/2712 en International Journal of Advanced Computer Research 2249-7277 |
institution |
Thư viện Trường Đại học Đà Lạt |
collection |
Thư viện số |
language |
English |
topic |
frequent itemset mining generators closed frequent itemsets lattice-based algorithm |
spellingShingle |
frequent itemset mining generators closed frequent itemsets lattice-based algorithm Phạm, Quang Huy Truong, Chi Tin An efficient lattice-based approach for generator mining |
description |
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. |
format |
Journal article |
author |
Phạm, Quang Huy Truong, Chi Tin |
author_facet |
Phạm, Quang Huy Truong, Chi Tin |
author_sort |
Phạm, Quang Huy |
title |
An efficient lattice-based approach for generator mining |
title_short |
An efficient lattice-based approach for generator mining |
title_full |
An efficient lattice-based approach for generator mining |
title_fullStr |
An efficient lattice-based approach for generator mining |
title_full_unstemmed |
An efficient lattice-based approach for generator mining |
title_sort |
efficient lattice-based approach for generator mining |
publishDate |
2023 |
url |
https://scholar.dlu.edu.vn/handle/123456789/2712 |
_version_ |
1778233931211997184 |