Estimating extreme value cumulative distribution functions using bias-corrected kernel approaches

We propose a new kernel estimation of the cumulative distribution function based on transformation and on bias reducing techniques. We derive the optimal bandwidth that minimises the asymptotic integrated mean squared error. The simulation results show that our proposed kernel estimation improves alternative approaches when the variable has an extreme value distribution with heavy tail and the sample size is small.

Learning Preferences with Kernel-Based Methods

Learning of preference relations has recently received significant attention in machine learning community. It is closely related to the classification and regression analysis and can be reduced to these tasks. However, preference learning involves prediction of ordering of the data points rather than prediction of a single numerical value as in case of regression or a class label as in case of classification. Therefore, studying preference relations within a separate framework facilitates not only better theoretical understanding of the problem, but also motivates development of the efficient algorithms for the task. Preference learning has many applications in domains such as information retrieval, bioinformatics, natural language processing, etc. For example, algorithms that learn to rank are frequently used in search engines for ordering documents retrieved by the query. Preference learning methods have been also applied to collaborative filtering problems for predicting individual customer choices from the vast amount of user generated feedback. In this thesis we propose several algorithms for learning preference relations. These algorithms stem from well founded and robust class of regularized least-squares methods and have many attractive computational properties. In order to improve the performance of our methods, we introduce several non-linear kernel functions. Thus, contribution of this thesis is twofold: kernel functions for structured data that are used to take advantage of various non-vectorial data representations and the preference learning algorithms that are suitable for different tasks, namely efficient learning of preference relations, learning with large amount of training data, and semi-supervised preference learning. Proposed kernel-based algorithms and kernels are applied to the parse ranking task in natural language processing, document ranking in information retrieval, and remote homology detection in bioinformatics domain. Training of kernel-based ranking algorithms can be infeasible when the size of the training set is large. This problem is addressed by proposing a preference learning algorithm whose computation complexity scales linearly with the number of training data points. We also introduce sparse approximation of the algorithm that can be efficiently trained with large amount of data. For situations when small amount of labeled data but a large amount of unlabeled data is available, we propose a co-regularized preference learning algorithm. To conclude, the methods presented in this thesis address not only the problem of the efficient training of the algorithms but also fast regularization parameter selection, multiple output prediction, and cross-validation. Furthermore, proposed algorithms lead to notably better performance in many preference learning tasks considered.

Kernel-Based Ranking. Methods for Learning and Performance Estimation

Machine learning provides tools for automated construction of predictive models in data intensive areas of engineering and science. The family of regularized kernel methods have in the recent years become one of the mainstream approaches to machine learning, due to a number of advantages the methods share. The approach provides theoretically well-founded solutions to the problems of under- and overfitting, allows learning from structured data, and has been empirically demonstrated to yield high predictive performance on a wide range of application domains. Historically, the problems of classification and regression have gained the majority of attention in the field. In this thesis we focus on another type of learning problem, that of learning to rank. In learning to rank, the aim is from a set of past observations to learn a ranking function that can order new objects according to how well they match some underlying criterion of goodness. As an important special case of the setting, we can recover the bipartite ranking problem, corresponding to maximizing the area under the ROC curve (AUC) in binary classification. Ranking applications appear in a large variety of settings, examples encountered in this thesis include document retrieval in web search, recommender systems, information extraction and automated parsing of natural language. We consider the pairwise approach to learning to rank, where ranking models are learned by minimizing the expected probability of ranking any two randomly drawn test examples incorrectly. The development of computationally efficient kernel methods, based on this approach, has in the past proven to be challenging. Moreover, it is not clear what techniques for estimating the predictive performance of learned models are the most reliable in the ranking setting, and how the techniques can be implemented efficiently. The contributions of this thesis are as follows. First, we develop RankRLS, a computationally efficient kernel method for learning to rank, that is based on minimizing a regularized pairwise least-squares loss. In addition to training methods, we introduce a variety of algorithms for tasks such as model selection, multi-output learning, and cross-validation, based on computational shortcuts from matrix algebra. Second, we improve the fastest known training method for the linear version of the RankSVM algorithm, which is one of the most well established methods for learning to rank. Third, we study the combination of the empirical kernel map and reduced set approximation, which allows the large-scale training of kernel machines using linear solvers, and propose computationally efficient solutions to cross-validation when using the approach. Next, we explore the problem of reliable cross-validation when using AUC as a performance criterion, through an extensive simulation study. We demonstrate that the proposed leave-pair-out cross-validation approach leads to more reliable performance estimation than commonly used alternative approaches. Finally, we present a case study on applying machine learning to information extraction from biomedical literature, which combines several of the approaches considered in the thesis. The thesis is divided into two parts. Part I provides the background for the research work and summarizes the most central results, Part II consists of the five original research articles that are the main contribution of this thesis.

Recording and reproducing Soundscapes : using and interpreting data in a creative way

http://elo.aalto.fi/fi/studies/elomedia/dataseminar/

Functional characterization of acetylated Brazil nut (Bertholletia excelsa HBK) kernel globulin

Defatted Brazil nut kernel flour, a rich source of high quality proteins, is presently being utilized in the formulation of animal feeds. One of the possible ways to improve its utilization for human consumption is through improvement in its functional properties. In the present study, changes in some of the functional properties of Brazil nut kernel globulin were evaluated after acetylation at 58.6, 66.2 and 75.3% levels. The solubility of acetylated globulin was improved above pH 6.0 but was reduced in the pH range of 3.0-4.0. Water and oil absorption capacity, as well as the viscosity increased with increase in the level of acetylation. Level of modification also influenced the emulsifying capacity: decreased at pH 3.0, but increased at pH 7.0 and 9.0. Highest emulsion activity (approximately 62.2%) was observed at pH 3.0 followed by pH 9.0 and pH 7.0 and least (about 11.8%) at pH 5.0. Emulsion stability also followed similar behavior as that of emulsion activity.

Effects of the mechanical damage on the water absorption process by corn kernel

The purpose of this study was to investigate and model the water absorption process by corn kernels with different levels of mechanical damage Corn kernels of AG 1510 variety with moisture content of 14.2 (% d.b.) were used. Different mechanical damage levels were indirectly evaluated by electrical conductivity measurements. The absorption process was based on the industrial corn wet milling process, in which the product was soaked with a 0.2% sulfur dioxide (SO2) solution and 0.55% lactic acid (C3H6O3) in distilled water, under controlled temperatures of 40, 50, 60, and 70 ºC and different mechanical damage levels. The Peleg model was used for the analysis and modeling of water absorption process. The conclusion is that the structural changes caused by the mechanical damage to the corn kernels influenced the initial rates of water absorption, which were higher for the most damaged kernels, and they also changed the equilibrium moisture contents of the kernels. The Peleg model was well adjusted to the experimental data presenting satisfactory values for the analyzed statistic parameters for all temperatures regardless of the damage level of the corn kernels.

Characterization, physicochemical stability, and evaluation of in vitro digestibility of solid lipid microparticles produced with palm kernel oil and tristearin

Solid lipid particles have been investigated by food researchers due to their ability to enhance the incorporation and bioavailability of lipophilic bioactives in aqueous formulations. The objectives of this study were to evaluate the physicochemical stability and digestibility of lipid microparticles produced with tristearin and palm kernel oil. The motivation for conducting this study was the fact that mixing lipids can prevent the expulsion of the bioactive from the lipid core and enhance the digestibility of lipid structures. The lipid microparticles containing different palm kernel oil contents were stable after 60 days of storage according to the particle size and zeta potential data. Their calorimetric behavior indicated that they were composed of a very heterogeneous lipid matrix. Lipid microparticles were stable under various conditions of ionic strength, sugar concentration, temperature, and pH. Digestibility assays indicated no differences in the release of free fatty acids, which was approximately 30% in all analises. The in vitro digestibility tests showed that the amount of palm kernel in the particles did not affect the percentage of lipolysis, probably due to the high amount of surfactants used and/or the solid state of the microparticles.

An Improved Color Video Super-Resolution Using Kernel Regression and Fuzzy Enhancement

An improved color video super-resolution technique using kernel regression and fuzzy enhancement is presented in this paper. A high resolution frame is computed from a set of low resolution video frames by kernel regression using an adaptive Gaussian kernel. A fuzzy smoothing filter is proposed to enhance the regression output. The proposed technique is a low cost software solution to resolution enhancement of color video in multimedia applications. The performance of the proposed technique is evaluated using several color videos and it is found to be better than other techniques in producing high quality high resolution color videos

Can commercialization of NTFPs alleviate poverty? A case study of Ricinodendron heudelotii (Baill.) Pierre ex Pax. kernel marketing in Cameroon

Ricinodendron heudelotii (Baill.) Pierre ex Pax. kernel (njansang) commercialization has been promoted by the World Agroforestry Centre (ICRAF) in project villages in Cameroon with the aim to alleviate poverty for small-scale farmers. We evaluated to what extent development interventions improved the financial situation of households by comparing project and control households. The financial importance of njansang to household livelihoods between 2005 and 2010 was investigated through semi-structured questionnaires with retrospective questions, focus group discussions, interviews and wealth-ranking exercises. The importance of njansang increased strongly in the entire study region and the increase was significantly larger in project households. Moreover, absolute numbers of income from njansang commercialization as well as relative importance of njansang in total cash income, increased significantly more in project households (p < 0.05). Although the lower wealth class households could increase their income through njansang trade, the upper wealth class households benefited more from the projects' interventions. Group sales as conducted in project villages did not lead to significantly higher prices and should be reconsidered. Hence, promotion of njansang had a positive effect on total cash income and can still be improved. The corporative actors for njansang commercialization are encouraged to adapt their strategies to ensure that also the lower wealth class households benefit from the conducted project interventions. In this respect, frequent project monitoring and impact analysis are important tools to accomplish this adaptation.

A Note on the Generalization Performance of Kernel Classifiers with Margin

We present distribution independent bounds on the generalization misclassification performance of a family of kernel classifiers with margin. Support Vector Machine classifiers (SVM) stem out of this class of machines. The bounds are derived through computations of the $V_gamma$ dimension of a family of loss functions where the SVM one belongs to. Bounds that use functions of margin distributions (i.e. functions of the slack variables of SVM) are derived.

Sparse Correlation Kernel Analysis and Reconstruction

This paper presents a new paradigm for signal reconstruction and superresolution, Correlation Kernel Analysis (CKA), that is based on the selection of a sparse set of bases from a large dictionary of class- specific basis functions. The basis functions that we use are the correlation functions of the class of signals we are analyzing. To choose the appropriate features from this large dictionary, we use Support Vector Machine (SVM) regression and compare this to traditional Principal Component Analysis (PCA) for the tasks of signal reconstruction, superresolution, and compression. The testbed we use in this paper is a set of images of pedestrians. This paper also presents results of experiments in which we use a dictionary of multiscale basis functions and then use Basis Pursuit De-Noising to obtain a sparse, multiscale approximation of a signal. The results are analyzed and we conclude that 1) when used with a sparse representation technique, the correlation function is an effective kernel for image reconstruction and superresolution, 2) for image compression, PCA and SVM have different tradeoffs, depending on the particular metric that is used to evaluate the results, 3) in sparse representation techniques, L_1 is not a good proxy for the true measure of sparsity, L_0, and 4) the L_epsilon norm may be a better error metric for image reconstruction and compression than the L_2 norm, though the exact psychophysical metric should take into account high order structure in images.

A comparison of the alr and ilr transformations for kernel density estimation of compositional data

In a seminal paper, Aitchison and Lauder (1985) introduced classical kernel density estimation techniques in the context of compositional data analysis. Indeed, they gave two options for the choice of the kernel to be used in the kernel estimator. One of these kernels is based on the use the alr transformation on the simplex SD jointly with the normal distribution on RD-1. However, these authors themselves recognized that this method has some deficiencies. A method for overcoming these dificulties based on recent developments for compositional data analysis and multivariate kernel estimation theory, combining the ilr transformation with the use of the normal density with a full bandwidth matrix, was recently proposed in Martín-Fernández, Chacón and Mateu- Figueras (2006). Here we present an extensive simulation study that compares both methods in practice, thus exploring the finite-sample behaviour of both estimators

Antioxidant and tyrosinase inhibitory activity of mango seed kernel by product

The antioxidant and tyrosinase inhibitory properties of extracts of mango seed kernel (Mangifera indica L.), which is normally discarded when the fruit is processed, were studied. Extracts contained phenolic components by a high antioxidant activity, which was assessed in homogeneous solution by the 2,2-diphenyt-1-picrylhydrazyl radical and 2,2'-azinobis (3-ethylbenzothialozinesulfonic acid) radical cation-scavenging assays and in an emulsion with the ferric thiocyanate test. The extracts also possessed tyrosinase inhibitory activity. Drying conditions and extraction solvent were varied, and optimum conditions for preparation of mango seed kernel extract were found to be sun-drying with ethanol extraction at room temperature. Refluxing in acidified ethanol gave an increase in yield and the obtained extract had the highest content of total phenolics, and also was the most effective antioxidant with the highest radical-scavenging, metal-chelating and tyrosinase inhibitory activity. The extracts did not cause acute irritation of rabbit skins. Our study for the first time reveals the high total phenol content, radical-scavenging, metal-chelating and tyrosinase inhibitory activities of the extract from mango seed kernel. This extract may be suitable for use in food, cosmetic, nutraceutical and pharmaceutical applications. (C) 2009 Elsevier Ltd. All rights reserved.

A sparse kernel density estimation algorithm using forward constrained regression

Using the classical Parzen window (PW) estimate as the target function, the sparse kernel density estimator is constructed in a forward constrained regression manner. The leave-one-out (LOO) test score is used for kernel selection. The jackknife parameter estimator subject to positivity constraint check is used for the parameter estimation of a single parameter at each forward step. As such the proposed approach is simple to implement and the associated computational cost is very low. An illustrative example is employed to demonstrate that the proposed approach is effective in constructing sparse kernel density estimators with comparable accuracy to that of the classical Parzen window estimate.