default search action
Tin C. Truong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j29]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) - [j28]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) - [j27]Hai V. Duong
Mining Interesting Sequential Patterns using a Novel Balanced Utility Measure. Knowl. Based Syst. 294: 111796 (2024) - 2023
- [j26]Thong Tran, Hai V. Duong
Efficient mining of concise and informative representations of frequent high utility itemsets. Eng. Appl. Artif. Intell. 126(Part D): 107111 (2023) - [c12]Hai V. Duong
MFG-HUI: An Efficient Algorithm for Mining Frequent Generators of High Utility Itemsets. IUKM (2) 2023: 267-280 - [c11]Thong Tran, Hai V. Duong
High Average-Utility Itemset Mining with A Novel Vertical Weak Upper Bound. RIVF 2023: 342-347 - 2022
- [j25]Tin C. Truong, Hai V. Duong
Frequent high minimum average utility sequence mining with constraints in dynamic databases using efficient pruning strategies. Appl. Intell. 52(6): 6106-6128 (2022) - [j24]Tin C. Truong, Hai V. Duong
Mining interesting sequences with low average cost and high average utility. Appl. Intell. 52(7): 7136-7157 (2022) - [j23]Bac Le, Tin C. Truong, Hai V. Duong
H-FHAUI: Hiding frequent high average utility itemsets. Inf. Sci. 611: 408-431 (2022) - [j22]Chanhee Lee, Yoonji Baek, Jerry Chun-Wei Lin
Advanced uncertainty based approach for discovering erasable product patterns. Knowl. Based Syst. 241: 108134 (2022) - [j21]Hai V. Duong
Efficient algorithms for mining closed and maximal high utility itemsets. Knowl. Based Syst. 257: 109921 (2022) - [c10]Philippe Fournier-Viger, Wensheng Gan, Youxi Wu, Mourad Nouioua, Wei Song
Pattern Mining: Current Challenges and Opportunities. DASFAA (Workshops) 2022: 34-49 - 2021
- [j20]Nhan Vuong, Bac Le, Tin C. Truong
Efficient algorithms for discovering high-utility patterns with strong frequency affinities. Expert Syst. Appl. 169: 114464 (2021) - [j19]Tin C. Truong, Hai V. Duong
Efficient algorithms for mining frequent high utility sequences with constraints. Inf. Sci. 568: 239-264 (2021) - [j18]Yoonji Baek, Unil Yun, Heonho Kim, Jongseong Kim, Bay Vo, Tin C. Truong, Zhi-Hong Deng:
Approximate high utility itemset mining in noisy environments. Knowl. Based Syst. 212: 106596 (2021) - [c9]Hanh-Thong Huynh, Hai V. Duong
Mining High Utility Sequences with a Novel Utility Function. KSE 2021: 1-6 - 2020
- [j17]Hyoju Nam, Unil Yun
Efficient Approach for Damped Window-Based High Utility Pattern Mining With List Structure. IEEE Access 8: 50958-50968 (2020) - [j16]Unil Yun, Hyoju Nam, Jongseong Kim, Heonho Kim, Yoonji Baek, Judae Lee, Eunchul Yoon, Tin C. Truong
Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases. Future Gener. Comput. Syst. 103: 58-78 (2020) - [j15]Tin C. Truong
EHAUSM: An efficient algorithm for high average utility sequence mining. Inf. Sci. 515: 302-323 (2020) - [j14]Hai V. Duong
Fast generation of sequential patterns with item constraints from concise representations. Knowl. Inf. Syst. 62(6): 2191-2223 (2020) - [j13]Philippe Fournier-Viger
Mining cost-effective patterns in event logs. Knowl. Based Syst. 191: 105241 (2020)
2010 – 2019
- 2019
- [j12]Tin C. Truong
FMaxCloHUSM: An efficient algorithm for mining frequent closed and maximal high utility sequences. Eng. Appl. Artif. Intell. 85: 1-20 (2019) - [j11]Tin C. Truong
Efficient high average-utility itemset mining using novel vertical weak upper-bounds. Knowl. Based Syst. 183 (2019) - [j10]Tin C. Truong
Efficient Vertical Mining of High Average-Utility Itemsets Based on Novel Upper-Bounds. IEEE Trans. Knowl. Data Eng. 31(2): 301-314 (2019) - [c8]Hai V. Duong
An Explicit Relationship Between Sequential Patterns and Their Concise Representations. BDA 2019: 341-361 - [c7]Philippe Fournier-Viger
Discovering and Visualizing Efficient Patterns in Cost/Utility Sequences. DaWaK 2019: 73-88 - 2018
- [j9]Hai V. Duong
Efficient algorithms for simultaneously mining concise representations of sequential patterns based on extended pruning conditions. Eng. Appl. Artif. Intell. 67: 197-210 (2018) - 2017
- [j8]Bac Le, Hai V. Duong
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) - [j7]Anh N. Tran
Efficiently mining association rules based on maximum single constraints. Vietnam. J. Comput. Sci. 4(4): 261-277 (2017) - [j6]Philippe Fournier-Viger
A survey of itemset mining. WIREs Data Mining Knowl. Discov. 7(4) (2017) - 2016
- [j5]Tin Chi Truong, Hai Van Duong
Structure of frequent itemsets with extended double constraints. Vietnam. J. Comput. Sci. 3(2): 119-135 (2016) - 2015
- [j4]Hai Van Duong
An efficient method for mining association rules based on minimum single constraints. Vietnam. J. Comput. Sci. 2(2): 67-83 (2015) - 2014
- [j3]Hai V. Duong
An efficient method for mining frequent itemsets with double constraints. Eng. Appl. Artif. Intell. 27: 148-154 (2014) - [j2]Anh N. Tran
Simultaneous mining of frequent closed itemsets and their generators: Foundation and algorithm. Eng. Appl. Artif. Intell. 36: 64-80 (2014) - [j1]Anh N. Tran
Structures of frequent itemsets and classifying structures of association rule set by order relations. Int. J. Intell. Inf. Database Syst. 8(4): 295-323 (2014) - 2013
- [c6]Anh N. Tran
An Approach for Mining Association Rules Intersected with Constraint Itemsets. KSE (2) 2013: 351-363 - [p3]Anh N. Tran
An Approach for Mining Concurrently Closed Itemsets and Generators. Advanced Computational Methods for Knowledge Engineering 2013: 355-366 - [p2]Hai V. Duong
An Efficient Algorithm for Mining Frequent Itemsets with Single Constraint. Advanced Computational Methods for Knowledge Engineering 2013: 367-378 - 2012
- [c5]Anh N. Tran
Structures of Association Rule Set. ACIIDS (2) 2012: 361-370 - [c4]Anh N. Tran
Mining Frequent Itemsets with Dualistic Constraints. PRICAI 2012: 807-813 - [c3]Anh N. Tran
Mining Association Rules Restricted on Constraint. RIVF 2012: 1-6 - 2011
- [c2]Anh N. Tran
Efficient Algorithms for Mining Frequent Itemsets with Constraint. KSE 2011: 19-25 - 2010
- [c1]Tin C. Truong
Structure of Association Rule Set Based on Min-Min Basic Rules. RIVF 2010: 1-6 - [p1]Tin C. Truong
Structure of Set of Association Rules Based on Concept Lattice. Advances in Intelligent Information and Database Systems 2010: 217-227
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-11-15 20:38 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: