Zobrazeno 1 - 10
of 146
pro vyhledávání: '"Wang Runmin"'
Publikováno v:
Demonstratio Mathematica, Vol 56, Iss 1, Pp 181-194 (2023)
As a crucial medium of information dissemination, text holds a pivotal role in a multitude of applications. However, text detection in complex and unstructured environments presents significant challenges, such as the presence of cluttered background
Externí odkaz:
https://doaj.org/article/31ca3449ee3f49ab9ebf6e837a6c263a
Sliced inverse regression (SIR, Li 1991) is a pioneering work and the most recognized method in sufficient dimension reduction. While promising progress has been made in theory and methods of high-dimensional SIR, two remaining challenges are still n
Externí odkaz:
http://arxiv.org/abs/2304.06201
Change point testing for high-dimensional data has attracted a lot of attention in statistics and machine learning owing to the emergence of high-dimensional data with structural breaks from many fields. In practice, when the dimension is less than t
Externí odkaz:
http://arxiv.org/abs/2303.10808
In this article, we propose a class of $L_q$-norm based U-statistics for a family of global testing problems related to high-dimensional data. This includes testing of mean vector and its spatial sign, simultaneous testing of linear model coefficient
Externí odkaz:
http://arxiv.org/abs/2303.08197
This paper proposes a new test for a change point in the mean of high-dimensional data based on the spatial sign and self-normalization. The test is easy to implement with no tuning parameters, robust to heavy-tailedness and theoretically justified w
Externí odkaz:
http://arxiv.org/abs/2206.02738
Crowdsourcing is an online outsourcing mode which can solve the current machine learning algorithm's urge need for massive labeled data. Requester posts tasks on crowdsourcing platforms, which employ online workers over the Internet to complete tasks
Externí odkaz:
http://arxiv.org/abs/2204.13065
Due to the advantage of reducing storage while speeding up query time on big heterogeneous data, cross-modal hashing has been extensively studied for approximate nearest neighbor search of multi-modal data. Most hashing methods assume that training d
Externí odkaz:
http://arxiv.org/abs/2111.04086
Cross-modal hashing (CMH) is one of the most promising methods in cross-modal approximate nearest neighbor search. Most CMH solutions ideally assume the labels of training and testing set are identical. However, the assumption is often violated, caus
Externí odkaz:
http://arxiv.org/abs/2111.04080
In this article, we propose a class of test statistics for a change point in the mean of high-dimensional independent data. Our test integrates the U-statistic based approach in a recent work by \cite{hdcp} and the $L_q$-norm based high-dimensional t
Externí odkaz:
http://arxiv.org/abs/2101.12357
In this paper, we propose a class of monitoring statistics for a mean shift in a sequence of high-dimensional observations. Inspired by the recent U-statistic based retrospective tests developed by Wang et al.(2019) and Zhang et al.(2020), we advance
Externí odkaz:
http://arxiv.org/abs/2101.06839