default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHai V. Duong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]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): 4012-4042 (2024)- [j18]Hai Van Duong, Tin Chi Truong, Bac Le, Philippe Fournier-Viger:
CG-FHAUI: an efficient algorithm for simultaneously mining succinct pattern sets of frequent high average utility itemsets. Knowl. Inf. Syst. 66(9): 5239-5280 (2024) - [j17]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: 111796 (2024) - 2023
- [j16]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): 107111 (2023) - [c9]Hai V. Duong, Lam Hoang, Bac Le:
Controlling LIME Kernel Width to Achieve Comprehensible Explanations on Tabular Data. IUKM (2) 2023: 153-164 - [c8]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: 267-280 - [c7]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: 342-347 - 2022
- [j15]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): 6106-6128 (2022) - [j14]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): 7136-7157 (2022) - [j13]Bac Le, Tin C. Truong, Hai V. Duong, Philippe Fournier-Viger, Hamido Fujita:
H-FHAUI: Hiding frequent high average utility itemsets. Inf. Sci. 611: 408-431 (2022) - [j12]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: 109921 (2022) - [c6]Philippe Fournier-Viger, Wensheng Gan, Youxi Wu, Mourad Nouioua, Wei Song, Tin C. Truong, Hai Van Duong:
Pattern Mining: Current Challenges and Opportunities. DASFAA (Workshops) 2022: 34-49 - 2021
- [j11]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: 239-264 (2021) - [c5]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: 1-6 - 2020
- [j10]Tin C. Truong, Hai V. Duong, Bac Le, Philippe Fournier-Viger:
EHAUSM: An efficient algorithm for high average utility sequence mining. Inf. Sci. 515: 302-323 (2020) - [j9]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): 2191-2223 (2020)
2010 – 2019
- 2019
- [j8]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: 1-20 (2019) - [j7]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) - [j6]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): 301-314 (2019) - [c4]Hai V. Duong, Tin C. Truong, Bac Le, Philippe Fournier-Viger:
An Explicit Relationship Between Sequential Patterns and Their Concise Representations. BDA 2019: 341-361 - 2018
- [j5]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: 197-210 (2018) - 2017
- [j4]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): 71-107 (2017) - 2016
- [j3]Tin Chi Truong, Hai Van Duong, Hoang Nguyen Thuy Ngan:
Structure of frequent itemsets with extended double constraints. Vietnam. J. Comput. Sci. 3(2): 119-135 (2016) - 2015
- [j2]Hai Van Duong, Tin Chi Truong:
An efficient method for mining association rules based on minimum single constraints. Vietnam. J. Comput. Sci. 2(2): 67-83 (2015) - 2014
- [j1]Hai V. Duong, Tin C. Truong, Bay Vo:
An efficient method for mining frequent itemsets with double constraints. Eng. Appl. Artif. Intell. 27: 148-154 (2014) - 2013
- [p1]Hai V. Duong, Tin C. Truong, Bac Le:
An Efficient Algorithm for Mining Frequent Itemsets with Single Constraint. Advanced Computational Methods for Knowledge Engineering 2013: 367-378 - 2012
- [c3]Anh N. Tran, Hai V. Duong, Tin C. Truong, Bac Le:
Mining Frequent Itemsets with Dualistic Constraints. PRICAI 2012: 807-813 - [c2]Anh N. Tran, Tin C. Truong, Bac Hoai Le, Hai V. Duong:
Mining Association Rules Restricted on Constraint. RIVF 2012: 1-6 - 2011
- [c1]Anh N. Tran, Hai V. Duong, Tin C. Truong, Bac Hoai Le:
Efficient Algorithms for Mining Frequent Itemsets with Constraint. KSE 2011: 19-25
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 22:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
