|
| Issue Date | Title | Author(s) | Type |
| 2025 | Các phương pháp nâng cao trong khai thác mẫu thú vị trên cơ sở dữ liệu lượng hóa | Dương, Văn Hải | Đề tài Nafosted |
| 2024 | CG-FHAUI: An efficient algorithm for simultaneously mining succinct pattern sets of frequent high average utility itemsets | Dương, Văn Hải ; Trương, Chí Tín ; Lê, Hoài Bắc; Philippe, Fournier-Viger | Journal article |
| 2013 | An efficient algorithm for mining frequent item-sets containing a constraint subset | Dương, Văn Hải ; Trương, Chí Tín | Journal article |
| 2013 | An efficient algorithm for mining frequent itemsets with single constraint | Dương, Văn Hải ; Trương, Chí Tín; Lê, Hoài Bắc | Conference paper |
| 2022 | Efficient algorithms for mining closed and maximal high utility itemsets | Dương, Văn Hải ; Hoàng, Minh Tiến ; Trần, Thống ; Trương, Chí Tín ; Lê, Hoài Bắc | Journal article |
| 2021 | Efficient algorithms for mining frequent high utility sequences with constraints | Trương, Chí Tín; Dương, Văn Hải ; Lê, Hoài Bắc; Philippe Fournier-Viger; Unil Yun; Hamido Fujita | Journal article |
| 2011 | Efficient algorithms for mining frequent itemsets with constraint | Trần, Ngọc Anh; Dương, Văn Hải ; Trương, Chí Tín; Lê, Hoài Bắc | Conference paper |
| 2018 | Efficient algorithms for simultaneously mining concise representations of sequential patterns based on extended pruning conditions | Dương, Văn Hải ; Trương, Chí Tín; Lê, Hoài Bắc | Journal article |
| 2024 | Efficient Algorithms to Mine Concise Representations of Frequent High Utility Occupancy Patterns | Dương, Văn Hải ; Phạm, Quang Huy ; Trương, Chí Tín ; Philippe, Fournier-Viger | Journal article |
| 2019 | Efficient high average-utility itemset mining using novel vertical weak upper-bounds | Trương, Chí Tín; Dương, Văn Hải ; Lê, Hoài Bắc; Philippe Fournier-Viger; Unil Yun | Journal article |
| 2015 | An efficient method for mining association rules based on minimum single constraints | Dương, Văn Hải ; Trương, Chí Tín | Journal article |
| 2014 | An efficient method for mining frequent itemsets with double constraints | Dương, Văn Hải ; Trương, Chí Tín; Võ, Đình Bảy | Journal article |
| 2023 | Efficient mining of concise and informative representations of frequent high utility itemsets | Trần, Thống ; Dương, Văn Hải ; Trương, Chí Tín ; Lê, Hoài Bắc | Journal article |
| 2023-09 | Efficient mining of concise and informative representations of frequent high utility itemsets | Trần, Thống ; Dương, Văn Hải ; Lê, Hoài Bắc; Trương, Chí Tín | Journal article |
| 2018 | An efficient parallel algorithm for mining both frequent closed and generator sequences on multi-core processors | Dương, Văn Hải ; Trương, Chí Tín; Lê, Hoài Bắc | Conference paper |
| 2019 | Efficient vertical mining of high average-utility itemsets based on novel upper-bounds | Trương, Chí Tín; Dương, Văn Hải ; Lê, Hoài Bắc; Philippe Fournier-Viger | Journal article |
| 2020 | EHAUSM: An efficient algorithm for high average utility sequence mining | Trương, Chí Tín ; Dương, Văn Hải ; Lê, Hoài Bắc; Philippe, Fournier-Viger | Journal article |
| 2020 | EHUSM: Mining High Utility Sequences with a Pessimistic Utility Model | Philippe Fournier-Viger; Trương, Chí Tín; Trần, Ngọc Anh; Dương, Văn Hải ; Lê, Hoài Bắc | Journal article |
| 2019 | An Explicit Relationship between Sequential Patterns and their Concise Representations | Dương, Văn Hải ; Trương, Chí Tín; Lê, Hoài Bắc; Philippe Fournier-Viger | Conference paper |
| 2020-11 | Fast generation of sequential patterns with item constraints from concise representations | Dương, Văn Hải ; Trương, Chí Tín ; Trần, Ngọc Anh ; Bac Le | Journal article |
