• No results found

[PDF] Top 20 Bootstrap-Based Regularization for Low-Rank Matrix Estimation

Has 10000 "Bootstrap-Based Regularization for Low-Rank Matrix Estimation" found on our website. Below are the top 20 most common "Bootstrap-Based Regularization for Low-Rank Matrix Estimation".

Bootstrap-Based Regularization for Low-Rank Matrix Estimation

Bootstrap-Based Regularization for Low-Rank Matrix Estimation

... decomposition based on correspondence analysis to out-perform the baseline that just divides by document length; however, correspondence analysis ended up doing slightly ... See full document

29

Low Rank Regularization for Sparse Conjunctive Feature Spaces: An Application to Named Entity Classification

Low Rank Regularization for Sparse Conjunctive Feature Spaces: An Application to Named Entity Classification

... a matrix has a clear definition of rank, it is not the case for general tensors, and there exist various definitions in the ...is based on matricization of the tensor, that is, turning the tensor ... See full document

10

Probabilistic Low-Rank Matrix Completion from Quantized Measurements

Probabilistic Low-Rank Matrix Completion from Quantized Measurements

... get matrix to make it identifiable and also discuss our sampling model on which we follow Bhojanapalli and Jain ...on matrix recovery. We first describe the proposed constrained ML estimation of the ... See full document

34

 INFORMATION TECHNOLOGY GOVERNANCE USING COBIT 4 0 DOMAIN DELIVERY SUPPORT 
AND MONITORING EVALUATION

 INFORMATION TECHNOLOGY GOVERNANCE USING COBIT 4 0 DOMAIN DELIVERY SUPPORT AND MONITORING EVALUATION

... nonlocal estimation step after the initial CS recovery for de-noising ...nonlocal estimation is based on the well-known nonlocal means (NL) filtering that takes advantage of self-similarity in ... See full document

11

Simultaneous Pursuit of Sparseness and Rank Structures for Matrix Decomposition

Simultaneous Pursuit of Sparseness and Rank Structures for Matrix Decomposition

... the same time, the proposed method has high true positives ranging from .92 to 1.00 and low false positives between 0.00 and 0.01, as compared to true positives ranging 0.04 to .44 and false positives between 0.03 ... See full document

29

ISAR Imaging Based on MEMP Method and Low Rank Matrix Denoising Technique

ISAR Imaging Based on MEMP Method and Low Rank Matrix Denoising Technique

... called matrix enhancement and matrix pencil (MEMP) has been proposed by ...data matrix and forms an enhanced matrix from the original echo ...enhanced matrix is used to estimate the 2-D ... See full document

11

Group Lasso Estimation of High-dimensional Covariance Matrices

Group Lasso Estimation of High-dimensional Covariance Matrices

... a matrix regression model as in Bigot et ...covariance matrix estimation based on empirical contrast regularization by a group Lasso ...covariance matrix Σ into a low ... See full document

39

Speaker adaptation based on regularized speaker-dependent eigenphone matrix estimation

Speaker adaptation based on regularized speaker-dependent eigenphone matrix estimation

... a low-dimensional manifold, so that speaker adaptation is no more than the estimation of the local or global coor- dinate of the new SD ...the low- dimensional manifold is a linear subspace and a set ... See full document

13

Optimal Estimation of Low Rank Density Matrices

Optimal Estimation of Low Rank Density Matrices

... the matrix LASSO estimator ˆ ρ ε with nuclear norm penalty and arbitrary value of regularization parameter ...the rank that provides a convex relaxation for rank penalized least squares ... See full document

36

Compressed Sensing, Sparse Approximation, and Low-Rank Matrix Estimation

Compressed Sensing, Sparse Approximation, and Low-Rank Matrix Estimation

... Bounds on the restricted isometry constant have been established in [42] and in [135] for partial DFT matrices, and by extension, for partial subsampled orthogonal transforms. For instance, [135] proves that if A is a ... See full document

171

EFFICIENT REQUIREMENT PRIORITIZATION BASED ON ENHANCED MULTI VERSE OPTIMIZER

EFFICIENT REQUIREMENT PRIORITIZATION BASED ON ENHANCED MULTI VERSE OPTIMIZER

... approach, regularization technique and cluster ...co-association matrix as a similarity matrix in the regularization context, as well as in a low-rank presentation of the ... See full document

13

Nonlocal tensor sparse representation and low-rank regularization for hyperspectral image compressive sensing reconstruction

Nonlocal tensor sparse representation and low-rank regularization for hyperspectral image compressive sensing reconstruction

... information. Regularization-based approaches usually incorporate the prior knowledge into the observation model and develop a united framework ...proper regularization term to characterize the ... See full document

24

The Algebraic Combinatorial Approach for Low-Rank Matrix Completion

The Algebraic Combinatorial Approach for Low-Rank Matrix Completion

... In Figure 5, the phase transition curves for different n at rank 2 and 3 are shown. The two plots in the top part show the results for the 2r-regular masks, and the two plots in the bottom show the same results ... See full document

46

Low-Rank Kernel Learning with Bregman Matrix Divergences

Low-Rank Kernel Learning with Bregman Matrix Divergences

... learning low-rank kernel matrices in the setting where we have background information for a subset of the data; we discuss and experiment with learning low-rank kernel matrices for ... See full document

36

A Note on Quickly Sampling a Sparse Matrix with Low Rank Expectation

A Note on Quickly Sampling a Sparse Matrix with Low Rank Expectation

... To examine the running time of fastRG, we simulated a range of different values of n and E(m), where E(m) is the expected number of edges. In all simulations X = Y and K = 5. The elements of X are independent Poisson(1) ... See full document

13

Clustering Over Multiple Evolving Data Streams of the Traffic Cyber-Physical Systems

Clustering Over Multiple Evolving Data Streams of the Traffic Cyber-Physical Systems

... ing, such as clustering, classification, and so on. Clustering multiple data streams or grouping data streams is supposed to process at each time stamp. Various research works have been reported [2, 5, 6, 25]. Joint ... See full document

16

Vascular Tree Structure: Fast Curvature Regularization and Validation

Vascular Tree Structure: Fast Curvature Regularization and Validation

... centerline estimation is medial representation of ob- jects, also known as skeleton or medial axis [35, 21, 8, 9, ...additional regularization is ... See full document

79

Proximal iteratively reweighted algorithm for low rank matrix recovery

Proximal iteratively reweighted algorithm for low rank matrix recovery

... studies, based on the weighted fixed point method, this paper puts forward a proximal iteratively reweighted algorithm to recover a low-rank ... See full document

8

Low-Rank Doubly Stochastic Matrix Decomposition for Cluster Analysis

Low-Rank Doubly Stochastic Matrix Decomposition for Cluster Analysis

... Although a preliminary version of our method has been presented earlier (Yang and Oja, 2012a), the current paper introduces several significant improvements. First, we show that the proposed clustering objective can be ... See full document

25

Consistent metagenomic biomarker detection via robust PCA

Consistent metagenomic biomarker detection via robust PCA

... biomarkers based on ...and low-rank matrix, ...level matrix as a low-rank matrix (denoted by ...sparse matrix (denoted by ...abundances matrix into ... See full document

16

Show all 10000 documents...