Long non-coding RNAs (lncRNAs) and microRNAs (miRNAs) are closely related to the treatment of human diseases. Traditional biological experiments often require time-consuming and labor-intensive in their search for mechanisms of disease. Computational methods are regarded as an effective way to predict unknown lncRNA-miRNA interactions (LMIs). However, most of them complete their tasks by mainly focusing on a single lncRNA-miRNA network without considering the complex mechanism between biomolecular in life activities, which are believed to be useful for improving the accuracy of LMI prediction. To address this, a heterogeneous information network (HIN) learning model with neighborhood-level structural representation, called HINLMI, to precisely identify LMIs. In particular, HINLMI first constructs a HIN by integrating nine interactions of five biomolecules. After that, different representation learning strategies are applied to learn the biological and network representations of lncRNAs and miRNAs in the HIN from different perspectives. Finally, HINLMI incorporates the XGBoost classifier to predict unknown LMIs using final embeddings of lncRNAs and miRNAs. Experimental results show that HINLMI yields a best performance on the real dataset when compared with state-of-the-art computational models. Moreover, several analysis experiments indicate that the simultaneous consideration of biological knowledge and network topology of lncRNAs and miRNAs allows HINLMI to accurately predict LMIs from a more comprehensive perspective. The promising performance of HINLMI also reveals that the utilization of rich heterogeneous information can provide an alternative insight for HINLMI to identify novel interactions between lncRNAs and miRNAs.

Attributed graph clustering is a fundamental, yet challenging, task for studying underlying network structures. Recently, a variety of graph representation learning models have been proposed to effectively infer the node embeddings, which are then incorporated into conventional clustering techniques to identify meaningful clusters. While these models tend to preserve node proximities, which reflect the similarity between nodes in both structural and attribute dimensions, for representation learning, they generally overlook the crucial dependencies between node embeddings and the resulting clusters. To overcome this problem, we propose a novel fuzzy-based deep attributed graph clustering model, namely FDAGC, which is capable of achieving the task in a purely unsupervised and end-to-end manner without additionally incorporating conventional clustering techniques. In particular, FDAGC first encodes network structures and node attributes into a compact representation with graph convolution. A reconstruction error is then estimated to minimize the information loss during network message-passing. Besides, we utilize a self-monitoring training strategy to optimize node embeddings, thus improving the cluster cohesion by guiding them towards cluster centers. In the training phase, our expectations about resulting clusters are explicitly incorporated into the optimization of FDAGC via the concept of fuzzy clustering, thus leading to more accurate clustering by coupling the dependency between graph representation learning and attributed graph clustering. Extensive experiments have demonstrated the superior performance of FDAGC in terms of several evaluation metrics, such as Accuracy, Normalized Mutual Information, F1-score and Adjusted Rand Index, on six real-world attributed graphs with different scales.

Attributed graph clustering is of significance for an in-depth understanding of the intrinsic organization of complex networks. Recently, owing to the powerful learning capability of deep neural networks, increasing attention has been paid to developing more advanced deep learning approaches for attributed graph clustering. However, these approaches mainly focus on the purpose of obtaining general node representations, followed by clustering as a downstream task in combination with traditional techniques. Intuitively, the clustering performance is further limited due to the lack of achieving the desirable clustering quality in the graph representation learning process. To this end, this paper proposes a novel end-to-end attributed graph clustering model, namely FCGCN, by integrating fuzzy clustering and graph convolution network. FCGCN is trained toward optimizing an unsupervised fuzzy-based clustering objective, which is specifically formulated for precisely evaluating the clustering quality by considering the fuzzy memberships of nodes over clusters. To avoid the generation of undesirable clusters, we introduce a tailored regularization term by alleviating the over-smoothing issue on graph neural networks. By doing so, an explicit connection between graph representation learning and clustering can thus be established, considerably improving the clustering performance. To evaluate the performance of FCGCN, extensive experiments are conducted on a total of five real attributed graph datasets, and the results demonstrate the superiority of FCGCN over several state-of-the-art algorithms in terms of effectiveness and efficiency.

To understand the mechanisms of complex systems, attributed graphs (AGs) are recognized as a valuable model by their capability of describing nontrivial topological structures and rich node contents, and their emergence raises new challenges on the task of graph clustering. Although a variety of computational algorithms have been proposed to perform accurate clustering analysis on AGs, most of them are incapable of inferring the cluster labels of nodes through links, thus falling short of explaining node behaviors on how to formulate overlapping clusters. Moreover, the vast amount of links considerably decreases the computation efficiency if they are explicitly taken into account for AG clustering. To overcome this problem, we present a novel variational Bayesian learning model, which avoids generating a complete AG by only simulating the generative process of its skeleton with the prior knowledge on the cluster labels of links. When addressing the inference problem, we develop an efficient algorithm, namely, LCAAG, for determining the optimal cluster labels of nodes by estimating local community structures of links. The convergence of LCAAG has been proved theoretically. Compared with several state-of-the-art algorithms, LCAAG has demonstrated its promising performance in terms of both accuracy and scalability on five different scaled benchmark datasets. The source code and datasets are available at https://github.com/shallowdreamoon/LCAAG.git.

As a pivotal post-transcriptional modification of RNA, N6-methyladenosine (m6A) has a substantial influence on gene expression modulation and cellular fate determination. Although a variety of computational models have been developed to accurately identify potential m6A modification sites, few of them are capable of interpreting the identification process with insights gained from consensus knowledge. To overcome this problem, we propose a deep learning model, namely M6A-DCR, by discovering consensus regions for interpretable identification of m6A modification sites. In particular, M6A-DCR first constructs an instance graph for each RNA sequence by integrating specific positions and types of nucleotides. The discovery of consensus regions is then formulated as a graph clustering problem in light of aggregating all instance graphs. After that, M6A-DCR adopts a motif-aware graph reconstruction optimization process to learn high-quality embeddings of input RNA sequences, thus achieving the identification of m6A modification sites in an end-to-end manner. Experimental results demonstrate the superior performance of M6A-DCR by comparing it with several state-of-the-art identification models. The consideration of consensus regions empowers our model to make interpretable predictions at the motif level. The analysis of cross validation through different species and tissues further verifies the consistency between the identification results of M6A-DCR and the evolutionary relationships among species