An Efficient Algorithm for Mining Frequent High Utility Occupancy Generators

Mã QR

An Efficient Algorithm for Mining Frequent High Utility Occupancy Generators

101 - 109

Đã lưu trong:

Sonraí Bibleagrafaíochta
Những tác giả chính:	Dương, Văn Hải, Trương, Chí Tín
Formáid:	Conference paper
Teanga:	English
Foilsithe:	ACM 2025
Rochtain Ar Líne:	https://scholar.dlu.edu.vn/handle/123456789/4719
Clibeanna:	Cuir Clib Leis Gan Chlibeanna, Bí ar an gcéad duine leis an taifead seo a chlibeáil!

Thư viện lưu trữ:	Thư viện Trường Đại học Đà Lạt

Míreanna Comhchosúla

Efficient Algorithms to Mine Concise Representations of Frequent High Utility Occupancy Patterns
le: Dương, Văn Hải, et al.
Foilsithe: (2024)

MFG-HUI: An Efficient Algorithm for Mining Frequent Generators of High Utility Itemsets
le: Dương, Văn Hải, et al.
Foilsithe: (2024)

MFG-HUI: An Efficient Algorithm for Mining Frequent Generators of High Utility Itemsets
le: Dương, Văn Hải, et al.
Foilsithe: (2024)

Mining concise representations of frequent high utility occupancy itemsets using generator patterns
le: Dương, Văn Hải, et al.
Foilsithe: (2025)

Efficient algorithms for mining frequent high utility sequences with constraints
le: Trương, Chí Tín, et al.
Foilsithe: (2023)

Efficient Mining of Concise Patterns for Frequent High-Utility Occupancy Itemsets Using Extended Pruning Strategies
le: Hoàng, Minh Tiến, et al.
Foilsithe: (2025)

FMaxCloHUSM: An efficient algorithm for mining frequent closed and maximal high utility sequences
le: Trương, Chí Tín, et al.
Foilsithe: (2023)

Efficient mining of concise and informative representations of frequent high utility itemsets
le: Trần, Thống, et al.
Foilsithe: (2024)

Efficient mining of concise and informative representations of frequent high utility itemsets
le: Trần, Thống, et al.
Foilsithe: (2024)

CG-FHAUI: An efficient algorithm for simultaneously mining succinct pattern sets of frequent high average utility itemsets
le: Dương, Văn Hải, et al.
Foilsithe: (2024)

Efficient algorithms for mining frequent itemsets with constraint
le: Trần, Ngọc Anh, et al.
Foilsithe: (2023)

An efficient parallel algorithm for mining both frequent closed and generator sequences on multi-core processors
le: Dương, Văn Hải, et al.
Foilsithe: (2023)

An efficient algorithm for mining frequent itemsets with single constraint
le: Dương, Văn Hải, et al.
Foilsithe: (2023)

EHAUSM: An efficient algorithm for high average utility sequence mining
le: Trương, Chí Tín, et al.
Foilsithe: (2024)

Efficient algorithms for mining closed and maximal high utility itemsets
le: Dương, Văn Hải, et al.
Foilsithe: (2025)

Efficient Algorithms for Mining Closed and Maximal High Utility Itemsets
le: Dương, Văn Hải, et al.
Foilsithe: (2023)

An efficient algorithm for mining frequent itemsets containing a constraint subset
le: Duong, Van Hai, et al.
Foilsithe: (2014)

Efficient algorithms for mining closed and maximal high utility itemsets
le: Dương, Văn Hải, et al.
Foilsithe: (2023)

Frequent high minimum average utility sequence mining with constraints in dynamic databases using efficient pruning strategies
le: Trương, Chí Tín, et al.
Foilsithe: (2023)

Efficient Algorithms for Mining Closed and Maximal High Utility Itemsets
le: Dương, Văn Hải, et al.
Foilsithe: (2024)

Efficient algorithms for mining closed and maximal high utility itemsets
le: Hoàng, Minh Tiến, et al.
Foilsithe: (2024)

An efficient algorithm for mining frequent item-sets containing a constraint subset
le: Dương, Văn Hải, et al.
Foilsithe: (2023)

NUCLEAR: An Efficient Method for Mining Frequent Itemsets and Generators from Closed Frequent Itemsets
le: Phạm, Quang Huy, et al.
Foilsithe: (2023)

HUPSMT: An efficient algorithm for mining high utility-probability sequences in uncertain databases with multiple minimum utility thresholds
le: Trương, Chí Tín, et al.
Foilsithe: (2023)

FCloSM, FGenSM: two efficient algorithms for mining frequent closed and generator sequences using the local pruning strategy
le: Lê, Hoài Bắc, et al.
Foilsithe: (2023)

An efficient algorithm for mining frequent itemsets containing a constraint subset /
le: Van Hai Duong.

An efficient method for mining frequent itemsets with double constraints
le: Dương, Văn Hải, et al.
Foilsithe: (2023)

MFS-SubSC: An Efficient Algorithm for Mining Frequent Sequences with Sub-Sequence Constraint
le: Dương, Văn Hải, et al.
Foilsithe: (2024)

H-FHAUI: Hiding Frequent High Average Utility Itemsets
le: Lê, Hoài Bắc, et al.
Foilsithe: (2023)

Efficient vertical mining of high average-utility itemsets based on novel upper-bounds
le: Trương, Chí Tín, et al.
Foilsithe: (2023)

Efficient high average-utility itemset mining using novel vertical weak upper-bounds
le: Trương, Chí Tín, et al.
Foilsithe: (2023)

An efficient lattice-based approach for generator mining
le: Phạm, Quang Huy, et al.
Foilsithe: (2023)

Mining High Utility Sequences with a Novel Utility Function
le: Huỳnh, Hanh Thông, et al.
Foilsithe: (2023)

EHUSM: Mining High Utility Sequences with a Pessimistic Utility Model
le: Philippe Fournier-Viger, et al.
Foilsithe: (2023)

Mining frequent itemsets with dualistic constraints
le: Trần, Ngọc Anh, et al.
Foilsithe: (2023)

Nuclear: An efficient method for mining frequent itemsets based on kernels and extendable sets
le: Phạm, Quang Huy, et al.
Foilsithe: (2023)

Approximate high utility itemset mining in noisy environments
le: Yoonji Baek, et al.
Foilsithe: (2021)

Mining interesting sequences with low average cost and high average utility
le: Trương, Chí Tín, et al.
Foilsithe: (2023)

High Average-Utility Itemset Mining with A Novel Vertical Weak Upper Bound
le: Trần, Thống, et al.
Foilsithe: (2024)

High Average-Utility Itemset Mining with A Novel Vertical Weak Upper Bound
le: Trần, Thống, et al.
Foilsithe: (2024)