1 code implementation • 3 Jan 2024 • Zinuo You, Zijian Shi, Hongbo Bo, John Cartlidge, Li Zhang, Yan Ge
Moreover, the ablation study and sensitivity study further illustrate the effectiveness of the proposed method in modeling the time-evolving inter-stock and intra-stock dynamics.
no code implementations • 14 Sep 2023 • Yan Ge, Victor Junqiu Wei, Yuanfeng Song, Jason Chen Zhang, Raymond Chi-Wing Wong
Data visualization has emerged as an effective tool for getting insights from massive datasets.
no code implementations • 27 Jun 2023 • Yang Qiao, Yiping Xia, Xiang Li, Zheng Li, Yan Ge
H-GAT is able to capture higher-order structures and jointly incorporate factors of fundamental analysis with factors of technical analysis.
no code implementations • 27 Jun 2022 • Li Zhang, Yan Ge, Jun Ma, Jianmo Ni, Haiping Lu
In this paper, we propose to incorporate the knowledge graph (KG) for CDR, which enables items in different domains to share knowledge.
no code implementations • 21 Dec 2020 • Yan Ge, Jun Ma, Li Zhang, Haiping Lu
Because H2NT can sparsify networks with motif structures, it can also improve the computational efficiency of existing network embedding methods when integrated.
no code implementations • 21 Dec 2020 • Li Zhang, Yan Ge, Haiping Lu
Graph Neural Networks (GNNs) are widely used in graph representation learning.
no code implementations • 2 Mar 2020 • Yan Ge, Philipp Rosendahl, Claudio Durán, Nicole Töpfner, Sara Ciucci, Jochen Guck, Carlo Vittorio Cannistraci
With this motivation, our goal here is to investigate the extent to which an unsupervised machine learning methodology, which is applied exclusively on morpho-rheological markers obtained by real-time deformability and fluorescence cytometry (RT-FDC), can address the difficult task of providing label-free discrimination of reticulocytes from mature red blood cells.
1 code implementation • 25 Dec 2018 • Yan Ge, Haiping Lu, Pan Peng
This paper proposes a new Mixed-Order Spectral Clustering (MOSC) approach to model both second-order and third-order structures simultaneously, with two MOSC methods developed based on Graph Laplacian (GL) and Random Walks (RW).