Revisiting Initializing Then Refining: An Incomplete and Missing Graph Imputation Network.

With the development of various applications, such as recommendation systems and social network analysis, graph data have been ubiquitous in the real world. However, graphs usually suffer from being absent during data collection due to copyright restrictions or privacy-protecting policies. The graph absence could be roughly grouped into attribute-incomplete and attribute-missing cases. Specifically, attribute-incomplete indicates that a portion of the attribute vectors of all nodes are incomplete, while attribute-missing indicates that all attribute vectors of partial nodes are missing. Although various graph imputation methods have been proposed, none of them is custom-designed for a common situation where both types of graph absence exist simultaneously. To fill this gap, we develop a novel graph imputation network termed revisiting initializing then refining (RITR), where both attribute-incomplete and attribute-missing samples are completed under the guidance of a novel initializing-then-refining imputation criterion. Specifically, to complete attribute-incomplete samples, we first initialize the incomplete attributes using Gaussian noise before network learning, and then introduce a structure-attribute consistency constraint to refine incomplete values by approximating a structure-attribute correlation matrix to a high-order structure matrix. To complete attribute-missing samples, we first adopt structure embeddings of attribute-missing samples as the embedding initialization, and then refine these initial values by adaptively aggregating the reliable information of attribute-incomplete samples according to a dynamic affinity structure. To the best of our knowledge, this newly designed method is the first end-to-end unsupervised framework dedicated to handling hybrid-absent graphs. Extensive experiments on six datasets have verified that our methods consistently outperform the existing state-of-the-art competitors. Our source code is available at https://github.com/WxTu/RITR.

Self-Supervised Temporal Graph Learning With Temporal and Structural Intensity Alignment.

Temporal graph learning aims to generate high-quality representations for graph-based tasks with dynamic information, which has recently garnered increasing attention. In contrast to static graphs, temporal graphs are typically organized as node interaction sequences over continuous time rather than an adjacency matrix. Most temporal graph learning methods model current interactions by incorporating historical neighborhood. However, such methods only consider first-order temporal information while disregarding crucial high-order structural information, resulting in suboptimal performance. To address this issue, we propose a self-supervised method called S2T for temporal graph learning, which extracts both temporal and structural information to learn more informative node representations. Notably, the initial node representations combine first-order temporal and high-order structural information differently to calculate two conditional intensities. An alignment loss is then introduced to optimize the node representations, narrowing the gap between the two intensities and making them more informative. Concretely, in addition to modeling temporal information using historical neighbor sequences, we further consider structural knowledge at both local and global levels. At the local level, we generate structural intensity by aggregating features from high-order neighbor sequences. At the global level, a global representation is generated based on all nodes to adjust the structural intensity according to the active statuses on different nodes. Extensive experiments demonstrate that the proposed model S2T achieves at most 10.13% performance improvement compared with the state-of-the-art competitors on several datasets.

Improved Dual Correlation Reduction Network With Affinity Recovery.

Deep graph clustering, which aims to reveal the underlying graph structure and divide the nodes into different clusters without human annotations, is a fundamental yet challenging task. However, we observe that the existing methods suffer from the representation collapse problem and tend to encode samples with different classes into the same latent embedding. Consequently, the discriminative capability of nodes is limited, resulting in suboptimal clustering performance. To address this problem, we propose a novel deep graph clustering algorithm termed improved dual correlation reduction network (IDCRN) through improving the discriminative capability of samples. Specifically, by approximating the cross-view feature correlation matrix to an identity matrix, we reduce the redundancy between different dimensions of features, thus improving the discriminative capability of the latent space explicitly. Meanwhile, the cross-view sample correlation matrix is forced to approximate the designed clustering-refined adjacency matrix to guide the learned latent representation to recover the affinity matrix even across views, thus enhancing the discriminative capability of features implicitly. Moreover, we avoid the collapsed representation caused by the oversmoothing issue in graph convolutional networks (GCNs) through an introduced propagation regularization term, enabling IDCRN to capture the long-range information with the shallow network structure. Extensive experimental results on six benchmarks have demonstrated the effectiveness and efficiency of IDCRN compared with the existing state-of-the-art deep graph clustering algorithms. The code of IDCRN is released at https://github.com/yueliu1999/IDCRN. Besides, we share a collection of deep graph clustering, including papers, codes, and datasets at https://github.com/yueliu1999/Awesome-Deep-Graph-Clustering.

Evidence of RNA polymerase III recruitment and transcription at protein-coding gene promoters.

RNA polymerase (Pol) I, II, and III are most commonly described as having distinct roles in synthesizing ribosomal RNA (rRNA), messenger RNA (mRNA), and specific small noncoding (nc)RNAs, respectively. This delineation of transcriptional responsibilities is not definitive, however, as evidenced by instances of Pol II recruitment to genes conventionally transcribed by Pol III, including the co-transcription of RPPH1 - the catalytic RNA component of RNase P. A comprehensive understanding of the interplay between RNA polymerase complexes remains lacking, however, due to limited comparative analyses for all three enzymes. To address this gap, we applied a uniform framework for quantifying global Pol I, II, and III occupancies that integrates currently available human RNA polymerase ChIP-seq datasets. Occupancy maps are combined with a comprehensive multi-class promoter set that includes protein-coding genes, noncoding genes, and repetitive elements. While our genomic survey appropriately identifies recruitment of Pol I, II, and III to canonical target genes, we unexpectedly discover widespread recruitment of the Pol III machinery to promoters of specific protein-coding genes, supported by colocalization patterns observed for several Pol III-specific subunits. We show that Pol III-occupied Pol II promoters are enriched for small, nascent RNA reads terminating in a run of 4 Ts, a unique hallmark of Pol III transcription termination and evidence of active Pol III activity at these sites. Pol III disruption differentially modulates the expression of Pol III-occupied coding genes, which are functionally enriched for ribosomal proteins and genes broadly linked to unfavorable outcomes in cancer. Our map also identifies additional, currently unannotated genomic elements occupied by Pol III with clear signatures of nascent RNA species that are sensitive to disruption of La (SSB) - a Pol III-related RNA chaperone protein. These findings reshape our current understanding of the interplay between Pols II and III and identify potentially novel small ncRNAs with broad implications for gene regulatory paradigms and RNA biology.

A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multi-Modal.

Knowledge graph reasoning (KGR), aiming to deduce new facts from existing facts based on mined logic rules underlying knowledge graphs (KGs), has become a fast-growing research direction. It has been proven to significantly benefit the usage of KGs in many AI applications, such as question answering, recommendation systems, and etc. According to the graph types, existing KGR models can be roughly divided into three categories, i.e., static models, temporal models, and multi-modal models. Early works in this domain mainly focus on static KGR, and recent works try to leverage the temporal and multi-modal information, which are more practical and closer to real-world. However, no survey papers and open-source repositories comprehensively summarize and discuss models in this important direction. To fill the gap, we conduct a first survey for knowledge graph reasoning tracing from static to temporal and then to multi-modal KGs. Concretely, the models are reviewed based on bi-level taxonomy, i.e., top-level (graph types) and base-level (techniques and scenarios). Besides, the performances, as well as datasets, are summarized and presented. Moreover, we point out the challenges and potential opportunities to enlighten the readers. The corresponding open-source repository is shared on GitHub https://github.com/LIANGKE23/Awesome-Knowledge-Graph-Reasoning.

Cancer-associated snaR-A noncoding RNA interacts with core splicing machinery and disrupts processing of mRNA subpopulations.

RNA polymerase III (Pol III) activity in cancer is linked to the production of small noncoding (nc)RNAs that are otherwise silent in most tissues. snaR-A (small NF90-associated RNA isoform A) - a hominid-specific ncRNA shown to enhance cell proliferation, migration, and invasion - is a cancer-emergent Pol III product that remains largely uncharacterized despite promoting growth phenotypes. Here, we applied a combination of genomic and biochemical approaches to study the biogenesis and subsequent protein interactions of snaR-A and to better understand its role as a putative driver of cancer progression. By profiling the chromatin landscapes across a multitude of primary tumor types, we show that predicted snaR-A upregulation is broadly linked with unfavorable outcomes among cancer patients. At the molecular level, we unexpectedly discover widespread interactions between snaR-A and mRNA splicing factors, including SF3B2 - a core component of the U2 small nuclear ribonucleoprotein (snRNP). We find that SF3B2 levels are sensitive to high snaR-A abundance and that depletion of snaR-A alone is sufficient to decrease intron retention levels across subpopulations of mRNA enriched for U2 snRNP occupancy. snaR-A sensitive genes are characterized by high GC content, close spatial proximity to nuclear bodies concentrated in pre-mRNA splicing factors, and functional enrichment for proteins involved in deacetylation and autophagy. We highlight examples of splicing misregulation and increased protein levels following snaR-A depletion for a wide-ranging set of factors, suggesting snaR-A-driven splicing defects may have far-reaching effects that re-shape the cellular proteome. These findings clarify the molecular activities and consequences of snaR-A in cancer, and altogether establish a novel mechanism through which Pol III overactivity may promote tumorigenesis.

SARF: Aliasing Relation-Assisted Self-Supervised Learning for Few-Shot Relation Reasoning.

Few-shot relation reasoning on knowledge graphs (FS-KGR) is an important and practical problem that aims to infer long-tail relations and has drawn increasing attention these years. Among all the proposed methods, self-supervised learning (SSL) methods, which effectively extract the hidden essential inductive patterns relying only on the support sets, have achieved promising performance. However, the existing SSL methods simply cut down connections between high-frequency and long-tail relations, which ignores the fact, i.e., the two kinds of information could be highly related to each other. Specifically, we observe that relations with similar contextual meanings, called aliasing relations (ARs), may have similar attributes. In other words, the ARs of the target long-tail relation could be in high-frequency, and leveraging such attributes can largely improve the reasoning performance. Based on the interesting observation above, we proposed a novel Self-supervised learning model by leveraging Aliasing Relations to assist FS-KGR, termed . Specifically, we propose a graph neural network (GNN)-based AR-assist module to encode the ARs. Besides, we further provide two fusion strategies, i.e., simple summation and learnable fusion, to fuse the generated representations, which contain extra abundant information underlying the ARs, into the self-supervised reasoning backbone for performance enhancement. Extensive experiments on three few-shot benchmarks demonstrate that achieves state-of-the-art (SOTA) performance compared with other methods in most cases.