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}
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}
Artificial neural networks (ANNs) were inspired by natural neural networks (NNNs) and natural processes of training. The NNNs receive data in time still tuning the inner model of the surrounding world. These valuable features of our brains let us to dynamically accommodate themselves to the changes surround. These features make us possible to forget some irrelevant information, correct our knowledge and meet truth. ANNs usually work on the training data (TD) acquired in the past and totally known at the beginning of the adaptation process. Because of this the adaptation methods of the ANNs can be sometimes more effective than the natural training process observed in the NNNs. This paper discusses the ability of ANNs to adapt more effectively than NNNs do if only the TD is completely given at the beginning of the adaptation process. In this case the adaptation process of ANNs can be divided into two steps: analyze or examining the set of TD and construction of neural network topology and weights computation. Two different applications areas of such approach are presented in the paper.
{"title":"Effectiveness of artificial neural networks adaptation according to time period of training data acquisition","authors":"A. Horzyk, E. Dudek-Dyduch","doi":"10.1109/ISDA.2005.43","DOIUrl":"https://doi.org/10.1109/ISDA.2005.43","url":null,"abstract":"Artificial neural networks (ANNs) were inspired by natural neural networks (NNNs) and natural processes of training. The NNNs receive data in time still tuning the inner model of the surrounding world. These valuable features of our brains let us to dynamically accommodate themselves to the changes surround. These features make us possible to forget some irrelevant information, correct our knowledge and meet truth. ANNs usually work on the training data (TD) acquired in the past and totally known at the beginning of the adaptation process. Because of this the adaptation methods of the ANNs can be sometimes more effective than the natural training process observed in the NNNs. This paper discusses the ability of ANNs to adapt more effectively than NNNs do if only the TD is completely given at the beginning of the adaptation process. In this case the adaptation process of ANNs can be divided into two steps: analyze or examining the set of TD and construction of neural network topology and weights computation. Two different applications areas of such approach are presented in the paper.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"13 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":"128267535","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}
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}
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}
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}
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}
One of the most important requirements of data warehouses is query response time. Amongst all methods of improving query performance, parallel processing (especially in shared nothing class) is one of the giving practically unlimited system's scaling possibility. The key problem in a parallel data warehouses is data allocation between system nodes. The problem is growing when nodes have different computational characteristics. In this paper we present an algorithm of balancing parallel data warehouse built on mentioned architecture. Balancing is realized by setting dataset size stored in each node. We exploited some well known data allocation schemas using space filling curves: Hilbert and Peano. Our conception is verified by a set of tests and its analysis.
{"title":"Parallel telemetric data warehouse balancing algorithm","authors":"M. Gorawski, Robert Chechelski","doi":"10.1109/ISDA.2005.75","DOIUrl":"https://doi.org/10.1109/ISDA.2005.75","url":null,"abstract":"One of the most important requirements of data warehouses is query response time. Amongst all methods of improving query performance, parallel processing (especially in shared nothing class) is one of the giving practically unlimited system's scaling possibility. The key problem in a parallel data warehouses is data allocation between system nodes. The problem is growing when nodes have different computational characteristics. In this paper we present an algorithm of balancing parallel data warehouse built on mentioned architecture. Balancing is realized by setting dataset size stored in each node. We exploited some well known data allocation schemas using space filling curves: Hilbert and Peano. Our conception is verified by a set of tests and its analysis.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"26 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":"123363488","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 investigate a pure exchange economy under uncertainty with emphasis on the logical point of view from data base theory; the traders are assumed to have a multi-modal logic of belief and to make their decision under uncertainty represented by rough sets. We propose a generalized notion of expectations equilibrium for the economy, and we show the fundamental welfare theorem: An allocation in the economy is ex-ante Pareto optimal if and only if it is an expectations equilibrium allocation in belief for some initial endowment with respect to some price system.
{"title":"Welfare economy on belief in data mining - a rough set theoretical approach","authors":"T. Matsuhisa","doi":"10.1109/ISDA.2005.101","DOIUrl":"https://doi.org/10.1109/ISDA.2005.101","url":null,"abstract":"We investigate a pure exchange economy under uncertainty with emphasis on the logical point of view from data base theory; the traders are assumed to have a multi-modal logic of belief and to make their decision under uncertainty represented by rough sets. We propose a generalized notion of expectations equilibrium for the economy, and we show the fundamental welfare theorem: An allocation in the economy is ex-ante Pareto optimal if and only if it is an expectations equilibrium allocation in belief for some initial endowment with respect to some price system.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"59 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":"129586835","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
扫码关注我们
求助内容：
应助结果提醒方式：