Search

In this paper, how to efficiently find the optimal path in complex warehouse layout and make real-time decision is a key problem. This paper proposes a new method of Proximal Policy Optimization (PPO) and Dijkstra's algorithm, Proximal policy-Dijkstra (PP-D). PP-D method realizes efficient strategy learning and real-time decision making through PPO, and uses Dijkstra algorithm to plan the global optimal path, thus ensuring high navigation accuracy and significantly improving the efficiency of path planning. Specifically, PPO enables robots to quickly adapt and optimize action strategies in dynamic environments through its stable policy updating mechanism. Dijkstra's algorithm ensures global optimal path planning in static environment. Finally, through the comparison experiment and analysis of the proposed framework with the traditional algorithm, the results show that the PP-D method has significant advantages in improving the accuracy of navigation prediction and enhancing the robustness of the system. Especially in complex warehouse layout, PP-D method can find the optimal path more accurately and reduce collision and stagnation. This proves the reliability and effectiveness of the robot in the study of complex warehouse layout navigation algorithm.

Gene-gene interactions play a crucial role in the manifestation of complex human diseases. Uncovering significant gene-gene interactions is a challenging task. Here, we present an innovative approach utilizing data-driven computational tools, leveraging an advanced Transformer model, to unearth noteworthy gene-gene interactions. Despite the efficacy of Transformer models, their parameter intensity presents a bottleneck in data ingestion, hindering data efficiency. To mitigate this, we introduce a novel weighted diversified sampling algorithm. This algorithm computes the diversity score of each data sample in just two passes of the dataset, facilitating efficient subset generation for interaction discovery. Our extensive experimentation demonstrates that by sampling a mere 1\% of the single-cell dataset, we achieve performance comparable to that of utilizing the entire dataset.

By leveraging GPT-4 for ontology narration, we developed GPTON to infuse structured knowledge into LLMs through verbalized ontology terms, achieving accurate text and ontology annotations for over 68% of gene sets in the top five predictions. Manual evaluations confirm GPTON's robustness, highlighting its potential to harness LLMs and structured knowledge to significantly advance biomedical research beyond gene set annotation., Comment: 25 pages, 6 figures

Simulated patient systems play a crucial role in modern medical education and research, providing safe, integrative learning environments and enabling clinical decision-making simulations. Large Language Models (LLM) could advance simulated patient systems by replicating medical conditions and patient-doctor interactions with high fidelity and low cost. However, ensuring the effectiveness and trustworthiness of these systems remains a challenge, as they require a large, diverse, and precise patient knowledgebase, along with a robust and stable knowledge diffusion to users. Here, we developed AIPatient, an advanced simulated patient system with AIPatient Knowledge Graph (AIPatient KG) as the input and the Reasoning Retrieval-Augmented Generation (Reasoning RAG) agentic workflow as the generation backbone. AIPatient KG samples data from Electronic Health Records (EHRs) in the Medical Information Mart for Intensive Care (MIMIC)-III database, producing a clinically diverse and relevant cohort of 1,495 patients with high knowledgebase validity (F1 0.89). Reasoning RAG leverages six LLM powered agents spanning tasks including retrieval, KG query generation, abstraction, checker, rewrite, and summarization. This agentic framework reaches an overall accuracy of 94.15% in EHR-based medical Question Answering (QA), outperforming benchmarks that use either no agent or only partial agent integration. Our system also presents high readability (median Flesch Reading Ease 77.23; median Flesch Kincaid Grade 5.6), robustness (ANOVA F-value 0.6126, p>0.1), and stability (ANOVA F-value 0.782, p>0.1). The promising performance of the AIPatient system highlights its potential to support a wide range of applications, including medical education, model evaluation, and system integration., Comment: 42 pages, 6 figures, 7 tables

This study presents a thorough comparative analysis between post-Newtonian (PN) and numerically relativistic (NR) waveforms in eccentric orbits, covering nonspinning and spin-aligned configurations. The comparison examines frequency, amplitude, and phase characteristics of various harmonic modes, such as 22, 21, 33, 32, 44, 43, and 55 modes. The study utilizes eccentric PN waveforms based on 3PN quasi-Keplerian parameterization with 3PN radiative reaction, surpassing Newtonian quadrupole moment with higher-order moments. NR waveforms from RIT and SXS catalogs span mass ratios from 1/4 to 1, eccentricities up to 0.45, and durations exceeding $17000M$ across nonspinning and spin-aligned configurations. Focusing on the 22 mode, frequency comparisons between quadrupole and higher-order moments of $\Psi_4^{22}$ and $h^{22}$ were conducted. Amplitude comparisons revealed superior accuracy in quadrupole moments of $\Psi_4^{22}$. Analysis of total 180 sets of eccentric waveforms showed increasing fitting residuals with rising eccentricity, correlating with smaller mass ratios. Comparisons of initial eccentricity from PN fitting, 3PN quasi-Keplerian parameterization, and RIT/SXS catalogs revealed alignment discrepancies. Frequency, phase, and amplitude comparisons of 22 modes showed consistent inspiral behavior between PN and NR, with divergences near merger for nonspinning PN and pre-200M for spin-aligned PN., Comment: Comments are very welcome and it have been submitted to PRD with 18 figures

Backscatter communication (BC) has emerged as a pivotal wireless communication paradigm owing to its low-power and cost-effective characteristics. However, BC faces various challenges from its low signal detection rate to its security vulnerabilities. Recently, reconfigurable intelligent surfaces (RIS) have surfaced as a transformative technology addressing power and communication performance issues in BC. However, the potential of RIS in addressing the security challenges of BC remains uncharted. This paper investigates the secrecy performance of RIS-aided BC, where all channels are distributed according to the Fisher-Snedecor $\mathcal{F}$ distribution. Specifically, we consider a RIS with $N$ reflecting elements to help a backscatter device (BD) establish a smart environment and enhance the secrecy performance in BC. Due to the nature of BC systems, our analysis considers two possible scenarios (i) in the absence of direct links and (ii) in the presence of direct links. In both cases, we first derive compact analytical expressions of the probability density function (PDF) and cumulative distribution function (CDF) for the received signal-to-noise ratio (SNR) at both a legitimate receiver and an eavesdropper. Then, to analyze the secrecy performance, we further derive analytical expressions of the average secrecy capacity (ASC) and secrecy outage probability (SOP) for both mentioned scenarios. In addition, regarding the importance of system behavior in a high SNR regime, we provide an asymptotic analysis of the SOP and ASC. Eventually, the Monte-Carlo simulation is used to validate the analytical results, revealing that utilizing RIS can greatly improve the secrecy performance of the BC system relative to traditional BC setups that do not incorporate RIS.

We revisit the gravitational lensing of light or gravitational waves by Schwarzschild black hole in geometric optics. Instead of a single massless particle, we investigate the collective behavior of a congruence of light/gravitational rays, described by the geodesic deviation equation (GDE). By projecting on the Newman-Penrose tetrad, GDE is decoupled, and we find an analytical Dyson-like series solution in the weak deflection and thin lens limits. Based on such a solution, we study the evolution of cross-sectional area and axis ratio. Finally, we reproduce the magnification and axis ratio of the lensing images up to the second order of weak deflection approximation and improve some missing corrections in previous works., Comment: 17 pages, 5 figures

We present a novel method to constrain the formation time of the Milky Way disc using the chrono-kinematic signatures of the inner Galaxy. We construct an O-rich Mira variable sample from the Gaia Long-period Variable catalogue to study the kinematic behaviour of stars with different ages in the inner Galaxy. From the Auriga suite of cosmological zoom-in simulations, we find that the age of the oldest stellar population with imprints of the bar in density and kinematics matches the disc spin-up epoch. This is because stars born before the spin-up show insufficient rotation and are not kinematically cold enough to be efficiently trapped by the bar. We find that the bar kinematic signature disappears for Mira variables with a period shorter than 190 days. Using the period-age relation of Mira variables, we constrain the spin-up epoch of the Milky Way to be younger than $\sim11-12$~Gyr (redshift $\sim3$). We also discuss and compare our method and result to other evidence of the Milky Way spin-up epoch under the context of a realistic age uncertainty. Age uncertainty leads to an overestimation of the disc formation time when performing backward modelling. Our constrain of the spin-up epoch is independent from previous studies because it relies on the kinematics of the inner Galaxy instead of the solar vicinity., Comment: 16 pages, 10 figures. Submitted to MNRAS. Comments welcome!

Knowledge graph embedding (KGE) constitutes a foundational task, directed towards learning representations for entities and relations within knowledge graphs (KGs), with the objective of crafting representations comprehensive enough to approximate the logical and symbolic interconnections among entities. In this paper, we define a metric Z-counts to measure the difficulty of training each triple ($<$head entity, relation, tail entity$>$) in KGs with theoretical analysis. Based on this metric, we propose \textbf{CL4KGE}, an efficient \textbf{C}urriculum \textbf{L}earning based training strategy for \textbf{KGE}. This method includes a difficulty measurer and a training scheduler that aids in the training of KGE models. Our approach possesses the flexibility to act as a plugin within a wide range of KGE models, with the added advantage of adaptability to the majority of KGs in existence. The proposed method has been evaluated on popular KGE models, and the results demonstrate that it enhances the state-of-the-art methods. The use of Z-counts as a metric has enabled the identification of challenging triples in KGs, which helps in devising effective training strategies., Comment: 16 pages, 3 figures

The concept of the sharing economy has gained broad recognition, and within this context, Sharing E-Bike Battery (SEB) have emerged as a focal point of societal interest. Despite the popularity, a notable discrepancy remains between user expectations regarding the remaining battery range of SEBs and the reality, leading to a pronounced inclination among users to find an available SEB during emergency situations. In response to this challenge, the integration of Artificial Intelligence of Things (AIoT) and battery-swap services has surfaced as a viable solution. In this paper, we propose a novel structural Transformer-based model, referred to as the SEB-Transformer, designed specifically for predicting the battery range of SEBs. The scenario is conceptualized as a dynamic heterogeneous graph that encapsulates the interactions between users and bicycles, providing a comprehensive framework for analysis. Furthermore, we incorporate the graph structure into the SEB-Transformer to facilitate the estimation of the remaining e-bike battery range, in conjunction with mean structural similarity, enhancing the prediction accuracy. By employing the predictions made by our model, we are able to dynamically adjust the optimal cycling routes for users in real-time, while also considering the strategic locations of charging stations, thereby optimizing the user experience. Empirically our results on real-world datasets demonstrate the superiority of our model against nine competitive baselines. These innovations, powered by AIoT, not only bridge the gap between user expectations and the physical limitations of battery range but also significantly improve the operational efficiency and sustainability of SEB services. Through these advancements, the shared electric bicycle ecosystem is evolving, making strides towards a more reliable, user-friendly, and sustainable mode of transportation., Comment: 9pages, 6figures, accepted by IEEE ICWS 2024 The International Conference on Web Services

Scalar-tensor gravity, exemplified by Brans-Dicke (BD) gravity, introduces additional scalar polarization modes that contribute scalar radiation alongside tensor modes. We conduct a comprehensive analysis of how gravitational wave generation and propagation effects under Brans-Dicke gravity are encoded into the astrophysical stochastic gravitational wave background (AGWB). We perform end-to-end analyses of realistic populations of simulated coalescing binary systems to generate AGWB mock data with third-generation gravitational wave detectors and conducted a complete Bayesian analysis for the first time. We find the uncertainties in the population properties of binary black holes (BBH) significantly affect the ability to constrain BD gravity. Under the most favorable conditions, the upper limit may suggest $\omega_{\rm BD} > 816$. Furthermore, we explore the detectability of potential scalar backgrounds arising from binary neutron star (BNS) mergers, setting upper limits on scalar backgrounds expected to be two orders of magnitude lower than the total background contributed by both BBH and BNS in one year of observational data. We conclude that for ambiguous populations, employing waveform matching with individual sources provides a more robust approach to constrain Brans-Dicke gravity. However, the future detection of a potential scalar background within the AGWB could provide significant support for gravity theories beyond General Relativity., Comment: 26 pages, 6 figures, and 2 tables

The rapid growth of the automotive industry has exacerbated the conflict between the complex traffic environment, increasing communication demands, and limited resources. Given the imperative to mitigate traffic and network congestion, analyzing the performance of Internet of Vehicles (IoV) mesh networks is of great practical significance. Most studies focus solely on individual performance metrics and influencing factors, and the adopted simulation tools, such as OPNET, cannot achieve the dynamic link generation of IoV mesh networks. To address these problems, a network performance analysis model based on actual switches is proposed. First, a typical IoV mesh network architecture is constructed and abstracted into a mathematical model that describes how the link and topology changes over time. Then, the task generation model and the task forwarding model based on actual switches are proposed to obtain the real traffic distribution of the network. Finally, a scientific network performance indicator system is constructed. Simulation results demonstrate that, with rising task traffic and decreasing node caching capacity, the packet loss rate increases, and the task arrival rate decreases in the network. The proposed model can effectively evaluate the network performance across various traffic states and provide valuable insights for network construction and enhancement.

The integration of Large Language Models (LLM) with Knowledge Representation Learning (KRL) signifies a significant advancement in the field of artificial intelligence (AI), enhancing the ability to capture and utilize both structure and textual information. Despite the increasing research on enhancing KRL with LLMs, a thorough survey that analyse processes of these enhanced models is conspicuously absent. Our survey addresses this by categorizing these models based on three distinct Transformer architectures, and by analyzing experimental data from various KRL downstream tasks to evaluate the strengths and weaknesses of each approach. Finally, we identify and explore potential future research directions in this emerging yet underexplored domain.

In recent years, there has been notable interest in investigating combinatorial optimization (CO) problems by neural-based framework. An emerging strategy to tackle these challenging problems involves the adoption of graph neural networks (GNNs) as an alternative to traditional algorithms, a subject that has attracted considerable attention. Despite the growing popularity of GNNs and traditional algorithm solvers in the realm of CO, there is limited research on their integrated use and the correlation between them within an end-to-end framework. The primary focus of our work is to formulate a more efficient and precise framework for CO by employing decision-focused learning on graphs. Additionally, we introduce a decision-focused framework that utilizes GNNs to address CO problems with auxiliary support. To realize an end-to-end approach, we have designed two cascaded modules: (a) an unsupervised trained graph predictive model, and (b) a solver for quadratic binary unconstrained optimization. Empirical evaluations are conducted on various classical tasks, including maximum cut, maximum independent set, and minimum vertex cover. The experimental results on classical CO problems (i.e. MaxCut, MIS, and MVC) demonstrate the superiority of our method over both the standalone GNN approach and classical methods., Comment: 9 pages

In recent years, graph neural networks (GNNs) have become increasingly popular for solving NP-hard combinatorial optimization (CO) problems, such as maximum cut and maximum independent set. The core idea behind these methods is to represent a CO problem as a graph and then use GNNs to learn the node/graph embedding with combinatorial information. Although these methods have achieved promising results, given a specific CO problem, the design of GNN architectures still requires heavy manual work with domain knowledge. Existing automated GNNs are mostly focused on traditional graph learning problems, which is inapplicable to solving NP-hard CO problems. To this end, we present a new class of \textbf{AUTO}mated \textbf{G}NNs for solving \textbf{NP}-hard problems, namely \textbf{AutoGNP}. We represent CO problems by GNNs and focus on two specific problems, i.e., mixed integer linear programming and quadratic unconstrained binary optimization. The idea of AutoGNP is to use graph neural architecture search algorithms to automatically find the best GNNs for a given NP-hard combinatorial optimization problem. Compared with existing graph neural architecture search algorithms, AutoGNP utilizes two-hop operators in the architecture search space. Moreover, AutoGNP utilizes simulated annealing and a strict early stopping policy to avoid local optimal solutions. Empirical results on benchmark combinatorial problems demonstrate the superiority of our proposed model., Comment: 9 pages

Parton distribution functions (PDFs) form an essential part of particle physics calculations. Currently, the most precise predictions for these non-perturbative functions are generated through fits to global data. A problem that several PDF fitting groups encounter is the presence of tension in data sets that appear to pull the fits in different directions. In other words, the best fit depends on the choice of data set. Several methods to capture the uncertainty in PDFs in presence of seemingly inconsistent fits have been proposed and are currently in use. These methods are important to ensure that uncertainty in PDFs are not underestimated. Here we propose a novel method for estimating the uncertainty by introducing a generalized statistical model inspired by unsupervised machine learning techniques, namely the Gaussian Mixture Model (GMM). Using a toy model of PDFs, we demonstrate how the GMM can be used to faithfully reconstruct the likelihood associated with PDF fits, which can in turn be used to accurately determine the uncertainty on PDFs, especially in presence of tension in the fitted data sets. We further show how this statistical model reduces to the usual chi-squared likelihood function for a consistent data set and provide measures to optimize the number of Gaussians in the GMM., Comment: 37 pages, 12 figures

Decoding the key dynamical processes that shape the Galactic disk structure is crucial for reconstructing the Milky Way's evolution history. The second Gaia data release unveils a novel wave pattern in the $L_Z-\langle V_R\rangle$ space, but its formation mechanism remains elusive due to the intricate nature of involved perturbations and the challenges in disentangling their effects. Utilizing the latest Gaia DR3 data, we find that the $L_Z-\langle V_R\rangle$ wave systematically shifts towards lower $L_Z$ for dynamically hotter stars. The amplitude of this phase shift between stars of different dynamical hotness ($\Delta L_Z$) peaks around $\mathrm{2300\,km\,s^{-1}\,kpc}$. To differentiate the role of different perturbations, we perform three sets of test particle simulations, wherein a satellite galaxy, corotating transient spiral arms, and a bar plus the corotating transient spiral arms act as the sole perturber, respectively. Under the satellite impact, the phase shift amplitude decreases towards higher $L_Z$, which we interpret through a toy model of radial phase mixing. While the corotating transient spiral arms do not generate an azimuthally universal phase shift variation pattern, combining the bar and spirals generates a characteristic $\Delta L_Z$ peak at 2:1 Outer Lindblad Resonance, qualitatively resembling the observed feature. Therefore, the $L_Z-\langle V_R\rangle$ is more likely of internal origin. Furthermore, linking the $\Delta L_Z$ peak to the 2:1 Lindblad resonance offers a novel approach to estimating the pattern speed of the Galactic Bar, supporting the long/slow bar model., Comment: Submitted to ApJ, 13 pages, 8 figures, comments welcome

We perform a comprehensive investigation of the PSF smoothing effect on the measurement of concentration-related parameters ($C$, Gini, $M_{20}$) of high redshift galaxies in the HST and JWST surveys. Our sample contains massive galaxies from the CANDELS/EGS survey (0 < z < 2), and the CEERS survey (1 < z < 3). The non-parametric concentration-related parameters ($C$, Gini, $M_{20}$) and the model-dependent parameters (n, Re) of these galaxies are derived from Statmorph and GALFIT, respectively. We try to evaluate the PSF smoothing effect by comparing the concentration-related parameters to the S\'{e}rsic index in both observations and mock images. We find that the concentration index is generally underestimated, especially for smaller galaxies with higher S\'{e}rsic index (eventually converging to the concentration index of the PSF). However, galaxies with lower S\'{e}rsic index ($n \leq 1$) or larger relative size are less affected by the PSF smoothing effect. The Gini coefficient and the absolute $M_{20}$ statistic also show similar behaviour as the concentration index. Caution should be taken for the possible correction of the concentration-related parameters, where both the relative size and the S\'{e}rsic index of the galaxy are important. Compared to the HST images, the PSF smoothing is much less severe for images in the CEERS survey due to the much higher spatial resolution. In fact, it is better to use the S\'{e}rsic index rather than the non-parametric morphology indicators to trace the light concentration for galaxies at high redshifts. From the single S\'{e}rsic modelling of the HST and JWST images, we also confirm that galaxies at higher redshift are more compact with smaller $R_e$. The lower mass galaxies are more disc-like ($n\sim1$) compared to the higher mass galaxies that are more spheroid dominated ($n\sim3$)., Comment: Accepted by A&A, 21 pages, 20 figures. Comments are welcome

Unsupervised Graph Domain Adaptation (UGDA) has emerged as a practical solution to transfer knowledge from a label-rich source graph to a completely unlabelled target graph. However, most methods require a labelled source graph to provide supervision signals, which might not be accessible in the real-world settings due to regulations and privacy concerns. In this paper, we explore the scenario of source-free unsupervised graph domain adaptation, which tries to address the domain adaptation problem without accessing the labelled source graph. Specifically, we present a novel paradigm called GraphCTA, which performs model adaptation and graph adaptation collaboratively through a series of procedures: (1) conduct model adaptation based on node's neighborhood predictions in target graph considering both local and global information; (2) perform graph adaptation by updating graph structure and node attributes via neighborhood contrastive learning; and (3) the updated graph serves as an input to facilitate the subsequent iteration of model adaptation, thereby establishing a collaborative loop between model adaptation and graph adaptation. Comprehensive experiments are conducted on various public datasets. The experimental results demonstrate that our proposed model outperforms recent source-free baselines by large margins., Comment: Accepted by WWW-2024

Knowledge hypergraph embedding models are usually computationally expensive due to the inherent complex semantic information. However, existing works mainly focus on improving the effectiveness of knowledge hypergraph embedding, making the model architecture more complex and redundant. It is desirable and challenging for knowledge hypergraph embedding to reach a trade-off between model effectiveness and efficiency. In this paper, we propose an end-to-end efficient knowledge hypergraph embedding model, HyCubE, which designs a novel 3D circular convolutional neural network and the alternate mask stack strategy to enhance the interaction and extraction of feature information comprehensively. Furthermore, our proposed model achieves a better trade-off between effectiveness and efficiency by adaptively adjusting the 3D circular convolutional layer structure to handle n-ary knowledge tuples of different arities with fewer parameters. In addition, we use a knowledge hypergraph 1-N multilinear scoring way to accelerate the model training efficiency further. Finally, extensive experimental results on all datasets demonstrate that our proposed model consistently outperforms state-of-the-art baselines, with an average improvement of 8.22% and a maximum improvement of 33.82% across all metrics. Meanwhile, HyCubE is 6.12x faster, GPU memory usage is 52.67% lower, and the number of parameters is reduced by 85.21% compared with the average metric of the latest state-of-the-art baselines., Comment: 13 pages

This study aims to investigate the strong gravitational lensing effects in $f(T)$ gravity. We present the theoretical analytic expressions for the lensing effects in $f(T)$ gravity, including deflection angle, magnification, and time delay. On this basis, we also take the plasma lensing effect into consideration. We compare the lensing effects between the General Relativity in a vacuum environment and the $f(T)$ gravity in a plasma environment. From a strongly lensed fast radio burst, the results indicate that in a plasma environment, General Relativity and $f(T)$ gravity can generate indistinguishable image positions, but the magnification and time delay on these positions are significantly different, which can be distinguished by current facilities in principle. Therefore, the discrepancies between observational results and theoretical expectations can serve as clues for a modified gravity theory and provide constraints on $f(T)$ gravity.

In this paper, we construct the Dirac stars model composed of two Dirac fields and Einstein gravity in four-dimensional Anti-de Sitter spacetime. We consider the Dirac stars with free field (no self-interacting). Our investigation focuses on understanding the relationship between Arnowitt-Deser-Misner (ADM) mass, Noether charge, and binding energy in relation to the cosmological constant. Furthermore, we extend the study to the Dirac stars with self-interacting potentials. For the self-interacting Dirac stars, three types of interactions are examined: only quartic, only sextic, quartic and sextic interactions that is kind of Q-ball type interactions. In these three distinct scenarios, it is essential to investigate the impact of self-interaction constants on Dirac stars. Additionally, we study the Dirac Q-balls in the AdS background., Comment: 17pages, 27pictures

Knowledge graphs generally suffer from incompleteness, which can be alleviated by completing the missing information. Deep knowledge convolutional embedding models based on neural networks are currently popular methods for knowledge graph completion. However, most existing methods use external convolution kernels and traditional plain convolution processes, which limits the feature interaction capability of the model. In this paper, we propose a novel dynamic convolutional embedding model ConvD for knowledge graph completion, which directly reshapes the relation embeddings into multiple internal convolution kernels to improve the external convolution kernels of the traditional convolutional embedding model. The internal convolution kernels can effectively augment the feature interaction between the relation embeddings and entity embeddings, thus enhancing the model embedding performance. Moreover, we design a priori knowledge-optimized attention mechanism, which can assign different contribution weight coefficients to multiple relation convolution kernels for dynamic convolution to improve the expressiveness of the model further. Extensive experiments on various datasets show that our proposed model consistently outperforms the state-of-the-art baseline methods, with average improvements ranging from 11.30\% to 16.92\% across all model evaluation metrics. Ablation experiments verify the effectiveness of each component module of the ConvD model.

Unsupervised graph anomaly detection is crucial for various practical applications as it aims to identify anomalies in a graph that exhibit rare patterns deviating significantly from the majority of nodes. Recent advancements have utilized Graph Neural Networks (GNNs) to learn high-quality node representations for anomaly detection by aggregating information from neighborhoods. However, the presence of anomalies may render the observed neighborhood unreliable and result in misleading information aggregation for node representation learning. Selecting the proper neighborhood is critical for graph anomaly detection but also challenging due to the absence of anomaly-oriented guidance and the interdependence with representation learning. To address these issues, we utilize the advantages of reinforcement learning in adaptively learning in complex environments and propose a novel method that incorporates Reinforcement neighborhood selection for unsupervised graph ANomaly Detection (RAND). RAND begins by enriching the candidate neighbor pool of the given central node with multiple types of indirect neighbors. Next, RAND designs a tailored reinforcement anomaly evaluation module to assess the reliability and reward of considering the given neighbor. Finally, RAND selects the most reliable subset of neighbors based on these rewards and introduces an anomaly-aware aggregator to amplify messages from reliable neighbors while diminishing messages from unreliable ones. Extensive experiments on both three synthetic and two real-world datasets demonstrate that RAND outperforms the state-of-the-art methods., Comment: 1O pages, 7 figures, accepted by ICDM2023

Next Basket Recommender Systems (NBRs) function to recommend the subsequent shopping baskets for users through the modeling of their preferences derived from purchase history, typically manifested as a sequence of historical baskets. Given their widespread applicability in the E-commerce industry, investigations into NBRs have garnered increased attention in recent years. Despite the proliferation of diverse NBR methodologies, a substantial challenge lies in the absence of a systematic and unified evaluation framework across these methodologies. Various studies frequently appraise NBR approaches using disparate datasets and diverse experimental settings, impeding a fair and effective comparative assessment of methodological performance. To bridge this gap, this study undertakes a systematic empirical inquiry into NBRs, reviewing seminal works within the domain and scrutinizing their respective merits and drawbacks. Subsequently, we implement designated NBR algorithms on uniform datasets, employing consistent experimental configurations, and assess their performances via identical metrics. This methodological rigor establishes a cohesive framework for the impartial evaluation of diverse NBR approaches. It is anticipated that this study will furnish a robust foundation and serve as a pivotal reference for forthcoming research endeavors in this dynamic field., Comment: 6 pages, 2 figures