Micro-expressions are brief involuntary facial expressions that reveal genuine emotions and, thus, help detect lies. Because of their many promising applications, they have attracted the attention of researchers from various fields. Recent research reveals that two perceptual color spaces (CIELab and CIELuv) provide useful information for expression recognition. This paper is an extended version of our International Conference on Pattern Recognition paper, in which we propose a novel color space model, tensor independent color space (TICS), to help recognize micro-expressions. In this paper, we further show that CIELab and CIELuv are also helpful in recognizing micro-expressions, and we indicate why these three color spaces achieve better performance. A micro-expression color video clip is treated as a fourth-order tensor, i.e., a four-dimension array. The first two dimensions are the spatial information, the third is the temporal information, and the fourth is the color information. We transform the fourth dimension from RGB into TICS, in which the color components are as independent as possible. The combination of dynamic texture and independent color components achieves a higher accuracy than does that of RGB. In addition, we define a set of regions of interests (ROIs) based on the facial action coding system and calculated the dynamic texture histograms for each ROI. Experiments are conducted on two micro-expression databases, CASME and CASME 2, and the results show that the performances for TICS, CIELab, and CIELuv are better than those for RGB or gray.

As a general framework, Laplacian embedding, based on a pairwise similarity matrix, infers low dimensional representations from high dimensional data. However, it generally suffers from three issues: 1) algorithmic performance is sensitive to the size of neighbors; 2) the algorithm encounters the well known small sample size (SSS) problem; and 3) the algorithm de-emphasizes small distance pairs. To address these issues, here we propose exponential embedding using matrix exponential and provide a general framework for dimensionality reduction. In the framework, the matrix exponential can be roughly interpreted by the random walk over the feature similarity matrix, and thus is more robust. The positive definite property of matrix exponential deals with the SSS problem. The behavior of the decay function of exponential embedding is more significant in emphasizing small distance pairs. Under this framework, we apply matrix exponential to extend many popular Laplacian embedding algorithms, e.g., locality preserving projections, unsupervised discriminant projections, and marginal fisher analysis. Experiments conducted on the synthesized data, UCI, and the Georgia Tech face database show that the proposed new framework can well address the issues mentioned above.

As one of the fundamental features, color provides useful information and plays an important role for face recognition. Generally, the choice of a color space is different for different visual tasks. How can a color space be sought for the specific face recognition problem? To address this problem, we propose a sparse tensor discriminant color space (STDCS) model that represents a color image as a third-order tensor in this paper. The model cannot only keep the underlying spatial structure of color images but also enhance robustness and give intuitionistic or semantic interpretation. STDCS transforms the eigenvalue problem to a series of regression problems. Then one spare color space transformation matrix and two sparse discriminant projection matrices are obtained by applying lasso or elastic net on the regression problems. The experiments on three color face databases, AR, Georgia Tech, and Labeled Faces in the Wild face databases, show that both the performance and the robustness of the proposed method outperform those of the state-of-the-art TDCS model.

Recent research efforts reveal that color may provide useful information for face recognition. For different visual tasks, the choice of a color space is generally different. How can a color space be sought for the specific face recognition problem? To address this problem, this paper represents a color image as a third-order tensor and presents the tensor discriminant color space (TDCS) model. The model can keep the underlying spatial structure of color images. With the definition of n-mode between-class scatter matrices and within-class scatter matrices, TDCS constructs an iterative procedure to obtain one color space transformation matrix and two discriminant projection matrices by maximizing the ratio of these two scatter matrices. The experiments are conducted on two color face databases, AR and Georgia Tech face databases, and the results show that both the performance and the efficiency of the proposed method are better than those of the state-of-the-art color image discriminant model, which involve one color space transformation matrix and one discriminant projection matrix, specifically in a complicated face database with various pose variations.

The rigorous theoretical analyses of algorithms for #SAT have been proposed in the literature. As we know, previous algorithms for solving #SAT have been analyzed only regarding the number of variables as the parameter. However, the time complexity for solving #SAT instances depends not only on the number of variables, but also on the number of clauses. Therefore, it is significant to exploit the time complexity from the other point of view, i.e. the number of clauses. In this paper, we present algorithms for solving #2-SAT and #3-SAT with rigorous complexity analyses using the number of clauses as the parameter. By analyzing the algorithms, we obtain the new worst-case upper bounds O(1.1892m) for #2-SAT and O(1.4142m) for #3-SAT, where m is the number of clauses.

This paper extracts automotive marketing information, constructs data warehouse, adopts an improved ID3 decision tree model and an association rule model to do data mining, and then obtains prediction information of automotive customers' behavior. Experimental and comparative results verify the validity and accuracy of the prediction results.

Invariance transformation (IT) is a rewarding technique to facilitate classification. But it is often difficult to derive its definition. This paper derives a local invariance transformation definition from SVM decision function. The corresponding IT-distance definition is consequently designed in both input space and feature space. And a classification algorithm based on IT and Nearest Neighbor rule is proposed, named as ITNN. ITNN exploits hyper sphere centers as class prototypes and labels data using a weighted voting strategy. ITNN is of computational ease brought by training dataset reduction and hyper parameter self-tuning. We describe experimental evidence of classification performance improved by ITNN on real datasets over state of the arts.

BACKGROUND: The prediction of conformational B-cell epitopes is one of the most important goals in immunoinformatics. The solution to this problem, even if approximate, would help in designing experiments to precisely map the residues of interaction between an antigen and an antibody. Consequently, this area of research has received considerable attention from immunologists, structural biologists and computational biologists. Phage-displayed random peptide libraries are powerful tools used to obtain mimotopes that are selected by binding to a given monoclonal antibody (mAb) in a similar way to the native epitope. These mimotopes can be considered as functional epitope mimics. Mimotope analysis based methods can predict not only linear but also conformational epitopes and this has been the focus of much research in recent years. Though some algorithms based on mimotope analysis have been proposed, the precise localization of the interaction site mimicked by the mimotopes is still a challenging task. RESULTS: In this study, we propose a method for B-cell epitope prediction based on mimotope analysis called Pep-3D-Search. Given the 3D structure of an antigen and a set of mimotopes (or a motif sequence derived from the set of mimotopes), Pep-3D-Search can be used in two modes: mimotope or motif. To evaluate the performance of Pep-3D-Search to predict epitopes from a set of mimotopes, 10 epitopes defined by crystallography were compared with the predicted results from a Pep-3D-Search: the average Matthews correlation coefficient (MCC), sensitivity and precision were 0.1758, 0.3642 and 0.6948. Compared with other available prediction algorithms, Pep-3D-Search showed comparable MCC, specificity and precision, and could provide novel, rational results. To verify the capability of Pep-3D-Search to align a motif sequence to a 3D structure for predicting epitopes, 6 test cases were used. The predictive performance of Pep-3D-Search was demonstrated to be superior to that of other similar programs. Furthermore, a set of test cases with different lengths of sequences was constructed to examine Pep-3D-Search's capability in searching sequences on a 3D structure. The experimental results demonstrated the excellent search capability of Pep-3D-Search, especially when the length of the query sequence becomes longer; the iteration numbers of Pep-3D-Search to precisely localize the target paths did not obviously increase. This means that Pep-3D-Search has the potential to quickly localize the epitope regions mimicked by longer mimotopes. CONCLUSION: Our Pep-3D-Search provides a powerful approach for localizing the surface region mimicked by the mimotopes. As a publicly available tool, Pep-3D-Search can be utilized and conveniently evaluated, and it can also be used to complement other existing tools. The data sets and open source code used to obtain the results in this paper are available on-line and as supplementary material. More detailed materials may be accessed at (http://kyc.nenu.edu.cn/Pep3DSearch/).

A novel two-phase support vector clustering (TPSVC) algorithm is proposed in this paper, which is implemented in multi-relational data mining (MRDM). Based on the designed kernel which is incorporated with MRDM environment, TPSVC provides an appreciate description of cluster contours using support vectors at the first step and then a support vector machine (SVM) classification procedure is employed to further extract the information of cluster central zones. The algorithm does the cluster assignment according to desired definition of affinity without suffering the expensive operations of adjacent matrix computation used in traditional support vector clustering (SVC). Experimental results indicate that the designed kernel can capture the features of relational schema and TPSVC is of fine clustering performance

The issues in the field of association rules mining with specific items are discussed first. To solve the problems in the ordinary algorithm, we put forward a new but efficient mining algorithm with item-constraints, called EclatII. We then give an analysis on the performance of the algorithm as well as on its strategy. The experimental result shows that the Eclatll algorithm is more robust in items of using "low support'"' and "long pattern" association rules than others.

The microeconomic framework for data mining assumes that an enterprise chooses a decision maximizing the overall utility over all customers. In item selection problem, the store wants to select J item set S that maximizes the overall profit. Based on the microeconomic view, we propose a novel algorithm ItemRank to solve the problem of item selection with the consideration of cross-selling effect which has two major contributions. First, we propose customer behavior model, and demonstrate it with the data of customer-oriented business. Second, we propose the novel algorithm ItemRank which is implemented on the basis of customer behavior model. According to the cross-selling effect and the self-profit of items, ItemRank algorithm could solve the problem of item order objectively and mechanically. We conduct detailed experiments to evaluate our proposed algorithm and experiment results confirm that the new methods have an excellent ability for profit mining and the performance meets the condition which requires better quality and efficiency

This paper constructs the appraisal index system of the industry competitiveness, compares the secondary industry competitiveness of the eight cities along Yangtse Rive in Jiangsu by the model of the grey incidence degree, and puts forward a series of countermeasures and suggestions to improve the secondary industry competitiveness of the Mid Jiangsu

Inspired by the idea of genetic algorithm, we propose two hybrid evolutionary algorithms based on PSO and GA methods through crossing over the PSO and GA algorithms. The main ideas of the two proposed methods are to integrate PSO and GA methods in parallel and series forms respectively. Simulations for a series of benchmark test functions show that both of the two proposed methods possess better ability to find the global optimum than that of the standard PSO algorithm.

An algorithm for solving multiobjective optimization problems is presented based on PSO through the improvement of the selection manner for global and individual extremum. The search for the Pareto optimal set of multiobjective optimization problems is performed. Numerical simulations show the effectiveness of the proposed algorithm.