Shijie Hao

Shijie Hao

Auto-generated profile, based on publicly available information

Shijie Hao

Hefei University of Technology, Hefei, China

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 January 2020 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
SHShijie Hao
Shijie Hao
XHXu Han
Xu Han
YGYanrong Guo
Yanrong Guo
XXXin Xu
Xin Xu
MWMeng Wang
Meng Wang

11 August 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
MWMeng Wang
Meng Wang
WFWeijie Fu
Weijie Fu
XHXiangnan He
Xiangnan He
SHShijie Hao
Shijie Hao
XWXindong Wu
Xindong Wu
Machine learning can provide deep insights into data, allowing machines to make high-quality predictions and having been widely used in real-world applications, such as text mining, visual classification, search engines, and recommendation systems. However, most sophisticated machine learning approaches suffer from huge time costs when operating on large-scale data. This calls for the need of Large-scale Machine Learning (LML), which aims to efficiently learn patterns from large-scale data without sacrificing performance much. In this paper, we offer a systematic survey on state-of-the-art LML approaches to provide a blueprint for the future developments of this area. Focusing on the viewpoint of improving scalability, we first categorize existing approaches of LML into three types: 1) model simplification, 2) approximate optimization, and 3) parallel computation. We then summarize the motivations, working mechanisms, and representative achievements of the approaches of each type. Lastly, we analyze their limitations, shedding light on the potential directions and open issues that are promising to address in the future.

4 October 2022 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
TCTao Chen
Tao Chen
RHRichang Hong
Richang Hong
YGYanrong Guo
Yanrong Guo
SHShijie Hao
Shijie Hao
BHBin Hu
Bin Hu
Major depressive disorder (MDD) is one of the most common and severe mental illnesses, posing a huge burden on society and families. Recently, some multimodal methods have been proposed to learn a multimodal embedding for MDD detection and achieved promising performance. However, these methods ignore the heterogeneity/homogeneity among various modalities. Besides, earlier attempts ignore interclass separability and intraclass compactness. Inspired by the above observations, we propose a graph neural network (GNN)-based multimodal fusion strategy named modal-shared modal-specific GNN, which investigates the heterogeneity/homogeneity among various psychophysiological modalities as well as explores the potential relationship between subjects. Specifically, we develop a modal-shared and modal-specific GNN architecture to extract the inter/intramodal characteristics. Furthermore, a reconstruction network is employed to ensure fidelity within the individual modality. Moreover, we impose an attention mechanism on various embeddings to obtain a multimodal compact representation for the subsequent MDD detection task. We conduct extensive experiments on two public depression datasets and the favorable results demonstrate the effectiveness of the proposed algorithm.

30 September 2022 in IEEE Transactions on Affective Computing
Verified
Journal Article
Closed access
TCTao Chen
Tao Chen
YGYanrong Guo
Yanrong Guo
SHShijie Hao
Shijie Hao
RHRichang Hong
Richang Hong
Electroencephalogram (EEG) has been widely used in neurological disease detection, i.e., major depressive disorder (MDD). Recently, some deep EEG-based MDD detection attempts have been proposed and achieved promising performance. These works, however, still suffer from the following limitations, such as insufficient exploration of the EEG-based topological structure, information loss caused by high-dimensional data compression, and under-estimation of intra-class difference and inter-class similarity. To solve these issues, we propose an EEG-based MDD detection model named S elf-attention G raph P ooling with S oft L abel (SGP-SL). Specifically, we explore the local and global connections among EEG channels to construct an EEG-based graph in advance. By leveraging multiple self-attention graph pooling modules, the constructed graph is then gradually refined, followed by graph pooling, to aggregate information from less-important nodes to more-important ones. In this way, the feature representation with better discriminability can be learned from EEG signals. In addition, the soft label strategy is also adopted to build the loss function, aiming to further enhance the feature discriminability. Experimental results on the MODMA dataset demonstrate the superiority of the proposed method. What's more, extensive ablation studies are conducted to verify the effectiveness of the proposed elements in our model.

8 March 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
SHShijie Hao
Shijie Hao
YZYuan Zhou
Yuan Zhou
YGYanrong Guo
Yanrong Guo
RHRichang Hong
Richang Hong
JCJun Cheng
Jun Cheng
MWMeng Wang
Meng Wang
Nowadays, vision-based computing tasks play an important role in various real-world applications. However, many vision computing tasks, e.g., semantic segmentation, are usually computationally expensive, posing a challenge to the computing systems that are resource-constrained but require fast response speed. Therefore, it is valuable to develop accurate and real-time vision processing models that only require limited computational resources. To this end, we propose the spatial-detail guided context propagation network (SGCPNet) for achieving real-time semantic segmentation. In SGCPNet, we propose the strategy of spatial-detail guided context propagation. It uses the spatial details of shallow layers to guide the propagation of the low-resolution global contexts, in which the lost spatial information can be effectively reconstructed. In this way, the need for maintaining high-resolution features along the network is freed, therefore largely improving the model efficiency. On the other hand, due to the effective reconstruction of spatial details, the segmentation accuracy can be still preserved. In the experiments, we validate the effectiveness and efficiency of the proposed SGCPNet model. On the Cityscapes dataset, for example, our SGCPNet achieves 69.5% mIoU segmentation accuracy, while its speed reaches 178.5 FPS on 768 x 1536 images on a GeForce GTX 1080 Ti GPU card. In addition, SGCPNet is very lightweight and only contains 0.61 M parameters. The code will be released at https://github.com/zhouyuan888888/SGCPNet.

19 April 2023 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
YGYanrong Guo
Yanrong Guo
JLJilong Liu
Jilong Liu
LWLei Wang
Lei Wang
WQWei Qin
Wei Qin
SHShijie Hao
Shijie Hao
RHRichang Hong
Richang Hong
Depression has a large impact on one’s personal life, especially during the COVID-19 pandemic. People have been trying to develop reliable methods for the depression detection task. Recently, methods based on deep learning have attracted much attention from the research community. However, they still face the challenge that data collection and annotation are difficult and expensive. In many real-world applications, only a small number of or even no training data are available. In this context, we propose a Prompt-based Topic-modeling method for Depression Detection (PTDD) on low-resource data, aiming to establish an effective way of depression detection under the above challenging situation. Instead of learning discriminating features from a small amount of labeled data, the proposed framework turns to leverage the generalization power of pretrained language models. Specifically, based on the question-and-answer routine during the interview, we first reorganize the text data according to the predefined topics for each interviewee. Via the prompt-based framework, we then predict whether the next-sentence prompt is emotionally positive or not. Finally, the depression detection task can be achieved based on the obtained topicwise predictions through a simple voting process. In the experiments, we validate the effectiveness of our model under several low-resource data settings. The results and analysis demonstrate that our PTDD achieves acceptable performance when only a few training samples or even no training samples are available.