Patent data generally includes information from different perspectives or different types, and its heterogeneous attributes can be greatly beneficial to data clustering analysis. However, the existing patent analysis method always focus on the patent text cues, and such a strategy merely depends on the feature information to capture the data characteristics, failing to multi-type informative patent representation. Therefore, in this paper, to model the underlying structure/relationships of patent data, we employ the knowledge graph to depict the heterogeneous attributes of patent, and propose a novel Knowledge Graph-based Patent Clustering (KGPC) method, where the relationship reconstruction in knowledge graph as well as clustering-oriented representation refinement for patent clustering are jointly considered. With this model, there are three components, i.e., entity representation refinement, relationship reconstruction and self-supervised entity clustering. Given a patent knowledge graph as input, the entity representation refinement can be mutually boosted by the relationship reconstruction and self-supervised clustering objective, thereby leading to a balanced clustering-oriented output. Extensive experiments on several real-world patent knowledge graph datasets validate the effectiveness of KGPC while compared with the state-of-the-art.

Due to the emergency of multi-view graph data, considerable attention is focused on the multi-view graph clustering. Although great efforts have been made in developing the multi-view graph clustering methods, most of them implicitly follow the homophily assumption, where the connected nodes with edges tend to be in the same category. As a matter of fact, such an ideal assumption is hard to be satisfied in the real-world graph data, and there are some heterogeneous edges connecting dissimilar nodes in graph. How to well consider the homophily and refine the noisy/heterogeneous edges in multi-view graph clustering still remains an under-explored challenge. Therefore, in this paper, we propose a Homophily-enhanced Adaptive Graph Refinement for Multi-view Graph Clustering (HomoMGC) method, where an adaptive graph refinement strategy is seamlessly designed. Specifically, a feature-oriented graph is constructed based on the shared feature, and an integrated graph is computed by averagely fusing all the input adjacent graphs. Then, the feature-oriented graph and integrated graph are stacked into a graph tensor with a low-rank tensor constraint, where a refined affinity probability matrix can be adaptively recovered from the integrated graph by considering multiple graph information as well as the semantics features. Extensive experiments on several benchmark datasets demonstrate the superiority of HomoMGC compared with the state-of-the-art graph clustering methods. For the code reproducibility, the source code of HomoMGC is public available at https://github.com/ManshengChen/Code-for-HomoMGc-master.

In the evolving landscape of sequential recommendation systems, the application of Large Language Models (LLMs) is increasingly prominent. However, current attempts typically utilize general-purpose LLMs, which present a mismatch in capability and a large semantic gap relative to the specialized needs of recommendation tasks. To tackle these issues, we introduce RecCoder, an innovative model that reformulates sequential recommendation as a code completion task. This approach leverages the superior reasoning capability of code LLMs as a backbone, aligning well with the requirements of recommendation systems. To bridge the semantic gap, RecCoder creates extra tokens for each item and employs item content to initialize token embeddings. Furthermore, we have developed a suite of Semantic Adaptation Fine-tuning tasks, tailored to enhance the model's acquisition of both content and collaborative semantic information, thus aligning the model's intrinsic capabilities with the unique demands of recommendation tasks. Through extensive testing on three public datasets, RecCoder has shown remarkable improvements over existing models in terms of recommendation accuracy and efficiency. This success highlights the substantial yet previously underexplored potential of code LLMs in improving recommendation accuracy and efficiency, suggesting a promising new direction for future research in this area. The implementation code is accessible at https://github.com/AllminerLab/Code-for-RecCoder-master.

In next basket recommendation, baskets are usually formed through a large number of user interactions with items in the early stage. In general, the existing methods for next basket recommendation primarily focus on historical purchase behavior of users, assuming that user purchase interests are static, and overlook the dynamic and diverse changes in user purchase interests. In order to fully capture dynamic user interests and provide users with more diverse recommendations, we propose our method, Dynamic Heterogeneous Graph Prompt (DHGP), for next basket recommendation. By constructing a dynamic heterogeneous graph, we can adequately consider the influence of various interactive behaviors on the user's baskets at different times. Furthermore, we introduce a periodic dynamic heterogeneous prompt strategy to capture the interest directions between baskets from different users and provide users with more diverse interest directions. Extensive experimental validation on six real world datasets demonstrates that our method shows strong applicability across datasets under various conditions and outperforms several state-of-the-art recommendation methods. To the best of our knowledge, DHGP is the first next basket recommendation method that effectively combines dynamic and heterogeneous information. The implementation code is accessible at https://github.com/AllminerLab.

With the explosive growth of information, recommendation systems have emerged to alleviate the problem of information overload. In order to improve the performance of recommendation systems, many existing methods introduce Large Language Models to extract textual information from description text. However, Large Language Models are trained on large-scale generic textual data and may face a semantic gap for downstream recommendation tasks. To address the above issues, we propose Contrastive Learning for Adapting Language Model to Sequential Recommendation (CLA-Rec). In CLA-Rec, we first extract text embeddings from description text using Large Language Models and align the text embeddings learned by Large Language Models with the collaborative information through contrastive learning to obtain high-quality item representations. Through semantic alignment, we bridge the semantic gap between Large Language Models and the recommendation task. To map textual information and collaborative information into user representations, we utilize a Transformer model to learn user representations and capture user preferences by combining the semantically aligned item representations. Extensive experiments on three public datasets demonstrate that our method outperforms state-of-the-art approaches on multiple evaluation metrics, illustrating the effectiveness of the CLA-Rec model in adapting Large Language Models to recommendation tasks.

Federated graph learning (FGL) has risen as a promising paradigm for collaboratively training graph neural networks while safeguarding data privacy. Nevertheless, the distributed nature of FGL also renders it susceptible to backdoor attacks. Although backdoor attacks are recognized as a significant threat to both centralized graph learning and federated learning (FL), the study of such attacks in FGL remains very limited. Current research on FGL backdoor attacks often merely adapts centralized graph backdoor attacks or FL backdoor attacks designed for image classification tasks to the FGL context, leaving key issues such as the effectiveness of triggers and the stealthiness of malicious models largely unexplored. To bridge this research gap, in this paper, we propose a novel backdoor attack, named FGLBA, targeting the FGL paradigm. Specifically, we design an input-aware trigger generator that generates a customized trigger for each target node based on its feature vector and neighborhood information, making that poisoned nodes injected with triggers are more likely misclassified into the category specified by the attacker. Additionally, we develop a stealthy federated backdoor training strategy that leverages collaborative optimization among multiple malicious clients to circumvent existing server-side defenses. The trigger generator and malicious clients' local models are iteratively optimized through a bilevel optimization framework, enabling the malicious models to achieve optimal attack performance under the optimal trigger generator. Extensive experiments on 4 real-world datasets demonstrate the effectiveness and superiority of our attack, outperforming all baseline attacks and successfully bypass 6 state-of-the-art and classical FL backdoor defenses.

Next-basket recommendation (NBR) infers a set of items that a user will interact with in the next basket. Existing methods often struggle with the data sparsity problem, particularly when the number of baskets is significantly large due to diverse user behaviors. Cross-domain recommendation (CDR) can effectively alleviate this problem in NBR by transferring knowledge across different domains. Nevertheless, these methods often rely on the similarities of overlapping users, which leads to the negative transfer problem and ignores the overlapping items that are general in real-world scenarios like chain stores. In this paper, we provide a clear symbolic definition of cross-store recommendation (CSR) and distinguish it from CDR. We also propose a novel CSNBR model for cross-store next-basket recommendation task. To fully model the transferable collaborative information between two stores, we learn the embeddings of users, baskets, and items by two intra-store bipartite graphs, and use an inter-store unified bipartite graph to transfer the previously learned knowledge. Furthermore, to alleviate the negative transfer problem, we propose to reconstruct the inter-store unified bipartite graph by utilizing user embeddings obtained from the transfer layer and the disentanglement layer. We also employ two sequence encoders to model the historical sequential information at basket-level and item-level. Extensive experiments conducted on real-world datasets demonstrate the effectiveness of the CSNBR model.

How to localize the rumor source is a common interest of all sectors of the society. Many researchers have tried to use deep-learning-based graph models to detect rumor sources, but they have neglected how to train their deep-learning-based graph models in thenoisysocial network environmentefficiently. Especially for deep learning models, the performance relies on the data scale. However, even though its known that a substantial amount of rumor data distributed across multiple edge servers (e.g., cross-platform), due to conflicting business interests, its challenging to coordinate all parties to train a model driven by many samples while avoiding moving data. Federated learning, is an effective technique to bridge this gap. Therefore, this paper proposes aDistributedRumorSourceDetection viaBoostedFederatedLearning (DRSDBFL). Specifically, this paper proposes an effective rumor source detection method based on a deep-learning-based graph model with a denoising module. To the best of our knowledge, we are the first to attempt to the use of a denoising module to reduce the noisy effects of social networks. Then, we propose a novel boosted federated learning mechanism through boosting the high-quality edge worker to improve the training efficiency. Finally, the effectiveness of the proposed method is verified by extensive experiments.

With the development of visual programming languages, researchers pay attention to the automatic evaluation of visual projects. Previous work focus on the code evaluation but ignored another essential part—the visualization results. Scratch is a widely used programming platform, and projects created on it are displayed in the form of cartoon clips. It is valuable to explore the visual aesthetics embodied in these clips to fill the gap in the assessment system. We propose a model that predicts the human view scores of cartoon clips created on Scratch. Our method is divided into two steps to evaluate the aesthetic of the sequence images that compose cartoon clips. First, we train an image classification network to predict the relative aesthetics of individual images. Then we construct an aesthetic space for the sequence image and improve the rating within a specific range. We put forward ScratchGAN to generate a Scratch-cartoon-style aesthetic analysis data set for training the classification network. Experimental results show that our Generative Adversarial Network framework can well transform photos into a Scratch-cartoon style. The single image assessment network can generate predictions that fit human cartoon aesthetic opinions. Our method achieves satisfactory results in the aesthetic evaluation of sequence cartoon images.

Modern communication and computing technology is the basic support of the industrial intelligent systems (IIS). As a key component of IIS, the smart port is essential to be offered low-complexity and high-reliability communication service, especially for driverless engineering vehicles. However, it is combined and nonconvex to find the optimal association between vehicles and the road side units (RSUs). Besides, due to the mobility of vehicles and the severe path loss of mmWave links, beam switching and reassociation between vehicles and RSUs are required frequently, which brings a great challenge to the communication for the IIS. A low complexity closed-loop strategy based on distributed cooperation for mmWave communication in IIS is proposed in this study, in which user association and beam tracking with the assistance of beam pools is proposed. Many-to-many user association is established based on distributed multiagent reinforcement learning, where the vehicle can independently select the set of serving RSUs based on the local observation without information exchange with others, reducing the signaling overhead and computational complexity while improving system throughput. Furthermore, multipoint-cooperation soft switching of beams based on beam tracking improves the reliability of mmWave communication with the smaller training cost. Extensive analysis and simulation results demonstrate that the proposed solution significantly reduces the complexity of the mmWave communication while improving the throughput and stability in IIS.

The authors assess the possible impact of optics on database and knowledge base systems, focusing on storage, interconnection, and processing. Various types of optical disks and page-oriented holographic memories are discussed. In the interconnection section, data communication is discussed at a variety of levels. Under processing, applications involving optical content addressable memories, optical data/knowledge base machines, and optics applied to full text processing will be optoelectronic, with easy technology providing its strength to the problem under consideration. It is noted that optical interconnection is superior to electronic interconnection in many cases and that the rapid advance of optical storage holds the potential of hundreds of megabytes per second data rates from a single storage unit. It is noted that optical processing holds considerable promise but lags behind primarily because digital optical device development is in its infancy.>