Liying Jiang

dblp:36/3210 · DBLP profile ↗
← Back
13ranked-venue papers
5as first author
4since 2021 · last 2023
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 5 · 2 first-author · 1 since 2021Databases, data management, data science and information retrieval · 4 · 2 first-author · 3 since 2021Human-computer interaction and ubiquitous computing · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 first-author
YearPublicationVenuePosition
2023 Traffic Demand Prediction Based on Multi-dimensional Graph Convolutional Network
abstract
Traffic demand prediction is of great importance for traffic management, yet it is also a challenging problem since the traffic data are usually with complex spatial-temporal dependencies and nonlinear relationships. In this paper, to better characterize and utilize the spatial and temporal features, we propose a Multi-dimensional Graph Convolutional Network (M-GCN) to capture dynamic spatial-temporal dependence of traffic data. M-GCN captures the explicit spatio-temporal dependencies by establishing a spatial adjacency graph and a temporal adjacency graph, and captures the hidden spatiotemporal dependencies by establishing a spatial adaptive graph and a temporal adaptive graph. We leverage graph convolutional networks for complex spatial and temporal dependencies modeling and design a gated fusion module to obtain the interactive spatial-temporal dependence. Besides, an attention mechanism is applied to alleviate the error propagation problem in long-term traffic prediction. Experimental results on two real-world traffic datasets demonstrate the superiority of M-GCN. The proposed M-GCN outperforms baseline methods by up to 4.6% improvement in MAE on the dataset TaxiNYC, and the training time and predicting time of $\mathrm{M}-\mathrm{GCN}$ are reduced by nearly half.
Peiying Zeng, Liying Jiang, Yongxuan Lai, Fan Yang 0010
IEEE Big Data2
2021 Shortest Path Distance Prediction Based on CatBoost
Liying Jiang, Yongxuan Lai, Wenhua Zeng, Fan Yang 0010, Yi Fan 0001
WISA1
2021 Dynamic Transit Flow Graph Prediction in Spatial-Temporal Network
Liying Jiang, Yongxuan Lai, Wenhua Zeng, Fan Yang 0010, Yi Fan 0001, Qisheng Liao
WISE (1)1
2021 Two-Stream Encoder GAN With Progressive Training for Co-Saliency Detection
abstract
The recent end-to-end co-saliency models have good performance, however, they cannot express the semantic consistency among a group of images well and usually require many co-saliency labels. To this end, a two-stream encoder generative adversarial network (TSE-GAN) with progressive training is proposed in this paper. In the pre-training stage, the salient object detection generative adversarial networks (SOD-GAN) and classification network (CN) are separately trained by the salient object detection (SOD) datasets and co-saliency datasets with only category labels to learn the intra-saliency and preliminary inter-saliency cues and alleviate the problem of insufficient co-saliency labels. In the second training stage, the backbone of TSE-GAN is inherited from the trained SOD-GAN, the encoder of trained SOD-GAN (SOD-Encoder) is used to extract intra-saliency features, the group-wise semantic encoder (GS-Encoder) is constructed by the multi-level group-wise category features extracted from CN for extracting inter-saliency features with better semantic consistency, the TSE-GAN constructed by incorporating the GS-Encoder into SOD-GAN is trained on co-saliency datasets for co-saliency detection. The comprehensive comparisons with 13 state-of-the-art methods demonstrate the effectiveness of proposed method.
Xiaoliang Qian, Gong Cheng 0003, Xiwen Yao, Liying Jiang
IEEE Signal Process. Lett.5
2020 Bus Travel-Time Prediction Based on Deep Spatio-Temporal Model
Yongxuan Lai, Liying Jiang, Fan Yang 0010
WISE (1)3
2017 Vehicle classification for large-scale traffic surveillance videos using Convolutional Neural Networks
Li Zhuo 0001, Liying Jiang, Jiafeng Li 0001, Jing Zhang 0023
Mach. Vis. Appl.2
2007 SPICE: A New Framework for Data Mining based on Probability Logic and Formal Concept Analysis
Liying Jiang, Jitender S. Deogun
Fundam. Informaticae1
2006 GenomeBlast: a web tool for small genome comparison
abstract
BACKGROUND: Comparative genomics has become an essential approach for identifying homologous gene candidates and their functions, and for studying genome evolution. There are many tools available for genome comparisons. Unfortunately, most of them are not applicable for the identification of unique genes and the inference of phylogenetic relationships in a given set of genomes. RESULTS: GenomeBlast is a Web tool developed for comparative analysis of multiple small genomes. A new parameter called "coverage" was introduced and used along with sequence identity to evaluate global similarity between genes. With GenomeBlast, the following results can be obtained: (1) unique genes in each genome; (2) homologous gene candidates among compared genomes; (3) 2D plots of homologous gene candidates along the all pairwise genome comparisons; and (4) a table of gene presence/absence information and a genome phylogeny. We demonstrated the functions in GenomeBlast with an example of multiple herpesviral genome analysis and illustrated how GenomeBlast is useful for small genome comparison. CONCLUSION: We developed a Web tool for comparative analysis of small genomes, which allows the user not only to identify unique genes and homologous gene candidates among multiple genomes, but also to view their graphical distributions on genomes, and to reconstruct genome phylogeny. GenomeBlast runs on a Linux server with 4 CPUs and 4 GB memory. The online version of GenomeBlast is available to public by using a Web browser with the URL http://bioinfo-srv1.awh.unomaha.edu/genomeblast/.
Guoqing Lu, Liying Jiang, Resa M. K. Helikar, Thaine W. Rowley, Etsuko N. Moriyama
BMC Bioinform.2
2005 Comparative Evaluation on Concept Approximation Approaches
abstract
Formal concept analysis (FCA) is a method for deriving conceptual structures out of data that are represented as objects with features. FCA discovers dependencies within the data based on the relation among objects and features. However, not every pair of objects and features defines a concept. Concept approximation is to find the best or closest concept(s) to approximate a pair of objects and features. Concept approximation is significant in that under the circumstances that we can not find a concept, using concept approximation will give the best or most possible solution. In this paper, we evaluate three approaches through experiments in the application of document retrieval. We provide analysis of these approaches and give our concluding remarks.
Jitender S. Deogun, Liying Jiang
ISDA2
2005 SARM - Succinct Association Rule Mining: An Approach to Enhance Association Mining
Jitender S. Deogun, Liying Jiang
ISMIS2
2005 Fault detection for batch process based on dissimilarity index
abstract
The methods for batch processes monitoring based on multivariate techniques always have two assumptions. One is that batches must have equal duration. The other one is the normal distribution of batch process data. However, those are not always satisfied in practice. In order to overcome those problems, a novel monitoring method based on the dissimilarity index for batch processes is proposed without any assumptions on the lengths of batches and distribution of process data. The proposed method is applied to a simulation fed-batch penicillin production. The application results show that this method is effective.
Liying Jiang
SMC1
2005 Fault diagnosis for batch processes based on improved MFDA
abstract
Due to starting conditions and exotic environment of each batch run are different, their lengths are unequal. Moreover, batch data of measured parameters are not complete until the end of its operation. The shortcomings of conventional multiway Fisher discriminant analysis (MFDA) are that all batch lengths should be equal and that future trajectory of the current batch must be estimated to allow on-line fault diagnosis. Therefore, conventional MFDA easily leads to false fault diagnosis. In order to overcome those drawbacks and enhance the diagnostic performance, an improved method of fault diagnosis, improved multiway Fisher discriminant analysis (IMFDA), is proposed. The diagnostic ability of proposed method is demonstrated by application in the simulated fed-batch penicillin fermentation. Application results show that this method is very efficient.
Liying Jiang
SMC1
2003 Probability Logic Modeling of Knowledge Discovery in Databases
Jitender S. Deogun, Liying Jiang, Ying Xie 0001, Vijay Raghavan 0001
ISMIS2