matrix factorization
Recently Published Documents


TOTAL DOCUMENTS

5569
(FIVE YEARS 2789)

H-INDEX

104
(FIVE YEARS 36)

2022 ◽  
Vol 40 (2) ◽  
pp. 1-36
Author(s):  
Lei Zhu ◽  
Chaoqun Zheng ◽  
Xu Lu ◽  
Zhiyong Cheng ◽  
Liqiang Nie ◽  
...  

Multi-modal hashing supports efficient multimedia retrieval well. However, existing methods still suffer from two problems: (1) Fixed multi-modal fusion. They collaborate the multi-modal features with fixed weights for hash learning, which cannot adaptively capture the variations of online streaming multimedia contents. (2) Binary optimization challenge. To generate binary hash codes, existing methods adopt either two-step relaxed optimization that causes significant quantization errors or direct discrete optimization that consumes considerable computation and storage cost. To address these problems, we first propose a Supervised Multi-modal Hashing with Online Query-adaption method. A self-weighted fusion strategy is designed to adaptively preserve the multi-modal features into hash codes by exploiting their complementarity. Besides, the hash codes are efficiently learned with the supervision of pair-wise semantic labels to enhance their discriminative capability while avoiding the challenging symmetric similarity matrix factorization. Further, we propose an efficient Unsupervised Multi-modal Hashing with Online Query-adaption method with an adaptive multi-modal quantization strategy. The hash codes are directly learned without the reliance on the specific objective formulations. Finally, in both methods, we design a parameter-free online hashing module to adaptively capture query variations at the online retrieval stage. Experiments validate the superiority of our proposed methods.


2022 ◽  
Vol 122 ◽  
pp. 108343
Author(s):  
Donglin Zhang ◽  
Xiao-Jun Wu
Keyword(s):  

2022 ◽  
Vol 15 ◽  
Author(s):  
Fan Wu ◽  
Jiahui Cai ◽  
Canhong Wen ◽  
Haizhu Tan

Non-negative matrix factorization, which decomposes the input non-negative matrix into product of two non-negative matrices, has been widely used in the neuroimaging field due to its flexible interpretability with non-negativity property. Nowadays, especially in the neuroimaging field, it is common to have at least thousands of voxels while the sample size is only hundreds. The non-negative matrix factorization encounters both computational and theoretical challenge with such high-dimensional data, i.e., there is no guarantee for a sparse and part-based representation of data. To this end, we introduce a co-sparse non-negative matrix factorization method to high-dimensional data by simultaneously imposing sparsity in both two decomposed matrices. Instead of adding some sparsity induced penalty such as l1 norm, the proposed method directly controls the number of non-zero elements, which can avoid the bias issues and thus yield more accurate results. We developed an alternative primal-dual active set algorithm to derive the co-sparse estimator in a computationally efficient way. The simulation studies showed that our method achieved better performance than the state-of-art methods in detecting the basis matrix and recovering signals, especially under the high-dimensional scenario. In empirical experiments with two neuroimaging data, the proposed method successfully detected difference between Alzheimer's patients and normal person in several brain regions, which suggests that our method may be a valuable toolbox for neuroimaging studies.


2022 ◽  
Vol 2022 ◽  
pp. 1-12
Author(s):  
Huazhen Liu ◽  
Wei Wang ◽  
Yihan Zhang ◽  
Renqian Gu ◽  
Yaqi Hao

Explicit feedback and implicit feedback are two important types of heterogeneous data for constructing a recommendation system. The combination of the two can effectively improve the performance of the recommendation system. However, most of the current deep learning recommendation models fail to fully exploit the complementary advantages of two types of data combined and usually only use binary implicit feedback data. Thus, this paper proposes a neural matrix factorization recommendation algorithm (EINMF) based on explicit-implicit feedback. First, neural network is used to learn nonlinear feature of explicit-implicit feedback of user-item interaction. Second, combined with the traditional matrix factorization, explicit feedback is used to accurately reflect the explicit preference and the potential preferences of users to build a recommendation model; a new loss function is designed based on explicit-implicit feedback to obtain the best parameters through the neural network training to predict the preference of users for items; finally, according to prediction results, personalized recommendation list is pushed to the user. The feasibility, validity, and robustness are fully demonstrated in comparison with multiple baseline models on two real datasets.


Author(s):  
Alessandro Scano ◽  
Robert Mihai Mira ◽  
Andrea d'Avella

Synergistic models have been employed to investigate motor coordination separately in the muscular and kinematic domains. However, the relationship between muscle synergies, constrained to be non-negative, and kinematic synergies, whose elements can be positive and negative, has received limited attention. Existing algorithms for extracting synergies from combined kinematic and muscular data either do not enforce non-negativity constraints or separate non-negative variables into positive and negative components. We propose a mixed matrix factorization (MMF) algorithm based on a gradient descent update rule which overcomes these limitations. It allows to directly assess the relationship between kinematic and muscle activity variables, by enforcing the non-negativity constrain on a subset of variables. We validated the algorithm on simulated kinematic-muscular data generated from known spatial synergies and temporal coefficients, by evaluating the similarity between extracted and ground truth synergies and temporal coefficients when the data are corrupted by different noise levels. We also compared the performance of MMF to that of non-negative matrix factorization applied to separate positive and negative components (NMFpn). Finally, we factorized kinematic and EMG data collected during upper-limb movements to demonstrate the potential of the algorithm. MMF achieved almost perfect reconstruction on noiseless simulated data. It performed better than NMFpn in recovering the correct spatial synergies and temporal coefficients with noisy simulated data. It also allowed to correctly select the original number of ground truth synergies. We showed meaningful applicability to real data; MMF can also be applied to any multivariate data that contains both non-negative and unconstrained variables.


2022 ◽  
Vol 14 (1) ◽  
pp. 20
Author(s):  
Tan Nghia Duong ◽  
Nguyen Nam Doan ◽  
Truong Giang Do ◽  
Manh Hoang Tran ◽  
Duc Minh Nguyen ◽  
...  

Recommendation systems based on convolutional neural network (CNN) have attracted great attention due to their effectiveness in processing unstructured data such as images or audio. However, a huge amount of raw data produced by data crawling and digital transformation is structured, which makes it difficult to utilize the advantages of CNN. This paper introduces a novel autoencoder, named Half Convolutional Autoencoder, which adopts convolutional layers to discover the high-order correlation between structured features in the form of Tag Genome, the side information associated with each movie in the MovieLens 20 M dataset, in order to generate a robust feature vector. Subsequently, these new movie representations, along with the introduction of users’ characteristics generated via Tag Genome and their past transactions, are applied into well-known matrix factorization models to resolve the initialization problem and enhance the predicting results. This method not only outperforms traditional matrix factorization techniques by at least 5.35% in terms of accuracy but also stabilizes the training process and guarantees faster convergence.


Sign in / Sign up

Export Citation Format

Share Document