We present a new implementation of the commonly used Box-fitting Least Squares (BLS) algorithm, for detection transiting exoplanets in photometric data. Unlike BLS, our - Sparse BLS (SBLS), does not use binning data into phase bins, nor it any kind grid. Thus, its efficiency depend on transit phase, and is therefore slightly better than that BLS. For sparse data, also significantly faster It pe...

We consider the problem of nonnegative tensor factorization. Our aim is to derive an efficient algorithm that is also suitable for parallel implementation. We adopt the alternating optimization (AO) framework and solve each matrix nonnegative least-squares problem via a Nesterov-type algorithm for strongly convex problems. We describe two parallel implementations of the algorithm, with and with...

A method for the construction of open approximate models from vector time series Preface PhD research is a largely open proces in which a stimulating environment plays a crucial role. I am indebted to several people and institutions that shaped such an environment for me during the years since April 1990. First and for all, I would like to thank my supervisor, Christiaan Heij. He set me on the ...

We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible sequential nature) of training data arising in reinforcement learning we employ a subspace based variant of LS-SVM that sequentially processes the data and is hence especially suited for online learning. This approach is adapte...

Simultaneous spectrophotometric analysis of a multi-component dosage form of olmesartan, amlodipine and hydrochlorothiazide used for the treatment of hypertension has been carried out using various chemometric methods. Multivariate calibration methods include classical least squares (CLS) executed by net analyte processing (NAP-CLS), orthogonal signal correction (OSC-CLS) and direct orthogonal ...

This paper introduces a randomized variation of the alternating least squares (ALS) algorithm for rank reduction of canonical tensor formats. The aim is to address the potential numerical ill-conditioning of least squares matrices at each ALS iteration. The proposed algorithm, dubbed randomized ALS, mitigates large condition numbers via projections onto random tensors, a technique inspired by w...