<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Archiving and Interchange DTD v2.3 20070202//EN" "archivearticle.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="methods-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Hum. Neurosci.</journal-id>
<journal-title>Frontiers in Human Neuroscience</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Hum. Neurosci.</abbrev-journal-title>
<issn pub-type="epub">1662-5161</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fnhum.2017.00015</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Neuroscience</subject>
<subj-group>
<subject>Methods</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>A Non-parametric Approach to the Overall Estimate of Cognitive Load Using NIRS Time Series</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Keshmiri</surname> <given-names>Soheil</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="author-notes" rid="fn001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/388201/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Sumioka</surname> <given-names>Hidenobu</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/126871/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Yamazaki</surname> <given-names>Ryuji</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/231676/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Ishiguro</surname> <given-names>Hiroshi</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Hiroshi Ishiguro Laboratories, Advanced Telecommunications Research Institute International</institution> <country>Kyoto, Japan</country></aff>
<aff id="aff2"><sup>2</sup><institution>The Graduate School of Engineering Science, Osaka University</institution> <country>Osaka, Japan</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Stephane Perrey, University of Montpellier, France</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Noman Naseer, Air University, Pakistan; Stewart Martin, University of Hull, UK</p></fn>
<fn fn-type="corresp" id="fn001"><p>&#x0002A;Correspondence: Soheil Keshmiri <email>soheil&#x00040;atr.jp</email></p></fn>
</author-notes>
<pub-date pub-type="epub">
<day>03</day>
<month>02</month>
<year>2017</year>
</pub-date>
<pub-date pub-type="collection">
<year>2017</year>
</pub-date>
<volume>11</volume>
<elocation-id>15</elocation-id>
<history>
<date date-type="received">
<day>04</day>
<month>11</month>
<year>2016</year>
</date>
<date date-type="accepted">
<day>09</day>
<month>01</month>
<year>2017</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2017 Keshmiri, Sumioka, Yamazaki and Ishiguro.</copyright-statement>
<copyright-year>2017</copyright-year>
<copyright-holder>Keshmiri, Sumioka, Yamazaki and Ishiguro</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract>
<p>We present a non-parametric approach to prediction of the n-back <italic>n</italic> &#x02208; {1, 2} task as a proxy measure of mental workload using Near Infrared Spectroscopy (NIRS) data. In particular, we focus on measuring the mental workload through hemodynamic responses in the brain induced by these tasks, thereby realizing the potential that they can offer for their detection in real world scenarios (e.g., difficulty of a conversation). Our approach takes advantage of intrinsic linearity that is inherent in the components of the NIRS time series to adopt a one-step regression strategy. We demonstrate the correctness of our approach through its mathematical analysis. Furthermore, we study the performance of our model in an inter-subject setting in contrast with state-of-the-art techniques in the literature to show a significant improvement on prediction of these tasks (82.50 and 86.40% for female and male participants, respectively). Moreover, our empirical analysis suggest a gender difference effect on the performance of the classifiers (with male data exhibiting a higher non-linearity) along with the left-lateralized activation in both genders with higher specificity in females.</p>
</abstract>
<kwd-group>
<kwd>linear regression</kwd>
<kwd>curvilinear regression</kwd>
<kwd>working memory</kwd>
<kwd>near-infrared spectroscopy</kwd>
<kwd>mental workload prediction</kwd>
</kwd-group>
<counts>
<fig-count count="4"/>
<table-count count="4"/>
<equation-count count="11"/>
<ref-count count="58"/>
<page-count count="14"/>
<word-count count="10216"/>
</counts>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1. Introduction</title>
<p>The advent of intelligent systems, capable of communicating with human (Yamazaki et al., <xref ref-type="bibr" rid="B58">2007</xref>), introduces a tremendous opportunity to further explore some of most fundamental aspects of human society, thereby fathoming the intricacies exhibited in human behaviors pragmatically (Ogawa et al., <xref ref-type="bibr" rid="B43">2011</xref>). Such systems have been increasingly proven to be of formidable potentials in investigation of foundational societal building blocks such as epigenetics (Prince and Gogate, <xref ref-type="bibr" rid="B45">2007</xref>) and early child development (Lungarella et al., <xref ref-type="bibr" rid="B30">2003</xref>; Tanaka et al., <xref ref-type="bibr" rid="B53">2007</xref>). In this regard, communication is undoubtedly the foundation of sociability (Yamazaki et al., <xref ref-type="bibr" rid="B57">2014</xref>). Research shows that a proper communication has direct and positive influence on physical (Sumioka et al., <xref ref-type="bibr" rid="B50">2013</xref>) and mental (Yamazaki et al., <xref ref-type="bibr" rid="B56">2016</xref>) health as well as quality of learning (Nakanishi et al., <xref ref-type="bibr" rid="B34">2016</xref>).</p>
<p>Although it is crucial for these synthetic agents to be able to provide appropriate feedback on estimation of the brain activity of whose their operators are communicating with (Kumaran et al., <xref ref-type="bibr" rid="B27">2016b</xref>), it is rather intractable to realize the internal state of cognitive activity of humans at highly sophisticated and complex behavioral level. Therefore, it is necessary to devise agents with mathematical models that are trained on basic cognitive activities, thereby providing them with adequate means to detect and/or measure such activities during interaction with human. Furthermore, it is of utmost important for these models to have the capacity for generalization and scalability on their available data, thereby reducing the time and effort that is, otherwise, required to interact with different individuals.</p>
<p>To this end, Near Infrared Spectroscopy (NIRS) presents an intriguing option for enabling these systems to act as timely and accurate analytical gateways into brain activity and emotional state of their human subjects. Cui et al. (<xref ref-type="bibr" rid="B6">2010b</xref>) define NIRS as a technology for functional brain imaging based on hemodynamic signals from the cortex. NIRS, in principle, is similar to functional magnetic resonance imaging (fMRI) (Cui et al., <xref ref-type="bibr" rid="B5">2010a</xref>) without requiring the human subject laying motionless in the confined fMRI monitoring chamber. Its use for monitoring of brain activity becomes more attractive, considering the non-invasive operational setup of NIRS-related devices that are available at considerably lower cost along with their ease of use with portable, light-weighted headsets and their comparatively immunity to body movement (Dieler et al., <xref ref-type="bibr" rid="B8">2012</xref>), unrestrictiveness, accessibility, as well as compact experimental setting (Moriai-Izawaa et al., <xref ref-type="bibr" rid="B32">2012</xref>).</p>
<sec>
<title>1.1. An overview of NIRS-based brain activity prediction</title>
<p>There exists a rich body of research pertaining to NIRS-based brain activity and emotional state classification. Naito et al. (<xref ref-type="bibr" rid="B33">2007</xref>) present communication means for patients struggling with amyotrophic lateral sclerosis (ALS) using quadratic discriminant analysis (QDA). Their model utilizes maximum amplitude and phase change as features to achieve an average accuracy of 80% on binary &#x0201C;yes/no&#x0201D; answers of forty male and female patients. Tai and Chau (<xref ref-type="bibr" rid="B52">2009</xref>) compares the performance of linear discriminant analysis (LDA) and support vector machine (SVM) on NIRS signals associated with the single-trail classification of the positively and negatively induced emotional tasks at individual level. Their results suggest that classification accuracy of these models vary with the length of the input signals. Luu and Chau (<xref ref-type="bibr" rid="B31">2009</xref>) apply linear discriminant analysis (LDA) on mean signal amplitude of NIRS data of nine human subjects to achieve an average accuracy of 80% on evaluating the choice of drinks among two available options in a single-trial scenario. Cui et al. (<xref ref-type="bibr" rid="B7">2010c</xref>) apply linear SVM on NIRS-related finger tapping task performed by six participants. Furthermore, they present an insightful investigation of the effect of the different feature spaces on classification accuracy. Their results suggest that features that provide the best classification for one dataset may not be optimal for all NIRS data, thereby suggesting their further optimization for individual participants. Holper and Wolf (<xref ref-type="bibr" rid="B20">2011</xref>) apply Fisher&#x00027;s linear discriminant analysis (FLDA) on motor imagery tasks of simple and sequential finger-tapping to report an average classification accuracy of 81.0% that is computed based on the classification performance of FLDA on NIRS data of the participants at the individual level. Hu et al. (<xref ref-type="bibr" rid="B22">2012</xref>) utilize contrast-to-noise ratio (CNR) as feature to decode deception on eight male subjects. They report classification accuracies of 83.44 and 81.14% using RBF and linear support vector machines (SVM), respectively. Furthermore, the accuracy of their model increases to 87.5% when applying their approach on an inter-subject setting (seven out of eight subjects). Naseer and Hong (<xref ref-type="bibr" rid="B35">2013a</xref>) use LDA on mean and slope of NIRS data as features to perform a left- and right-motor imagery by ten participants. Their approach achieves 73.35 and 83.0% accuracies on right- and left-wrist imagery tasks, respectively. Furthermore, they report an improvement in accuracy of their model by focusing on 2&#x02013;7 s out of entire 10 s trials while extracting features, achieving average accuracies of 77.56 and 87.28% for right and left wrists, respectively. Herff et al. (<xref ref-type="bibr" rid="B17">2013a</xref>) apply LDA for binary discrimination between relax state and three different tasks (i.e., mental arithmetic, mental rotation, and word generation). They obtain 71% accuracy on mental arithmetic, 62% accuracy on mental rotation task, and 70% accuracy on word generation with respect to relax state on ten subjects. Nguyen et al. (<xref ref-type="bibr" rid="B41">2013</xref>) compare the performance of SVM in contrast with one-hidden-layer artificial neural network (ANN) for two hands tapping tasks performed by three human subjects. They use polynomial regression coefficients as features to report best average accuracy of 82.5% on right and left hands tapping of these subjects, using SVM. Furthermore, they obtain 85% on right and 75% on left hands tapping, using ANN. Herff et al. (<xref ref-type="bibr" rid="B19">2014</xref>) use fNIRS data along with LDA to classify between n-back (<italic>n</italic> &#x02208; {1, 2, 3}) and resting state to achieve up to 78% accuracy for single-trail discrimination. Naseer et al. (<xref ref-type="bibr" rid="B39">2014</xref>) compare the performance of LDA and SVM on online binary classification of mental yes/no answers (i.e., performing mental arithmetic vs. relax state in response to given questions) to report average classification accuracies of 74.28 and 82.14%, given the performance of these classifiers at the individual level. Xu et al. (<xref ref-type="bibr" rid="B55">2014</xref>) adopt &#x003C7;<sup>2</sup> statistic for feature extraction through discretization of NIRS data and apply linear SVM to achieve classification accuracy of 69&#x02013;81% on right hand clench force motor imagery and clench speed motor imagery on six subjects. This article presents a useful literature review on the topic as well. Naseer and Hong (<xref ref-type="bibr" rid="B37">2015a</xref>) apply multi-class LDA for classification of the motor imagery based responses to four-choice questions (e.g., left-hand motor imagery to indicate option A) to report an accuracy of 73.3%, averaged on performance of their classifier at the individual level. Hong et al. (<xref ref-type="bibr" rid="B21">2015</xref>) use mean and slope of NIRS signal and multi-class LDA to classify between mental arithmetic, left hand motor imagery, and right hand motor imagery. They report an average accuracy of 75.6% on ten participants. Naseer et al. (<xref ref-type="bibr" rid="B40">2016</xref>) study the choice of optimal feature selection for binary classification of mental arithmetic and relax states, using LDA. Their results indicate that combination of the mean and the peak values of the signals associated with the individuals result in a significant improvement of the accuracy of their classifier. Naseer and Hong (<xref ref-type="bibr" rid="B38">2015b</xref>) present a comprehensive review of this topic.</p>
</sec>
<sec>
<title>1.2. Motivation and contributions</title>
<p>Despite impressive and promising results on classification of different brain activities using NIRS and fNIRS time series, all aforementioned approaches unanimously focus on improvement of the performance of different classification approaches at the individual (i.e., intra-subject) level, reporting their results that are averaged on the performance of these classifiers on single-participant basis. The major drawback of such an evaluation paradigm is the strong dependency of the accuracy of the adapted model on the performance of the individuals, thereby exhibiting high variation/bias. More specifically, there is a paucity of research on modeling and study of classification approaches that aim for generalization and scalability. Our approach addresses this issue via training on combined data of all participants (i.e., inter-subject level), thereby narrowing the gap between intra- and inter-subject brain activity prediction. It is apparent that such an approach facilitates the deployment and integration of these models in real-time systems since their learning mechanism is independent of the individual that they interact with.</p>
<p>Kamran and Hong (<xref ref-type="bibr" rid="B23">2014</xref>) argue that the NIRS time series data is a linear combination of various components, ranging from dynamical characteristics of the oxy-(HbO) and deoxy-hemoglobin (HbR) changes in a specific brain region and the influence from previous stimuli, to the physiological signals that prevail such time series data, and the baseline effect. This claim is further supported by Cui et al. (<xref ref-type="bibr" rid="B7">2010c</xref>) whose comparative analysis suggest that the slope (i.e., a linear correlate) of the NIRS data forms an important and highly informative feature in comparison to various feature spaces. These results explain the emergence of linear classifiers as dominant approaches to brain activity detection based on NIRS time series as presented in Section 1.1.</p>
<p>We take this observations and results into consideration while formulating our novel approach to brain activity prediction. In cognitive psychology, cognitive load refers to the total amount of mental effort utilized by the working memory while conducting a mental activity (Sweller, <xref ref-type="bibr" rid="B51">1988</xref>). As such, the mental workload classification refers to the ability to distinguish between various level of brain activity that are pertinent to the same family of working memory through mathematical modeling of their corresponding time series data. In particular, we address the prediction of n-back task (Kirchner, <xref ref-type="bibr" rid="B25">1958</xref>) as a proxy measure of mental workload. The n-back task is a continuous performance assessment, frequently used in cognitive neuroscience, to measure the working memory capacity (Gazzaniga et al., <xref ref-type="bibr" rid="B14">2014</xref>). In this setting, the human participant is presented with a sequence of stimuli and the task consists of indicating when the current stimulus matches the one from n steps earlier in the sequence. The simple operational principles of such tasks provide opportunity to model changes in mental workload of human subjects through analysis of the effect of their level of difficulty on NIRS-related patterns of brain activity. Our study and its subsequent results focus on training a model on labeled data of human participants performing 1- and 2-back tasks, thereby distinguishing between these tasks during their prediction to infer the level of task difficulty based on its effect on mental workload. Our contributions are as follows:</p>
<list list-type="order">
<list-item><p>We introduce a novel non-parametric approach to NIRS-based brain activity prediction that specifically exploits the intrinsic linearity exhibited by NIRS time series. Moreover, we demonstrate its correctness and convergence through analysis of its mathematical formulation. Our empirical results suggest that our model significantly improves upon prediction accuracy of n-back task as a proxy measure of mental workload using NIRS time series.</p></list-item>
<list-item><p>We introduce the potential that the utilization of differential entropy (DE) as a feature can offer to the solution concept of NIRS-based mental workload classification. Our experimental results suggest that DE empower a certain class of classifiers to achieve a higher prediction accuracy, compared to other commonly employed feature spaces. To the best of our knowledge, this is the first time that the utilization of DE in contrast with other NIRS-related feature spaces is reported in the literature. Moreover, these results are based on combined data of all participants (i.e., inter-subject level) and therefore the learned model is independent of data associated with any individual included in our experiment.</p></list-item>
<list-item><p>We provide empirical evidence on effect of the gender differences on mental workload prediction accuracy during n-back task through a comprehensive analysis of the results obtained by our model as well as a broad range of classifiers that are dominantly applied to NIRS-based prediction problem. This observation is in accord with the results in the literature on gender-specific brain activities (Weiss et al., <xref ref-type="bibr" rid="B54">2003</xref>; Haut and Barch, <xref ref-type="bibr" rid="B16">2006</xref>; Li et al., <xref ref-type="bibr" rid="B28">2010</xref>).</p></list-item>
</list>
<p>The remainder of this article is organized as follows. We elaborate on formulation of our approach in Section 2. Section 3 provides details on data acquisition and experimental setup along with the data preprocessing and feature extraction steps. Results and comparative study of our model in contrast with state-of-the-art techniques in NIRS literature are presented in Section 4. Section 6 presents conclusion and some insight on the future direction of this research.</p>
</sec>
</sec>
<sec id="s2">
<title>2. Methdology</title>
<p>Without loss of generality, let &#x1D54B;<sub>1</sub> and &#x1D54B;<sub>2</sub> represent two task spaces with the labels of their members being zero and one, respectively. Moreover, let <inline-formula><mml:math id="M3"><mml:msup><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mo>&#x1D54B;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:math></inline-formula> be a feature vector in <italic>jth</italic> task space. Given the labels associated with these task spaces, we calculate their expected ratio of dissimilarity as:</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M4"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>E</mml:mi><mml:mo stretchy='true'>[</mml:mo><mml:mo>&#x02016;</mml:mo><mml:msubsup><mml:mrow><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mo>&#x1D54B;</mml:mo><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:msubsup><mml:mo>&#x02016;</mml:mo><mml:mo stretchy='true'>]</mml:mo></mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mo stretchy='true'>[</mml:mo><mml:mo>&#x02016;</mml:mo><mml:msubsup><mml:mrow><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mi>j</mml:mi><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mo>&#x1D54B;</mml:mo><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:msubsup><mml:mo>&#x02016;</mml:mo><mml:mo stretchy='true'>]</mml:mo></mml:mrow></mml:mfrac><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02200;</mml:mo><mml:msub><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x02208;</mml:mo><mml:msub><mml:mo>&#x1D54B;</mml:mo><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02200;</mml:mo><mml:msub><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x02208;</mml:mo><mml:msub><mml:mo>&#x1D54B;</mml:mo><mml:mn>2</mml:mn></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>E</italic>[.] returns the expected value of its argument (in this case, the mean of the array of Euclidean distances of feature vectors of respective task spaces) and ||.|| gives the norm of its input vector i.e., the norm of feature vector <inline-formula><mml:math id="M5"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mi>N</mml:mi><mml:mo>&#x02208;</mml:mo><mml:msup><mml:mrow><mml:mo>&#x0211D;</mml:mo></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x02265;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> of the <italic>jth</italic> task space, with <italic>N</italic> representing the task space cardinality. We use this ratio to broaden the dissimilarity between &#x1D54B;<sub>1</sub> and &#x1D54B;<sub>2</sub>:</p>
<disp-formula id="E2"><label>(2)</label><mml:math id="M8"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:msub><mml:mrow><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mtext>&#x000A0;</mml:mtext></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:msub><mml:mrow><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x02208;</mml:mo><mml:msub><mml:mo>&#x1D54B;</mml:mo><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x003C4;</mml:mo><mml:mo>,</mml:mo><mml:mn>1.0</mml:mn><mml:mo>&#x02212;</mml:mo><mml:mi>r</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x000D7;</mml:mo><mml:msub><mml:mrow><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mtext>&#x000A0;&#x000A0;</mml:mtext><mml:mrow><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>with &#x003C4; being a threshold to reduce the squashing effect of second term in <italic>max</italic> function. It is worth noting that the effect of such a scaling of the original distribution of the elements of task spaces resembles approaches that seek for discriminative subspaces where the variance for one class is maximized while minimizing the variation in the second class (Fukunaga and Koontz, <xref ref-type="bibr" rid="B12">1970</xref>; Kang and Choi, <xref ref-type="bibr" rid="B24">2012</xref>). However, it differs from these approaches in that it captures a crude dissimilarity representation of these task spaces, thereby avoiding rather more computationally involved steps to define such dissimilarity. Although, <italic>r</italic> acts as an scaling factor between the two task spaces to refine their boundary via manipulation of their relative spatial distributions with respect to one another given their intrinsic dissimilarities and without modification of their inherent distribution (please refer to the Remark below), we use &#x003C4; &#x0003D; 0.5 in present implementation to limit the effect of <italic>r</italic> if <italic>E</italic>[&#x1D54B;<sub>2</sub>] &#x0226B; <italic>E</italic>[&#x1D54B;<sub>1</sub>].</p>
<p>Remark 1. Application of the expected ratio of dissimilarity <italic>r</italic> on between-task individual data elements preserves the originality of data. This is evident through the observations that:
<list list-type="order">
<list-item><p><italic>r</italic> &#x0003D; 0: This scenario implies that at least one of the task spaces is an empty set, thereby indicating that no distinction is necessary.</p></list-item>
<list-item><p><italic>r</italic> &#x0003D; 1: This occurs if and only if &#x1D54B;<sub>1</sub> and &#x1D54B;<sub>2</sub> represent the same data, a contradiction to existence of two task spaces.</p></list-item>
<list-item><p><italic>r</italic> &#x02208; &#x0211D; &#x00026; <italic>r</italic> &#x02260; 0 &#x00026; <italic>r</italic> &#x02260; 1: Equation (2) implies an affine transformation on all members of the same task space to uniformly scale these members as <inline-formula><mml:math id="M13"><mml:mi>f</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mo>&#x1D54B;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02192;</mml:mo><mml:msub><mml:mrow><mml:msup><mml:mrow><mml:mo>&#x1D54B;</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x02032;</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02223;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mover accent="true"><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mo>&#x003B1;</mml:mo><mml:mo>&#x000D7;</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x0002B;</mml:mo><mml:mo>&#x003B2;</mml:mo></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02200;</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02208;</mml:mo><mml:msub><mml:mrow><mml:mo>&#x1D54B;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:math></inline-formula> with &#x003B2; &#x0003D; 0 and &#x003B1; &#x0003D; <italic>r</italic> or &#x003B1; &#x0003D; <italic>max</italic>(&#x003C4;, 1.0 &#x02212; <italic>r</italic>), given the task space. Moreover, <italic>r</italic> has an intrinsic property to scale the different task spaces in opposing directions as it is evident in Equation (2). Additionally, such an scaling factor follows the same direction for members of the same class, preserving their overall within-class distribution.</p></list-item>
</list></p>
<p>After scaling the data of the task spaces through the application of their dissimilarity ratio in Equations (1) and (2), we compute the respective geometric median (Lin, <xref ref-type="bibr" rid="B29">1992</xref>; Fletcher et al., <xref ref-type="bibr" rid="B10">2009</xref>) of these task spaces with equally weighted data [i.e., <inline-formula><mml:math id="M14"><mml:msub><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02200;</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02208;</mml:mo><mml:msub><mml:mrow><mml:mo>&#x1D54B;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:math></inline-formula> in Definition 7.1, Appendix 7 (<xref ref-type="supplementary-material" rid="SM1">Supplementary Material</xref>)]. The geometric median of a given task space is always closest to the maximally formed cluster of a given task space than its respective outliers, as shown in the following Proposition.</p>
<p>Proposition 2.1. <italic>Given a Task space</italic> &#x1D54B;, <italic>its calculated geometric median is closest to the cluster associated with its observations than its outliers [please refer to Appendix 5 (<xref ref-type="supplementary-material" rid="SM1">Supplementary Material</xref>) for the proof]</italic>.</p>
<p>Lemma 2.2. <italic>Given a Task space</italic> &#x1D54B;, <italic>the cumulative sum of distances of <inline-formula><mml:math id="M17"><mml:mo>&#x02200;</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>\</mml:mo><mml:mover accent="true"><mml:mrow><mml:mtext>c</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo></mml:math></inline-formula> to the geometric median <inline-formula><mml:math id="M18"><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo></mml:math></inline-formula> with respect to outliers <inline-formula><mml:math id="M19"><mml:mo>&#x02200;</mml:mo><mml:mover accent="true"><mml:mrow><mml:mtext>c</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo></mml:math></inline-formula> is minimum [please refer to Appendix 5 (<xref ref-type="supplementary-material" rid="SM1">Supplementary Material</xref>) for the proof]</italic>.</p>
<sec>
<title>2.1. Weight matrix computation and refinement of decision boundary</title>
<p>Let <italic>X</italic> represent the input feature matrix that corresponds to the combined data of task spaces &#x1D54B;<sub>1</sub> and &#x1D54B;<sub>2</sub>. Furthermore, let <italic>y</italic> be the row vector associated with <italic>X</italic> whose <italic>ith</italic> row entry represent the label of the <italic>ith</italic> feature vector in <italic>X</italic>. The weight vector that maps <italic>X</italic> onto <italic>y</italic> using the normal equation is (Cormen et al., <xref ref-type="bibr" rid="B4">2001</xref>):</p>
<disp-formula id="E3"><label>(3)</label><mml:math id="M22"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:mi>W</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>X</mml:mi><mml:mo>&#x1D54B;</mml:mo></mml:msup><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x02212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:msup><mml:mi>X</mml:mi><mml:mo>&#x1D54B;</mml:mo></mml:msup><mml:mi>y</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Let <inline-formula><mml:math id="M23"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x02208;</mml:mo><mml:msub><mml:mrow><mml:mo>&#x1D54B;</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math id="M24"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x02208;</mml:mo><mml:msub><mml:mrow><mml:mo>&#x1D54B;</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> be the geometric medians of task spaces &#x1D54B;<sub>1</sub> and &#x1D54B;<sub>2</sub>, respectively. We compute the midpoint of these task spaces as a mean of their corresponding geometric medians with respect to their coordinates (i.e., their respective feature vectors):</p>
<disp-formula id="E4"><label>(4)</label><mml:math id="M27"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mo>&#x003C7;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mo>&#x003C7;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:msubsup><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mo stretchy='false'>&#x0007C;</mml:mo><mml:msub><mml:mrow><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy='false'>&#x0007C;</mml:mo><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>with <inline-formula><mml:math id="M28"><mml:msubsup><mml:mrow><mml:mo>&#x003C7;</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:math></inline-formula> being the <italic>jth</italic> coordinate (i.e., feature) of geometric median of the <italic>ith</italic> task space, i.e., <inline-formula><mml:math id="M29"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02208;</mml:mo><mml:msub><mml:mrow><mml:mo>&#x1D54B;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:math></inline-formula> and |.| returns the cardinality of its argument. Given <inline-formula><mml:math id="M30"><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> and the weights <italic>W</italic> in Equation (3), the new Sigmoidal boundary condition for &#x1D54B;<sub><italic>i</italic></sub>, <italic>i</italic> &#x0003D; 1, 2 is:</p>
<disp-formula id="E5"><label>(5)</label><mml:math id="M32"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:mo>&#x003B2;</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x02212;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>W</mml:mi><mml:mo>&#x1D54B;</mml:mo></mml:msup><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>i.e., new boundary condition, &#x003B2;, is obtained through application of Sigmoid activation function on inner product of weight vector <italic>W</italic> and midpoint <inline-formula><mml:math id="M33"><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula>. We utilize &#x003B2; to predict the labels of new data as:</p>
<disp-formula id="E6"><label>(6)</label><mml:math id="M34"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mn>1</mml:mn><mml:mtext>&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x02212;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:msup><mml:mi>W</mml:mi><mml:mo>&#x1D54B;</mml:mo></mml:msup><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mo>&#x02265;</mml:mo><mml:mo>&#x003B2;</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mn>0</mml:mn><mml:mtext>&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>with <inline-formula><mml:math id="M35"><mml:mover accent="true"><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> being the new feature vector associated with the recently generated input NIRS data.</p>
<p>Claim 2.3. <italic>The midpoint of the geometric medians of the two task spaces</italic> &#x1D54B;<sub>1</sub> <italic>and</italic> &#x1D54B;<sub>2</sub>, <italic>defines the most linearly optimal boundary between them [please refer to Appendix 5 (<xref ref-type="supplementary-material" rid="SM1">Supplementary Material</xref>) for the proof]</italic>.</p>
</sec>
</sec>
<sec id="s3">
<title>3. Preliminaries</title>
<sec>
<title>3.1. Data acquisition and experimental setup</title>
<p>Twenty-eight healthy right-handed volunteers (11 male and 17 female, <italic>M</italic> &#x0003D; 30.96 years, <italic>SD</italic> &#x0003D; 10.84) participated in the experiment. Prior to data collection, we received approval from the ethical committee at Advanced Telecommunications Research Institute International (Approval Code: 16-601-1), along with the informed consent from all participants. The data is acquired with a wearable optical topography system &#x0201C;HOT-1000,&#x0201D; developed by Hitachi High-Technologies Corporation (please refer to Figure <xref ref-type="fig" rid="F1">1</xref>). It is wore on the forehead of participants and collects data through four channels (i.e., <italic>Left</italic><sub>1</sub>, <italic>Left</italic><sub>3</sub>, <italic>Right</italic><sub>1</sub>, and <italic>Right</italic><sub>3</sub>, as shown in Figure <xref ref-type="fig" rid="F1">1</xref>). Furthermore, it allows for recording of the measurement of brain activity through detection of total blood flow via emitting a wavelength laser light (810 nm) at the 10 Hz sampling rate. The participants were requested to sit in front of a screen where the on-screen 1- and 2-back instructions (please refer to Section 1.2 for details) are presented. We use the FLANDERS (Nicholls et al., <xref ref-type="bibr" rid="B42">2013</xref>) handedness questionnaire to measure the skilled hand preference of the participants. After a resting period of 1 min, they were instructed to focus on the voice, listening to a sequence of numbers in two separate tasks, clicking on the left mouse bottom if they recognize a repeated number meeting the 1- or 2-back repetition in the first and the second tasks, respectively.</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p><bold>The NIRS device used during the N-Back task (left)</bold> along with the schematic of the locations of the left and right channels associated with the data collection procedure during the experiments <bold>(right)</bold>. The numbered squares refer to the left and right channels of depth 1.0 and 3.0 cm that are considered in this study, respectively.</p></caption>
<graphic xlink:href="fnhum-11-00015-g0001.tif"/>
</fig>
</sec>
<sec>
<title>3.2. Data preprocessing</title>
<p>First, we normalize the data corresponding to the four NIRS channels via subtracting the mean of the 1 min resting period as a baseline from this data. Next, we apply a 5-degree polynomial butter worth filter on each channel with 0.01 and 0.6 Hz for low and high bandpass, respectively. This is followed by linear detrending of the time series signals associated with each of these four channels. Lastly, we apply a 2-degree polynomial non-linear detrending.</p>
<p>It is customary in NIRS data preprocessing to apply segmentation on the original data of participants, thereby increasing the size of samples that are, in most cases, small. However, we strongly believe that such segmentations degrade the performance of any supervised classifier, preventing its true accuracy to be estimated. Figure <xref ref-type="fig" rid="F2">2</xref> shows the Euclidean norm distribution of NIRS data associated with 1-back (red-colored circles) and 2-back (circles in blue) tasks of seven randomly selected female participants in our study. In this figure, there are a number of participants whose data do not follow the general trend, namely, having their 2-back Euclidean norms above those associated with 1-back task. Although such misleading data are customary in many applications, segmentation of such cases introduces a rather redundant source of misclassification by prediction models. In fact, the negative effect of segmentation on estimation of true accuracy of any supervised classifier is significant as shown below.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p><bold>Segmented (depth <italic><bold>d</bold></italic> &#x0003D; 1, as described in proofs 3.1 and 3.1.1) representation of the Euclidean norm distribution of NIRS data, corresponding to 1-back (red-colored circles) and 2-back (circles in blue) tasks - Female participants only (seven out of seventeen randomly selected)</bold>. Cases that do not follow the general trend are indicated by dashed-line rectangles in this figure.</p></caption>
<graphic xlink:href="fnhum-11-00015-g0002.tif"/>
</fig>
<p>Theorem 3.1. <italic>Segmentation reduces the accuracy of any supervised classifier by a factor that is exponential to the depth of segmentation [please refer to Appendix 5 (<xref ref-type="supplementary-material" rid="SM1">Supplementary Material</xref>) for the proof]</italic>.</p>
<p>Corollary 3.1.1. <italic>Segmentation reduces the accuracy of any supervised classifier by <inline-formula><mml:math id="M38"><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:msup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> in worst case scenario [please refer to Appendix 5 (<xref ref-type="supplementary-material" rid="SM1">Supplementary Material</xref>) for the proof].</italic></p>
</sec>
<sec>
<title>3.3. Adopted feature spaces</title>
<p>Features can be directly extracted from raw NIRS data (Power et al., <xref ref-type="bibr" rid="B44">2010</xref>). Alternatively, they are extracted from data after its transformation into hemoglobin concentration using Beer-Lamberts law (Hong et al., <xref ref-type="bibr" rid="B21">2015</xref>). Luu and Chau (<xref ref-type="bibr" rid="B31">2009</xref>) show that effect of these two feature extraction strategies on prediction accuracy is insignificant. Moreover, Power et al. (<xref ref-type="bibr" rid="B44">2010</xref>) argues that the use of raw data for extracting features facilitates the integration of models into real world setting due to its less computational intensity. We adapt the same perspective for feature extraction in this article.</p>
<p>We compute separate sets of identical features for each of the four channels of our NIRS data. More specifically, we extract mean and slope of the signal (i.e., SM and SS, respectively) (Hong et al., <xref ref-type="bibr" rid="B21">2015</xref>), contrast-to-noise-ratio (CNR) (Hu et al., <xref ref-type="bibr" rid="B22">2012</xref>), and the moving average (Luu and Chau, <xref ref-type="bibr" rid="B31">2009</xref>). In addition, we calculate the differential entropy (DE) of the data associated with these channels [please refer to Appnedix 6 (<xref ref-type="supplementary-material" rid="SM1">Supplementary Material</xref>)]. Although, DE is used as a feature in classification of brain activity and emotional state estimation based on electroencephalogram (EEG) data (Herff et al., <xref ref-type="bibr" rid="B18">2013b</xref>; Shi et al., <xref ref-type="bibr" rid="B47">2013</xref>; Kumaran et al., <xref ref-type="bibr" rid="B26">2016a</xref>), this is the first time, to the best of our knowledge, that it is utilized for NIRS-based brain activity prediction. While calculating features, we divide the stream of NIRS data that correspond to each channel into four equal length sub-streams. Next, we compute the respective features for each of these sub-streams. This result in a four-dimensional feature vector in case of CNR, and DE for every channel. It is apparent that it is an eight-dimensional vector in case of SM and SS.</p>
</sec>
</sec>
<sec id="s4">
<title>4. Case studies</title>
<sec>
<title>4.1. Comparison strategy</title>
<p>We compare the performance of our approach in contrast with the prominent state-of-the-art techniques in NIRS-based classification. An overview of the literature pertinent to NIRS-based classification reveals that linear discriminant analysis (LDA) (Herff et al., <xref ref-type="bibr" rid="B17">2013a</xref>; Naseer and Hong, <xref ref-type="bibr" rid="B36">2013b</xref>; Hong et al., <xref ref-type="bibr" rid="B21">2015</xref>), linear support vector machine (SVM) (Cui et al., <xref ref-type="bibr" rid="B7">2010c</xref>; Hu et al., <xref ref-type="bibr" rid="B22">2012</xref>; Hai et al., <xref ref-type="bibr" rid="B15">2013</xref>), and quadratic discriminant analysis (QDA) (Naito et al., <xref ref-type="bibr" rid="B33">2007</xref>) are dominant approaches that are adopted by the research community in this field. This is mainly due to the underlying linear trends of various components (e.g., oxy-(HbO) and deoxy-hemoglobin (HbR) changes in a specific brain region, etc.) that form the NIRS data time series (Cui et al., <xref ref-type="bibr" rid="B7">2010c</xref>; Kamran and Hong, <xref ref-type="bibr" rid="B23">2014</xref>). However, in addition to these methodologies, we include the comparative analysis of our approach in contrast with logistic regression (Freedman, <xref ref-type="bibr" rid="B11">2009</xref>), RBF SVM (Chang et al., <xref ref-type="bibr" rid="B3">2010</xref>), k-nearest-neighbor (KNN) (Fix and Hodges, <xref ref-type="bibr" rid="B9">1951</xref>), decision tree (Breiman et al., <xref ref-type="bibr" rid="B2">1984</xref>), random forest (Shi et al., <xref ref-type="bibr" rid="B46">1995</xref>), and Naive Bayes (Stuart and Norvig, <xref ref-type="bibr" rid="B49">2003</xref>) algorithms to ensure a thorough analysis of the performance of our model. We use Python scikit-learn<xref ref-type="fn" rid="fn0001"><sup>1</sup></xref> package for this purpose. It is worth noting that the best setting of the parameters of these models are <italic>K</italic> &#x0003D; 3, <italic>d</italic> &#x0003D; 3, <italic>n</italic> &#x0003D; 10, <italic>c</italic> &#x0003D; 1e5 for number of neighbors in KNN, depth in decision tree, number of estimators in random forest, and penalty term in logistic regression, respectively. Furthermore, the penalty terms for linear and RBF SVM are <italic>c</italic> &#x0003D; 0.025 and <italic>c</italic> &#x0003D; 1.0, respectively.</p>
</sec>
<sec>
<title>4.2. Results collection</title>
<p>Algorithm 1 summarizes the procedure for acquiring the average prediction accuracy of a given classifier during the experiment. More specifically, we adopt a percentage-wise, N-Fold cross-validation strategy, starting with assigning 90% of total number of participants in random and without replacement (indicated by <italic>split</italic> variable) for training and finishing with splitting the data into half between train and test sets in a 5% countdown steps (line 14) which results in nine times of splitting in total. While assigning subjects for training and testing, we ensure that all data corresponding to a given participant is entirely assigned to one of these two sets, thereby preventing any potential similarity and/or shared representation of the individual information affecting/biasing the prediction accuracy of the classifiers. For each of these splits, we perform the prediction by a given classifier, &#x02102;, and collect its estimate, for a total number of 20 rounds (i.e., lines 6 through 9). We follow these procedure for every calculated feature (please refer to Section 3.3) and on every four NIRS channels. Finally, we report the best average prediction accuracy of the classifier, along with the type of feature and the channel leading to this result.</p>
<table-wrap position="float" id="T4">
<label>Algorithm 1</label>
<caption><p>Percentage-wise, N-Fold Cross-Validation</p></caption>
<graphic xlink:href="fnhum-11-00015-i0001.tif"/>
</table-wrap>
<p>It is worth noting that we include an additional step in case of our model to compute the best number of polynomial features to our model (i.e., line 9 in this algorithm). More specifically, we add a brute-force step in Algorithm 1 to add a polynomial feature to the input feature matrix <italic>X</italic> in Equation (3). The degree of this polynomial features is selected from the range [0, 12] with 0, indicating the original feature matrix <italic>X</italic> and without addition of any polynomial feature. We can afford this extra polynomial degree evaluation on our model due to its overall low-cost computational complexity, as outlined in Appendix 8 (<xref ref-type="supplementary-material" rid="SM1">Supplementary Material</xref>). Considering this procedure, there are 4(<italic>channels</italic>)&#x000D7;4(<italic>features</italic>)&#x000D7;9(<italic>random splits</italic>)&#x000D7;20(<italic>repetition of random splits</italic>) &#x0003D; 2880 steps involved to obtain the accuracy of each of the comparative classifiers. These steps increase to 2880 &#x000D7; 12(<italic>polynomial feature selection</italic>) &#x0003D; 34, 560 in case of our approach [indicated as SNC i.e., Sigmoid-Normal form Classifier due to the normal form regression in Equation (3)].</p>
</sec>
<sec>
<title>4.3. Performance results</title>
<p>This section provides details on performance results of our proposed approach in comparison with the selected classification strategies, outlined in Section 4.1. We present the average prediction accuracy of these techniques that are acquired through the steps described in Algorithm 1, along with the precision, the recall, and the F1-score of these classifiers. In addition, we outline the channel type and the type of feature, leading to their best average performances, respectively. Furthermore, we apply statistical analysis on these results to realize the degree of statistical significance in their performance differences. While conducting these comparative analyses, we consider three different settings of data, thereby empirically investigating the effect of gender difference on verbal working memory task (Li et al., <xref ref-type="bibr" rid="B28">2010</xref>). More specifically, we consider the data associated with female only, data associated with male only, and the combined data of male and female participants.</p>
<sec>
<title>4.3.1. Female participants</title>
<p>Table <xref ref-type="table" rid="T1">1</xref> shows the average performance accuracy of different classifiers on the NIRS data pertinent to the female participants in our 1- and 2-back workload prediction. It is worth noting that we assign the positive label to 2-back tasks during the predictions. Furthermore, we use the &#x0201C;precision_score,&#x0201D; the &#x0201C;recall_score,&#x0201D; and the &#x0201C;f1_score&#x0201D; from scikit-learn to compute the precision, recall, and F1-score of these classifiers. Entries &#x0201C;Feature&#x0201D; and &#x0201C;Channel&#x0201D; refer to the NIRS data channel and type of the feature that are preferred by each model, respectively. Furthermore, &#x0201C;Deg.&#x0201D; shows the number of polynomial degree features that are selected by our model. This entry is hyphenated for other classifiers as it is not applied to their settings. In addition, we abbreviate our approach as SNC which stands for Sigmoid-Normal form Classifier where the term Normal form refers to the normal form regression in Equation (3) (Cormen et al., <xref ref-type="bibr" rid="B4">2001</xref>).</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p><bold>Female participants&#x02014;average performance accuracy of our model in contrast with K-neatest-neighbor (KNN), Linear SVM, RBF SVM, Decision Tree, Random Forest, Naive Bayes, Linear Discriminant Analysis (LDA), Quadratic Discriminant Analysis (QDA), Logistic Regression (Logistic reg)</bold>.</p></caption>
<table frame="hsides" rules="groups">
<thead><tr>
<th valign="top" align="left"><bold>Classifier</bold></th>
<th valign="top" align="center"><bold>Accuracy (%)</bold></th>
<th valign="top" align="center"><bold>Precision</bold></th>
<th valign="top" align="center"><bold>Recall</bold></th>
<th valign="top" align="center"><bold>F1-score</bold></th>
<th valign="top" align="left"><bold>Feature</bold></th>
<th valign="top" align="left"><bold>Channel</bold></th>
<th valign="top" align="center"><bold>Deg</bold>.</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">SNC</td>
<td valign="top" align="char" char=".">82.5</td>
<td valign="top" align="char" char=".">0.85</td>
<td valign="top" align="char" char=".">0.90</td>
<td valign="top" align="char" char=".">0.84</td>
<td valign="top" align="left">DE</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" align="left">KNN</td>
<td valign="top" align="char" char=".">77.5</td>
<td valign="top" align="char" char=".">0.81</td>
<td valign="top" align="char" char=".">0.75</td>
<td valign="top" align="char" char=".">0.76</td>
<td valign="top" align="left">DE</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">Linear SVM</td>
<td valign="top" align="char" char=".">65.0</td>
<td valign="top" align="char" char=".">0.61</td>
<td valign="top" align="char" char=".">0.66</td>
<td valign="top" align="char" char=".">0.60</td>
<td valign="top" align="left">Moving Avg</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">RBF SVM</td>
<td valign="top" align="char" char=".">75.0</td>
<td valign="top" align="char" char=".">0.73</td>
<td valign="top" align="char" char=".">0.87</td>
<td valign="top" align="char" char=".">0.76</td>
<td valign="top" align="left">DE</td>
<td valign="top" align="left"><italic>Right</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">Decision tree</td>
<td valign="top" align="char" char=".">77.0</td>
<td valign="top" align="char" char=".">0.81</td>
<td valign="top" align="char" char=".">0.75</td>
<td valign="top" align="char" char=".">0.75</td>
<td valign="top" align="left">DE</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">Random forest</td>
<td valign="top" align="char" char=".">74.29</td>
<td valign="top" align="char" char=".">0.83</td>
<td valign="top" align="char" char=".">0.59</td>
<td valign="top" align="char" char=".">0.67</td>
<td valign="top" align="left">DE</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">Naive bayes</td>
<td valign="top" align="char" char=".">80.0</td>
<td valign="top" align="char" char=".">0.78</td>
<td valign="top" align="char" char=".">0.90</td>
<td valign="top" align="char" char=".">0.80</td>
<td valign="top" align="left">Moving Avg</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">LDA</td>
<td valign="top" align="char" char=".">78.0</td>
<td valign="top" align="char" char=".">0.88</td>
<td valign="top" align="char" char=".">0.70</td>
<td valign="top" align="char" char=".">0.76</td>
<td valign="top" align="left">DE</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">QDA</td>
<td valign="top" align="char" char=".">80.0</td>
<td valign="top" align="char" char=".">0.87</td>
<td valign="top" align="char" char=".">0.78</td>
<td valign="top" align="char" char=".">0.80</td>
<td valign="top" align="left">DE</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">Logistic reg</td>
<td valign="top" align="char" char=".">77.5</td>
<td valign="top" align="char" char=".">0.8</td>
<td valign="top" align="char" char=".">0.86</td>
<td valign="top" align="char" char=".">0.80</td>
<td valign="top" align="left">DE</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p><italic>SNC entry represent the results obtained by our model. DE and Moving Avg are the differential entropy and the moving average features</italic>.</p>
</table-wrap-foot>
</table-wrap>
<p>It is interesting to observe that differential entropy (i.e., DE entries in Feature column of this table) is the feature that is predominantly selected by the classifiers. The only exceptions are the linear SVM and naive Bayes classifiers that both choose the moving average as their preferred choices of feature. However, the overall poor performance of linear SVM as shown in Figure <xref ref-type="fig" rid="F3">3</xref> suggests that it is not a good choice for prediction of such mental tasks. As a result, its choice of feature as an indicative of strength of moving average is not warranted. Moreover, <italic>Left</italic><sub>1</sub> is the channel of choice for majority of the classifiers. The only exception to this observation is the RBF SVM. Furthermore, the &#x0201C;Average Accuracy&#x0201D; entry of Table <xref ref-type="table" rid="T1">1</xref> indicate that, given the procedure elaborated in Algorithm 1, the performance of our model on average, using the NIRS data of female participants outperforms all the other classifiers. More specifically, the difference between these averages is above one standard deviation (<italic>SD</italic> &#x0003D; 4.76). Moreover, this observation is supported by the multiple comparison ANOVA using Bonferroni on the average accuracies of all steps involved in Algorithm 1 (<italic>p</italic> &#x0003C; 0.00002, <italic>F</italic> &#x0003D; 24.44, <italic>SD</italic> &#x0003D; 1.41)<xref ref-type="fn" rid="fn0002"><sup>2</sup></xref>. Figure <xref ref-type="fig" rid="F3">3</xref> shows the distribution of these average prediction accuracies that are exhibited by each model. It is apparent in this figure that, all the classifiers achieve an above 75% accuracy on their overall averaged predictions. The only exception is the linear SVM that performs significantly below this trend. Moreover, this figure shows that naive Bayes and QDA are the closest to our model (<italic>p</italic> &#x0003C; 0.00011, <italic>t</italic> &#x0003D; 97.0, <italic>SD</italic> &#x0003D; 1.43, one-sample <italic>t</italic>-test).</p>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p><bold>Female data&#x02014;distribution of the overall averaged prediction accuracies of the classifiers</bold>. From left to right: our approach (SNC), KNN, linear SVM, RBF SVM, naive Bayes, LDA, QDA, and logistic regression. It is apparent that the performance of the linear SVM is significantly poorer than other classifiers on NIRS data associated with the female participants.</p></caption>
<graphic xlink:href="fnhum-11-00015-g0003.tif"/>
</fig>
</sec>
<sec>
<title>4.3.2. Male participants</title>
<p>Table <xref ref-type="table" rid="T2">2</xref> corresponds to the average performance accuracy of the classifiers on NIRS data pertinent to the male participants. &#x0201C;SM and SS&#x0201D; refers to the signal mean and signal slope features (please see Section 3.3). In this table, the first observation to note is the non-uniformity on preferred type of feature by different models. However, two out of three classifiers with highest average prediction accuracies i.e., our approach (SNC) and logistic regression prefer DE (the third one is naive Bayes that chooses moving average as its preferred feature space). The same observation hold valid in case of the channel selection where the number of models with <italic>Left</italic><sub>1</sub> as their preferred choice is comparably smaller than those in female case. However, it is still the dominant trend (five out of ten with <italic>Left</italic><sub>3</sub> and <italic>Right</italic><sub>3</sub> being selected one and four times, respectively). Furthermore, our model prefers an increase in its polynomial features, adopting a four degree polynomial for its input features, compared to female case in Table <xref ref-type="table" rid="T1">1</xref>.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p><bold>Male participants&#x02014;average performance accuracy of our model in contrast with K-neatest-neighbor (KNN), Linear SVM, RBF SVM, Decision Tree, Random Forest, Naive Bayes, Linear Discriminant Analysis (LDA), Quadratic Discriminant Analysis (QDA), Logistic Regression (Logistic reg)</bold>.</p></caption>
<table frame="hsides" rules="groups">
<thead><tr>
<th valign="top" align="left"><bold>Classifier</bold></th>
<th valign="top" align="center"><bold>Accuracy (%)</bold></th>
<th valign="top" align="center"><bold>Precision</bold></th>
<th valign="top" align="center"><bold>Recall</bold></th>
<th valign="top" align="center"><bold>F1-score</bold></th>
<th valign="top" align="left"><bold>Feature</bold></th>
<th valign="top" align="left"><bold>Channel</bold></th>
<th valign="top" align="center"><bold>Deg</bold>.</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">SNC</td>
<td valign="top" align="char" char=".">86.4</td>
<td valign="top" align="char" char=".">0.87</td>
<td valign="top" align="char" char=".">0.94</td>
<td valign="top" align="char" char=".">0.87</td>
<td valign="top" align="left">DE</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">4</td>
</tr>
<tr>
<td valign="top" align="left">KNN</td>
<td valign="top" align="char" char=".">73.3</td>
<td valign="top" align="char" char=".">0.65</td>
<td valign="top" align="char" char=".">0.78</td>
<td valign="top" align="char" char=".">0.70</td>
<td valign="top" align="left">SM and SS</td>
<td valign="top" align="left"><italic>Left</italic><sub>3</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">Linear SVM</td>
<td valign="top" align="char" char=".">70.0</td>
<td valign="top" align="char" char=".">0.65</td>
<td valign="top" align="char" char=".">0.75</td>
<td valign="top" align="char" char=".">0.67</td>
<td valign="top" align="left">Moving Avg</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">RBF SVM</td>
<td valign="top" align="char" char=".">76.0</td>
<td valign="top" align="char" char=".">0.80</td>
<td valign="top" align="char" char=".">0.74</td>
<td valign="top" align="char" char=".">0.75</td>
<td valign="top" align="left">Moving Avg</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">Decision tree</td>
<td valign="top" align="char" char=".">77.5</td>
<td valign="top" align="char" char=".">0.84</td>
<td valign="top" align="char" char=".">0.67</td>
<td valign="top" align="char" char=".">0.71</td>
<td valign="top" align="left">SM and SS</td>
<td valign="top" align="left"><italic>Right</italic><sub>3</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">Random forest</td>
<td valign="top" align="char" char=".">77.50</td>
<td valign="top" align="char" char=".">0.83</td>
<td valign="top" align="char" char=".">0.67</td>
<td valign="top" align="char" char=".">0.71</td>
<td valign="top" align="left">SM and SS</td>
<td valign="top" align="left"><italic>Right</italic><sub>3</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">Naive bayes</td>
<td valign="top" align="char" char=".">80.0</td>
<td valign="top" align="char" char=".">0.78</td>
<td valign="top" align="char" char=".">0.90</td>
<td valign="top" align="char" char=".">0.80</td>
<td valign="top" align="left">Moving Avg</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">LDA</td>
<td valign="top" align="char" char=".">78.33</td>
<td valign="top" align="char" char=".">0.81</td>
<td valign="top" align="char" char=".">0.81</td>
<td valign="top" align="char" char=".">0.79</td>
<td valign="top" align="left">Moving Avg</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">QDA</td>
<td valign="top" align="char" char=".">75.0</td>
<td valign="top" align="char" char=".">0.78</td>
<td valign="top" align="char" char=".">0.72</td>
<td valign="top" align="char" char=".">0.71</td>
<td valign="top" align="left">DE</td>
<td valign="top" align="left"><italic>Right</italic><sub>3</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">Logistic reg</td>
<td valign="top" align="char" char=".">80.0</td>
<td valign="top" align="char" char=".">0.78</td>
<td valign="top" align="char" char=".">0.75</td>
<td valign="top" align="char" char=".">0.74</td>
<td valign="top" align="left">DE</td>
<td valign="top" align="left"><italic>Right</italic><sub>3</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p><italic>SNC entry represent the results obtained by our model. DE, SM, and SS, and Moving Avg are the differential entropy, the signal mean and slope, and the moving average features</italic>.</p>
</table-wrap-foot>
</table-wrap>
<p>Our model achieves a significantly higher result compared to other classifiers, as it is evident in Table <xref ref-type="table" rid="T2">2</xref> and Figure <xref ref-type="fig" rid="F4">4</xref>. Additionally, it improves upon its performance on female data significantly (<italic>p</italic> &#x0003C; 0.014, <italic>t</italic> &#x0003D; 43.31, <italic>SD</italic> &#x0003D; 2.76, one-sample <italic>t</italic>-test). Furthermore, it obtains higher precisions and recalls, resulting in better F1-score than its average performance on female data, as the comparison of these entries in Tables <xref ref-type="table" rid="T1">1</xref>, <xref ref-type="table" rid="T2">2</xref> suggests. Moreover, Figure <xref ref-type="fig" rid="F4">4</xref> shows the significant improvement on overall averaged prediction accuracy that is achieved by our model in comparison with other classifiers which is supported by multiple comparison ANOVA with Bonferroni (<italic>p</italic> &#x0003C; 0.00004, <italic>F</italic> &#x0003D; 19.41, <italic>SD</italic> &#x0003D; 1.41).</p>
<fig id="F4" position="float">
<label>Figure 4</label>
<caption><p><bold>Male data&#x02014;distribution of the overall averaged prediction accuracies of the classifiers</bold>. From left to right: our approach (SNC), KNN, linear SVM, RBF SVM, naive Bayes, LDA, QDA, and logistic regression. It is apparent that the performance of the linear SVM considerably poorer than other classifiers on NIRS data associated with the female participants.</p></caption>
<graphic xlink:href="fnhum-11-00015-g0004.tif"/>
</fig>
</sec>
<sec>
<title>4.3.3. Combined data of female and male participants</title>
<p>Table <xref ref-type="table" rid="T3">3</xref> presents the results obtained by these algorithms on combined data of male and female participants. Although our model is significantly improving upon prediction accuracies in comparison with other classifiers (<italic>p</italic> &#x0003C; 0.000009, <italic>F</italic> &#x0003D; 26.14, <italic>SD</italic> &#x0003D; 5.11, one-way ANOVA with &#x0201C;bonferroni&#x0201D;), it is apparent that combined data of different genders has a negative effect on average performance of all these algorithms. More specifically, the average accuracy of these algorithms is significantly worsened once the data of male and female participants are combined (MEAN = 13.0, <italic>SD</italic> &#x0003D; 4.77 and MEAN &#x0003D; 13.79, <italic>SD</italic> &#x0003D; 3.29 with respect to female only and male only data). Our proposed model shows an 11.07% decay in its average accuracy. This is followed by a significant increase in its choice of polynomial degree, from 0 and 4 in female and male only cases, respectively, to 9 in case of combined data. It is worth noting that such an increase in preferred polynomial feature degree (MEAN = 4.33, <italic>SD</italic> &#x0003D; 4.51) indicates a significant increase in non-linearity exhibited by the combined data of different genders. However, it continues with <italic>Left</italic><sub>1</sub> and <italic>DE</italic> as its best choice of channel and the selected feature as in previous data settings. The degradation of the average accuracy is evident in second and third best performing classifiers in case of male only data (i.e., Naive Bayes 19.37% and logistic regression 13.33%) and female only (i.e., Naive Bayes 19.37% and LDA 13.00%).</p>
<table-wrap position="float" id="T3">
<label>Table 3</label>
<caption><p><bold>Female and male participants&#x02014;average performance accuracy of our model in contrast with K-neatest-neighbor (KNN), Linear SVM, RBF SVM, Decision Tree, Random Forest, Naive Bayes, Linear Discriminant Analysis (LDA), Quadratic Discriminant Analysis (QDA), Logistic Regression (Logistic reg)</bold>.</p></caption>
<table frame="hsides" rules="groups">
<thead><tr>
<th valign="top" align="left"><bold>Classifier</bold></th>
<th valign="top" align="center"><bold>Accuracy (%)</bold></th>
<th valign="top" align="center"><bold>Precision</bold></th>
<th valign="top" align="center"><bold>Recall</bold></th>
<th valign="top" align="center"><bold>F1-score</bold></th>
<th valign="top" align="left"><bold>Feature</bold></th>
<th valign="top" align="left"><bold>Channel</bold></th>
<th valign="top" align="center"><bold>Deg</bold>.</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">SNC</td>
<td valign="top" align="char" char=".">75.33</td>
<td valign="top" align="char" char=".">0.75</td>
<td valign="top" align="char" char=".">0.81</td>
<td valign="top" align="char" char=".">0.76</td>
<td valign="top" align="left">DE</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">9</td>
</tr>
<tr>
<td valign="top" align="left">KNN</td>
<td valign="top" align="char" char=".">65.46</td>
<td valign="top" align="char" char=".">0.69</td>
<td valign="top" align="char" char=".">0.67</td>
<td valign="top" align="char" char=".">0.66</td>
<td valign="top" align="left">Moving Avg</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">Linear SVM</td>
<td valign="top" align="char" char=".">58.33</td>
<td valign="top" align="char" char=".">0.61</td>
<td valign="top" align="char" char=".">0.73</td>
<td valign="top" align="char" char=".">0.64</td>
<td valign="top" align="left">Moving Avg</td>
<td valign="top" align="left"><italic>Left</italic><sub>3</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">RBF SVM</td>
<td valign="top" align="char" char=".">64.26</td>
<td valign="top" align="char" char=".">0.60</td>
<td valign="top" align="char" char=".">0.79</td>
<td valign="top" align="char" char=".">0.67</td>
<td valign="top" align="left">DE</td>
<td valign="top" align="left"><italic>Left</italic><sub>3</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">Decision tree</td>
<td valign="top" align="char" char=".">63.75</td>
<td valign="top" align="char" char=".">0.74</td>
<td valign="top" align="char" char=".">0.47</td>
<td valign="top" align="char" char=".">0.53</td>
<td valign="top" align="left">SM and SS</td>
<td valign="top" align="left"><italic>Right</italic><sub>3</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">Random forest</td>
<td valign="top" align="char" char=".">61.67</td>
<td valign="top" align="char" char=".">0.76</td>
<td valign="top" align="char" char=".">0.63</td>
<td valign="top" align="char" char=".">0.62</td>
<td valign="top" align="left">Moving Avg</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">Naive bayes</td>
<td valign="top" align="char" char=".">60.63</td>
<td valign="top" align="char" char=".">0.59</td>
<td valign="top" align="char" char=".">0.62</td>
<td valign="top" align="char" char=".">0.60</td>
<td valign="top" align="left">Moving Avg</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">LDA</td>
<td valign="top" align="char" char=".">65.00</td>
<td valign="top" align="char" char=".">0.67</td>
<td valign="top" align="char" char=".">0.71</td>
<td valign="top" align="char" char=".">0.67</td>
<td valign="top" align="left">CNR</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">QDA</td>
<td valign="top" align="char" char=".">57.08</td>
<td valign="top" align="char" char=".">0.57</td>
<td valign="top" align="char" char=".">0.52</td>
<td valign="top" align="char" char=".">0.53</td>
<td valign="top" align="left">DE</td>
<td valign="top" align="left"><italic>Left</italic><sub>3</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
<tr>
<td valign="top" align="left">Logistic reg</td>
<td valign="top" align="char" char=".">66.67</td>
<td valign="top" align="char" char=".">0.68</td>
<td valign="top" align="char" char=".">0.80</td>
<td valign="top" align="char" char=".">0.72</td>
<td valign="top" align="left">Moving Avg</td>
<td valign="top" align="left"><italic>Left</italic><sub>1</sub></td>
<td valign="top" align="center">&#x02013;</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p><italic>SNC entry represent the results obtained by our model. DE, SM and SS, and Moving Avg are the differential entropy, the signal mean and slope, and the moving average features</italic>.</p>
</table-wrap-foot>
</table-wrap>
<p>Although the <italic>Left</italic><sub>1</sub> remains the dominant channel of choice while using the combined data in Table <xref ref-type="table" rid="T3">3</xref>, <italic>Moving Average</italic> replaces <italic>DE</italic> as dominantly utilized feature by these models. We observe this shift in choice of feature from <italic>DE</italic> to <italic>Moving Average</italic> while comparing the <italic>feature</italic> entries in Tables <xref ref-type="table" rid="T1">1</xref>, <xref ref-type="table" rid="T2">2</xref> as well. This suggests that the increase in non-linearity as well as change in adopted feature space in case of combined data is mainly due to the data associated with the male participants. Moreover, results of one-sample <italic>t</italic>-test on these accuracies indicate that such degradations on average accuracy of these models are significant (<italic>p</italic> &#x0003C; 0.00001, <italic>T</italic> &#x0003D; &#x02212;8.66, <italic>SD</italic> &#x0003D; 4.76 with respect to female only and <italic>p</italic> &#x0003C; 0.0000007, <italic>T</italic> &#x0003D; &#x02212;13.25, <italic>SD</italic> &#x0003D; 3.29 with regards to male only). This suggests that the gender difference introduces a significant impact on NIRS related brain activity while performing 1- and 2-back tasks.</p>
</sec>
</sec>
</sec>
<sec sec-type="discussion" id="s5">
<title>5. Discussion</title>
<p>Table <xref ref-type="table" rid="T1">1</xref> indicates that our model (i.e., SNC), naive Bayes, and QDA achieve best accuracies on female participants, with SNC obtaining a significant improvement over the results of other two models. Moreover, the precision and recall entries of this table suggest that both SNC and naive Bayes have a better accuracy on predicting the 1-back as opposed to 2-back tasks. This is evident in their higher recall entries in this table, compared to their precision. However, this is reversed in case of QDA where it achieves a better prediction on 2-back task. In addition, result of one-sample <italic>t</italic>-test suggests that their performance differences on predicting these tasks are significant (<italic>p</italic> &#x0003C; 0.0012, <italic>t</italic> &#x0003D; 30.54 in case of precision and <italic>p</italic> &#x0003C; 0.0023, <italic>t</italic> &#x0003D; 21.50 for recall). Furthermore, the same trend is observed in case of male participants in Table <xref ref-type="table" rid="T2">2</xref>, where SNC, naive Bayes, and logistic regression form the high performing classifiers, with SNC and naive Bayes having higher accuracy on 1-back tasks (i.e., higher recall) as opposed to logistic regression that obtains higher precision (<italic>p</italic> &#x0003C; 0.0015, <italic>t</italic> &#x0003D; 27.0 in case of precision and <italic>p</italic> &#x0003C; 0.0046, <italic>t</italic> &#x0003D; 14.92 for recall). This is a complementary result to Cui et al. (<xref ref-type="bibr" rid="B7">2010c</xref>), whose observation indicate that features that provide the best prediction for one data set may not be optimal for all NIRS datasets. More specifically, our result suggests that real time systems can benefit from ensemble models with classifiers that are primarily trained for and predominantly better in predicting a subclass of overall task spaces, resulting in significant improvement of performance on estimation of the brain activity of human subjects by the systems that they are deployed in. In addition, Tables <xref ref-type="table" rid="T1">1</xref>, <xref ref-type="table" rid="T2">2</xref> suggest a gender difference effect on the performance of the classifiers, with male participants exhibiting a higher non-linearity in their NIRS data brain activity. This is evident in increase in number of polynomial features that are adopted by our model as we compare the &#x0201C;Deg.&#x0201D; entries of these tables. Moreover, we observe a decay in accuracies of all models on combined data of different genders in Table <xref ref-type="table" rid="T3">3</xref>. These observations are in accordance with the analytical study of prefrontal cortex during a verbal working memory task (Li et al., <xref ref-type="bibr" rid="B28">2010</xref>). In addition, the result of the literature on brain region activation during memory and language processing suggest a left-lateralized activation in both genders with higher specificity in females (Weiss et al., <xref ref-type="bibr" rid="B54">2003</xref>; Haut and Barch, <xref ref-type="bibr" rid="B16">2006</xref>; Li et al., <xref ref-type="bibr" rid="B28">2010</xref>). Our empirical results is in accordance with the literature as indicated by predominant choice of <italic>Left</italic><sub>1</sub> NIRS channel by classifiers in Tables <xref ref-type="table" rid="T1">1</xref>&#x02013;<xref ref-type="table" rid="T3">3</xref>, with a higher preference on this channel while using female data.</p>
</sec>
<sec sec-type="conclusions" id="s6">
<title>6. Conclusion</title>
<p>We introduce a non-parametric approach to prediction of n-back task as a proxy measure of mental workload of human subjects using NIRS data. Our approach takes advantage of subtle underlying linearity exhibited by the components of the NIRS data to emphasize the idiosyncratic characteristics of brain activity through application of their dissimilarity. Furthermore, it adopts a one step regression strategy to compute its weights, thereby allowing our model to further explore the potential that is offered via introduction of polynomial features to further improve its accuracy.</p>
<p>We choose 1- and 2-back tasks as a typical proxy measure of mental workload to examine the prediction accuracy of our approach. The simple operational principles of such tasks provide opportunity to model changes in brain activity. The comparative analysis of the performance of our model in contrast with state-of-the-art techniques shows a significant improvement on prediction accuracy of these tasks. Furthermore, our results suggest that adaptation of differential entropy (DE) to compute features of NIRS data introduces a potential for extracting features that help increase the accuracy of certain class of learning algorithms. This is, to the best of our knowledge, the first time to utilize DE in NIRS-based prediction.</p>
<p>An interesting observation that is revealed through our results is the effect of gender differences on the performance of the classifiers. Whereas our approach achieves 86.40 and 82.50% on male and female participants, respectively, its accuracy reduces to 75.33% once data associated with different genders is combined. This suggests that devising real time systems with classifiers that take into account such gender specificity on the nature of signals corresponding to brain activity leads to higher accuracy of such systems while interacting with humans. Furthermore, such a degradation of the performance accuracy is exhibited by all the classifiers whose performance are studied in contrast with our proposed approach. Although our findings are supported by a number of analytical studies on the influence of gender on brain activation pattern and hemodynamics, this empirical observation is at its very early stage and drawing a definitive conclusion demands further statistical and experimental analyses.</p>
<p>In this study, we carry out our analysis on human subjects whose NIRS data are collected during real time sessions. However, results reported in this article are based on offline use of this data. Therefore, future of this research pertains to deployment of our model on real time system to determine its utility to the solution concept of state estimation of the brain activity of human subjects. Furthermore, it is crucial to increase the number of participants to acquire larger amount of data, thereby analyzing the effect of higher variation of brain activity patterns on the prediction accuracy of our model due to increase in amount of NIRS data.</p>
<p>We collect our results on the accuracy of our model in contrast with different classifiers while treating the NIRS channels independently. However, it is interesting to analyze the effect of the features that are calculated based on various combination of these channels on the overall accuracy of these classifiers in the future.</p>
<p>Another important factor that demands special consideration is to test the performance of our approach in scenarios with more than two classes of tasks (e.g., N-back task with <italic>N</italic> &#x02265; 3, up to an upper bound threshold), thereby evaluating its ability to generalize on more complex scenarios.</p>
<p>The prime target of our research is to provide synthetic agents with the ability to engage in meaningful communication with their human counterparts. We utilize n-back task as an intermediate, tractable approximation of underlying mental workload, necessary to conduct such highly complex communicational tasks. Therefore, we use the results acquired in this study as a basis to build a representational space based on which generalization on estimation of the brain activity of human subjects, in their broader perspectives, is foreseeable. Our future work will include deployment of our model in a real-world setting to realize the utility of our approach to the solution concept of human-robot interaction.</p>
</sec>
<sec id="s7">
<title>Ethics statement</title>
<p>This study was carried out in accordance with the recommendations of the ethical committee of Advanced Telecommunications Research Institute International (ATR) with written informed consent from all subjects. All subjects gave written informed consent in accordance with the Declaration of Helsinki. The protocol was approved by the ATR ethical committee (approval code: 16-601-1).</p>
</sec>
<sec id="s8">
<title>Author contributions</title>
<p>SK formulated the mathematical model, its correctness analysis, as well as conducting simulation and collecting results on performance of all the models involved for the purpose of comparative analysis in this article. Furthermore, he prepared the draft of the article. HS acted as research lead, designing the experiment, supervising the progress, and taking part in experimental setup while collecting data from participants. In addition, he reviewed the entire content of the article and provided insightful feedback to improve the quality of the writing as well as the results presented. RY designed the experiments and carried them out with the participants. Furthermore, he completed all the documentation associated with the experimental setup (e.g., collecting consents, research approval from ATR ethical committee, etc.) As the head of HIL, HI oversee the entire activity of all research teams and themes, ensuring the soundness of all proposals, quality of results, and their validity.</p>
</sec>
<sec id="s9">
<title>Funding</title>
<p>This research is supported by Impulsing Paradigm Change through Disruptive Technologies Program (ImPACT): Actualize Energetic Life by Creating Brain Information Industries, Brain Robotics for communication, funded by the Japanese Cabinet Office.</p>
<sec>
<title>Conflict of interest statement</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
</sec>
</body>
<back>
<sec sec-type="supplementary-material" id="s10">
<title>Supplementary material</title>
<p>The Supplementary Material for this article can be found online at: <ext-link ext-link-type="uri" xlink:href="http://journal.frontiersin.org/article/10.3389/fnhum.2017.00015/full#supplementary-material">http://journal.frontiersin.org/article/10.3389/fnhum.2017.00015/full#supplementary-material</ext-link></p>
<supplementary-material xlink:href="DataSheet1.pdf" id="SM1" mimetype="application/pdf" xmlns:xlink="http://www.w3.org/1999/xlink"/>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Boltyanski</surname> <given-names>V.</given-names></name> <name><surname>Martini</surname> <given-names>H.</given-names></name> <name><surname>Soltan</surname> <given-names>V.</given-names></name></person-group> (<year>1999</year>). <source>Geometric Methods and Optimization Problems</source>. <publisher-loc>Boston, MA</publisher-loc>: <publisher-name>Kluwer Academic</publisher-name>.</citation>
</ref>
<ref id="B2">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Breiman</surname> <given-names>L.</given-names></name> <name><surname>Friedman</surname> <given-names>J.</given-names></name> <name><surname>Olshen</surname> <given-names>R.</given-names></name> <name><surname>Stone</surname> <given-names>C.</given-names></name></person-group> (<year>1984</year>). <source>Classification and Regression Trees</source>. <publisher-loc>Monterey, CA</publisher-loc>: <publisher-name>Wadsworth &#x00026; Brooks; Cole Advanced Books &#x00026; Software</publisher-name>.</citation>
</ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chang</surname> <given-names>Y.</given-names></name> <name><surname>Hsieh</surname> <given-names>C.</given-names></name> <name><surname>Chang</surname> <given-names>K.</given-names></name> <name><surname>Ringgaard</surname> <given-names>M.</given-names></name> <name><surname>Lin</surname> <given-names>C.</given-names></name></person-group> (<year>2010</year>). <article-title>Training and testing low-degree polynomial data mappings via linear svm</article-title>. <source>Machine Learn. Res.</source> <volume>11</volume>, <fpage>1471</fpage>&#x02013;<lpage>1490</lpage>.</citation>
</ref>
<ref id="B4">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Cormen</surname> <given-names>T. H.</given-names></name> <name><surname>Leiserson</surname> <given-names>C. E.</given-names></name> <name><surname>Rivest</surname> <given-names>R. L.</given-names></name> <name><surname>Stein</surname> <given-names>C.</given-names></name></person-group> (<year>2001</year>). <source>Introduction to Algorithms</source>. <publisher-loc>Cambridge, MA</publisher-loc>: <publisher-name>MIT Press</publisher-name>.</citation>
</ref>
<ref id="B5">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cui</surname> <given-names>X.</given-names></name> <name><surname>Bray</surname> <given-names>S.</given-names></name> <name><surname>Bryant</surname> <given-names>D. M.</given-names></name> <name><surname>Glover</surname> <given-names>G. H.</given-names></name> <name><surname>Reiss</surname> <given-names>A. L.</given-names></name></person-group> (<year>2010a</year>). <article-title>A quantitative comparison of nirs and fmri across multiple cognitive tasks</article-title>. <source>Neuroimage</source> <volume>54</volume>, <fpage>2808</fpage>&#x02013;<lpage>2821</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2010.10.069</pub-id><pub-id pub-id-type="pmid">21047559</pub-id></citation>
</ref>
<ref id="B6">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cui</surname> <given-names>X.</given-names></name> <name><surname>Bray</surname> <given-names>S.</given-names></name> <name><surname>Reiss</surname> <given-names>A.</given-names></name></person-group> (<year>2010b</year>). <article-title>Functional near infrared spectroscopy (nirs) signal improvement based on negative correlation between oxygenated and deoxygenated hemoglobin dynamics</article-title>. <source>Neuroimage</source> <volume>49</volume>, <fpage>30</fpage>&#x02013;<lpage>39</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2009.11.050</pub-id><pub-id pub-id-type="pmid">19945536</pub-id></citation>
</ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cui</surname> <given-names>X.</given-names></name> <name><surname>Bray</surname> <given-names>S.</given-names></name> <name><surname>Reiss</surname> <given-names>A.</given-names></name></person-group> (<year>2010c</year>). <article-title>Speeded near infrared spectroscopy (<italic>NIRS</italic>) response detection</article-title>. <source>PLoS ONE</source> <volume>11</volume>:<fpage>e15474</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0015474</pub-id></citation>
</ref>
<ref id="B8">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dieler</surname> <given-names>A. C.</given-names></name> <name><surname>Tupak</surname> <given-names>S. V.</given-names></name> <name><surname>Fallgatter</surname> <given-names>A. J.</given-names></name></person-group> (<year>2012</year>). <article-title>Functional near-infrared spectroscopy for the assessment of speech related tasks</article-title>. <source>Brain Lang.</source> <volume>121</volume>, <fpage>90</fpage>&#x02013;<lpage>109</lpage>. <pub-id pub-id-type="doi">10.1016/j.bandl.2011.03.005</pub-id><pub-id pub-id-type="pmid">21507475</pub-id></citation>
</ref>
<ref id="B9">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Fix</surname> <given-names>E.</given-names></name> <name><surname>Hodges</surname> <given-names>J.</given-names></name></person-group> (<year>1951</year>). <article-title>Discriminatory analysis, nonparametric discrimination: consistency properties</article-title>. <source>Technical Report</source><sub>4</sub>, <publisher-name>USAF School of Aviation Medicine, Randolph Field</publisher-name>, <publisher-loc>Texas</publisher-loc>.</citation>
</ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Fletcher</surname> <given-names>P. T.</given-names></name> <name><surname>Venkatasubramanian</surname> <given-names>S.</given-names></name> <name><surname>Joshi</surname> <given-names>S.</given-names></name></person-group> (<year>2009</year>). <article-title>The geometric median on <italic>R</italic>eimannian mainfolds with application to robust atalas estimation</article-title>. <source>Neuroimage</source> <volume>45</volume>, <fpage>144</fpage>&#x02013;<lpage>152</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2008.10.052</pub-id><pub-id pub-id-type="pmid">19056498</pub-id></citation>
</ref>
<ref id="B11">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Freedman</surname> <given-names>D.</given-names></name></person-group> (<year>2009</year>). <source>Statistical Models: Theory and Practice</source>. <publisher-loc>New York, NY</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name>.</citation>
</ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Fukunaga</surname> <given-names>K.</given-names></name> <name><surname>Koontz</surname> <given-names>W. L. G.</given-names></name></person-group> (<year>1970</year>). <article-title>Application of the karhunen-loeve expansion to feature selection and ordering</article-title>. <source>IEEE Trans. Comput.</source> <volume>19</volume>, <fpage>311</fpage>&#x02013;<lpage>318</lpage>. <pub-id pub-id-type="doi">10.1109/T-C.1970.222918</pub-id></citation>
</ref>
<ref id="B13">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Galli</surname> <given-names>F. L.</given-names></name></person-group> (<year>2014</year>). <article-title>Powers of tensors and fast matrix multiplication</article-title>, in <source>Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation</source> (<publisher-loc>Kobe</publisher-loc>), <fpage>296</fpage>&#x02013;<lpage>303</lpage>.</citation>
</ref>
<ref id="B14">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Gazzaniga</surname> <given-names>M. S.</given-names></name> <name><surname>Ivry</surname> <given-names>R. B.</given-names></name> <name><surname>Mangun</surname> <given-names>G. R.</given-names></name></person-group> (<year>2014</year>). <source>Cognitive Neuroscience: The Biology of the Mind</source>. <publisher-loc>New York, NY</publisher-loc>: <publisher-name>W. W. Norton &#x00026; Company Inc.</publisher-name></citation>
</ref>
<ref id="B15">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hai</surname> <given-names>N.</given-names></name> <name><surname>Cuong</surname> <given-names>N.</given-names></name> <name><surname>Khoa</surname> <given-names>T.</given-names></name> <name><surname>Toi</surname> <given-names>V.</given-names></name></person-group> (<year>2013</year>). <article-title>Temporal hemodynamic classification of two hands tapping using functional near-infrared spectroscopy</article-title>. <source>Front. Hum. Neurosci.</source> <volume>7</volume>:<fpage>516</fpage>. <pub-id pub-id-type="doi">10.3389/fnhum.2013.00516</pub-id><pub-id pub-id-type="pmid">24032008</pub-id></citation>
</ref>
<ref id="B16">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Haut</surname> <given-names>K.</given-names></name> <name><surname>Barch</surname> <given-names>D.</given-names></name></person-group> (<year>2006</year>). <article-title>Sex influences on material-sensetive functional lateralization in working and episodic memory: men and women are not all that different</article-title>. <source>Neuroimage</source> <volume>32</volume>, <fpage>411</fpage>&#x02013;<lpage>422</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2006.01.044</pub-id><pub-id pub-id-type="pmid">16730459</pub-id></citation>
</ref>
<ref id="B17">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Herff</surname> <given-names>C.</given-names></name> <name><surname>Heger</surname> <given-names>D.</given-names></name> <name><surname>Putze</surname> <given-names>F.</given-names></name> <name><surname>Hennrich</surname> <given-names>J.</given-names></name> <name><surname>Fortmann</surname> <given-names>O.</given-names></name> <name><surname>Schultz</surname> <given-names>T.</given-names></name></person-group> (<year>2013a</year>). <article-title>Classification of mental tasks in the prefrontal cortex using f<italic>NIRS</italic></article-title>, in <source>Proceedings of IEEE International Conference on Engineering in Medicine and Biology Society (EMBC)</source> (<publisher-loc>Osaka</publisher-loc>).</citation>
</ref>
<ref id="B18">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Herff</surname> <given-names>C.</given-names></name> <name><surname>Heger</surname> <given-names>D.</given-names></name> <name><surname>Putze</surname> <given-names>F.</given-names></name> <name><surname>Hennrich</surname> <given-names>J.</given-names></name> <name><surname>Fortmann</surname> <given-names>O.</given-names></name> <name><surname>Schultz</surname> <given-names>T.</given-names></name></person-group> (<year>2013b</year>). <article-title>Differential entropy feature for <italic>EEG</italic>-based emotion classification</article-title>, in <source>6th Annual International IEEE EMBS Conference on Neural Engineering</source> (<publisher-loc>San Diego, CA</publisher-loc>), <fpage>81</fpage>&#x02013;<lpage>84</lpage>.</citation>
</ref>
<ref id="B19">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Herff</surname> <given-names>C.</given-names></name> <name><surname>Hegger</surname> <given-names>D.</given-names></name> <name><surname>Fortmann</surname> <given-names>O.</given-names></name> <name><surname>Hennrich</surname> <given-names>J.</given-names></name> <name><surname>Putze</surname> <given-names>F.</given-names></name> <name><surname>Schultz</surname> <given-names>T.</given-names></name></person-group> (<year>2014</year>). <article-title>Mental workload during n-back task &#x02013; quantified in the prefrontal cortex using fnirs</article-title>. <source>Front. Hum. Neurosci.</source> <volume>7</volume>:<fpage>935</fpage>. <pub-id pub-id-type="doi">10.3389/fnhum.2013.00935</pub-id><pub-id pub-id-type="pmid">24474913</pub-id></citation>
</ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Holper</surname> <given-names>L.</given-names></name> <name><surname>Wolf</surname> <given-names>M.</given-names></name></person-group> (<year>2011</year>). <article-title>Single-trial classification of motor imagery differing in task complexity: a functional near-infrared spectroscopy study</article-title>. <source>J. Neuroeng. Rehabil.</source> <volume>8</volume>, <fpage>1</fpage>&#x02013;<lpage>13</lpage>. <pub-id pub-id-type="doi">10.1186/1743-0003-8-34</pub-id><pub-id pub-id-type="pmid">21682906</pub-id></citation>
</ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hong</surname> <given-names>K. S.</given-names></name> <name><surname>Naseer</surname> <given-names>N.</given-names></name> <name><surname>Kim</surname> <given-names>Y. H.</given-names></name></person-group> (<year>2015</year>). <article-title>Classification of prefrontal and motor cortex signals for three-class f<italic>NIRS</italic>&#x02212;<italic>BCI</italic></article-title>. <source>Neurosci. Lett.</source> <volume>587</volume>, <fpage>87</fpage>&#x02013;<lpage>92</lpage>. <pub-id pub-id-type="doi">10.1016/j.neulet.2014.12.029</pub-id><pub-id pub-id-type="pmid">25529197</pub-id></citation>
</ref>
<ref id="B22">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hu</surname> <given-names>X. S.</given-names></name> <name><surname>Hong</surname> <given-names>K. S.</given-names></name> <name><surname>Ge</surname> <given-names>S. S.</given-names></name></person-group> (<year>2012</year>). <article-title>f<italic>NIRS</italic>-based online deception decoding</article-title>. <source>Neural Eng.</source> <volume>9</volume>, <fpage>1</fpage>&#x02013;<lpage>12</lpage>. <pub-id pub-id-type="doi">10.1088/1741-2560/9/2/026012</pub-id><pub-id pub-id-type="pmid">22337819</pub-id></citation>
</ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kamran</surname> <given-names>M. A.</given-names></name> <name><surname>Hong</surname> <given-names>K. S.</given-names></name></person-group> (<year>2014</year>). <article-title>Reduction of physiological effects in f<italic>NIRS</italic> waveforms for efficient brain-state decoding</article-title>. <source>Neurosci. Lett.</source> <volume>580</volume>, <fpage>130</fpage>&#x02013;<lpage>136</lpage>. <pub-id pub-id-type="doi">10.1016/j.neulet.2014.07.058</pub-id><pub-id pub-id-type="pmid">25111978</pub-id></citation>
</ref>
<ref id="B24">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Kang</surname> <given-names>H.</given-names></name> <name><surname>Choi</surname> <given-names>S.</given-names></name></person-group> (<year>2012</year>). <article-title>Probabilistic models for common spatial patterns: parameter-expanded <italic>EM</italic> and variational bayes</article-title>, in <source>Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence</source> (<publisher-loc>Toronto, ON</publisher-loc>), <fpage>970</fpage>&#x02013;<lpage>976</lpage>.</citation>
</ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kirchner</surname> <given-names>W.</given-names></name></person-group> (<year>1958</year>). <article-title>Age differences in short-term retention of rapidly changing information</article-title>. <source>J. Exp. Psychol.</source> <volume>55</volume>, <fpage>352</fpage>&#x02013;<lpage>358</lpage>. <pub-id pub-id-type="doi">10.1037/h0043688</pub-id><pub-id pub-id-type="pmid">13539317</pub-id></citation>
</ref>
<ref id="B26">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kumaran</surname> <given-names>D.</given-names></name> <name><surname>Hassabis</surname> <given-names>D.</given-names></name> <name><surname>McClelland</surname> <given-names>J. L.</given-names></name></person-group> (<year>2016a</year>). <article-title>Investigating critical frequency bands and channels for <italic>EEG</italic>-based emotion recognition with deep neural network</article-title>. <source>Trends Cogn. Sci.</source> <volume>20</volume>, <fpage>512</fpage>&#x02013;<lpage>534</lpage>. <pub-id pub-id-type="doi">10.1016/j.tics.2016.05.004</pub-id></citation>
</ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kumaran</surname> <given-names>D.</given-names></name> <name><surname>Hassabis</surname> <given-names>D.</given-names></name> <name><surname>McClelland</surname> <given-names>J. L.</given-names></name></person-group> (<year>2016b</year>). <article-title>What learning systems do intelligent agents need? complementary learning systems theory updated</article-title>. <source>Trends Cogn. Sci.</source> <volume>20</volume>, <fpage>512</fpage>&#x02013;<lpage>534</lpage>. <pub-id pub-id-type="doi">10.1016/j.tics.2016.05.004</pub-id><pub-id pub-id-type="pmid">27315762</pub-id></citation>
</ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>T.</given-names></name> <name><surname>Luo</surname> <given-names>Q.</given-names></name> <name><surname>Gong</surname> <given-names>H.</given-names></name></person-group> (<year>2010</year>). <article-title>Gender-specific hemodynamics in prefrontal cortex during a verbal working memory task by near-infrared spectroscopy</article-title>. <source>Behav. Brain Res.</source> <volume>209</volume>, <fpage>148</fpage>&#x02013;<lpage>153</lpage>. <pub-id pub-id-type="doi">10.1016/j.bbr.2010.01.033</pub-id><pub-id pub-id-type="pmid">20117145</pub-id></citation>
</ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lin</surname> <given-names>J.</given-names></name></person-group> (<year>1992</year>). <article-title>Approximation algorithms for geometric median problems</article-title>. <source>Inf. Process. Lett.</source> <volume>44</volume>, <fpage>245</fpage>&#x02013;<lpage>249</lpage>. <pub-id pub-id-type="doi">10.1016/0020-0190(92)90208-D</pub-id></citation>
</ref>
<ref id="B30">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lungarella</surname> <given-names>M.</given-names></name> <name><surname>Metta</surname> <given-names>G.</given-names></name> <name><surname>Pfeifer</surname> <given-names>R.</given-names></name> <name><surname>Sandini</surname> <given-names>G.</given-names></name></person-group> (<year>2003</year>). <article-title>Developmental robotics: a survey</article-title>. <source>Connect. Sci.</source> <volume>15</volume>, <fpage>151</fpage>&#x02013;<lpage>190</lpage>. <pub-id pub-id-type="doi">10.1080/09540090310001655110</pub-id></citation>
</ref>
<ref id="B31">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Luu</surname> <given-names>S.</given-names></name> <name><surname>Chau</surname> <given-names>T.</given-names></name></person-group> (<year>2009</year>). <article-title>Decoding subjective preference from single-trial near-infrared spectroscopy signals</article-title>. <source>Neural Eng.</source> <volume>6</volume>, <fpage>1</fpage>&#x02013;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.1088/1741-2560/6/1/016003</pub-id><pub-id pub-id-type="pmid">19104138</pub-id></citation>
</ref>
<ref id="B32">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Moriai-Izawaa</surname> <given-names>A.</given-names></name> <name><surname>Danb</surname> <given-names>H.</given-names></name> <name><surname>Dana</surname> <given-names>I.</given-names></name> <name><surname>Sanoa</surname> <given-names>T.</given-names></name> <name><surname>Ogurob</surname> <given-names>K.</given-names></name> <name><surname>Yokotab</surname> <given-names>H.</given-names></name> <etal/></person-group>. (<year>2012</year>). <article-title>Multichannel f<italic>NIRS</italic> assessment of overt and covert confrontation naming</article-title>. <source>Brain Lang.</source> <volume>121</volume>, <fpage>185</fpage>&#x02013;<lpage>193</lpage>. <pub-id pub-id-type="doi">10.1016/j.bandl.2012.02.001</pub-id><pub-id pub-id-type="pmid">22429907</pub-id></citation>
</ref>
<ref id="B33">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Naito</surname> <given-names>M.</given-names></name> <name><surname>Michioka</surname> <given-names>Y.</given-names></name> <name><surname>Ozawa</surname> <given-names>K.</given-names></name> <name><surname>Ito</surname> <given-names>Y.</given-names></name> <name><surname>Kiguchi</surname> <given-names>M.</given-names></name> <name><surname>Kanazawa</surname> <given-names>T.</given-names></name></person-group> (<year>2007</year>). <article-title>A communication means for totally locked-in <italic>ALS</italic> patients based on changes in cerebral blood volume measured with near-infrared light</article-title>. <source>IIEICE Tran. Inf. Syst.</source> <volume>7</volume>, <fpage>1028</fpage>&#x02013;<lpage>1037</lpage>. <pub-id pub-id-type="doi">10.1093/ietisy/e90-d.7.1028</pub-id></citation>
</ref>
<ref id="B34">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nakanishi</surname> <given-names>J.</given-names></name> <name><surname>Sumioka</surname> <given-names>H.</given-names></name> <name><surname>Ishiguro</surname> <given-names>H.</given-names></name></person-group> (<year>2016</year>). <article-title>Impact of mediated intimate interaction on education: a huggable communication medium that encourages listening</article-title>. <source>Front. Psychol.</source> <volume>7</volume>:<fpage>510</fpage>. <pub-id pub-id-type="doi">10.3389/fpsyg.2016.00510</pub-id><pub-id pub-id-type="pmid">27148119</pub-id></citation>
</ref>
<ref id="B35">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Naseer</surname> <given-names>N.</given-names></name> <name><surname>Hong</surname> <given-names>K.</given-names></name></person-group> (<year>2013a</year>). <article-title>Classification of functional near-infrared spectroscopy signals corresponding to the right- and left-wrist motor imagery for development of a brain-computer interface</article-title>. <source>Neurosci. Lett.</source> <volume>553</volume>, <fpage>84</fpage>&#x02013;<lpage>89</lpage>. <pub-id pub-id-type="doi">10.1016/j.neulet.2013.08.021</pub-id><pub-id pub-id-type="pmid">23973334</pub-id></citation>
</ref>
<ref id="B36">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Naseer</surname> <given-names>N.</given-names></name> <name><surname>Hong</surname> <given-names>K.</given-names></name></person-group> (<year>2013b</year>). <article-title>Discrimination of right- and left-wrist motor imagery using f<italic>NIRS</italic>: towards control of a ball-on-a-beam system</article-title>, in <source>6th Annual International IEEE EMBS Conference on Neural Engineering</source> (<publisher-loc>San Diego, CA</publisher-loc>), <fpage>703</fpage>&#x02013;<lpage>706</lpage>.</citation>
</ref>
<ref id="B37">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Naseer</surname> <given-names>N.</given-names></name> <name><surname>Hong</surname> <given-names>K.-S.</given-names></name></person-group> (<year>2015a</year>). <article-title>Decoding answers to four-choice questions using functional near infrared spectroscopy</article-title>. <source>J. Near Infrared Spectrosc.</source> <volume>23</volume>, <fpage>23</fpage>&#x02013;<lpage>31</lpage>. <pub-id pub-id-type="doi">10.1255/jnirs.1145</pub-id></citation>
</ref>
<ref id="B38">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Naseer</surname> <given-names>N.</given-names></name> <name><surname>Hong</surname> <given-names>K.-S.</given-names></name></person-group> (<year>2015b</year>). <article-title>fNIRS-based brain-computer interfaces: a review</article-title>. <source>Front. Hum. Neurosci.</source> <volume>9</volume>:<fpage>3</fpage>. <pub-id pub-id-type="doi">10.3389/fnhum.2015.00003</pub-id><pub-id pub-id-type="pmid">25674060</pub-id></citation>
</ref>
<ref id="B39">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Naseer</surname> <given-names>N.</given-names></name> <name><surname>Hong</surname> <given-names>M. J.</given-names></name> <name><surname>Hong</surname> <given-names>K. S.</given-names></name></person-group> (<year>2014</year>). <article-title>Online binary decision decoding using functional near-infrared spectroscopy for the development of brain-computer interface</article-title>. <source>Exp. Brain Res.</source> <volume>232</volume>, <fpage>555</fpage>&#x02013;<lpage>564</lpage>. <pub-id pub-id-type="doi">10.1007/s00221-013-3764-1</pub-id><pub-id pub-id-type="pmid">24258529</pub-id></citation>
</ref>
<ref id="B40">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Naseer</surname> <given-names>N.</given-names></name> <name><surname>Noori</surname> <given-names>F. M.</given-names></name> <name><surname>Qureshi</surname> <given-names>N. K.</given-names></name> <name><surname>Hong</surname> <given-names>K.-S.</given-names></name></person-group> (<year>2016</year>). <article-title>Determining optimal feature-combination of functional near-infrared spectroscopy signals in brain-computer interface application</article-title>. <source>Front. Hum. Neurosci.</source> <volume>10</volume>:<fpage>237</fpage>. <pub-id pub-id-type="doi">10.3389/fnhum.2016.00237</pub-id><pub-id pub-id-type="pmid">27252637</pub-id></citation>
</ref>
<ref id="B41">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nguyen</surname> <given-names>T.</given-names></name> <name><surname>Ngo</surname> <given-names>Q.</given-names></name> <name><surname>Truong</surname> <given-names>Q.</given-names></name> <name><surname>Vo</surname> <given-names>V.</given-names></name></person-group> (<year>2013</year>). <article-title>Temporal hemodynamic classification of two hands tapping using functional near-infrared spectroscopy</article-title>. <source>Front. Hum. Neurosci.</source> <volume>7</volume>:<fpage>516</fpage>. <pub-id pub-id-type="doi">10.3389/fnhum.2013.00516</pub-id><pub-id pub-id-type="pmid">24032008</pub-id></citation>
</ref>
<ref id="B42">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nicholls</surname> <given-names>M.</given-names></name> <name><surname>Thomas</surname> <given-names>N.</given-names></name> <name><surname>Loetscher</surname> <given-names>T.</given-names></name> <name><surname>Grimshaw</surname> <given-names>G.</given-names></name></person-group> (<year>2013</year>). <article-title>The flinders handedness survey (<italic>FLANDERS</italic>): a brief measure of skilled hand preference</article-title>. <source>Cortex</source> <volume>49</volume>, <fpage>2914</fpage>&#x02013;<lpage>2926</lpage>. <pub-id pub-id-type="doi">10.1016/j.cortex.2013.02.002</pub-id><pub-id pub-id-type="pmid">23498655</pub-id></citation>
</ref>
<ref id="B43">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ogawa</surname> <given-names>K.</given-names></name> <name><surname>Nishio</surname> <given-names>S.</given-names></name> <name><surname>Koda</surname> <given-names>K.</given-names></name> <name><surname>Balistreri</surname> <given-names>G.</given-names></name> <name><surname>Watanabe</surname> <given-names>T.</given-names></name> <name><surname>Ishiguro</surname> <given-names>H.</given-names></name></person-group> (<year>2011</year>). <article-title>Exploring the natural reaction of young and aged person with telenoid in a real world</article-title>. <source>Int. J. Soc. Robot.</source> <volume>15</volume>, <fpage>592</fpage>&#x02013;<lpage>597</lpage>. <pub-id pub-id-type="doi">10.20965/jaciii2011.p0592</pub-id></citation>
</ref>
<ref id="B44">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Power</surname> <given-names>S.</given-names></name> <name><surname>Falk</surname> <given-names>T.</given-names></name> <name><surname>Chau</surname> <given-names>T.</given-names></name></person-group> (<year>2010</year>). <article-title>Classification of prefrontal activity due to mental arithmetic and music imagery using hidden <italic>M</italic>arkov models and frequency domain near-infrared spectroscopy</article-title>. <source>Neural Eng.</source> <volume>7</volume>, <fpage>1</fpage>&#x02013;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.1088/1741-2560/7/2/026002</pub-id><pub-id pub-id-type="pmid">20168001</pub-id></citation>
</ref>
<ref id="B45">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Prince</surname> <given-names>C.</given-names></name> <name><surname>Gogate</surname> <given-names>L.</given-names></name></person-group> (<year>2007</year>). <article-title>Epigenetic robotics: behavioral treatments and potential new models for developmental pediatrics</article-title>. <source>Pediatr. Res.</source> <volume>61</volume>, <fpage>383</fpage>&#x02013;<lpage>385</lpage>. <pub-id pub-id-type="doi">10.1203/pdr.0b013e3180459fdd</pub-id><pub-id pub-id-type="pmid">17515858</pub-id></citation>
</ref>
<ref id="B46">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Shi</surname> <given-names>L.</given-names></name> <name><surname>Jiao</surname> <given-names>Y.</given-names></name> <name><surname>Lu</surname> <given-names>B.</given-names></name></person-group> (<year>1995</year>). <article-title>Random decision forests</article-title>, in <source>Proceedings of the 3rd International Conference on Document Analysis and Recognition</source> (<publisher-loc>Montreal, QC</publisher-loc>), <fpage>278</fpage>&#x02013;<lpage>282</lpage>.</citation>
</ref>
<ref id="B47">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Shi</surname> <given-names>L.</given-names></name> <name><surname>Jiao</surname> <given-names>Y.</given-names></name> <name><surname>Lu</surname> <given-names>B.</given-names></name></person-group> (<year>2013</year>). <article-title>Differential entropy feature for <italic>EEG</italic>-based vigilance estimation</article-title>, in <source>IEEE 35th Annual International Conference on Engineering in Medicine and Biology Society (EMBC)</source> (<publisher-loc>Osaka</publisher-loc>), <fpage>6627</fpage>&#x02013;<lpage>6630</lpage>. <pub-id pub-id-type="pmid">24111262</pub-id></citation>
</ref>
<ref id="B48">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Strassen</surname> <given-names>V.</given-names></name></person-group> (<year>2000</year>). <article-title>Gaussian elimination is not optimal</article-title>. <source>Numerische Mathematik</source> <volume>13</volume>, <fpage>354</fpage>&#x02013;<lpage>356</lpage>. <pub-id pub-id-type="doi">10.1007/BF02165411</pub-id></citation>
</ref>
<ref id="B49">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Stuart</surname> <given-names>R.</given-names></name> <name><surname>Norvig</surname> <given-names>P.</given-names></name></person-group> (<year>2003</year>). <source>Artificial Intelligence: A Modern Approach</source>. <edition>2nd Edn.</edition> <publisher-loc>Upper Saddle River, NJ</publisher-loc>: <publisher-name>Prentice Hall</publisher-name>.</citation>
</ref>
<ref id="B50">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sumioka</surname> <given-names>H.</given-names></name> <name><surname>Nakae</surname> <given-names>A.</given-names></name> <name><surname>Kanai</surname> <given-names>R.</given-names></name> <name><surname>Ishiguro</surname> <given-names>H.</given-names></name></person-group> (<year>2013</year>). <article-title>Huggable communication medium decreases cortisol levels</article-title>. <source>Sci. Rep.</source> <volume>3</volume>, <fpage>1</fpage>&#x02013;<lpage>6</lpage>. <pub-id pub-id-type="doi">10.1038/srep03034</pub-id><pub-id pub-id-type="pmid">24150186</pub-id></citation>
</ref>
<ref id="B51">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sweller</surname> <given-names>J.</given-names></name></person-group> (<year>1988</year>). <article-title>Cognitive load during problem solving: effects on learning</article-title>. <source>Cogn. Sci.</source> <volume>12</volume>, <fpage>257</fpage>&#x02013;<lpage>285</lpage>. <pub-id pub-id-type="doi">10.1207/s15516709cog1202_4</pub-id></citation>
</ref>
<ref id="B52">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tai</surname> <given-names>K.</given-names></name> <name><surname>Chau</surname> <given-names>T.</given-names></name></person-group> (<year>2009</year>). <article-title>Single-trial classification of nirs signals during emotional induction tasks: towards a corporeal machine interface</article-title>. <source>J. Neuroeng. Rehabil.</source> <volume>6</volume>, <fpage>1</fpage>&#x02013;<lpage>14</lpage>. <pub-id pub-id-type="doi">10.1186/1743-0003-6-39</pub-id><pub-id pub-id-type="pmid">19900285</pub-id></citation>
</ref>
<ref id="B53">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tanaka</surname> <given-names>F.</given-names></name> <name><surname>Cicourel</surname> <given-names>A.</given-names></name> <name><surname>Movellan</surname> <given-names>J.</given-names></name></person-group> (<year>2007</year>). <article-title>Socialization between toddlers and robots at an early childhood education center</article-title>. <source>Proc. Natl. Acad. Sci. U.S.A.</source> <volume>104</volume>, <fpage>17954</fpage>&#x02013;<lpage>17958</lpage>. <pub-id pub-id-type="doi">10.1073/pnas.0707769104</pub-id><pub-id pub-id-type="pmid">17984068</pub-id></citation>
</ref>
<ref id="B54">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Weiss</surname> <given-names>E.</given-names></name> <name><surname>Siedentopf</surname> <given-names>C.</given-names></name> <name><surname>Hofer</surname> <given-names>A.</given-names></name> <name><surname>Deisenhammer</surname> <given-names>E.</given-names></name> <name><surname>Hoptman</surname> <given-names>M.</given-names></name> <name><surname>Kremser</surname> <given-names>C.</given-names></name> <etal/></person-group>. (<year>2003</year>). <article-title>Sex influences on material-sensetive functional lateralization in working and episodic memory: men and women are not all that different</article-title>. <source>Neurosci. Lett.</source> <volume>344</volume>, <fpage>169</fpage>&#x02013;<lpage>172</lpage>. <pub-id pub-id-type="doi">10.1016/S0304-3940(03)00406-3</pub-id></citation>
</ref>
<ref id="B55">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Xu</surname> <given-names>B.</given-names></name> <name><surname>Fu</surname> <given-names>Y.</given-names></name> <name><surname>Shi</surname> <given-names>G.</given-names></name> <name><surname>Yin</surname> <given-names>X.</given-names></name> <name><surname>Wang</surname> <given-names>Z.</given-names></name> <name><surname>Li</surname> <given-names>H.</given-names></name></person-group> (<year>2014</year>). <article-title>Improving classification by feature discretization and optimization for f<italic>NIRS</italic>-based <italic>BCI</italic></article-title>. <source>Biomimet. Biomater. Tissue Eng.</source> <volume>19</volume>, <fpage>1</fpage>&#x02013;<lpage>5</lpage>. <pub-id pub-id-type="doi">10.4172/1662-100X.1000119</pub-id></citation>
</ref>
<ref id="B56">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yamazaki</surname> <given-names>R.</given-names></name> <name><surname>Christensen</surname> <given-names>L.</given-names></name> <name><surname>Skov</surname> <given-names>K.</given-names></name> <name><surname>Chang</surname> <given-names>C.</given-names></name> <name><surname>Damholdt</surname> <given-names>M.</given-names></name> <name><surname>Sumioka</surname> <given-names>H.</given-names></name> <etal/></person-group>. (<year>2016</year>). <article-title>Intimacy in phone conversations: anxiety reduction for danish seniors with hugvie</article-title>. <source>Front. Psychol.</source> <volume>7</volume>:<fpage>537</fpage>. <pub-id pub-id-type="doi">10.3389/fpsyg.2016.00537</pub-id><pub-id pub-id-type="pmid">27148144</pub-id></citation>
</ref>
<ref id="B57">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yamazaki</surname> <given-names>R.</given-names></name> <name><surname>Nishio</surname> <given-names>S.</given-names></name> <name><surname>Ishiguro</surname> <given-names>H.</given-names></name> <name><surname>Nazrskov</surname> <given-names>M.</given-names></name> <name><surname>Ishiguro</surname> <given-names>N.</given-names></name> <name><surname>Balistreri</surname> <given-names>G.</given-names></name></person-group> (<year>2014</year>). <article-title>Acceptability of a teleoperated android by senior citizens in danish society: a case study on the application of an embodied communication medium to home care</article-title>. <source>Int. J. Soc. Robot.</source> <volume>6</volume>, <fpage>429</fpage>&#x02013;<lpage>442</lpage>. <pub-id pub-id-type="doi">10.1007/s12369-014-0247-x</pub-id></citation>
</ref>
<ref id="B58">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yamazaki</surname> <given-names>R.</given-names></name> <name><surname>Nishio</surname> <given-names>S.</given-names></name> <name><surname>Ogawa</surname> <given-names>K.</given-names></name> <name><surname>Matsumura</surname> <given-names>K.</given-names></name> <name><surname>Minato</surname> <given-names>T.</given-names></name> <name><surname>Ishiguro</surname> <given-names>H.</given-names></name> <etal/></person-group>. (<year>2007</year>). <article-title>Promoting socialization of school children using a teleoperated android: an interaction study</article-title>. <source>Int. J. Hum. Robot.</source> <volume>10</volume>, <fpage>1350007(1&#x02013;25)</fpage>. <pub-id pub-id-type="doi">10.1142/S0219843613500072</pub-id></citation>
</ref>
</ref-list>
<app-group>
<app id="A1">
<title>Proof</title>
<sec>
<title>A. Proposition 2.1</title>
<p><italic>PROOF</italic>. Definition 7.1 in Supplementary Materials ensures that the cumulative sum of distances of <inline-formula><mml:math id="M39"><mml:mo>&#x02200;</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo></mml:math></inline-formula> to its geometric median <inline-formula><mml:math id="M40"><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo></mml:math></inline-formula> are minimized. In addition, it is the case that:</p>
<disp-formula id="E7"><label>(A1)</label><mml:math id="M41"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:mo>&#x02200;</mml:mo><mml:msub><mml:mrow><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x02216;</mml:mo><mml:mover accent='true'><mml:mtext>c</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo><mml:mo>:</mml:mo><mml:msub><mml:mi>Q</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x02212;</mml:mo><mml:mn>1.5</mml:mn><mml:mo>&#x000D7;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>Q</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>&#x02212;</mml:mo><mml:msub><mml:mi>Q</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>)</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02264;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mrow><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x02016;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02264;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mi>Q</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:mn>1.5</mml:mn><mml:mo>&#x000D7;</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>Q</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>&#x02212;</mml:mo><mml:msub><mml:mi>Q</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>and</p>
<disp-formula id="E8"><label>(A2)</label><mml:math id="M42"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mo>&#x02200;</mml:mo><mml:mover accent='true'><mml:mtext>c</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02260;</mml:mo><mml:msub><mml:mover accent='true'><mml:mrow><mml:mtext>&#x000A0;p</mml:mtext></mml:mrow><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo><mml:mo>:</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02016;</mml:mo><mml:mover accent='true'><mml:mtext>c</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x0003C;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mi>Q</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mn>1.5</mml:mn><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x000D7;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>Q</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mi>Q</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>)</mml:mo><mml:mtext>&#x000A0;&#x000A0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mtext>&#x000A0;&#x000A0;</mml:mtext><mml:mo>&#x02016;</mml:mo><mml:mover accent='true'><mml:mtext>c</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x0003E;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mi>Q</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mo>+</mml:mo><mml:mn>1.5</mml:mn><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x000D7;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>Q</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mi>Q</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy='false'>)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <inline-formula><mml:math id="M43"><mml:mover accent="true"><mml:mrow><mml:mtext>c</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>Q</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:math></inline-formula> and <italic>Q</italic><sub>3</sub> are the outliers, the 25<italic>th</italic>, and the 75<italic>th</italic> quantiles associated with the distance distribution of <inline-formula><mml:math id="M44"><mml:mo>&#x02200;</mml:mo><mml:mover accent="true"><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo></mml:math></inline-formula>, respectively. There are two cases to consider:</p>
<list list-type="order">
<list-item><p><italic>Q</italic><sub>1</sub>, <italic>Q</italic><sub>3</sub> &#x02208; &#x1D54B;: This implies that <inline-formula><mml:math id="M46"><mml:msub><mml:mrow><mml:mi>Q</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>\</mml:mo><mml:mover accent="true"><mml:mrow><mml:mtext>c</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>,</mml:mo><mml:mo>&#x02203;</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo></mml:math></inline-formula> or they cannot form the boundary condition for the outliers <inline-formula><mml:math id="M47"><mml:mover accent="true"><mml:mrow><mml:mtext>c</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo></mml:math></inline-formula>. Therefore, <italic>Q</italic><sub>1</sub> and <italic>Q</italic><sub>3</sub> are the outer most data on the convex of <inline-formula><mml:math id="M48"><mml:mo>&#x02200;</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>\</mml:mo><mml:mover accent="true"><mml:mrow><mml:mtext>c</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo></mml:math></inline-formula>. Moreover, Claims 7.1 and 7.2 in Supplementary Materials ensure that geometric median <inline-formula><mml:math id="M49"><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo></mml:math></inline-formula> is within its convex, resulting in:
<disp-formula id="E9"><label>(A3)</label><mml:math id="M50"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mrow><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x0003C;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02016;</mml:mo><mml:mover accent='true'><mml:mtext>c</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mo>,</mml:mo><mml:mtext>&#x000A0;&#x000A0;</mml:mtext><mml:mo>&#x02200;</mml:mo><mml:msub><mml:mrow><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x02216;</mml:mo><mml:mover accent='true'><mml:mtext>c</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02208;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x1D54B;</mml:mo><mml:mo>,</mml:mo><mml:mtext>&#x000A0;&#x000A0;</mml:mtext><mml:mo>&#x02200;</mml:mo><mml:mover accent='true'><mml:mtext>c</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02208;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x1D54B;</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
</list-item>
<list-item><p><italic>Q</italic><sub>1</sub>, <italic>Q</italic><sub>3</sub> &#x02209; &#x1D54B;: This implies that <italic>Q</italic><sub>1</sub> and <italic>Q</italic><sub>3</sub> are calculated using the lower and the upper tails of &#x1D54B; pertinent to its 25<sup><italic>th</italic></sup> and 75<sup><italic>th</italic></sup> quantiles. It is apparent that at most one of the two values involved in calculation of <italic>Q</italic><sub>1</sub> and <italic>Q</italic><sub>3</sub>, respectively, is among outliers at the given percentile. Furthermore, these outliers (if existed) are the ones closer to two extreme tails of &#x1D54B;. Using the non-outliers to form the convex of &#x1D54B;, the remainder of the proof follows the previous case.</p></list-item>
</list>
</sec>
<sec>
<title>B. Lemma 2.2</title>
<p><italic>PROOF</italic>. There are two cases to consider:
<list list-type="order">
<list-item><p>Single Outlier: Let <inline-formula><mml:math id="M55"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo></mml:math></inline-formula> be the data that form the task space &#x1D54B;. Without loss of generality, let <inline-formula><mml:math id="M57"><mml:mover accent="true"><mml:mrow><mml:mtext>c</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo></mml:math></inline-formula> represent the outlier and the geometric median associated with the task space &#x1D54B;, respectively. Claims 7.1 and 7.2 in Supplementary Materials, imply that <inline-formula><mml:math id="M59"><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> is within the convex of data that corresponds to &#x1D54B;. The pairwise cumulative sum of distances of <inline-formula><mml:math id="M61"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>\</mml:mo><mml:mover accent="true"><mml:mrow><mml:mtext>c</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo></mml:math></inline-formula> to <inline-formula><mml:math id="M62"><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo></mml:math></inline-formula> with respect to the outlier <inline-formula><mml:math id="M63"><mml:mover accent="true"><mml:mrow><mml:mtext>c</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02208;</mml:mo><mml:mo>&#x1D54B;</mml:mo></mml:math></inline-formula> is:
<disp-formula id="E10"><label>(A4)</label><mml:math id="M64"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x02016;</mml:mo><mml:mover accent='true'><mml:mtext>c</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02212;</mml:mo><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>+</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x02212;</mml:mo><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo>+</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>+</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x02016;</mml:mo><mml:mover accent='true'><mml:mtext>c</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02212;</mml:mo><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>+</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mi>N</mml:mi></mml:msub><mml:mo>&#x02212;</mml:mo><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mo>=</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02016;</mml:mo><mml:mover accent='true'><mml:mtext>c</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02212;</mml:mo><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x000D7;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x02212;</mml:mo><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>+</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02026;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mi>N</mml:mi></mml:msub><mml:mo>&#x02212;</mml:mo><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mo stretchy='false'>)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mo>=</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02016;</mml:mo><mml:mover accent='true'><mml:mtext>c</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02212;</mml:mo><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mtext>&#x0200B;</mml:mtext><mml:mo>&#x000D7;</mml:mo><mml:mtext>&#x0200B;</mml:mtext><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mrow><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x02212;</mml:mo><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo></mml:mrow></mml:mstyle><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02265;</mml:mo><mml:mtext>&#x0200B;&#x0200B;</mml:mtext><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mrow><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x02212;</mml:mo><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo></mml:mrow></mml:mstyle></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
</list-item>
<list-item><p>Multiple Outliers: Let <inline-formula><mml:math id="M65"><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>c</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>c</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula> be the set of outliers with m and N representing the number of outliers and total number of data associated with task space &#x1D54B;, respectively. Following the case of single outlier, we have:
<disp-formula id="E11"><label>(A5)</label><mml:math id="M67"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;</mml:mtext><mml:mo stretchy='false'>[</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mover accent='true'><mml:mtext>c</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mn>1</mml:mn></mml:msub><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>+</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mn>1</mml:mn></mml:msub><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo>+</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>+</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mover accent='true'><mml:mtext>c</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mi>m</mml:mi></mml:msub><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>+</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mn>1</mml:mn></mml:msub><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>+</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>+</mml:mo><mml:mo stretchy='false'>[</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mover accent='true'><mml:mtext>c</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mn>1</mml:mn></mml:msub><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>+</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mi>N</mml:mi></mml:msub><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>+</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mover accent='true'><mml:mtext>c</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mi>m</mml:mi></mml:msub><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>+</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mi>N</mml:mi></mml:msub><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:mo stretchy='false'>]</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mo>=</mml:mo><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:munderover><mml:mrow><mml:mo>&#x02016;</mml:mo><mml:msub><mml:mrow><mml:mover accent='true'><mml:mtext>c</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo></mml:mrow></mml:mstyle><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x000D7;</mml:mo><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x02016;</mml:mo></mml:mrow></mml:mstyle><mml:msub><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02265;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mo>&#x02016;</mml:mo></mml:mrow></mml:mstyle><mml:msub><mml:mover accent='true'><mml:mtext>p</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02212;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mover accent='true'><mml:mtext>x</mml:mtext><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:mo>&#x02016;</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>It is apparent that Theorem 3.1 and Corollary 3.1.1 hold as the cardinality of set <italic>C</italic> approaches <italic>N</italic>.</p></list-item>
</list></p>
</sec>
<sec>
<title>C. Claim 2.3</title>
<p><italic>PROOF</italic>. Let <inline-formula><mml:math id="M68"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x02208;</mml:mo><mml:msub><mml:mrow><mml:mo>&#x1D54B;</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math id="M69"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x02208;</mml:mo><mml:msub><mml:mrow><mml:mo>&#x1D54B;</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> be the two geometric medians. Claim 7.1 in Supplementary Materials, implies that they are within the convex of data associated with &#x1D54B;<sub>1</sub> and &#x1D54B;<sub>2</sub>. Furthermore, Proposition 2.1 and Lemma 2.2 imply that each &#x1D54B;<sub><italic>i</italic></sub>, <italic>i</italic> &#x0003D; 1, 2 has its data maximally clustered around its <inline-formula><mml:math id="M73"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. Let <inline-formula><mml:math id="M74"><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> represent the midpoint of the line segment, connecting <inline-formula><mml:math id="M75"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math id="M76"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula>. Furthermore, let <italic>L</italic> be the line segment that passes through <inline-formula><mml:math id="M77"><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> and is orthogonal to <inline-formula><mml:math id="M78"><mml:mi>x</mml:mi><mml:mover accent='true'><mml:mrow><mml:msub><mml:mrow><mml:mo>&#x02009;</mml:mo></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:msub><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula>. This implies that <inline-formula><mml:math id="M79"><mml:mi>x</mml:mi><mml:mover accent='true'><mml:mrow><mml:msub><mml:mrow><mml:mo>&#x02009;</mml:mo></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:msub><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math id="M80"><mml:mi>x</mml:mi><mml:mover accent='true'><mml:mrow><mml:msub><mml:mrow><mml:mo>&#x02009;</mml:mo></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy='true'>&#x02192;</mml:mo></mml:mover><mml:msub><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula> are the normals to <italic>L</italic> with respect to the task spaces &#x1D54B;<sub>1</sub> and &#x1D54B;<sub>2</sub>, thereby maximally separating <inline-formula><mml:math id="M83"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math id="M84"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> from <italic>L</italic>.</p>
</sec>
<sec>
<title>D. Theorem 3.1</title>
<p><italic>PROOF</italic>. Let <italic>s</italic> represent the number of segments that each base stream is segmented to (e.g., <italic>s</italic> &#x0003D; 2 if the original stream is split into half). Furthermore, let <italic>d</italic> be the depth of segmentation (e.g., <italic>d</italic> &#x0003D; 2 if segmentation is applied on segmented data after the first step of segmentation). Given the original unsegmented data, it splits into <italic>s</italic> segments at depth <italic>d</italic> &#x0003D; 1, that are segmented into another <italic>s</italic> segments on their own at <italic>d</italic> &#x0003D; 2. Continuing in this fashion, we have <italic>s</italic><sup><italic>d</italic></sup> segments at depth <italic>d</italic>. Allowing for <italic>m</italic> to represent the number of mismatched cases in <italic>s</italic> segments at <italic>d</italic> &#x0003D; 1 i.e., the onset of segmentation, the degradation of the accuracy of a given classifier is <inline-formula><mml:math id="M85"><mml:mfrac><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:msup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>m</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:msup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula>.</p>
</sec>
<sec>
<title>E. Corollary 3.1.1</title>
<p><italic>PROOF</italic>. If <italic>m</italic> &#x0226A; <italic>s</italic> then <inline-formula><mml:math id="M86"><mml:mfrac><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x02192;</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula> as <italic>s</italic> &#x02192; &#x0221E;, implying a negligible effect of such cases on the accuracy of a given classifier. On the other hand, <inline-formula><mml:math id="M87"><mml:mfrac><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x02248;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> as <italic>m</italic> &#x02192; <italic>s</italic>. Moreover, <italic>m</italic> &#x02260; <italic>s</italic> as it contradicts being mismatched cases in principle. Furthermore, it is apparent that at most <inline-formula><mml:math id="M88"><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:math></inline-formula> (i.e., the maximum entropy) since any other case for proportionality between <italic>m</italic> and <italic>s</italic> is fixed by reversing their oder, thereby satisfying the <italic>m</italic> &#x0003C; <italic>s</italic>. Substituting for <italic>m</italic>, we get <inline-formula><mml:math id="M89"><mml:mfrac><mml:mrow><mml:mfrac><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:msup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x000D7;</mml:mo><mml:msup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula></p>
</sec>
</app>
</app-group>
<fn-group>
<fn id="fn0001"><p><sup>1</sup><ext-link ext-link-type="uri" xlink:href="http://scikit-learn.org/stable/">http://scikit-learn.org/stable/</ext-link></p></fn>
<fn id="fn0002"><p><sup>2</sup>All statistical analyses reported in this article are based on MATLAB R2016a</p></fn>
</fn-group>
</back>
</article>