Hessian Regularized [Formula: see text]-Nonnegative Matrix Factorization and Deep Learning for miRNA-Disease Associations Prediction

Since the identification of microRNAs (miRNAs), empirical research has demonstrated their crucial involvement in the functioning of organisms. Investigating miRNAs significantly bolsters efforts related to averting, diagnosing, and treating intricate human maladies. Yet, exploring every conceivable miRNA-disease association consumes significant resources and time within conventional wet experiments. On the computational front, forecasting potential miRNA-disease connections serves as a valuable source of preliminary insights for medical investigators. As a result, we have developed a novel matrix factorization model known as Hessian-regularized [Formula: see text] nonnegative matrix factorization in combination with deep learning for predicting associations between miRNAs and diseases, denoted as [Formula: see text]-NMF-DF. In particular, we introduce a novel iterative fusion approach to integrate all similarities. This method effectively diminishes the sparsity of the initial miRNA-disease associations matrix. Additionally, we devise a mixed model framework that utilizes deep learning, matrix decomposition, and singular value decomposition to capture and depict the intricate nonlinear features of miRNA and disease. The prediction performance of the six matrix factorization methods is improved by comparison and analysis, similarity matrix fusion, data preprocessing, and parameter adjustment. The AUC and AUPR obtained by the new matrix factorization model under fivefold cross validation are comparative or better with other matrix factorization models. Finally, we select three diseases including lung tumor, bladder tumor and breast tumor for case analysis, and further extend the matrix factorization model based on deep learning. The results show that the hybrid algorithm combining matrix factorization with deep learning proposed in this paper can predict miRNAs related to different diseases with high accuracy.

Asymmetric double networks mutual teaching for unsupervised person Re-identification

Unsupervised person re-identification (Re-ID) has always been challenging in computer vision. It has received much attention from researchers because it does not require any labeled information and can be freely deployed to new scenarios. Most unsupervised person Re-ID research studies produce and optimize pseudo-labels by iterative clustering algorithms on a single network. However, these methods are easily affected by noisy labels and feature variations caused by camera shifts, which will limit the optimization of pseudo-labels. In this paper, we propose an Asymmetric Double Networks Mutual Teaching (ADNMT) architecture that uses two asymmetric networks to generate pseudo-labels for each other by clustering, and the pseudo-labels are updated and optimized by alternate training. Specifically, ADNMT contains two asymmetric networks. One network is a multiple granularity network, which extracts pedestrian features of multiple granularity that correspond to numerous classifiers, and the other network is a conventional backbone network, which extracts pedestrian features that correspond to a classifier. Furthermore, because the camera style changes seriously affect the generalization ability of the proposed model, this paper designs Similarity Compensation of Inter-Camera (SCIC) and Similarity Suppression of Intra-Camera (SSIC) according to the camera ID of the pedestrian images to optimize the similarity measure. Extensive experiments on multiple Re-ID benchmark datasets show that our proposed method achieves superior performance compared with the state-of-the-art unsupervised person re-identification methods.

Evaluating keyphrase extraction algorithms for finding similar news articles using lexical similarity calculation and semantic relatedness measurement by word embedding

A textual data processing task that involves the automatic extraction of relevant and salient keyphrases from a document that expresses all the important concepts of the document is called keyphrase extraction. Due to technological advancements, the amount of textual information on the Internet is rapidly increasing as a lot of textual information is processed online in various domains such as offices, news portals, or for research purposes. Given the exponential increase of news articles on the Internet, manually searching for similar news articles by reading the entire news content that matches the user's interests has become a time-consuming and tedious task. Therefore, automatically finding similar news articles can be a significant task in text processing. In this context, keyphrase extraction algorithms can extract information from news articles. However, selecting the most appropriate algorithm is also a problem. Therefore, this study analyzes various supervised and unsupervised keyphrase extraction algorithms, namely KEA, KP-Miner, YAKE, MultipartiteRank, TopicRank, and TeKET, which are used to extract keyphrases from news articles. The extracted keyphrases are used to compute lexical and semantic similarity to find similar news articles. The lexical similarity is calculated using the Cosine and Jaccard similarity techniques. In addition, semantic similarity is calculated using a word embedding technique called Word2Vec in combination with the Cosine similarity measure. The experimental results show that the KP-Miner keyphrase extraction algorithm, together with the Cosine similarity calculation using Word2Vec (Cosine-Word2Vec), outperforms the other combinations of keyphrase extraction algorithms and similarity calculation techniques to find similar news articles. The similar articles identified using KPMiner and the Cosine similarity measure with Word2Vec appear to be relevant to a particular news article and thus show satisfactory performance with a Normalized Discounted Cumulative Gain (NDCG) value of 0.97. This study proposes a method for finding similar news articles that can be used in conjunction with other methods already in use.

A calculation method of plant similarity giving consideration to different plant features

A method to compute the similarity between different plants is proposed, using features of a plant׳s topological structure and peripheral contour, as well as its geometry. The topological structures are described using tree graphs, and their similarity can be calculated based on the edit distance of these graphs. The peripheral contour of a plant is abstracted by its three-dimensional convex hull, which is projected in several directions. The similarity of the different projections is calculated by an algorithm to compute the similarity of two-dimensional shapes. The similarity of the geometrical detail is computed by considering the geometrical properties of different level branches. Finally the overall similarity between different plants is calculated by combining these different similarity measures. The validity of proposed method is evaluated by detailed experiments.