Dong Liyan

Dong Liyan


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
28 January 2020 in IEEE Access
Verified
Journal Article
Open access
BZBeibei Zhang
Beibei Zhang
Shengsheng WangShengsheng Wang
Shengsheng Wang
DLDong Liyan
Dong Liyan
PCPeng Chen
Peng Chen
Minimally invasive surgery like laparoscopic surgery is an active research area of clinical practice for less pain and a faster recovery rate. Detection of surgical tools with more accurate spatial locations in surgical videos not only helps to ensure patient safety by reducing the incidence of complications but also makes a difference to assess the surgeon performance. In this paper, we propose a novel Modulated Anchoring Network for detection of laparoscopic surgery tools based on Faster R-CNN, which inherits the merits of two-stage approaches while also maintains high efficiency of comparable speed as state-of-the-art one-stage methods. Since objects like surgical instruments with a wide aspect ratio are difficult to recognize, we develop a novel training scheme named as modulated anchoring to explicitly predict arbitrary anchor shapes of objects of interest. For taking the relationship of different tools into consideration, it is useful to embed the relation module in our network. We evaluate our method using an existing dataset (m2cai16-tool-locations) and a new private dataset (AJU-Set), both collected from cholecystectomy surgical videos in hospital, covering information of seven surgical tools with spatial bounds. We show that our detector yields excellent detection accuracy of 69.6% and 76.5% over the introduced datasets superior to other recently used architectures. We further verify the efficiency of our method by analyzing the usage patterns of tools, the economy of the movement, and the dexterity of operations to assess surgical quality.

9 December 2019
Verified
Book Chapter
Closed access
PDF file
DLDunsheng Liu
Dunsheng Liu
YLYuanning Liu
Yuanning Liu
DLDong Liyan
Dong Liyan

15 December 2020 in Frontiers in Genetics
Verified
Journal Article
Open access
PDF file
YWYili Wang
Yili Wang
YLYuanning Liu
Yuanning Liu
SWShuo Wang
Shuo Wang
ZLZhen Liu
Zhen Liu
YGYubing Gao
Yubing Gao
DLDong Liyan
Dong Liyan
Accurate RNA secondary structure information is the cornerstone of gene function research and RNA tertiary structure prediction. However, most traditional RNA secondary structure prediction algorithms are based on the dynamic programming (DP) algorithm, according to the minimum free energy theory, with both hard and soft constraints. The accuracy is particularly dependent on the accuracy of soft constraints (from experimental data like chemical and enzyme detection). With the elongation of the RNA sequence, the time complexity of DP-based algorithms will increase geometrically, as a result, they are not good at coping with relatively long sequences. Furthermore, due to the complexity of the pseudoknots structure, the secondary structure prediction method, based on traditional algorithms, has great defects which cannot predict the secondary structure with pseudoknots well. Therefore, few algorithms have been available for pseudoknots prediction in the past. The ATTfold algorithm proposed in this article is a deep learning algorithm based on an attention mechanism. It analyzes the global information of the RNA sequence via the characteristics of the attention mechanism, focuses on the correlation between paired bases, and solves the problem of long sequence prediction. Moreover, this algorithm also extracts the effective multi-dimensional features from a great number of RNA sequences and structure information, by combining the exclusive hard constraints of RNA secondary structure. Hence, it accurately determines the pairing position of each base, and obtains the real and effective RNA secondary structure, including pseudoknots. Finally, after training the ATTfold algorithm model through tens of thousands of RNA sequences and their real secondary structures, this algorithm was compared with four classic RNA secondary structure prediction algorithms. The results show that our algorithm significantly outperforms others and more accurately showed the secondary structure of RNA. As the data in RNA sequence databases increase, our deep learning-based algorithm will have superior performance. In the future, this kind of algorithm will be more indispensable.

19 November 2020 in IEEE Access
Verified
Journal Article
Open access
YWYueQun Wang
YueQun Wang
DLDong Liyan
Dong Liyan
HZHao Zhang
Hao Zhang
XMXintao Ma
Xintao Ma
YLYongli Li
Yongli Li
MSMingHui Sun
MingHui Sun
Deep network recommendation is a cutting-edge topic in current recommendation system research, which as a combination of recommendation systems and deep learning theory can effectively improve recommendation accuracy. In a real recommendation scenario, all the effective information in a data set should be extracted, both explicit and implicit, because the comprehensive degree of information is proportional to the recommendation performance. This paper proposes an enhanced multi-modal recommendation based on alternate training with knowledge graph representation (SI-MKR) based on the MKR deep learning recommendation model. Our framework is an enhanced recommendation system based on knowledge graph representation, using valuable external knowledge as multi-modal information. The SI-MKR model solves the problem of ignoring the diversity of data types in the multi-modal knowledge-based recommendation system, which adds user and item attribute information from a knowledge graph as an enhancement recommendation multi-tasking training. By analysing the content of the item and user attributes, the SI-MKR model classifies the attributes of the items and users, processes the text type attributes and multi-value type attributes separately for feature extraction, and other types of attributes are used as inputs to the knowledge graph embedding unit. In addition, the knowledge graph data form a triplet unit, thus continuing the knowledge graph data training process. The feature extraction unit of the knowledge graph and the recommended unit are connected through the cross-compression unit for alternate training. During the deep learning framework training process, the recommendation system’s item has a potential correlation with the head entity in the knowledge graph which embodies the idea of multi-tasking. Through extensive experiments on real-world datasets, we demonstrate that SI-MKR achieves substantial gains in movie recommendation over advanced model baselines. Even user-item interactions are sparse, SI-MKR maintains better performance than the MKR model.

9 January 2023 in IEEE Access
Verified
Journal Article
Open access
DLDong Liyan
Dong Liyan
GZGuangtong Zhu
Guangtong Zhu
YWYueQun Wang
YueQun Wang
YLYongli Li
Yongli Li
JDJiayao Duan
Jiayao Duan
MSMingHui Sun
MingHui Sun
The main idea of a session-based recommendation system is to model the user’s historical click sequence and then summarize user preferences and predict the items the user will interact with. The session recommendation model based on graph neural networks has attracted much attention in recent years because it can accurately obtain the local relationship between items. However, the traditional session recommendation model based on graph neural Networks lack the use of user’s higher-order features or fail to address the impact of item position information on the current session, which are both critical to the recommendation system. In addition, some models proposed the position information while neglects the click frequency information. We propose a graph network recommendation model called GPAN based on position attention in response to the abovementioned problems. Specifically, we propose a novel high-low order session perceptron that uses the perceptron to model undirected and directed graphs separately to obtain high and low order item representations in a session. For position information, we designed a position layer to calculate independently. Finally, the user’s short-term preference and long-term preference are aggregated to obtain the recommendation sequence. The results through a large number of experiments on three real datasets show that the performance of the proposed GPAN model is the best.

8 December 2016 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
XMXiangyu Meng
Xiangyu Meng
DLDong Liyan
Dong Liyan
YLYongli Li
Yongli Li
WGWilliam W. Guo
William W. Guo