Proceedings Article10.1109/CIS.2007.136
Frequent Closed Informative Itemset Mining
Huaiguo Fu,Mícheál Ó Foghlú,Willie Donnelly +2 more
- 15 Dec 2007
- pp 232-236
23
TL;DR: The algorithm is based on concept lattice structure so that frequent closed itemsets can be generated to reduce the complicity of mining all frequent itemsets and each frequent closed itemset has more information to facilitate interpretation of mining results.
read more
Abstract: In recent years, cluster analysis and association analysis have attracted a lot of attention for large data analysis such as biomedical data analysis. This paper proposes a novel algorithm of frequent closed itemset mining. The algorithm addresses two challenges of data mining: mining large and high dimensional data and interpreting the results of data mining. Frequent itemset mining is the key task of association analysis. The algorithm is based on concept lattice structure so that frequent closed itemsets can be generated to reduce the complicity of mining all frequent itemsets and each frequent closed itemset has more information to facilitate interpretation of mining results. From this feature, the paper also discusses the extension of the algorithm for cluster analysis. The experimental results show the efficiency of this algorithm.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Hybrid Estimation of Distribution Algorithm with Decomposition for Solving the Multiobjective Multiple Traveling Salesman Problem
Vui Ann Shim,Kay Chen Tan,C. Y. Cheong +2 more
- 01 Sep 2012
TL;DR: The estimation of distribution algorithm (EDA) is integrated into the decomposition framework and a novel multiobjective formulation of the multiple traveling salesman problem is proposed.
121
Multiobjective Estimation of Distribution Algorithm Based on Joint Modeling of Objectives and Variables
TL;DR: The algorithm is tested on the set of CEC09 problems, where the results show that multiobjective optimization based on joint model estimation is able to obtain considerably better fronts for some of the problems compared with the search based on conventional genetic operators in the state-of-the-art multi objective evolutionary algorithms.
A Survey on Learnable Evolutionary Algorithms for Scalable Multiobjective Optimization
TL;DR: In this article , a general taxonomy of scaling-up MOPs and learnable MOEAs is presented, followed by an analysis of the challenges that these MOPS pose to traditional MOEA.
Restricted Boltzmann machine based algorithm for multi-objective optimization
Huajin Tang,Vui Ann Shim,Kay Chen Tan,Jun Yong Chia +3 more
- 18 Jul 2010
TL;DR: This paper modeled as estimation of distribution algorithm in the context of multi-objective optimization of restricted Boltzmann machine as a probabilistic model that incorporates clustering in phenotype space and other canonical operators.
43
A hybrid adaptive evolutionary algorithm in the domination-based and decomposition-based frameworks of multi-objective optimization
Vui Ann Shim,Kay Chen Tan,K. K. Tan +2 more
- 10 Jun 2012
TL;DR: An adaptive mechanism that synthesizes a genetic algorithm, differential evolution and estimation of distribution algorithm, which is developed in the domination-based and decomposition-based multi-objective frameworks.
28
References
A fast and elitist multiobjective genetic algorithm: NSGA-II
TL;DR: This paper suggests a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties, and modify the definition of dominance in order to solve constrained multi-objective problems efficiently.
Eigenfaces vs. Fisherfaces: recognition using class specific linear projection
TL;DR: A face recognition algorithm which is insensitive to large variation in lighting direction and facial expression is developed, based on Fisher's linear discriminant and produces well separated classes in a low-dimensional subspace, even under severe variations in lighting and facial expressions.
Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
Peter N. Belhumeur,Joao P. Hespanha,David J. Kriegman +2 more
- 15 Apr 1996
TL;DR: A face recognition algorithm which is insensitive to gross variation in lighting direction and facial expression is developed and the proposed “Fisherface” method has error rates that are significantly lower than those of the Eigenface technique when tested on the same database.
Face recognition: A literature survey
TL;DR: In this paper, the authors provide an up-to-date critical survey of still-and video-based face recognition research, and provide some insights into the studies of machine recognition of faces.
7.2K