{"title":"Unweighted Multiple Group Method with Arithmetic Mean","authors":"Li Yujian, Xu Liye","doi":"10.1109/BICTA.2010.5645232","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645232","url":null,"abstract":"The traditional UPGMA (Unweighted Pair Group Method with Arithmetic Mean) sometimes derives two or more topologies of “tie trees” from a single data set, depending on the order of data entry. This paper presents an improved algorithm for UPGMA, namely, UMGMA (Unweighted Multiple Group Method with Arithmetic Mean), which can produce a unique multifurcating tree from any distance matrix. Moreover, a UMGMA tree has the same topology as its corresponding UPGMA tree if it is actually bifurcating. UMGMA is different from UPGMA in that it repeatedly merges multiple groups into one by the vertices of a maximal θ-distant subtree until only one group is left, so the UMGMA tree is always unique even in the case that the UPGMA tree is not unique.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125668647","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}
{"title":"Plasmid DNA computing model of 0–1 programming problem","authors":"Zhixiang Yin, Hua Chen, Bosheng Song","doi":"10.1109/BICTA.2010.5645341","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645341","url":null,"abstract":"0–1 programming, a special case of integer programming, is a typical Hard computing problem. It has close relation to other NP-complete problems. In this paper, a DNA algorithm by operating on plasmids was presented to solve the problem. The proposed method clearly showed the distinct advantage of plasmid DNA computing model in terms of integer computation.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132059186","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}
{"title":"A multi-objective membrane algorithm for knapsack problems","authors":"Gexiang Zhang, Yuquan Li, M. Gheorghe","doi":"10.1109/BICTA.2010.5645194","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645194","url":null,"abstract":"This paper proposes a multi-objective membrane algorithm, called MOMA, for solving multi-objective knapsack problems. MOMA is designed with the framework and rules of a cell-like P system, and concepts and principles of quantum-inspired evolutionary algorithms. Three bench knapsack problems used frequently in the literature are applied to test MOMA performance. Experimental results show that MOMA outperforms its counterpart quantum-inspired evolutionary algorithm and several good multi-objective evolutionary algorithms reported in the literature, in terms of Pareto front and performance measures.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131356749","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}
{"title":"Enhanced semi-supervised local fisher discriminant analysis for gene expression data classification","authors":"Hong Huang, Jianwei Li, Hailiang Feng, Ruxi Xiang","doi":"10.1109/BICTA.2010.5645127","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645127","url":null,"abstract":"An improved manifold learning method, called enhanced semi-supervised local fisher discriminant analysis (ESELF), for gene expression data classification is proposed. Motivated by the fact that semi-supervised and parameter-free are two desirable and promising characteristics for dimension reduction, a new difference-based optimization objective function with unlabeled samples has been designed. The proposed method preserves the global structure of unlabeled samples in addition to separating labeled samples in different classes from each other. The semi-supervised method has an analytic form of the globally optimal solution and it can be computed based on eigen decompositions. The experimental results and comparisons on synthetic data and two DNA micro array datasets demonstrate the effectiveness of the proposed method.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129033406","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}
{"title":"A new image coding scheme based upon self organizing maps","authors":"Hongsong Li, Da Li","doi":"10.1109/BICTA.2010.5645202","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645202","url":null,"abstract":"This paper presents a image coding scheme based upon improved self-organizing neural network, FSOM-VQ-DWT. Firstly original image is predicted by vector quantization (VQ), then the predicted error image is encoded by standard JPEG2000. To improve the performance of VQ codebook, we have proposed a new frequency sensitive self-organizing feature maps (FSOM) algorithm. Experimental results show that the proposed FSOM-VQ-DWT coding scheme can get better coding performance than standard JPEG 2000.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"2 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126795920","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}
{"title":"A bi-objective case of no-wait flowshops","authors":"M. Jenabi, B. Naderi, S. Ghomi","doi":"10.1109/BICTA.2010.5645110","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645110","url":null,"abstract":"This paper studies multi-objective no-wait flows hop scheduling problems to minimize both makespan and total tardiness. This paper mathematically formulates it as two effective multi-objective mixed integer linear programming models. The multi-objective models are then solved using a multiple criteria decision making approach. Moreover, this paper proposes a novel multi-objective iterated local search algorithm incorporating with three types of local search engine, greedy and moderate and curtailed fashions. The algorithm is carefully evaluated for its performance against some available algorithms by means of multi-objective performance measures and statistical tools. The results show that the proposed solution method outperforms the others.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"87 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126295328","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}
{"title":"Particle swarm hybridize with Gaussian Process Regression for displacement prediction","authors":"Fuwei Zhu, Chong Xu, Guansuo Dui","doi":"10.1109/BICTA.2010.5645179","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645179","url":null,"abstract":"Gaussian Process Regression (GPR) as a new kernel machine learning technique holds many advantages such as programming easily, self-adaptive acquisition of hyper-parameters and prediction with probability interpretation. Presently, the hyper-parameters of GPR are got by maximizing likelihood function of training samples based on conjugate gradient algorithm. However, the algorithm has the shortcomings of too strong dependence on initial value in optimization effect, difficultly in determination of iteration steps and easily falling into local optimum. The author proposes particle swarm optimization (PSO) and genetic algorithm (GA) is respectively used to search the optimal hyper-parameters during the training process automatically then formed the PSO/GA-GPR algorithm. Finally, the two different hybrids algorithm are adopted to predict the displacement through the typical landslide cases analysis in order to verify the extrapolation ability of both approaches. From the deformation prediction results of landslide displacement, it can be concluded that the PSO-GPR coupling model obviously improved the prediction precision than that of GA-GPR, so it can be utilized in displacement prediction of geotechnical engineering and meanwhile be served as a reference for similar projects.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126579365","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}
{"title":"Hn array splicing system","authors":"P. H. Chandra, S. Kalavathy","doi":"10.1109/BICTA.2010.5645060","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645060","url":null,"abstract":"An extension of splicing system on images of rectangular arrays is introduced in the context of DNA computing. Certain properties of the resulting system are obtained.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122203982","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}
{"title":"A novel Ant algorithm for permutation flow shop problem","authors":"Wenjin Yang, Yantao Zhou, Kenli Li","doi":"10.1109/BICTA.2010.5645102","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645102","url":null,"abstract":"A new ant algorithm for the permutation flow shop problem is presented, which embraces two new features. One is a different yet outstanding pheromone structure, in which an ant is permitted to select more than one jobs at each step when constructing a complete travel sequence. The other is a new heuristic to guide the search. Experiments shows that a considerable improvement of performance can be obtained, and the reason behind is presented.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":" 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113950693","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}
{"title":"CVT fault diagnosis based on immune principle and oil spectrum analysis","authors":"Shuai Gao, Ying An, Yun-Shan Zhou, C. Song","doi":"10.1109/BICTA.2010.5645100","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645100","url":null,"abstract":"By introducing the artificial immune principle into CVT fault diagnosis, using the negative selection method, generate the initial detectors set, then stimulate the set into mature detectors set. Utilizing the mature detectors set to diagnose CVT fault status. And it is proved that the detectors set are effective on CVT fault diagnosis and Fault identification.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123836653","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}