default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVan Quoc Phuong Huynh
Person information
- affiliation: Johannes Kepler University Linz (JKU), Institute for Application Oriented Knowledge Processing (FAW), Linz, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Florian Beck
, Johannes Fürnkranz, Van Quoc Phuong Huynh:
Learning Deep Rule Concepts as Alternating Boolean Pattern Trees. DS (2) 2024: 50-64- [c13]Florian Beck, Johannes Fürnkranz, Van Quoc Phuong Huynh:
When Characteristic Rule-based Models Should be Preferred over Discriminative Ones. ITAT 2024: 52-59 - 2023
- [j4]Van Quoc Phuong Huynh, Johannes Fürnkranz, Florian Beck:
Efficient learning of large sets of locally optimal classification rules. Mach. Learn. 112(2): 571-610 (2023) - [c12]Florian Beck, Johannes Fürnkranz, Van Quoc Phuong Huynh:
Generalizing Conjunctive and Disjunctive Rule Learning to Learning m-of-n Concepts. ITAT 2023: 8-13 - [c11]Florian Beck, Johannes Fürnkranz, Van Quoc Phuong Huynh:
Layerwise Learning of Mixed Conjunctive and Disjunctive Rule Sets. RuleML+RR 2023: 95-109 - [i1]Van Quoc Phuong Huynh, Johannes Fürnkranz, Florian Beck:
Efficient learning of large sets of locally optimal classification rules. CoRR abs/2301.09936 (2023) - 2022
- [c10]Van Quoc Phuong Huynh, Florian Beck, Johannes Fürnkranz:
Incremental Update of Locally Optimal Classification Rules. DS 2022: 104-113 - [c9]Florian Beck, Johannes Fürnkranz, Van Quoc Phuong Huynh:
On the Incremental Construction of Deep Rule Theories. ITAT 2022: 21-27 - 2021
- [c8]Florian Beck, Johannes Fürnkranz, Van Quoc Phuong Huynh:
Structuring Rule Sets Using Binary Decision Diagrams. RuleML+RR 2021: 48-61 - 2020
- [j3]Van Quoc Phuong Huynh, Josef Küng:
FPO tree and DP3 algorithm for distributed parallel Frequent Itemsets Mining. Expert Syst. Appl. 140 (2020)
2010 – 2019
- 2019
- [j2]Van Quoc Phuong Huynh, Josef Küng, Tran Khanh Dang:
A Parallel Incremental Frequent Itemsets Mining IFIN+: Improvement and Extensive Evaluation. Trans. Large Scale Data Knowl. Centered Syst. 41: 78-106 (2019) - 2018
- [j1]Tran Khanh Dang, Van Quoc Phuong Huynh, Hai Truong:
A hybrid template protection approach using secure sketch and ANN for strong biometric key generation with revocability guarantee. Int. Arab J. Inf. Technol. 15(2): 331-340 (2018) - [c7]Van Quoc Phuong Huynh, Josef Küng:
Higher Performance IPPC+ Tree for Parallel Incremental Frequent Itemsets Mining. FDSE 2018: 127-144 - 2017
- [c6]Van Quoc Phuong Huynh, Josef Küng, Tran Khanh Dang:
Incremental Frequent Itemsets Mining with IPPC Tree. DEXA (1) 2017: 463-477 - [c5]Van Quoc Phuong Huynh, Josef Küng, Markus Jäger, Tran Khanh Dang:
IFIN+: A Parallel Incremental Frequent Itemsets Mining in Shared-Memory Environment. FDSE 2017: 121-138 - [c4]Muhammad Ilyas, Josef Küng, Van Quoc Phuong Huynh:
Effectiveness of Object Oriented Inheritance Metrics in Software Reusability. FDSE 2017: 231-239 - [c3]Markus Jäger, Jussi Nikander, Stefan Nadschläger, Van Quoc Phuong Huynh, Josef Küng:
Focusing on Precision- and Trust-Propagation in Knowledge Processing Systems. FDSE 2017: 395-406 - 2011
- [c2]Tran Khanh Dang, Josef Küng, Van Quoc Phuong Huynh:
Protecting Privacy While Discovering and Maintaining Association Rules. NTMS 2011: 1-5 - 2010
- [c1]Van Quoc Phuong Huynh, Tran Khanh Dang:
eM2: An Efficient Member Migration Algorithm for Ensuring k-Anonymity and Mitigating Information Loss. Secure Data Management 2010: 26-40
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 2025-02-28 23:04 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:
