default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTrinh D. D. Nguyen
Person information
Other persons with a similar name
- Nghiep Trinh Nguyen Dang
- Thi Tuyet Trinh Nguyen
- Thuy-Trinh Nguyen
- Trinh Nguyen
- Trinh-Dong Nguyen
- Trinh-Trung-Duong Nguyen
- Trinh Hoang Nguyen
- Trinh T. Nguyen
- Tu-Trinh T. Nguyen
![[0000-0002-2986-094X]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-2986-094X")
(aka: Tu-Trinh Thi Nguyen) - Bao Nguyen Trinh (aka: Bao Trinh Nguyen)
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Bao Huynh, N. T. Tung, Trinh D. D. Nguyen, Cuong Trinh, Václav Snásel, Loan T. T. Nguyen:
New approaches for mining high utility itemsets with multiple utility thresholds. Appl. Intell. 54(11-12): 767-790 (2024)- [j13]Bao Huynh, Lam B. Q. Nguyen, Duc H. M. Nguyen, Ngoc Thanh Nguyen, Hung Son Nguyen, Tuyn Pham, Tri Pham, Loan T. T. Nguyen, Trinh D. D. Nguyen, Bay Vo:
Mining Association Rules from a Single Large Graph. Cybern. Syst. 55(3): 693-707 (2024) - [j12]N. T. Tung, Trinh D. D. Nguyen, Loan T. T. Nguyen, Bay Vo:
An efficient method for mining High-Utility itemsets from unstable negative profit databases. Expert Syst. Appl. 237(Part C): 121489 (2024) - [j11]Trinh D. D. Nguyen, N. T. Tung, Loan T. T. Nguyen, Thiet T. Pham, Bay Vo:
MLC-miner: Efficiently discovering multi-level closed high utility patterns from quantitative hierarchical transaction databases. Expert Syst. Appl. 254: 124383 (2024) - [j10]Bao Huynh, N. T. Tung, Trinh D. D. Nguyen, Quang-Thinh Bui, Loan T. T. Nguyen, Unil Yun, Bay Vo:
An efficient strategy for mining high-efficiency itemsets in quantitative databases. Knowl. Based Syst. 299: 112035 (2024) - [c6]Trinh D. D. Nguyen, N. T. Tung, Loan T. T. Nguyen, Bay Vo:
Efficiently Discover Multi-level Maximal High-Utility Patterns from Hierarchical Databases. ICCCI (1) 2024: 382-393 - 2023
- [j9]Trinh D. D. Nguyen, N. T. Tung, Thiet Pham, Loan T. T. Nguyen:
Parallel approaches to extract multi-level high utility itemsets from hierarchical transaction databases. Knowl. Based Syst. 276: 110733 (2023) - [c5]Tuan M. Le, Trinh D. D. Nguyen, Loan T. T. Nguyen, Adrianna Kozierkiewicz, N. T. Tung:
Extracting Top-k High Utility Patterns from Multi-level Transaction Databases. ACIIDS (1) 2023: 296-306 - [c4]Loan T. T. Nguyen, Anh N. H. Pham, Trinh D. D. Nguyen, Adrianna Kozierkiewicz, Bay Vo, N. T. Tung:
Efficient Pruning Strategy for Mining High Utility Quantitative Itemsets. ICCCI (CCIS Volume) 2023: 326-338 - 2022
- [j8]N. T. Tung, Loan T. T. Nguyen, Trinh D. D. Nguyen, Bay Vo:
An efficient method for mining multi-level high utility Itemsets. Appl. Intell. 52(5): 5475-5496 (2022) - [j7]N. T. Tung, Loan T. T. Nguyen, Trinh D. D. Nguyen, Philippe Fournier-Viger, Ngoc Thanh Nguyen, Bay Vo:
Efficient mining of cross-level high-utility itemsets in taxonomy quantitative databases. Inf. Sci. 587: 41-62 (2022) - 2021
- [j6]Trinh D. D. Nguyen, Loan T. T. Nguyen, Lung Vu, Bay Vo, Witold Pedrycz:
Efficient algorithms for mining closed high utility itemsets in dynamic profit databases. Expert Syst. Appl. 186: 115741 (2021) - [c3]Trinh D. D. Nguyen, Loan T. T. Nguyen, Adrianna Kozierkiewicz, Thiet Pham, Bay Vo:
An Efficient Approach for Mining High-Utility Itemsets from Multiple Abstraction Levels. ACIIDS 2021: 92-103 - [c2]N. T. Tung, Loan T. T. Nguyen, Trinh D. D. Nguyen, Adrianna Kozierkiewicz:
Cross-Level High-Utility Itemset Mining Using Multi-core Processing. ICCCI 2021: 467-479 - 2020
- [j5]Bay Vo, Loan T. T. Nguyen, Nguyen Bui, Trinh D. D. Nguyen, Van-Nam Huynh, Tzung-Pei Hong:
An Efficient Method for Mining Closed Potential High-Utility Itemsets. IEEE Access 8: 31813-31822 (2020) - [j4]Bay Vo, Loan T. T. Nguyen, Trinh D. D. Nguyen, Philippe Fournier-Viger, Unil Yun:
A Multi-Core Approach to Efficiently Mining High-Utility Itemsets in Dynamic Profit Databases. IEEE Access 8: 85890-85899 (2020) - [j3]Thanh-Ngo Nguyen, Loan T. T. Nguyen, Bay Vo, Ngoc Thanh Nguyen, Trinh D. D. Nguyen:
An N-List-Based Approach for Mining Frequent Inter-Transaction Patterns. IEEE Access 8: 116840-116855 (2020) - [j2]Loan T. T. Nguyen, Dinh-Bao Vu, Trinh D. D. Nguyen, Bay Vo:
Mining Maximal High Utility Itemsets on Dynamic Profit Databases. Cybern. Syst. 51(2): 140-160 (2020) - [c1]Nguyen Thi Thuy Loan, Trinh D. D. Nguyen, Anh Nguyen, Phuoc-Nghia Tran, Cuong Trinh, Bao Huynh, Bay Vo:
Efficient Method for Mining High-Utility Itemsets Using High-Average Utility Measure. ICCCI 2020: 305-315
2010 – 2019
- 2019
- [j1]Loan T. T. Nguyen, Phuc Nguyen, Trinh D. D. Nguyen, Bay Vo, Philippe Fournier-Viger, Vincent S. Tseng:
Mining high-utility itemsets in dynamic profit databases. Knowl. Based Syst. 175: 130-144 (2019)
Coauthor Index
aka: Nguyen Thi Thuy Loan
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 2025-03-04 22:33 CET 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:
