Bay Vo

According to our database1, Bay Vo authored at least 149 papers between 2008 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Efficient list based mining of high average utility patterns with maximum average pruning strategies.
Inf. Sci., 2021

2020
Multiswarm Multiobjective Particle Swarm Optimization with Simulated Annealing for Extracting Multiple Tests.
Sci. Program., 2020

Efficient Algorithm for Mining Non-Redundant High-Utility Association Rules.
Sensors, 2020

Mining top-rank-<i>k</i> frequent weighted itemsets using WN-list structures and an early pruning strategy.
Knowl. Based Syst., 2020

F-Mapper: A Fuzzy Mapper clustering algorithm.
Knowl. Based Syst., 2020

Mining weighted subgraphs in a single large graph.
Inf. Sci., 2020

Projecting dependency syntax labels from English into Vietnamese in English-Vietnamese bilingual corpus.
Int. J. Intell. Inf. Database Syst., 2020

Multi-Objective Task and Workflow Scheduling Approaches in Cloud Computing: a Comprehensive Review.
J. Grid Comput., 2020

Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases.
Future Gener. Comput. Syst., 2020

Efficient algorithms for mining clickstream patterns using pseudo-IDLists.
Future Gener. Comput. Syst., 2020

Succinct contrast sets via false positive controlling with an application in clinical process redesign.
Expert Syst. Appl., 2020

Efficient methods for mining weighted clickstream patterns.
Expert Syst. Appl., 2020

Fast and scalable algorithms for mining subgraphs in a single large graph.
Eng. Appl. Artif. Intell., 2020

Erasable pattern mining based on tree structures with damped window over data streams.
Eng. Appl. Artif. Intell., 2020

Mining Maximal High Utility Itemsets on Dynamic Profit Databases.
Cybern. Syst., 2020

Mining top-k frequent patterns from uncertain databases.
Appl. Intell., 2020

Mining Correlated High Utility Itemsets in One Phase.
IEEE Access, 2020

A Multi-Core Approach to Efficiently Mining High-Utility Itemsets in Dynamic Profit Databases.
IEEE Access, 2020

An Efficient Method for Mining Closed Potential High-Utility Itemsets.
IEEE Access, 2020

An Efficient Method for Mining Top-K Closed Sequential Patterns.
IEEE Access, 2020

An N-List-Based Approach for Mining Frequent Inter-Transaction Patterns.
IEEE Access, 2020

Efficient Approach for Damped Window-Based High Utility Pattern Mining With List Structure.
IEEE Access, 2020

A Fast Algorithm for Mining Closed Inter-transaction Patterns.
Proceedings of the Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices, 2020

Efficient Method for Mining Maximal Inter-transaction Patterns.
Proceedings of the Computational Collective Intelligence - 12th International Conference, 2020

Efficient Method for Mining High-Utility Itemsets Using High-Average Utility Measure.
Proceedings of the Computational Collective Intelligence - 12th International Conference, 2020

Sequential Pattern Mining Using IDLists.
Proceedings of the Computational Collective Intelligence - 12th International Conference, 2020

2019
Multi-Swarm Single-Objective Particle Swarm Optimization to Extract Multiple-Choice Tests.
Vietnam. J. Comput. Sci., 2019

Mining high-utility itemsets in dynamic profit databases.
Knowl. Based Syst., 2019

Mining class association rules on imbalanced class datasets.
J. Intell. Fuzzy Syst., 2019

An efficient method for mining high utility closed itemsets.
Inf. Sci., 2019

A fast and accurate approach for bankruptcy forecasting using squared logistics loss with GPU-based extreme gradient boosting.
Inf. Sci., 2019

A Hybrid Approach Using Oversampling Technique and Cost-Sensitive Learning for Bankruptcy Prediction.
Complex., 2019

SPPC: a new tree structure for mining erasable patterns in data streams.
Appl. Intell., 2019

An Efficient Algorithm for Mining Frequent Closed Inter- Transaction Patterns.
Proceedings of the 2019 IEEE International Conference on Systems, Man and Cybernetics, 2019

Mining Clickstream Patterns Using IDLists.
Proceedings of the 2019 IEEE International Conference on Systems, Man and Cybernetics, 2019

2018
Interactive Exploration of Subspace Clusters on Multicore Processors.
Trans. Large Scale Data Knowl. Centered Syst., 2018

Mining sequential patterns with itemset constraints.
Knowl. Inf. Syst., 2018

Application of Particle Swarm Optimization to Create Multiple-Choice Tests.
J. Inf. Sci. Eng., 2018

A weighted N-list-based method for mining frequent weighted itemsets.
Expert Syst. Appl., 2018

Efficient algorithms for mining top-rank-k erasable patterns using pruning strategies and the subsume concept.
Eng. Appl. Artif. Intell., 2018

An efficient approach for mining sequential patterns using multiple threads on very large databases.
Eng. Appl. Artif. Intell., 2018

An Efficient Method for Mining Erasable Itemsets Using Multicore Processor Platform.
Complex., 2018

ETARM: an efficient top-k association rule mining algorithm.
Appl. Intell., 2018

Efficient method for updating class association rules in dynamic datasets with record deletion.
Appl. Intell., 2018

Mining constrained inter-sequence patterns: a novel approach to cope with item constraints.
Appl. Intell., 2018

An Efficient Method for Mining Clickstream Patterns.
Proceedings of the Rough Sets - International Joint Conference, 2018

A Weighted Approach for Class Association Rules.
Proceedings of the Modern Approaches for Intelligent Information and Database Systems,, 2018

2017
A survey of itemset mining.
Wiley Interdiscip. Rev. Data Min. Knowl. Discov., 2017

Efficient algorithms for mining colossal patterns in high dimensional databases.
Knowl. Based Syst., 2017

An Efficient Method for Mining Frequent Weighted Closed Itemsets from Weighted Item Transaction Databases.
J. Inf. Sci. Eng., 2017

A method for mining top-rank-k frequent closed itemsets.
J. Intell. Fuzzy Syst., 2017

Information granulation construction and representation strategies for classification in imbalanced data based on granular computing.
J. Inf. Telecommun., 2017

A lattice-based approach for mining high utility association rules.
Inf. Sci., 2017

A novel approach for mining maximal frequent patterns.
Expert Syst. Appl., 2017

Mining erasable itemsets with subset and superset itemset constraints.
Expert Syst. Appl., 2017

Mining top-k co-occurrence items with sequential pattern.
Expert Syst. Appl., 2017

Text Clustering Using Frequent Weighted Utility Itemsets.
Cybern. Syst., 2017

A fast algorithm for mining high average-utility itemsets.
Appl. Intell., 2017

An efficient method for mining frequent sequential patterns using multi-Core processors.
Appl. Intell., 2017

Efficient Algorithms for Mining Erasable Closed Patterns From Product Datasets.
IEEE Access, 2017

An Efficient Parallel Method for Mining Frequent Closed Sequential Patterns.
IEEE Access, 2017

Constraint-Based Method for Mining Colossal Patterns in High Dimensional Databases.
Proceedings of the Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology - ISAT 2017, 2017

An incremental mining algorithm for erasable itemsets.
Proceedings of the IEEE International Conference on INnovations in Intelligent SysTems and Applications, 2017

An Improved Algorithm for Mining Top-k Association Rules.
Proceedings of the Advanced Computational Methods for Knowledge Engineering, 2017

Interactive Exploration of Subspace Clusters for High Dimensional Data.
Proceedings of the Database and Expert Systems Applications, 2017

Quasi-erasable itemset mining.
Proceedings of the 2017 IEEE International Conference on Big Data, BigData 2017, 2017

Mining Class Association Rules with Synthesis Constraints.
Proceedings of the Intelligent Information and Database Systems - 9th Asian Conference, 2017

2016
The lattice-based approaches for mining association rules: a review.
Wiley Interdiscip. Rev. Data Min. Knowl. Discov., 2016

A Parallel Strategy for the Logical-probabilistic Calculus-based Method to Calculate Two-terminal Reliability.
Qual. Reliab. Eng. Int., 2016

Mining frequent itemsets using the N-list and subsume concepts.
Int. J. Mach. Learn. Cybern., 2016

Efficient mining of class association rules with the itemset constraint.
Knowl. Based Syst., 2016

Using Soft Set Theory for Mining Maximal Association Rules in Text Data.
J. Univers. Comput. Sci., 2016

An efficient approach for mining frequent item sets with transaction deletion operation.
Int. Arab J. Inf. Technol., 2016

Gender Identification using MFCC for Telephone Applications - A Comparative Study.
CoRR, 2016

Time Series Trend Analysis Based on K-Means and Support Vector Machine.
Comput. Informatics, 2016

Mining non-redundant sequential rules with dynamic bit vectors and pruning techniques.
Appl. Intell., 2016

An efficient algorithm for mining frequent weighted itemsets using interval word segments.
Appl. Intell., 2016

Mining closed high utility itemsets in uncertain databases.
Proceedings of the Seventh Symposium on Information and Communication Technology, 2016

A new method for mining colossal patterns.
Proceedings of the 2016 IEEE International Conference on Systems, Man, and Cybernetics, 2016

WUN-Miner: A new method for mining frequent Weighted Utility itemsets.
Proceedings of the 2016 IEEE International Conference on Systems, Man, and Cybernetics, 2016

A More Efficient Algorithm to Mine Skyline Frequent-Utility Patterns.
Proceedings of the Genetic and Evolutionary Computing, 2016

A Method for Query Top-K Rules from Class Association Rule Set.
Proceedings of the Intelligent Information and Database Systems - 8th Asian Conference, 2016

2015
A novel method for constrained class association rule mining.
Inf. Sci., 2015

Mining frequent closed itemsets from multidimensional databases.
Int. J. Comput. Vis. Robotics, 2015

CARIM: an efficient algorithm for mining class-association rules with interestingness measures.
Int. Arab J. Inf. Technol., 2015

An N-list-based algorithm for mining frequent closed patterns.
Expert Syst. Appl., 2015

An efficient and effective algorithm for mining top-rank-k frequent patterns.
Expert Syst. Appl., 2015

Combination of dynamic bit vectors and transaction information for mining frequent closed sequences efficiently.
Eng. Appl. Artif. Intell., 2015

CCAR: An efficient method for mining class association rules with itemset constraints.
Eng. Appl. Artif. Intell., 2015

Fast updated frequent-itemset lattice for transaction deletion.
Data Knowl. Eng., 2015

EIFDD: An efficient approach for erasable itemset mining of very dense datasets.
Appl. Intell., 2015

Mining frequent closed inter-sequence patterns efficiently using dynamic bit vectors.
Appl. Intell., 2015

An Improved Algorithm for Mining Frequent Weighted Itemsets.
Proceedings of the 2015 IEEE International Conference on Systems, 2015

Similarity Measure for Fiber Clustering: A Constant Time Complexity Algorithm.
Proceedings of the 2015 Seventh International Conference on Knowledge and Systems Engineering, 2015

A Parallel Algorithm for Frequent Subgraph Mining.
Proceedings of the Advanced Computational Methods for Knowledge Engineering - Proceedings of 3rd International Conference on Computer Science, Applied Mathematics and Applications, 2015

Discovering Erasable Closed Patterns.
Proceedings of the Intelligent Information and Database Systems - 7th Asian Conference, 2015

2014
A survey of erasable itemset mining algorithms.
Wiley Interdiscip. Rev. Data Min. Knowl. Discov., 2014

IMSR_PreTree: an improved algorithm for mining sequential rules based on the prefix-tree.
Vietnam. J. Comput. Sci., 2014

Feature selection and replacement by clustering attributes.
Vietnam. J. Comput. Sci., 2014

Incrementally building frequent closed itemset lattice.
Expert Syst. Appl., 2014

Efficient strategies for parallel mining class association rules.
Expert Syst. Appl., 2014

An efficient method for mining non-redundant sequential rules using attributed prefix-trees.
Eng. Appl. Artif. Intell., 2014

MEI: An efficient algorithm for mining erasable itemsets.
Eng. Appl. Artif. Intell., 2014

An efficient method for mining frequent itemsets with double constraints.
Eng. Appl. Artif. Intell., 2014

Improving Efficiency of Incremental Mining by Trie Structure and Pre-Large Itemsets.
Comput. Informatics, 2014

An effective approach for maintenance of pre-large-based frequent-itemset lattice in incremental mining.
Appl. Intell., 2014

Enhancing the mining top-rank-k frequent patterns.
Proceedings of the 2014 IEEE International Conference on Systems, Man, and Cybernetics, 2014

Subsume Concept in Erasable Itemset Mining.
Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2014

A Novel Method for Mining Class Association Rules with Itemset Constraints.
Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2014

A New Method for Mining High Average Utility Itemsets.
Proceedings of the Computer Information Systems and Industrial Management, 2014

A New Approach for Mining Top-Rank-k Erasable Itemsets.
Proceedings of the Intelligent Information and Database Systems - 6th Asian Conference, 2014

2013
Mining Frequent Weighted Closed Itemsets.
Proceedings of the Advanced Computational Methods for Knowledge Engineering, 2013

Dimensionality Reduction by Turning Points for Stream Time Series Prediction.
Proceedings of the Advanced Methods for Computational Collective Intelligence, 2013

Maintenance of IT-Tree for Transactions Deletion.
Proceedings of the Advanced Methods for Computational Collective Intelligence, 2013

A lattice-based approach for mining most generalization association rules.
Knowl. Based Syst., 2013

An effective algorithm for mining closed sequential patterns and their minimal generators based on prefix trees.
Int. J. Intell. Inf. Database Syst., 2013

A new method for mining Frequent Weighted Itemsets based on WIT-trees.
Expert Syst. Appl., 2013

CAR-Miner: An efficient algorithm for mining class-association rules.
Expert Syst. Appl., 2013

A Hybrid Approach for Mining Frequent Itemsets.
Proceedings of the IEEE International Conference on Systems, 2013

An Efficient Algorithm for Mining Erasable Itemsets Using the Difference of NC-Sets.
Proceedings of the IEEE International Conference on Systems, 2013

Maintenance of a Frequent-Itemset Lattice Based on Pre-large Concept.
Proceedings of the Knowledge and Systems Engineering, 2013

Mining Class-Association Rules with Constraints.
Proceedings of the Knowledge and Systems Engineering, 2013

An Efficient Method for Hiding High Utility Itemsets.
Proceedings of the Advanced Methods and Technologies for Agent and Multi-Agent Systems, Proceedings of the 7th KES Conference on Agent and Multi-Agent Systems, 2013

A Space-Time Trade Off for FUFP-trees Maintenance.
Proceedings of the Intelligent Information and Database Systems - 5th Asian Conference, 2013

Consensus for Collaborative Ontology-Based Vietnamese WordNet Building.
Proceedings of the Intelligent Information and Database Systems - 5th Asian Conference, 2013

2012
DBV-Miner: A Dynamic Bit-Vector approach for fast mining frequent closed itemsets.
Expert Syst. Appl., 2012

Classification based on association rules: A lattice-based approach.
Expert Syst. Appl., 2012

Maintenance of DBV-Trees for Transaction Insertion.
Proceedings of the Conference on Technologies and Applications of Artificial Intelligence, 2012

An Efficient Incremental Mining Approach Based on IT-Tree.
Proceedings of the 2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future (RIVF), Ho Chi Minh City, Vietnam, February 27, 2012

A Tree-Based Approach for Mining Frequent Weighted Utility Itemsets.
Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2012

MSGPs: A Novel Algorithm for Mining Sequential Generator Patterns.
Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2012

Interestingness Measures for Classification Based on Association Rules.
Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2012

A Dynamic Bit-vector Approach for Efficiently Mining Inter-sequence Patterns.
Proceedings of the 2012 Third International Conference on Innovations in Bio-Inspired Computing and Applications, 2012

An Enhanced FUFP-Tree Maintenance Approach for Transaction Deletion.
Proceedings of the 2012 Third International Conference on Innovations in Bio-Inspired Computing and Applications, 2012

Personalized Facets for Semantic Search Using Linked Open Data with Social Networks.
Proceedings of the 2012 Third International Conference on Innovations in Bio-Inspired Computing and Applications, 2012

A fast algorithm for classification based on association rules.
Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

2011
Mining minimal non-redundant association rules using frequent itemsets lattice.
Int. J. Intell. Syst. Technol. Appl., 2011

An efficient strategy for mining high utility itemsets.
Int. J. Intell. Inf. Database Syst., 2011

Interestingness measures for association rules: Combination between lattice and hash tables.
Expert Syst. Appl., 2011

A Frequent Closed Itemsets Lattice-based Approach for Mining Minimal Non-Redundant Association Rules
CoRR, 2011

Incremental mining frequent itemsets based on the trie structure and the pre-large itemsets.
Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

Mining Frequent Itemsets from Multidimensional Databases.
Proceedings of the Intelligent Information and Database Systems, 2011

Mining Sequential Rules Based on Prefix-Tree.
Proceedings of the New Challenges for Intelligent Information and Database Systems [original works presented during a poster session organized within the 3rd Asian Conference on Intelligent Information and Database Systems, 2011

2010
Mining the Most Generalization Association Rules.
Proceedings of the Advances in Intelligent Information and Database Systems, 2010

Efficient Algorithms for Mining Frequent Weighted Itemsets from Weighted Items Databases.
Proceedings of the 2010 IEEE RIVF International Conference on Computing & Communication Technologies, 2010

2009
Mining High Utility Itemsets from Vertical Distributed Databases.
Proceedings of the 2009 IEEE International Conference on Computing and Communication Technologies, 2009

Parallel Method for Mining High Utility Itemsets from Vertically Partitioned Distributed Databases.
Proceedings of the Knowledge-Based and Intelligent Information and Engineering Systems, 2009

A Novel Algorithm for Mining High Utility Itemsets.
Proceedings of the First Asian Conference on Intelligent Information and Database Systems, 2009

2008
A Novel Classification Algorithm Based on Association Rules Mining.
Proceedings of the Knowledge Acquisition: Approaches, 2008


  Loading...