A Fast Optimization Technique for the Regression Estimation of Probability Density of a One-Dimensional Random Variable

A method is proposed for the fast selection of the blurriness coefficient of kernel functions of the regression estimation of probability density of a one-dimensional random variable. Regression estimation of probability density is used in the analysis of large-volume statistical data. Its synthesis is based on compression of the initial information using sampling procedures of the range of values of a random variable and the formation of an array of transformed data. The elements of the resulting data array are the centers of sampling intervals and the corresponding frequencies of random variables from the initial sample. For a fast selection of the blurriness coefficient of kernel functions, the results of studying the asymptotic properties of the regression estimation of probability density are used. A method for estimating the components of the optimal blurriness coefficient is proposed. The method of computational experiment is used to analyze the effectiveness of the proposed approach for fast selection the blurriness coefficient of the regression estimation of probability density for a family of lognormal distribution laws for different volumes of initial data and promising procedures for sampling the range of values of a random variable.

Authors

Institutions

Publication Details

Journal
Scientific and Technical Information Processing
Published
2025-12-01
DOI
https://doi.org/10.3103/s0147688225700443
Primary Topic
Analysis of environmental and stochastic processes
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Fast Optimization Technique for the Regression Estimation of Probability Density of a One-Dimensional Random Variable

V. A. Lapko, A. V. Lapko
Scientific and Technical Information Processing
Analysis of environmental and stochastic processes
article

A Fast Optimization Technique for the Regression Estimation of Probability Density of a One-Dimensional Random Variable

V. A. Lapko, A. V. Lapko
article en

Abstract

A method is proposed for the fast selection of the blurriness coefficient of kernel functions of the regression estimation of probability density of a one-dimensional random variable. Regression estimation of probability density is used in the analysis of large-volume statistical data. Its synthesis is based on compression of the initial information using sampling procedures of the range of values of a random variable and the formation of an array of transformed data. The elements of the resulting data array are the centers of sampling intervals and the corresponding frequencies of random variables from the initial sample. For a fast selection of the blurriness coefficient of kernel functions, the results of studying the asymptotic properties of the regression estimation of probability density are used. A method for estimating the components of the optimal blurriness coefficient is proposed. The method of computational experiment is used to analyze the effectiveness of the proposed approach for fast selection the blurriness coefficient of the regression estimation of probability density for a family of lognormal distribution laws for different volumes of initial data and promising procedures for sampling the range of values of a random variable.

Scientific and Technical Information ProcessingVol. 52(5)
Institute of Computational Modeling (RU), Siberian State Aerospace University (RU)
Openalex Percentile: Top 18%
Analysis of environmental and stochastic processes
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.