In contrast to traditional single-view clustering methods, multiview clustering (MVC) approaches aim to extract, analyze, and integrate structural information from diverse perspectives, providing a more comprehensive understanding of internal data structures. However, with an increasing number of views, maintaining the integrity of view information becomes challenging, giving rise to incomplete MVC (IMVC) methods. While existing IMVC methods have shown notable performance on many incomplete multiview (IMV) databases, they still grapple with two key shortcomings: 1) they treat the information of each view as a whole, disregarding the differences among samples within each view; and 2) they rely on eigenvalue and eigenvector operations on the view matrix, limiting their scalability for large-scale samples and views. To overcome these limitations, we propose a novel multiview clustering with consistent information (IMVC-CI) of sample points. Our method explores the multiview information set of sample points to extract consensus structural information and subsequently restores unknown information in each view. Importantly, our approach operates independently on individual sample points, eliminating the need for eigenvalue and eigenvector operations on the view information matrix and facilitating parallel computation. This significantly enhances algorithmic efficiency and mitigates challenges associated with dimensionality. Experimental results on various public datasets demonstrate that our algorithm outperforms state-of-the-art IMVC methods in terms of clustering performance and computational efficiency. The code for our article has been uploaded to https://github.com/PhdJiayiTang/IMVC-CI.git.

GraIL and its variants have shown their promising capacities for inductive relation reasoning on knowledge graphs. However, the uni-directional message-passing mechanism hinders such models from exploiting hidden mutual relations between entities in directed graphs. Besides, the enclosing subgraph extraction in most GraIL-based models restricts the model from extracting enough discriminative information for reasoning. Consequently, the expressive ability of these models is limited. To address the problems, we propose a novel GraIL-based framework, termed MINES, by introducing a Message Intercommunication mechanism on the Neighbor-Enhanced Subgraph. Concretely, the message intercommunication mechanism is designed to capture the omitted hidden mutual information. It introduces bi-directed information interactions between connected entities by inserting an undirected/bi-directed GCN layer between uni-directed RGCN layers. Moreover, inspired by the success of involving more neighbors in other graph-based tasks, we extend the neighborhood area beyond the enclosing subgraph to enhance the information collection for inductive relation reasoning. Extensive experiments prove the promising capacity of the proposed MINES from various aspects, especially for the superiority, effectiveness, and transfer ability.

Incomplete multi-view clustering has attracted much attention due to its ability to handle partial multi-view data. Recently, similarity-based methods have been developed to explore the complete relationship among incomplete multi-view data. Although widely applied to partial scenarios, most of the existing approaches are still faced with two limitations. Firstly, fusing similarities constructed individually on each view fails to yield a complete unified similarity. Moreover, incomplete similarity generation may lead to anomalous similarity values with column sum constraints, affecting the final clustering results. To solve the above challenging issues, we propose a Sample-level Cross-view Similarity Learning (SCSL) method for Incomplete Multi-view Clustering. Specifically, we project all samples to the same dimension and simultaneously construct a complete similarity matrix across views based on the inter-view sample relationship and the intra-view sample relationship. In addition, a simultaneously learning consensus representation ensures the validity of the projection, which further enhances the quality of the similarity matrix through the graph Laplacian regularization. Experimental results on six benchmark datasets demonstrate the ability of SCSL in processing incomplete multi-view clustering tasks. Our code is publicly available at https://github.com/Tracesource/SCSL.

Sequential recommendation has been developed to predict the next item in which users are most interested by capturing user behavior patterns embedded in their historical interaction sequences. However, most existing methods appear to exhibit limitations in modeling fine-grained dependencies embedded in users’ various periodic behavior patterns and heterogeneous dependencies across multi-behaviors. Towards this end, we propose a Filter-enhanced Hypergraph Transformer framework for Multi-Behavior Sequential Recommendation (FHT-MB) to address the above challenges. Specifically, a multi-scale filter layer equipped with multi-learnable filters is devised to encode behavior-aware sequential patterns emerging from different periodic trends (e.g., daily or weekly routines), and then a hypergraph structure is devised to extract heterogeneous dependencies across users’ multiple types of behaviors. Extensive experiments on two real-world e-commerce datasets show the superiority of our proposed FHT-MB over various state-of-the-art methods.1

Deep clustering, which can elegantly exploit data representation to seek a partition of the samples, has attracted intensive attention. Recently, combining auto-encoder (AE) with graph neural networks (GNNs) has accomplished excellent performance by introducing structural information implied among data in clustering tasks. However, we observe that there are some limitations of most existing works: 1) in practical graph datasets, there exist some noisy or inaccurate connections among nodes, which would confuse network learning and cause biased representations, thus leading to unsatisfied clustering performance; 2) lacking dynamic information fusion module to carefully combine and refine the node attributes and the graph structural information to learn more consistent representations; and 3) failing to exploit the two separated views' information for generating a more robust target distribution. To solve these problems, we propose a novel method termed deep fusion clustering network with reliable structure preservation (DFCN-RSP). Specifically, the random walk mechanism is introduced to boost the reliability of the original graph structure by measuring localized structure similarities among nodes. It can simultaneously filter out noisy connections and supplement reliable connections in the original graph. Moreover, we provide a transformer-based graph auto-encoder (TGAE) that can use a self-attention mechanism with the localized structure similarity information to fine-tune the fused topology structure among nodes layer by layer. Furthermore, we provide a dynamic cross-modality fusion strategy to combine the representations learned from both TGAE and AE. Also, we design a triplet self-supervision strategy and a target distribution generation measure to explore the cross-modality information. The experimental results on five public benchmark datasets reflect that DFCN-RSP is more competitive than the state-of-the-art deep clustering algorithms. The corresponding code is available at https://github.com/gongleii/DFCN-RSP.

Sequential diagnosis prediction (SDP) is a challenging task, aiming to predict patients’ future diagnoses based on their historical medical records. While methods based on graph neural networks (GNNs) have proven successful for this task, they typically focus on modeling pairwise diseases using a global disease combination graph. However, these approaches neglect the fine-grained higher-order relations among persistent and emerging diseases within a single visit, which may contain crucial clues to predict the next diagnosis. Additionally, they fail to fully leverage patient-related clinical information present in electronic health records (EHRs). To address these challenges, this paper proposes a novel approach called the fusion of Dynamic Hypergraph and Clinical Event (DHCE) for sequential diagnosis prediction. The proposed method aims to exploit the fine-grained higher-order relations among diagnoses within a visit and leverage clinical event information from EHRs to improve the accuracy of predicting the next diagnosis. Specifically, DHCE categorizes diagnoses within a single visit in a fine-grained granularity into persistent and emerging categories based on a patient’s historical diagnoses. It then constructs dynamic hypergraphs to capture higher-order disease relations within each visit. Next, we design a transition function to extract the transitional context from previous visits in order to generate the visit representation. Furthermore, to fully leverage patient-related clinical events in a visit, we utilize Bio-Clinical BERT to encode them and generate the clinical event representation for each visit. Finally, we combine the visit representation and event representation to generate a comprehensive patient representation, which is then used to predict the patient’s next diagnosis. Experimental results on two benchmark datasets consistently demonstrate that DHCE outperforms state-of-the-art methods1.

Globally, gastric cancer is the third most deadly cancer. More than one million new patients have gastric cancer every year, and the cure rate is extremely low. The probability of successful treatment of gastric cancer and the possibility of recovery from treatment are closely related to the subtype of cancer. To improve the quality of life, it is of great practical significance to correctly distinguish clinically relevant cancer subtypes based on omics data for precise treatment to save gastric cancer patients. However, gene expression data has tens of thousands of feature dimensions, and only a few of them help predict gastric cancer subtype classification. Moreover, the important features selected by existing feature selection algorithms do not achieve good results in predicting gastric cancer subtypes. To this end, this paper proposes a Gradient Boosting Deep Feature Selection (GBDFS) algorithm for gastric cancer subtype classification for the first time, to reduce the feature dimension of omics data and improve the classification accuracy of gastric cancer subtypes. The self-built deep neural network classifier was used to evaluate the prediction accuracy and cost of gastric cancer subtype classification before and after feature selection, which proved the effectiveness of the algorithm. In addition, by comparing the other eight existing feature selection algorithms, this paper concludes that GBDFS has an accuracy rate as high as 99.115%. And the robustness of the algorithm is verified by two classification algorithms of support vector machines and deep neural networks. The best low-dimensional feature subset of GBDFS was selected as a biomarker for gastric cancer subtype classification, with 24 gene features that effectively distinguish gastric cancer subtypes. Finally, bioinformatics analysis such as survival analysis, Gene Enrichment Ontology (GO) terms and biological pathways are done.

Negative sequential patterns (NSP) become increasingly important and most of the existing methods introduce so strict constraints that many meaningful patterns would be lost. In this paper, we loosen these constraints and solve a series of consequent problems. Firstly, negative containment is defined to determine whether a data sequence contains a negative sequence. Secondly, an efficient method to fast calculate the supports of negative sequences is proposed. Finally, a novel and efficient algorithm, NegI-NSP, is proposed to efficiently identify meaningful NSP. Experiments show that NegI-NSP can efficiently obtain more meaningful patterns by directly using existing PSP mining algorithms.