11702143
Adaptive nonlinear discriminant analysis by regularized minimum squared errors
Kernelized nonlinear extensions of Fisher's discriminant analysis, discriminant analysis based on generalized singular value decomposition (LDA/GSVD), and discriminant analysis based on the minimum squared error formulation (MSE) have recently been widely utilized for handling undersampled high-dimensional problems and nonlinearly separable data sets. As the data sets are modified from incorporating new data points and deleting obsolete data points, there is a need to develop efficient updating and downdating algorithms for these methods to avoid expensive recomputation of the solution from scratch. In this paper, an efficient algorithm for adaptive linear and nonlinear kernel discriminant analysis based on regularized MSE, called adaptive KDA/RMSE, is proposed. In adaptive KDA/RMSE, updating and downdating of the computationally expensive eigenvalue decomposition (EVD) or singular value decomposition (SVD) is approximated by updating and downdating of the QR decomposition achieving an order of magnitude speed up. This fast algorithm for adaptive kernelized discriminant analysis is designed by utilizing regularization techniques and the relationship between linear and nonlinear discriminant analysis and the MSE. In addition, an efficient algorithm to compute leave-one-out cross validation is also introduced by utilizing downdating of KDA/RMSE.
8166541
Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis
MOTIVATION
Many practical pattern recognition problems require non-negativity constraints. For example, pixels in digital images and chemical concentrations in bioinformatics are non-negative. Sparse non-negative matrix factorizations (NMFs) are useful when the degree of sparseness in the non-negative basis matrix or the non-negative coefficient matrix in an NMF needs to be controlled in approximating high-dimensional data in a lower dimensional space.


RESULTS
In this article, we introduce a novel formulation of sparse NMF and show how the new formulation leads to a convergent sparse NMF algorithm via alternating non-negativity-constrained least squares. We apply our sparse NMF algorithm to cancer-class discovery and gene expression data analysis and offer biological analysis of the results obtained. Our experimental results illustrate that the proposed sparse NMF algorithm often achieves better clustering performance with shorter computing time compared to other existing NMF algorithms.


AVAILABILITY
The software is available as supplementary material.
27330844
Efficient processing of regular path joins using PID
Abstract XML is data that has no fixed structure. So it is hard to design a schema for storing and querying an XML data. Instead of a fixed schema, graph-based data models are widely adopted for querying XML. Queries on XML are based on paths in a data graph. A meaningful query usually has several paths in it, but much of recent research is more concerned with optimizing a single path in a query. In this paper, we present an efficient technique for processing multiple path expressions in a query. We implemented our technique and present preliminary performance results.
9030536
Using enterprise reference models for automated ISO 9000 compliance evaluation
A computational enterprise model representing key facets of are organization care be are effective tool to consider where planning are enterprise information architecture. For example, a specific organization's quality management business processes and organizational structures can be represented using such a model, and then compared to a reference model of "good" processes and structures, such as the ISO 9000 standards. The specific and reference models can be represented using common entities, attributes, and relationships-comprising general schema or data model-which are then formally defined and constrained. These definitions and constraints can be used as inference rules applied to the models. Hence identification of differences between the models as quality problems can be automatically inferred, as can the analysis and correction of problems. In this paper; the TOTE ISO 9000 Micro-Theory is presented as a formal reference model of quality goodness. ISO 9000 requirements represented as inference rules in the micro-theory are applied to facts about an organization's quality management processes and structures, and conformance or nonconformance to requirements is automatically inferred. TOTE Ontologies for Quality Modeling are the common data and logical (formal definitions and constraints) models of the reference and specific organization's models. The example use of the micro-theory demonstrates enterprise model use for a pre-audit, which lowers the cost and time for improving quality through achieving ISO 9000 compliance. Since these enterprise models are constructed using ontologies, benefits of using ontologies such as model re-usability and sharability can be reaped.
16590165
New Public-Key Authentication Watermarking for JBIG2 Resistant to Parity Attacks
An authentication watermark is a hidden data inserted into an image that allows detecting any alteration made in the image. AWTs (Authentication Watermarking Techniques) normally make use of secret- or public-key cryptographic cipher to compute the authentication signature of the image, and inserts it into the image itself. Many previous public-key AWTs for uncompressed binary images can be attacked by an image adulterating technique named “parity attack.” JBIG2 is an international standard for compressing bi-level images (both lossy and lossless). The creation of secure AWTs for compressed binary images is an important practical problem. However, it seems that no AWT for JBIG2 resistant to parity attacks has ever been proposed. This paper proposes a new data-hiding method to embed information in the text region of JBIG2 files. Then, we use this technique to design a new AWT for JBIG2-encoded images resistant to parity attacks. Both the secret- and public-key versions of the proposed AWT are completely immune against parity attacks. Moreover, watermarked images are visually pleasant, without visible salt and pepper noise. Image authenticity verification can be performed in either JBIG2 file itself or in the binary image obtained by decoding the JBIG2 file.
4651323
Face description based on decomposition and combining of a facial space with LDA
We propose a method of efficient face description for facial image retrieval from a large data set. The novel descriptor is obtained by decomposing the face image into several components and then combining the component features. The decomposition combined with LDA (linear discriminant analysis) provides discriminative facial features that are less sensitive to light and pose changes. Each component is represented in its Fisher space and another LDA is then applied to compactly combine the features of the components. To enhance retrieval accuracy further, a simple pose classification and transformation technique is performed, followed by recursive matching. The experimental results obtained on the MPEG-7 data set show an impressive accuracy of our algorithm as compared with the conventional PCA/ICA/LDA methods.
32327387
Minus domination number in k-partite graphs
A function f defined on the vertices of a graph G=(V,E),f:V?{-1,0,1} is a minus dominating function if the sum of its values over any closed neighborhood is at least one. The weight of a minus dominating function is f(V)=?v?Vf(v). The minus domination number of a graph G, denoted by γ-(G), equals the minimum weight of a minus dominating function of G. In this paper, a sharp lower bound on γ- of k-partite graphs is given. The special case k=2 implies that a conjecture proposed by Dunbar et al. (Discrete Math. 199(1999) 35) is true.