Adaptive modality selection algorithm in robot-assisted cognitive training

© 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Interaction of socially assistive robots with users is based on social cues coming from different interaction modalities, such as speech or gestures. However, using all modalities at all times may be inefficient as it can overload the user with redundant information and increase the task completion time. Additionally, users may favor certain modalities over the other as a result of their disability or personal preference. In this paper, we propose an Adaptive Modality Selection (AMS) algorithm that chooses modalities depending on the state of the user and the environment, as well as user preferences. The variables that describe the environment and the user state are defined as resources, and we posit that modalities are successful if certain resources possess specific values during their use. Besides the resources, the proposed algorithm takes into account user preferences which it learns while interacting with users. We tested our algorithm in simulations, and we implemented it on a robotic system that provides cognitive training, specifically Sequential memory exercises. Experimental results show that it is possible to use only a subset of available modalities without compromising the interaction. Moreover, we see a trend for users to perform better when interacting with a system with implemented AMS algorithm.Peer ReviewedPostprint (author's final draft

The Sloan Digital Sky Survey Quasar Lens Search. I. Candidate Selection Algorithm

We present an algorithm for selecting an uniform sample of gravitationally lensed quasar candidates from low-redshift (0.6<z<2.2) quasars brighter than i=19.1 that have been spectroscopically identified in the SDSS. Our algorithm uses morphological and color selections that are intended to identify small- and large-separation lenses, respectively. Our selection algorithm only relies on parameters that the SDSS standard image processing pipeline generates, allowing easy and fast selection of lens candidates. The algorithm has been tested against simulated SDSS images, which adopt distributions of field and quasar parameters taken from the real SDSS data as input. Furthermore, we take differential reddening into account. We find that our selection algorithm is almost complete down to separations of 1'' and flux ratios of 10^-0.5. The algorithm selects both double and quadruple lenses. At a separation of 2'', doubles and quads are selected with similar completeness, and above (below) 2'' the selection of quads is better (worse) than for doubles. Our morphological selection identifies a non-negligible fraction of single quasars: To remove these we fit images of candidates with a model of two point sources and reject those with unusually small image separations and/or large magnitude differences between the two point sources. We estimate the efficiency of our selection algorithm to be at least 8% at image separations smaller than 2'', comparable to that of radio surveys. The efficiency declines as the image separation increases, because of larger contamination from stars. We also present the magnification factor of lensed images as a function of the image separation, which is needed for accurate computation of magnification bias.Comment: 15 pages, 17 figures, 4 tables, accepted for publication in A

Correlation and variable importance in random forests

This paper is about variable selection with the random forests algorithm in presence of correlated predictors. In high-dimensional regression or classification frameworks, variable selection is a difficult task, that becomes even more challenging in the presence of highly correlated predictors. Firstly we provide a theoretical study of the permutation importance measure for an additive regression model. This allows us to describe how the correlation between predictors impacts the permutation importance. Our results motivate the use of the Recursive Feature Elimination (RFE) algorithm for variable selection in this context. This algorithm recursively eliminates the variables using permutation importance measure as a ranking criterion. Next various simulation experiments illustrate the efficiency of the RFE algorithm for selecting a small number of variables together with a good prediction error. Finally, this selection algorithm is tested on the Landsat Satellite data from the UCI Machine Learning Repository

Algorithm Selection Framework for Cyber Attack Detection

The number of cyber threats against both wired and wireless computer systems and other components of the Internet of Things continues to increase annually. In this work, an algorithm selection framework is employed on the NSL-KDD data set and a novel paradigm of machine learning taxonomy is presented. The framework uses a combination of user input and meta-features to select the best algorithm to detect cyber attacks on a network. Performance is compared between a rule-of-thumb strategy and a meta-learning strategy. The framework removes the conjecture of the common trial-and-error algorithm selection method. The framework recommends five algorithms from the taxonomy. Both strategies recommend a high-performing algorithm, though not the best performing. The work demonstrates the close connectedness between algorithm selection and the taxonomy for which it is premised.Comment: 6 pages, 7 figures, 1 table, accepted to WiseML '2