<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom"
     xmlns:content="http://purl.org/rss/1.0/modules/content/"
     xmlns:dc="http://purl.org/dc/elements/1.1/"
     xmlns:prism="http://prismstandard.org/namespaces/basic/2.0/"
     version="2.0">
   <channel>
      <title>Wiley: WIREs Computational Statistics: Table of Contents</title>
      <link>https://wires.onlinelibrary.wiley.com/journal/19390068?af=R</link>
      <description>Table of Contents for WIREs Computational Statistics. List of articles from both the latest and EarlyView issues.</description>
      <language>en-US</language>
      <copyright>© Wiley Periodicals, Inc.</copyright>
      <managingEditor>wileyonlinelibrary@wiley.com (Wiley Interdisciplinary Reviews)</managingEditor>
      <pubDate>Wed, 10 Jun 2026 07:57:24 +0000</pubDate>
      <lastBuildDate>Wed, 10 Jun 2026 07:57:24 +0000</lastBuildDate>
      <generator>Atypon® Literatum™</generator>
      <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
      <ttl>10080</ttl>
      <dc:title>Wiley: WIREs Computational Statistics: Table of Contents</dc:title>
      <dc:publisher>Wiley</dc:publisher>
      <prism:publicationName>WIREs Computational Statistics</prism:publicationName>
      <atom:link href="https://wires.onlinelibrary.wiley.com/journal/19390068?af=R"
                 rel="self"
                 type="application/atom+xml"/>
      <image>
         <title>Wiley: WIREs Computational Statistics: Table of Contents</title>
         <url>https://wires.onlinelibrary.wiley.com/pb-assets/journal-banners/19390068.jpg</url>
         <link>https://wires.onlinelibrary.wiley.com/journal/19390068?af=R</link>
      </image>
      <item>
         <link>https://wires.onlinelibrary.wiley.com/doi/10.1002/wics.70068?af=R</link>
         <pubDate>Fri, 29 May 2026 05:30:21 -0700</pubDate>
         <dc:date>2026-05-29T05:30:21-07:00</dc:date>
         <source url="https://wires.onlinelibrary.wiley.com/journal/19390068?af=R">Wiley: WIREs Computational Statistics: Table of Contents</source>
         <prism:coverDate>Mon, 01 Jun 2026 00:00:00 -0700</prism:coverDate>
         <prism:coverDisplayDate>Mon, 01 Jun 2026 00:00:00 -0700</prism:coverDisplayDate>
         <guid isPermaLink="false">10.1002/wics.70068</guid>
         <title>Covariance Estimation for Wide Data</title>
         <description>WIREs Computational Statistics, Volume 18, Issue 2, June 2026. </description>
         <dc:description>
Covariance matrix estimation is fundamental to multivariate analysis, with applications spanning finance, genomics, climate science, and signal processing. This review synthesizes recent advances in high‐dimensional covariance estimation‐thresholding, linear and nonlinear shrinkage, graphical models, and random matrix theory‐under a unifying framework that clarifies their interconnections.

ABSTRACT
Reliable estimation of the covariance matrix is fundamental to multivariate analysis, second in importance only to the mean. Its accuracy directly impacts applications in economics, finance, chemistry, health science, bioinformatics, climate research, signal processing, and social network analysis. Modern data environments often involve wide data, where the number of variables is comparable to or exceeds the number of observations, making classical estimators unstable or singular. This review synthesizes recent advances in high‐dimensional covariance estimation, focusing on thresholding procedures, linear and nonlinear shrinkage methods, graphical model‐based approaches, and estimation techniques using random matrix theory. A unifying taxonomy is proposed that organizes these diverse techniques under a single conceptual framework, highlighting their interconnections and guiding the selection of appropriate estimators in wide‐data settings.
</dc:description>
         <content:encoded>&lt;img src="https://wires.onlinelibrary.wiley.com/cms/asset/aab8da56-37c9-4cda-b013-c1530a5a4805/wics70068-toc-0001-m.png"
     alt="Covariance Estimation for Wide Data"/&gt;
&lt;p&gt;Covariance matrix estimation is fundamental to multivariate analysis, with applications spanning finance, genomics, climate science, and signal processing. This review synthesizes recent advances in high-dimensional covariance estimation-thresholding, linear and nonlinear shrinkage, graphical models, and random matrix theory-under a unifying framework that clarifies their interconnections.&lt;/p&gt;
&lt;br/&gt;
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;Reliable estimation of the covariance matrix is fundamental to multivariate analysis, second in importance only to the mean. Its accuracy directly impacts applications in economics, finance, chemistry, health science, bioinformatics, climate research, signal processing, and social network analysis. Modern data environments often involve wide data, where the number of variables is comparable to or exceeds the number of observations, making classical estimators unstable or singular. This review synthesizes recent advances in high-dimensional covariance estimation, focusing on thresholding procedures, linear and nonlinear shrinkage methods, graphical model-based approaches, and estimation techniques using random matrix theory. A unifying taxonomy is proposed that organizes these diverse techniques under a single conceptual framework, highlighting their interconnections and guiding the selection of appropriate estimators in wide-data settings.&lt;/p&gt;</content:encoded>
         <dc:creator>
Eran Raviv
</dc:creator>
         <category>ADVANCED REVIEW</category>
         <dc:title>Covariance Estimation for Wide Data</dc:title>
         <dc:identifier>10.1002/wics.70068</dc:identifier>
         <prism:publicationName>WIREs Computational Statistics</prism:publicationName>
         <prism:doi>10.1002/wics.70068</prism:doi>
         <prism:url>https://wires.onlinelibrary.wiley.com/doi/10.1002/wics.70068?af=R</prism:url>
         <prism:section>ADVANCED REVIEW</prism:section>
         <prism:volume>18</prism:volume>
         <prism:number>2</prism:number>
      </item>
      <item>
         <link>https://wires.onlinelibrary.wiley.com/doi/10.1002/wics.70067?af=R</link>
         <pubDate>Thu, 14 May 2026 01:17:48 -0700</pubDate>
         <dc:date>2026-05-14T01:17:48-07:00</dc:date>
         <source url="https://wires.onlinelibrary.wiley.com/journal/19390068?af=R">Wiley: WIREs Computational Statistics: Table of Contents</source>
         <prism:coverDate>Mon, 01 Jun 2026 00:00:00 -0700</prism:coverDate>
         <prism:coverDisplayDate>Mon, 01 Jun 2026 00:00:00 -0700</prism:coverDisplayDate>
         <guid isPermaLink="false">10.1002/wics.70067</guid>
         <title>A Comprehensive Review of Functional Graphical Models</title>
         <description>WIREs Computational Statistics, Volume 18, Issue 2, June 2026. </description>
         <dc:description>
We review both undirected and directed functional graphical models, which extending network learning from vectors to random functions. We unify theory and practice, highlighting estimation pipelines, computational challenges from infinite dimensionality and non‐Gaussianity, and applications on brain connectivity.

ABSTRACT
Functional graphical models (FGMs) extend classical graphical models from multivariate vectors to multivariate random functions, enabling inference on conditional dependence and, in directed settings, directional or causal relationships across functional domains. This review provides a unified overview of recent developments in both undirected and directed FGMs. We summarize key theoretical foundations, estimation methods, and computational challenges arising from infinite dimensionality, operator non‐invertibility, dimension reduction, and non‐Gaussian behavior. Applications in brain connectivity, protein signaling, transportation systems, and longitudinal microbiome studies illustrate the broad potential of FGMs. We also highlight open research directions, including dynamic networks, adaptive truncation, and methodological extensions beyond Gaussian assumptions.
</dc:description>
         <content:encoded>&lt;img src="https://wires.onlinelibrary.wiley.com/cms/asset/aa0b7176-4737-4b53-8b88-a0cad3e3c21d/wics70067-toc-0001-m.png"
     alt="A Comprehensive Review of Functional Graphical Models"/&gt;
&lt;p&gt;We review both undirected and directed functional graphical models, which extending network learning from vectors to random functions. We unify theory and practice, highlighting estimation pipelines, computational challenges from infinite dimensionality and non-Gaussianity, and applications on brain connectivity.&lt;/p&gt;
&lt;br/&gt;
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;Functional graphical models (FGMs) extend classical graphical models from multivariate vectors to multivariate random functions, enabling inference on conditional dependence and, in directed settings, directional or causal relationships across functional domains. This review provides a unified overview of recent developments in both undirected and directed FGMs. We summarize key theoretical foundations, estimation methods, and computational challenges arising from infinite dimensionality, operator non-invertibility, dimension reduction, and non-Gaussian behavior. Applications in brain connectivity, protein signaling, transportation systems, and longitudinal microbiome studies illustrate the broad potential of FGMs. We also highlight open research directions, including dynamic networks, adaptive truncation, and methodological extensions beyond Gaussian assumptions.&lt;/p&gt;</content:encoded>
         <dc:creator>
Yao Zhao, 
Kuang‐Yao Lee
</dc:creator>
         <category>ADVANCED REVIEW</category>
         <dc:title>A Comprehensive Review of Functional Graphical Models</dc:title>
         <dc:identifier>10.1002/wics.70067</dc:identifier>
         <prism:publicationName>WIREs Computational Statistics</prism:publicationName>
         <prism:doi>10.1002/wics.70067</prism:doi>
         <prism:url>https://wires.onlinelibrary.wiley.com/doi/10.1002/wics.70067?af=R</prism:url>
         <prism:section>ADVANCED REVIEW</prism:section>
         <prism:volume>18</prism:volume>
         <prism:number>2</prism:number>
      </item>
      <item>
         <link>https://wires.onlinelibrary.wiley.com/doi/10.1002/wics.70066?af=R</link>
         <pubDate>Tue, 28 Apr 2026 20:52:57 -0700</pubDate>
         <dc:date>2026-04-28T08:52:57-07:00</dc:date>
         <source url="https://wires.onlinelibrary.wiley.com/journal/19390068?af=R">Wiley: WIREs Computational Statistics: Table of Contents</source>
         <prism:coverDate>Mon, 01 Jun 2026 00:00:00 -0700</prism:coverDate>
         <prism:coverDisplayDate>Mon, 01 Jun 2026 00:00:00 -0700</prism:coverDisplayDate>
         <guid isPermaLink="false">10.1002/wics.70066</guid>
         <title>Text Mining in Bibliometrics and Science Mapping: A Methodological Review</title>
         <description>WIREs Computational Statistics, Volume 18, Issue 2, June 2026. </description>
         <dc:description>
Text mining has become a foundational component of contemporary bibliometrics and science mapping, enabling systematic analysis of the semantic structure, thematic evolution, and cognitive organization of scientific fields. Integrating textual evidence with relational indicators enriches knowledge maps and supports more comprehensive, content‐sensitive representations of research dynamics.

ABSTRACT
Text mining has become central to bibliometrics, providing quantitative insight into the semantic structure of scientific communication. This review surveys current methodological approaches to text‐based science mapping, including geometric embeddings, probabilistic models, network techniques, and neural embedding methods. The discussion examines how these approaches operate across different representations of text and evaluates their interpretability, stability, and statistical assumptions. Key issues include data quality, model validation, reproducibility, and the growing influence of large language models. Persistent challenges—language bias, topic instability, limited full‐text access, and model opacity—raise open questions about dynamic, multimodal, and ethically grounded science mapping.
</dc:description>
         <content:encoded>&lt;img src="https://wires.onlinelibrary.wiley.com/cms/asset/725bdc18-72fa-43b9-a21d-f636c93d2a3c/wics70066-toc-0001-m.png"
     alt="Text Mining in Bibliometrics and Science Mapping: A Methodological Review"/&gt;
&lt;p&gt;Text mining has become a foundational component of contemporary bibliometrics and science mapping, enabling systematic analysis of the semantic structure, thematic evolution, and cognitive organization of scientific fields. Integrating textual evidence with relational indicators enriches knowledge maps and supports more comprehensive, content-sensitive representations of research dynamics.&lt;/p&gt;
&lt;br/&gt;
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;Text mining has become central to bibliometrics, providing quantitative insight into the semantic structure of scientific communication. This review surveys current methodological approaches to text-based science mapping, including geometric embeddings, probabilistic models, network techniques, and neural embedding methods. The discussion examines how these approaches operate across different representations of text and evaluates their interpretability, stability, and statistical assumptions. Key issues include data quality, model validation, reproducibility, and the growing influence of large language models. Persistent challenges—language bias, topic instability, limited full-text access, and model opacity—raise open questions about dynamic, multimodal, and ethically grounded science mapping.&lt;/p&gt;</content:encoded>
         <dc:creator>
Michelangelo Misuraca
</dc:creator>
         <category>ADVANCED REVIEW</category>
         <dc:title>Text Mining in Bibliometrics and Science Mapping: A Methodological Review</dc:title>
         <dc:identifier>10.1002/wics.70066</dc:identifier>
         <prism:publicationName>WIREs Computational Statistics</prism:publicationName>
         <prism:doi>10.1002/wics.70066</prism:doi>
         <prism:url>https://wires.onlinelibrary.wiley.com/doi/10.1002/wics.70066?af=R</prism:url>
         <prism:section>ADVANCED REVIEW</prism:section>
         <prism:volume>18</prism:volume>
         <prism:number>2</prism:number>
      </item>
      <item>
         <link>https://wires.onlinelibrary.wiley.com/doi/10.1002/wics.70064?af=R</link>
         <pubDate>Fri, 24 Apr 2026 23:21:57 -0700</pubDate>
         <dc:date>2026-04-24T11:21:57-07:00</dc:date>
         <source url="https://wires.onlinelibrary.wiley.com/journal/19390068?af=R">Wiley: WIREs Computational Statistics: Table of Contents</source>
         <prism:coverDate>Mon, 01 Jun 2026 00:00:00 -0700</prism:coverDate>
         <prism:coverDisplayDate>Mon, 01 Jun 2026 00:00:00 -0700</prism:coverDisplayDate>
         <guid isPermaLink="false">10.1002/wics.70064</guid>
         <title>On the Foundational Arguments of Sufficient Dimension Reduction</title>
         <description>WIREs Computational Statistics, Volume 18, Issue 2, June 2026. </description>
         <dc:description>
Contemporary Sufficient Dimension Reduction, a versatile method for extracting material information from data, can serve as a preprocessor for classical modeling and inference, or as a standalone theory that leads directly to statistical inference.

ABSTRACT
Sufficient dimension reduction (SDR) refers to supervised methods of dimension reduction that apply in the context of regression, interpreted broadly. SDR started in the early 1990's with methodology to reduce linearly the predictor dimension without loss of information about the conditional distribution of the response given the predictors. The field grew quickly and today it is vast. The early ideas and methods have been formalized, extended, specialized and adapted to many problems in statistics. A comprehensive synopsis of everything covered by SDR would be truly substantial. Instead, the focus of this overview is on the ideas and philosophy of SDR. While the field is vast, there are a few foundational ideas that define the area generally and have been adapted to different problems. In this overview, we elucidate these ideas by explaining the historical ambience, exploring the genesis of the ideas and discussing how they are adapted for various problems. There is also literature on ‘dimensionality reduction’ that is beyond the scope of this overview. Examples include uniform manifold approximation and projection, neural PCA, kernel PCA, and locally linear embedding. Dimension reduction of data that are not meaningfully stochastic is also outside the scope of this article. The worlds of dimensionality reduction and sufficient dimension reduction were largely developed independently, even when in retrospect the developments involve overlap.
</dc:description>
         <content:encoded>&lt;img src="https://wires.onlinelibrary.wiley.com/cms/asset/bc2bb2ab-f98a-49e2-8066-3ba687341a30/wics70064-toc-0001-m.png"
     alt="On the Foundational Arguments of Sufficient Dimension Reduction"/&gt;
&lt;p&gt;Contemporary Sufficient Dimension Reduction, a versatile method for extracting material information from data, can serve as a preprocessor for classical modeling and inference, or as a standalone theory that leads directly to statistical inference.&lt;/p&gt;
&lt;br/&gt;
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;Sufficient dimension reduction (SDR) refers to supervised methods of dimension reduction that apply in the context of regression, interpreted broadly. SDR started in the early 1990's with methodology to reduce linearly the predictor dimension without loss of information about the conditional distribution of the response given the predictors. The field grew quickly and today it is vast. The early ideas and methods have been formalized, extended, specialized and adapted to many problems in statistics. A comprehensive synopsis of everything covered by SDR would be truly substantial. Instead, the focus of this overview is on the ideas and philosophy of SDR. While the field is vast, there are a few foundational ideas that define the area generally and have been adapted to different problems. In this overview, we elucidate these ideas by explaining the historical ambience, exploring the genesis of the ideas and discussing how they are adapted for various problems. There is also literature on ‘dimensionality reduction’ that is beyond the scope of this overview. Examples include uniform manifold approximation and projection, neural PCA, kernel PCA, and locally linear embedding. Dimension reduction of data that are not meaningfully stochastic is also outside the scope of this article. The worlds of dimensionality reduction and sufficient dimension reduction were largely developed independently, even when in retrospect the developments involve overlap.&lt;/p&gt;</content:encoded>
         <dc:creator>
R. Dennis Cook
</dc:creator>
         <category>OVERVIEW</category>
         <dc:title>On the Foundational Arguments of Sufficient Dimension Reduction</dc:title>
         <dc:identifier>10.1002/wics.70064</dc:identifier>
         <prism:publicationName>WIREs Computational Statistics</prism:publicationName>
         <prism:doi>10.1002/wics.70064</prism:doi>
         <prism:url>https://wires.onlinelibrary.wiley.com/doi/10.1002/wics.70064?af=R</prism:url>
         <prism:section>OVERVIEW</prism:section>
         <prism:volume>18</prism:volume>
         <prism:number>2</prism:number>
      </item>
      <item>
         <link>https://wires.onlinelibrary.wiley.com/doi/10.1002/wics.70065?af=R</link>
         <pubDate>Sun, 19 Apr 2026 18:41:48 -0700</pubDate>
         <dc:date>2026-04-19T06:41:48-07:00</dc:date>
         <source url="https://wires.onlinelibrary.wiley.com/journal/19390068?af=R">Wiley: WIREs Computational Statistics: Table of Contents</source>
         <prism:coverDate>Mon, 01 Jun 2026 00:00:00 -0700</prism:coverDate>
         <prism:coverDisplayDate>Mon, 01 Jun 2026 00:00:00 -0700</prism:coverDisplayDate>
         <guid isPermaLink="false">10.1002/wics.70065</guid>
         <title>Contrastive Dimension Reduction: A Systematic Review</title>
         <description>WIREs Computational Statistics, Volume 18, Issue 2, June 2026. </description>
         <dc:description>
Contrastive dimension reduction framework for case–control studies, extracting treatment‐specific signals from high‐dimensional data to enable downstream tasks such as clustering and prediction.

ABSTRACT
Contrastive dimension reduction (CDR) methods aim to extract signal unique to or enriched in a treatment (foreground) group relative to a control (background) group. This setting arises in many scientific domains, such as genomics, imaging, and time series analysis, where traditional dimension reduction techniques such as principal component analysis (PCA) may fail to isolate the signal of interest. In this review, we provide a systematic overview of existing CDR methods. We propose a pipeline for analyzing case–control studies together with a taxonomy of CDR methods based on their assumptions, objectives, and mathematical formulations, unifying disparate approaches under a shared conceptual framework. We highlight key applications and challenges in existing CDR methods and identify open questions and future directions. By providing a clear framework for CDR and its applications, we aim to facilitate broader adoption and motivate further developments in this emerging field.
This article is categorized under:

Statistical Learning and Exploratory Methods of the Data Sciences &gt; Manifold Learning
Statistical and Graphical Methods of Data Analysis &gt; Dimension Reduction
Statistical and Graphical Methods of Data Analysis &gt; Analysis of High Dimensional Data

</dc:description>
         <content:encoded>&lt;img src="https://wires.onlinelibrary.wiley.com/cms/asset/bdacd30d-d84d-4fad-87e3-be49c4aeb373/wics70065-toc-0001-m.png"
     alt="Contrastive Dimension Reduction: A Systematic Review"/&gt;
&lt;p&gt;Contrastive dimension reduction framework for case–control studies, extracting treatment-specific signals from high-dimensional data to enable downstream tasks such as clustering and prediction.&lt;/p&gt;
&lt;br/&gt;
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;Contrastive dimension reduction (CDR) methods aim to extract signal unique to or enriched in a treatment (foreground) group relative to a control (background) group. This setting arises in many scientific domains, such as genomics, imaging, and time series analysis, where traditional dimension reduction techniques such as principal component analysis (PCA) may fail to isolate the signal of interest. In this review, we provide a systematic overview of existing CDR methods. We propose a pipeline for analyzing case–control studies together with a taxonomy of CDR methods based on their assumptions, objectives, and mathematical formulations, unifying disparate approaches under a shared conceptual framework. We highlight key applications and challenges in existing CDR methods and identify open questions and future directions. By providing a clear framework for CDR and its applications, we aim to facilitate broader adoption and motivate further developments in this emerging field.&lt;/p&gt;
&lt;p&gt;This article is categorized under:

Statistical Learning and Exploratory Methods of the Data Sciences &amp;gt; Manifold Learning
Statistical and Graphical Methods of Data Analysis &amp;gt; Dimension Reduction
Statistical and Graphical Methods of Data Analysis &amp;gt; Analysis of High Dimensional Data
&lt;/p&gt;</content:encoded>
         <dc:creator>
Sam Hawke, 
Eric Zhang, 
Jiawen Chen, 
Didong Li
</dc:creator>
         <category>OVERVIEW</category>
         <dc:title>Contrastive Dimension Reduction: A Systematic Review</dc:title>
         <dc:identifier>10.1002/wics.70065</dc:identifier>
         <prism:publicationName>WIREs Computational Statistics</prism:publicationName>
         <prism:doi>10.1002/wics.70065</prism:doi>
         <prism:url>https://wires.onlinelibrary.wiley.com/doi/10.1002/wics.70065?af=R</prism:url>
         <prism:section>OVERVIEW</prism:section>
         <prism:volume>18</prism:volume>
         <prism:number>2</prism:number>
      </item>
      <item>
         <link>https://wires.onlinelibrary.wiley.com/doi/10.1002/wics.70063?af=R</link>
         <pubDate>Wed, 25 Mar 2026 18:40:19 -0700</pubDate>
         <dc:date>2026-03-25T06:40:19-07:00</dc:date>
         <source url="https://wires.onlinelibrary.wiley.com/journal/19390068?af=R">Wiley: WIREs Computational Statistics: Table of Contents</source>
         <prism:coverDate>Mon, 01 Jun 2026 00:00:00 -0700</prism:coverDate>
         <prism:coverDisplayDate>Mon, 01 Jun 2026 00:00:00 -0700</prism:coverDisplayDate>
         <guid isPermaLink="false">10.1002/wics.70063</guid>
         <title>Issue Information</title>
         <description>WIREs Computational Statistics, Volume 18, Issue 2, June 2026. </description>
         <dc:description/>
         <content:encoded/>
         <dc:creator/>
         <category>Issue Information</category>
         <dc:title>Issue Information</dc:title>
         <dc:identifier>10.1002/wics.70063</dc:identifier>
         <prism:publicationName>WIREs Computational Statistics</prism:publicationName>
         <prism:doi>10.1002/wics.70063</prism:doi>
         <prism:url>https://wires.onlinelibrary.wiley.com/doi/10.1002/wics.70063?af=R</prism:url>
         <prism:section>Issue Information</prism:section>
         <prism:volume>18</prism:volume>
         <prism:number>2</prism:number>
      </item>
      <item>
         <link>https://wires.onlinelibrary.wiley.com/doi/10.1002/wics.70062?af=R</link>
         <pubDate>Wed, 25 Mar 2026 00:00:00 -0700</pubDate>
         <dc:date>2026-03-25T12:00:00-07:00</dc:date>
         <source url="https://wires.onlinelibrary.wiley.com/journal/19390068?af=R">Wiley: WIREs Computational Statistics: Table of Contents</source>
         <prism:coverDate>Mon, 01 Jun 2026 00:00:00 -0700</prism:coverDate>
         <prism:coverDisplayDate>Mon, 01 Jun 2026 00:00:00 -0700</prism:coverDisplayDate>
         <guid isPermaLink="false">10.1002/wics.70062</guid>
         <title>Subgroup Identification via Multiple Change Point Detection: Methods and Applications</title>
         <description>WIREs Computational Statistics, Volume 18, Issue 2, June 2026. </description>
         <dc:description>
Subgroup identification methods facilitate the discovery of clinically meaningful subpopulations with differing disease progression, improving personalized risk assessment and treatment strategies.

ABSTRACT
Subgroup identification is a significant research area in statistics and machine learning, aiming to partition a heterogeneous population into more homogeneous subgroups to enable precise inference and personalized decision‐making. Among the various tools available, change point analysis has emerged as a powerful approach for detecting structural changes in data sequences, and it plays an increasingly important role in subgroup identification. In this paper, we provide a systematic review of recent advances in subgroup identification methods based on efficient multiple change point detection methods: (a) We first review the two‐step multiple change point detection method (TSMCD) and its application from linear regression to survival analysis. (b) We then discuss the construction of the threshold variable, including the recent developments in the change plane regression model and the change surface regression model. This review aims to provide researchers with a comprehensive perspective to promote the further application and development of change point analysis in subgroup identification and precision medicine.
</dc:description>
         <content:encoded>&lt;img src="https://wires.onlinelibrary.wiley.com/cms/asset/0d443342-d20d-4a24-8a35-ddadcfbf2a17/wics70062-toc-0001-m.png"
     alt="Subgroup Identification via Multiple Change Point Detection: Methods and Applications"/&gt;
&lt;p&gt;Subgroup identification methods facilitate the discovery of clinically meaningful subpopulations with differing disease progression, improving personalized risk assessment and treatment strategies.&lt;/p&gt;
&lt;br/&gt;
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;Subgroup identification is a significant research area in statistics and machine learning, aiming to partition a heterogeneous population into more homogeneous subgroups to enable precise inference and personalized decision-making. Among the various tools available, change point analysis has emerged as a powerful approach for detecting structural changes in data sequences, and it plays an increasingly important role in subgroup identification. In this paper, we provide a systematic review of recent advances in subgroup identification methods based on efficient multiple change point detection methods: (a) We first review the two-step multiple change point detection method (TSMCD) and its application from linear regression to survival analysis. (b) We then discuss the construction of the threshold variable, including the recent developments in the change plane regression model and the change surface regression model. This review aims to provide researchers with a comprehensive perspective to promote the further application and development of change point analysis in subgroup identification and precision medicine.&lt;/p&gt;</content:encoded>
         <dc:creator>
Yaguang Li, 
Jingli Wang, 
Da Zhao, 
Jialiang Li
</dc:creator>
         <category>ADVANCED REVIEW</category>
         <dc:title>Subgroup Identification via Multiple Change Point Detection: Methods and Applications</dc:title>
         <dc:identifier>10.1002/wics.70062</dc:identifier>
         <prism:publicationName>WIREs Computational Statistics</prism:publicationName>
         <prism:doi>10.1002/wics.70062</prism:doi>
         <prism:url>https://wires.onlinelibrary.wiley.com/doi/10.1002/wics.70062?af=R</prism:url>
         <prism:section>ADVANCED REVIEW</prism:section>
         <prism:volume>18</prism:volume>
         <prism:number>2</prism:number>
      </item>
   </channel>
</rss>
