Data Mining
A simple but theoretically-motivated method to control bloat in genetic programming
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
SPlitSSI-SVM: An algorithm to reduce the misleading and increase the strength of domain signal
Computers in Biology and Medicine
| Hi-index | 0.00 |
Determining if a group of proteins are functionally associated among themselves is an open problem in molecular biology. Within our long term goal of applying Genetic Programming (GP) to this domain, this paper evaluates the feasibility of GP to predict if a given pair of proteins interacts. GP has been chosen because of its potential flexibility in many aspects, such as the definition of operations. In this paper, the if-unknown operation is defined, which semantically is the most appropriate in this domain for handling missing values. We have also used the Tarpeian bloat control method to decrease the computational time and the solution size. Our results show that GP is feasible for this domain and that the Tarpeian method can obtain large improvements in search efficiency and interpretability of solutions.