H-FHAUI: Hiding Frequent High Average Utility Itemsets

Yazar: Lê, Hoài Bắc, Trương, Chí Tín, Dương, Văn Hải, Philippe Fournier-Viger, Fujita Hamido
Baskı/Yayın Bilgisi 2023

Mining interesting sequences with low average cost and high average utility

Yazar: Trương, Chí Tín, Dương, Văn Hải, Lê, Hoài Bắc, Philippe Fournier-Viger, Unil Yun
Baskı/Yayın Bilgisi 2023

Frequent high minimum average utility sequence mining with constraints in dynamic databases using efficient pruning strategies

Yazar: Trương, Chí Tín, Dương, Văn Hải, Lê, Hoài Bắc, Philippe Fournier-Viger, Unil Yun
Baskı/Yayın Bilgisi 2023

Efficient algorithms for mining frequent high utility sequences with constraints

Yazar: Trương, Chí Tín, Dương, Văn Hải, Lê, Hoài Bắc, Philippe Fournier-Viger, Unil Yun, Hamido Fujita
Baskı/Yayın Bilgisi 2023

EHUSM: Mining High Utility Sequences with a Pessimistic Utility Model

Yazar: Philippe Fournier-Viger, Trương, Chí Tín, Trần, Ngọc Anh, Dương, Văn Hải, Lê, Hoài Bắc
Baskı/Yayın Bilgisi 2023

Efficient high average-utility itemset mining using novel vertical weak upper-bounds

Yazar: Trương, Chí Tín, Dương, Văn Hải, Lê, Hoài Bắc, Philippe Fournier-Viger, Unil Yun
Baskı/Yayın Bilgisi 2023

FMaxCloHUSM: An efficient algorithm for mining frequent closed and maximal high utility sequences

Yazar: Trương, Chí Tín, Dương, Văn Hải, Lê, Hoài Bắc, Philippe Fournier-Viger
Baskı/Yayın Bilgisi 2023

HUPSMT: An efficient algorithm for mining high utility-probability sequences in uncertain databases with multiple minimum utility thresholds

Yazar: Trương, Chí Tín, Trần, Ngọc Anh, Dương, Văn Hải
Baskı/Yayın Bilgisi 2023

Fast generation of sequential patterns with item constraints from concise representations

Yazar: Dương, Văn Hải, Trương, Chí Tín, Trần, Ngọc Anh, Bac Le
Baskı/Yayın Bilgisi 2021

FCloSM, FGenSM: two efficient algorithms for mining frequent closed and generator sequences using the local pruning strategy

Yazar: Lê, Hoài Bắc, Dương, Văn Hải, Trương, Chí Tín, Philippe Fournier-Viger
Baskı/Yayın Bilgisi 2023

Structure of frequent itemsets with extended double constraints

Yazar: Trương, Chí Tín, Dương, Văn Hải, Hoàng, Thị Thùy Ngân
Baskı/Yayın Bilgisi 2023

An efficient method for mining association rules based on minimum single constraints

Yazar: Dương, Văn Hải, Trương, Chí Tín
Baskı/Yayın Bilgisi 2023

An efficient method for mining frequent itemsets with double constraints

Yazar: Dương, Văn Hải, Trương, Chí Tín, Võ, Đình Bảy
Baskı/Yayın Bilgisi 2023

An efficient algorithm for mining frequent item-sets containing a constraint subset

Yazar: Dương, Văn Hải, Trương, Chí Tín
Baskı/Yayın Bilgisi 2023

Efficient algorithms for simultaneously mining concise representations of sequential patterns based on extended pruning conditions

Yazar: Dương, Văn Hải, Trương, Chí Tín, Lê, Hoài Bắc
Baskı/Yayın Bilgisi 2023

Efficient vertical mining of high average-utility itemsets based on novel upper-bounds

Yazar: Trương, Chí Tín, Dương, Văn Hải, Lê, Hoài Bắc, Philippe Fournier-Viger
Baskı/Yayın Bilgisi 2023

Efficient algorithms for mining closed and maximal high utility itemsets

Yazar: Dương, Văn Hải, Ngan T. H. Le, Trần, Thống, Tin C. Truong, Bac Le, Philippe Fournier
Baskı/Yayın Bilgisi 2023

Efficient Algorithms to Mine Concise Representations of Frequent High Utility Occupancy Patterns

Yazar: Dương, Văn Hải, Phạm, Quang Huy, Trương, Chí Tín, Philippe, Fournier-Viger
Baskı/Yayın Bilgisi 2024

Mining Interesting Sequential Patterns using a Novel Balanced Utility Measure

Yazar: Dương, Văn Hải, Trương, Chí Tín, Lê, Hoài Bắc, Philippe, Fournier-Viger
Baskı/Yayın Bilgisi 2024

MFS-SubSC: An Efficient Algorithm for Mining Frequent Sequences with Sub-Sequence Constraint (To Appear)

Yazar: Dương, Văn Hải, Trần, Ngọc Anh
Baskı/Yayın Bilgisi 2024