4.6 Article

Realizing drug repositioning by adapting a recommendation system to handle the process

Journal

BMC BIOINFORMATICS
Volume 19, Issue -, Pages -

Publisher

BIOMED CENTRAL LTD
DOI: 10.1186/s12859-018-2142-1

Keywords

Drug repositioning; Multiple data sources; Multiple features; Pareto dominance; Collaborative filtering; Recommendation systems

Funding

  1. TUBITAK-BIDEB [2214/A]

Ask authors/readers for more resources

Background: Drug repositioning is the process of identifying new targets for known drugs. It can be used to overcome problems associated with traditional drug discovery by adapting existing drugs to treat new discovered diseases. Thus, it may reduce associated risk, cost and time required to identify and verify new drugs. Nowadays, drug repositioning has received more attention from industry and academia. To tackle this problem, researchers have applied many different computational methods and have used various features of drugs and diseases. Results: In this study, we contribute to the ongoing research efforts by combining multiple features, namely chemical structures, protein interactions and side-effects to predict new indications of target drugs. To achieve our target, we realize drug repositioning as a recommendation process and this leads to a new perspective in tackling the problem. The utilized recommendation method is based on Pareto dominance and collaborative filtering. It can also integrate multiple data-sources and multiple features. For the computation part, we applied several settings and we compared their performance. Evaluation results show that the proposed method can achieve more concentrated predictions with high precision, where nearly half of the predictions are true. Conclusions: Compared to other state of the art methods described in the literature, the proposed method is better at making right predictions by having higher precision. The reported results demonstrate the applicability and effectiveness of recommendation methods for drug repositioning.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Correction Biochemical Research Methods

Realizing drug repositioning by adapting a recommendation system to handle the process (vol 19, 136, 2018)

Makbule Gulcin Ozsoy, Tansel Ozyer, Faruk Polat, Reda Alhajj

BMC BIOINFORMATICS (2018)

Article Computer Science, Information Systems

Effective feature reduction for link prediction in location-based social networks

Ahmet Engin Bayrak, Faruk Polat

JOURNAL OF INFORMATION SCIENCE (2019)

Article Mathematics, Interdisciplinary Applications

GENERATING EFFECTIVE INITIATION SETS FOR SUBGOAL-DRIVEN OPTIONS

Alper Demir, Erkin Cilden, Faruk Polat

ADVANCES IN COMPLEX SYSTEMS (2019)

Article Automation & Control Systems

A context aware model for autonomous agent stochastic planning

Omer Ekmekci, Faruk Polat

ROBOTICS AND AUTONOMOUS SYSTEMS (2019)

Article Automation & Control Systems

Solving the area coverage problem with UAVs: A vehicle routing with time windows variation

Fatih Semiz, Faruk Polat

ROBOTICS AND AUTONOMOUS SYSTEMS (2020)

Article Computer Science, Theory & Methods

Using chains of bottleneck transitions to decompose and solve reinforcement learning tasks with hidden states

Huseyin Aydin, Erkin Cilden, Faruk Polat

Summary: Reinforcement learning can benefit from proper task decomposition in large and partially observable problem domains. Experimental study shows that early decomposition based on useful bottleneck transitions reduces memory requirements and improves learning performance.

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2022)

Article Computer Science, Artificial Intelligence

Landmark based guidance for reinforcement learning agents under partial observability

Alper Demir, Erkin Cilden, Faruk Polat

Summary: This paper introduces an algorithm that accelerates reinforcement learning for partially observable problems by utilizing landmarks to construct an abstract transition model and providing guiding rewards for the agent. Experimental results demonstrate that the proposed algorithm not only improves learning speed but also finds better policies.

INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS (2023)

Article Computer Science, Artificial Intelligence

Solving an industry-inspired generalization of lifelong MAPF problem including multiple delivery locations

Fatih Semiz, Mucahit Alkan Yorganci, Faruk Polat

Summary: In this study, a new industry-inspired generalization of the multi-agent path finding (MAPF) problem is proposed. The problem aims to minimize the total path cost by assigning incoming jobs to agents. The agents must also determine the order of visiting the assigned tasks to minimize the total distance traveled. New job-distribution methods, including heuristic algorithms and a brute force algorithm, are presented to solve the problem.

ADVANCED ENGINEERING INFORMATICS (2023)

Proceedings Paper Computer Science, Artificial Intelligence

Reducing Features to Improve Link Prediction Performance in Location Based Social Networks, Non-Monotonically Selected Subset from Feature Clusters

Ahmet Engin Bayrak, Faruk Polat

PROCEEDINGS OF THE 2019 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2019) (2019)

Review Computer Science, Artificial Intelligence

Automatic landmark discovery for learning agents under partial observability

Alper Demir, Erkin Cilden, Faruk Polat

KNOWLEDGE ENGINEERING REVIEW (2019)

Proceedings Paper Computer Science, Theory & Methods

Landmark Based Reward Shaping in Reinforcement Learning with Hidden States

Alper Demir, Erkin Cilden, Faruk Polat

AAMAS '19: PROCEEDINGS OF THE 18TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS (2019)

Article Mathematical & Computational Biology

Effective induction of gene regulatory networks using a novel recommendation method

Makbule Gulcin Ozsoy, Faruk Polat, Reda Alhajj

INTERNATIONAL JOURNAL OF DATA MINING AND BIOINFORMATICS (2019)

Proceedings Paper Computer Science, Artificial Intelligence

Mining Individual Features to Enhance Link Prediction Efficiency in Location Based Social Networks

Ahmet Engin Bayrak, Faruk Polat

2018 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM) (2018)

Proceedings Paper Computer Science, Artificial Intelligence

Using Transitional Bottlenecks to Improve Learning in Nearest Sequence Memory Algorithm

Huseyin Aydin, Erkin Cilden, Faruk Polat

2017 IEEE 29TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2017) (2017)

No Data Available