A. Quirin, J. Korczak, Martin Volker Butz, D. Goldberg
In this article, two learning classifier systems based on evolutionary techniques are described to classify remote sensing images. Usually, these images contain voluminous, complex, and sometimes erroneous and noisy data. The first approach implements ICU, an evolutionary rule discovery system, generating simple and robust rules. The second approach applies the real-valued accuracy-based classification system XCSR. The two algorithms are detailed and validated on hyperspectral data.
{"title":"Analysis and evaluation of learning classifier systems applied to hyperspectral image classification","authors":"A. Quirin, J. Korczak, Martin Volker Butz, D. Goldberg","doi":"10.1109/ISDA.2005.23","DOIUrl":"https://doi.org/10.1109/ISDA.2005.23","url":null,"abstract":"In this article, two learning classifier systems based on evolutionary techniques are described to classify remote sensing images. Usually, these images contain voluminous, complex, and sometimes erroneous and noisy data. The first approach implements ICU, an evolutionary rule discovery system, generating simple and robust rules. The second approach applies the real-valued accuracy-based classification system XCSR. The two algorithms are detailed and validated on hyperspectral data.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129518273","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}
In the paper a great importance of text segmentation in natural language engineering and in artificial intelligence systems has been pointed out. It has been shown that in Polish all punctuation marks that end sentences have also other functions in sentences. In this context various approaches to sentence boundary disambiguation have been presented. Taking features of Polish into consideration, text tokenization has been analysed. The direction of empirical research on Polish texts segmentation based on the analysis contained in this paper has been drawn. Also the list of Polish abbreviations that have the same spelling as some common words has been presented.
{"title":"Text segmentation in Polish","authors":"Pawel P. Mazur","doi":"10.1109/ISDA.2005.89","DOIUrl":"https://doi.org/10.1109/ISDA.2005.89","url":null,"abstract":"In the paper a great importance of text segmentation in natural language engineering and in artificial intelligence systems has been pointed out. It has been shown that in Polish all punctuation marks that end sentences have also other functions in sentences. In this context various approaches to sentence boundary disambiguation have been presented. Taking features of Polish into consideration, text tokenization has been analysed. The direction of empirical research on Polish texts segmentation based on the analysis contained in this paper has been drawn. Also the list of Polish abbreviations that have the same spelling as some common words has been presented.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130606986","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}
Nowadays, there is a huge demand for group-based learning (GBL) pedagogies, involving learners in so-called "active" and "rich" pedagogies. We describe the basis of a meta-model to support the design of computer-supported GBL processes and scenarios. Such proposal is related with recent innovative developments in the e-learning domain: Educational Modeling Languages (EMLs) and CSCL scripts. An EML provides a framework of elements that supports the description of any design of a teaching-learning experience in a formal way, involving learning participants, resources, tasks, scenarios, etc. CSCL scripts are proposed as tasks processes that aim to facilitate GBL by specifying tasks in collaborative settings, eventually sequencing these tasks and assigning them to learners. Therefore, pedagogical designs may be processed by appropriate software engines to enact them, providing automatic management and coordination of the involved elements. The meta-model proposed in this paper is conceived as an initial step to create a new EML.
{"title":"Meta-modeling for computer-supported group-based learning design","authors":"M. Caeiro, M. Nistal, L. Anido-Rifón","doi":"10.1109/ISDA.2005.64","DOIUrl":"https://doi.org/10.1109/ISDA.2005.64","url":null,"abstract":"Nowadays, there is a huge demand for group-based learning (GBL) pedagogies, involving learners in so-called \"active\" and \"rich\" pedagogies. We describe the basis of a meta-model to support the design of computer-supported GBL processes and scenarios. Such proposal is related with recent innovative developments in the e-learning domain: Educational Modeling Languages (EMLs) and CSCL scripts. An EML provides a framework of elements that supports the description of any design of a teaching-learning experience in a formal way, involving learning participants, resources, tasks, scenarios, etc. CSCL scripts are proposed as tasks processes that aim to facilitate GBL by specifying tasks in collaborative settings, eventually sequencing these tasks and assigning them to learners. Therefore, pedagogical designs may be processed by appropriate software engines to enact them, providing automatic management and coordination of the involved elements. The meta-model proposed in this paper is conceived as an initial step to create a new EML.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131402209","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}
A novel hybrid simplex method and particle swarm optimization (HSMPSO) algorithm is presented in this article. Computational experiments on variety of benchmark functions indicate this SM-PSO hybrid is a promising way for locating global optima of continuous multimodal functions. Although very easy to be implemented, the hybrid method yields competitive results in both reliability and efficiency compared to other published algorithms. We provide an extensive analysis of the impact of the parameters of our hybrid algorithm on its performance as well.
{"title":"Empirical study of hybrid particle swarm optimizers with the simplex method operator","authors":"Fang Wang, Yuhui Qiu","doi":"10.1109/ISDA.2005.44","DOIUrl":"https://doi.org/10.1109/ISDA.2005.44","url":null,"abstract":"A novel hybrid simplex method and particle swarm optimization (HSMPSO) algorithm is presented in this article. Computational experiments on variety of benchmark functions indicate this SM-PSO hybrid is a promising way for locating global optima of continuous multimodal functions. Although very easy to be implemented, the hybrid method yields competitive results in both reliability and efficiency compared to other published algorithms. We provide an extensive analysis of the impact of the parameters of our hybrid algorithm on its performance as well.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131735811","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}
Y. Mota, S. Joseph, Yuniesky Lezcano, Rafael Bello, M. Lorenzo, Yaimara Pizano
Rough set theory (RST) is a technique for data analysis. In this paper, we use RST to improve the performance of the k-NN method. The RST is used to edit the training set. We propose two methods to edit training sets, which are based on the lower and upper approximations. Experimental results show a satisfactory performance of the k-NN using these techniques.
{"title":"Using rough sets to edit training set in k-NN method","authors":"Y. Mota, S. Joseph, Yuniesky Lezcano, Rafael Bello, M. Lorenzo, Yaimara Pizano","doi":"10.1109/ISDA.2005.98","DOIUrl":"https://doi.org/10.1109/ISDA.2005.98","url":null,"abstract":"Rough set theory (RST) is a technique for data analysis. In this paper, we use RST to improve the performance of the k-NN method. The RST is used to edit the training set. We propose two methods to edit training sets, which are based on the lower and upper approximations. Experimental results show a satisfactory performance of the k-NN using these techniques.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131210303","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}
We present algorithms for fast generation of short reducts which avoid building the discernibility matrix explicitly. We show how information obtained from this matrix can be obtained based only on the distributions of attribute values. Since the size of discernibility matrix is quadratic in the number of data records, not building the matrix explicitly gives a very significant speedup and makes it possible to find reducts even in very large databases. Algorithms are given for both absolute and relative reducts. Experiments show that our approach outperforms other reduct finding algorithms. Furthermore it is shown that many heuristic reduct finding algorithms using the discernibility matrix in fact select attributes based on their Gini index. A new definition of conditional Gini index is presented, motivated by reduct finding heuristics.
{"title":"Finding reducts without building the discernibility matrix","authors":"M. Korzeń, S. Jaroszewicz","doi":"10.1109/ISDA.2005.45","DOIUrl":"https://doi.org/10.1109/ISDA.2005.45","url":null,"abstract":"We present algorithms for fast generation of short reducts which avoid building the discernibility matrix explicitly. We show how information obtained from this matrix can be obtained based only on the distributions of attribute values. Since the size of discernibility matrix is quadratic in the number of data records, not building the matrix explicitly gives a very significant speedup and makes it possible to find reducts even in very large databases. Algorithms are given for both absolute and relative reducts. Experiments show that our approach outperforms other reduct finding algorithms. Furthermore it is shown that many heuristic reduct finding algorithms using the discernibility matrix in fact select attributes based on their Gini index. A new definition of conditional Gini index is presented, motivated by reduct finding heuristics.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"22 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133267543","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}
It is often desirable to simultaneously handle several objectives and constraints in practical optimization problems. In some cases, these objectives and constraints are non-commensurable and they are not explicitly/mathematically available. For this kind of problems, interactive optimization may be a good approach. Interactive optimization means that a human user evaluates the potential solutions in qualitative way. In recent years evolutionary computation (EC) was applied for interactive optimization, which approach has became known as interactive evolutionary computation (IEC). The aim of this paper is to propose a new interactive optimization method based on particle swarm optimization (PSO). PSO is a relatively new population based optimization approach, whose concept originates from the simulation of simplified social systems. The paper shows that interactive PSO cannot be based on the same concept as IEC because the information sharing mechanism of PSO significantly differs from EC. So this paper proposes an approach which considers the unique attributes of PSO. The proposed algorithm has been implemented in MATLAB (IPSO toolbox) and applied to a case-study of temperature profile design of a batch beer fermenter. The results show that IPSO is an efficient and comfortable interactive optimization algorithm. The developed IPSO toolbox (for Mat-lab) can be downloaded from the Web site of the authors: http://www.fmt.vein.hu/softcomp/ipso.
{"title":"Interactive particle swarm optimization","authors":"J. Madár, J. Abonyi, F. Szeifert","doi":"10.1109/ISDA.2005.58","DOIUrl":"https://doi.org/10.1109/ISDA.2005.58","url":null,"abstract":"It is often desirable to simultaneously handle several objectives and constraints in practical optimization problems. In some cases, these objectives and constraints are non-commensurable and they are not explicitly/mathematically available. For this kind of problems, interactive optimization may be a good approach. Interactive optimization means that a human user evaluates the potential solutions in qualitative way. In recent years evolutionary computation (EC) was applied for interactive optimization, which approach has became known as interactive evolutionary computation (IEC). The aim of this paper is to propose a new interactive optimization method based on particle swarm optimization (PSO). PSO is a relatively new population based optimization approach, whose concept originates from the simulation of simplified social systems. The paper shows that interactive PSO cannot be based on the same concept as IEC because the information sharing mechanism of PSO significantly differs from EC. So this paper proposes an approach which considers the unique attributes of PSO. The proposed algorithm has been implemented in MATLAB (IPSO toolbox) and applied to a case-study of temperature profile design of a batch beer fermenter. The results show that IPSO is an efficient and comfortable interactive optimization algorithm. The developed IPSO toolbox (for Mat-lab) can be downloaded from the Web site of the authors: http://www.fmt.vein.hu/softcomp/ipso.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132248201","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}
Proper language for formal definition of L-systems is crucial to easy creation, modification and comparison between plant models. This paper introduces special purpose language, which allows effortless description of D0L-systems (simplest class of L-systems) and their extensions (e.g. context-sensitive, parametric productions with probability). The proposed language enables as well specification of high-level model parameters.
l -系统的形式化定义的适当语言对于易于创建、修改和比较植物模型至关重要。本文介绍了一种专用语言，它可以轻松地描述l -系统(l -系统中最简单的一类)及其扩展(例如上下文敏感的、具有概率的参数生成)。所建议的语言还支持高级模型参数的规范。
{"title":"Modeling plants language for definition of L-systems","authors":"K. Lukasik, Elzbieta Hudyma","doi":"10.1109/ISDA.2005.66","DOIUrl":"https://doi.org/10.1109/ISDA.2005.66","url":null,"abstract":"Proper language for formal definition of L-systems is crucial to easy creation, modification and comparison between plant models. This paper introduces special purpose language, which allows effortless description of D0L-systems (simplest class of L-systems) and their extensions (e.g. context-sensitive, parametric productions with probability). The proposed language enables as well specification of high-level model parameters.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125063266","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}
Nobuharu Murata, T. Furuya, H. Nosato, M. Murakawa
This paper describes an automatic multi-objective adjustment system for optical axes using genetic algorithms. It is difficult for conventional systems to automatically adjust optical axes, because it requires high-precision positioning and angle setting with /spl mu/m resolution. Moreover, multiple goals that have a trade-off relation must be satisfied simultaneously by the adjustment. In order to overcome this problem, we propose a multi-objective adjustment system using genetic algorithms. In experiments, simultaneous alignment for the positioning and the angles (parallelism) of optical axes, which is difficult with conventional methods, could be realized within three hours.
介绍了一种基于遗传算法的光轴多目标自动调整系统。由于需要高精度的定位和/spl μ m /m分辨率的角度设置，传统系统难以实现光轴的自动调节。而且，调整必须同时满足具有权衡关系的多个目标。为了克服这一问题，我们提出了一种基于遗传算法的多目标调整系统。在实验中，可以在3小时内实现传统方法难以实现的定位和光轴角度(平行度)的同时对准。
{"title":"An automatic multi-objective adjustment system for optical axes using genetic algorithms","authors":"Nobuharu Murata, T. Furuya, H. Nosato, M. Murakawa","doi":"10.1109/ISDA.2005.21","DOIUrl":"https://doi.org/10.1109/ISDA.2005.21","url":null,"abstract":"This paper describes an automatic multi-objective adjustment system for optical axes using genetic algorithms. It is difficult for conventional systems to automatically adjust optical axes, because it requires high-precision positioning and angle setting with /spl mu/m resolution. Moreover, multiple goals that have a trade-off relation must be satisfied simultaneously by the adjustment. In order to overcome this problem, we propose a multi-objective adjustment system using genetic algorithms. In experiments, simultaneous alignment for the positioning and the angles (parallelism) of optical axes, which is difficult with conventional methods, could be realized within three hours.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121765224","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}
In the paper our approach to classify handwritten digits by using support vector machines is described. Because of the unsatisfying, long time of training of SVM we propose to apply k-nearest neighbours algorithm with Manhattan distance to obtain reduced size of training set having a hope that this hybrid method does not make the significantly worse results of recognition. The aim of presented further experiments was to verify this assumption.
{"title":"Support vector machines in handwritten digits classification","authors":"Urszula Markowska-Kaczmar, Pawel Kubacki","doi":"10.1109/ISDA.2005.87","DOIUrl":"https://doi.org/10.1109/ISDA.2005.87","url":null,"abstract":"In the paper our approach to classify handwritten digits by using support vector machines is described. Because of the unsatisfying, long time of training of SVM we propose to apply k-nearest neighbours algorithm with Manhattan distance to obtain reduced size of training set having a hope that this hybrid method does not make the significantly worse results of recognition. The aim of presented further experiments was to verify this assumption.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121372892","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：