default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBao Huynh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Van Hua
, Bao Huynh:
Forecasting a Journal Impact Factor Under Missing Values Based on Machine Learning. IEEE Access 12: 85745-85760 (2024)- [j18]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) - [j17]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) - [j16]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) - 2023
- [j15]Thi-Thiet Pham, Thuy-Duong Vu, Tai-Du Nguyen, Bao Huynh, Trang Van:
Mining Weighted Sequential Patterns Based on Prefix-Tree and Prism Encoding. Vietnam. J. Comput. Sci. 10(3): 357-372 (2023) - 2022
- [j14]Cuong Trinh, Bao Huynh, Moazam Bidaki, Amir Masoud Rahmani, Mehdi Hosseinzadeh, Mohammad Masdari:
Optimized fuzzy clustering using moth-flame optimization algorithm in wireless sensor networks. Artif. Intell. Rev. 55(3): 1915-1945 (2022) - 2021
- [j13]Bay Vo, Huy-Cuong Nguyen, Bao Huynh, Tuong Le:
Efficient Methods for Clickstream Pattern Mining on Incremental Databases. IEEE Access 9: 161305-161317 (2021) - [j12]Tuong Le, Thanh-Long Nguyen, Bao Huynh, Hung Nguyen, Tzung-Pei Hong, Václav Snásel:
Mining colossal patterns with length constraints. Appl. Intell. 51(12): 8629-8640 (2021) - [j11]Bao Huynh, Loan T. T. Nguyen, Huy Minh Huynh, Adrianna Kozierkiewicz, Unil Yun, Zuzana Komínková Oplatková, Bay Vo:
A Novel Approach for Mining Closed Clickstream Patterns. Cybern. Syst. 52(5): 328-349 (2021) - [j10]Anna Jenul, Stefan Schrunner, Bao Huynh, Oliver Tomic:
RENT: A Python Package for Repeated Elastic Net Feature Selection. J. Open Source Softw. 6(63): 3323 (2021) - 2020
- [j9]Mehdi Hosseinzadeh, Quan Thanh Tho, Saqib Ali, Amir Masoud Rahmani, Alireza Souri, Monire Norouzi, Bao Huynh:
A Hybrid Service Selection and Composition Model for Cloud-Edge Computing in the Internet of Things. IEEE Access 8: 85939-85949 (2020) - [j8]Mehdi Hosseinzadeh, Jan Lansky, Amir Masoud Rahmani, Cuong Trinh, Masoumeh Safkhani, Nasour Bagheri, Bao Huynh:
A New Strong Adversary Model for RFID Authentication Protocols. IEEE Access 8: 125029-125045 (2020) - [j7]Mehdi Hosseinzadeh, Omed Hassan Ahmed, Sarkar Hasan Ahmed, Cuong Trinh, Nasour Bagheri, Saru Kumari, Jan Lansky, Bao Huynh:
An Enhanced Authentication Protocol for RFID Systems. IEEE Access 8: 126977-126987 (2020) - [j6]Cuong Trinh, Bao Huynh, Jan Lansky, Stanislava Mildeová, Masoumeh Safkhani, Nasour Bagheri, Saru Kumari, Mehdi Hosseinzadeh:
A Novel Lightweight Block Cipher-Based Mutual Authentication Protocol for Constrained Environments. IEEE Access 8: 165536-165550 (2020) - [c3]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 - [i1]Bao Huynh, Haimonti Dutta, Dane Taylor:
Impact of Community Structure on Consensus Machine Learning. CoRR abs/2011.01334 (2020)
2010 – 2019
- 2018
- [j5]Tuong Le, Anh Nguyen, Bao Huynh, Bay Vo, Witold Pedrycz:
Mining constrained inter-sequence patterns: a novel approach to cope with item constraints. Appl. Intell. 48(5): 1327-1343 (2018) - [j4]Bao Huynh, Bay Vo:
An Efficient Method for Mining Erasable Itemsets Using Multicore Processor Platform. Complex. 2018: 8487641:1-8487641:9 (2018) - [j3]Bao Huynh, Cuong Trinh, Huy Minh Huynh, Thien-Trang Van, Bay Vo, Václav Snásel:
An efficient approach for mining sequential patterns using multiple threads on very large databases. Eng. Appl. Artif. Intell. 74: 242-251 (2018) - [c2]Bang V. Bui, Bay Vo, Huy Minh Huynh, Tu-Anh Nguyen-Hoang, Bao Huynh:
An Efficient Method for Mining Clickstream Patterns. IJCSR 2018: 572-583 - 2017
- [j2]Bao Huynh, Bay Vo, Václav Snásel:
An Efficient Parallel Method for Mining Frequent Closed Sequential Patterns. IEEE Access 5: 17392-17402 (2017) - [j1]Bao Huynh, Bay Vo, Václav Snásel:
An efficient method for mining frequent sequential patterns using multi-Core processors. Appl. Intell. 46(3): 703-716 (2017) - [c1]Thanh-Long Nguyen, Bay Vo, Bao Huynh, Václav Snásel, Loan T. T. Nguyen:
Constraint-Based Method for Mining Colossal Patterns in High Dimensional Databases. ISAT (1) 2017: 195-204
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-10-07 21:16 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:
