<?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: Statistical Analysis and Data Mining: An ASA Data Science Journal: Table of Contents</title>
      <link>https://onlinelibrary.wiley.com/journal/19321872a?af=R</link>
      <description>Table of Contents for Statistical Analysis and Data Mining: An ASA Data Science Journal. List of articles from both the latest and EarlyView issues.</description>
      <language>en-US</language>
      <copyright/>
      <managingEditor>wileyonlinelibrary@wiley.com (Wiley Online Library)</managingEditor>
      <pubDate>Tue, 09 Jun 2026 07:51:15 +0000</pubDate>
      <lastBuildDate>Tue, 09 Jun 2026 07:51:15 +0000</lastBuildDate>
      <generator>Atypon® Literatum™</generator>
      <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
      <ttl>10080</ttl>
      <dc:title>Wiley: Statistical Analysis and Data Mining: An ASA Data Science Journal: Table of Contents</dc:title>
      <dc:publisher>Wiley</dc:publisher>
      <prism:publicationName>Statistical Analysis and Data Mining: An ASA Data Science Journal</prism:publicationName>
      <atom:link href="https://onlinelibrary.wiley.com/journal/19321872a?af=R"
                 rel="self"
                 type="application/atom+xml"/>
      <image>
         <title>Wiley: Statistical Analysis and Data Mining: An ASA Data Science Journal: Table of Contents</title>
         <url>https://onlinelibrary.wiley.com/pb-assets/journal-banners/19321872a.jpg</url>
         <link>https://onlinelibrary.wiley.com/journal/19321872a?af=R</link>
      </image>
      <item>
         <link>https://onlinelibrary.wiley.com/doi/10.1002/sam.70093?af=R</link>
         <pubDate>Sun, 07 Jun 2026 23:23:16 -0700</pubDate>
         <dc:date>2026-06-07T11:23:16-07:00</dc:date>
         <source url="https://onlinelibrary.wiley.com/journal/19321872a?af=R">Wiley: Statistical Analysis and Data Mining: An ASA Data Science Journal: 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/sam.70093</guid>
         <title>Prompting Shapes the Statistical Tails of LLM‐Generated Biomedical Data</title>
         <description>Statistical Analysis and Data Mining: An ASA Data Science Journal, Volume 19, Issue 3, June 2026. </description>
         <dc:description>
ABSTRACT
We evaluate four large language models (gpt‐4o, gpt‐4.1, o3, o4‐mini) on six biomedically inspired tasks motivated by domains that often exhibit heavy‐tailed or strongly skewed behavior. We compare three prompt styles—Natural (N), Mixed (M), and Constrained (C)—that differ in distributional pressure; temperature and top‐p$$ p $$ are varied where supported. The study is designed to quantify how prompt‐conditioned distributional pressure modulates the tail‐risk profile of generated numeric outputs, rather than to assess fidelity to an external biomedical ground‐truth distribution. Outliers are flagged using a stabilized MAD–z$$ z $$ rule (zMAD&gt;3$$ {z}_{\mathrm{MAD}}&gt;3 $$), and threshold robustness is summarized by the normalized area under outlier–threshold curves (nAURC). Tail behavior is assessed via complementary diagnostics (exceedances, high quantiles, Moors' kurtosis, and a secondary Pareto‐equivalent exceedance index), with uncertainty quantified using pooled binomial aggregation (Wilson/Newcombe intervals), logit‐based CIs for nAURC, dominance areas over threshold grids, and random‐effects meta‐analysis across problems. Three results emerge. (1) Prompt style is the primary driver of extremes: Under our evaluation criteria, Natural prompts yield the most conservative tail‐risk profile: they consistently minimize outlier rate and nAURC and produce the lightest tails. The ordering between Mixed and Constrained varies by model, while Constrained often produces heavier tails, as expected under explicit tail instructions. (2) These patterns persist across thresholds and problems: Natural robustly dominates both Mixed and Constrained in robustness‐curve dominance area, and meta‐analytic gaps in outlier share are consistently positive for C–N and M–N across models. (3) Sampling (temperature/top‐p$$ p $$) modulates risk within a fixed (model, prompt) cell: effects are consistently positive for outlier incidence in our temperature contrasts and can be substantial in some settings (notably gpt‐4.1 under Natural prompting), but they do not overturn the qualitative prompt ordering in pooled summaries. Overall, prompt design is the most reliable lever for controlling outliers and heavy‐tail risk in LLM‐generated numeric data, with sampling parameters providing additional combination‐specific control. These conclusions apply most directly to the heavy‐tailed biomedical‐inspired settings studied here.
</dc:description>
         <content:encoded>
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;We evaluate four large language models (&lt;span style="font-family:monospace"&gt;gpt-4o&lt;/span&gt;, &lt;span style="font-family:monospace"&gt;gpt-4.1&lt;/span&gt;, &lt;span style="font-family:monospace"&gt;o3&lt;/span&gt;, &lt;span style="font-family:monospace"&gt;o4-mini&lt;/span&gt;) on six biomedically inspired tasks motivated by domains that often exhibit heavy-tailed or strongly skewed behavior. We compare three prompt styles—Natural (N), Mixed (M), and Constrained (C)—that differ in distributional pressure; temperature and top-p$$ p $$ are varied where supported. The study is designed to quantify how prompt-conditioned distributional pressure modulates the tail-risk profile of generated numeric outputs, rather than to assess fidelity to an external biomedical ground-truth distribution. Outliers are flagged using a stabilized MAD–z$$ z $$ rule (zMAD&amp;gt;3$$ {z}_{\mathrm{MAD}}&amp;gt;3 $$), and threshold robustness is summarized by the normalized area under outlier–threshold curves (nAURC). Tail behavior is assessed via complementary diagnostics (exceedances, high quantiles, Moors' kurtosis, and a secondary Pareto-equivalent exceedance index), with uncertainty quantified using pooled binomial aggregation (Wilson/Newcombe intervals), logit-based CIs for nAURC, dominance areas over threshold grids, and random-effects meta-analysis across problems. Three results emerge. (1) Prompt style is the primary driver of extremes: Under our evaluation criteria, Natural prompts yield the most conservative tail-risk profile: they consistently minimize outlier rate and nAURC and produce the lightest tails. The ordering between Mixed and Constrained varies by model, while Constrained often produces heavier tails, as expected under explicit tail instructions. (2) These patterns persist across thresholds and problems: Natural robustly dominates both Mixed and Constrained in robustness-curve dominance area, and meta-analytic gaps in outlier share are consistently positive for C–N and M–N across models. (3) Sampling (temperature/top-p$$ p $$) modulates risk within a fixed (model, prompt) cell: effects are consistently positive for outlier incidence in our temperature contrasts and can be substantial in some settings (notably &lt;span style="font-family:monospace"&gt;gpt-4.1&lt;/span&gt; under Natural prompting), but they do not overturn the qualitative prompt ordering in pooled summaries. Overall, prompt design is the most reliable lever for controlling outliers and heavy-tail risk in LLM-generated numeric data, with sampling parameters providing additional combination-specific control. These conclusions apply most directly to the heavy-tailed biomedical-inspired settings studied here.&lt;/p&gt;</content:encoded>
         <dc:creator>
Andrej Novak, 
Milana Grbić, 
Matej Ivaniček, 
Dragan Matić
</dc:creator>
         <category>RESEARCH ARTICLE</category>
         <dc:title>Prompting Shapes the Statistical Tails of LLM‐Generated Biomedical Data</dc:title>
         <dc:identifier>10.1002/sam.70093</dc:identifier>
         <prism:publicationName>Statistical Analysis and Data Mining: An ASA Data Science Journal</prism:publicationName>
         <prism:doi>10.1002/sam.70093</prism:doi>
         <prism:url>https://onlinelibrary.wiley.com/doi/10.1002/sam.70093?af=R</prism:url>
         <prism:section>RESEARCH ARTICLE</prism:section>
         <prism:volume>19</prism:volume>
         <prism:number>3</prism:number>
      </item>
      <item>
         <link>https://onlinelibrary.wiley.com/doi/10.1002/sam.70092?af=R</link>
         <pubDate>Mon, 01 Jun 2026 06:01:10 -0700</pubDate>
         <dc:date>2026-06-01T06:01:10-07:00</dc:date>
         <source url="https://onlinelibrary.wiley.com/journal/19321872a?af=R">Wiley: Statistical Analysis and Data Mining: An ASA Data Science Journal: 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/sam.70092</guid>
         <title>Mixture‐Based Estimation of Multivariate Data Hypervolume</title>
         <description>Statistical Analysis and Data Mining: An ASA Data Science Journal, Volume 19, Issue 3, June 2026. </description>
         <dc:description>
ABSTRACT
Estimating the hypervolume occupied by multivariate data is a fundamental problem in statistics and data science, with applications ranging from ecology and machine learning to multi‐objective optimization and Bayesian inference. Traditional approaches rely on geometric approximations, kernel density estimation, or convex‐hull constructions, which often suffer from restrictive assumptions or do not scale well in higher dimensions. We introduce a novel methodology for hypervolume estimation based on finite Gaussian mixture models. The proposed approach defines the hypervolume as a high‐probability region of the fitted mixture density and estimates its volume using efficient Monte Carlo techniques, such as Latin hypercube sampling and importance sampling. An automatic, data‐driven procedure selects the density threshold that determines the region over which the hypervolume is computed. Across simulations, the proposed mixture‐based estimator proves broadly applicable and achieves accuracy, flexibility, and computational efficiency equal to or superior to those of existing methods. Applications to anomaly detection and ecological niche estimation illustrate the method's practical utility and interpretability in complex multivariate settings.
</dc:description>
         <content:encoded>
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;Estimating the hypervolume occupied by multivariate data is a fundamental problem in statistics and data science, with applications ranging from ecology and machine learning to multi-objective optimization and Bayesian inference. Traditional approaches rely on geometric approximations, kernel density estimation, or convex-hull constructions, which often suffer from restrictive assumptions or do not scale well in higher dimensions. We introduce a novel methodology for hypervolume estimation based on finite Gaussian mixture models. The proposed approach defines the hypervolume as a high-probability region of the fitted mixture density and estimates its volume using efficient Monte Carlo techniques, such as Latin hypercube sampling and importance sampling. An automatic, data-driven procedure selects the density threshold that determines the region over which the hypervolume is computed. Across simulations, the proposed mixture-based estimator proves broadly applicable and achieves accuracy, flexibility, and computational efficiency equal to or superior to those of existing methods. Applications to anomaly detection and ecological niche estimation illustrate the method's practical utility and interpretability in complex multivariate settings.&lt;/p&gt;</content:encoded>
         <dc:creator>
Luca Scrucca
</dc:creator>
         <category>RESEARCH ARTICLE</category>
         <dc:title>Mixture‐Based Estimation of Multivariate Data Hypervolume</dc:title>
         <dc:identifier>10.1002/sam.70092</dc:identifier>
         <prism:publicationName>Statistical Analysis and Data Mining: An ASA Data Science Journal</prism:publicationName>
         <prism:doi>10.1002/sam.70092</prism:doi>
         <prism:url>https://onlinelibrary.wiley.com/doi/10.1002/sam.70092?af=R</prism:url>
         <prism:section>RESEARCH ARTICLE</prism:section>
         <prism:volume>19</prism:volume>
         <prism:number>3</prism:number>
      </item>
      <item>
         <link>https://onlinelibrary.wiley.com/doi/10.1002/sam.70077?af=R</link>
         <pubDate>Fri, 29 May 2026 08:40:24 -0700</pubDate>
         <dc:date>2026-05-29T08:40:24-07:00</dc:date>
         <source url="https://onlinelibrary.wiley.com/journal/19321872a?af=R">Wiley: Statistical Analysis and Data Mining: An ASA Data Science Journal: 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/sam.70077</guid>
         <title>Pattern Matching for Multivariate Time Series Forecasting</title>
         <description>Statistical Analysis and Data Mining: An ASA Data Science Journal, Volume 19, Issue 3, June 2026. </description>
         <dc:description>
ABSTRACT
This article presents a new approach to multivariate time series forecasting. While most existing techniques in the literature focus on forecasting a single time series, forecasting multiple time series is a common goal in many applications. To deal with this, we introduce a new method, Weighted Nearest Neighbors for multivariate time series (WNNmulti). This method forecasts the future of a given series by identifying similar patterns not only in its own past but also in the past of related time series. Once the k nearest neighbors are identified, forecasts are made by averaging their future values. We evaluate the proposed approach on several real‐world datasets and compare its performance against state‐of‐the‐art forecasting techniques. The results demonstrate that our method achieves comparable or significantly improved performance, showcasing its effectiveness.
</dc:description>
         <content:encoded>
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;This article presents a new approach to multivariate time series forecasting. While most existing techniques in the literature focus on forecasting a single time series, forecasting multiple time series is a common goal in many applications. To deal with this, we introduce a new method, Weighted Nearest Neighbors for multivariate time series (WNN&lt;sub&gt;multi&lt;/sub&gt;). This method forecasts the future of a given series by identifying similar patterns not only in its own past but also in the past of related time series. Once the &lt;i&gt;k&lt;/i&gt; nearest neighbors are identified, forecasts are made by averaging their future values. We evaluate the proposed approach on several real-world datasets and compare its performance against state-of-the-art forecasting techniques. The results demonstrate that our method achieves comparable or significantly improved performance, showcasing its effectiveness.&lt;/p&gt;</content:encoded>
         <dc:creator>
Noé Lebreton, 
Julien Ah‐Pine, 
Julien Jacques, 
Matthieu Neveu
</dc:creator>
         <category>RESEARCH ARTICLE</category>
         <dc:title>Pattern Matching for Multivariate Time Series Forecasting</dc:title>
         <dc:identifier>10.1002/sam.70077</dc:identifier>
         <prism:publicationName>Statistical Analysis and Data Mining: An ASA Data Science Journal</prism:publicationName>
         <prism:doi>10.1002/sam.70077</prism:doi>
         <prism:url>https://onlinelibrary.wiley.com/doi/10.1002/sam.70077?af=R</prism:url>
         <prism:section>RESEARCH ARTICLE</prism:section>
         <prism:volume>19</prism:volume>
         <prism:number>3</prism:number>
      </item>
      <item>
         <link>https://onlinelibrary.wiley.com/doi/10.1002/sam.70091?af=R</link>
         <pubDate>Fri, 29 May 2026 08:37:41 -0700</pubDate>
         <dc:date>2026-05-29T08:37:41-07:00</dc:date>
         <source url="https://onlinelibrary.wiley.com/journal/19321872a?af=R">Wiley: Statistical Analysis and Data Mining: An ASA Data Science Journal: 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/sam.70091</guid>
         <title>Wasserstein Regression, Forecasting, and Change‐Point Detection for Daily Traffic Flow Distributions</title>
         <description>Statistical Analysis and Data Mining: An ASA Data Science Journal, Volume 19, Issue 3, June 2026. </description>
         <dc:description>
ABSTRACT
We develop a distribution‐valued framework for modeling, forecasting, and monitoring traffic flow counts by treating each day as a probability distribution summarized by jittered empirical quantile signatures. Inference is conducted under the 2‐Wasserstein geometry, which in one dimension is isometric to the L2(0,1)$$ {L}^2\left(0,1\right) $$ metric on quantile functions. This representation preserves the empirical distribution of within‐day traffic intensities beyond mean aggregation while deliberately abstracting away from the chronological ordering of the intraday curve. We introduce Wasserstein‐based distributional regression, one‐step‐ahead forecasting, and a Wasserstein CUSUM statistic for change‐point detection and localization. Our theory provides finite‐sample and asymptotic guarantees under the two‐stage sampling structure of traffic data, with error bounds that separate the roles of the number of days T$$ T $$ and the within‐day resolution m$$ m $$. Simulations show competitive performance under location shifts and substantial gains under dispersion or shape changes. An analysis of publicly available interstate traffic volumes illustrates quantile‐dependent covariate effects and interpretable regime changes via quantile‐shift diagnostics.
</dc:description>
         <content:encoded>
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;We develop a distribution-valued framework for modeling, forecasting, and monitoring traffic flow counts by treating each day as a probability distribution summarized by jittered empirical quantile signatures. Inference is conducted under the 2-Wasserstein geometry, which in one dimension is isometric to the L2(0,1)$$ {L}^2\left(0,1\right) $$ metric on quantile functions. This representation preserves the empirical distribution of within-day traffic intensities beyond mean aggregation while deliberately abstracting away from the chronological ordering of the intraday curve. We introduce Wasserstein-based distributional regression, one-step-ahead forecasting, and a Wasserstein CUSUM statistic for change-point detection and localization. Our theory provides finite-sample and asymptotic guarantees under the two-stage sampling structure of traffic data, with error bounds that separate the roles of the number of days T$$ T $$ and the within-day resolution m$$ m $$. Simulations show competitive performance under location shifts and substantial gains under dispersion or shape changes. An analysis of publicly available interstate traffic volumes illustrates quantile-dependent covariate effects and interpretable regime changes via quantile-shift diagnostics.&lt;/p&gt;</content:encoded>
         <dc:creator>
Abdolnasser Sadeghkhani
</dc:creator>
         <category>RESEARCH ARTICLE</category>
         <dc:title>Wasserstein Regression, Forecasting, and Change‐Point Detection for Daily Traffic Flow Distributions</dc:title>
         <dc:identifier>10.1002/sam.70091</dc:identifier>
         <prism:publicationName>Statistical Analysis and Data Mining: An ASA Data Science Journal</prism:publicationName>
         <prism:doi>10.1002/sam.70091</prism:doi>
         <prism:url>https://onlinelibrary.wiley.com/doi/10.1002/sam.70091?af=R</prism:url>
         <prism:section>RESEARCH ARTICLE</prism:section>
         <prism:volume>19</prism:volume>
         <prism:number>3</prism:number>
      </item>
      <item>
         <link>https://onlinelibrary.wiley.com/doi/10.1002/sam.70090?af=R</link>
         <pubDate>Fri, 29 May 2026 08:30:27 -0700</pubDate>
         <dc:date>2026-05-29T08:30:27-07:00</dc:date>
         <source url="https://onlinelibrary.wiley.com/journal/19321872a?af=R">Wiley: Statistical Analysis and Data Mining: An ASA Data Science Journal: 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/sam.70090</guid>
         <title>Matrix‐Variate Skew Normal Distribution: Properties and Estimation</title>
         <description>Statistical Analysis and Data Mining: An ASA Data Science Journal, Volume 19, Issue 3, June 2026. </description>
         <dc:description>
ABSTRACT
In this article, we introduce a matrix‐variate skew normal distribution and its extended version for modeling asymmetric matrix‐valued data. We investigate the main theoretical properties of these models and develop an EM‐type algorithm for maximum likelihood estimation. The proposed methodology is assessed through simulation studies and illustrated with an application to historical Dow Jones dividend data, highlighting its practical relevance for modeling asymmetric dependence structures.
</dc:description>
         <content:encoded>
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;In this article, we introduce a matrix-variate skew normal distribution and its extended version for modeling asymmetric matrix-valued data. We investigate the main theoretical properties of these models and develop an EM-type algorithm for maximum likelihood estimation. The proposed methodology is assessed through simulation studies and illustrated with an application to historical Dow Jones dividend data, highlighting its practical relevance for modeling asymmetric dependence structures.&lt;/p&gt;</content:encoded>
         <dc:creator>
Atila P. Correia, 
Carlos A. R. Diniz, 
Victor H. Lachos
</dc:creator>
         <category>RESEARCH ARTICLE</category>
         <dc:title>Matrix‐Variate Skew Normal Distribution: Properties and Estimation</dc:title>
         <dc:identifier>10.1002/sam.70090</dc:identifier>
         <prism:publicationName>Statistical Analysis and Data Mining: An ASA Data Science Journal</prism:publicationName>
         <prism:doi>10.1002/sam.70090</prism:doi>
         <prism:url>https://onlinelibrary.wiley.com/doi/10.1002/sam.70090?af=R</prism:url>
         <prism:section>RESEARCH ARTICLE</prism:section>
         <prism:volume>19</prism:volume>
         <prism:number>3</prism:number>
      </item>
      <item>
         <link>https://onlinelibrary.wiley.com/doi/10.1002/sam.70075?af=R</link>
         <pubDate>Fri, 15 May 2026 00:54:10 -0700</pubDate>
         <dc:date>2026-05-15T12:54:10-07:00</dc:date>
         <source url="https://onlinelibrary.wiley.com/journal/19321872a?af=R">Wiley: Statistical Analysis and Data Mining: An ASA Data Science Journal: 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/sam.70075</guid>
         <title>BOST‐LAWS: A Bayesian Online Spatio‐Temporal Prediction Framework With Likelihood‐Adjusted Weighted Smoothing for Disease Surveillance</title>
         <description>Statistical Analysis and Data Mining: An ASA Data Science Journal, Volume 19, Issue 3, June 2026. </description>
         <dc:description>
ABSTRACT
Accurate prediction of disease transmission is challenged by its dynamic nature, influenced by factors such as population density. This study introduces a novel approach that enhances predictions of disease surveillance data by integrating likelihood weighting into the integrated nested Laplace approximation (INLA) framework, specifically tailored to account for population density within a spatiotemporal Bayesian methodology. Our method prioritizes recent information for non‐stationary outbreak time series online prediction by employing calibrated discounting on historical data through weight adjustments on their likelihoods. Empirical analysis of real COVID‐19 daily case count data from Massachusetts counties demonstrates the effectiveness of this approach, revealing improved prediction accuracy compared to existing methods. The INLA‐based method with weighted smoothing offers a promising avenue for enhancing infectious disease forecasting models, with significant potential applications in public health decision‐making and resource allocation.
</dc:description>
         <content:encoded>
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;Accurate prediction of disease transmission is challenged by its dynamic nature, influenced by factors such as population density. This study introduces a novel approach that enhances predictions of disease surveillance data by integrating likelihood weighting into the integrated nested Laplace approximation (INLA) framework, specifically tailored to account for population density within a spatiotemporal Bayesian methodology. Our method prioritizes recent information for non-stationary outbreak time series online prediction by employing calibrated discounting on historical data through weight adjustments on their likelihoods. Empirical analysis of real COVID-19 daily case count data from Massachusetts counties demonstrates the effectiveness of this approach, revealing improved prediction accuracy compared to existing methods. The INLA-based method with weighted smoothing offers a promising avenue for enhancing infectious disease forecasting models, with significant potential applications in public health decision-making and resource allocation.&lt;/p&gt;</content:encoded>
         <dc:creator>
I. M. L. Nadeesha Jayaweera, 
Yanzhao Wang, 
Jian Zou
</dc:creator>
         <category>RESEARCH ARTICLE</category>
         <dc:title>BOST‐LAWS: A Bayesian Online Spatio‐Temporal Prediction Framework With Likelihood‐Adjusted Weighted Smoothing for Disease Surveillance</dc:title>
         <dc:identifier>10.1002/sam.70075</dc:identifier>
         <prism:publicationName>Statistical Analysis and Data Mining: An ASA Data Science Journal</prism:publicationName>
         <prism:doi>10.1002/sam.70075</prism:doi>
         <prism:url>https://onlinelibrary.wiley.com/doi/10.1002/sam.70075?af=R</prism:url>
         <prism:section>RESEARCH ARTICLE</prism:section>
         <prism:volume>19</prism:volume>
         <prism:number>3</prism:number>
      </item>
      <item>
         <link>https://onlinelibrary.wiley.com/doi/10.1002/sam.70085?af=R</link>
         <pubDate>Tue, 12 May 2026 00:00:00 -0700</pubDate>
         <dc:date>2026-05-12T12:00:00-07:00</dc:date>
         <source url="https://onlinelibrary.wiley.com/journal/19321872a?af=R">Wiley: Statistical Analysis and Data Mining: An ASA Data Science Journal: 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/sam.70085</guid>
         <title>STEC‐Net: A Spatiotemporal Graph Neural Framework for Community Discovery in Dynamic Social Networks</title>
         <description>Statistical Analysis and Data Mining: An ASA Data Science Journal, Volume 19, Issue 3, June 2026. </description>
         <dc:description>
ABSTRACT
Community discovery is a central problem in the analysis of dynamic social networks. Traditional community discovery methods mainly focus on the formation and dissolution of links between nodes, and therefore often fail to capture the richer spatial structure and temporal dependency underlying network evolution. To address this limitation, we propose STEC‐Net, a spatiotemporal graph neural framework for community discovery in dynamic social networks. STEC‐Net integrates spatial structure and temporal dynamics within a unified embedding architecture. First, Graph Convolutional Networks (GCNs) are used to learn snapshot‐level node representations from network topology. To adapt the spatial encoder to structural evolution, a GRU‐based weight evolution mechanism is introduced to update the GCN parameters over time. Then, a second Gated Recurrent Unit (GRU) is employed to model temporal dependencies across snapshot embeddings and to learn spatiotemporal node representations. Finally, a Self‐Organizing Map (SOM) is applied to the learned embeddings to cluster nodes and infer their community affiliations. Experiments on four types of dynamic networks show that STEC‐Net consistently outperforms traditional community discovery methods in terms of purity, normalized mutual information, homogeneity, and completeness. These results demonstrate that STEC‐Net can effectively uncover evolving community structures in dynamic social networks.
</dc:description>
         <content:encoded>
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;Community discovery is a central problem in the analysis of dynamic social networks. Traditional community discovery methods mainly focus on the formation and dissolution of links between nodes, and therefore often fail to capture the richer spatial structure and temporal dependency underlying network evolution. To address this limitation, we propose STEC-Net, a spatiotemporal graph neural framework for community discovery in dynamic social networks. STEC-Net integrates spatial structure and temporal dynamics within a unified embedding architecture. First, Graph Convolutional Networks (GCNs) are used to learn snapshot-level node representations from network topology. To adapt the spatial encoder to structural evolution, a GRU-based weight evolution mechanism is introduced to update the GCN parameters over time. Then, a second Gated Recurrent Unit (GRU) is employed to model temporal dependencies across snapshot embeddings and to learn spatiotemporal node representations. Finally, a Self-Organizing Map (SOM) is applied to the learned embeddings to cluster nodes and infer their community affiliations. Experiments on four types of dynamic networks show that STEC-Net consistently outperforms traditional community discovery methods in terms of purity, normalized mutual information, homogeneity, and completeness. These results demonstrate that STEC-Net can effectively uncover evolving community structures in dynamic social networks.&lt;/p&gt;</content:encoded>
         <dc:creator>
Yingnan Xu, 
Shuangshuang Chu
</dc:creator>
         <category>RESEARCH ARTICLE</category>
         <dc:title>STEC‐Net: A Spatiotemporal Graph Neural Framework for Community Discovery in Dynamic Social Networks</dc:title>
         <dc:identifier>10.1002/sam.70085</dc:identifier>
         <prism:publicationName>Statistical Analysis and Data Mining: An ASA Data Science Journal</prism:publicationName>
         <prism:doi>10.1002/sam.70085</prism:doi>
         <prism:url>https://onlinelibrary.wiley.com/doi/10.1002/sam.70085?af=R</prism:url>
         <prism:section>RESEARCH ARTICLE</prism:section>
         <prism:volume>19</prism:volume>
         <prism:number>3</prism:number>
      </item>
      <item>
         <link>https://onlinelibrary.wiley.com/doi/10.1002/sam.70084?af=R</link>
         <pubDate>Sun, 10 May 2026 20:32:29 -0700</pubDate>
         <dc:date>2026-05-10T08:32:29-07:00</dc:date>
         <source url="https://onlinelibrary.wiley.com/journal/19321872a?af=R">Wiley: Statistical Analysis and Data Mining: An ASA Data Science Journal: 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/sam.70084</guid>
         <title>Unsupervised Time‐Event Probabilistic Classification Using Large Panels of Time Series</title>
         <description>Statistical Analysis and Data Mining: An ASA Data Science Journal, Volume 19, Issue 3, June 2026. </description>
         <dc:description>
ABSTRACT
This study presents a framework to perform unsupervised time‐event probabilistic classification using time series data of large cross‐sectional dimension. These datasets often exhibit complexities such as non‐linearities, structural breaks, asynchronicity, missing data, and outliers; which hampers their analysis and modeling. To address these challenges, the proposed approach integrates symbolic analysis, compositional data analysis, and Markov‐switching time series modeling into a unified methodology. A Monte Carlo simulation study demonstrates the robustness of the method in various challenging scenarios. The practical applicability of the framework is illustrated through two economic case studies: (i) identifying recurrent recession and expansion regimes in the US economy using state‐level data, and (ii) detecting breakpoints in high‐volatility episodes in the US stock market using data from all assets in the S&amp;P 500 index.
</dc:description>
         <content:encoded>
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;This study presents a framework to perform unsupervised time-event probabilistic classification using time series data of large cross-sectional dimension. These datasets often exhibit complexities such as non-linearities, structural breaks, asynchronicity, missing data, and outliers; which hampers their analysis and modeling. To address these challenges, the proposed approach integrates symbolic analysis, compositional data analysis, and Markov-switching time series modeling into a unified methodology. A Monte Carlo simulation study demonstrates the robustness of the method in various challenging scenarios. The practical applicability of the framework is illustrated through two economic case studies: (i) identifying recurrent recession and expansion regimes in the US economy using state-level data, and (ii) detecting breakpoints in high-volatility episodes in the US stock market using data from all assets in the S&amp;amp;P 500 index.&lt;/p&gt;</content:encoded>
         <dc:creator>
Máximo Camacho, 
Javier Palarea‐Albaladejo, 
Manuel Ruiz Marín
</dc:creator>
         <category>RESEARCH ARTICLE</category>
         <dc:title>Unsupervised Time‐Event Probabilistic Classification Using Large Panels of Time Series</dc:title>
         <dc:identifier>10.1002/sam.70084</dc:identifier>
         <prism:publicationName>Statistical Analysis and Data Mining: An ASA Data Science Journal</prism:publicationName>
         <prism:doi>10.1002/sam.70084</prism:doi>
         <prism:url>https://onlinelibrary.wiley.com/doi/10.1002/sam.70084?af=R</prism:url>
         <prism:section>RESEARCH ARTICLE</prism:section>
         <prism:volume>19</prism:volume>
         <prism:number>3</prism:number>
      </item>
      <item>
         <link>https://onlinelibrary.wiley.com/doi/10.1002/sam.70080?af=R</link>
         <pubDate>Tue, 05 May 2026 02:02:47 -0700</pubDate>
         <dc:date>2026-05-05T02:02:47-07:00</dc:date>
         <source url="https://onlinelibrary.wiley.com/journal/19321872a?af=R">Wiley: Statistical Analysis and Data Mining: An ASA Data Science Journal: 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/sam.70080</guid>
         <title>Wavelet‐Based Single‐Index Additive Models With Irregular Link and Additive Functions</title>
         <description>Statistical Analysis and Data Mining: An ASA Data Science Journal, Volume 19, Issue 3, June 2026. </description>
         <dc:description>
ABSTRACT
Because of the complexity of data sets in practice, there has been much interest in developing statistical analysis tools for problems involving high‐dimensional covariates. Examples of these models include partial linear additive models (PLAMs) and single‐index models (SIMs). A common feature of these models is that they achieve dimension reduction to circumvent the “curse of dimensionality” while retaining the flexibility of the nonparametric regression. In the statistical and machine learning literature, fitting the additive parts in PLAM models and the link function in SIM models by nonparametric methods usually requires smooth additive components and regular link functions, and it is usually achieved using kernel methods or spline smoothing. In this work, we present a novel intrinsically interpretable combination of these two models with competitive predictive performance. We relax the smoothness assumptions and develop a nonparametric estimation procedure of the additive components and the link function that uses wavelet bases expansions adapted to non‐equispaced designs. Simulation studies and real data analyses are employed to demonstrate the usefulness of the approach. Computer codes are provided as Supporting Information.
</dc:description>
         <content:encoded>
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;Because of the complexity of data sets in practice, there has been much interest in developing statistical analysis tools for problems involving high-dimensional covariates. Examples of these models include partial linear additive models (PLAMs) and single-index models (SIMs). A common feature of these models is that they achieve dimension reduction to circumvent the “curse of dimensionality” while retaining the flexibility of the nonparametric regression. In the statistical and machine learning literature, fitting the additive parts in PLAM models and the link function in SIM models by nonparametric methods usually requires smooth additive components and regular link functions, and it is usually achieved using kernel methods or spline smoothing. In this work, we present a novel intrinsically interpretable combination of these two models with competitive predictive performance. We relax the smoothness assumptions and develop a nonparametric estimation procedure of the additive components and the link function that uses wavelet bases expansions adapted to non-equispaced designs. Simulation studies and real data analyses are employed to demonstrate the usefulness of the approach. Computer codes are provided as &lt;a href="#sam70080-supitem-0001"&gt;Supporting Information&lt;/a&gt;.&lt;/p&gt;</content:encoded>
         <dc:creator>
Anestis Antoniadis, 
Umberto Amato, 
Italia De Feis, 
Irène Gijbels
</dc:creator>
         <category>RESEARCH ARTICLE</category>
         <dc:title>Wavelet‐Based Single‐Index Additive Models With Irregular Link and Additive Functions</dc:title>
         <dc:identifier>10.1002/sam.70080</dc:identifier>
         <prism:publicationName>Statistical Analysis and Data Mining: An ASA Data Science Journal</prism:publicationName>
         <prism:doi>10.1002/sam.70080</prism:doi>
         <prism:url>https://onlinelibrary.wiley.com/doi/10.1002/sam.70080?af=R</prism:url>
         <prism:section>RESEARCH ARTICLE</prism:section>
         <prism:volume>19</prism:volume>
         <prism:number>3</prism:number>
      </item>
      <item>
         <link>https://onlinelibrary.wiley.com/doi/10.1002/sam.70082?af=R</link>
         <pubDate>Sun, 03 May 2026 22:47:31 -0700</pubDate>
         <dc:date>2026-05-03T10:47:31-07:00</dc:date>
         <source url="https://onlinelibrary.wiley.com/journal/19321872a?af=R">Wiley: Statistical Analysis and Data Mining: An ASA Data Science Journal: 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/sam.70082</guid>
         <title>Causal Mediation Analysis With Latent Subgroups for Survival Model</title>
         <description>Statistical Analysis and Data Mining: An ASA Data Science Journal, Volume 19, Issue 3, June 2026. </description>
         <dc:description>
ABSTRACT
Causal mediation analysis is an effective method for understanding the mechanism between the exposure and the outcome, often assuming that the mediation model is consistent for each individual in the target population. In practice, however, the natural indirect effect (NIE) may vary across individuals due to their distinct characteristics. As a result, the population can be partitioned into subgroups according to the varying sizes of the NIEs. Distinguishing subgroups within the study population enables the development of more precise and targeted treatment strategies. In this paper, we propose an identifiable mixture mediation model with latent subgroups for the survival data, where the outcome follows an accelerated failure time model and the mediator is Gaussian distributed. We further employ three information criteria including the AIC, BIC, and singular BIC (sBIC) to select the number of subgroups, followed by the expectation–maximization (EM) algorithm to estimate the model parameters and NIEs. Simulation study shows that the sBIC is the most robust and efficient criterion for selecting the number of subgroups; therefore, we recommend the sBIC‐EM algorithm for practical use. Lastly, we apply our algorithm to the lung cancer data and discover two latent groups with opposing NIEs.
</dc:description>
         <content:encoded>
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;Causal mediation analysis is an effective method for understanding the mechanism between the exposure and the outcome, often assuming that the mediation model is consistent for each individual in the target population. In practice, however, the natural indirect effect (NIE) may vary across individuals due to their distinct characteristics. As a result, the population can be partitioned into subgroups according to the varying sizes of the NIEs. Distinguishing subgroups within the study population enables the development of more precise and targeted treatment strategies. In this paper, we propose an identifiable mixture mediation model with latent subgroups for the survival data, where the outcome follows an accelerated failure time model and the mediator is Gaussian distributed. We further employ three information criteria including the AIC, BIC, and singular BIC (sBIC) to select the number of subgroups, followed by the expectation–maximization (EM) algorithm to estimate the model parameters and NIEs. Simulation study shows that the sBIC is the most robust and efficient criterion for selecting the number of subgroups; therefore, we recommend the sBIC-EM algorithm for practical use. Lastly, we apply our algorithm to the lung cancer data and discover two latent groups with opposing NIEs.&lt;/p&gt;</content:encoded>
         <dc:creator>
Yerong Sun, 
Yuejin Zhou, 
Tao Hu, 
Tiejun Tong, 
WenWu Wang
</dc:creator>
         <category>RESEARCH ARTICLE</category>
         <dc:title>Causal Mediation Analysis With Latent Subgroups for Survival Model</dc:title>
         <dc:identifier>10.1002/sam.70082</dc:identifier>
         <prism:publicationName>Statistical Analysis and Data Mining: An ASA Data Science Journal</prism:publicationName>
         <prism:doi>10.1002/sam.70082</prism:doi>
         <prism:url>https://onlinelibrary.wiley.com/doi/10.1002/sam.70082?af=R</prism:url>
         <prism:section>RESEARCH ARTICLE</prism:section>
         <prism:volume>19</prism:volume>
         <prism:number>3</prism:number>
      </item>
      <item>
         <link>https://onlinelibrary.wiley.com/doi/10.1002/sam.70079?af=R</link>
         <pubDate>Sun, 03 May 2026 22:32:09 -0700</pubDate>
         <dc:date>2026-05-03T10:32:09-07:00</dc:date>
         <source url="https://onlinelibrary.wiley.com/journal/19321872a?af=R">Wiley: Statistical Analysis and Data Mining: An ASA Data Science Journal: 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/sam.70079</guid>
         <title>New Robust M‐Estimator for Random‐Coefficients Panel Data Model: Algorithms, Simulation, and Application to Insurance Data</title>
         <description>Statistical Analysis and Data Mining: An ASA Data Science Journal, Volume 19, Issue 3, June 2026. </description>
         <dc:description>
ABSTRACT
This paper proposes a new class of M‐estimators based on an innovative objective function that provides highly robust and efficient estimates. The resulting estimator, referred to as the robust AKY estimator, is introduced as an alternative to the random coefficient regression (RCR) estimator in the presence of outliers. The results show that, for normal and clean data, the proposed robust AKY estimator performs almost as well as the RCR estimator. However, it demonstrates significantly greater resistance to outliers when applied to contaminated datasets within the random coefficients panel data (RCPD) model. To evaluate its performance, a Monte Carlo simulation study was conducted under various data‐generation scenarios with different levels of outlier contamination. The results were compared with those of the non‐robust RCR estimator and several existing robust M‐estimators, including Huber, Hampel, Andrew, and Bisquare. In addition, the proposed robust AKY estimator was evaluated using a real insurance dataset. The findings from both the simulation study and the empirical application indicate that the robust estimators (Huber, Hampel, Andrew, Bisquare, and AKY) outperform the RCR estimator in the presence of outliers in the RCPD model. Moreover, the proposed robust AKY estimator is more efficient than the other robust M‐estimators.
</dc:description>
         <content:encoded>
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;This paper proposes a new class of M-estimators based on an innovative objective function that provides highly robust and efficient estimates. The resulting estimator, referred to as the robust AKY estimator, is introduced as an alternative to the random coefficient regression (RCR) estimator in the presence of outliers. The results show that, for normal and clean data, the proposed robust AKY estimator performs almost as well as the RCR estimator. However, it demonstrates significantly greater resistance to outliers when applied to contaminated datasets within the random coefficients panel data (RCPD) model. To evaluate its performance, a Monte Carlo simulation study was conducted under various data-generation scenarios with different levels of outlier contamination. The results were compared with those of the non-robust RCR estimator and several existing robust M-estimators, including Huber, Hampel, Andrew, and Bisquare. In addition, the proposed robust AKY estimator was evaluated using a real insurance dataset. The findings from both the simulation study and the empirical application indicate that the robust estimators (Huber, Hampel, Andrew, Bisquare, and AKY) outperform the RCR estimator in the presence of outliers in the RCPD model. Moreover, the proposed robust AKY estimator is more efficient than the other robust M-estimators.&lt;/p&gt;</content:encoded>
         <dc:creator>
Mohamed R. Abonazel, 
Amr R. Kamel, 
Ahmed H. Youssef
</dc:creator>
         <category>RESEARCH ARTICLE</category>
         <dc:title>New Robust M‐Estimator for Random‐Coefficients Panel Data Model: Algorithms, Simulation, and Application to Insurance Data</dc:title>
         <dc:identifier>10.1002/sam.70079</dc:identifier>
         <prism:publicationName>Statistical Analysis and Data Mining: An ASA Data Science Journal</prism:publicationName>
         <prism:doi>10.1002/sam.70079</prism:doi>
         <prism:url>https://onlinelibrary.wiley.com/doi/10.1002/sam.70079?af=R</prism:url>
         <prism:section>RESEARCH ARTICLE</prism:section>
         <prism:volume>19</prism:volume>
         <prism:number>3</prism:number>
      </item>
      <item>
         <link>https://onlinelibrary.wiley.com/doi/10.1002/sam.70083?af=R</link>
         <pubDate>Tue, 28 Apr 2026 23:37:46 -0700</pubDate>
         <dc:date>2026-04-28T11:37:46-07:00</dc:date>
         <source url="https://onlinelibrary.wiley.com/journal/19321872a?af=R">Wiley: Statistical Analysis and Data Mining: An ASA Data Science Journal: 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/sam.70083</guid>
         <title>Issue Information</title>
         <description>Statistical Analysis and Data Mining: An ASA Data Science Journal, Volume 19, Issue 3, June 2026. </description>
         <dc:description/>
         <content:encoded/>
         <dc:creator/>
         <category>ISSUE INFORMATION</category>
         <dc:title>Issue Information</dc:title>
         <dc:identifier>10.1002/sam.70083</dc:identifier>
         <prism:publicationName>Statistical Analysis and Data Mining: An ASA Data Science Journal</prism:publicationName>
         <prism:doi>10.1002/sam.70083</prism:doi>
         <prism:url>https://onlinelibrary.wiley.com/doi/10.1002/sam.70083?af=R</prism:url>
         <prism:section>ISSUE INFORMATION</prism:section>
         <prism:volume>19</prism:volume>
         <prism:number>3</prism:number>
      </item>
      <item>
         <link>https://onlinelibrary.wiley.com/doi/10.1002/sam.70074?af=R</link>
         <pubDate>Tue, 28 Apr 2026 23:37:06 -0700</pubDate>
         <dc:date>2026-04-28T11:37:06-07:00</dc:date>
         <source url="https://onlinelibrary.wiley.com/journal/19321872a?af=R">Wiley: Statistical Analysis and Data Mining: An ASA Data Science Journal: 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/sam.70074</guid>
         <title>Bayesian Dirichlet Process Copula Mixtures for Heterogeneous Multi‐Cluster Data: Methods and an NBA Player Stats Application</title>
         <description>Statistical Analysis and Data Mining: An ASA Data Science Journal, Volume 19, Issue 3, June 2026. </description>
         <dc:description>
ABSTRACT
We propose an approach for fitting multi‐cluster data using copula‐based Dirichlet process mixture models (DPM). Unlike conventional finite mixture models, our framework uses Sklar's theorem to accommodate heterogeneous marginal distributions and complex inter‐variable dependencies. We adopt a slice‐sampling MCMC scheme to enable full Bayesian inference, which makes the posterior distribution on the number of clusters and the cluster‐specific copula parameters simultaneously available. Simulation studies show that this DPM‐copula approach can accurately capture and recover heavy‐tailed or skewed clusters, while the Gaussian mixture model cannot. We apply our method to real NBA player‐level advanced statistics from the 2021–2024 seasons, demonstrating how the model discovers distinct subgroups that exhibit different correlation structures and marginal shapes. These insights show the advantages of a flexible, copula‐based approach for multi‐cluster data analysis in sports analytics and beyond.
</dc:description>
         <content:encoded>
&lt;h2&gt;ABSTRACT&lt;/h2&gt;
&lt;p&gt;We propose an approach for fitting multi-cluster data using copula-based Dirichlet process mixture models (DPM). Unlike conventional finite mixture models, our framework uses Sklar's theorem to accommodate heterogeneous marginal distributions and complex inter-variable dependencies. We adopt a slice-sampling MCMC scheme to enable full Bayesian inference, which makes the posterior distribution on the number of clusters and the cluster-specific copula parameters simultaneously available. Simulation studies show that this DPM-copula approach can accurately capture and recover heavy-tailed or skewed clusters, while the Gaussian mixture model cannot. We apply our method to real NBA player-level advanced statistics from the 2021–2024 seasons, demonstrating how the model discovers distinct subgroups that exhibit different correlation structures and marginal shapes. These insights show the advantages of a flexible, copula-based approach for multi-cluster data analysis in sports analytics and beyond.&lt;/p&gt;</content:encoded>
         <dc:creator>
Yujian Liu, 
Siyi Yu
</dc:creator>
         <category>RESEARCH ARTICLE</category>
         <dc:title>Bayesian Dirichlet Process Copula Mixtures for Heterogeneous Multi‐Cluster Data: Methods and an NBA Player Stats Application</dc:title>
         <dc:identifier>10.1002/sam.70074</dc:identifier>
         <prism:publicationName>Statistical Analysis and Data Mining: An ASA Data Science Journal</prism:publicationName>
         <prism:doi>10.1002/sam.70074</prism:doi>
         <prism:url>https://onlinelibrary.wiley.com/doi/10.1002/sam.70074?af=R</prism:url>
         <prism:section>RESEARCH ARTICLE</prism:section>
         <prism:volume>19</prism:volume>
         <prism:number>3</prism:number>
      </item>
   </channel>
</rss>
