Search
Search Results
-
Interpretability via Random Forests
Although there is no consensus on a precise definition of interpretability, it is possible to identify several requirements: “simplicity, stability,...
-
Matrix-variate Smooth Transition Models for Temporal Networks
In many fields, network analysis is used to investigate complex relationships. The increased availability of temporal network data opens the way to...
-
Testing for linearity in scalar-on-function regression with responses missing at random
A goodness-of-fit test for the Functional Linear Model with Scalar Response (FLMSR) with responses Missing at Random (MAR) is proposed in this paper....
-
Space–Time Extremes of Random Fields
The initial motivation for develo** the methods presented in this chapter was the search for a practical solution to the air gap problem for...
-
Modal clustering of matrix-variate data
The nonparametric formulation of density-based clustering, known as modal clustering, draws a correspondence between groups and the attraction...
-
Parametric Analysis of Tampered Random Variable Model for Multiple Step-Stress Life Test
The tampered random variable (TRV) model for multiple step-stress life testing experiment was proposed by Sultana and Dewanji (Commun Stat Theory...
-
Contamination transformation matrix mixture modeling for skewed data groups with heavy tails and scatter
Model-based clustering is a popular application of the rapidly develo** area of finite mixture modeling. While there is ample work focusing on...
-
A dual subspace parsimonious mixture of matrix normal distributions
We present a parsimonious dual-subspace clustering approach for a mixture of matrix-normal distributions. By assuming certain principal components of...
-
Random networks with heterogeneous reciprocity
Users of social networks display diversified behavior and online habits. For instance, a user’s tendency to reply to a post can depend on the user...
-
A pth-order random coefficients mixed binomial autoregressive process with explanatory variables
To capture the higher-order autocorrelation structure for finite-range integer-valued time series of counts, and to consider the driving effect of...
-
High-Dimensional Clustering via Random Projections
This work addresses the unsupervised classification issue for high-dimensional data by exploiting the general idea of Random Projection Ensemble....
-
Estimating mixed-memberships using the symmetric laplacian inverse matrix
Mixed membership community detection is a challenging problem. In this paper, to detect mixed memberships, we propose a new method Mixed-SLIM which...
-
Eigenvalues of Stochastic Blockmodel Graphs and Random Graphs with Low-Rank Edge Probability Matrices
We derive the limiting distribution for the outlier eigenvalues of the adjacency matrix for random graphs with independent edges whose edge...
-
-
Simulation comparisons between Bayesian and de-biased estimators in low-rank matrix completion
In this paper, we study the low-rank matrix completion problem, a class of machine learning problems, that aims at the prediction of missing entries...
-
Information matrix equivalence in the presence of censoring: a goodness-of-fit test for semiparametric copula models with multivariate survival data
Various goodness-of-fit tests are designed based on the so-called information matrix equivalence : if the assumed model is correctly specified, two...
-
High dimensional T-type Estimator for robust covariance matrix estimation with applications to elliptical factor models
In this paper, a regularized t -type estimator is proposed for high-dimensional scatter matrix estimation, where the number of dimensions p is...
-
A hierarchical clustering method for random intervals based on a similarity measure
A new clustering method for random intervals that are measured in the same units over the same group of individuals is provided. It takes into...
-
Extremes for stationary regularly varying random fields over arbitrary index sets
We consider the clustering of extremes for stationary regularly varying random fields over arbitrary growing index sets. We study sufficient...
