scientific article; zbMATH DE number 6860781
From MaRDI portal
Publication:4636985
clusteringcorrelation matricesinformation theorykernel methodsquantum information theorysimilarity information
Statistical aspects of information-theoretic topics (62B10) Estimation in multivariate analysis (62H12) Measures of association (correlation, canonical correlation, etc.) (62H20) Applications of statistics to physics (62P35) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Recommendations
- Analysis of similarity measures in information retrieval problems
- Towards a Conscious Choice of a Similarity Measure: A Qualitative Point of View
- An effective similarity measurement under epistemic uncertainty
- A comparative study of similarity measures
- scientific article; zbMATH DE number 780944
- Some new approaches to constructing similarity measures
- Similarity measures in formal concept analysis
Cites work
- 10.1162/153244302760200687
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A Dual Approach to Semidefinite Least-Squares Problems
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A Note on Extreme Correlation Matrices
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- A Singular Value Thresholding Algorithm for Matrix Completion
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Algorithmic Learning Theory
- Algorithms for learning kernels based on centered alignment
- An analysis of correlation matrices: Equal correlations
- An Extension of Kakutani's Theorem on Infinite Product Measures to the Tensor Product of Semifinite w ∗ -Algebras
- Asymptotic Theory for Principal Component Analysis
- Characterization of the subdifferential of some matrix norms
- Collective dynamics of `small-world' networks
- Comparing clusterings by the variation of information.
- Computing a nearest correlation matrix with factor structure
- Computing a nearest symmetric positive semidefinite matrix
- Computing the nearest correlation matrix--a problem from finance
- Consistency of the group Lasso and multiple kernel learning
- Convex analysis and nonlinear optimization. Theory and examples.
- Cryptographic distinguishability measures for quantum-mechanical states
- Derivatives of Spectral Functions
- Diagonal and low-rank matrix decompositions, correlation matrices, and ellipsoid fitting
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Efficient Automatic Differentiation of Matrix Functions
- Efficient rank reduction of correlation matrices
- Emergence of Scaling in Random Networks
- Equivalence of distance-based and RKHS-based statistics in hypothesis testing
- Fidelity for Mixed Quantum States
- Fixed point and Bregman iterative methods for matrix rank minimization
- Gradient methods for minimizing composite functions
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 5957198 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 739533 (Why is no real title available?)
- scientific article; zbMATH DE number 1966603 (Why is no real title available?)
- scientific article; zbMATH DE number 3804333 (Why is no real title available?)
- scientific article; zbMATH DE number 823379 (Why is no real title available?)
- scientific article; zbMATH DE number 3092167 (Why is no real title available?)
- scientific article; zbMATH DE number 3109251 (Why is no real title available?)
- Hypothesis testing for automated community detection in networks
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Invariant metrics, contractions and nonlinear matrix equations
- Learning the kernel matrix with semidefinite programming
- Log-determinant divergences revisited: alpha-beta and gamma log-det divergences
- Low-rank optimization on the cone of positive semidefinite matrices
- Means of Hermitian positive-definite matrices based on the log-determinant \(\alpha\)-divergence function
- Measures of Entropy From Data Using Infinitely Divisible Kernels
- Measuring and testing dependence by correlation of distances
- On a positive semidefinite relaxation of the cut polytope
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On Skew Information
- On Testing a Set of Correlation Coefficients for Equality
- On testing a set of correlation coefficients for equality: Some asymptotic results
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Facial Structure of the Set of Correlation Matrices
- Optimal estimation of low rank density matrices
- Proximal splitting methods in signal processing
- Proximité et dualité dans un espace hilbertien
- Quantum information theory. An introduction.
- Robust Estimation of a Location Parameter
- Sparse Reconstruction by Separable Approximation
- Spectral regularization algorithms for learning large incomplete matrices
- Statistical distance and the geometry of quantum states
- Sub- and super-fidelity as bounds for quantum fidelity
- Tests for correlation matrices
- The transition probability in the state space of a \(^*\)-algebra
- The multimode Procrustes problem
- Theory of Reproducing Kernels
- Unifying approach to the quantification of bipartite correlations by bures distance
Cited in
(4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636985)
