Active Learning with Wavelets for Microarray Data

6th International Workshop, WILF 2005, Crema, Italy, September 15-17, 2005, Revised Selected Papers.In Supervised Learning it is assumed that is straightforward to obtained labeled data. However, in reality labeled data can be scarce or expensive to obtain. Active Learning (AL) is a way to deal with the above problem by asking for the labels of the most “informative” data points. We propose a novel AL method based on wavelet analysis, which pertains especially to the large number of dimensions (i.e. examined genes) of microarray experiments. DNA Microarray expression experiments permit the systematic study of the correlation of the expression of thousands of genes. We have applied our method on such data sets with encouraging results. In particular we studied data sets concerning: Small Round Blue Cell Tumours (4 types), Leukemia (2 types) and Lung Cancer (2 types)

Margin based Active Learning for LVQ Networks

Schleif F-M, Hammer B, Villmann T. Margin based Active Learning for LVQ Networks. Neurocomputing. 2007;70(7-9):1215-1224

PAINT : Pareto front interpolation for nonlinear multiobjective optimization

A method called PAINT is introduced for computationally expensive multiobjective optimization problems. The method interpolates between a given set of Pareto optimal outcomes. The interpolation provided by the PAINT method implies a mixed integer linear surrogate problem for the original problem which can be optimized with any interactive method to make decisions concerning the original problem. When the scalarizations of the interactive method used do not introduce nonlinearity to the problem (which is true e.g., for the synchronous NIMBUS method), the scalarizations of the surrogate problem can be optimized with available mixed integer linear solvers. Thus, the use of the interactive method is fast with the surrogate problem even though the problem is computationally expensive. Numerical examples of applying the PAINT method for interpolation are included.QC 20220131</p