Estimating Preisach Density via Subset Selection
نویسندگان
چکیده
منابع مشابه
Subset Selection via Implicit Utilitarian Voting
How should one aggregate ordinal preferences expressed by voters into a measurably superior social choice? A well-established approach — which we refer to as implicit utilitarian voting — assumes that voters have latent utility functions that induce the reported rankings, and seeks voting rules that approximately maximize utilitarian social welfare. We extend this approach to the design of rule...
متن کاملSubset ARMA selection via the adaptive Lasso
Model selection is a critical aspect of subset autoregressive moving-average (ARMA) modelling. This is commonly done by subset selection methods, which may be computationally intensive and even impractical when the true ARMA orders of the underlying model are high. On the other hand, automatic variable selection methods based on regularization do not directly apply to this problem because the i...
متن کاملColumn subset selection via sparse approximation of SVD
Given a real matrix A ∈ Rm×n of rank r, and an integer k < r, the sum of the outer products of top k singular vectors scaled by the corresponding singular values provide the best rank-k approximation Ak to A. When the columns of A have specific meaning, it might be desirable to find good approximations to Ak which use a small number of columns of A. This paper provides a simple greedy algorithm...
متن کاملA Performance Acceleration Algorithm of Spectral Unmixing via Subset Selection
An acceleration algorithm for spectral unmixing approach is proposed based on subset selection. The method classifies the pixels in a spectral image into accurate and approximated unmixing groups based on the similarity and dissimilarity of geomorphological features in neighboring areas. Real spectral images are used for unmixing benchmark tests for accuracy and performance verification. The re...
متن کاملBest Subset Selection via a Modern Optimization Lens
In the last twenty-five years (1990-2014), algorithmic advances in integer optimization combined with hardware improvements have resulted in an astonishing 200 billion factor speedup in solving Mixed Integer Optimization (MIO) problems. We present a MIO approach for solving the classical best subset selection problem of choosing k out of p features in linear regression given n observations. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2983364