2015 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)最新文献

筛选
英文 中文
Iterative learning cascaded multiclass kernel based support vector machine for neural spike data classification 基于迭代学习级联多类核的支持向量机神经脉冲数据分类
A. Zjajo, R. V. Leuken
{"title":"Iterative learning cascaded multiclass kernel based support vector machine for neural spike data classification","authors":"A. Zjajo, R. V. Leuken","doi":"10.1109/CIBCB.2015.7300278","DOIUrl":"https://doi.org/10.1109/CIBCB.2015.7300278","url":null,"abstract":"In this paper, we develop an iterative learning framework based on multiclass kernel support vector machine (SVM) for adaptive classification of neural spikes. For efficient algorithm execution, we transform a multiclass problem with the Kesler's construction and extend iterative greedy optimization reduced set vectors approach with a cascaded method. Since obtained classification function is highly parallelizable, the problem is sub-divided and parallel units are instantiated for the processing of each sub-problem via energy-scalable kernels. After partition of the data into disjoint subsets, we optimize the data separately with multiple SVMs. We construct cascades of such (partial) approximations and use them to obtain the modified objective function, which offers high accuracy, has small kernel matrices and low computational complexity.","PeriodicalId":209383,"journal":{"name":"2015 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132560823","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}
引用次数: 1
Towards large scale genetic network modeling 面向大规模遗传网络建模
Rubaiya Rahtin Khan, M. Chetty
{"title":"Towards large scale genetic network modeling","authors":"Rubaiya Rahtin Khan, M. Chetty","doi":"10.1109/CIBCB.2015.7300332","DOIUrl":"https://doi.org/10.1109/CIBCB.2015.7300332","url":null,"abstract":"Reverse Engineering Gene Regulatory Networks (GRNs) is an important and challenging problem of Systems Biology. For its superiority in both structure and parameter learning, the S-system model framework is often chosen for GRN reconstruction. The biggest challenge in reconstructing GRNs is the data having large number of genes and only a small number of samples. This “curse of dimensionality”, along with the large number of model parameters to be learnt, makes it extremely difficult to reverse engineer even a small network. For a medium or large network, the complexity becomes enormous. In this paper, we propose a method for managing large scale GRN modeling. As first step, we propose an Affinity Propagation Based Clustering to identify appropriate clusters by grouping the genes based on their time expression profiles. In the second step, the largest cluster consisting of majority of the relevant genes is considered in full detail to act as the core of the network while the other remaining clusters, which are not so significant, are each represented by their single representative gene to obtain a reduced order GRN. In the third step, we optimize the entire network by initializing the model parameters of the genes of the largest cluster with the values obtained in the second step (which are near optimal) and proceed to optimize the entire network. The initial investigations are carried out using previously reported 20-gene synthetic network. The superiority of performance is evaluated not only using the standard metrics, namely, sensitivity, specificity, precision and F-score, but also by average mean error and by comparing the time responses with those of the actual network parameters. The results obtained are promising.","PeriodicalId":209383,"journal":{"name":"2015 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131078633","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}
引用次数: 1
Taenia biomolecular phylogeny and the impact of mitochondrial genes on this latter 带绦虫生物分子系统发育及线粒体基因对后者的影响
Huda Al-Nayyef, C. Guyeux, J. Bahi
{"title":"Taenia biomolecular phylogeny and the impact of mitochondrial genes on this latter","authors":"Huda Al-Nayyef, C. Guyeux, J. Bahi","doi":"10.1109/CIBCB.2015.7300275","DOIUrl":"https://doi.org/10.1109/CIBCB.2015.7300275","url":null,"abstract":"Variations in mitochondrial genes are usually considered to infer phylogenies. However some of these genes are lesser constraint than other ones, and thus may blur the phylogenetic signals shared by the majority of the mitochondrial DNA sequences. To investigate such effects, in this research work, the molecular phylogeny of the genus Taenia is studied using 14 coding sequences extracted from mitochondrial genomes of 17 species. We constructed 16,384 trees, using a combination of 1 up to 14 genes. We obtained 131 topologies, and we showed that only four particular instances were relevant. Using further statistical investigations, we then extracted a particular topology, which displays more robustness properties.","PeriodicalId":209383,"journal":{"name":"2015 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121934218","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}
引用次数: 1
Stress and productivity performance in the workforce modelled with binary decision automata 用二元决策自动机建模的劳动力压力和生产力表现
M. Page, D. Ashlock
{"title":"Stress and productivity performance in the workforce modelled with binary decision automata","authors":"M. Page, D. Ashlock","doi":"10.1109/CIBCB.2015.7300292","DOIUrl":"https://doi.org/10.1109/CIBCB.2015.7300292","url":null,"abstract":"This study is the third in a series developing an agent based ecological model of the workplace focused on the impact of stress. Stress and stress-related health problems are a serious matter but, prior to this series of studies, quantitative modeling of stress has been substantially neglected. This model builds on earlier work, incorporating a more realistic model of the stress relief caused by time off on weekends. The model also examines drug use as something that can be learned spontaneously or learned from a mentor rather than being present in an endemic, fixed fraction of the population, as it was in earlier studies. In this study a parameter exploration is performed on the agent representation, binary decision automata. It is found that the BDA representation is highly adaptive, responding robustly to parameter changes. Parameters investigated include number internal states in agents, accuracy of imitation of mentors, work requirements, and probabilities of learned and spontaneous drug use. Parameter values are taken beyond reasonable ranges to examine the model's failure modes. This study demonstrates that the model behaves in a reasonable fashion, determines its limits, and established a baseline for further investigation.","PeriodicalId":209383,"journal":{"name":"2015 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124596950","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}
引用次数: 4
Digitization of trait representation in microarray data analysis of wheat infected by fusarium graminearum 小麦镰刀菌微阵列数据分析中性状表征的数字化
Youlian Pan, T. Ouellet, Sieu Phan, A. Tchagang, François Fauteux, D. Tulpan
{"title":"Digitization of trait representation in microarray data analysis of wheat infected by fusarium graminearum","authors":"Youlian Pan, T. Ouellet, Sieu Phan, A. Tchagang, François Fauteux, D. Tulpan","doi":"10.1109/CIBCB.2015.7300304","DOIUrl":"https://doi.org/10.1109/CIBCB.2015.7300304","url":null,"abstract":"Fusarium head blight (FHB) limits wheat yield and compromises grain quality. We investigated differentially expressed genes after FHB challenge. FHB-susceptible and -resistant common wheat (Triticum aestivum) cultivars were challenged with the toxigenic fungus Fusarium graminearum and gene expression was analyzed using 61K Affymetrix wheat microarrays. We digitized trait specificity in the susceptible and resistant lines with and without the infection in order to facilitate subsequent data mining. We discovered various patterns of differential gene expression between susceptible and resistant lines in response to the infection. We performed association network analysis among genes in clusters significantly correlated with one or more quantitative trait loci known to contribute to Fusarium resistance. We found 11 interconnected hub genes responsive to FHB infection and significantly correlated with wheat resistance to FHB, among which two are predicted to encode a polygalacturonase-inhibiting protein (PGIP1).","PeriodicalId":209383,"journal":{"name":"2015 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128409097","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}
引用次数: 2
Matching models of HIV-1 viral dynamics to clinical data HIV-1病毒动力学与临床数据的匹配模型
Andrew E. Adams, Z. Brumme, A. Rutherford, R. Wittenberg
{"title":"Matching models of HIV-1 viral dynamics to clinical data","authors":"Andrew E. Adams, Z. Brumme, A. Rutherford, R. Wittenberg","doi":"10.1109/CIBCB.2015.7300326","DOIUrl":"https://doi.org/10.1109/CIBCB.2015.7300326","url":null,"abstract":"Creating individualized within-host multiple phase disease models of HIV-1 infection has long been a goal of mathematicians and biologists. The challenge is in trying to build models that are representative of the disease, include realistic parameter estimates, and are able to incorporate a changing model structure. In this paper, we propose a fitting procedure, motivated by the biology of the disease, for matching parameters of differential equation and stochastic models of HIV-1 infection to data, which leverages high performance computing resources. The search uses knowledge of the biological set points to restrict the search domain, and parallel simulated annealing to match the model to acute and early chronic phase patient data. We highlight this method by finding parameters for two interconnected models of HIV-1 infection which we have developed. The high quality of our data allows us to model not only viral data, but also CD4 count data through the acute and chronic phases of the disease. The time span of our model exceeds that of previous models. The algorithm is able to find parameter values for four patients consistent with literature ranges and display individual set point equilibration and disease progression for both clinical markers.","PeriodicalId":209383,"journal":{"name":"2015 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127622475","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}
引用次数: 1
Chaos automata for sequence visualization 序列可视化的混沌自动机
D. Ashlock, C. McGuinness, W. Ashlock
{"title":"Chaos automata for sequence visualization","authors":"D. Ashlock, C. McGuinness, W. Ashlock","doi":"10.1109/CIBCB.2015.7300339","DOIUrl":"https://doi.org/10.1109/CIBCB.2015.7300339","url":null,"abstract":"A chaos automata is a type of side effect machine that serves as a state-conditioned version of the chaos game used to visualize DNA or other linear sequence data. This study performs a parameter study to tune an evolutionary algorithm for locating chaos automata that make relatively dense renderings of two-class DNA data. Both the number of states and the population size turn out to be relatively soft parameters, but there is benefit to tuning the mutation rate. The fitness landscape is found to be rugose and to possess a large number of optima. A reporting tool called time of last innovation is used to provide additional nuance to the traditional reporting of best fitness values. Topics for additional work are outlined, including a demonstration that chaos automata can be averaged to provide an additional avenue to search for effective visualizations. The system is tested on synthetic and biological data.","PeriodicalId":209383,"journal":{"name":"2015 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131311496","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}
引用次数: 1
A novel gene selection algorithm for cancer identification based on random forest and particle swarm optimization 基于随机森林和粒子群优化的癌症基因选择新算法
Elnaz Pashaei, M. Ozen, N. Aydin
{"title":"A novel gene selection algorithm for cancer identification based on random forest and particle swarm optimization","authors":"Elnaz Pashaei, M. Ozen, N. Aydin","doi":"10.1109/CIBCB.2015.7300338","DOIUrl":"https://doi.org/10.1109/CIBCB.2015.7300338","url":null,"abstract":"In order to achieve informative gene from thousands of candidate genes contributing to the symptom of cancer, two novel gene selection approaches for classification of multiclass microarray datasets are proposed. In the first, method we use k-means clustering to remove redundancy, and then apply Random Forest (RF) to rank each gene in every cluster to remove irrelevance. The top scored genes from each cluster is gathered and a new feature subset (filtered genes) is generated. At the last stage filtered genes is used as input to eight benchmark classification methods. In the second approach we develop a novel method utilizing Particle Swarm Optimization combined with BoostedC5.0 decision tree as the classifier. We apply filtered genes that achieved by first proposed method as input to PSO+BoostedC5.0 classifier and compare the performance of it with 8 classifiers. Experimental results show that by using clustering technique and RF ranking we can give a true pattern which select a smaller number of feature subset and obtain better classification accuracy. Also by applying this method on ten microarray datasets and using filtered genes as input for 9 classifiers we showed that proposed PSO+BoostedC5.0 simplifies features effectively and obtains higher classification accuracy compared to the other classification methods.","PeriodicalId":209383,"journal":{"name":"2015 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131705042","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}
引用次数: 15
Lung nodule diagnosis from CT images based on ensemble learning 基于集成学习的CT图像肺结节诊断
F. Farahani, Abbas Ahmadi, M. Zarandi
{"title":"Lung nodule diagnosis from CT images based on ensemble learning","authors":"F. Farahani, Abbas Ahmadi, M. Zarandi","doi":"10.1109/CIBCB.2015.7300281","DOIUrl":"https://doi.org/10.1109/CIBCB.2015.7300281","url":null,"abstract":"Early detection of cancer is the most promising way to enhance a patient's chance for survival. This paper presents a computer-aided classification method using computed tomography (CT) images of the lung based on ensemble of three classifiers including MLP, KNN and SVM. In this study, the entire lung is first segmented from the CT images and specific features like Roundness, Circularity, Compactness, Ellipticity, and Eccentricity are calculated from the segmented images. These morphological features are used for classification process in a way that each classifier makes its own decision. Finally, majority voting method is used to combine decisions of this ensemble system. The performance of this system is evaluated using 60 CT scans collected by Lung Image Database Consortium (LIDC) and the results show good improvement in diagnosing of pulmonary nodules.","PeriodicalId":209383,"journal":{"name":"2015 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125533581","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}
引用次数: 52
TSC_ATP: A two-stage classifier for predicting protein-ATP binding sites from protein sequence TSC_ATP:从蛋白质序列预测蛋白质- atp结合位点的两阶段分类器
Bryan J. Andrews, Jing Hu
{"title":"TSC_ATP: A two-stage classifier for predicting protein-ATP binding sites from protein sequence","authors":"Bryan J. Andrews, Jing Hu","doi":"10.1109/CIBCB.2015.7300330","DOIUrl":"https://doi.org/10.1109/CIBCB.2015.7300330","url":null,"abstract":"It is well known that adenine triphosphate (ATP) binds with proteins to play important roles in metabolism, cell signaling, and as cofactor. Therefore it is crucial to identify ATP-binding sites on proteins to understand these mechanisms. In this paper, we present a computational method that can accurately predict ATP-binding sites on proteins using sequence-derived information. The algorithm is organized in a two-layered structure. The method first makes prediction by a K-Nearest Neighbors (K-NN) method using evolutionary profile information of each residue. The output of the first-layer classifier serves as an input feature together with other 11 features to a second-layer classifier. The final method achieved an AUC (area under the ROC curve) of 0.829 and 0.860 respectively on two benchmark datasets.","PeriodicalId":209383,"journal":{"name":"2015 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126059109","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}
引用次数: 6
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书