相关论文: Densities, spectral densities and modality

In this technical note, we deal with a spectrum approximation problem arising in THREE-like multivariate spectral estimation approaches. The solution to the problem minimizes a suitable divergence index with respect to an a priori spectral…

Probability density estimation is a core problem of statistics and signal processing. Moment methods are an important means of density estimation, but they are generally strongly dependent on the choice of feasible functions, which severely…

Statistical moments of the intensity distributions are used as molecular descriptors. They are used as a basis for defining similarity distances between two model spectra. Parameters which carry the information derived from the comparison…

This chapter presents controlled approximations of Kohn-Sham density functional theory (DFT) that enable very large scale simulations. The work is motivated by the study of defects in crystalline solids, though the ideas can be used in…

We formulate an optimization problem to estimate probability densities in the context of multidimensional problems that are sampled with uneven probability. It considers detector sensitivity as an heterogeneous density and takes advantage…

We propose a computationally light method for estimating similarities between text documents, which we call the density similarity (DS) method. The method is based on a word embedding in a high-dimensional Euclidean space and on kernel…

In this paper we consider a variety of procedures for numerical statistical inference in the family of univariate and multivariate stable distributions. In connection with univariate distributions (i) we provide approximations by finite…

We present several natural notions of distance between spectral density functions of (discrete-time) random processes. They are motivated by certain filtering problems. First we quantify the degradation of performance of a predictor which…

Measures play an important role in the characterisation of various function spaces. In this paper, the structure of density measures will be investigated. These are elements of the dual of the space of essentially bounded func- tions. The…

Sample size criteria are often expressed in terms of the concentration of the posterior density, as controlled by some sort of error bound. Since this is done pre-experimentally, one can regard the posterior density as a function of the…

In this paper, we propose a constraint-based modeling approach for the problem of discovering frequent gradual patterns in a numerical dataset. This SAT-based declarative approach offers an additional possibility to benefit from the recent…

We analyze the problem of calculating the solutions and the spectrum of a string with arbitrary density and fixed ends. We build a perturbative scheme which uses a basis of WKB-type functions and obtain explicit expressions for the…

Spectral clustering requires the time-consuming decomposition of the Laplacian matrix of the similarity graph, thus limiting its applicability to large datasets. To improve the efficiency of spectral clustering, a top-down approach was…

Analysis and processing of data is a vital part of our modern society and requires vast amounts of computational resources. To reduce the computational burden, compressing and approximating data has become a central topic. We consider the…

In this paper, we investigate the testing problem that the spectral density matrices of several, not necessarily independent, stationary processes are equal. Based on an $L_2$-type test statistic, we propose a new nonparametric approach,…

The identification of peaks or maxima in probability densities, by mode testing or bump hunting, has become an important problem in applied fields. This task has been approached in the statistical literature from different perspectives,…

The Jaccard similarity index has often been employed in science and technology as a means to quantify the similarity between two sets. When modified to operate on real-valued values, the Jaccard similarity index can be applied to compare…

The idea underlying the modal formulation of density-based clustering is to associate groups with the regions around the modes of the probability density function underlying the data. This correspondence between clusters and dense regions…

We derive a message passing method for computing the spectra of locally tree-like networks and an approximation to it that allows us to compute closed-form expressions or fast numerical approximates for the spectral density of random graphs…

Dense crowd counting aims to predict thousands of human instances from an image, by calculating integrals of a density map over image pixels. Existing approaches mainly suffer from the extreme density variances. Such density pattern shift…