Results 31 to 40 of about 13,867 (163)

CASNMF: A Converged Algorithm for symmetrical nonnegative matrix factorization [PDF]

open access: yesNeurocomputing, 2018
Abstract Nonnegative matrix factorization (NMF) is a very popular unsupervised or semi-supervised learning method useful in various applications including data clustering, image processing, and semantic analysis of documents. This study focuses on Symmetric NMF (SNMF), which is a special case of NMF and can be useful in network analysis.
Li-Ping Tian   +4 more
openaire   +1 more source

Lyrics-to-Audio Alignment by Unsupervised Discovery of Repetitive Patterns in Vowel Acoustics

open access: yesIEEE Access, 2017
Most of the previous approaches to lyrics-to-audio alignment used a pre-developed automatic speech recognition (ASR) system that innately suffered from several difficulties to adapt the speech model to individual singers.
Sungkyun Chang, Kyogu Lee
doaj   +1 more source

Algorithms for Positive Semidefinite Factorization

open access: yes, 2017
This paper considers the problem of positive semidefinite factorization (PSD factorization), a generalization of exact nonnegative matrix factorization. Given an $m$-by-$n$ nonnegative matrix $X$ and an integer $k$, the PSD factorization problem consists
Gillis, Nicolas   +2 more
core   +1 more source

Randomized Algorithms for Symmetric Nonnegative Matrix Factorization

open access: yesSIAM Journal on Matrix Analysis and Applications
Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a symmetric matrix with a product of a nonnegative, low-rank matrix and its transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation.
Koby Hayashi   +3 more
openaire   +3 more sources

Factorization theorems for classical group characters, with applications to alternating sign matrices and plane partitions [PDF]

open access: yes, 2019
We show that, for a certain class of partitions and an even number of variables of which half are reciprocals of the other half, Schur polynomials can be factorized into products of odd and even orthogonal characters.
Ayyer, Arvind, Behrend, Roger E.
core   +3 more sources

Constrained Symmetric Non-Negative Matrix Factorization with Deep Autoencoders for Community Detection

open access: yesMathematics
Recently, community detection has emerged as a prominent research area in the analysis of complex network structures. Community detection models based on non-negative matrix factorization (NMF) are shallow and fail to fully discover the internal ...
Wei Zhang   +4 more
doaj   +1 more source

Computing the complete CS decomposition [PDF]

open access: yes, 2008
An algorithm is developed to compute the complete CS decomposition (CSD) of a partitioned unitary matrix. Although the existence of the CSD has been recognized since 1977, prior algorithms compute only a reduced version (the 2-by-1 CSD) that is ...
Sutton, Brian D.
core   +2 more sources

A State‐Adaptive Koopman Control Framework for Real‐Time Deformable Tool Manipulation in Robotic Environmental Swabbing

open access: yesAdvanced Robotics Research, EarlyView.
This work presents a state‐adaptive Koopman linear quadratic regulator framework for real‐time manipulation of a deformable swab tool in robotic environmental sampling. By combining Koopman linearization, tactile sensing, and centroid‐based force regulation, the system maintains stable contact forces and high coverage across flat and inclined surfaces.
Siavash Mahmoudi   +2 more
wiley   +1 more source

Restricted Tweedie stochastic block models

open access: yesCanadian Journal of Statistics, EarlyView.
Abstract The stochastic block model (SBM) is a widely used framework for community detection in networks, where the network structure is typically represented by an adjacency matrix. However, conventional SBMs are not directly applicable to an adjacency matrix that consists of nonnegative zero‐inflated continuous edge weights.
Jie Jian, Mu Zhu, Peijun Sang
wiley   +1 more source

The Huang–Yang Formula for the Low‐Density Fermi Gas: Upper Bound

open access: yesCommunications on Pure and Applied Mathematics, EarlyView.
ABSTRACT We study the ground state energy of a gas of spin 1/2$1/2$ fermions with repulsive short‐range interactions. We derive an upper bound that agrees, at low density ϱ$\varrho$, with the Huang–Yang conjecture. The latter captures the first three terms in an asymptotic low‐density expansion, and in particular the Huang–Yang correction term of order
Emanuela L. Giacomelli   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy