Hai V. Duong

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 19

Top Topics

Top Venues

Eng. Appl. Artif. Intell.

Knowl. Based Syst.

Publications

Hai V. Duong, Tin C. Truong, Bac Le, Philippe Fournier-Viger
Mining Interesting Sequential Patterns using a Novel Balanced Utility Measure. Knowl. Based Syst. 294 (2024)
Hai V. Duong, Huy Pham, Tin C. Truong, Philippe Fournier-Viger
Efficient algorithms to mine concise representations of frequent high utility occupancy patterns. Appl. Intell. 54 (5) (2024)
Thong Tran, Hai V. Duong, Tin C. Truong, Anh N. Tran
High Average-Utility Itemset Mining with A Novel Vertical Weak Upper Bound. RIVF (2023)
Thong Tran, Hai V. Duong, Tin C. Truong, Bac Le
Efficient mining of concise and informative representations of frequent high utility itemsets. Eng. Appl. Artif. Intell. 126 (Part D) (2023)
Hai V. Duong, Thong Tran, Tin C. Truong, Bac Le
MFG-HUI: An Efficient Algorithm for Mining Frequent Generators of High Utility Itemsets. IUKM (2) (2023)
Hai V. Duong, Ngan T. H. Le, Thong Tran, Tin C. Truong, Bac Le, Philippe Fournier-Viger
Efficient algorithms for mining closed and maximal high utility itemsets. Knowl. Based Syst. 257 (2022)
Bac Le, Tin C. Truong, Hai V. Duong, Philippe Fournier-Viger, Hamido Fujita
H-FHAUI: Hiding frequent high average utility itemsets. Inf. Sci. 611 (2022)
Tin C. Truong, Hai V. Duong, Bac Le, Philippe Fournier-Viger, Unil Yun
Mining interesting sequences with low average cost and high average utility. Appl. Intell. 52 (7) (2022)
Tin C. Truong, Hai V. Duong, Bac Le, Philippe Fournier-Viger, Unil Yun
Frequent high minimum average utility sequence mining with constraints in dynamic databases using efficient pruning strategies. Appl. Intell. 52 (6) (2022)
Hanh-Thong Huynh, Hai V. Duong, Tin C. Truong, Bac Le, Philippe Fournier-Viger
Mining High Utility Sequences with a Novel Utility Function. KSE (2021)
Tin C. Truong, Hai V. Duong, Bac Le, Philippe Fournier-Viger, Unil Yun, Hamido Fujita
Efficient algorithms for mining frequent high utility sequences with constraints. Inf. Sci. 568 (2021)
Tin C. Truong, Hai V. Duong, Bac Le, Philippe Fournier-Viger
EHAUSM: An efficient algorithm for high average utility sequence mining. Inf. Sci. 515 (2020)
Hai V. Duong, Tin C. Truong, Anh N. Tran, Bac Le
Fast generation of sequential patterns with item constraints from concise representations. Knowl. Inf. Syst. 62 (6) (2020)
Tin C. Truong, Hai V. Duong, Bac Le, Philippe Fournier-Viger
Efficient Vertical Mining of High Average-Utility Itemsets Based on Novel Upper-Bounds. IEEE Trans. Knowl. Data Eng. 31 (2) (2019)
Tin C. Truong, Hai V. Duong, Bac Le, Philippe Fournier-Viger
FMaxCloHUSM: An efficient algorithm for mining frequent closed and maximal high utility sequences. Eng. Appl. Artif. Intell. 85 (2019)
Tin C. Truong, Hai V. Duong, Bac Le, Philippe Fournier-Viger, Unil Yun
Efficient high average-utility itemset mining using novel vertical weak upper-bounds. Knowl. Based Syst. 183 (2019)
Hai V. Duong, Tin C. Truong, Bac Le, Philippe Fournier-Viger
An Explicit Relationship Between Sequential Patterns and Their Concise Representations. BDA (2019)
Hai V. Duong, Tin C. Truong, Bac Le
Efficient algorithms for simultaneously mining concise representations of sequential patterns based on extended pruning conditions. Eng. Appl. Artif. Intell. 67 (2018)
Bac Le, Hai V. Duong, Tin C. Truong, Philippe Fournier-Viger
FCloSM, FGenSM: two efficient algorithms for mining frequent closed and generator sequences using the local pruning strategy. Knowl. Inf. Syst. 53 (1) (2017)
Hai V. Duong, Tin C. Truong, Bay Vo
An efficient method for mining frequent itemsets with double constraints. Eng. Appl. Artif. Intell. 27 (2014)
Anh N. Tran, Hai V. Duong, Tin C. Truong, Bac Le
Mining Frequent Itemsets with Dualistic Constraints. PRICAI (2012)
Anh N. Tran, Tin C. Truong, Bac Hoai Le, Hai V. Duong
Mining Association Rules Restricted on Constraint. RIVF (2012)
Anh N. Tran, Hai V. Duong, Tin C. Truong, Bac Hoai Le
Efficient Algorithms for Mining Frequent Itemsets with Constraint. KSE (2011)