检索结果-内蒙古大学图书馆

Benchmarking the CoW with the TopCoW Challenge: Topology-Aware Anatomical Segmentation of the Circle of Willis for CTA and MRA

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Yang, Kaiyuan Musio, Fabio Ma, Yihui Juchler, Norman Paetzold, Johannes C. Al-Maskari, Rami Höher, Luciano Li, Hongwei Bran Hamamci, Ibrahim Ethem Sekuboyina, Anjany Shit, Suprosanna Huang, Houjing Prabhakar, Chinmay de la Rosa, Ezequiel Waldmannstetter, Diana Kofler, Florian Navarro, Fernando Menten, Martin Ezhov, Ivan Rueckert, Daniel Vos, Iris Ruigrok, Ynte Velthuis, Birgitta Kuijf, Hugo Hämmerli, Julien Wurster, Catherine Bijlenga, Philippe Westphal, Laura Bisschop, Jeroen Colombo, Elisa Baazaoui, Hakim Makmur, Andrew Hallinan, James Wiestler, Bene Kirschke, Jan S. Wiest, Roland Montagnon, Emmanuel Letourneau-Guillon, Laurent Galdran, Adrian Galati, Francesco Falcetta, Daniele Zuluaga, Maria A. Lin, Chaolong Zhao, Haoran Zhang, Zehan Ra, Sinyoung Hwang, Jongyun Park, Hyunjin Chen, Junqiang Wodzinski, Marek Müller, Henning Shi, Pengcheng Liu, Wei Ma, Ting Yalçin, Cansu Hamadache, Rachika E. Salvi, Joaquim Llado, Xavier Estrada, Uma Maria Lal-Trehan Abramova, Valeriia Giancardo, Luca Oliver, Arnau Liu, Jialu Huang, Haibin Cui, Yue Lin, Zehang Liu, Yusheng Zhu, Shunzhi Patel, Tatsat R. Tutino, Vincent M. Orouskhani, Maysam Wang, Huayu Mossa-Basha, Mahmud Zhu, Chengcheng Rokuss, Maximilian R. Kirchhoff, Yannick Disch, Nico Holzschuh, Julius Isensee, Fabian Maier-Hein, Klaus Sato, Yuki Hirsch, Sven Wegener, Susanne Menze, Bjoern Department of Quantitative Biomedicine University of Zurich Zurich Switzerland Center for Computational Health Zurich University of Applied Sciences Zurich Switzerland Department of Neuroradiology University Hospital of Zurich Zurich Switzerland Department of Neurosurgery Zhongnan Hospital of Wuhan University Wuhan China Department of Computing Imperial College London London United Kingdom Helmholtz Center Munich Germany Athinoula A. Martinos Center for Biomedical Imaging Harvard Medical School Boston United States School of Medicine Technical University of Munich Munich Germany Department of Informatics Technical University of Munich Munich Germany Helmholtz AI Helmholtz Munich Munich Germany Image Sciences Institute UMC Utrecht Utrecht Netherlands Department of Neurology UMC Utrecht Utrecht Netherlands Department of Radiology UMC Utrecht Utrecht Netherlands Department of Clinical Neurosciences Division of Neurosurgery Geneva University Hospitals Geneva Switzerland Department of Neurology University Hospital of Zurich Zurich Switzerland Department of Physiology University of Toronto Toronto Canada Department of Neurosurgery University Hospital of Zurich Zurich Switzerland Department of Diagnostic Imaging National University Hospital Singapore Department of Diagnostic and Interventional Neuroradiology University Hospital Berne University of Berne Berne Switzerland Montreal Canada Universitat Pompeu Fabra Barcelona Spain EURECOM Biot France Institute of Medical Technology Peking University Health Science Center Beijing China Hangzhou Genlight Medtech Co. Ltd. Hangzhou China Department of Artificial Intelligence Sungkyunkwan University Seoul Korea Republic of Department of Electrical and Computer Engineering Sungkyunkwan University Seoul Korea Republic of Shanghai MediWorks Precision Instruments Co. Ltd. Shanghai China Institute of Informatics HES-SO Valais-Wallis Switzerland Department of Measurement and Electronics AGH University

The Circle of Willis (CoW) is an important network of arteries connecting major circulations of the brain. Its vascular architecture is believed to affect the risk, severity, and clinical outcome of serious neuro-vascular diseases. However, characterizing the highly variable CoW anatomy is still a manual and time-consuming expert task. The CoW is usually imaged by two angiographic imaging modalities, magnetic resonance angiography (MRA) and computed tomography angiography (CTA), but there exist limited public datasets with annotations on CoW anatomy, especially for CTA. Therefore we organized the TopCoW Challenge in 2023 with the release of an annotated CoW dataset. The TopCoW dataset was the first public dataset with voxel-level annotations for thirteen possible CoW vessel components, enabled by virtual-reality (VR) technology. It was also the first large dataset with paired MRA and CTA from the same patients. TopCoW challenge formalized the CoW characterization problem as a multiclass anatomical segmentation task with an emphasis on topological metrics. We invited submissions worldwide for the CoW segmentation task, which attracted over 140 registered participants from four continents. The top performing teams managed to segment many CoW components to Dice scores around 90%, but with lower scores for communicating arteries and rare variants. There were also topological mistakes for predictions with high Dice scores. Additional topological analysis revealed further areas for improvement in detecting certain CoW components and matching CoW variant topology accurately. TopCoW represented a first attempt at benchmarking the CoW anatomical segmentation task for MRA and CTA, both morphologically and topologically. © 2023, CC BY-NC-ND.

关键词： Large datasets

Metrics for benchmarking and uncertainty quantification: Quality, applicability, and a path to best practices for machine learning in chemistry

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Vishwakarma, Gaurav Sonpal, Aditya Hachmann, Johannes Department of Chemical and Biological Engineering University at Buffalo State University of New York BuffaloNY14260 United States Computational and Data-Enabled Science and Engineering Graduate Program University at Buffalo State University of New York BuffaloNY14260 United States New York State Center of Excellence in Materials Informatics BuffaloNY14203 United States

This review aims to draw attention to two issues of concern when we set out to make machine learning work in the chemical and materials domain, i.e., statistical loss function metrics for the validation and benchmarking of data-derived models, and the uncertainty quantification of predictions made by them. They are often overlooked or underappreciated topics as chemists typically only have limited training in statistics. Aside from helping to assess the quality, reliability, and applicability of a given model, these metrics are also key to comparing the performance of different models and thus for developing guidelines and best practices for the successful application of machine learning in chemistry. Copyright © 2020, The Authors. All rights reserved.

关键词： Benchmarking

Why is the Winner the Best?

学校读者我要写书评

暂无评论

Why is the Winner the Best?

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： M. Eisenmann A. Reinke V. Weru M. D. Tizabi F. Isensee T. J. Adler S. Ali V. Andrearczyk M. Aubreville U. Baid S. Bakas N. Balu S. Bano J. Bernal S. Bodenstedt A. Casella V. Cheplygina M. Daum M. De Bruijne A. Depeursinge R. Dorent J. Egger D. G. Ellis S. Engelhardt M. Ganz N. Ghatwary G. Girard P. Godau A. Gupta L. Hansen K. Harada M. Heinrich N. Heller A. Hering A. Huaulmé P. Jannin A. E. Kavur O. Kodym M. Kozubek J. Li H. Li J. Ma C. Martín-Isla B. Menze A. Noble V. Oreiller N. Padoy S. Pati K. Payette T. Rädsch J. Rafael-Patiño V. Singh Bawa S. Speidel C. H. Sudre K. Van Wijnen M. Wagner D. Wei A. Yamlahi M. H. Yap C. Yuan M. Zenk A. Zia D. Zimmerer D. Aydogan B. Bhattarai L. Bloch R. Brüngel J. Cho C. Choi Q. Dou I. Ezhov C. M. Friedrich C. Fuller R. R. Gaire A. Galdran Á. García Faura M. Grammatikopoulou S. Hong M. Jahanifar I. Jang A. Kadkhodamohammadi I. Kang F. Kofler S. Kondo H. Kuijf M. Li M. Luu T. Martinčič P. Morais M. A. Naser B. Oliveira D. Owen S. Pang J. Park S. Park S. Płotka E. Puybareau N. Rajpoot K. Ryu N. Saeed A. Shephard P. Shi D. Štepec R. Subedi G. Tochon H. R. Torres H. Urien J. L. Vilaça K. A. Wahid H. Wang J. Wang L. Wang X. Wang B. Wiestler M. Wodzinski F. Xia J. Xie Z. Xiong S. Yang Y. Yang Z. Zhao K. Maier-Hein P. F. Jäger A. Kopp-Schneider L. Maier-Hein Division of Intelligent Medical Systems German Cancer Research Center (DKFZ) Heidelberg Germany Helmholtz Imaging German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Division of Biostatistics German Cancer Research Center (DKFZ) Heidelberg Germany Division of Medical Image Computing German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Engineering and Physical Sciences School of Computing University of Leeds Leeds UK Institute of Informatics School of Management HES-SO Valais-Wallis University of Applied Sciences and Arts Western Switzerland Sierre Switzerland Department of Nuclear Medicine and Molecular Imaging Lausanne University Hospital Lausanne Switzerland Technische Hochschule Ingolstadt Ingolstadt Germany Center for Artificial Intelligence and Data Science for Integrated Diagnostics (AI2D) and Center for Biomedical Image Computing and Analytics (CBICA) University of Pennsylvania Philadelphia PA USA Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology University of Washington Seattle WA USA Department of Computer Science Wellcome/EPSRC Centre for Interventional and Surgical Sciences (WEISS) University College London London UK Universitat Autònoma de Barcelona & Computer Vision Center Barcelona Spain Division of Translational Surgical Oncology National Center for Tumor Diseases (NCT/UCC) Dresden Dresden Germany Department of Advanced Robotics Istituto Italiano di Tecnologia Italy Department of Electronics Information and Bioengineering Politecnico di Milano Milan Italy IT University of Copenhagen Copenhagen Denmark Department of General Visceral and Transplantation Surgery Heidelberg University Hospital Heidelberg Germany Department of Radiology and Nuc

International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from these competitions. Do they really generate scientific progress? What are common and successful participation strategies? What makes a solution superior to a competing method? To address this gap in the literature, we performed a multicenter study with all 80 competitions that were conducted in the scope of IEEE ISBI 2021 and MICCAI 2021. Statistical analyses performed based on comprehensive descriptions of the submitted algorithms linked to their rank as well as the underlying participation strategies revealed common characteristics of winning solutions. These typically include the use of multi-task learning (63%) and/or multi-stage pipelines (61%), and a focus on augmentation (100%), image preprocessing (97%), data curation (79%), and post-processing (66%). The “typical” lead of a winning team is a computer scientist with a doctoral degree, five years of experience in biomedical image analysis, and four years of experience in deep learning. Two core general development strategies stood out for highly-ranked teams: the reflection of the metrics in the method design and the focus on analyzing and handling failure cases. According to the organizers, 43% of the winning algorithms exceeded the state of the art but only 11% completely solved the respective domain problem. The insights of our study could help researchers (1) improve algorithm development strategies when approaching new problems, and (2) focus on open research questions revealed by this work.

关键词：

Critical mass effect in evolutionary games triggered by zealots

学校读者我要写书评

暂无评论

Physical Review Research 2020年第2期2卷 023305-023305页

作者： Alessio Cardillo Naoki Masuda Department of Engineering Mathematics University of Bristol Bristol BS8 1UB United Kingdom Department of Computer Science and Mathematics University Rovira i Virgili E-43007 Tarragona Spain GOTHAM Lab – Institute for Biocomputation and Physics of Complex Systems (BIFI) University of Zaragoza E-50018 Zaragoza Spain Department of Mathematics State University of New York at Buffalo Buffalo New York 14260-2900 USA Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo Buffalo New York 14260-5030 USA

Tiny perturbations may trigger large responses in systems near criticality, shifting them across equilibria. Committed minorities are suggested to be responsible for the emergence of collective behaviors in many physical, social, and biological systems. Using evolutionary game theory, we address the question whether a finite fraction of zealots can drive the system to large-scale coordination. We find that a tipping point exists in coordination games, whereas the same phenomenon depends on the selection pressure, update rule, and network structure in other types of games. Our study paves the way to understand social systems driven by the individuals' benefit in the presence of zealots, such as human vaccination behavior or cooperative transports in animal groups.

关键词： Patterns in complex systems Social systems

Interplay between k-core and community structure in complex networks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Malvestio, Irene Cardillo, Alessio Masuda, Naoki Department of Engineering Mathematics University of Bristol BristolBS8 1UB United Kingdom Department of Computer Science and Mathematics University Rovira i Virgili TarragonaE-43007 Spain University of Zaragoza ZaragozaE-50018 Spain Department of Mathematics University at Buffalo BuffaloNY14260-2900 United States Computational and Data-Enabled Science and Engineering Program University at Buffalo State University of New York BuffaloNY14260-5030 United States

The organisation of a network in a maximal set of nodes having at least k neighbours within the set, known as k-core decomposition, has been used for studying various phenomena. It has been shown that nodes in the innermost k-shells play a crucial role in contagion processes, emergence of consensus, and resilience of the system. It is known that the k-core decomposition of many empirical networks cannot be explained by the degree of each node alone, or equivalently, random graph models that preserve the degree of each node (i.e., configuration model). Here we study the k-core decomposition of some empirical networks as well as that of some randomised counterparts, and examine the extent to which the k-shell structure of the networks can be accounted for by the community structure. We find that preserving the community structure in the randomisation process is crucial for generating networks whose k-core decomposition is close to the empirical one. We also highlight the existence, in some networks, of a concentration of the nodes in the innermost k-shells into a small number of communities. Copyright © 2020, The Authors. All rights reserved.

关键词： Complex networks

Advancing the Use of Longitudinal Electronic Health Records: Tutorial for Uncovering Real-World Evidence in Chronic Disease Outcomes

学校读者我要写书评

暂无评论

Journal of Medical Internet Research 2025年第1期27卷 e71873页

作者： Huang, Feiqing Hou, Jue Zhou, Ningxuan Greco, Kimberly Lin, Chenyu Sweet, Sara Morini Wen, Jun Shen, Lechen Gonzalez, Nicolas Zhang, Sinian Liao, Katherine P. Cai, Tianrun Xia, Zongqi Bourgeois, Florence T. Cai, Tianxi Department of Biostatistics Harvard T.H. Chan School of Public Health Boston MA United States Harvard-MIT Center for Regulatory Science Harvard Medical School Boston MA United States Division of Biostatistics and Health Data Science School of Public Health University of Minnesota Minneapolis MN United States Department of Biomedical Informatics Harvard Medical School Boston MA United States Department of Engineering University of Toronto Toronto ON Canada Division of Rheumatology Inflammation and Immunity Brigham and Women's Hospital Boston MA United States Department of Neurology University of Pittsburgh Pittsburgh PA United States Computational Health Informatics Program (CHIP) Boston Children's Hospital Boston MA United States Department of Pediatrics Harvard Medical School Boston MA United States

Managing chronic diseases requires ongoing monitoring of disease activity and therapeutic responses to optimize treatment plans. With the growing availability of disease-modifying therapies, it is crucial to investigate comparative effectiveness and long-term outcomes beyond those available from randomized clinical trials. We introduce a comprehensive pipeline for generating reproducible and generalizable real-world evidence on disease outcomes by leveraging electronic health record data. The pipeline first generates scalable disease outcomes by linking electronic health record data with registry data containing a small sample of labeled outcomes. It then applies causal analysis using these scalable outcomes to evaluate therapies for chronic diseases. The implementation of the pipeline is illustrated in a case study based on multiple sclerosis. Our approach addresses challenges in real-world evidence generation for disease activity of chronic conditions, specifically the lack of direct observations on key outcomes and biases arising from imperfect or incomplete data. We present advanced machine learning techniques such as semisupervised and ensemble methods to impute missing outcome data, further incorporating steps for calibrated causal analyses and bias correction. ©Feiqing Huang, Jue Hou, Ningxuan Zhou, Kimberly Greco, Chenyu Lin, Sara Morini Sweet, Jun Wen, Lechen Shen, Nicolas Gonzalez, Sinian Zhang, Katherine P Liao, Tianrun Cai, Zongqi Xia, Florence T Bourgeois, Tianxi Cai.

关键词： calibration causal inference chronic disease outcomes data imputation electronic health records longitudinal disease activity machine learning real-world evidence

UNCOVER: A NIRSpec Identification of a Broad Line AGN at z = 8.50

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Kokorev, Vasily Fujimoto, Seiji Labbe, Ivo Greene, Jenny E. Bezanson, Rachel Dayal, Pratika Nelson, Erica J. Atek, Hakim Brammer, Gabriel Caputi, Karina I. Chemerynska, Iryna Cutler, Sam E. Feldmann, Robert Fudamoto, Yoshinobu Furtak, Lukas J. Goulding, Andy D. de Graaff, Anna Leja, Joel Marchesini, Danilo Miller, Tim B. Nanayakkara, Themiya Oesch, Pascal A. Pan, Richard Price, Sedona H. Setton, David J. Smit, Renske Stefanon, Mauro Wang, Bingjie Weaver, John R. Whitaker, Katherine E. Williams, Christina C. Zitrin, Adi Kapteyn Astronomical Institute University of Groningen Groningen9700 AV Netherlands Department of Astronomy The University of Texas at Austin AustinTX78712 United States Niels Bohr Institute University of Copenhagen Jagtvej 128 København NDK-2200 Denmark Centre for Astrophysics and Supercomputing Swinburne University of Technology MelbourneVIC3122 Australia Department of Astrophysical Sciences Princeton University 4 Ivy Lane PrincetonNJ08544 United States Department of Physics and Astronomy PITT PACC University of Pittsburgh PittsburghPA15260 United States Department for Astrophysical and Planetary Science University of Colorado BoulderCO80309 United States Institut d’Astrophysique de Paris CNRS Sorbonne Université 98bis Boulevard Arago Paris75014 France Department of Astronomy University of Massachusetts AmherstMA01003 United States Institute for Computational Science University of Zurich ZurichCH-8057 Switzerland Waseda Research Institute for Science and Engineering Faculty of Science and Engineering Waseda University 3-4-1 Okubo Shinjuku Tokyo169-8555 Japan National Astronomical Observatory of Japan 2-21-1 Osawa Mitaka Tokyo Japan Physics Department Ben-Gurion University of the Negev P.O. Box 653 Be’er-Sheva84105 Israel Max-Planck-Institut für Astronomie Königstuhl 17 HeidelbergD-69117 Germany Department of Astronomy & Astrophysics The Pennsylvania State University University ParkPA16802 United States Institute for Computational & Data Sciences The Pennsylvania State University University ParkPA16802 United States Institute for Gravitation and the Cosmos The Pennsylvania State University University ParkPA16802 United States Department of Physics & Astronomy Tufts University MA02155 United States Department of Astronomy Yale University New HavenCT06511 United States Department of Physics and Astronomy Northwestern University 1800 Sherman Ave EvanstonIL60201 United States Department of Astronomy University

Deep observations with JWST have revealed an emerging population of red point-like sources that could provide a link between the postulated supermassive black hole seeds and observed quasars. In this work we present a JWST/NIRSpec spectrum from the JWST Cycle 1 UNCOVER Treasury survey, of a massive accreting black hole at z = 8.50, displaying a clear broad-line component as inferred from the Hβ line with FWHM = 3439 ± 413 km s−1, typical of the broad line region of an active galactic nucleus (AGN). The AGN nature of this object is further supported by high ionization, as inferred from emission lines, and a point-source morphology. We compute the black hole mass of log10(MBH/M☉) = 8.17±0.42, and a bolometric luminosity of Lbol ∼ 6.6×1045 erg s−1. These values imply that our object is accreting at ∼ 40% of the Eddington limit. Detailed modeling of the spectral energy distribution in the optical and near-infrared, together with constraints from ALMA, indicate an upper limit on the stellar mass of log10(M∗/M☉) Copyright © 2023, The Authors. All rights reserved.

关键词： Active Galactic Nuclei

The status of the human gene catalogue

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Amaral, Paulo Carbonell-Sala, Silvia De La Vega, Francisco M. Faial, Tiago Frankish, Adam Gingeras, Thomas Guigo, Roderic Harrow, Jennifer L. Hatzigeorgiou, Artemis G. Johnson, Rory Murphy, Terence D. Pertea, Mihaela Pruitt, Kim D. Pujar, Shashikant Takahashi, Hazuki Ulitsky, Igor Varabyou, Ales Wells, Christine A. Yandell, Mark Carninci, Piero Salzberg, Steven L. INSPER Institute of Education and Research SP São Paulo Brazil Dr. Aiguader 88 Catalonia Barcelona08003 Spain Department of Biomedical Data Science Stanford University School of Medicine StanfordCA United States Tempus Labs Inc. ChicagoIL United States Nature Genetics San FranciscoCA United States European Molecular Biology Laboratory European Bioinformatics Institute Wellcome Genome Campus Hinxton CambridgeCB10 1SD United Kingdom Department of Functional Genomics Cold Spring Harbor Laboratory Cold Spring HarborNY United States Catalonia Barcelona Spain Centre for Genomics Research Discovery Sciences AstraZeneca Da Vinci Building. Melbourn Science Park RoystonSG8 6HB United Kingdom Universithy of Thessaly Department of Computer Science and Biomedical Informatics Lamia Greece Hellenic Pasteur Institute Athens Greece School of Biology and Environmental Science University College Dublin DublinD04 V1W8 Ireland Conway Institute of Biomedical and Biomolecular Research University College Dublin DublinD04 V1W8 Ireland Department of Medical Oncology Inselspital Bern University Hospital University of Bern Bern3010 Switzerland Department for BioMedical Research University of Bern Bern3008 Switzerland National Center for Biotechnology Information National Library of Medicine National Institutes of Health BethesdaMD20894 United States Center for Computational Biology Johns Hopkins University BaltimoreMD United States Department of Biomedical Engineering Johns Hopkins University BaltimoreMD United States Laboratory for Transcriptome Technology RIKEN Center for Integrative Medical Sciences Kanagawa Yokohama230-0045 Japan Department of Immunology and Regenerative Biology Department of Molecular Neuroscience Weizmann Institute of Science Rehovot76100 Israel Department of Computer Science Johns Hopkins University BaltimoreMD United States Stem Cell Systems Department of Anatomy and Physiology Faculty of Medicine Dentistry and Health Scien

Scientists have been trying to identify all of the genes in the human genome since the initial draft of the genome was published in 2001. Over the intervening years, much progress has been made in identifying protein-coding genes, and the estimated number has shrunk to fewer than 20,000, although the number of distinct protein-coding isoforms has expanded dramatically. The invention of high-throughput RNA sequencing and other technological breakthroughs have led to an explosion in the number of reported non-coding RNA genes, although most of them do not yet have any known function. A combination of recent advances offers a path forward to identifying these functions and towards eventually completing the human gene catalogue. However, much work remains to be done before we have a universal annotation standard that includes all medically significant genes, maintains their relationships with different reference genomes, and describes clinically relevant genetic variants. © 2023, CC BY.

关键词： Genes

Fast sequential clustering in riemannian manifolds for dynamic and time-series-annotated multilayer networks

学校读者我要写书评

暂无评论

TechRxiv

TechRxiv 2020年

作者： Ye, Cong Slavakis, Konstantinos Nakuci, Johan Muldoon, Sarah F. Medaglia, John NY14260 United States State University of New York at Buffalo China The Neuroscience Program UB SUNY United States The Department of Mathematics and the Computational and Data-Enabled Science and Engineering Program UB SUNY United States The Department of Psychology Drexel University PA19104 United States The Perelman School of Medicine University of Pennsylvania PA19104 United States

This work exploits Riemannian manifolds to build a sequential-clustering framework able to address a wide variety of clustering tasks in dynamic multilayer (brain) networks via the information extracted from their nodal time-series. The discussion follows a bottom-up path, starting from feature extraction from time-series and reaching up to Riemannian manifolds (feature spaces) to address clustering tasks such as state clustering, community detection (a.k.a. network-topology identification), and subnetwork-sequence tracking. Kernel autoregressive-moving-average modeling and kernel (partial) correlations serve as case studies of generating features in the Riemannian manifolds of Grassmann and positive-(semi)definite matrices, respectively. Feature point-clouds form clusters which are viewed as submanifolds according to Riemannian multi-manifold modeling. A novel sequential-clustering scheme of Riemannian features is also established: feature points are first sampled in a non-random way to reveal the underlying geometric information, and, then, a fast sequential-clustering scheme is brought forth that takes advantage of Riemannian distances and the angular information of tangent spaces. By virtue of the landmark points and the sequential processing of the Riemannian features, the computational complexity of the framework is rendered free from the length of the available time-series data. The effectiveness and computational efficiency of the proposed framework are validated by extensive numerical tests against several state-of-the-art manifold-learning and brain-network-clustering schemes on synthetic as well as real functional-magnetic-resonance-imaging (fMRI) and electroencephalogram (EEG) data. © 2020, CC BY.

关键词： Time series