Hai V. Duong
Orcid: 0000-0002-4065-8566
According to our database1,
Hai V. Duong
authored at least 29 papers
between 2011 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
CG-FHAUI: an efficient algorithm for simultaneously mining succinct pattern sets of frequent high average utility itemsets.
Knowl. Inf. Syst., September, 2024
Efficient algorithms to mine concise representations of frequent high utility occupancy patterns.
Appl. Intell., March, 2024
Knowl. Based Syst., 2024
2023
Efficient mining of concise and informative representations of frequent high utility itemsets.
Eng. Appl. Artif. Intell., November, 2023
Proceedings of the International Conference on Computing and Communication Technologies, 2023
MFG-HUI: An Efficient Algorithm for Mining Frequent Generators of High Utility Itemsets.
Proceedings of the Integrated Uncertainty in Knowledge Modelling and Decision Making, 2023
Controlling LIME Kernel Width to Achieve Comprehensible Explanations on Tabular Data.
Proceedings of the Integrated Uncertainty in Knowledge Modelling and Decision Making, 2023
2022
Knowl. Based Syst., 2022
Appl. Intell., 2022
Frequent high minimum average utility sequence mining with constraints in dynamic databases using efficient pruning strategies.
Appl. Intell., 2022
Proceedings of the Database Systems for Advanced Applications. DASFAA 2022 International Workshops, 2022
2021
Inf. Sci., 2021
Proceedings of the 13th International Conference on Knowledge and Systems Engineering, 2021
2020
Fast generation of sequential patterns with item constraints from concise representations.
Knowl. Inf. Syst., 2020
Inf. Sci., 2020
2019
Efficient Vertical Mining of High Average-Utility Itemsets Based on Novel Upper-Bounds.
IEEE Trans. Knowl. Data Eng., 2019
Efficient high average-utility itemset mining using novel vertical weak upper-bounds.
Knowl. Based Syst., 2019
FMaxCloHUSM: An efficient algorithm for mining frequent closed and maximal high utility sequences.
Eng. Appl. Artif. Intell., 2019
An Explicit Relationship Between Sequential Patterns and Their Concise Representations.
Proceedings of the Big Data Analytics - 7th International Conference, 2019
2018
Efficient algorithms for simultaneously mining concise representations of sequential patterns based on extended pruning conditions.
Eng. Appl. Artif. Intell., 2018
2017
FCloSM, FGenSM: two efficient algorithms for mining frequent closed and generator sequences using the local pruning strategy.
Knowl. Inf. Syst., 2017
2016
Vietnam. J. Comput. Sci., 2016
2015
An efficient method for mining association rules based on minimum single constraints.
Vietnam. J. Comput. Sci., 2015
2014
Eng. Appl. Artif. Intell., 2014
2013
Proceedings of the Advanced Computational Methods for Knowledge Engineering, 2013
2012
Proceedings of the 2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future (RIVF), Ho Chi Minh City, Vietnam, February 27, 2012
Proceedings of the PRICAI 2012: Trends in Artificial Intelligence, 2012
2011
Proceedings of the Third International Conference on Knowledge and Systems Engineering, 2011