Web news classification using neural networks based on PCA

In this paper, we propose a news web page classification method (WPCM). The WPCM uses a neural network with inputs obtained by both the principal components and class profile-based features (CPBF). The fixed number of regular words from each class will be used as a feature vectors with the reduced features from the PCA. These feature vectors are then used as the input to the neural networks for classification. The experimental evaluation demonstrates that the WPCM provides acceptable classification accuracy with the sports news datasets

Modeling the correlations of crude oil properties based on sensitivity based linear learning method

This paper presented a new prediction model of pressure–volume–temperature (PVT) properties of crudeoil systems using sensitivity based linear learning method (SBLLM). PVT properties are very important in the reservoir engineering computations. The accurate determination of these properties, such as bubble-point pressure and oil formation volume factor, is important in the primary and subsequent development of an oil field. Earlier developed models are confronted with several limitations especially their instability and inconsistency during predictions. In this paper, a sensitivitybasedlinearlearningmethod (SBLLM) prediction model for PVT properties is presented using three distinct databases while comparing forecasting performance, using several kinds of evaluation criteria and quality measures, with neural network and the three common empirical correlations. In the formulation used, sensitivity analysis coupled with a linear training algorithm for each of the two layers is employed which ensures that the learning curve stabilizes soon and behaves homogenously throughout the entire process operation. In this way, the model will be able to adequately model PVT properties faster with high stability and consistency. Empirical results from simulations demonstrated that the proposed SBLLM model produced good generalization performance, with high stability and consistency, which are requisites of good prediction models in reservoir characterization and modeling

Filtering and Smoothing for Linear Discrete-Time Distributed Parameter Systems Based on Wiener-Hopf Theory with Application to Estimation of Air Pollution

Optimal filtering and smoothing algorithms for linear discrete-time distributed parameter systems are derived by a unified approach based on the Wiener-Hopf theory. The Wiener-Hopf equation for the estimation problems is derived using the least-squares estimation error criterion. Using the basic equation, three types of the optimal smoothing estimators are derived, namely, fixed-point, fixed-interval, and fixed-lag smoothers. Finally, the results obtained are applied to estimation of atmospheric sulfur dioxide concentrations in the Tokushima prefecture of Japan

Estimation of Atmospheric Species Concentrations from Remote Sensing Data

A basic problem in the interpretation of atmospheric remote sensing data is to estimate species concentration distributions. Typical remote sensing data involve a field of view that moves across the region and represent integrated species burdens from the ground to the altitude of the instrument. The estimation problem arising from this special measurement configuration is solved based on the partial differential equation for atmospheric diffusion and Wiener-Hopf theory. The estimation of the concentration distribution downwind of a hypothetical continous ground-level source of pollutants is studied numerically

Fixed-point smoothing in Hilbert spaces

The fixed-point smoothing estimator and smoothing error covariance operator equations are derived for infinite-dimensional linear systems using both the Wiener-Hoph theory in Hilbert spaces developed by Falb and the abstract evolution theory. Since it is clear that the prediction problems can be solved by the same approach, the present results in conjunction with the work of Falb on filtering give a complete treatment of the infinite-dimensional linear estimation problem from the viewpoint of Wiener-Hoph theory. Finally, based on the optimal smoothing estimator in Hilbert space, the fixed-point smoothing estimator is derived for a linear distributed parameter system of parabolic type

Inferring gene regulatory networks from gene expression data by a dynamic Bayesian network-based model

Enabled by recent advances in bioinformatics, the inference of gene regulatory networks (GRNs) from gene expression data has garnered much interest from researchers. This is due to the need of researchers to understand the dynamic behavior and uncover the vast information lay hidden within the networks. In this regard, dynamic Bayesian network (DBN) is extensively used to infer GRNs due to its ability to handle time-series microarray data and modeling feedback loops. However, the efficiency of DBN in inferring GRNs is often hampered by missing values in expression data, and excessive computation time due to the large search space whereby DBN treats all genes as potential regulators for a target gene. In this paper, we proposed a DBN-based model with missing values imputation to improve inference efficiency, and potential regulators detection which aims to lessen computation time by limiting potential regulators based on expression changes. The performance of the proposed model is assessed by using time-series expression data of yeast cell cycle. The experimental results showed reduced computation time and improved efficiency in detecting gene-gene relationships

Inferring gene regulatory networks from gene expression data by a dynamic Bayesian network-based model

Enabled by recent advances in bioinformatics, the inference of gene regulatory networks (GRNs) from gene expression data has garnered much interest from researchers. This is due to the need of researchers to understand the dynamic behavior and uncover the vast information lay hidden within the networks. In this regard, dynamic Bayesian network (DBN) is extensively used to infer GRNs due to its ability to handle time-series microarray data and modeling feedback loops. However, the efficiency of DBN in inferring GRNs is often hampered by missing values in expression data, and excessive computation time due to the large search space whereby DBN treats all genes as potential regulators for a target gene. In this paper, we proposed a DBN-based model with missing values imputation to improve inference efficiency, and potential regulators detection which aims to lessen computation time by limiting potential regulators based on expression changes. The performance of the proposed model is assessed by using time-series expression data of yeast cell cycle. The experimental results showed reduced computation time and improved efficiency in detecting gene-gene relationships

Mobile agent routing for query retrieval using genetic algorithm

Mobile agents often have a task to collect data from several predefined sites.This should be done in an efficient way by minimizing the elapsed time.Usually these agents only know the list of sites but not the distances between them.This paper proposes a method to minimize a network routing time taken by the mobile agents to collect information from different sites using genetic algorithm (GA).The mobile agents repeat travelling over short routes and avoid longer ones.Mobile agents for query retrieval have used the GA to select the best routes that minimize the query retrieval time.The result shows that the proposed method provides good time minimization in retrieving the query results by the mobile agents based on different GA parameters

The Effect of Database Type on Face Recognition Performance for Surveillance Applications

Face recognition is one of the most important biometric approaches due to its potential applications in surveillance monitoring and access control. This paper presents a PCA and SVM based face recognition system for surveillance application. A proposed training database selection criteria suitable for surveillance application which consist of 1 mean image per distance class from all the available database sessions is also used for the face recognition system. In this study, the ChokePoint database, specifically the grayscale (PPG) and colored (MPCI) versions of the ChokePoint database, were selected for this work. The objectives of this work is to investigate the effect of the using different training data as well as using different similarity matching method on face recognition for surveillance application. It was found that regardless of the type of databases used, the recognition output pattern on different training data selection criteria was found to be similar. It was also found that regardless of the similarity matching method used, the face recognition system also shows the same recognition performance pattern. The experiment suggests that the proposed training database selection criteria will give similar recognition performance regardless of databases type or face recognition technique used. Overall, the ChokePoint colour database (MPCI) gives better recognition performance than the ChokePoint grayscale database (PPG). Finally, it can be concluded that using 1 mean image per class from all the available database sessions (Case-6) is better compared to using 1 image per class that are randomly selected from all the database sessions (Case-4). Even though a straight comparison between this work proposed system and several published system is not meaningful as different face recognition approaches and experiment criteria are used, nevertheless, this work proposed method performs with 100% recall and reject recognition rate

A Comparison of the YCBCR Color Space with Gray Scale for Face Recognition for Surveillance Applications

Face recognition is an important biometric method because of its potential applications in many fields, such as access control and surveillance. In this paper, the performance of the individual channels from the YCBCR colour space on face recognition for surveillance applications is investigated and compared with the performance of the grayscale. In addition, the performance of fusing two or more colour channels is also compared with that of the grayscale. Three cases with a different number of training images per persons were used as a test bed. It was found out that, the grayscale always outperforms the individual channel. However, the fusion of CBxCR with any other channel outperforms the grayscale when three images of the same class from the same database are used for training. Regardless of the cases used, the CBxCR channel always gave the best performance for the individual colour channels. It was found that, in general, increasing the number of fused channels increases the performance of the system. It was also found that the grayscale channel is the better choice for face recognition since it contains better quality edges and visual features which are essential for face recognition