相关论文: A robust, scalable K-statistic for quantifying imm…

Spatial clustering has been widely used for spatial data mining and knowledge discovery. An ideal multivariate spatial clustering should consider both spatial contiguity and aspatial attributes. Existing spatial clustering approaches may…

Multiplex immunofluorescence (mIF) imaging technology facilitates the study of the tumour microenvironment in cancer patients. Due to the capabilities of this emerging bioimaging technique, it is possible to statistically analyse, for…

We introduce the {\it diffusion $K$-means} clustering method on Riemannian submanifolds, which maximizes the within-cluster connectedness based on the diffusion distance. The diffusion $K$-means constructs a random walk on the similarity…

In this paper, a three-dimensional light detection and ranging simultaneous localization and mapping (SLAM) method is proposed that is available for tracking and mapping with 500--1000 Hz processing. The proposed method significantly…

A smooth test to simultaneously compare $K$ copulas, where $K \geq 2$ is proposed. The $K$ observed populations can be paired, and the test statistic is constructed based on the differences between moment sequences, called copula…

Factorizing low-rank matrices is a problem with many applications in machine learning and statistics, ranging from sparse PCA to community detection and sub-matrix localization. For probabilistic models in the Bayes optimal setting, general…

A first proposal of a sparse and cellwise robust PCA method is presented. Robustness to single outlying cells in the data matrix is achieved by substituting the squared loss function for the approximation error by a robust version. The…

We propose a novel SPARsity and Clustering (SPARC) regularizer, which is a modified version of the previous octagonal shrinkage and clustering algorithm for regression (OSCAR), where, the proposed regularizer consists of a $K$-sparse…

Epidemiological investigations of regionally aggregated spatial data often involve detecting spatial health disparities among neighboring regions on a map of disease mortality or incidence rates. Analyzing such data introduces spatial…

With the advance of imaging technology, digital pathology imaging of tumor tissue slides is becoming a routine clinical procedure for cancer diagnosis. This process produces massive imaging data that capture histological details in high…

We consider four main goals when fitting spatial linear models: 1) estimating covariance parameters, 2) estimating fixed effects, 3) kriging (making point predictions), and 4) block-kriging (predicting the average value over a region). Each…

In a cluster-randomized experiment, treatment is assigned to clusters of individual units of interest--households, classrooms, villages, etc.--instead of the units themselves. The number of clusters sampled and the number of units sampled…

The K-subspaces (KSS) method is a generalization of the K-means method for subspace clustering. In this work, we present local convergence analysis and a recovery guarantee for KSS, assuming data are generated by the semi-random union of…

Clustering is widely used in unsupervised learning to find homogeneous groups of observations within a dataset. However, clustering mixed-type data remains a challenge, as few existing approaches are suited for this task. This study…

We quantify the effects of \emph{morphological k-correction} at $1<z<2$ by comparing morphologies measured in the K and I-bands in the COSMOS area. Ks-band data have indeed the advantage of probing old stellar populations for $z<2$,…

Multipath-based simultaneous localization and mapping (MP-SLAM) is a promising approach in wireless networks to jointly obtain position information of transmitters/receivers and information of the propagation environment. MP-SLAM models…

This work develops tools to understand how quantum information spreads, scrambles, and is reshaped by measurements in many-body systems. First, I study scrambling and pseudorandomness in the Brownian Sachdev-Ye-Kitaev (SYK) model,…

Large volumes of spatiotemporal data, characterized by high spatial and temporal variability, may experience structural changes over time. Unlike traditional change-point problems, each sequence in this context consists of function-valued…

We discuss a graph-based approach for testing spatial point patterns. This approach falls under the category of data-random graphs, which have been introduced and used for statistical pattern recognition in recent years. Our goal is to test…

We propose two probability-like measures of individual cluster-membership certainty which can be applied to a hard partition of the sample such as that obtained from the Partitioning Around Medoids (PAM) algorithm, hierarchical clustering…