Learning latent features with local channel drop network for vehicle re-identification

2022 ◽  
Vol 107 ◽  
pp. 104540
Author(s):  
Xianping Fu ◽  
Jinjia Peng ◽  
Guangqi Jiang ◽  
Huibing Wang
Keyword(s):  
Entropy ◽  
2021 ◽  
Vol 24 (1) ◽  
pp. 36
Author(s):  
Xiaoan Yan ◽  
Yadong Xu ◽  
Daoming She ◽  
Wan Zhang

Variational auto-encoders (VAE) have recently been successfully applied in the intelligent fault diagnosis of rolling bearings due to its self-learning ability and robustness. However, the hyper-parameters of VAEs depend, to a significant extent, on artificial settings, which is regarded as a common and key problem in existing deep learning models. Additionally, its anti-noise capability may face a decline when VAE is used to analyze bearing vibration data under loud environmental noise. Therefore, in order to improve the anti-noise performance of the VAE model and adaptively select its parameters, this paper proposes an optimized stacked variational denoising autoencoder (OSVDAE) for the reliable fault diagnosis of bearings. Within the proposed method, a robust network, named variational denoising auto-encoder (VDAE), is, first, designed by integrating VAE and a denoising auto-encoder (DAE). Subsequently, a stacked variational denoising auto-encoder (SVDAE) architecture is constructed to extract the robust and discriminative latent fault features via stacking VDAE networks layer on layer, wherein the important parameters of the SVDAE model are automatically determined by employing a novel meta-heuristic intelligent optimizer known as the seagull optimization algorithm (SOA). Finally, the extracted latent features are imported into a softmax classifier to obtain the results of fault recognition in rolling bearings. Experiments are conducted to validate the effectiveness of the proposed method. The results of analysis indicate that the proposed method not only can achieve a high identification accuracy for different bearing health conditions, but also outperforms some representative deep learning methods.


2020 ◽  
Author(s):  
Ming Chen ◽  
Xiuze Zhou

Abstract Background: Because it is so laborious and expensive to experimentally identify Drug-Target Interactions (DTIs), only a few DTIs have been verified. Computational methods are useful for identifying DTIs in biological studies of drug discovery and development. Results: For drug-target interaction prediction, we propose a novel neural network architecture, DAEi, extended from Denoising AutoEncoder (DAE). We assume that a set of verified DTIs is a corrupted version of the full interaction set. We use DAEi to learn latent features from corrupted DTIs to reconstruct the full input. Also, to better predict DTIs, we add some similarities to DAEi and adopt a new nonlinear method for calculation. Similarity information is very effective at improving the prediction of DTIs. Conclusion: Results of the extensive experiments we conducted on four real data sets show that our proposed methods are superior to other baseline approaches.Availability: All codes in this paper are open-sourced, and our projects are available at: https://github.com/XiuzeZhou/DAEi.


2016 ◽  
Vol 216 ◽  
pp. 296-309 ◽  
Author(s):  
Jian Tang ◽  
Zhuo liu ◽  
Jian Zhang ◽  
Zhiwei Wu ◽  
Tianyou Chai ◽  
...  

Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 121 ◽  
Author(s):  
Wenchuan Shi ◽  
Liejun Wang ◽  
Jiwei Qin

The collaborative filtering algorithm based on the singular value decomposition plus plus (SVD++) model employs the linear interactions between the latent features of users and items to predict the rating in the recommendation systems. Aiming to further enrich the user model with explicit feedback, this paper proposes a user embedding model for rating prediction in SVD++-based collaborative filtering, named UE-SVD++. We exploit the user potential explicit feedback from the rating data and construct the user embedding matrix by the proposed user-wise mutual information values. In addition, the user embedding matrix is added to the existing user bias and implicit parameters in the SVD++ to increase the accuracy of the user modeling. Through extensive studies on four different datasets, we found that the rating prediction performance of the UE-SVD++ model is improved compared with other models, and the proposed model’s evaluation indicators root-mean-square error (RMSE) and mean absolute error (MAE) are decreased by 1.002–2.110% and 1.182–1.742%, respectively.


Author(s):  
Chenghao Liu ◽  
Xin Wang ◽  
Tao Lu ◽  
Wenwu Zhu ◽  
Jianling Sun ◽  
...  

Social recommendation, which aims at improving the performance of traditional recommender systems by considering social information, has attracted broad range of interests. As one of the most widely used methods, matrix factorization typically uses continuous vectors to represent user/item latent features. However, the large volume of user/item latent features results in expensive storage and computation cost, particularly on terminal user devices where the computation resource to operate model is very limited. Thus when taking extra social information into account, precisely extracting K most relevant items for a given user from massive candidates tends to consume even more time and memory, which imposes formidable challenges for efficient and accurate recommendations. A promising way is to simply binarize the latent features (obtained in the training phase) and then compute the relevance score through Hamming distance. However, such a two-stage hashing based learning procedure is not capable of preserving the original data geometry in the real-value space and may result in a severe quantization loss. To address these issues, this work proposes a novel discrete social recommendation (DSR) method which learns binary codes in a unified framework for users and items, considering social information. We further put the balanced and uncorrelated constraints on the objective to ensure the learned binary codes can be informative yet compact, and finally develop an efficient optimization algorithm to estimate the model parameters. Extensive experiments on three real-world datasets demonstrate that DSR runs nearly 5 times faster and consumes only with 1/37 of its real-value competitor’s memory usage at the cost of almost no loss in accuracy.


Author(s):  
Qiu Xiao ◽  
Ning Zhang ◽  
Jiawei Luo ◽  
Jianhua Dai ◽  
Xiwei Tang

Abstract Accumulating evidence has shown that microRNAs (miRNAs) play crucial roles in different biological processes, and their mutations and dysregulations have been proved to contribute to tumorigenesis. In silico identification of disease-associated miRNAs is a cost-effective strategy to discover those most promising biomarkers for disease diagnosis and treatment. The increasing available omics data sources provide unprecedented opportunities to decipher the underlying relationships between miRNAs and diseases by computational models. However, most existing methods are biased towards a single representation of miRNAs or diseases and are also not capable of discovering unobserved associations for new miRNAs or diseases without association information. In this study, we present a novel computational method with adaptive multi-source multi-view latent feature learning (M2LFL) to infer potential disease-associated miRNAs. First, we adopt multiple data sources to obtain similarity profiles and capture different latent features according to the geometric characteristic of miRNA and disease spaces. Then, the multi-modal latent features are projected to a common subspace to discover unobserved miRNA-disease associations in both miRNA and disease views, and an adaptive joint graph regularization term is developed to preserve the intrinsic manifold structures of multiple similarity profiles. Meanwhile, the Lp,q-norms are imposed into the projection matrices to ensure the sparsity and improve interpretability. The experimental results confirm the superior performance of our proposed method in screening reliable candidate disease miRNAs, which suggests that M2LFL could be an efficient tool to discover diagnostic biomarkers for guiding laborious clinical trials.


2020 ◽  
Vol 21 (1) ◽  
Author(s):  
Yue-Hua Feng ◽  
Shao-Wu Zhang ◽  
Jian-Yu Shi

Abstract Background The treatment of complex diseases by taking multiple drugs becomes increasingly popular. However, drug-drug interactions (DDIs) may give rise to the risk of unanticipated adverse effects and even unknown toxicity. DDI detection in the wet lab is expensive and time-consuming. Thus, it is highly desired to develop the computational methods for predicting DDIs. Generally, most of the existing computational methods predict DDIs by extracting the chemical and biological features of drugs from diverse drug-related properties, however some drug properties are costly to obtain and not available in many cases. Results In this work, we presented a novel method (namely DPDDI) to predict DDIs by extracting the network structure features of drugs from DDI network with graph convolution network (GCN), and the deep neural network (DNN) model as a predictor. GCN learns the low-dimensional feature representations of drugs by capturing the topological relationship of drugs in DDI network. DNN predictor concatenates the latent feature vectors of any two drugs as the feature vector of the corresponding drug pairs to train a DNN for predicting the potential drug-drug interactions. Experiment results show that, the newly proposed DPDDI method outperforms four other state-of-the-art methods; the GCN-derived latent features include more DDI information than other features derived from chemical, biological or anatomical properties of drugs; and the concatenation feature aggregation operator is better than two other feature aggregation operators (i.e., inner product and summation). The results in case studies confirm that DPDDI achieves reasonable performance in predicting new DDIs. Conclusion We proposed an effective and robust method DPDDI to predict the potential DDIs by utilizing the DDI network information without considering the drug properties (i.e., drug chemical and biological properties). The method should also be useful in other DDI-related scenarios, such as the detection of unexpected side effects, and the guidance of drug combination.


2019 ◽  
Vol 64 (1) ◽  
pp. 194-206
Author(s):  
Jeffrey B Arnold ◽  
J Tyson Chatagnier ◽  
Gary E Hollibaugh

Abstract How do the characteristics of military leaders relate to battlefield outcomes? To answer this question, we employ original battle-level data and biographical information on hundreds of commanders in more than 250 battles in the American Civil War. We examine the relationship between two common measures of battlefield success (victory and casualties) and two latent features of commanders—competence and loyalty—that have long been seen as important in the broader study of executive appointments. We find that competent commanders are associated with more successful battlefield outcomes, as are more loyal Confederate commanders. More broadly, our analysis suggests that focusing on the relationship between military appointments and battlefield outcomes—with the latter's relatively clear definition of “success”—allows for direct examination of the relationship between appointee traits and organizational performance. As such, our results have implications for the study of conflict as well as bureaucratic politics.


Sign in / Sign up

Export Citation Format

Share Document