Huy Vo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Huy Vo has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Nguyen Le
Faculty of Information Technology, Ton Duc Thang University, Ho Chi Minh City, Vietnam
2 shared publications - Thien Nguyen
Natural Language Processing and Knowledge Discovery Research Group, Faculty of Information Technology, Ton Duc Thang University, Ho Chi Minh City, Vietnam
2 shared publications
Latest Publications
- Open Access
- 19 October 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (9) , 929
Exact and heuristic approaches for mining top-k high-utility itemsets in uncertain databases with mixed utilities
- 19 October 2026
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (9) , 929
Open AccessExact and heuristic approaches for mining top-k high-utility itemsets in uncertain databases with mixed utilities
- Open Access
- 17 June 2026
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 21 (6) , e0351951
Best-first search–based approach for mining top-k closed frequent itemsets from uncertain databases
Uncertain data mining has become critical due to data generated by sensor networks, RFID systems, and data integration platforms. Mining top-k closed frequent itemsets from uncertain databases is particularly challenging because probabilistic support evaluation is expensive and the search space grows exponentially. Most existing methods rely on depth-first search (DFS) traversal, which explores candidates in enumeration order and often discovers high-support patterns late, leading to weak pruning and costly closure verification. This paper proposes TUFCI, a best-first-search-based algorithm for mining top-k closed frequent itemsets from uncertain databases. TUFCI explores candidates in descending order of probabilistic support using a priority queue, enabling early discovery of strong patterns, rapid threshold elevation, and safe early termination. Support-ordered exploration also improves closure checking by prioritizing supersets most likely to violate the closure property, thereby reducing redundant superset examinations. Experimental results demonstrate that TUFCI significantly outperforms DFS-based approaches in runtime and reduces the number of closure checks, especially on dense datasets.
- 17 June 2026
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 21 (6) , e0351951
Open AccessBest-first search–based approach for mining top-k closed frequent itemsets from uncertain databases
Uncertain data mining has become critical due to data generated by sensor networks, RFID systems, and data integration platforms. Mining top-k closed frequent itemsets from uncertain databases is particularly challenging because probabilistic support evaluation is expensive and the search space grows exponentially. Most existing methods rely on depth-first search (DFS) traversal, which explores candidates in enumeration order and often discovers high-support patterns late, leading to weak pruning and costly closure verification. This paper proposes TUFCI, a best-first-search-based algorithm for mining top-k closed frequent itemsets from uncertain databases. TUFCI explores candidates in descending order of probabilistic support using a priority queue, enabling early discovery of strong patterns, rapid threshold elevation, and safe early termination. Support-ordered exploration also improves closure checking by prioritizing supersets most likely to violate the closure property, thereby reducing redundant superset examinations. Experimental results demonstrate that TUFCI significantly outperforms DFS-based approaches in runtime and reduces the number of closure checks, especially on dense datasets.