Bay Vo

Tahani A. Abdusalam Hawari

Abdul Razak Salleh

Appl. Soft Comput., 2022

An efficient method for mining multi-level high utility Itemsets.

[BibT_eX]

[DOI]

Appl. Intell., 2022

An efficient and scalable approach for mining subgraphs in a single large graph.

[BibT_eX]

[DOI]

Appl. Intell., 2022

A Method of Chinese-Vietnamese Bilingual Corpus Construction for Machine Translation.

[BibT_eX]

[DOI]

IEEE Access, 2022

Mining Top-K High Utility Itemsets Using Bio-Inspired Algorithms with a Diversity within Population Framework.

[BibT_eX]

[DOI]

Nam Ngoc Pham

Proceedings of the RIVF International Conference on Computing and Communication Technologies, 2022

Mining Top-K High Utility Itemset Using Bio-Inspired Algorithms.

[BibT_eX]

[DOI]

Nam Ngoc Pham

Proceedings of the IEEE Workshop on Complexity in Engineering, 2022

Frequent Closed Subgraph Mining: A Multi-thread Approach.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Information and Database Systems - 14th Asian Conference, 2022

2021

A multiple multilayer perceptron neural network with an adaptive learning algorithm for thyroid disease diagnosis in the internet of medical things.

[BibT_eX]

[DOI]

Mehdi Hosseinzadeh

Omed Hassan Ahmed

Marwan Yassin Ghafour

J. Supercomput., 2021

RHUPS: Mining Recent High Utility Patterns with Sliding Window-based Arrival Time Control over Data Streams.

[BibT_eX]

[DOI]

ACM Trans. Intell. Syst. Technol., 2021

SFCM: A Fuzzy Clustering Algorithm of Extracting the Shape Information of Data.

[BibT_eX]

[DOI]

IEEE Trans. Fuzzy Syst., 2021

Improving security using SVM-based anomaly detection: issues and challenges.

[BibT_eX]

[DOI]

Soft Comput., 2021

Periodicity-Oriented Data Analytics on Time-Series Data for Intelligence System.

[BibT_eX]

[DOI]

IEEE Syst. J., 2021

The impact of knowledge on e-health: a systematic literature review of the advanced systems.

[BibT_eX]

[DOI]

Kybernetes, 2021

Con2Vec: Learning embedding representations for contrast sets.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2021

Approximate high utility itemset mining in noisy environments.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2021

A method for efficient clustering of spatial data in network space.

[BibT_eX]

[DOI]

J. Intell. Fuzzy Syst., 2021

A General Method for mining high-Utility itemsets with correlated measures.

[BibT_eX]

[DOI]

Nguyen Manh Hung

N. T. Tung

J. Inf. Telecommun., 2021

JUDO: Just-in-time rumour detection in streaming social platforms.

[BibT_eX]

[DOI]

Quoc Viet Hung Nguyen

Inf. Sci., 2021

Efficient list based mining of high average utility patterns with maximum average pruning strategies.

[BibT_eX]

[DOI]

Inf. Sci., 2021

Prelarge-Based Utility-Oriented Data Analytics for Transaction Modifications in Internet of Things.

[BibT_eX]

[DOI]

IEEE Internet Things J., 2021

Efficient algorithms for mining closed high utility itemsets in dynamic profit databases.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2021

Multiple-objective optimization applied in extracting multiple-choice tests.

[BibT_eX]

[DOI]

Eng. Appl. Artif. Intell., 2021

A Novel Approach for Mining Closed Clickstream Patterns.

[BibT_eX]

[DOI]

Adrianna Kozierkiewicz

Unil Yun

Cybern. Syst., 2021

Mining frequent weighted closed itemsets using the WN-list structure and an early pruning strategy.

[BibT_eX]

[DOI]

Appl. Intell., 2021

Electrocardiogram signals-based user authentication systems using soft computing techniques.

[BibT_eX]

[DOI]

Mehdi Hosseinzadeh

Marwan Yassin Ghafour

Sajjad Naghipour

Artif. Intell. Rev., 2021

Efficient Methods for Clickstream Pattern Mining on Incremental Databases.

[BibT_eX]

[DOI]

IEEE Access, 2021

A Method for Closed Frequent Subgraph Mining in a Single Large Graph.

[BibT_eX]

[DOI]

IEEE Access, 2021

Multi-Swarm Optimization for Extracting Multiple-Choice Tests From Question Banks.

[BibT_eX]

[DOI]

IEEE Access, 2021

Identity-Based Linkable Ring Signatures From Lattices.

[BibT_eX]

[DOI]

IEEE Access, 2021

A Sliding Window-Based Approach for Mining Frequent Weighted Patterns Over Data Streams.

[BibT_eX]

[DOI]

IEEE Access, 2021

An Efficient Approach for Mining High-Utility Itemsets from Multiple Abstraction Levels.

[BibT_eX]

[DOI]

Trinh D. D. Nguyen

Adrianna Kozierkiewicz

Thiet Pham

Proceedings of the Intelligent Information and Database Systems - 13th Asian Conference, 2021

2020

Multiswarm Multiobjective Particle Swarm Optimization with Simulated Annealing for Extracting Multiple Tests.

[BibT_eX]

[DOI]

Sci. Program., 2020

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

[BibT_eX]

[DOI]

Sensors, 2020

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

[BibT_eX]

[DOI]

Knowl. Based Syst., 2020

F-Mapper: A Fuzzy Mapper clustering algorithm.

[BibT_eX]

[DOI]

Quang-Thinh Bui

Hoang-Anh Nguyen Do

Nguyen Quoc Viet Hung

Knowl. Based Syst., 2020

Mining weighted subgraphs in a single large graph.

[BibT_eX]

[DOI]

Inf. Sci., 2020

Projecting dependency syntax labels from English into Vietnamese in English-Vietnamese bilingual corpus.

[BibT_eX]

[DOI]

Int. J. Intell. Inf. Database Syst., 2020

Multi-Objective Task and Workflow Scheduling Approaches in Cloud Computing: a Comprehensive Review.

[BibT_eX]

[DOI]

Mehdi Hosseinzadeh

Marwan Yassin Ghafour

Hawkar Kamaran Hama

Afsane Khoshnevis

J. Grid Comput., 2020

Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2020

Efficient algorithms for mining clickstream patterns using pseudo-IDLists.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2020

Succinct contrast sets via false positive controlling with an application in clinical process redesign.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2020

Efficient methods for mining weighted clickstream patterns.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2020

Fast and scalable algorithms for mining subgraphs in a single large graph.

[BibT_eX]

[DOI]

Eng. Appl. Artif. Intell., 2020

Erasable pattern mining based on tree structures with damped window over data streams.

[BibT_eX]

[DOI]

Eng. Appl. Artif. Intell., 2020

Mining Maximal High Utility Itemsets on Dynamic Profit Databases.

[BibT_eX]

[DOI]

Cybern. Syst., 2020

Mining top-k frequent patterns from uncertain databases.

[BibT_eX]

[DOI]

Appl. Intell., 2020

Mining Correlated High Utility Itemsets in One Phase.

[BibT_eX]

[DOI]

IEEE Access, 2020

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

[BibT_eX]

[DOI]

Trinh D. D. Nguyen

Unil Yun

IEEE Access, 2020

An Efficient Method for Mining Closed Potential High-Utility Itemsets.

[BibT_eX]

[DOI]

IEEE Access, 2020

An Efficient Method for Mining Top-K Closed Sequential Patterns.

[BibT_eX]

[DOI]

IEEE Access, 2020

An N-List-Based Approach for Mining Frequent Inter-Transaction Patterns.

[BibT_eX]

[DOI]

IEEE Access, 2020

Efficient Approach for Damped Window-Based High Utility Pattern Mining With List Structure.

[BibT_eX]

[DOI]

IEEE Access, 2020

A Fast Algorithm for Mining Closed Inter-transaction Patterns.

[BibT_eX]

[DOI]

Proceedings of the Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices, 2020

Efficient Method for Mining Maximal Inter-transaction Patterns.

[BibT_eX]

[DOI]

Thanh-Ngo Nguyen

Nguyen Thi Thuy Loan

Adrianna Kozierkiewicz

Proceedings of the Computational Collective Intelligence - 12th International Conference, 2020

Efficient Method for Mining High-Utility Itemsets Using High-Average Utility Measure.

[BibT_eX]

[DOI]

Proceedings of the Computational Collective Intelligence - 12th International Conference, 2020

Sequential Pattern Mining Using IDLists.

[BibT_eX]

[DOI]

Nam Ngoc Pham

Nguyen Thi Thuy Loan

Proceedings of the Computational Collective Intelligence - 12th International Conference, 2020

2019

Multi-Swarm Single-Objective Particle Swarm Optimization to Extract Multiple-Choice Tests.

[BibT_eX]

[DOI]

Tram Nguyen

Toan Bui

Vietnam. J. Comput. Sci., 2019

Mining high-utility itemsets in dynamic profit databases.

[BibT_eX]

[DOI]

Vincent S. Tseng

Knowl. Based Syst., 2019

Mining class association rules on imbalanced class datasets.

[BibT_eX]

[DOI]

J. Intell. Fuzzy Syst., 2019

An efficient method for mining high utility closed itemsets.

[BibT_eX]

[DOI]

Inf. Sci., 2019

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

[BibT_eX]

[DOI]

Inf. Sci., 2019

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

[BibT_eX]

[DOI]

Complex., 2019

SPPC: a new tree structure for mining erasable patterns in data streams.

[BibT_eX]

[DOI]

Mi Young Lee

Sung Wook Baik

Appl. Intell., 2019

An Efficient Algorithm for Mining Frequent Closed Inter- Transaction Patterns.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Systems, Man and Cybernetics, 2019

Mining Clickstream Patterns Using IDLists.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Systems, Man and Cybernetics, 2019

2018

Interactive Exploration of Subspace Clusters on Multicore Processors.

[BibT_eX]

[DOI]

Trans. Large Scale Data Knowl. Centered Syst., 2018

Mining sequential patterns with itemset constraints.

[BibT_eX]

[DOI]

Thien-Trang Van

Knowl. Inf. Syst., 2018

Application of Particle Swarm Optimization to Create Multiple-Choice Tests.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2018

A weighted N-list-based method for mining frequent weighted itemsets.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2018

Efficient algorithms for mining top-rank-k erasable patterns using pruning strategies and the subsume concept.

[BibT_eX]

[DOI]

Sung Wook Baik

Eng. Appl. Artif. Intell., 2018

An efficient approach for mining sequential patterns using multiple threads on very large databases.

[BibT_eX]

[DOI]

Eng. Appl. Artif. Intell., 2018

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

[BibT_eX]

[DOI]

Complex., 2018

ETARM: an efficient top-k association rule mining algorithm.

[BibT_eX]

[DOI]

Linh T. T. Nguyen

Ali Selamat

Appl. Intell., 2018

Efficient method for updating class association rules in dynamic datasets with record deletion.

[BibT_eX]

[DOI]

Appl. Intell., 2018

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

[BibT_eX]

[DOI]

Appl. Intell., 2018

An Efficient Method for Mining Clickstream Patterns.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets - International Joint Conference, 2018

A Weighted Approach for Class Association Rules.

[BibT_eX]

[DOI]

Proceedings of the Modern Approaches for Intelligent Information and Database Systems,, 2018

2017

A survey of itemset mining.

[BibT_eX]

[DOI]

WIREs Data Mining Knowl. Discov., 2017

Efficient algorithms for mining colossal patterns in high dimensional databases.

[BibT_eX]

[DOI]

Thanh-Long Nguyen

Knowl. Based Syst., 2017

An Efficient Method for Mining Frequent Weighted Closed Itemsets from Weighted Item Transaction Databases.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2017

A method for mining top-rank-k frequent closed itemsets.

[BibT_eX]

[DOI]

J. Intell. Fuzzy Syst., 2017

Information granulation construction and representation strategies for classification in imbalanced data based on granular computing.

[BibT_eX]

[DOI]

Lai Duc Anh

Witold Pedrycz

J. Inf. Telecommun., 2017

A lattice-based approach for mining high utility association rules.

[BibT_eX]

[DOI]

Thang Mai

Inf. Sci., 2017

A novel approach for mining maximal frequent patterns.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2017

Mining erasable itemsets with subset and superset itemset constraints.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2017

Mining top-k co-occurrence items with sequential pattern.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2017

Text Clustering Using Frequent Weighted Utility Itemsets.

[BibT_eX]

[DOI]

Cybern. Syst., 2017

A fast algorithm for mining high average-utility itemsets.

[BibT_eX]

[DOI]

Jerry Chun-Wei Lin

Shifeng Ren

Ja-Hwung Su

Appl. Intell., 2017

An efficient method for mining frequent sequential patterns using multi-Core processors.

[BibT_eX]

[DOI]

Appl. Intell., 2017

Efficient Algorithms for Mining Erasable Closed Patterns From Product Datasets.

[BibT_eX]

[DOI]

IEEE Access, 2017

An Efficient Parallel Method for Mining Frequent Closed Sequential Patterns.

[BibT_eX]

[DOI]

IEEE Access, 2017

Constraint-Based Method for Mining Colossal Patterns in High Dimensional Databases.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on INnovations in Intelligent SysTems and Applications, 2017

An Improved Algorithm for Mining Top-k Association Rules.

[BibT_eX]

[DOI]

Linh T. T. Nguyen

Proceedings of the Advanced Computational Methods for Knowledge Engineering, 2017

Interactive Exploration of Subspace Clusters for High Dimensional Data.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 2017

Quasi-erasable itemset mining.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Conference on Big Data (IEEE BigData 2017), 2017

Mining Class Association Rules with Synthesis Constraints.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Information and Database Systems - 9th Asian Conference, 2017

2016

The lattice-based approaches for mining association rules: a review.

[BibT_eX]

[DOI]

WIREs Data Mining Knowl. Discov., 2016

A Parallel Strategy for the Logical-probabilistic Calculus-based Method to Calculate Two-terminal Reliability.

[BibT_eX]

[DOI]

Duc-Lung Vu

Qual. Reliab. Eng. Int., 2016

Mining frequent itemsets using the N-list and subsume concepts.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., 2016

Efficient mining of class association rules with the itemset constraint.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2016

Using Soft Set Theory for Mining Maximal Association Rules in Text Data.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2016

An efficient approach for mining frequent item sets with transaction deletion operation.

[BibT_eX]

[DOI]

Int. Arab J. Inf. Technol., 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Time Series Trend Analysis Based on K-Means and Support Vector Machine.

[BibT_eX]

[DOI]

Vo Van

Jiawei Luo

Comput. Informatics, 2016

Mining non-redundant sequential rules with dynamic bit vectors and pruning techniques.

[BibT_eX]

[DOI]

Appl. Intell., 2016

An efficient algorithm for mining frequent weighted itemsets using interval word segments.

[BibT_eX]

[DOI]

Appl. Intell., 2016

Mining closed high utility itemsets in uncertain databases.

[BibT_eX]

[DOI]

Proceedings of the Seventh Symposium on Information and Communication Technology, 2016

A new method for mining colossal patterns.

[BibT_eX]

[DOI]

Thanh-Long Nguyen

Proceedings of the 2016 IEEE International Conference on Systems, Man, and Cybernetics, 2016

WUN-Miner: A new method for mining frequent Weighted Utility itemsets.

[BibT_eX]

[DOI]

Huong Bui

Ham Nguyen

Proceedings of the 2016 IEEE International Conference on Systems, Man, and Cybernetics, 2016

A More Efficient Algorithm to Mine Skyline Frequent-Utility Patterns.

[BibT_eX]

[DOI]

Jerry Chun-Wei Lin

Lu Yang

Proceedings of the Genetic and Evolutionary Computing, 2016

A Method for Query Top-K Rules from Class Association Rule Set.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Information and Database Systems - 8th Asian Conference, 2016

2015

A novel method for constrained class association rule mining.

[BibT_eX]

[DOI]

Inf. Sci., 2015

Mining frequent closed itemsets from multidimensional databases.

[BibT_eX]

[DOI]

Hien T. Nguyen

Int. J. Comput. Vis. Robotics, 2015

CARIM: an efficient algorithm for mining class-association rules with interestingness measures.

[BibT_eX]

[DOI]

Int. Arab J. Inf. Technol., 2015

An N-list-based algorithm for mining frequent closed patterns.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2015

An efficient and effective algorithm for mining top-rank-k frequent patterns.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2015

Combination of dynamic bit vectors and transaction information for mining frequent closed sequences efficiently.

[BibT_eX]

[DOI]

Minh-Thai Tran

Eng. Appl. Artif. Intell., 2015

CCAR: An efficient method for mining class association rules with itemset constraints.

[BibT_eX]

[DOI]

Eng. Appl. Artif. Intell., 2015

Fast updated frequent-itemset lattice for transaction deletion.

[BibT_eX]

[DOI]

Data Knowl. Eng., 2015

EIFDD: An efficient approach for erasable itemset mining of very dense datasets.

[BibT_eX]

[DOI]

Appl. Intell., 2015

Mining frequent closed inter-sequence patterns efficiently using dynamic bit vectors.

[BibT_eX]

[DOI]

Hoai Bac Le

Minh-Thai Tran

Appl. Intell., 2015

An Improved Algorithm for Mining Frequent Weighted Itemsets.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on Systems, 2015

Similarity Measure for Fiber Clustering: A Constant Time Complexity Algorithm.

[BibT_eX]

[DOI]

Tran Anh Quan

Proceedings of the 2015 Seventh International Conference on Knowledge and Systems Engineering, 2015

A Parallel Algorithm for Frequent Subgraph Mining.

[BibT_eX]

[DOI]

Thanh-Long Nguyen

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.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Information and Database Systems - 7th Asian Conference, 2015

2014

A survey of erasable itemset mining algorithms.

[BibT_eX]

[DOI]

Giang Nguyen

WIREs Data Mining Knowl. Discov., 2014

IMSR_PreTree: an improved algorithm for mining sequential rules based on the prefix-tree.

[BibT_eX]

[DOI]

Thien-Trang Van

Vietnam. J. Comput. Sci., 2014

Feature selection and replacement by clustering attributes.

[BibT_eX]

[DOI]

Vietnam. J. Comput. Sci., 2014

Incrementally building frequent closed itemset lattice.

[BibT_eX]

[DOI]

Phuong-Thanh La

Expert Syst. Appl., 2014

Efficient strategies for parallel mining class association rules.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2014

An efficient method for mining non-redundant sequential rules using attributed prefix-trees.

[BibT_eX]

[DOI]

Eng. Appl. Artif. Intell., 2014

MEI: An efficient algorithm for mining erasable itemsets.

[BibT_eX]

[DOI]

Eng. Appl. Artif. Intell., 2014

An efficient method for mining frequent itemsets with double constraints.

[BibT_eX]

[DOI]

Hai V. Duong

Tin C. Truong

Eng. Appl. Artif. Intell., 2014

Improving Efficiency of Incremental Mining by Trie Structure and Pre-Large Itemsets.

[BibT_eX]

[DOI]

Comput. Informatics, 2014

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

[BibT_eX]

[DOI]

Appl. Intell., 2014

Enhancing the mining top-rank-k frequent patterns.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Conference on Systems, Man, and Cybernetics, 2014

Subsume Concept in Erasable Itemset Mining.

[BibT_eX]

[DOI]

Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2014

A Novel Method for Mining Class Association Rules with Itemset Constraints.

[BibT_eX]

[DOI]

Hoai Bac Le

Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2014

A New Method for Mining High Average Utility Itemsets.

[BibT_eX]

[DOI]

Proceedings of the Computer Information Systems and Industrial Management, 2014

A New Approach for Mining Top-Rank-k Erasable Itemsets.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Information and Database Systems - 6th Asian Conference, 2014

2013

Mining Frequent Weighted Closed Itemsets.

[BibT_eX]

[DOI]

Nhu-Y Tran

Duong-Ha Ngo

Proceedings of the Advanced Computational Methods for Knowledge Engineering, 2013

Dimensionality Reduction by Turning Points for Stream Time Series Prediction.

[BibT_eX]

[DOI]

Vo Van

Jiawei Luo

Proceedings of the Advanced Methods for Computational Collective Intelligence, 2013

Maintenance of IT-Tree for Transactions Deletion.

[BibT_eX]

[DOI]

Proceedings of the Advanced Methods for Computational Collective Intelligence, 2013

A lattice-based approach for mining most generalization association rules.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2013

An effective algorithm for mining closed sequential patterns and their minimal generators based on prefix trees.

[BibT_eX]

[DOI]

Thi-Thiet Pham

Jiawei Luo

Int. J. Intell. Inf. Database Syst., 2013

A new method for mining Frequent Weighted Itemsets based on WIT-trees.

[BibT_eX]

[DOI]

Frans Coenen

Expert Syst. Appl., 2013

CAR-Miner: An efficient algorithm for mining class-association rules.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2013

A Hybrid Approach for Mining Frequent Itemsets.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Systems, 2013

An Efficient Algorithm for Mining Erasable Itemsets Using the Difference of NC-Sets.

[BibT_eX]

[DOI]

Frans Coenen

Proceedings of the IEEE International Conference on Systems, 2013

Maintenance of a Frequent-Itemset Lattice Based on Pre-large Concept.

[BibT_eX]

[DOI]

Proceedings of the Knowledge and Systems Engineering, 2013

Mining Class-Association Rules with Constraints.

[BibT_eX]

[DOI]

Proceedings of the Knowledge and Systems Engineering, 2013

An Efficient Method for Hiding High Utility Itemsets.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Information and Database Systems - 5th Asian Conference, 2013

Consensus for Collaborative Ontology-Based Vietnamese WordNet Building.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2012

Classification based on association rules: A lattice-based approach.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2012

Maintenance of DBV-Trees for Transaction Insertion.

[BibT_eX]

[DOI]

Proceedings of the Conference on Technologies and Applications of Artificial Intelligence, 2012

An Efficient Incremental Mining Approach Based on IT-Tree.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Jason J. Jung

Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2012

MSGPs: A Novel Algorithm for Mining Sequential Generator Patterns.

[BibT_eX]

[DOI]

Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2012

Interestingness Measures for Classification Based on Association Rules.

[BibT_eX]

[DOI]

Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2012

A Dynamic Bit-vector Approach for Efficiently Mining Inter-sequence Patterns.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Trong Hai Duong

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.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

2011

Mining minimal non-redundant association rules using frequent itemsets lattice.

[BibT_eX]

[DOI]

Int. J. Intell. Syst. Technol. Appl., 2011

An efficient strategy for mining high utility itemsets.

[BibT_eX]

[DOI]

Huy Nguyen

Int. J. Intell. Inf. Database Syst., 2011

Interestingness measures for association rules: Combination between lattice and hash tables.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2011

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

[BibT_eX]

[DOI]

CoRR, 2011

Incremental mining frequent itemsets based on the trie structure and the pre-large itemsets.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

Mining Frequent Itemsets from Multidimensional Databases.

[BibT_eX]

[DOI]

Thang N. Nguyen

Proceedings of the Intelligent Information and Database Systems, 2011

Mining Sequential Rules Based on Prefix-Tree.

[BibT_eX]

[DOI]

Thien-Trang Van

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.

[BibT_eX]

[DOI]

Proceedings of the Advances in Intelligent Information and Database Systems, 2010

Efficient Algorithms for Mining Frequent Weighted Itemsets from Weighted Items Databases.

[BibT_eX]

[DOI]