HilbertEPIs: Enhancer-Promoter Interactions Prediction with Hilbert Curve and CNN Model

Author(s):  
Yujia Hu ◽  
Ruichen Peng ◽  
Chunlin Long ◽  
Min Zhu
Keyword(s):  
2009 ◽  
Vol 16 ◽  
pp. 433-443 ◽  
Author(s):  
Ji-Chyun Liu ◽  
Bing-Hao Zeng ◽  
Ivy Chen ◽  
Chung-Chi Chang ◽  
Dau-Chyrh Chang

2007 ◽  
Vol 70 ◽  
pp. 269-280 ◽  
Author(s):  
Jun Chen ◽  
Zi-Bin Weng ◽  
Yong-Chang Jiao ◽  
Fu-Shun Zhang

Electronics ◽  
2021 ◽  
Vol 10 (22) ◽  
pp. 2751
Author(s):  
Dimitrios I. Koutras ◽  
Athanasios C. Kapoutsis ◽  
Angelos A. Amanatiadis ◽  
Elias B. Kosmatopoulos

This paper is an initial endeavor to bridge the gap between powerful Deep Reinforcement Learning methodologies and the problem of exploration/coverage of unknown terrains. Within this scope, MarsExplorer, an openai-gym compatible environment tailored to exploration/coverage of unknown areas, is presented. MarsExplorer translates the original robotics problem into a Reinforcement Learning setup that various off-the-shelf algorithms can tackle. Any learned policy can be straightforwardly applied to a robotic platform without an elaborate simulation model of the robot’s dynamics to apply a different learning/adaptation phase. One of its core features is the controllable multi-dimensional procedural generation of terrains, which is the key for producing policies with strong generalization capabilities. Four different state-of-the-art RL algorithms (A3C, PPO, Rainbow, and SAC) are trained on the MarsExplorer environment, and a proper evaluation of their results compared to the average human-level performance is reported. In the follow-up experimental analysis, the effect of the multi-dimensional difficulty setting on the learning capabilities of the best-performing algorithm (PPO) is analyzed. A milestone result is the generation of an exploration policy that follows the Hilbert curve without providing this information to the environment or rewarding directly or indirectly Hilbert-curve-like trajectories. The experimental analysis is concluded by evaluating PPO learned policy algorithm side-by-side with frontier-based exploration strategies. A study on the performance curves revealed that PPO-based policy was capable of performing adaptive-to-the-unknown-terrain sweeping without leaving expensive-to-revisit areas uncovered, underlying the capability of RL-based methodologies to tackle exploration tasks efficiently.


Author(s):  
Panagiotis Tsinganos ◽  
Bruno Cornelis ◽  
Jan Cornelis ◽  
Bart Jansen ◽  
Athanassios Skodras

Over the past few years, Deep learning (DL) has revolutionized the field of data analysis. Not only are the algorithmic paradigms changed, but also the performance in various classification and prediction tasks has been significantly improved with respect to the state-of-the-art, especially in the area of computer vision. The progress made in computer vision has produced a spillover in many other domains, such as biomedical engineering. Some recent works are directed towards surface electromyography (sEMG) based hand gesture recognition, often addressed as an image classification problem and solved using tools such as Convolutional Neural Networks (CNN). This paper extends our previous work on the application of the Hilbert space-filling curve for the generation of image representations from multi-electrode sEMG signals, by investigating how the Hilbert curve compares to the Peano- and Z-order space-filling curves. The proposed space-filling mapping methods are evaluated on a variety of network architectures and in some cases yield a classification improvement of at least 3%, when used to structure the inputs before feeding them into the original network architectures.


2003 ◽  
Vol DMTCS Proceedings vol. AC,... (Proceedings) ◽  
Author(s):  
Ho-Kwok Dai ◽  
Hung-Chi Su

International audience A discrete space-filling curve provides a linear traversal/indexing of a multi-dimensional grid space.This paper presents an application of random walk to the study of inter-clustering of space-filling curves and an analytical study on the inter-clustering performances of 2-dimensional Hilbert and z-order curve families.Two underlying measures are employed: the mean inter-cluster distance over all inter-cluster gaps and the mean total inter-cluster distance over all subgrids.We show how approximating the mean inter-cluster distance statistics of continuous multi-dimensional space-filling curves fits into the formalism of random walk, and derive the exact formulas for the two statistics for both curve families.The excellent agreement in the approximate and true mean inter-cluster distance statistics suggests that the random walk may furnish an effective model to develop approximations to clustering and locality statistics for space-filling curves.Based upon the analytical results, the asymptotic comparisons indicate that z-order curve family performs better than Hilbert curve family with respect to both statistics.


Sign in / Sign up

Export Citation Format

Share Document