2012 12th UK Workshop on Computational Intelligence (UKCI)最新文献

筛选
英文 中文
Evolving the input space for a decision system 演化决策系统的输入空间
2012 12th UK Workshop on Computational Intelligence (UKCI) Pub Date : 2012-10-22 DOI: 10.1109/UKCI.2012.6335779
C. Noakes, C. Hinde
{"title":"Evolving the input space for a decision system","authors":"C. Noakes, C. Hinde","doi":"10.1109/UKCI.2012.6335779","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335779","url":null,"abstract":"This paper addresses the problem of classifying data sets. The aim of this research is to extend the discrimination of a decision system by adding polynomials of the base inputs to the available inputs. The polynomials used to extend the inputs are evolved using the quality of the decision trees resulting from the extended inputs as a fitness function. The system has been integrated into the WEKA framework and so allows other components to be used in the decision system. So far our approach has focused on decision trees using the base inputs and compares it with a decision tree built using the extended input space. NSGA-II, a multi-objective optimisation algorithm, has also been integrated into the system to investigate the effects of added selection pressure on the generated polynomials. Because we have a library of procedures which we can apply we have also used Reduct systems in concert with the extension system and experiments show that although these reduce the input space the overall decision system is no better and can take longer to develop.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130030815","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
Comparing data-mining algorithms developed for longitudinal observational databases 比较为纵向观测数据库开发的数据挖掘算法
2012 12th UK Workshop on Computational Intelligence (UKCI) Pub Date : 2012-10-22 DOI: 10.1109/UKCI.2012.6335771
J. Reps, J. Garibaldi, U. Aickelin, D. Soria, J. Gibson, R. Hubbard
{"title":"Comparing data-mining algorithms developed for longitudinal observational databases","authors":"J. Reps, J. Garibaldi, U. Aickelin, D. Soria, J. Gibson, R. Hubbard","doi":"10.1109/UKCI.2012.6335771","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335771","url":null,"abstract":"Longitudinal observational databases have become a recent interest in the post marketing drug surveillance community due to their ability of presenting a new perspective for detecting negative side effects. Algorithms mining longitudinal observation databases are not restricted by many of the limitations associated with the more conventional methods that have been developed for spontaneous reporting system databases. In this paper we investigate the robustness of four recently developed algorithms that mine longitudinal observational databases by applying them to The Health Improvement Network (THIN) for six drugs with well document known negative side effects. Our results show that none of the existing algorithms was able to consistently identify known adverse drug reactions above events related to the cause of the drug and no algorithm was superior.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128899991","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}
引用次数: 8
Fuzzy controller design using concretion based on boolean relations (CBR) 基于布尔关系(CBR)的模糊控制器设计
2012 12th UK Workshop on Computational Intelligence (UKCI) Pub Date : 2012-10-22 DOI: 10.1109/UKCI.2012.6335773
H. Espitia, H. Chamorro, J. Soriano
{"title":"Fuzzy controller design using concretion based on boolean relations (CBR)","authors":"H. Espitia, H. Chamorro, J. Soriano","doi":"10.1109/UKCI.2012.6335773","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335773","url":null,"abstract":"Fuzzy logic and its applications in control systems have shown a relevant importance in non-linear systems and industrial automation developments, however its main disadvantage is the computational cost involved, having effects on the system performance and its processing. In this document a new Concretion method based on Boolean relations (CBR) is presented, showing a methodology design, its fundamentals and the use of a related defuzzification method named Defuzzification based on Boolean Relations (DBR) which has been validated in previous works. The methodology is evaluated in a Buck-Boost converter and compared with a Mandani controller. Control and computational indices are considered demonstrating the quantitative performance and showing the advantages of the proposed method.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"470 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115882791","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}
引用次数: 5
The importance of being structured: A comparative study on multi stage memetic approaches 结构化的重要性:多阶段模因方法的比较研究
2012 12th UK Workshop on Computational Intelligence (UKCI) Pub Date : 2012-10-22 DOI: 10.1109/UKCI.2012.6335768
Fabio Caraffini, Giovanni Iacca, Ferrante Neri, E. Mininno
{"title":"The importance of being structured: A comparative study on multi stage memetic approaches","authors":"Fabio Caraffini, Giovanni Iacca, Ferrante Neri, E. Mininno","doi":"10.1109/UKCI.2012.6335768","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335768","url":null,"abstract":"Memetic Computing (MC) is a discipline which studies optimization algorithms and sees them as structures of operators, the memes. Although the choice of memes is crucial for an effective algorithmic design, special attention should be paid also to the coordination amongst the memes. This paper presents a study on a basic sequential structure, namely Three Stage Optimal Memetic Exploration (3SOME). The 3SOME algorithm is composed of three operators (or memes) which progressively perturbs a single solution. The first meme, long distance exploration is characterized by a long search radius and is supposed to detect promising areas of the decision space. The second meme, middle distance exploration, is characterized by a moderate search radius and is supposed to focus the search in the the most promising basins of attraction. The third meme, short distance exploration, is characterized by a short search radius and had the role of performing the local optimal search in the areas detected by the first two memes. To assess the importance of the structure within MC we compare the performance of 3SOME with two modified versions of it over two complete benchmarks. In both cases, while retaining the 3SOME structure, we replace one of the three original components (short distance exploration) with an alternative deterministic local search, respectively Rosenbrock and Powell methods. Numerical results show that, regardless of the choice of the specific memes, as far as the 3SOME structure contains memes which perform long, middle, and short distance explorations a similar performance is achieved. These results remark that besides the intuitive finding that a proper choice of operators is fundamental for the algorithmic success, the structure composing them also plays a crucial role.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114834788","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}
引用次数: 7
Heterogeneous classifier ensembles for EEG-based motor imaginary detection 基于脑电图的运动虚感检测的异构分类器集成
2012 12th UK Workshop on Computational Intelligence (UKCI) Pub Date : 2012-10-22 DOI: 10.1109/UKCI.2012.6335751
Shenkai Gu, Yaochu Jin
{"title":"Heterogeneous classifier ensembles for EEG-based motor imaginary detection","authors":"Shenkai Gu, Yaochu Jin","doi":"10.1109/UKCI.2012.6335751","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335751","url":null,"abstract":"EEG signal classification is a challenging task in that the nature of the EEG data may vary from subject to subject, and change over time for the same subject. To improve classification performance, we propose to construct heterogeneous classifier ensembles, where not only the base classifiers are of different types, but they have different input features as well. The classification performance of the proposed method has been examined on Berlin BCI competition III datasets IVa. Our comparative results clearly show that heterogeneous ensembles outperform single models as well as ensembles having the same input features.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123925611","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}
引用次数: 12
Improved evolutionary algorithms for economic load dispatch optimization problems 经济负荷调度优化问题的改进进化算法
2012 12th UK Workshop on Computational Intelligence (UKCI) Pub Date : 2012-10-22 DOI: 10.1109/UKCI.2012.6335753
S. Orike, D. Corne
{"title":"Improved evolutionary algorithms for economic load dispatch optimization problems","authors":"S. Orike, D. Corne","doi":"10.1109/UKCI.2012.6335753","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335753","url":null,"abstract":"We describe and evaluate a new evolutionary algorithm (EA) approach for solving the optimal power flow problem for economic load dispatch in the electricity generation industry. The method combines a standard evolutionary algorithm (EA) with `smart mutation' and hill-climbing. The key aspect of the method that improves performance is the smart mutation operator, which targets mutation of genes according to their respective contributions to the cost function. We consider benchmark instances of the economic load dispatch problem, which involve minimum/maximum generation limits, power balance, ramp rates and prohibited operating zones. Violation of either of these constraints introduces the concept of penalties, and these in turn provide the basis for the smart mutation operator. Our `smart' EA (SEA) is compared with a basic EA (BEA), and with reported results for other recent algorithms, on three benchmark cases involving 6, 15 and 20 generating units. On the larger two of these problems we find better solutions than have so far been reported in the literature, and (where sufficient information is available) in some cases statistical tests confirm the superiority of SEA on these problems to other recent algorithms.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126515890","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}
引用次数: 19
A general type-2 fuzzy logic approach for adaptive modeling of perceptions for Computing With Words 一种用于词语计算的自适应感知建模的通用型2模糊逻辑方法
2012 12th UK Workshop on Computational Intelligence (UKCI) Pub Date : 2012-10-22 DOI: 10.1109/UKCI.2012.6335769
A. Bilgin, H. Hagras, A. Malibari, M. J. Alhaddad, Daniyal M. Al-Ghazzawi
{"title":"A general type-2 fuzzy logic approach for adaptive modeling of perceptions for Computing With Words","authors":"A. Bilgin, H. Hagras, A. Malibari, M. J. Alhaddad, Daniyal M. Al-Ghazzawi","doi":"10.1109/UKCI.2012.6335769","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335769","url":null,"abstract":"In a broad sense, the Computing With Words (CWW) vision tries to tackle the problem of human intelligence by taking the human mind as a role model. A key element to facilitate the mapping of the human's brain reasoning into computer processes is to identify the step-by-step formation of perceptual judgments. In this paper, we present an approach that employs general type-2 fuzzy logic which enables the human perceptions to be dynamically modeled and adapted depending on the human experience. This approach can be regarded as a step to enable the CWW vision. We will present real-world experiments which were conducted with real users in the intelligent apartment (iSpace) in the University of Essex. The experiments demonstrate the results of the proposed approach for the adaptive modeling of ambient luminance perception.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"64 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123019381","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}
引用次数: 9
A novel hybrid spiral-dynamics bacterial-foraging algorithm for global optimization with application to control design 一种新的混合螺旋动力学细菌觅食全局优化算法及其在控制设计中的应用
2012 12th UK Workshop on Computational Intelligence (UKCI) Pub Date : 2012-10-22 DOI: 10.1109/UKCI.2012.6335764
A. Nasir, M. Tokhi, N. Ghani, Mohd Ashraf Ahmad
{"title":"A novel hybrid spiral-dynamics bacterial-foraging algorithm for global optimization with application to control design","authors":"A. Nasir, M. Tokhi, N. Ghani, Mohd Ashraf Ahmad","doi":"10.1109/UKCI.2012.6335764","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335764","url":null,"abstract":"This paper presents a hybrid optimization algorithm referred to as Hybrid spiral dynamics bacterial foraging (HSDBF). The algorithm synergizes spiral adaptive simplified bacterial foraging algorithm (BFA) and spiral dynamics inspired optimization algorithm (SDA). The standard BFA has better exploitation strategy while SDA has superior exploration approach and stable convergence when approaching the optimum value. The hybrid algorithm preserves the strengths of BFA and SDA, thus producing better results. Moreover, it has simple structure and involves less computational burden. Several unimodal and multimodal benchmark functions are employed to test the algorithm in determining the global optimum point. Furthermore, the proposed method is applied to a proportional-derivative (PD) controller optimization for a flexible manipulator system (FMS). The results show that HSDBF outperforms BFA in all test functions and successfully optimizes the PD controller.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123866528","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}
引用次数: 30
Heuristic selection in a multi-phase hybrid approach for dynamic environments 动态环境下多阶段混合方法的启发式选择
2012 12th UK Workshop on Computational Intelligence (UKCI) Pub Date : 2012-10-22 DOI: 10.1109/UKCI.2012.6335755
Gönül Uluda, Berna Kiraz, Ima Etaner Uyar
{"title":"Heuristic selection in a multi-phase hybrid approach for dynamic environments","authors":"Gönül Uluda, Berna Kiraz, Ima Etaner Uyar","doi":"10.1109/UKCI.2012.6335755","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335755","url":null,"abstract":"An iterative selection hyper-heuristic method controls and mixes a set of low-level heuristics while solving a given problem. A low-level heuristic is selected and employed for improving a (set of) solution(s) at each step. This study investigates the influence of different heuristic selection methods within a population based incremental learning algorithm and hyper-heuristic based hybrid multiphase framework for solving dynamic environment problems. Even though the hybrid method delivers a good overall performance, it is superior in cyclic environments. The empirical results show that a heuristic selection method that relies on a fixed permutation of the underlying low-level heuristics, combined with a strategy that guarantees diversity when the environment changes is more successful than the learning approaches across different dynamic environments produced using a well known benchmark generator.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122900504","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}
引用次数: 11
A neurofuzzy classifier for two class problems 两类问题的神经模糊分类器
2012 12th UK Workshop on Computational Intelligence (UKCI) Pub Date : 2012-10-22 DOI: 10.1109/UKCI.2012.6335763
Ming Gao, X. Hong, C. Harris
{"title":"A neurofuzzy classifier for two class problems","authors":"Ming Gao, X. Hong, C. Harris","doi":"10.1109/UKCI.2012.6335763","DOIUrl":"https://doi.org/10.1109/UKCI.2012.6335763","url":null,"abstract":"A neurofuzzy classifier identification algorithm is introduced for two class problems. The initial fuzzy base construction is based on fuzzy clustering utilizing a Gaussian mixture model (GMM) and the analysis of covariance (ANOVA) decomposition. The expectation maximization (EM) algorithm is applied to determine the parameters of the fuzzy membership functions. Then neurofuzzy model is identified via the supervised subspace orthogonal least square (OLS) algorithm. Finally a logistic regression model is applied to produce the class probability. The effectiveness of the proposed neurofuzzy classifier has been demonstrated using a real data set.","PeriodicalId":444902,"journal":{"name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131214160","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
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学术官方微信
小红书