TYTing Yu

Ting Yu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Ting Yu has a total of 78 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Aspect-based Sentiment Analysis for COVID-19: A Heterogeneous Graph Convolutional Network Approach

    by Linlin Hou, Wenhui Tu, Ting Yu, Ting Jiang, Mohamed Bah, Zenghui Xu, Yu Zhang, Gaoming Yang, Ji Zhang

    The epidemic of infectious diseases has a significant impact on society, the economy, and people’s lives. Social media, with its high user participation and rapid information dissemination, plays a crucial role in shaping public opinion. Fine-grained sentiment analysis of public opinion on infectious diseases can provide valuable insights for improving the quality of public services. However, there are few relevant studies on Chinese data due to language complexity and low resources. Moreover, most of the existing approaches utilize the Graph Neural Network (GCN) method by syntactic dependency trees to construct graphs of text, which ignore the potential link relationships between aspects and words. Therefore, to address this limitation, in this article, we propose a new method based on GCN using aspect-specific heterogeneous graphs, named ASHGCN, which combines BiLSTM, heterogeneous graphs, GCN, the mask and the attention mechanism. We mine social media posts related to COVID-19 for aspect-based sentiment analysis task (ABSA) for ten aspect entity types in both Chinese and English data. The heterogeneous graph is designed with two node types (aspect nodes and non-aspect nodes) and four edge connection types, including various relationships between aspect entities, and between aspect entities and non-aspect entities. In addition, we release a Chinese dataset and an English dataset that include medical and named entities, along with corresponding sentiment labels. Experiments on our datasets, as well as two public datasets, demonstrate that our method greatly improves performance in the ABSA task. Ablation experiments and case studies further support the effectiveness of the proposed approach.


  • A Novel Multi-scale Spatiotemporal Graph Neural Network for Epidemic Prediction

    by Zenghui Xu, Mingzhang Li, Ting Yu, Linlin Hou, Peng Zhang, Rage Uday Kiran, Zhao Li, Ji Zhang


  • Open Access

    SpeedCore: Space-efficient and Dependency-aware GPU Parallel Framework for Core Decomposition

    by Chen Zhao, Ting Yu, Zhigao Zheng, Yuanyuan Zhu, Song Jin, Bo Du, Dacheng Tao

    Core decomposition is a well-established graph mining algorithm in network analysis that involves the k-core subgraph model. However, most existing works on GPUs perform inefficiency due to the heavy search cost for identifying the sparse frontiers throughout the entire vertex space, which is caused by the minimum-degree dependency. Existing works design multiple block queues to partially reduce the cost caused by the sparse frontier search. Nonetheless, the queues consume excessive global memory to avoid queue overflow, leading to the decreased scalability. To address these problems, this paper proposes a space-efficient and dependency-aware GPU parallel framework, SpeedCore, for core decomposition. A theoretically verified virtual graph method is proposed to compress the large sparse search space into a small and dense format. A cache-centric hybrid queue method with a task granularity control strategy at the block level is proposed to restrict memory usage and prevent overflow. Furthermore, SpeedCore proposes a context-based binary search method to accelerate the graph degeneracy problem, which is derived from core decomposition. Extensive experiments on the NVIDIA RTX 3090 GPU show that SpeedCore outperforms the state-of-the-art algorithm by a 2.2 × average speedup. Moreover, SpeedCore can still maintain almost the same performance with low memory consumption. To solve the graph degeneracy problem, SpeedCore achieves a 7.5 × average speedup.


  • Open Access

    PICO: Accelerating All k-Core Paradigms on GPU

    by Chen Zhao, Ting Yu, Zhigao Zheng, Yuanyuan Zhu, Song Jin, Bo Du, Dacheng Tao

    Core decomposition is a well-established graph mining problem that involves a widely-used subgraph model k-core in network analysis. Solutions to this problem have been developed using the Peel and Index paradigms. However, existing studies have not effectively harnessed GPU performance to expedite core decomposition, despite the growing need for enhanced performance. This paper introduces an efficient GPU acceleration framework, PICO, for both the Peel and Index paradigms of k-core decomposition. We propose a Peel-based algorithm, named PeelOne, which reduces the frontiers searching cost and redundant memory footprint of the frontiers by virtual small graph transformation and kernel fusion. Moreover, we design a GPU-friendly hybrid frontier queues architecture to balance the performance and the memory usage and quickly handle any overflow of the queues. We also propose an Index-based algorithm, named HistoCore, which addresses the issue of extensive redundant computations across both vertices and edges. Extensive experiments on NVIDIA RTX 3090 GPU show that PeelOne outperforms the SOTA Peel-based algorithm by 1.4 × ∼3.5 × speedup, and HistoCore outperforms the existing Index-based algorithm by 9.4 × ∼26.3 × speedup.


  • Open Access

    Attribute Diversity Aware Community Detection on Attributed Graphs Using Three-View Graph Attention Neural Networks

    by Yang Zhang, Ting Yu, Shengqiang Chi, Zhen Wang, Yue Gao, Ji Zhang, Tianshu Zhou

    Community detection is a fundamental yet important task for characterizing and understanding the structure of attributed graphs. Existing methods mainly focus on the structural tightness and attribute similarity among nodes in a community. However, grouping numerous semantically homogeneous nodes will result in information cocoons and thus reduce the robustness of community structure and the efficiency of node collaboration in real-world applications, such as recommendation systems and collaboration networks. Since nodes with closer connections tend to be more similar, finding communities with dense structures and diverse attributes poses great challenges to mining latent relationships between the graph structure and attribute distribution. To our best knowledge, very little research has been conducted to address this challenge. In this article, we propose a novel three-view graph attention neural networks (TvGANN) model to formally address the attribute diversity aware community detection problem. TvGANN reveals correlations between the graph structure and attributes distribution from the perspective of node organization, attribute co-occurrence, and the node-attribute interaction. It effectively captures structural features and attributes distribution by feeding a structural network and an attribute co-occurrence network into graph attention modules through the encoder–decoder framework. It also learns heterogeneous information by feeding a network into a meta-node attention module. Then, it fuzes the three modules and clusters the embedding representations through a Student's t -distribution approach, which iteratively refines the clustering results. The experiments show that our method not only improves the quality in dense community detection but also performs efficiently for attributed graphs.


  • Open Access

    GIDN: A Lightweight Graph Inception Diffusion Network for High-efficient Link Prediction

    by Zixiao Wang, Yuluo Guo, Jin Zhao, Yu Zhang, Hui Yu, Xiaofei Liao, Biao Wang, Ting Yu

    In this paper, we propose a Graph Inception Diffusion Networks(GIDN) model. This model generalizes graph diffusion in different feature spaces, and uses the inception module to avoid the large amount of computations caused by complex network structures. We evaluate GIDN model on Open Graph Benchmark(OGB) datasets, reached an 11% higher performance than AGDN on ogbl-collab dataset.


  • Incremental Maximal Clique Enumeration for Hybrid Edge Changes in Large Dynamic Graphs

    by Ting Yu, Ting Jiang, Mohamed Jaward Bah, Chen Zhao, Hao Huang, Mengchi Liu, Shuigeng Zhou, Zhao Li, Ji Zhang


  • Open Access

    PICO: Accelerating All k-Core Paradigms on GPU

    by Chen Zhao, Ting Yu, Zhigao Zheng, Song Jin, Jiawei Jiang, Bo Du, Dacheng Tao

    Core decomposition is a well-established graph mining problem with various applications that involves partitioning the graph into hierarchical subgraphs. Solutions to this problem have been developed using both bottom-up and top-down approaches from the perspective of vertex convergence dependency. However, existing algorithms have not effectively harnessed GPU performance to expedite core decomposition, despite the growing need for enhanced performance. Moreover, approaching performance limitations of core decomposition from two different directions within a parallel synchronization structure has not been thoroughly explored. This paper introduces an efficient GPU acceleration framework, PICO, for the Peel and Index2core paradigms of k-core decomposition. We propose PeelOne, a Peel-based algorithm designed to simplify the parallel logic and minimize atomic operations by eliminating vertices that are 'under-core'. We also propose an Index2core-based algorithm, named HistoCore, which addresses the issue of extensive redundant computations across both vertices and edges. Extensive experiments on NVIDIA RTX 3090 GPU show that PeelOne outperforms all other Peel-based algorithms, and HistoCore outperforms all other Index2core-based algorithms. Furthermore, HistoCore even outperforms PeelOne by 1.1x - 3.2x speedup on six datasets, which breaks the stereotype that the Index2core paradigm performs much worse than the Peel in a shared memory parallel setting.