Generalized Reich-Moore R-matrix approximation
نویسندگان
چکیده
منابع مشابه
Tighter bound of Sketched Generalized Matrix Approximation
Generalized matrix approximation plays a fundamental role in many machine learning problems, such as CUR decomposition, kernel approximation, and matrix low rank approximation. Especially with Today’s applications involved in larger and larger dataset, more and more efficient generalized matrix approximation algorithems become a crucially important research issue. In this paper, we find new ske...
متن کاملGeneralized Polar Decompositions for the Approximation of the Matrix Exponential
In this paper we describe the use of the theory of generalized polar decompositions [H. Munthe-Kaas, G. R. W. Quispel, and A. Zanna, Found. Comput. Math., 1 (2001), pp. 297–324] to approximate a matrix exponential. The algorithms presented have the property that, if Z ∈ g, a Lie algebra of matrices, then the approximation for exp(Z) resides in G, the matrix Lie group of g. This property is very...
متن کاملOn the Generalized Matrix Approximation Problems in the Spectral Norm
In this paper theoretical results regarding a generalized minimum rank matrix approximation problem in the spectral norm are presented. An alternative solution expression for the generalized matrix approximation problem is obtained. This alternative expression provides a simple characterization of the achievable minimum rank, which is shown to be the same as the optimal objective value of the c...
متن کاملBeyond Moore-Penrose Part I: Generalized Inverses that Minimize Matrix Norms
This is the first paper of a two-long series in which we study linear generalized inverses that minimize matrix norms. Such generalized inverses are famously represented by the Moore-Penrose pseudoinverse (MPP) which happens to minimize the Frobenius norm. Freeing up the degrees of freedom associated with Frobenius optimality enables us to promote other interesting properties. In this Part I, w...
متن کاملBregman Co-clustering and Matrix Approximation A Generalized Maximum Entropy Approach to Bregman Co-clustering and Matrix Approximation
Co-clustering, or simultaneous clustering of rows and columns of a two-dimensional data matrix, is rapidly becoming a powerful data analysis technique. Co-clustering has enjoyed wide success in varied application domains such as text clustering, gene-microarray analysis, natural language processing and image, speech and video analysis. In this paper, we introduce a partitional co-clustering for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EPJ Web of Conferences
سال: 2017
ISSN: 2100-014X
DOI: 10.1051/epjconf/201714612006