<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-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.00423</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Neuroscience</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Mining Time-Resolved Functional Brain Graphs to an EEG-Based Chronnectomic Brain Aged Index (CBAI)</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Dimitriadis</surname> <given-names>Stavros I.</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<xref ref-type="author-notes" rid="fn001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/92277/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Salis</surname> <given-names>Christos I.</given-names></name>
<xref ref-type="aff" rid="aff4"><sup>4</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/428859/overview"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Institute of Psychological Medicine and Clinical Neurosciences, Cardiff University School of Medicine</institution> <country>Cardiff, United Kingdom</country></aff>
<aff id="aff2"><sup>2</sup><institution>Cardiff University Brain Research Imaging Center (CUBRIC), School of Psychology, Cardiff University</institution> <country>Cardiff, United Kingdom</country></aff>
<aff id="aff3"><sup>3</sup><institution>Neuroinformatics Group, Cardiff University Brain Research Imaging Center (CUBRIC), School of Psychology, Cardiff University</institution> <country>Cardiff, United Kingdom</country></aff>
<aff id="aff4"><sup>4</sup><institution>Department of Informatics and Telecommunications Engineering, University of Western Macedonia</institution> <country>Kozani, Greece</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Manousos A. Klados, Aston University, Birmingham, United Kingdom</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Evangelos Konstantinos Ioannidis, Aristotle University of Thessaloniki, Greece; M&#x000E1;rk Moln&#x000E1;r, Institute of Cognitive Neuroscience and Psychology, Centre of Natural Sciences, Hungarian Academy of Sciences, Hungary</p></fn>
<fn fn-type="corresp" id="fn001"><p>&#x0002A;Correspondence: Stavros I. Dimitriadis <email>stidimitriadis&#x00040;gmail.com</email>; <email>DimitriadisS&#x00040;cardiff.ac.uk</email></p></fn>
</author-notes>
<pub-date pub-type="epub">
<day>07</day>
<month>09</month>
<year>2017</year>
</pub-date>
<pub-date pub-type="collection">
<year>2017</year>
</pub-date>
<volume>11</volume>
<elocation-id>423</elocation-id>
<history>
<date date-type="received">
<day>28</day>
<month>06</month>
<year>2017</year>
</date>
<date date-type="accepted">
<day>07</day>
<month>08</month>
<year>2017</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2017 Dimitriadis and Salis.</copyright-statement>
<copyright-year>2017</copyright-year>
<copyright-holder>Dimitriadis and Salis</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>The brain at rest consists of spatially and temporal distributed but functionally connected regions that called intrinsic connectivity networks (ICNs). Resting state electroencephalography (rs-EEG) is a way to characterize brain networks without confounds associated with task EEG such as task difficulty and performance. A novel framework of how to study dynamic functional connectivity under the notion of functional connectivity microstates (FC&#x003BC;states) and symbolic dynamics is further discussed. Furthermore, we introduced a way to construct a single integrated dynamic functional connectivity graph (IDFCG) that preserves both the strength of the connections between every pair of sensors but also the type of dominant intrinsic coupling modes (DICM). The whole methodology is demonstrated in a significant and unexplored task for EEG which is the definition of an objective Chronnectomic Brain Aged index (CBAI) extracted from resting-state data (<italic>N</italic> &#x0003D; 94 subjects) with both eyes-open and eyes-closed conditions. Novel features have been defined based on symbolic dynamics and the notion of DICM and FC&#x003BC;states. The transition rate of FC&#x003BC;states, the symbolic dynamics based on the evolution of FC&#x003BC;states (the Markovian Entropy, the complexity index), the probability distribution of DICM, the novel Flexibility Index that captures the dynamic reconfiguration of DICM per pair of EEG sensors and the relative signal power constitute a valuable pool of features that can build the proposed CBAI. Here we applied a feature selection technique and Extreme Learning Machine (ELM) classifier to discriminate young adults from middle-aged and a Support Vector Regressor to build a linear model of the actual age based on EEG-based spatio-temporal features. The most significant type of features for both prediction of age and discrimination of young vs. adults age groups was the dynamic reconfiguration of dominant coupling modes derived from a subset of EEG sensor pairs. Specifically, our results revealed a very high prediction of age for eyes-open (<italic>R</italic><sup>2</sup> &#x0003D; 0.60; y &#x0003D; 0.79x &#x0002B; 8.03) and lower for eyes-closed (<italic>R</italic><sup>2</sup> &#x0003D; 0.48; y &#x0003D; 0.71x &#x0002B; 10.91) while we succeeded to correctly classify young vs. middle-age group with 97.8% accuracy in eyes-open and 87.2% for eyes-closed. Our results were reproduced also in a second dataset for further external validation of the whole analysis. The proposed methodology proved valuable for the characterization of the intrinsic properties of dynamic functional connectivity through the age untangling developmental differences using EEG resting-state recordings.</p>
</abstract>
<kwd-group>
<kwd>EEG</kwd>
<kwd>time-varying network analysis</kwd>
<kwd>chronnectomics</kwd>
<kwd>dominant coupling modes</kwd>
<kwd>cross-frequency coupling</kwd>
<kwd>maturation index</kwd>
<kwd>signal processing</kwd>
<kwd>symbolic analysis</kwd>
</kwd-group>
<contract-num rid="cn001">MR/K004360/1</contract-num>
<contract-sponsor id="cn001">MRC<named-content content-type="fundref-id">10.13039/501100000265</named-content></contract-sponsor>
<contract-sponsor id="cn002">Marie Curie COFUND EU-UK Research Fellowship</contract-sponsor>
<counts>
<fig-count count="10"/>
<table-count count="2"/>
<equation-count count="13"/>
<ref-count count="64"/>
<page-count count="16"/>
<word-count count="10426"/>
</counts>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>Introduction</title>
<p>Functional networks can be defined as spatio-temporal correlation of brain areas which normally involved in a task and are also observed when subjects are not performing a specific task called resting-state (Biswal et al., <xref ref-type="bibr" rid="B5">1995</xref>).</p>
<p>Many neuroimaging efforts in functional magnetic resonance imaging (fMRI) have focused from studying cognitive subsystems directly linked to the experimental paradigms focusing on one or more subsystems (Turk-Browne, <xref ref-type="bibr" rid="B61">2013</xref>). Targeted cognitive domains are vision, language, memory, and emotion. Recent studies focused to assess individual differences in functional connectivity across multiple whole-brain networks (Thomason et al., <xref ref-type="bibr" rid="B60">2008</xref>). Subsequently, an increasing number of studies using rs-fMRI data are showing reproducibility and reliability of features and connectivity patterns extracted from the whole brain (Damoiseaux et al., <xref ref-type="bibr" rid="B16">2006</xref>; Thomason et al., <xref ref-type="bibr" rid="B60">2008</xref>; Shehzad et al., <xref ref-type="bibr" rid="B55">2009</xref>; Van Dijk et al., <xref ref-type="bibr" rid="B62">2010</xref>; Zuo et al., <xref ref-type="bibr" rid="B64">2010</xref>; Song et al., <xref ref-type="bibr" rid="B57">2012</xref>).</p>
<p>It is high popular in fMRI studies to use machine learning techniques in corporation with fMRI BOLD activity and with brain networks. Especially, support Vector Machines (SVMs) have become widely used for different approaches due to their advantage to manipulate high-dimensional data to the direction of classification and predictive accuracy (Sch&#x000F6;lkopf and Smola, <xref ref-type="bibr" rid="B54">2001</xref>; Ben-Hur and Weston, <xref ref-type="bibr" rid="B3">2010</xref>; Meier et al., <xref ref-type="bibr" rid="B48">2012</xref>). The backbone of fMRI-based studies adopted a seed-based connectivity analysis, independent component analysis (ICA), graph and network theory methods, and machine learning techniques that include feature extraction algorithms and various classifiers like SVM. A variety of neuroimaging studies have clearly shown that machine learning algorithms applying to human recordings can extract novel insights human brain activity (Haynes and Rees, <xref ref-type="bibr" rid="B35">2005</xref>; Cohen et al., <xref ref-type="bibr" rid="B13">2011</xref>).</p>
<p>Resting state fMRI neuroimaging data has been shown to perform well in two significant tasks: classification and prediction. Craddock et al. (<xref ref-type="bibr" rid="B15">2009</xref>) adopted resting state functional connectivity fMRI (rs-fc-fMRI) data to successfully distinguish individuals with major depressive disorder from healthy controls with a high 95% accuracy using a linear classifier and appropriate feature selection algorithm. Supekar et al. (<xref ref-type="bibr" rid="B58">2009</xref>) achieved a classification of individuals as either children or young-adults with 90% accuracy, using SVM classifier. Also Shen et al. (<xref ref-type="bibr" rid="B56">2010</xref>) performed accuracy equal to 81% in the discrimination between schizophrenic patients and healthy controls, using SVM classifier and a 92% accuracy was achieved using a <italic>C</italic>-means clustering classifier with locally linear embedding (LLE) feature selection algorithm.</p>
<p>Last few years, a series of (rs-fc)&#x02014;fMRI papers appeared in the literature focusing on defining an objective maturity index based on dynamic networks, discrimination of age- groups working thought out the development or the whole range of human age across the lifespan (8&#x02013;88 age). Dosenbach et al. (<xref ref-type="bibr" rid="B31">2010</xref>) used static networks from a large population and SVM classifier, achieving 91% accuracy for classification of individuals as either children or adults, and also they predicted functional maturity for each participant&#x00027;s brain resting-state functional brain network using a support vector machine regression (SVR). Vergun et al. (<xref ref-type="bibr" rid="B63">2013</xref>) studied the prediction of age (10&#x02013;70 age) and discrimination of young vs. old with static functional connectivity graphs (FCG) based on rs-fc-fMRI. Following, a feature selection and a linear SVR, they succeeded an acceptable prediction of age (<italic>R</italic><sup>2</sup> &#x0003D; 0.419) while they performed 84% classification for the discrimination of two age-groups using SVM. A recent study demonstrated a high correlation of age with a more dynamic perspective of inter-network interactions on resting-state with fMRI (Qin et al., <xref ref-type="bibr" rid="B51">2015</xref>). Furthermore, Betzel et al. (<xref ref-type="bibr" rid="B4">2014</xref>) modeled dynamic functional connectivity at resting-state with fMRI through the lifespan. They revealed functional changes in specific systems like in control, default mode, saliency/ventral attention, dorsal attention, and visual networks which become less cohesive through the age, while both the density and the strength of the structural connections decrease through the age.</p>
<p>Another study complements the previous rs-fc-fMRI explorations revealing a modification of dynamic couplings to both constrain and maximize functional variability across the lifespan in coordination to cognitive and behavioral demands (Hutchison and Morton, <xref ref-type="bibr" rid="B39">2015</xref>).</p>
<p>A lot of research explored developmental differences across the lifespan and between specific age groups at resting-state (spontaneous activity) with fMRI adopting both static and dynamic connectivity analysis, as afore mentioned. In contrast, only a few studies attempted to analyze spontaneous (resting-state) electrocortical activity across the lifespan via the notion of dynamic network analysis. In Kurth et al. (<xref ref-type="bibr" rid="B42">2015</xref>), they explored the interaction of sleep and maturation across early childhood. A recent study examined electrocortical maturation at children from early (7 years) to late childhood (11 years) where they found topological differences especially in &#x003B1; frequency band (Miskovic et al., <xref ref-type="bibr" rid="B49">2015</xref>).</p>
<p>Brain signal recorded via electroencephalography (EEG) is a complex signal containing the activity with different frequency profile. Apart from power spectrum analysis of the brain signals using Fourier or wavelet transform to reveal the amplitude modulations, it is important one to explore the different type of interactions. Intrinsic coupling modes (ICMs) in spontaneous activity reflect two basic complementary coupling mechanisms, the phase coupling of the bandpass filtered brain signals and the coupling of the signal envelopes (Engel et al., <xref ref-type="bibr" rid="B34">2013</xref>). Apart from exploring the ICMs by taking into account the functional coupling of signals with the same frequency, it is more than important to explore their cross-frequency interactions (Jirsa and M&#x000FC;ller, <xref ref-type="bibr" rid="B41">2013</xref>; Dimitriadis et al., <xref ref-type="bibr" rid="B20">2015b</xref>,<xref ref-type="bibr" rid="B21">c</xref>). Going one step further, the multiplexity of the human brain functionality can be detected via brain connectivity only if all the interactions are studying together. For that reason, it is significant to define the dominant type of interaction between every pair of brain areas at every small time-window across the experimental time. We hypothesize that the dynamic reconfiguration of dominant coupling modes is a key mechanism that can be linked with the flexibility of the human brain at first and secondly to its actual age (Buzs&#x000E1;ki and Draguhn, <xref ref-type="bibr" rid="B9">2004</xref>; Buzsaki, <xref ref-type="bibr" rid="B8">2010</xref>; Buzsaki et al., <xref ref-type="bibr" rid="B10">2013</xref>).</p>
<p>In this paper, we go one step further by modeling dynamic functional connectivity patterns (Dimitriadis et al., <xref ref-type="bibr" rid="B19">2013a</xref>,<xref ref-type="bibr" rid="B22">b</xref>, <xref ref-type="bibr" rid="B18">2015a</xref>,<xref ref-type="bibr" rid="B20">b</xref>) at resting-state using a dataset of 94 subjects from 18 to 60 years. The final outcome of this analysis is a symbolic time series that encodes the metastability of individual brain state. We first design a codebook of prototypical network microstates and then we assign each of this instantaneous connectivity pattern to the most similar code symbol (e.g., functional connectivity graph&#x02014;FCG) (Dimitriadis et al., <xref ref-type="bibr" rid="B19">2013a</xref>, <xref ref-type="bibr" rid="B18">2015a</xref>). In this way, a unique symbolic time series derived from each individual where each symbol corresponds to one of the predefined prototypical connectivity patterns. The evolution of these symbols-patterns encapsulates significant state transitions.</p>
<p>Our analysis is simultaneously unique because attempts to construct a dynamic functional connectivity that integrates both within frequency interactions and also between frequencies called cross-frequency interactions (Jirsa and M&#x000FC;ller, <xref ref-type="bibr" rid="B41">2013</xref>). We followed an appropriate surrogate analysis and we assigned to each pair of sensors across each quasi-instantaneous FCG at any point t, the dominant type of interactions (Engel et al., <xref ref-type="bibr" rid="B34">2013</xref>; Dimitriadis et al., <xref ref-type="bibr" rid="B26">2016a</xref>). With this approach apart from the weight that describes the strength of functional coupling between two temporal segments from two spatially apart EEG sensors, we keep the type of preferred interaction. The dominant intrinsic coupling mode (DICM) could be within &#x003B1; frequency band or between &#x003B4;-&#x003B3; as a cross-frequency coupling. The final outcome of this approach is an integrated dynamic functional connectivity graph (IDFCG) that incorporates both the weight and the type of DICM. The whole approach is unique and first presented here.</p>
<p>The proposed methodological scheme has two distinct ways of analyzing the dynamic functional connectivity patterns based on IDFCG. The first approach constitutes novel contributions to an emerging neuroimaging field called chronnectomics (Calhoun et al., <xref ref-type="bibr" rid="B12">2014</xref>). The concept of chronnectome is the incorporation of a dynamic view of functional brain connectivity networks and the evolution of revisiting distinct spatio-temporal brain states (functional connectivity microstates&#x02014;FC&#x003BC;states). The second approach is a novel way to understand how brain areas change preferred type of interactions over time even at resting-state, in the absence of external stimuli. The dynamic reconfiguration of dominant intrinsic coupling modes can be a valuable tool to describe how flexible is a brain, probably a unique characteristic for each individual. To the best of our knowledge, this is the first time that such an approach is exploited for the purposes of defining a chronnectomic brain maturation index (CBMI) that can predict the actual age of an individual.</p>
</sec>
<sec sec-type="materials and methods" id="s2">
<title>Materials and methods</title>
<p>In this section, we describe the two EEG datasets used here to validate the proposed developmental index. The main EEG dataset is free and available while the second is part of a previous study and was used as an external validation scheme. Additionally, we described on this section, how integrated dynamic functional connectivity networks (IDFCG) was constructed and how it was modeled via the proposed scheme. Complementary, we give a seminar description of different features that can be extracted from the IDFCG called chronnectomics.</p>
<sec>
<title>EEG recordings</title>
<p>Scalp EEG signals were gathered from the free online database PhysioNet BCI (Database physionet BCI<xref ref-type="fn" rid="fn0001"><sup>1</sup></xref>) (Schalk et al., <xref ref-type="bibr" rid="B53">2004</xref>). The database consists of <italic>N</italic> &#x0003D; 94 healthy subjects recorded in two different baseline conditions, i.e., 1-min eyes-open (EO) resting state and 1-min eyes-closed (EC) resting state. In each condition, subjects were comfortably seated on a reclining chair in a dimly lit room. During EO they were asked to avoid ocular blinks in order to reduce signal contamination. The EEG data were recorded with a 64-channel system (BCI2000 system (BCI2000 system) with an original sampling rate of 160 Hz. From the 94 healthy subjects 39 were male with mean_age &#x0003D; 37.69 &#x003BA;&#x003B1;&#x003B9; std_age &#x0003D; 12.63 and the rest 55 were female with mean_age &#x0003D; 39.4 &#x003BA;&#x003B1;&#x003B9; std_age &#x0003D; 10.22. The range of age in the training sample was between 19 and 67.</p>
<p>We used a second EEG dataset for external validation of the proposed scheme based on 100 subjects from ages 18&#x02014;60 from the Human Brain Institute (HBI) Normative Database using 19 EEG channels and the first min from the three recording min of eyes-open and eyes-closed condition.</p>
</sec>
<sec>
<title>Preprocessing</title>
<p>Ongoing activity was corrected for artifacts through a two-step procedure implemented in Matlab (The MathWorks, Inc., Natick, MA, USA) and Fieldtrip (Oostenveld et al., <xref ref-type="bibr" rid="B50">2011</xref>). Line noise was first removed using a notch filter at 60 Hz and the single-subject data was whitened and reduced in dimensionality by means of Principal Component Analysis (PCA) with a threshold corresponding to 95% of total variance (Delorme and Makeig, <xref ref-type="bibr" rid="B17">2004</xref>; Antonakakis et al., <xref ref-type="bibr" rid="B1">2013</xref>). The resulting signals were submitted to ICA using the extended Infomax algorithm as implemented in EEGLAB (Delorme and Makeig, <xref ref-type="bibr" rid="B17">2004</xref>). A given independent component was considered to reflect ocular or cardiac artifacts if more than 30% of its z-score kurtosis or skewness values, respectively, were outside &#x000B1;2 of the distribution mean (Antonakakis et al., <xref ref-type="bibr" rid="B1">2013</xref>; Dimitriadis et al., <xref ref-type="bibr" rid="B18">2015a</xref>). The remaining ICs were used to reconstruct a relatively artifact-free signal. The average number of artefactual ICs was 5.5 for eyes-closed and 5.1 for the eyes-open condition (see Figure <xref ref-type="fig" rid="F1">1A</xref>).</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>Outline of our methodology. From multiple versions of dynamic functional connectivity graphs to a single integrated DIFCG. <bold>(A)</bold> ICA cleaning of EEG recordings, projected from ICA space to EEG sensor space and filtered in the predefined frequency bands. <bold>(B)</bold> From multichannel recordings to multiple versions of dynamic functional connectivity graphs (DFCG) linked to intra and inter-frequency couplings. <bold>(C)</bold> An example of how to assign a dominant type of interactions among intra and cross-frequency couplings to every possible pair of sensors. <bold>(D)</bold> The proposed scheme derived to a single integrated dynamic functional connectivity graph (IDFCG) which finally fed to a. <bold>(E)</bold> Data-driven topological filtering scheme based on orthogonal minimal spanning tree (OMST). <bold>(F)</bold> Estimation of nodal network metric time series based on GE over the DIFCG. <bold>(G)</bold> The outcome of NNMF-NG algorithm is the eight nFCG&#x003BC;states for eyes-open condition. <bold>(H)</bold> State transition vectors for a subject (age &#x0003D; 18). Assigned states are plotted at every time point that corresponds to the center of the sliding window while the Transition Matrix of the state vector for the same example is given. <bold>(I)</bold> Demonstration of how the dominant coupling mode changes over experimental time in both strength and type of dominant coupling mode.</p></caption>
<graphic xlink:href="fnhum-11-00423-g0001.tif"/>
</fig>
</sec>
<sec>
<title>Functional connectivity</title>
<p>Here, functional connectivity was examined among the following eight brain rhythms of the typical sub-bands of electrophysiological neural signals {&#x003B4;, &#x003B8;, &#x003B1;<sub>1</sub>, &#x003B1;<sub>2</sub>, &#x003B2;<sub>1</sub>, &#x003B2;<sub>2</sub>, &#x003B3;1, &#x003B3;2}, defined respectively within the ranges {0.5&#x02013;4; 4&#x02013;8; 8&#x02013;10; 10&#x02013;13; 13&#x02013;20; 20&#x02013;30; 30&#x02013;48; 52&#x02013;70 Hz}. We adopted a 3rd order Butterworth filters applied in a zero-phase mode to get the characteristic brain rhythms (see Figure <xref ref-type="fig" rid="F1">1A</xref>).</p>
</sec>
<sec>
<title>Dynamic iPLV estimates: the time-varying integrated iPLV graph (<sup>TVI</sup>iPLV graph)</title>
<p>The goal of the analytic procedures described in this section is to understand the repertoire of phase-to-phase interactions and their temporal evolution, while taking into account the quasi-instantaneous spatiotemporal distribution of iPLV estimates. This was achieved by computing one set of iPLV estimates within each of a series of sliding overlapping windows spanning the entire 1-min continuous EEG recording for both eyes-open and closed condition. The width of the temporal window was set equal to the duration of 10 cycles of &#x003B4; brain rhythm, as an adequate number to capture the dynamics of every brain rhythm (fast and slows, Dimitriadis et al., <xref ref-type="bibr" rid="B19">2013a</xref>). The center of the stepping window moved forwards every 20 ms and both intra and inter-frequency interactions within and between every possible pair of frequencies were reestimated leading to a quasi-stable in time static iPLV graph. In this manner, a series of 1,856 of iPLV graph estimates were computed per condition, frequencies (8 within frequency &#x0002B; 28 possible pairs of cross-frequency interactions &#x0003D; 36 combinations) and for each participant.</p>
<p>This procedure, the implementation details of which can be found elsewhere (Dimitriadis et al., <xref ref-type="bibr" rid="B25">2010</xref>, <xref ref-type="bibr" rid="B24">2012</xref>, <xref ref-type="bibr" rid="B22">2013b</xref>, <xref ref-type="bibr" rid="B18">2015a</xref>,<xref ref-type="bibr" rid="B21">c</xref>), resulted in eight time-varying iPLV graphs per participant (<sup>TV</sup>iPLV) for within frequency bands (Section <xref ref-type="supplementary-material" rid="SM1">1</xref> in Supplementary Material) and 28 time-varying iPLV graphs per participant (<sup>TV</sup>iPLV) for each possible cross-frequency pair (Section <xref ref-type="supplementary-material" rid="SM1">2</xref> in Supplementary Material), each serving as an instantaneous snapshot of the surface network. <sup>TV</sup>iPLV tabulates iPLV estimates between every possible pair of sensors. For each subject, a 4D tensor [frequencies bands (36) &#x000D7; slides (1,856) &#x000D7; sensors (64) &#x000D7; sensors (64)] was created for each condition integrating subject-specific spatio-temporal phase interactions (Figure <xref ref-type="fig" rid="F1">1B</xref>).</p>
<p>Afterward, we applied surrogate analysis in order to reveal the dominant type of interaction for each pair of EEG sensors and at each snapshot of the <sup>TV</sup>iPLV (Figure <xref ref-type="fig" rid="F1">1C</xref>&#x02014;Section <xref ref-type="supplementary-material" rid="SM1">3</xref> in Supplementary Material). Finally, we tabulated both the strength and the type of dominant coupling mode in 2 3D tensor [slides (1,856) &#x000D7; sensors (64) &#x000D7; sensors (64)], one that keeps the strength of the coupling based on iPLV and a second one for keeping the dominant coupling of interaction using integers from 1 up to 36 {1 for &#x003B4;, 2 for &#x003B8;,&#x02026;,8 for &#x003B3;<sub>2</sub>, 9 for &#x003B4;&#x02212;&#x003B8;,&#x02026;, 36 for &#x003B2;<sub>2</sub> &#x02212; &#x003B3;<sub>2</sub>} (Figure <xref ref-type="fig" rid="F1">1D</xref>). The notion of phase-to-amplitude cross-frequency coupling (CFC) estimator has been used also in our previous studies (Dimitriadis et al., <xref ref-type="bibr" rid="B20">2015b</xref>, <xref ref-type="bibr" rid="B26">2016a</xref>,<xref ref-type="bibr" rid="B28">b</xref>,<xref ref-type="bibr" rid="B29">c</xref>, <xref ref-type="bibr" rid="B27">2017</xref>).</p>
</sec>
<sec>
<title>A data-driven topological filtering scheme based on orthogonal minimal spanning trees (OMSTs)</title>
<p>On the previous section, we applied statistical filtering approach in order to explore: (a) if a given iPLV value differed from what would be expected by chance alone, (b) if a non-zero iPLV corresponded to non-spurious coupling, and (c) to integrate dominant intrinsic coupling modes into a single graph called dynamic integrated functional connectivity graph (DIFCG). Apart from statistical filtering approach, it is important to adopt a data-driven topological filtering approach in order to reveal the backbone of the network topology over the increment of information flow.</p>
<p>The adopted topological filtering scheme based on orthogonal minimal spanning trees (OMST) (Figure <xref ref-type="fig" rid="F1">1D</xref>). Usage of the orthogonal MST graph leads to a better sampling of brain network preserving the advantage of MST that connects the whole network with minimum cost without introducing cycles and without differentiated strong from weak connections (Dimitriadis et al., <xref ref-type="bibr" rid="B27">2017</xref>). For further details see also section <xref ref-type="supplementary-material" rid="SM1">4</xref> in Supplementay Material.</p>
<p>The outcome of both statistical and topological filtering scheme is demonstrated in Figure <xref ref-type="fig" rid="F1">1E</xref> for a static functional connectivity graph (FCG) from &#x003B4; frequency of the first subject in the database. The resulting functional connectivity graph is sparser compared to the full-weighted (FCG) derived via the bivariate iPLV connectivity estimator. The FCG with dimension sensors x sensors illustrates the strength of the coupling in the surviving set of connections while the comodulogram demonstrates the probability distribution (PD) of the dominant coupling modes. The main diagonal refers to the PD of the within frequency interactions while the off-diagonal to the PD of the cross-frequency coupling namely the phase-to-amplitude couplings. The horizontal x-axis refer to how each the phase of the lower brain rhythms modulates the amplitude of the higher frequencies.</p>
</sec>
<sec>
<title>Network metric time series (NMTS)</title>
<p>After applying the statistical and topological filtering approach, we estimated the global efficiency (GE) for each node and across time. This approach leads to a 2D matrix of dimensions 64 (sensors) &#x000D7; 1,856 (temporal segments) for each subject. This matrix tabulates the fluctuations of GE for each node and can be seen as network metric time series (NMTS) that keeps the importance of each node for integration of information (Dimitriadis et al., <xref ref-type="bibr" rid="B19">2013a</xref>,<xref ref-type="bibr" rid="B22">b</xref>).</p>
<p>The estimation of GE based on the notion of shortest path length. However, we want to favor the selection of strongest functional couplings and for that reason the weights original functional connectivity graphs are inverted (1./FCG). A connection with strong coupling strength means that those two areas are functionally closed even in the case that are distant anatomically. By inverting the original weights, shortest path lengths between every pair of nodes will capture the strongest connections under the constraint of minimizing the overall distance cost. Distance cost (<italic>d</italic><sub><italic>ij</italic></sub>) of a shortest path length is defined the total sum of weights of the path that connects two nodes, here two EEG sensors.</p>
<p>Network GE reflects the overall efficiency of parallel information transfer within the entire set of 64 sensors and was estimated as the average sensor-specific GE value over all sensors using the following formula:</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M1"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:mi>G</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:mstyle displaystyle='true'><mml:munder><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mi>N</mml:mi></mml:mrow></mml:munder><mml:mrow><mml:mfrac><mml:mrow><mml:mstyle displaystyle='true'><mml:msub><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x000A0;</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x02260;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><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:mrow></mml:mstyle></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>d</italic><sub><italic>ij</italic></sub> denotes the distance of the shortest path length between target node <italic>i</italic> and the rest <italic>N</italic> &#x02212; 1 <italic>j</italic> nodes. Here, we estimated the nodal <italic>GE</italic> which leads to 64 values per time-instant functional connectivity graph.</p>
<p>The derived 2D matrix based on nodal NMTS of GE will be modeled with the proposed method that is described in the following section. The first time instances of the topology of nodal GE is illustrated in Figure <xref ref-type="fig" rid="F1">1F</xref>.</p>
</sec>
<sec>
<title>A non-negative matric factorization (NNMF)&#x02014;vector-quantization (VQ) modeling of dynamic functional connectivity graphs</title>
<p>This subsection serves as a brief introduction to our symbolization scheme, presented in greater details elsewhere (Dimitriadis et al., <xref ref-type="bibr" rid="B23">2011</xref>, <xref ref-type="bibr" rid="B24">2012</xref>, <xref ref-type="bibr" rid="B19">2013a</xref>,<xref ref-type="bibr" rid="B22">b</xref>). The dynamic functional connectivity patterns can be modeled as prototypical functional connectivity microstates (FC&#x003BC;states). In a recent study, we demonstrated a better modeling of dynamic functional connectivity graphs (DFCG) based on vector quantization approach (Dimitriadis et al., <xref ref-type="bibr" rid="B19">2013a</xref>), if a preprocessing is added. The algorithm called non-negative matrix factorization (NNMF) (Marimpis et al., <xref ref-type="bibr" rid="B45">2016</xref>). Here, we employed the NNMF as a first step for re-parameterization of the dynamic functional connectivity graph (DFCG) within a reduced space. This reduced space keeps the most informative ingredients for a parsimonious representation of the original connectivity patterns. Within this reduced NNMF-based low-dimensional space, a codebook of <italic>k</italic> prototypical functional connectivity states (i.e., connectivity microstates) is first designed by applying the neural-gas algorithm (Laskaris and Ioannides, <xref ref-type="bibr" rid="B43">2001</xref>). This algorithm is an artificial neural network model, which converges efficiently to a small number <italic>k</italic> of codebook vectors, using a stochastic gradient descent procedure with a soft-max adaptation rule that minimizes the average distortion error (Martinetz et al., <xref ref-type="bibr" rid="B46">1993</xref>).</p>
<p>In this way, the bulk of information contained in the time series of connectivity patterns is represented, in a parsimonious way, by a partition matrix <italic>U</italic>, with elements <italic>u</italic><sub><italic>ij</italic></sub> indicating the assignment of input connectivity patterns to code vectors. Following the inverse procedure, we can rebuild a given time series from the <italic>k</italic> code vectors, with a small reconstruction error <italic>E</italic>. The selection of parameter <italic>k</italic> reflects the trade-off between fidelity and compression level. In this work, it was set as the smaller value to achieve a reconstruction error lower than 4%. Finally, we need to mention that inside the codebook design there is an algorithmic seriation procedure that &#x0201C;ranks&#x0201D; the symbols. As a consequence, the symbolic time series closely follows the underlying functional connectivity dynamics. The neural-gas algorithm applied to the output of NNMF is called vector-quantization scheme (VQ) and the whole proposed scheme (NNMF-VQ). The derived symbolic times series that keep the information of network FC&#x003BC;states (nFC&#x003BC;states) are called hereafter as STS<sup>NNMF-VQ</sup>. The combination of NNMF-VQ gives a lower distortion error compared to the VQ alone.</p>
<p>This approach leads to eight brain metastates for eyes-open and eight for eyes-closed based on the minimization of the average distortion error (Figures <xref ref-type="fig" rid="F1">1G</xref>, <xref ref-type="fig" rid="F2">2</xref>, <xref ref-type="fig" rid="F3">3</xref>). Both Figures <xref ref-type="fig" rid="F2">2</xref>, <xref ref-type="fig" rid="F3">3</xref> illustrates the topology of the nodal GE across the eight nFC&#x003BC;states in both conditions. The nFC&#x003BC;states no: 4&#x02013;8 for the eyes-open condition and the nFC&#x003BC;states no: 6&#x02013;7 for the eyes-closed demonstrates a topological similarity over parieto-occipital sites but with different activation profile expressed via the nodal GE.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p>nFC&#x003BC;states for eyes-open condition derived from the NNMF-VQ scheme, GE, global efficiency.</p></caption>
<graphic xlink:href="fnhum-11-00423-g0002.tif"/>
</fig>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p>nFC&#x003BC;states for eyes-closed condition derived from the NNMF-VQ scheme, GE, global efficiency.</p></caption>
<graphic xlink:href="fnhum-11-00423-g0003.tif"/>
</fig>
<p>In Figure <xref ref-type="fig" rid="F4">4A</xref>, we present four state transition vectors STS<sup>NNMF-VQ</sup> from three subjects each one from three age groups. These STS<sup>NNMF-VQ</sup> expressed the evolution of the eight nFC&#x003BC;states across the experimental time. The derived transition matrix (TM) that tabulate the probability distributions of the favored transitions is demonstrated also in Figure <xref ref-type="fig" rid="F4">4A</xref>. Higher values in TM indicate preferred transitions between two states. Figure <xref ref-type="fig" rid="F4">4C</xref> demonstrates the evolution of dominant intrinsic coupling mode from pair of sensors F3-PO3 from the same subjects as in Figure <xref ref-type="fig" rid="F4">4A</xref>. The color refers to the strength of coupling namely the iPLV while the changes over the y-axis refer to the alterations of dominant intrinsic coupling modes (DICM). Across time (Figure <xref ref-type="fig" rid="F4">4C</xref>). On the right of these symbolic time series, we showed the comodulograms that tabulate the probability distribution of each of the 36 DICM for this particular pair of sensors (Figure <xref ref-type="fig" rid="F4">4D</xref>). The symbolic time series that encapsulate the DICM is a time series with values taken from 1 to 36 and it is called hereafter STS<sup>DICM</sup>.</p>
<fig id="F4" position="float">
<label>Figure 4</label>
<caption><p><bold>(A)</bold> State transition vectors for three examples (age &#x0003D; 18, 37, 48). Assigned states are plotted at every time point that corresponds to the center of the sliding window. <bold>(B)</bold> Transition matrices of the state vectors for the same example as in <bold>(A)</bold>. <bold>(C)</bold> Evolution of DICM and the related iPLV strength at every time point that corresponds to the center of the sliding window. The color refers to the iPLV strength while the y-axis refers to one of the 36 DICM. <bold>(D)</bold> Comodulograms of the evolved DICM from the examples in <bold>(C)</bold> that tabulate the probability distribution of observing each of DICM. For this particular example, we adopted the pair of F3-PO3 from the same subjects as in <bold>(A,B)</bold>. DICM, dominant intrinsic coupling modes; TR, transition rates; PD, probability distribution; ERT, entropy reduction rate.</p></caption>
<graphic xlink:href="fnhum-11-00423-g0004.tif"/>
</fig>
</sec>
<sec>
<title>Characterization of time-varying connectivity</title>
<p>Once the DIFCG is formed and it is modeled via the NNMF-VQ scheme, relevant features can be extracted from the data based on the state-transition states and also on the DICM. Our approach adds in the literature also the notion of DICM which is an important characteristic of electroencephalography (Jirsa and M&#x000FC;ller, <xref ref-type="bibr" rid="B41">2013</xref>; Dimitriadis et al., <xref ref-type="bibr" rid="B20">2015b</xref>, <xref ref-type="bibr" rid="B26">2016a</xref>). DICM especially based on phase interactions within frequencies and phase-to-amplitude between frequencies are characteristic for EEG signal but not for fMRI. This section will describe the whole repertoire of features that were used here to build the developmental index.</p>
</sec>
<sec>
<title>Chronnectomics</title>
<sec>
<title>State transition rate</title>
<p>Based on the state transition vectors STS<sup>NNMF-VQ</sup> as demonstrated in Figure <xref ref-type="fig" rid="F5">5</xref>, we estimated the transition rate for every pair of states as followed:</p>
<disp-formula id="E2"><label>(2)</label><mml:math id="M2"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>T</mml:mi><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>TR gets higher values for higher &#x0201C;jumps&#x0201D; of the brain between the derived brain states over consecutive time windows. This approach leads to one feature per participant. TR was estimated over STS<sup>NNMF-VQ</sup> as demonstrated in Figure <xref ref-type="fig" rid="F4">4A</xref>.</p>
<fig id="F5" position="float">
<label>Figure 5</label>
<caption><p>A least square regression line between the real and predicted age for eyes open.</p></caption>
<graphic xlink:href="fnhum-11-00423-g0005.tif"/>
</fig>
</sec>
<sec>
<title>Transition matrix</title>
<p>Complementary to TR, we estimated the transition matrix (TM) that tabulates the preferred transition of every nFCG&#x003BC;states to another. TR was estimated over STS<sup>NNMF-VQ</sup> (Figures <xref ref-type="fig" rid="F1">1H</xref>, <xref ref-type="fig" rid="F4">4A</xref>) and in every cell in the TM, the total number of transitions are encountered between every pair of nFCG&#x003BC;states. For example, if nFCG&#x003BC;states (1) transits to nFCG&#x003BC;states (2) 45 times then TM <sub>(1, 2)</sub> &#x0003D; 45 while if nFCG&#x003BC;states (2) transits to nFCG&#x003BC;states (1) 10 time then TM<sub>(2, 1)</sub> &#x0003D; 10.</p>
<p>Finally, we transformed the transition matrix (TM) into a probability matrix by dividing the TM with the sum of totally observed transitions over all possible pairwise states. TR was also estimated between every possible pair of states leading to an 8 &#x000D7; 8 TR matrix and extra 64 features per subject and condition (see Figure <xref ref-type="fig" rid="F4">4B</xref>).</p>
</sec>
<sec>
<title>Dominant intrinsic coupling mode transition rate</title>
<p>Based on the 2nd DIFCG that keeps the information of the DICM per pair of sensors and across time, we estimated the transition rate for each pair of sensors. The proposed estimator can be seen as the flexibility index (FI) proposed to quantify how many times a node changes cluster assignment across experimental time (Bassett et al., <xref ref-type="bibr" rid="B2">2011</xref>). The analogy of this FI for EEG is the one proposed here based on DICM and called hereafter FI<sup>DICM</sup> which is defined as:</p>
<disp-formula id="E3"><label>(3)</label><mml:math id="M3"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext>F</mml:mtext><mml:msup><mml:mrow><mml:mtext>I</mml:mtext></mml:mrow><mml:mrow><mml:mtext>DICM</mml:mtext></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>FI<sup>DICM</sup> gets higher values for higher &#x0201C;jumps&#x0201D; of preferred DICM of a pair of brain areas between consecutive time windows. This approach leads to 64 &#x000D7; 64 features per subject, one for every pair of EEG sensors. FI<sup>DICM</sup> was estimated over STS<sup>DICM</sup> as demonstrated in Figures <xref ref-type="fig" rid="F1">1I</xref>, <xref ref-type="fig" rid="F4">4C</xref>.</p>
</sec>
<sec>
<title>Spatio-temporal distribution of dominant intrinsic coupling modes&#x02014;comodulograms</title>
<p>Based on the 2nd DIFCG that keeps the information of the DICM, we can tabulate in a 8 &#x000D7; 8 matrix the probability distribution of observing each of the 36 frequencies (8&#x02013;frequencies &#x0002B; 28-cross-frequency pairs) across time (1,896 temporal segments) and space (64 EEG sensors). This approach leads to 36 features per subject. The matrices that keep this information are called hereafter as comodulograms. An example of these comodulograms is given in Figures <xref ref-type="fig" rid="F1">1E</xref>, <xref ref-type="fig" rid="F4">4D</xref>.</p>
</sec>
<sec>
<title>Complexity index</title>
<p>Next, a complexity index (CI) was estimated for each subject based on STS<sup>NNMF-VQ</sup>. CI quantifies the &#x0201C;richness of the language&#x0201D; within a symbolic sequence, and has been used in several fields, such as data compression, data mining, computational biology computational linguistics (Leve and Seebold, <xref ref-type="bibr" rid="B44">2001</xref>). We adopted the complexity index based on symbolic sequences as presented in Janson et al. (<xref ref-type="bibr" rid="B40">2004</xref>). Low CI values describe sequences containing frequent repeated substrings that become periodic.</p>
<p>The magnitude of the derived CI values was evaluated according to their deviation from the maximum complexity that can be derived by random versions of the original symbolic sequence. To achieve this CI values were z-score transformed using the standard deviation of the distribution of 1,000 randomized versions of the original symbolic sequence (Dimitriadis et al., <xref ref-type="bibr" rid="B28">2016b</xref>).</p>
<p>In addition to determining the optimal number of distinct symbols describing the original time series, the length of potentially repeated patterns of symbols (i.e., substrings) in a symbolic sequence was parameterized. Here, we fixed the parameter of the length of words that are observed from the STS<sup>NNMF-VQ</sup> as length &#x0003D; 7. CI is estimated as the sum of distinct words detected from the symbolic sequence up to a predefined word length. The original symbolic sequence, here the STS<sup>NNMF-VQ</sup> was shuffled for no &#x0003D; 1.000 times and the CI<sup>Rand</sup> was reestimated. Then, the z-score was computed from the original CI and the mean(average)/st.d(standard deviation) of the 1.000 CI<sup>Rand</sup>. If the distribution of these distinct words is called symbolic patterns with dimension equals the word length, here 7, then the CI, CI<sup>Rand</sup> and the z-score are defined as:</p>
<disp-formula id="E4"><label>(4)</label><mml:math id="M4"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mi>C</mml:mi><mml:mi>I</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mi>S</mml:mi><mml:mi>y</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>c</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:mi>P</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>n</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>C</mml:mi><mml:msup><mml:mi>I</mml:mi><mml:mrow><mml:mi>R</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mstyle displaystyle='true'><mml:munderover><mml:mo>&#x02211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mi>S</mml:mi><mml:mi>y</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>c</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:mi>P</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:msup><mml:mi>n</mml:mi><mml:mrow><mml:mi>R</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msup><mml:mo stretchy='false'>(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>Z</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>C</mml:mi><mml:mi>I</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>C</mml:mi><mml:mi>I</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>C</mml:mi><mml:msup><mml:mi>I</mml:mi><mml:mrow><mml:mi>R</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>d</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>C</mml:mi><mml:msup><mml:mi>I</mml:mi><mml:mrow><mml:mi>R</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>In a simplified example of the symbolic sequence {1 2 1 2 1 2 1 2 1 2}, the distinct words (symbolic patterns) of length up to 2 are the {1,2,12,21} and the CI &#x0003D; 4. In a second symbolic sequence of {1 1 1 1 1 1 1 1 1 1}, the distinct words (symbolic patterns) of length up to 2 is only the {1,11} and the CI &#x0003D; 2. To further understand the notion of CI, a third example of symbolic sequence is provided {1 2 2 1 2 2 1 2 1 1}. The symbolic patterns based on words of length &#x0003D; 2 is consisted of 6 distinct words {1,2,12,22,21,11}. The CI equals to 6.</p>
<p>STS<sup>NNMF-VQ</sup> describes the deterministic nature of the human brain where hundreds of time-instant functional connectivity graphs can be described by a small repertoire of nFCG&#x003BC;states. Complexity index can express how repeatable are the patterns of brain connectivity across experimental time. We assume that the CI of the human brain dynamics will be higher for younger subjects compared to middle-aged group which means that the human brain becomes more deterministic across the age.</p>
<p>The whole approach leads to a single feature per subject. For further details of the complexity index, an interested reader could see Section <xref ref-type="supplementary-material" rid="SM1">5</xref> in Supplementary Material and also the original article (Janson et al., <xref ref-type="bibr" rid="B40">2004</xref>).</p>
</sec>
<sec>
<title>Entropy of Markov trajectories</title>
<p>By adopting the aforementioned NNMF-VQ scheme, we modeled the IDFCG into distinct nFC&#x003BC;states. Under this scheme, we transformed a dynamic network into a symbolic time series that preserve the information of the derived nFC&#x003BC;states at every time point (see Figure <xref ref-type="fig" rid="F4">4A</xref>). This time series can be seen as a finite-state machine. A Markovian chain modeling can be reasonable derived from the symbolic time series STS<sup>NNMF-VQ</sup>. This type of modeling emphasizes the transition between the nFC&#x003BC;states.</p>
<p>Aiming to detect features that can be valuable for the building of a chronnectomic maturation index based on EEG, we resort to a technique that quantifies the entropy of Markov trajectories which are routes starting from a particular microstate and ending to another. Our assumption based on the notion of a less flexible brain, less degrees of freedom through the age. This less flexibility can be estimated as a reduction of the entropy of specific Markovian trajectories which are considered as a finite irreducible Markovian chain with empirical transition matrix P which is derived from the STS<sup>NNMF-VQ</sup>. The entropy is defined as:</p>
<disp-formula id="E5"><label>(5)</label><mml:math id="M5"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>H</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:munder></mml:mstyle><mml:msub><mml:mrow><mml:mo>&#x003BC;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo class="qopname">log</mml:mo><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where &#x003BC; is a n equilibrium distribution of the Markov chain as below:</p>
<disp-formula id="E6"><label>(6)</label><mml:math id="M6"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mo>&#x003BC;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munder class="msub"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:munder></mml:mstyle><mml:msub><mml:mrow><mml:mo>&#x003BC;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mtext>&#x000A0;&#x000A0;</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>For an irreducible Markov chain, the entropy <italic>H</italic><sub><italic>ii</italic></sub> of a random trajectory from state <italic>i</italic> back to state <italic>j</italic> is given by the following equation</p>
<disp-formula id="E7"><label>(7)</label><mml:math id="M7"><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>H</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mo>&#x003BC;</mml:mo><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>
<p>where &#x003BC;<sub><italic>i</italic></sub> is the stationary probability for state <italic>i</italic> and <italic>H</italic>(<italic>X</italic>) is the entropy rate given in Equation 5.</p>
<p>If <italic>P</italic><sub><italic>ij</italic></sub> is the transition matrix of an irreducible finite state Markovian chain, then the entropy <italic>H</italic><sub><italic>ij</italic></sub> of the trajectory from <italic>i</italic> to <italic>j</italic> is defined as:</p>
<disp-formula id="E8"><label>(8)</label><mml:math id="M8"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>H</mml:mi><mml:mo>=</mml:mo><mml:mi>K</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mi>K</mml:mi><mml:mo>&#x02032;</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>H</mml:mi><mml:mo>&#x00394;</mml:mo></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;where</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E9"><label>(9)</label><mml:math id="M9"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mi>K</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>I</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>A</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x02212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msup><mml:mi>H</mml:mi><mml:mo>&#x02217;</mml:mo></mml:msup><mml:mo>&#x02212;</mml:mo><mml:msub><mml:mi>H</mml:mi><mml:mi>&#x00394;</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E10"><label>(10)</label><mml:math id="M10"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mi>K</mml:mi><mml:msub><mml:mo>&#x02032;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E11"><label>(11)</label><mml:math id="M11"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mo>&#x003BC;</mml:mo><mml:mi>i</mml:mi></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E12"><label>(12)</label><mml:math id="M12"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:msubsup><mml:mi>H</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mo>&#x02217;</mml:mo></mml:msubsup><mml:mo>=</mml:mo><mml:mi>H</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><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;for&#x000A0;all&#x000A0;</mml:mtext><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mtext>&#x000A0;and</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E13"><label>(13)</label><mml:math id="M13"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mo>&#x00394;</mml:mo></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></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>H</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>/</mml:mo><mml:msub><mml:mo>&#x003BC;</mml:mo><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x02260;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>In the present study, we employ the finite state irreducible Markov chains modeling scheme focusing on the observed trajectories <italic>T</italic><sub><italic>ij</italic></sub>. A trajectory <italic>t</italic><sub><italic>ij</italic></sub>&#x003F5;<italic>T</italic><sub><italic>ij</italic></sub> from state <italic>i</italic> to state <italic>j</italic> is a path with initial state <italic>i</italic>, final state <italic>j</italic> without intervening state <italic>j</italic>.</p>
<p>For further details see the seminar work of Ekroot and Cover (<xref ref-type="bibr" rid="B33">1993</xref>).</p>
<p>The whole approach leads to an 8 &#x000D7; 8 matrix per subject that tabulates the entropy of Markovian trajectories called entropy reduction rate (ERT). Those 64 features will be added to the aforementioned features.</p>
</sec>
<sec>
<title>Sample entropy</title>
<p>We created a strength time series by summing the weights of the survived functional connections (after surrogate analysis and topological filtering) of each time instant IFCG. This procedure produces a strength time series of 1,856 samples length. Afterward, we estimated the sample entropy of this time series as described here (Richman and Moorman, <xref ref-type="bibr" rid="B52">2000</xref>).</p>
</sec>
</sec>
</sec>
<sec id="s3">
<title>Feature selection and prediction of maturation</title>
<sec>
<title>Feature selection</title>
<p>The whole repertoire of features proposed here leads to a total number of 1 (TR) &#x0002B; 8 &#x000D7; 8 (TM) &#x0002B; 64 &#x000D7; 64 (FI) &#x0002B; 36 (comodulograms) &#x0002B; 1 (Flexibility Index) &#x0002B; 8 &#x000D7; 8 (entropy of Markovian trajectories) &#x0002B; 1 (Sample Entropy) &#x0003D; 4.262 features per subject. For that reason, we should apply an appropriate feature selection approach for both tasks: (a) prediction of age and (b) discrimination of young vs. middle age adults.</p>
</sec>
<sec>
<title>Prediction of age</title>
<p>We estimated the distance correlation of 4262 features across subjects leading to a 4.262 &#x000D7; 4.262 matrix with positive weights. Distance correlation <italic>distcor</italic> ranges within [0, 1] in contrast to the correlation coefficient and can capture non-linear relationships (Szekely and Rizzo, <xref ref-type="bibr" rid="B59">2014</xref>). Afterwards, we applied a graph clustering algorithm (Massimiliano and Pelillo, <xref ref-type="bibr" rid="B47">2007</xref>) to extract clusters of features that are highly correlated within the cluster and low correlated between clusters. Our analysis revealed 25 clusters for the eyes-open condition and 43 for the eyes-closed. Finally, we extracted one feature per cluster with the criterion of high correlation with the age across the cohort. This procedure leads to 25 features for eyes-open and 43 features for eyes-closed.</p>
<p>As an appropriate method for build a model for predicted the age based on the selected features is the extension of SVM which is called SVM regression (SVR). Drucker et al. (<xref ref-type="bibr" rid="B32">1997</xref>) extended SVM to include also the regression approach for continuous real valued predictions. SVR retains the basic features of SVM classifier but the key difference is that in SVM classification a penalty exists for misclassified data points whereas in SVR a penalty is used for data points far from the regression line in a high dimensional space (Dosenbach et al., <xref ref-type="bibr" rid="B31">2010</xref>).</p>
</sec>
<sec>
<title>Classification of young vs. middle-age adults</title>
<p>For the binary classification of the two groups, we followed a different feature selection approach. By adopting the Laplacian Score (He et al., <xref ref-type="bibr" rid="B36">2005</xref>), we estimated the weights of each feature that quantifies the discriminative power of each feature. On this procedure, we used the labels of 1 for young group and 2 for middle-age group. In order to apply a threshold, we re-estimated the LS of the features by shuffling the labels [1, 2] across the subject. We repeated the procedure 200 times and afterward we estimated the mean &#x0002B; 2.5 std (standard deviations) from the 1.000 &#x000D7; 4.263 LS weights. This thresholding criterion was applied to the original LS weights leading to the selection of 109 features.</p>
<p>As a proper classifier for the classification of age groups, we used the famous extreme learning machine (ELM). ELMs appeared as a proper choice due to its ability to manipulate difficult tasks without an extensive training set up (Huang et al., <xref ref-type="bibr" rid="B37">2006</xref>). ELM are feedforward artificial neural networks with a single layer of hidden nodes where the weights that connect the input to the hidden nodes are randomly assigned and never updated (Huang, <xref ref-type="bibr" rid="B38">2015</xref>).</p>
</sec>
</sec>
<sec sec-type="results" id="s4">
<title>Results</title>
<sec>
<title>Prediction of age</title>
<p>We followed a leave-one out cross-validation scheme (LOOCV) in order to predict the age of a subject. This means that we trained the classifier with the selected features from <italic>N</italic> &#x02212; 1 where <italic>N</italic> denotes the number of subjects and we predicted the age of the <italic>N</italic>th. Repeated the whole approach <italic>N</italic> times, we predicted the individual age of every subject in the cohort. For the purpose of the prediction of age, we adopted the regression version of the Support Vector Machine, the Support Vector Regressor (SVR).</p>
<p>Our results revealed a very high prediction of age for eyes-open (<italic>R</italic><sup>2</sup> &#x0003D; 0.60; y &#x0003D; 0.79x &#x0002B; 8.03) and lower for eyes-closed (<italic>R</italic><sup>2</sup> &#x0003D; 0.48; y &#x0003D; 0.71x &#x0002B; 10.91) where y is a linear regression line applied to the (x, y) points with x being the true age of the subject and y the predicted age (Figures <xref ref-type="fig" rid="F5">5</xref>, <xref ref-type="fig" rid="F6">6</xref>).</p>
<fig id="F6" position="float">
<label>Figure 6</label>
<caption><p>A least square regression line between the real and predicted age for eyes-closed.</p></caption>
<graphic xlink:href="fnhum-11-00423-g0006.tif"/>
</fig>
<p>Figure <xref ref-type="fig" rid="F7">7</xref> illustrates the 25 selected features for the regression problem of prediction of actual age based on eyes-open. The 25 selected features referred to 24 FI per pair of sensors (Figure <xref ref-type="fig" rid="F7">7A</xref>) and 1 for the PD for &#x003B1;<sub>2</sub> (Figure <xref ref-type="fig" rid="F7">7B</xref>).</p>
<fig id="F7" position="float">
<label>Figure 7</label>
<caption><p>Demonstration of features for the regression problem. <bold>(A)</bold> Nineteen features referred to FI per pair of sensors and <bold>(B)</bold> for the PD for &#x003B1;<sub>2</sub>. TR, transition rates, PD, probability distribution.</p></caption>
<graphic xlink:href="fnhum-11-00423-g0007.tif"/>
</fig>
</sec>
<sec>
<title>Classification of young adults vs. middle age group</title>
<p>Using extreme learning machine (ELM classifier and a LOOCV), we succeeded to correctly classify young vs. middle-age group with 97% accuracy in eyes-open and 87.2% for eyes-closed (Table <xref ref-type="table" rid="T1">1</xref>).</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>Accuracy, sensitivity, and specificity for the two-class classification problem for the training dataset.</p></caption>
<table frame="hsides" rules="groups">
<thead><tr>
<th/>
<th valign="top" align="center"><bold>Accuracy (%)</bold></th>
<th valign="top" align="center"><bold>Sensitivity (%)</bold></th>
<th valign="top" align="center"><bold>Specificity (%)</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Eyes-Open</td>
<td valign="top" align="center">97</td>
<td valign="top" align="center">100</td>
<td valign="top" align="center">95</td>
</tr>
<tr>
<td valign="top" align="left">Eyes-Closed</td>
<td valign="top" align="center">87.23</td>
<td valign="top" align="center">88.24</td>
<td valign="top" align="center">86.05</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Figure <xref ref-type="fig" rid="F8">8</xref> illustrates the distribution of selected features for the classification problem across the different sub-groups of features. Our feature selection analysis revealed 108 features referred to FI per pair of sensors (Figure <xref ref-type="fig" rid="F8">8A</xref>), 2 based on the PD for &#x003B1;<sub>1</sub> and &#x003B1;<sub>2</sub> (Figure <xref ref-type="fig" rid="F8">8B</xref>), 1 from the transition matrix between state 4 and 7 (Figure <xref ref-type="fig" rid="F8">8C</xref>), and 2 from the entropy reduction rate on between {4,7} and {8,5} pairs of states (Figure <xref ref-type="fig" rid="F8">8D</xref>). This makes a total of 103 features from a total of 4.262 initial pool of features.</p>
<fig id="F8" position="float">
<label>Figure 8</label>
<caption><p>Demonstration of features for the classification problem. <bold>(A)</bold> One hundred and eight features referred to FI per pair of sensors, <bold>(B)</bold> for the PD for &#x003B1;<sub>1</sub> and &#x003B1;<sub>2</sub>, <bold>(C)</bold> from the transition matrix between state 4 and 7 and <bold>(D)</bold> 2 from the entropy reduction rate on between {4,7} and {8,5} pairs of states (<sup>&#x0002A;</sup> denotes statistically significant features detected via Wilcoxon Rank-Sum Test, <italic>p</italic> &#x0003C; 0.001). TR, transition rates; PD, probability distribution; ERT, entropy reduction rate.</p></caption>
<graphic xlink:href="fnhum-11-00423-g0008.tif"/>
</fig>
</sec>
<sec>
<title>External validation</title>
<p>Following an external validation of the whole approach in a cohort of 100 subjects, we performed reasonably well in continuous age prediction for eyes-open condition (<italic>R</italic><sup>2</sup> &#x0003D; 069, y &#x0003D; 0.78x &#x0002B; 5.696) and eyes-closed condition (<italic>R</italic><sup>2</sup> &#x0003D; 070, y &#x0003D; 0.81x &#x0002B; 3.217). The ELM classifier discriminated between young (18&#x02013;37) and midde-aged subjects (40&#x02013;60) with 98% accuracy (<italic>p</italic> &#x0003C; 10<sup>&#x02212;7</sup>) for eyes-open and with 97% accuracy (<italic>p</italic> &#x0003C; 10<sup>&#x02212;9</sup>) for eyes-closed (Table <xref ref-type="table" rid="T2">2</xref>). Figure <xref ref-type="fig" rid="F9">9</xref> illustrates the prediction for eyes-open and Figure <xref ref-type="fig" rid="F10">10</xref> the prediction of eyes-closed.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>Accuracy, sensitivity, and specificity for the two-class classification problem for the second testing dataset.</p></caption>
<table frame="hsides" rules="groups">
<thead><tr>
<th/>
<th valign="top" align="center"><bold>Accuracy (%)</bold></th>
<th valign="top" align="center"><bold>Sensitivity (%)</bold></th>
<th valign="top" align="center"><bold>Specificity (%)</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Eyes-Open</td>
<td valign="top" align="center">98</td>
<td valign="top" align="center">100</td>
<td valign="top" align="center">97</td>
</tr>
<tr>
<td valign="top" align="left">Eyes-Closed</td>
<td valign="top" align="center">85.48</td>
<td valign="top" align="center">86.78</td>
<td valign="top" align="center">85.83</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="F9" position="float">
<label>Figure 9</label>
<caption><p>A least square regression line between the real and predicted age for eyes open for the external validation dataset.</p></caption>
<graphic xlink:href="fnhum-11-00423-g0009.tif"/>
</fig>
<fig id="F10" position="float">
<label>Figure 10</label>
<caption><p>A least square regression line between the real and predicted age for eyes closed for the external validation dataset.</p></caption>
<graphic xlink:href="fnhum-11-00423-g0010.tif"/>
</fig>
</sec>
</sec>
<sec sec-type="discussion" id="s5">
<title>Discussion</title>
<p>In the present study, we examined a novel algorithmic approach of modeling dynamic functional connectivity graphs via NNMF-VQ symbolization approach. Additionally, we demonstrated how to integrate into a single dynamic functional connectivity graph (IDFCG) both the weight and also the DICM of each connection (Figures <xref ref-type="fig" rid="F1">1B,C</xref>). This novel approach first presented here demands novel statistical framework in order to extract the DICM among intra and inter-frequency coupling modes (Statistical Filtering). Afterward, we applied to DIFCG, a novel data-driven topological filtering algorithm with main aim to increase the information flow within a network under the constrained of the overall cost of the survived connections. This approach overcomes all the existing arbitrary approaches that bias any observations in brain networks. Here, we used a data-driven topological filtering scheme which is called Orthogonal Minimal Spanning Trees (OMST; Dimitriadis et al., <xref ref-type="bibr" rid="B27">2017</xref>). To demonstrate the effectiveness of the OMST to the prediction of age and the classification of age groups, we repeated the whole analysis using three famous arbitrary filtering schemes. The results clearly proved the significance of the topological filtering scheme to the overall analysis (See Section <xref ref-type="supplementary-material" rid="SM1">6</xref> in Supplementary Material). The most trivial arbitrary thresholding schemes are the absolute threshold, the density of the strongest connections and mean degree of a network. After both statistical and topological filtering applied to IDFCG, we applied a data-driven NNMF-VQ scheme to uncover nFCG&#x003BC;states at each condition with minimal reconstruction error. Afterward, we presented novel chronnectomics that can be extracted from both the evolution of nFCG&#x003BC;states and also the evolution of DICM.</p>
<p>The main highlights of our research can be summarized as follow:
<list list-type="order">
<list-item><p>We presented for the first time a CBMI based on EEG modality.</p></list-item>
<list-item><p>Our analysis focused on mining integrated dynamic functional connectivity networks under the notion of DICM and connectivity microstates analysis.</p></list-item>
<list-item><p>We demonstrated a whole repertoire of complementary features integrated in time, space and in both dimensions.</p></list-item>
<list-item><p>These features potentially succeeded to predict the individual maturation age and to discriminate with high precision young vs. middle-aged subjects.</p></list-item>
<list-item><p>Finally, we replicated our findings in a second external dataset.</p></list-item>
</list></p>
<p>The whole repertoire of nFCG&#x003BC;states in both tasks illustrated an activity in frontal, parieto-occipital, and also in temporal brain areas bilaterally. Frontal activity is directly linked to various cognitive tasks requiring attention or working memory (Burgess and Gruzelier, <xref ref-type="bibr" rid="B7">1997</xref>) while frontal and parietal activity has been associated with working memory functions and short-term memory (Calhoun and Adali, <xref ref-type="bibr" rid="B11">2012</xref>).</p>
<p>The chronnectomics that were presented here are the entropy reduction rate (ERT) based on the Markovian Chain of the symbolic time series that keeps the evolution of nFCG&#x003BC;states across experimental time. Additionally, transition rate (TR) of these nFCG&#x003BC;states is a novel estimator that quantifies the preferred transition between specific nFCG&#x003BC;states (Calhoun and Adali, <xref ref-type="bibr" rid="B11">2012</xref>). Similarly, we proposed flexibility index (FI), a novel measure that quantifies how many times a pair of EEG sensors alters favorable DICM. FI can be seen as how flexible is a brain to alter its DICM across time. Finally, the probability distribution of each DICM across spatio-temporal domain can be seen as a novel characteristic fingerprinting of the preferred intra or cross-frequency coupling across time and brain network.</p>
<p>The whole methodology was presented to solve for the first time in EEG analysis, a highly active research area to define an objective maturation index. Vergun et al. (<xref ref-type="bibr" rid="B63">2013</xref>) studied rs-fc-fMRI by combing brain networks and machine learning techniques. Recently, Qin et al. (<xref ref-type="bibr" rid="B51">2015</xref>) revealed complementary information of resting-state based on fMRI by adopting a dynamic functional connectivity graph. He showed that the variability of the strength between specific brain areas reduced with the increment of age (Qin et al., <xref ref-type="bibr" rid="B51">2015</xref>). Apart from fMRI, an EEG was missing in the literature based on resting-state.</p>
<p>Here, we defined a novel multi-parametric chronnectomic maturation index (CMI) based on EEG resting-state activity. We performed reasonably well in continuous age prediction for eyes-open condition (<italic>R</italic><sup>2</sup> &#x0003D; 0.60) and eyes-closed condition (<italic>R</italic><sup>2</sup> &#x0003D; 0.48). In an external second set of 25 subjects, we performed higher prediction for eyes-open (<italic>R</italic><sup>2</sup> &#x0003D; 0.69) and eyes-closed (<italic>R</italic><sup>2</sup> &#x0003D; 0.70). The difference between the training dataset and the external in terms of prediction accuracy could be interpreted as a more objective CMI compared to the chronological age and more directly connected to the human maturation age. Further studies should explore the link of the whole approach to a unique phenotype for each subject.</p>
<p>Resting-state can be seen as a baseline of the human brain activity. The activity of every subsystem like visual, auditory, attention, etc., during targeted tasks can be predicted well by their activity at resting-state. A recent study based on rs-fMRI succeeded to link the activity at resting-state with the activity at specific locations in tasks that activate specific well-known subsystems (Cole et al., <xref ref-type="bibr" rid="B14">2016</xref>). The novel proposed FI based on DICM can be seen as the reflex of every part of the brain to adjust to external stimuli. The more flexible is the brain, the more ready to react and this can be seen at resting-state. It would be interesting in the future to link FI at resting-state with task-related FI between specific subsystems (Buzsaki, <xref ref-type="bibr" rid="B8">2010</xref>; Buzsaki et al., <xref ref-type="bibr" rid="B10">2013</xref>). Flexibility index was the most significant feature in both building a chronnectomic brain aged index (CBAI) and also to the high discrimination of the two age groups in both datasets.</p>
<p>We are working in the era of a great evolution in the neuroscience community when multimodal neuroimaging techniques applied to both daily clinical practice and also to neuroimaging centers are combined with complex network analysis. It is more than evident that neuroscience is still looking to find a way to reveal a relationship between behavioral responses and brain activity. Especially, for dynamic functional connectivity there is not an easy way to build up such a connection. Recently however, neuroscientists combined a pharmacological intervention with novel techniques from dynamic network neuroscience applied to fMRI to identify alterations in the dynamic reconfiguration of brain networks related to schizophrenia genetic risk and NMDA receptor hypofunction (Braun et al., <xref ref-type="bibr" rid="B6">2016</xref>). They quantified &#x0201C;network flexibility,&#x0201D; as a measure of the dynamic reconfiguration of the community structure of time-variant brain networks during working memory performance. This flexibility quantifies how many times a node/ROI changes cluster assignment over experimental time. The whole approach based on the weighted correlated dynamic brain networks. Here, we defined a novel flexibility index based on the rate of dynamic reconfiguration of the dominant coupling modes across the experimental time.</p>
<p>The disadvantage of fMRI is that it cannot give information regarding the amplitude/phase and/or frequency profile of dynamic connectivity (Engel et al., <xref ref-type="bibr" rid="B34">2013</xref>; Dimitriadis et al., <xref ref-type="bibr" rid="B26">2016a</xref>,<xref ref-type="bibr" rid="B29">c</xref>,<xref ref-type="bibr" rid="B30">d</xref>). EEG and also MEG can give us information regarding the type of interactions taking into consideration simultaneously the amplitude-phase and the frequency profile of each interactions (phase-to-phase, amplitude-to-amplitude, cross-frequency coupling).</p>
<p>The present study is the very first in the literature that takes into consideration all of these parameters linked to the nature of the imaging modality (EEG). The presented methodology shows how to construct a single dynamic functional connectivity graph per subject that encapsulates both the strength but also the nature of the dominant intrinsic coupling mode and is of paramount importance for the neuroscience community. Here, in analogy of the fMRI-based flexibility index<sup>6</sup>, we designed a flexibility index that quantifies how many times across temporal segments at resting-state, two brain areas alter their preferred type of interaction. The higher the frequency of their alterations, the higher the flexibility index and the more flexible is the brain in global. We observed that the most informative feature for the prediction of age and discrimination of the two age groups was the Flexibility Index for a subset of pairs of EEG sensors.</p>
</sec>
<sec sec-type="conclusions" id="s6">
<title>Conclusions</title>
<p>Our own work supports that resting state EEG data contains adequate information to predict individual actual age and also to predict age-group subjects. As the amount of free available EEG datasets will be increased, data-driven techniques applied to dynamic functional connectivity graph should be adopted. With the incorporation on the whole analysis of appropriate features, feature selection, and machine learning algorithms will extract meaningful information that will improve human clinical diagnoses and the overall efficacy.</p>
</sec>
<sec id="s7">
<title>Author contributions</title>
<p>Conception of the research, methods and design, critical revision of the manuscript, and drafting the manuscript: SD. Data analysis: SD and CS. Every author read and approved the final version of the manuscript.</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>
<ack><p>SD was supported by MRC grant MR/K004360/1 (Behavioral and Neurophysiological Effects of Schizophrenia Risk Genes: A Multi-locus, Pathway Based Approach) and Marie Curie COFUND EU-UK Research Fellowship. CS was supported by a funding from Bodosakis Foundation. We acknowledge also RCUK scheme.</p>
</ack>
<sec sec-type="supplementary-material" id="s9">
<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.00423/full#supplementary-material">http://journal.frontiersin.org/article/10.3389/fnhum.2017.00423/full#supplementary-material</ext-link></p>
<supplementary-material xlink:href="DataSheet1.DOCX" id="SM1" mimetype="application/vnd.openxmlformats-officedocument.wordprocessingml.document" xmlns:xlink="http://www.w3.org/1999/xlink"/>
<p>The dataset is a free available EEH study that can be downloaded from here: <ext-link ext-link-type="uri" xlink:href="https://physionet.org/pn4/eegmmidb/">https://physionet.org/pn4/eegmmidb/</ext-link>.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Antonakakis</surname> <given-names>A.</given-names></name> <name><surname>Giannakakis</surname> <given-names>G.</given-names></name> <name><surname>Tsiknakis</surname> <given-names>M.</given-names></name> <name><surname>Micheloyannis</surname> <given-names>S.</given-names></name> <name><surname>Zervakis</surname> <given-names>M.</given-names></name></person-group> (<year>2013</year>). <article-title>Synchronization coupling investigation using ICA cluster analysis in resting MEG signals in reading difficulties</article-title>, in <source>Proceedings of the IEEE 13th International Conference on Bioinformatics and Bioengineering</source> (<publisher-loc>Chania</publisher-loc>).</citation>
</ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bassett</surname> <given-names>D. S.</given-names></name> <name><surname>Wymbs</surname> <given-names>N. F.</given-names></name> <name><surname>Porter</surname> <given-names>M. A.</given-names></name> <name><surname>Mucha</surname> <given-names>P. J.</given-names></name> <name><surname>Carlson</surname> <given-names>J. M.</given-names></name> <name><surname>Grafton</surname> <given-names>S. T.</given-names></name></person-group> (<year>2011</year>). <article-title>Dynamic reconfiguration of human brain networks during learning</article-title>. <source>Proc. Natl. Acad. Sci. U.S.A.</source> <volume>108</volume>, <fpage>7641</fpage>&#x02013;<lpage>7646</lpage>. <pub-id pub-id-type="doi">10.1073/pnas.1018985108</pub-id><pub-id pub-id-type="pmid">21502525</pub-id></citation>
</ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ben-Hur</surname> <given-names>A.</given-names></name> <name><surname>Weston</surname> <given-names>J.</given-names></name></person-group> (<year>2010</year>). <article-title>A user&#x00027;s guide to support vector machines</article-title>. <source>Methods Mol. Biol.</source> <volume>609</volume>, <fpage>223</fpage>&#x02013;<lpage>239</lpage>. <pub-id pub-id-type="doi">10.1007/978-1-60327-241-4_13</pub-id><pub-id pub-id-type="pmid">20221922</pub-id></citation>
</ref>
<ref id="B4">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Betzel</surname> <given-names>R. F.</given-names></name> <name><surname>Byrge</surname> <given-names>L.</given-names></name> <name><surname>He</surname> <given-names>Y.</given-names></name> <name><surname>Goni</surname> <given-names>J.</given-names></name> <name><surname>Zuo</surname> <given-names>X.-N.</given-names></name> <name><surname>Sporns</surname> <given-names>O.</given-names></name></person-group> (<year>2014</year>). <article-title>Changes instructural and functional connectivity among resting- state networks across the human lifespan</article-title>. <source>Neuroimage</source> <volume>102</volume>, <fpage>345</fpage>&#x02013;<lpage>357</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2014.07.067</pub-id><pub-id pub-id-type="pmid">25109530</pub-id></citation>
</ref>
<ref id="B5">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Biswal</surname> <given-names>B.</given-names></name> <name><surname>Yetkins</surname> <given-names>F. Z.</given-names></name> <name><surname>Haughton</surname> <given-names>V. M.</given-names></name> <name><surname>Hyde</surname> <given-names>J. S.</given-names></name></person-group> (<year>1995</year>). <article-title>Functional connectivity in the motor cortex of resting human brain using echo-planar MRI</article-title>. <source>Magn. Reson. Med.</source> <volume>34</volume>, <fpage>537</fpage>&#x02013;<lpage>541</lpage>. <pub-id pub-id-type="doi">10.1002/mrm.1910340409</pub-id><pub-id pub-id-type="pmid">8524021</pub-id></citation>
</ref>
<ref id="B6">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Braun</surname> <given-names>U.</given-names></name> <name><surname>Sch&#x000E4;fer</surname> <given-names>A.</given-names></name> <name><surname>Bassett</surname> <given-names>D. S.</given-names></name> <name><surname>Rausch</surname> <given-names>F.</given-names></name> <name><surname>Schweiger</surname> <given-names>J. I.</given-names></name> <name><surname>Bilek</surname> <given-names>E.</given-names></name> <etal/></person-group>. (<year>2016</year>). <article-title>Dynamic brain network reconfiguration as a potential schizophrenia genetic risk mechanism modulated by NMDA receptor function</article-title>. <source>Proc. Natl. Acad. Sci. U.S.A.</source> <volume>113</volume>, <fpage>12568</fpage>&#x02013;<lpage>12573</lpage>. <pub-id pub-id-type="doi">10.1073/pnas.1608819113</pub-id><pub-id pub-id-type="pmid">27791105</pub-id></citation>
</ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Burgess</surname> <given-names>A. P.</given-names></name> <name><surname>Gruzelier</surname> <given-names>J. H.</given-names></name></person-group> (<year>1997</year>). <article-title>Short duration synchronization of human theta rhythm during recognition memory</article-title>. <source>Neuroreport</source> <volume>8</volume>, <fpage>1039</fpage>&#x02013;<lpage>1042</lpage>. <pub-id pub-id-type="doi">10.1097/00001756-199703030-00044</pub-id><pub-id pub-id-type="pmid">9141088</pub-id></citation>
</ref>
<ref id="B8">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Buzsaki</surname> <given-names>G.</given-names></name></person-group> (<year>2010</year>). <article-title>Neural syntax: cell assemblies, synapsembles, and readers</article-title>. <source>Neuron</source> <volume>68</volume>, <fpage>362</fpage>&#x02013;<lpage>385</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuron.2010.09.023</pub-id><pub-id pub-id-type="pmid">21040841</pub-id></citation>
</ref>
<ref id="B9">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Buzs&#x000E1;ki</surname> <given-names>G.</given-names></name> <name><surname>Draguhn</surname> <given-names>A.</given-names></name></person-group> (<year>2004</year>). <article-title>Neuronal oscillations in cortical networks</article-title>. <source>Science</source> <volume>304</volume>, <fpage>1926</fpage>&#x02013;<lpage>1929</lpage>. <pub-id pub-id-type="doi">10.1126/science.1099745</pub-id><pub-id pub-id-type="pmid">15218136</pub-id></citation>
</ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Buzsaki</surname> <given-names>G.</given-names></name> <name><surname>Logothetis</surname> <given-names>N.</given-names></name> <name><surname>Singer</surname> <given-names>W.</given-names></name></person-group> (<year>2013</year>). <article-title>Scaling brain size, keeping timing: evolutionary preservation of brain rhythms</article-title>. <source>Neuron</source> <volume>80</volume>, <fpage>751</fpage>&#x02013;<lpage>764</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuron.2013.10.002</pub-id><pub-id pub-id-type="pmid">24183025</pub-id></citation>
</ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Calhoun</surname> <given-names>V. D.</given-names></name> <name><surname>Adali</surname> <given-names>T.</given-names></name></person-group> (<year>2012</year>). <article-title>Multi-subject independent component analysis of fMRI: a decade of intrinsic networks, default mode, and neurodiagnostic discovery</article-title>. <source>IEEE Rev. Biomed. Eng.</source> <volume>5</volume>, <fpage>60</fpage>&#x02013;<lpage>73</lpage>. <pub-id pub-id-type="doi">10.1109/RBME.2012.2211076</pub-id></citation>
</ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Calhoun</surname> <given-names>V. D.</given-names></name> <name><surname>Miller</surname> <given-names>R.</given-names></name> <name><surname>Pearlson</surname> <given-names>G.</given-names></name> <name><surname>Adali</surname> <given-names>T.</given-names></name></person-group> (<year>2014</year>). <article-title>The Chronnectome: time-varying connectivity networks as the next frontier in fMRI data discovery</article-title>. <source>Neuron</source> <volume>84</volume>, <fpage>262</fpage>&#x02013;<lpage>274</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuron.2014.10.015</pub-id><pub-id pub-id-type="pmid">25374354</pub-id></citation>
</ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cohen</surname> <given-names>J. R.</given-names></name> <name><surname>Asarnow</surname> <given-names>R. F.</given-names></name> <name><surname>Sabb</surname> <given-names>F. W.</given-names></name> <name><surname>Bilder</surname> <given-names>R. M.</given-names></name> <name><surname>Bookheimer</surname> <given-names>S. Y.</given-names></name> <name><surname>Knowlton</surname> <given-names>B. J.</given-names></name> <etal/></person-group>. (<year>2011</year>). <article-title>Decoding continuous variables from neuroimaging data: basic and clinical applications</article-title>, <source>Front. Hum. Neurosci.</source> <volume>5</volume>:<fpage>75</fpage>. <pub-id pub-id-type="doi">10.3389/fnins.2011.00075</pub-id><pub-id pub-id-type="pmid">21720520</pub-id></citation>
</ref>
<ref id="B14">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cole</surname> <given-names>M. W.</given-names></name> <name><surname>Ito</surname> <given-names>T.</given-names></name> <name><surname>Bassett</surname> <given-names>D. S.</given-names></name> <name><surname>Schultz</surname> <given-names>D. H.</given-names></name></person-group> (<year>2016</year>). <article-title>Activity flow over resting-state networks shapes cognitive task activations</article-title>. <source>Nat. Neurosci.</source> <volume>19</volume>, <fpage>1718</fpage>&#x02013;<lpage>1726</lpage>. <pub-id pub-id-type="doi">10.1038/nn.4406</pub-id><pub-id pub-id-type="pmid">27723746</pub-id></citation>
</ref>
<ref id="B15">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Craddock</surname> <given-names>R. C.</given-names></name> <name><surname>Holtzheimer</surname> <given-names>P. E.</given-names></name> <name><surname>Hu</surname> <given-names>X. P.</given-names></name> <name><surname>Mayberg</surname> <given-names>H. S.</given-names></name></person-group> (<year>2009</year>). <article-title>Disease state prediction from resting state functional connectivity</article-title>. <source>Magn. Reson. Med.</source> <volume>62</volume>, <fpage>1619</fpage>&#x02013;<lpage>1628</lpage>. <pub-id pub-id-type="doi">10.1002/mrm.22159</pub-id><pub-id pub-id-type="pmid">19859933</pub-id></citation>
</ref>
<ref id="B16">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Damoiseaux</surname> <given-names>J. S.</given-names></name> <name><surname>Rombouts</surname> <given-names>S. A. R. B.</given-names></name> <name><surname>Barkhof</surname> <given-names>F.</given-names></name> <name><surname>Scheltens</surname> <given-names>P.</given-names></name> <name><surname>Stam</surname> <given-names>C. J.</given-names></name> <name><surname>Smith</surname> <given-names>S. M.</given-names></name> <etal/></person-group>. (<year>2006</year>). <article-title>Consistent resting-state networks across healthy subjects</article-title>. <source>Proc. Natl. Acad. Sci. U.S.A.</source> <volume>13</volume>, <fpage>13848</fpage>&#x02013;<lpage>13853</lpage>. <pub-id pub-id-type="doi">10.1073/pnas.0601417103</pub-id></citation>
</ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Delorme</surname> <given-names>A.</given-names></name> <name><surname>Makeig</surname> <given-names>S.</given-names></name></person-group> (<year>2004</year>). <article-title>EEGLAB: an open source toolbox for analysis of single-trial EEG dynamics including independent component analysis</article-title>. <source>J. Neurosci. Methods</source> <volume>134</volume>, <fpage>9</fpage>&#x02013;<lpage>21</lpage>. <pub-id pub-id-type="doi">10.1016/j.jneumeth.2003.10.009</pub-id><pub-id pub-id-type="pmid">15102499</pub-id></citation>
</ref>
<ref id="B18">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dimitriadis</surname> <given-names>S. I.</given-names></name> <name><surname>Laskaris</surname> <given-names>N. A.</given-names></name> <name><surname>Micheloyannis</surname> <given-names>S.</given-names></name></person-group> (<year>2015a</year>). <article-title>Transition dynamics of EEG network microstates unmask developmental and task differences during mental arithmetic and resting wakefulness</article-title>. <source>Cogn. Neurodyn.</source> <volume>9</volume>, <fpage>371</fpage>&#x02013;<lpage>387</lpage>. <pub-id pub-id-type="doi">10.1007/s11571-015-9330-8</pub-id></citation>
</ref>
<ref id="B19">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dimitriadis</surname> <given-names>S. I.</given-names></name> <name><surname>Laskaris</surname> <given-names>N. A.</given-names></name> <name><surname>Tzelepi</surname> <given-names>A.</given-names></name></person-group> (<year>2013a</year>). <article-title>On the quantization of time-varying phase synchrony patterns into distinct Functional Connectivity Microstates (FC&#x003BC;states) in a multi-trial visual ERP paradigm</article-title>. <source>Brain Topogr.</source> <volume>26</volume>, <fpage>397</fpage>&#x02013;<lpage>409</lpage>. <pub-id pub-id-type="doi">10.1007/s10548-013-0276-z</pub-id><pub-id pub-id-type="pmid">23443252</pub-id></citation>
</ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dimitriadis</surname> <given-names>S. I.</given-names></name> <name><surname>Laskaris</surname> <given-names>N. A.</given-names></name> <name><surname>Bitzidou</surname> <given-names>M. P.</given-names></name> <name><surname>Tarnanas</surname> <given-names>I.</given-names></name> <name><surname>Tsolaki</surname> <given-names>M.</given-names></name></person-group> (<year>2015b</year>). <article-title>A novel biomarker of amnestic MCI based on dynamic Cross-Frequency Coupling patterns during cognitive brain responses</article-title>. <source>Front. Aging Neurosci.</source> <volume>9</volume>:<fpage>350</fpage>. <pub-id pub-id-type="doi">10.3389/fnins.2015.00350</pub-id><pub-id pub-id-type="pmid">26539070</pub-id></citation>
</ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dimitriadis</surname> <given-names>S. I.</given-names></name> <name><surname>Sun</surname> <given-names>Y.</given-names></name> <name><surname>Kwok</surname> <given-names>K.</given-names></name> <name><surname>Laskaris</surname> <given-names>N. A.</given-names></name> <name><surname>Thakor</surname> <given-names>N.</given-names></name> <name><surname>Bezerianos</surname> <given-names>A.</given-names></name></person-group> (<year>2015c</year>). <article-title>Cognitive workload assessment based on the tensorial treatment of EEG estimates of cross-frequency phase interactions</article-title>. <source>Ann Biomed Eng.</source> <volume>43</volume>, <fpage>977</fpage>&#x02013;<lpage>989</lpage>. <pub-id pub-id-type="doi">10.1007/s10439-014-1143-0</pub-id><pub-id pub-id-type="pmid">25287648</pub-id></citation>
</ref>
<ref id="B22">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dimitriadis</surname> <given-names>S. I.</given-names></name> <name><surname>Laskaris</surname> <given-names>N. A.</given-names></name> <name><surname>Simos</surname> <given-names>P. G.</given-names></name> <name><surname>Micheloyannis</surname> <given-names>S.</given-names></name> <name><surname>Fletcher</surname> <given-names>J. M.</given-names></name> <name><surname>Rezaie</surname> <given-names>R.</given-names></name> <etal/></person-group>. (<year>2013b</year>). <article-title>Altered temporal correlations in resting-state connectivity fluctuations in children with reading difficulties detected via MEG</article-title>. <source>Neuroimage</source> <volume>83</volume>, <fpage>307</fpage>&#x02013;<lpage>317</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2013.06.036</pub-id><pub-id pub-id-type="pmid">23777755</pub-id></citation>
</ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dimitriadis</surname> <given-names>S. I.</given-names></name> <name><surname>Laskaris</surname> <given-names>N. A.</given-names></name> <name><surname>Tsirka</surname> <given-names>V.</given-names></name> <name><surname>Erimaki</surname> <given-names>S.</given-names></name> <name><surname>Vourkas</surname> <given-names>M.</given-names></name> <name><surname>Sifis</surname> <given-names>M.</given-names></name> <etal/></person-group>. (<year>2011</year>). <article-title>A novel symbolization scheme for multichannel recordings with emphasis on phase information and its application to differentiate EEG activity from different mental tasks</article-title>. <source>Cogn. Neurodyn.</source> <volume>6</volume>, <fpage>107</fpage>&#x02013;<lpage>113</lpage>. <pub-id pub-id-type="doi">10.1007/s11571-011-9186-5</pub-id><pub-id pub-id-type="pmid">23372623</pub-id></citation>
</ref>
<ref id="B24">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dimitriadis</surname> <given-names>S. I.</given-names></name> <name><surname>Laskaris</surname> <given-names>N. A.</given-names></name> <name><surname>Tsirka</surname> <given-names>V.</given-names></name> <name><surname>Vourkas</surname> <given-names>M.</given-names></name> <name><surname>Micheloyannis</surname> <given-names>S.</given-names></name></person-group> (<year>2012</year>). <article-title>An EEG study of brain connectivity dynamics at the resting state</article-title>. <source>Nonlinear Dyn. Psychol. Life Sci.</source> <volume>16</volume>, <fpage>5</fpage>&#x02013;<lpage>22</lpage>. Available online at: <ext-link ext-link-type="uri" xlink:href="https://pdfs.semanticscholar.org/7440/84337d6f16ba87dd1d26ac98c95a7d5c5994.pdf">https://pdfs.semanticscholar.org/7440/84337d6f16ba87dd1d26ac98c95a7d5c5994.pdf</ext-link> <pub-id pub-id-type="pmid">22196109</pub-id></citation>
</ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dimitriadis</surname> <given-names>S. I.</given-names></name> <name><surname>Laskaris</surname> <given-names>N. A.</given-names></name> <name><surname>Tsirka</surname> <given-names>V.</given-names></name> <name><surname>Vourkas</surname> <given-names>M.</given-names></name> <name><surname>Micheloyannis</surname> <given-names>S.</given-names></name> <name><surname>Fotopoulos</surname> <given-names>S.</given-names></name></person-group> (<year>2010</year>). <article-title>Tracking brain dynamics via time-dependent network analysis</article-title>. <source>J. Neurosci. Methods</source> <volume>193</volume>, <fpage>145</fpage>&#x02013;<lpage>155</lpage>. <pub-id pub-id-type="doi">10.1016/j.jneumeth.2010.08.027</pub-id><pub-id pub-id-type="pmid">20817039</pub-id></citation>
</ref>
<ref id="B26">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dimitriadis</surname> <given-names>S. I.</given-names></name> <name><surname>Nikolaos</surname> <given-names>A. L.</given-names></name> <name><surname>Panagiotis</surname> <given-names>G. S.</given-names></name> <name><surname>Jack</surname> <given-names>M. F.</given-names></name> <name><surname>Papanicolaou</surname> <given-names>A. C.</given-names></name></person-group> (<year>2016a</year>). <article-title>Greater repertoire and temporal variability of Cross-Frequency Coupling (CFC) modes in resting-state neuromagnetic recordings among children with reading difficulties</article-title>. <source>Front. Hum. Neurosci.</source> <volume>10</volume>:<fpage>63</fpage>. <pub-id pub-id-type="doi">10.3389/fnhum.2016.00163</pub-id><pub-id pub-id-type="pmid">27199698</pub-id></citation>
</ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dimitriadis</surname> <given-names>S. I.</given-names></name> <name><surname>Salis</surname> <given-names>C.</given-names></name> <name><surname>Tarnanas</surname> <given-names>I.</given-names></name> <name><surname>Linden</surname> <given-names>D. E.</given-names></name></person-group> (<year>2017</year>). <article-title>Topological filtering of dynamic functional brain networks unfolds informative chronnectomics: a novel data-driven thresholding scheme based on Orthogonal Minimal Spanning Trees (OMSTs)</article-title>. <source>Front. Neuroinform.</source> <volume>11</volume>:<fpage>28</fpage>. <pub-id pub-id-type="doi">10.3389/fninf.2017.00028</pub-id><pub-id pub-id-type="pmid">28491032</pub-id></citation>
</ref>
<ref id="B28">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Dimitriadis</surname> <given-names>S. I.</given-names></name> <name><surname>Simos</surname> <given-names>P.</given-names></name> <name><surname>Laskaris</surname> <given-names>N. A.</given-names></name> <name><surname>Fotopoulos</surname> <given-names>S.</given-names></name> <name><surname>Fletcher</surname> <given-names>J. M.</given-names></name> <name><surname>Linden</surname> <given-names>D.</given-names></name> <etal/></person-group>. (<year>2016b</year>). <article-title>Children with reading difficulties from non-impaired readers via symbolic dynamics and complexity analysis of MEG resting- state data</article-title>, in <source>IEEE International Symposium on Signal Processing and Information Technology</source> (<publisher-loc>Limassol</publisher-loc>).</citation>
</ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dimitriadis</surname> <given-names>S. I.</given-names></name> <name><surname>Tarnanas</surname> <given-names>I.</given-names></name> <name><surname>Wiederholdg</surname> <given-names>M.</given-names></name> <name><surname>Wiederholdh</surname> <given-names>B.</given-names></name> <name><surname>Tsolaki</surname> <given-names>M.</given-names></name> <name><surname>Fleische</surname> <given-names>E.</given-names></name></person-group> (<year>2016c</year>). <article-title>Mnemonic strategy training of the elderly at risk for dementia enhances integration of information processing via cross-frequency coupling</article-title>. <source>Alzheimer&#x00027;s Dement.</source> <volume>2</volume>, <fpage>241</fpage>&#x02013;<lpage>249</lpage>. <pub-id pub-id-type="doi">10.1016/j.trci.2016.08.004</pub-id></citation>
</ref>
<ref id="B30">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dimitriadis</surname> <given-names>S. I.</given-names></name> <name><surname>Sun</surname> <given-names>Y.</given-names></name> <name><surname>Thakor</surname> <given-names>N. V.</given-names></name> <name><surname>Bezerianos</surname> <given-names>A.</given-names></name></person-group> (<year>2016d</year>). <article-title>Causal interactions between frontal<sup>&#x003B8;</sup>&#x02013;parieto-occipital<sup>&#x003B1;2</sup> predict performance on a mental arithmetic task</article-title>. <source>Front Hum Neurosci.</source> <volume>10</volume>:<fpage>454</fpage>. <pub-id pub-id-type="doi">10.3389/fnhum.2016.00454</pub-id><pub-id pub-id-type="pmid">27683547</pub-id></citation>
</ref>
<ref id="B31">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dosenbach</surname> <given-names>N. U.</given-names></name> <name><surname>Nardos</surname> <given-names>B.</given-names></name> <name><surname>Cohen</surname> <given-names>A. L.</given-names></name> <name><surname>Fair</surname> <given-names>D. A.</given-names></name> <name><surname>Power</surname> <given-names>J. D.</given-names></name> <name><surname>Church</surname> <given-names>J. A.</given-names></name> <etal/></person-group>. (<year>2010</year>). <article-title>Prediction of individual brain maturity using fMRI</article-title>. <source>Science</source> <volume>329</volume>, <fpage>1358</fpage>&#x02013;<lpage>1361</lpage>. <pub-id pub-id-type="doi">10.1126/science.1194144</pub-id><pub-id pub-id-type="pmid">20829489</pub-id></citation>
</ref>
<ref id="B32">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Drucker</surname> <given-names>H.</given-names></name> <name><surname>Burges</surname> <given-names>C. J. C.</given-names></name> <name><surname>Kaufman</surname> <given-names>L.</given-names></name> <name><surname>Smola</surname> <given-names>A.</given-names></name> <name><surname>Vapnik</surname> <given-names>V. N.</given-names></name></person-group> (<year>1997</year>). <article-title>Support vector regression machines</article-title> in <source>Advances in Neural Information Processing Systems, Vol. 9</source>, eds <person-group person-group-type="editor"><name><surname>Mozer</surname> <given-names>M. C.</given-names></name> <name><surname>Jordan</surname> <given-names>J.</given-names></name> <name><surname>Petsche</surname> <given-names>T.</given-names></name></person-group> (<publisher-loc>Cambridge, MA</publisher-loc>: <publisher-name>MIT Press</publisher-name>), <fpage>155</fpage>&#x02013;<lpage>161</lpage>.</citation>
</ref>
<ref id="B33">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ekroot</surname> <given-names>L.</given-names></name> <name><surname>Cover</surname> <given-names>T.</given-names></name></person-group> (<year>1993</year>). <article-title>The Entropy of Markov Trajectories</article-title>, <source>IEEE Transactions on Information Theory</source>.</citation>
</ref>
<ref id="B34">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Engel</surname> <given-names>A. K.</given-names></name> <name><surname>Gerloff</surname> <given-names>C.</given-names></name> <name><surname>Hilgetag</surname> <given-names>C. C.</given-names></name> <name><surname>Nolte</surname> <given-names>G.</given-names></name></person-group> (<year>2013</year>). <article-title>Intrinsic coupling modes: multiscale interactions in ongoing brain activity</article-title>. <source>Neuron</source> <volume>80</volume>, <fpage>867</fpage>&#x02013;<lpage>886</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuron.2013.09.038</pub-id><pub-id pub-id-type="pmid">24267648</pub-id></citation>
</ref>
<ref id="B35">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Haynes</surname> <given-names>J.</given-names></name> <name><surname>Rees</surname> <given-names>G.</given-names></name></person-group> (<year>2005</year>). <article-title>Predicting the stream of consciousness from activity in human visual cortex</article-title>. <source>Curr. Biol.</source> <volume>15</volume>, <fpage>1301</fpage>&#x02013;<lpage>1307</lpage>. <pub-id pub-id-type="doi">10.1016/j.cub.2005.06.026</pub-id><pub-id pub-id-type="pmid">16051174</pub-id></citation>
</ref>
<ref id="B36">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>He</surname> <given-names>X.</given-names></name> <name><surname>Cai</surname> <given-names>D.</given-names></name> <name><surname>Niyog</surname> <given-names>P.</given-names></name></person-group> (<year>2005</year>). <article-title>Laplacian Score for Feature Selection</article-title>, in <source>Proceedings of the 18th International Conference on Neural Information Processing Systems</source> (<publisher-loc>Vancouver, BC</publisher-loc>), <fpage>8</fpage>.</citation>
</ref>
<ref id="B37">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Huang</surname> <given-names>G. B.</given-names></name> <name><surname>Zhu</surname> <given-names>Q. Y.</given-names></name> <name><surname>Siew</surname> <given-names>C. K.</given-names></name></person-group> (<year>2006</year>). <article-title>Extreme learning machine: theory and applications</article-title>. <source>Neurocomputing</source> <volume>70</volume>, <fpage>489</fpage>&#x02013;<lpage>501</lpage> <pub-id pub-id-type="doi">10.1016/j.neucom.2005.12.126</pub-id></citation>
</ref>
<ref id="B38">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Huang</surname> <given-names>G. B.</given-names></name></person-group> (<year>2015</year>). <article-title>What are extreme learning machines? filling the gap between Frank Rosenblatt&#x00027;s Dream and John von Neumann&#x00027;s Puzzle</article-title>. <source>Cogn. Comput.</source> <volume>7</volume>, <fpage>263</fpage>&#x02013;<lpage>278</lpage> <pub-id pub-id-type="doi">10.1007/s12559-015-9333-0</pub-id></citation>
</ref>
<ref id="B39">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hutchison</surname> <given-names>R. M.</given-names></name> <name><surname>Morton</surname> <given-names>J. B.</given-names></name></person-group> (<year>2015</year>). <article-title>Tracking the brain&#x00027;s functional coupling dynamics over development</article-title>. <source>J. Neurosci.</source> <volume>35</volume>, <fpage>6849</fpage>&#x02013;<lpage>6859</lpage>. <pub-id pub-id-type="doi">10.1523/JNEUROSCI.4638-14.2015</pub-id><pub-id pub-id-type="pmid">25926460</pub-id></citation>
</ref>
<ref id="B40">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Janson</surname> <given-names>S.</given-names></name> <name><surname>Lonardi</surname> <given-names>S.</given-names></name> <name><surname>Szpankowski</surname> <given-names>W.</given-names></name></person-group> (<year>2004</year>). <article-title>On average sequence complexity</article-title>. <source>Theor. Comput. Sci.</source> <volume>326</volume>, <fpage>213</fpage>&#x02013;<lpage>227</lpage>. <pub-id pub-id-type="doi">10.1016/j.tcs.2004.06.023</pub-id></citation>
</ref>
<ref id="B41">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jirsa</surname> <given-names>V.</given-names></name> <name><surname>M&#x000FC;ller</surname> <given-names>V.</given-names></name></person-group> (<year>2013</year>). <article-title>Cross-frequency coupling in real and virtual brain networks</article-title>. <source>Front. Comput. Neurosci.</source> <volume>7</volume>:<fpage>78</fpage>. <pub-id pub-id-type="doi">10.3389/fncom.2013.00078</pub-id><pub-id pub-id-type="pmid">23840188</pub-id></citation>
</ref>
<ref id="B42">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kurth</surname> <given-names>S.</given-names></name> <name><surname>Olini</surname> <given-names>N.</given-names></name> <name><surname>Huber</surname> <given-names>R.</given-names></name> <name><surname>LeBourgeois</surname> <given-names>M.</given-names></name></person-group> (<year>2015</year>). <article-title>Sleep and early cortical development</article-title>. <source>Curr. Sleep Med. Rep.</source> <volume>1</volume>, <fpage>64</fpage>&#x02013;<lpage>73</lpage>. <pub-id pub-id-type="doi">10.1007/s40675-014-0002-8</pub-id><pub-id pub-id-type="pmid">26807347</pub-id></citation>
</ref>
<ref id="B43">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Laskaris</surname> <given-names>N. A.</given-names></name> <name><surname>Ioannides</surname> <given-names>A. A.</given-names></name></person-group> (<year>2001</year>). <article-title>Exploratory data analysis of evoked response single trials based on minimal spanning tree</article-title>. <source>Clin. Neurophysiol.</source> <volume>112</volume>, <fpage>698</fpage>&#x02013;<lpage>712</lpage>. <pub-id pub-id-type="doi">10.1016/S1388-2457(00)00560-5</pub-id><pub-id pub-id-type="pmid">11275544</pub-id></citation>
</ref>
<ref id="B44">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Leve</surname> <given-names>F.</given-names></name> <name><surname>Seebold</surname> <given-names>P.</given-names></name></person-group> (<year>2001</year>). <article-title>Proof of a conjecture on word complexity</article-title>. <source>Bull. Belg. Math. Soc.</source> <volume>8</volume>, <fpage>277</fpage>&#x02013;<lpage>291</lpage>. Available online at: <ext-link ext-link-type="uri" xlink:href="https://projecteuclid.org/euclid.bbms/1102714173">https://projecteuclid.org/euclid.bbms/1102714173</ext-link></citation>
</ref>
<ref id="B45">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Marimpis</surname> <given-names>A. D.</given-names></name> <name><surname>Dimitriadis</surname> <given-names>S. I.</given-names></name> <name><surname>Adamos</surname> <given-names>D. A.</given-names></name> <name><surname>Laskaris</surname> <given-names>N. A.</given-names></name></person-group> (<year>2016</year>). <article-title>NNMF connectivity microstates: a new approach to represent the dynamic brain coordination</article-title>. <source>Front. Neuroinform.</source> <volume>10</volume>:<fpage>22</fpage>. <pub-id pub-id-type="doi">10.3389/conf.fninf.2016.20.00022</pub-id></citation>
</ref>
<ref id="B46">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Martinetz</surname> <given-names>T. M.</given-names></name> <name><surname>Berkovich</surname> <given-names>S. G.</given-names></name> <name><surname>Schulten</surname> <given-names>K. J.</given-names></name></person-group> (<year>1993</year>). <article-title>&#x02018;Neural-gas&#x02019; network for vector quantization and its application to time-series prediction</article-title>. <source>IEEE Trans. Neural Netw.</source> <volume>4</volume>, <fpage>558</fpage>&#x02013;<lpage>569</lpage>. <pub-id pub-id-type="doi">10.1109/72.238311</pub-id><pub-id pub-id-type="pmid">18267757</pub-id></citation>
</ref>
<ref id="B47">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Massimiliano</surname> <given-names>P.</given-names></name> <name><surname>Pelillo</surname> <given-names>M.</given-names></name></person-group> (<year>2007</year>). <article-title>Dominant sets and pairwise clustering</article-title>. <source>IEEE Trans. Pattern Anal. Mach. Intell.</source> <volume>29</volume>, <fpage>167</fpage>&#x02013;<lpage>172</lpage>. <pub-id pub-id-type="doi">10.1109/TPAMI.2007.250608</pub-id></citation>
</ref>
<ref id="B48">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Meier</surname> <given-names>T. B.</given-names></name> <name><surname>Desphande</surname> <given-names>A. S.</given-names></name> <name><surname>Vergun</surname> <given-names>S.</given-names></name> <name><surname>Nair</surname> <given-names>V. A.</given-names></name> <name><surname>Song</surname> <given-names>J.</given-names></name> <name><surname>Biswal</surname> <given-names>B. B.</given-names></name> <etal/></person-group>. (<year>2012</year>). <article-title>Support vector machine classification and characterization of age-related reorganization of functional brain networks</article-title>. <source>Neuroimage</source> <volume>60</volume>, <fpage>601</fpage>&#x02013;<lpage>613</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2011.12.052</pub-id><pub-id pub-id-type="pmid">22227886</pub-id></citation>
</ref>
<ref id="B49">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Miskovic</surname> <given-names>V.</given-names></name> <name><surname>Ma</surname> <given-names>X.</given-names></name> <name><surname>Chou</surname> <given-names>C. A.</given-names></name> <name><surname>Fan</surname> <given-names>M.</given-names></name> <name><surname>Owens</surname> <given-names>M.</given-names></name> <name><surname>Sayama</surname> <given-names>H.</given-names></name> <etal/></person-group>. (<year>2015</year>). <article-title>Developmental changes in spontaneous electrocortical activity and network organization from early to late childhood</article-title>. <source>Neuroimage</source> <volume>118</volume>, <fpage>237</fpage>&#x02013;<lpage>247</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2015.06.013</pub-id><pub-id pub-id-type="pmid">26057595</pub-id></citation>
</ref>
<ref id="B50">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Oostenveld</surname> <given-names>R.</given-names></name> <name><surname>Fries</surname> <given-names>P.</given-names></name> <name><surname>Maris</surname> <given-names>E.</given-names></name> <name><surname>Schoffelen</surname> <given-names>J. M.</given-names></name></person-group> (<year>2011</year>). <article-title>FielTrip: open source software for advantage analysis of MEG, EEG, and invasive electrophysiological data</article-title>. <source>Computat. Intell. Neurosci.</source> <volume>2011</volume>:<fpage>156869</fpage>. <pub-id pub-id-type="doi">10.1155/2011/156869</pub-id></citation>
</ref>
<ref id="B51">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Qin</surname> <given-names>J.</given-names></name> <name><surname>Chen</surname> <given-names>S. G.</given-names></name> <name><surname>Dewen</surname> <given-names>H.</given-names></name> <name><surname>Zeng</surname> <given-names>L. L.</given-names></name> <name><surname>Fan</surname> <given-names>Y. M.</given-names></name> <name><surname>Xiao-Ping</surname> <given-names>C.</given-names></name> <etal/></person-group>. (<year>2015</year>), <article-title>Predicting individual brain maturity using dynamic functional connectivity</article-title>. <source>Front. Hum. Neurosci.</source> <volume>9</volume>:<fpage>418</fpage>. <pub-id pub-id-type="doi">10.3389/fnhum.2015.00418</pub-id><pub-id pub-id-type="pmid">26236224</pub-id></citation>
</ref>
<ref id="B52">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Richman</surname> <given-names>J. S.</given-names></name> <name><surname>Moorman</surname> <given-names>J. R.</given-names></name></person-group> (<year>2000</year>). <article-title>Physiological time-series analysis using approximate entropy and sample entropy</article-title>. <source>Am. J. Physiol. Heart Circ. Physiol.</source> <volume>278</volume>, <fpage>H2039</fpage>&#x02013;<lpage>H2049</lpage>. Available online at: <ext-link ext-link-type="uri" xlink:href="http://ajpheart.physiology.org/content/278/6/H2039">http://ajpheart.physiology.org/content/278/6/H2039</ext-link> <pub-id pub-id-type="pmid">10843903</pub-id></citation>
</ref>
<ref id="B53">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Schalk</surname> <given-names>G.</given-names></name> <name><surname>McFarland</surname> <given-names>D. J.</given-names></name> <name><surname>Hinterberger</surname> <given-names>T.</given-names></name> <name><surname>Birbaumer</surname> <given-names>N.</given-names></name> <name><surname>Wolpaw</surname> <given-names>J. R.</given-names></name></person-group> (<year>2004</year>). <article-title>BCI2000: a general-purpose Brain-Computer Interface (BCI) system</article-title>. <source>IEEE Trans. Biomed. Eng.</source> <volume>51</volume>, <fpage>1034</fpage>&#x02013;<lpage>1043</lpage>. <pub-id pub-id-type="doi">10.1109/TBME.2004.827072</pub-id><pub-id pub-id-type="pmid">15188875</pub-id></citation>
</ref>
<ref id="B54">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Sch&#x000F6;lkopf</surname> <given-names>B.</given-names></name> <name><surname>Smola</surname> <given-names>A. J.</given-names></name></person-group> (<year>2001</year>). <source>Learning with Kernels: Support Vector Machines, Regularization, Optimization and Beyond</source>. <publisher-loc>Cambridge, MA</publisher-loc>: <publisher-name>MIT Press</publisher-name>.</citation>
</ref>
<ref id="B55">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Shehzad</surname> <given-names>Z.</given-names></name> <name><surname>Kelly</surname> <given-names>A. M.</given-names></name> <name><surname>Reiss</surname> <given-names>P. T.</given-names></name> <name><surname>Gee</surname> <given-names>D. G.</given-names></name> <name><surname>Gotimer</surname> <given-names>K.</given-names></name> <name><surname>Uddin</surname> <given-names>L. Q.</given-names></name> <etal/></person-group>. (<year>2009</year>). <article-title>The resting brain: unconstrained yet reliable</article-title>. <source>Cereb. Cortex</source> <volume>19</volume>, <fpage>2209</fpage>&#x02013;<lpage>2229</lpage>. <pub-id pub-id-type="doi">10.1093/cercor/bhn256</pub-id><pub-id pub-id-type="pmid">19221144</pub-id></citation>
</ref>
<ref id="B56">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Shen</surname> <given-names>H.</given-names></name> <name><surname>Wang</surname> <given-names>L.</given-names></name> <name><surname>Liu</surname> <given-names>Y.</given-names></name> <name><surname>Hu</surname> <given-names>D.</given-names></name></person-group> (<year>2010</year>). <article-title>Discriminative analysis of resting-state functional connectivity patterns of schizophrenia using low dimensional embedding off MRI</article-title>. <source>Neuroimage</source> <volume>49</volume>, <fpage>3110</fpage>&#x02013;<lpage>3121</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2009.11.011</pub-id></citation>
</ref>
<ref id="B57">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Song</surname> <given-names>J.</given-names></name> <name><surname>Desphande</surname> <given-names>A. S.</given-names></name> <name><surname>Meier</surname> <given-names>T. B.</given-names></name> <name><surname>Tudorascu</surname> <given-names>D. L.</given-names></name> <name><surname>Vergun</surname> <given-names>S.</given-names></name> <name><surname>Nair</surname> <given-names>V. A.</given-names></name> <etal/></person-group>. (<year>2012</year>). <article-title>Age-related differences in test-retest reliability in resting-state brain functional connectivity</article-title>. <source>PLoS ONE</source> <volume>7</volume>:<fpage>e49847</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0049847</pub-id><pub-id pub-id-type="pmid">23227153</pub-id></citation>
</ref>
<ref id="B58">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Supekar</surname> <given-names>K.</given-names></name> <name><surname>Musen</surname> <given-names>M.</given-names></name> <name><surname>Menon</surname> <given-names>V.</given-names></name></person-group> (<year>2009</year>). <article-title>Development of large-scale functional brain networks in children</article-title>. <source>PLoS Biol.</source> <volume>7</volume>:<fpage>e1000157</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pbio.1000157</pub-id><pub-id pub-id-type="pmid">19621066</pub-id></citation>
</ref>
<ref id="B59">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Szekely</surname> <given-names>G. J.</given-names></name> <name><surname>Rizzo</surname> <given-names>M. L.</given-names></name></person-group> (<year>2014</year>). <article-title>Partial distance correlation with methods for dissimilarities</article-title>. <source>Ann. Stat.</source> <volume>42</volume>, <fpage>2382</fpage>&#x02013;<lpage>2412</lpage>. <pub-id pub-id-type="doi">10.1214/14-AOS1255</pub-id></citation>
</ref>
<ref id="B60">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Thomason</surname> <given-names>M. E.</given-names></name> <name><surname>Chang</surname> <given-names>C. E.</given-names></name> <name><surname>Glover</surname> <given-names>G. H.</given-names></name> <name><surname>Gabrieli</surname> <given-names>J. D.</given-names></name> <name><surname>Greicius</surname> <given-names>M. D.</given-names></name> <name><surname>Gotlib</surname> <given-names>I. H.</given-names></name></person-group> (<year>2008</year>). <article-title>Default-mode function and task-induced deactivation have overlapping brain substrates in children</article-title>. <source>Neuroimage</source> <volume>41</volume>, <fpage>1493</fpage>&#x02013;<lpage>1503</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2008.03.029</pub-id><pub-id pub-id-type="pmid">18482851</pub-id></citation>
</ref>
<ref id="B61">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Turk-Browne</surname> <given-names>N. B.</given-names></name></person-group> (<year>2013</year>). <article-title>Functional interactions as big data in the human brain</article-title>. <source>Science</source> <volume>342</volume>, <fpage>580</fpage>&#x02013;<lpage>584</lpage>. <pub-id pub-id-type="doi">10.1126/science.1238409</pub-id><pub-id pub-id-type="pmid">24179218</pub-id></citation>
</ref>
<ref id="B62">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Van Dijk</surname> <given-names>K. R.</given-names></name> <name><surname>Hedden</surname> <given-names>T.</given-names></name> <name><surname>Venkataraman</surname> <given-names>A.</given-names></name> <name><surname>Evans</surname> <given-names>K. C.</given-names></name> <name><surname>Lazar</surname> <given-names>S. W.</given-names></name> <name><surname>Buckner</surname> <given-names>R. L.</given-names></name></person-group> (<year>2010</year>). <article-title>Intrinsic connectivity as a tool for human connectomics: theory, properties, and optimization</article-title>. <source>J. Neurophysiol.</source> <volume>103</volume>, <fpage>297</fpage>&#x02013;<lpage>321</lpage>. <pub-id pub-id-type="doi">10.1152/jn.00783.2009</pub-id><pub-id pub-id-type="pmid">19889849</pub-id></citation>
</ref>
<ref id="B63">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Vergun</surname> <given-names>S.</given-names></name> <name><surname>Deshpande</surname> <given-names>A. S.</given-names></name> <name><surname>Meier</surname> <given-names>T. B.</given-names></name> <name><surname>Song</surname> <given-names>J.</given-names></name> <name><surname>Tudorascu</surname> <given-names>D. L.</given-names></name> <name><surname>Nair</surname> <given-names>V. A.</given-names></name> <etal/></person-group>. (<year>2013</year>). <article-title>Characterizing functional connectivity differences in aging adults using machine learning on resting state fMRI data</article-title>. <source>Front. Comput. Neurosci.</source> <volume>7</volume>:<fpage>38</fpage>. <pub-id pub-id-type="doi">10.3389/fncom.2013.00038</pub-id><pub-id pub-id-type="pmid">23630491</pub-id></citation>
</ref>
<ref id="B64">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zuo</surname> <given-names>X.</given-names></name> <name><surname>Kelly</surname> <given-names>C.</given-names></name> <name><surname>Adelstein</surname> <given-names>J. S.</given-names></name> <name><surname>Klien</surname> <given-names>D. F.</given-names></name> <name><surname>Castellanos</surname> <given-names>F. X.</given-names></name> <name><surname>Milham</surname> <given-names>M. P.</given-names></name></person-group> (<year>2010</year>). <article-title>Reliable intrinsic connectivity networks: test-retest evaluation using ICA and dual regression approach</article-title>. <source>Neuroimage</source> <volume>49</volume>, <fpage>2163</fpage>&#x02013;<lpage>2177</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2009.10.080</pub-id><pub-id pub-id-type="pmid">19896537</pub-id></citation>
</ref>
</ref-list>
<fn-group>
<fn id="fn0001"><p><sup>1</sup><ext-link ext-link-type="uri" xlink:href="https://physionet.org/pn4/eegmmidb/">https://physionet.org/pn4/eegmmidb/</ext-link></p></fn>
</fn-group>
</back>
</article>