Pub Date : 2013-04-03DOI: 10.1007/978-3-642-37189-9_12
Arvis Sulovari, Jeff Kiralis, J. Moore
{"title":"Optimal Use of Biological Expert Knowledge from Literature Mining in Ant Colony Optimization for Analysis of Epistasis in Human Disease","authors":"Arvis Sulovari, Jeff Kiralis, J. Moore","doi":"10.1007/978-3-642-37189-9_12","DOIUrl":"https://doi.org/10.1007/978-3-642-37189-9_12","url":null,"abstract":"","PeriodicalId":90497,"journal":{"name":"Evolutionary computation, machine learning and data mining in bioinformatics. EvoBIO (Conference)","volume":"51 1","pages":"129-140"},"PeriodicalIF":0.0,"publicationDate":"2013-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90998261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-04-03DOI: 10.1007/978-3-642-37189-9_17
S. Rosenthal, N. El-Sourani, M. Borschbach
{"title":"Impact of Different Recombination Methods in a Mutation-Specific MOEA for a Biochemical Application","authors":"S. Rosenthal, N. El-Sourani, M. Borschbach","doi":"10.1007/978-3-642-37189-9_17","DOIUrl":"https://doi.org/10.1007/978-3-642-37189-9_17","url":null,"abstract":"","PeriodicalId":90497,"journal":{"name":"Evolutionary computation, machine learning and data mining in bioinformatics. EvoBIO (Conference)","volume":"43 1","pages":"188-199"},"PeriodicalIF":0.0,"publicationDate":"2013-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85480630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-04-03DOI: 10.1007/978-3-642-37189-9_15
T. Manning, P. Walsh
{"title":"Improving the Performance of CGPANN for Breast Cancer Diagnosis Using Crossover and Radial Basis Functions","authors":"T. Manning, P. Walsh","doi":"10.1007/978-3-642-37189-9_15","DOIUrl":"https://doi.org/10.1007/978-3-642-37189-9_15","url":null,"abstract":"","PeriodicalId":90497,"journal":{"name":"Evolutionary computation, machine learning and data mining in bioinformatics. EvoBIO (Conference)","volume":"124 1","pages":"165-176"},"PeriodicalIF":0.0,"publicationDate":"2013-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80409415","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-04-03DOI: 10.1007/978-3-642-37189-9_9
C. Orsenigo, C. Vercellis
{"title":"Dimensionality Reduction via Isomap with Lock-Step and Elastic Measures for Time Series Gene Expression Classification","authors":"C. Orsenigo, C. Vercellis","doi":"10.1007/978-3-642-37189-9_9","DOIUrl":"https://doi.org/10.1007/978-3-642-37189-9_9","url":null,"abstract":"","PeriodicalId":90497,"journal":{"name":"Evolutionary computation, machine learning and data mining in bioinformatics. EvoBIO (Conference)","volume":"36 1","pages":"92-103"},"PeriodicalIF":0.0,"publicationDate":"2013-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80984085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-04-03DOI: 10.1007/978-3-642-37189-9_8
Khalid M. Salama, A. Freitas
{"title":"ACO-Based Bayesian Network Ensembles for the Hierarchical Classification of Ageing-Related Proteins","authors":"Khalid M. Salama, A. Freitas","doi":"10.1007/978-3-642-37189-9_8","DOIUrl":"https://doi.org/10.1007/978-3-642-37189-9_8","url":null,"abstract":"","PeriodicalId":90497,"journal":{"name":"Evolutionary computation, machine learning and data mining in bioinformatics. EvoBIO (Conference)","volume":"19 1","pages":"80-91"},"PeriodicalIF":0.0,"publicationDate":"2013-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81919850","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-04-03DOI: 10.1007/978-3-642-37189-9_1
Delaney Granizo-MacKenzie, J. Moore
{"title":"Multiple Threshold Spatially Uniform ReliefF for the Genetic Analysis of Complex Human Diseases","authors":"Delaney Granizo-MacKenzie, J. Moore","doi":"10.1007/978-3-642-37189-9_1","DOIUrl":"https://doi.org/10.1007/978-3-642-37189-9_1","url":null,"abstract":"","PeriodicalId":90497,"journal":{"name":"Evolutionary computation, machine learning and data mining in bioinformatics. EvoBIO (Conference)","volume":"17 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2013-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89711411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-01-01DOI: 10.1007/978-3-642-37189-9_4
R Michael Sivley, Alexandra E Fish, William S Bush
Rarely occurring genetic variants are hypothesized to influence human diseases, but statistically associating these rare variants to disease is challenging due to a lack of statistical power in most feasibly sized datasets. Several statistical tests have been developed to either collapse multiple rare variants from a genomic region into a single variable (presence/absence) or to tally the number of rare alleles within a region, relating the burden of rare alleles to disease risk. Both these approaches, however, rely on user-specification of a genomic region to generate these collapsed or burden variables, usually an entire gene. Recent studies indicate that most risk variants for common diseases are found within regulatory regions, not genes. To capture the effect of rare alleles within non-genic regulatory regions for burden tests, we contrast a simple sliding window approach with a knowledge-guided k-medoids clustering method to group rare variants into statistically powerful, biologically meaningful windows. We apply these methods to detect genomic regions that alter expression of nearby genes.
{"title":"Knowledge-constrained K-medoids Clustering of Regulatory Rare Alleles for Burden Tests.","authors":"R Michael Sivley, Alexandra E Fish, William S Bush","doi":"10.1007/978-3-642-37189-9_4","DOIUrl":"https://doi.org/10.1007/978-3-642-37189-9_4","url":null,"abstract":"<p><p>Rarely occurring genetic variants are hypothesized to influence human diseases, but statistically associating these rare variants to disease is challenging due to a lack of statistical power in most feasibly sized datasets. Several statistical tests have been developed to either collapse multiple rare variants from a genomic region into a single variable (presence/absence) or to tally the number of rare alleles within a region, relating the burden of rare alleles to disease risk. Both these approaches, however, rely on user-specification of a genomic region to generate these collapsed or burden variables, usually an entire gene. Recent studies indicate that most risk variants for common diseases are found within regulatory regions, not genes. To capture the effect of rare alleles within non-genic regulatory regions for burden tests, we contrast a simple sliding window approach with a knowledge-guided k-medoids clustering method to group rare variants into statistically powerful, biologically meaningful windows. We apply these methods to detect genomic regions that alter expression of nearby genes.</p>","PeriodicalId":90497,"journal":{"name":"Evolutionary computation, machine learning and data mining in bioinformatics. EvoBIO (Conference)","volume":"7833 ","pages":"35-42"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/978-3-642-37189-9_4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"32936927","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Recent work using graph representations for text categorization has shown promising performance over conventional bag-of-words representation of text documents. In this paper we investigate a graph representation of texts for the task of text categorization. In our representation we identify high level concepts extracted from a database of controlled biomedical terms and build a rich graph structure that contains important concepts and relationships. This procedure ensures that graphs are described with a regular vocabulary, leading to increased ease of comparison. We then classify document graphs by applying a set-based graph kernel that is intuitively sensible and able to deal with the disconnectedness of the constructed concept graphs. We compare this approach to standard approaches using non-graph, text-based features. We also do a comparison amongst different kernels that can be used to see which performs better.
{"title":"Biomedical text categorization with concept graph representations using a controlled vocabulary","authors":"Meenakshi Mishra, Jun Huan, S. Bleik, Min Song","doi":"10.1145/2350176.2350181","DOIUrl":"https://doi.org/10.1145/2350176.2350181","url":null,"abstract":"Recent work using graph representations for text categorization has shown promising performance over conventional bag-of-words representation of text documents. In this paper we investigate a graph representation of texts for the task of text categorization. In our representation we identify high level concepts extracted from a database of controlled biomedical terms and build a rich graph structure that contains important concepts and relationships. This procedure ensures that graphs are described with a regular vocabulary, leading to increased ease of comparison. We then classify document graphs by applying a set-based graph kernel that is intuitively sensible and able to deal with the disconnectedness of the constructed concept graphs. We compare this approach to standard approaches using non-graph, text-based features. We also do a comparison amongst different kernels that can be used to see which performs better.","PeriodicalId":90497,"journal":{"name":"Evolutionary computation, machine learning and data mining in bioinformatics. EvoBIO (Conference)","volume":"43 1","pages":"26-32"},"PeriodicalIF":0.0,"publicationDate":"2012-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73425854","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jianxiang Mei, C. Kwoh, Peng Yang, X. Li, Jie Zheng
In pharmacology, it is essential to identify the interactions between drug and targets to understand its effects. Supervised learning with Bipartite Local Model (BLM) recently has been shown to be effective for prediction of drug-target interactions by first predicting target proteins of a given known drug, then predicting drugs targeting a known protein. However, this pure "local" model is inapplicable to new drug or target candidates that currently have no known interactions. In this paper, we extend the existing BLM method by integrating a strategy for handling new drug and target candidates. Based on the assumption that similar drugs and targets have similar interaction profiles, we present a simple neighbor-based training data inferring procedure and integrate it into the frame work of BLM. This globalized BLM called bipartite local model with neighbor-based inferring (BLMN) then has an extended functionality for prediction interactions between new drug candidates and new target candidates. Good performance of BLMN has been observed in the experiment of predicting interactions between drugs and four important categories of targets. For the Nuclear Receptors dataset, where there are more chances for the presented strategy to be applied, 20% improvement in terms of AUPR was achieved. This demonstrates the effectiveness of BLMN and its potential in prediction of drug-target interactions.
在药理学中,确定药物与靶点之间的相互作用是了解其作用的必要条件。基于Bipartite Local Model (BLM)的监督学习最近被证明是预测药物-靶标相互作用的有效方法,它首先预测给定已知药物的靶蛋白,然后预测靶向已知蛋白质的药物。然而,这种纯粹的“局部”模型不适用于目前没有已知相互作用的新药或候选靶点。在本文中,我们通过整合处理新药和候选靶点的策略来扩展现有的BLM方法。基于相似药物和靶点具有相似的相互作用特征的假设,我们提出了一种简单的基于邻域的训练数据推断方法,并将其整合到BLM框架中。这种全球化的BLM被称为基于邻居推理的二部局部模型(bipartite local model with neighbor-based inference, BLMN),具有预测新药候选物和新靶标候选物之间相互作用的扩展功能。在预测药物与四种重要靶点相互作用的实验中,已经观察到BLMN具有良好的性能。对于核受体数据集,所提出的策略有更多的机会被应用,AUPR方面提高了20%。这证明了BLMN的有效性及其在预测药物-靶标相互作用方面的潜力。
{"title":"Globalized bipartite local model for drug-target interaction prediction","authors":"Jianxiang Mei, C. Kwoh, Peng Yang, X. Li, Jie Zheng","doi":"10.1145/2350176.2350178","DOIUrl":"https://doi.org/10.1145/2350176.2350178","url":null,"abstract":"In pharmacology, it is essential to identify the interactions between drug and targets to understand its effects. Supervised learning with Bipartite Local Model (BLM) recently has been shown to be effective for prediction of drug-target interactions by first predicting target proteins of a given known drug, then predicting drugs targeting a known protein. However, this pure \"local\" model is inapplicable to new drug or target candidates that currently have no known interactions. In this paper, we extend the existing BLM method by integrating a strategy for handling new drug and target candidates. Based on the assumption that similar drugs and targets have similar interaction profiles, we present a simple neighbor-based training data inferring procedure and integrate it into the frame work of BLM. This globalized BLM called bipartite local model with neighbor-based inferring (BLMN) then has an extended functionality for prediction interactions between new drug candidates and new target candidates. Good performance of BLMN has been observed in the experiment of predicting interactions between drugs and four important categories of targets. For the Nuclear Receptors dataset, where there are more chances for the presented strategy to be applied, 20% improvement in terms of AUPR was achieved. This demonstrates the effectiveness of BLMN and its potential in prediction of drug-target interactions.","PeriodicalId":90497,"journal":{"name":"Evolutionary computation, machine learning and data mining in bioinformatics. EvoBIO (Conference)","volume":"47 1","pages":"8-14"},"PeriodicalIF":0.0,"publicationDate":"2012-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78252135","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
String kernel-based machine learning methods have yielded great success in practical tasks of structured/sequential data analysis. They often exhibit state-of-the-art performance on tasks such as document topic elucidation, biological sequence classification, or protein superfamily and fold prediction. However, typical string kernel methods rely on analysis of discrete 1D string data (e.g., DNA or amino acid sequences). This work introduces new 2D kernel methods for sequence data in the form of sequences of feature vectors (as in biological sequence profiles, or sequences of individual amino acid physico-chemical descriptors). On three protein sequence classification tasks proposed 2D kernels show significant 15-20% improvements compared to state-of-the-art sequence classification methods.
{"title":"2D similarity kernels for biological sequence classification","authors":"P. Kuksa","doi":"10.1145/2350176.2350179","DOIUrl":"https://doi.org/10.1145/2350176.2350179","url":null,"abstract":"String kernel-based machine learning methods have yielded great success in practical tasks of structured/sequential data analysis. They often exhibit state-of-the-art performance on tasks such as document topic elucidation, biological sequence classification, or protein superfamily and fold prediction. However, typical string kernel methods rely on analysis of discrete 1D string data (e.g., DNA or amino acid sequences). This work introduces new 2D kernel methods for sequence data in the form of sequences of feature vectors (as in biological sequence profiles, or sequences of individual amino acid physico-chemical descriptors). On three protein sequence classification tasks proposed 2D kernels show significant 15-20% improvements compared to state-of-the-art sequence classification methods.","PeriodicalId":90497,"journal":{"name":"Evolutionary computation, machine learning and data mining in bioinformatics. EvoBIO (Conference)","volume":"1 1","pages":"15-20"},"PeriodicalIF":0.0,"publicationDate":"2012-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86924179","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}