A Robust Information Source Estimator with Sparse Observations [PDF]
In this paper, we consider the problem of locating the information source with sparse observations. We assume that a piece of information spreads in a network following a heterogeneous susceptible-infected-recovered (SIR) model and that a small subset of
Ying, Lei, Zhu, Kai
core +2 more sources
Image Data Augmentation for SAR Sensor via Generative Adversarial Nets
As a mission-critical sensor, SAR has been applied in environmental monitoring and battlefield surveillance; moreover, SAR target recognition is one of the most important applications of SAR technology.
Zongyong Cui +3 more
doaj +1 more source
A feature extraction method for small sample data based on optimal ensemble random forest
High dimensional small sample data is the difficulty of data mining. When using the traditional random forest algorithm for feature selection, it is to have the poor stability and low accuracy of feature importance ranking caused by over fitting of ...
ZHANG Wei, ZHANG Haochen
doaj +1 more source
New statistical high power test, obtained by differentiating random data of a small sample
Background. The research considers the problem of statistical analysis of small samples by synthesizing new statistical criteria. Materials and methods.
A.I. Ivanov +2 more
doaj +1 more source
Maximum Likelihood Estimation for Linear Gaussian Covariance Models [PDF]
We study parameter estimation in linear Gaussian covariance models, which are $p$-dimensional Gaussian models with linear constraints on the covariance matrix.
Richards, Donald +2 more
core +1 more source
Direct kernel biased discriminant analysis: a new content-based image retrieval relevance feedback algorithm [PDF]
In recent years, a variety of relevance feedback (RF) schemes have been developed to improve the performance of content-based image retrieval (CBIR). Given user feedback information, the key to a RF scheme is how to select a subset of image features to ...
Dacheng Tao +6 more
core +2 more sources
String Matching: Communication, Circuits, and Learning [PDF]
String matching is the problem of deciding whether a given n-bit string contains a given k-bit pattern. We study the complexity of this problem in three settings. - Communication complexity. For small k, we provide near-optimal upper and lower bounds on
+3 more
core +2 more sources
Recursive Aggregation of Estimators by Mirror Descent Algorithm with Averaging [PDF]
We consider a recursive algorithm to construct an aggregated estimator from a finite number of base decision rules in the classification problem. The estimator approximately minimizes a convex risk functional under the l1-constraint.
Juditsky, Anatoli +3 more
core +5 more sources
Time Series Data Generation Method with High Reliability Based on ACGAN
In the process of big data processing, especially in fields like industrial fault diagnosis, there is often the issue of small sample sizes. The data generation method based on Generative Adversarial Networks(GANs) is an effective way to solve this ...
Fang Liu, Yuxin Li, Yuanfang Zheng
doaj +1 more source
Route Planning for Military Ground Vehicles in Road Networks under Uncertain Battlefield Environment
Route planning for military ground vehicles in the uncertain battlefield is a special kind of route planning problem, as the military vehicles face a great of uncertain and unpredicted attacks. This paper models these uncertainties in the road network by
Tan Zhao +3 more
doaj +1 more source

