发布求助
文献互助 智能选刊 最新文献

5th International Conference on Intelligent Systems Design and Applications (ISDA'05)最新文献

筛选
英文 中文
Analysis and evaluation of learning classifier systems applied to hyperspectral image classification 学习分类器系统在高光谱图像分类中的应用分析与评价
5th International Conference on Intelligent Systems Design and Applications (ISDA'05) Pub Date : 2005-09-08 DOI: 10.1109/ISDA.2005.23
A. Quirin, J. Korczak, Martin Volker Butz, D. Goldberg
{"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}
引用次数: 4
Text segmentation in Polish 波兰语文本分割
5th International Conference on Intelligent Systems Design and Applications (ISDA'05) Pub Date : 2005-09-08 DOI: 10.1109/ISDA.2005.89
Pawel P. Mazur
{"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}
引用次数: 5
Meta-modeling for computer-supported group-based learning design 基于计算机支持的小组学习设计的元建模
5th International Conference on Intelligent Systems Design and Applications (ISDA'05) Pub Date : 2005-09-08 DOI: 10.1109/ISDA.2005.64
M. Caeiro, M. Nistal, L. Anido-Rifón
{"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}
引用次数: 2
Empirical study of hybrid particle swarm optimizers with the simplex method operator 基于单纯形算子的混合粒子群优化算法的实证研究
5th International Conference on Intelligent Systems Design and Applications (ISDA'05) Pub Date : 2005-09-08 DOI: 10.1109/ISDA.2005.44
Fang Wang, Yuhui Qiu
{"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}
引用次数: 11
Using rough sets to edit training set in k-NN method 用粗糙集编辑k-NN方法中的训练集
5th International Conference on Intelligent Systems Design and Applications (ISDA'05) Pub Date : 2005-09-08 DOI: 10.1109/ISDA.2005.98
Y. Mota, S. Joseph, Yuniesky Lezcano, Rafael Bello, M. Lorenzo, Yaimara Pizano
{"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}
引用次数: 7
Finding reducts without building the discernibility matrix 在不建立差别矩阵的情况下找到约简
5th International Conference on Intelligent Systems Design and Applications (ISDA'05) Pub Date : 2005-09-08 DOI: 10.1109/ISDA.2005.45
M. Korzeń, S. Jaroszewicz
{"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}
引用次数: 18
Interactive particle swarm optimization 交互粒子群优化
5th International Conference on Intelligent Systems Design and Applications (ISDA'05) Pub Date : 2005-09-08 DOI: 10.1109/ISDA.2005.58
J. Madár, J. Abonyi, F. Szeifert
{"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}
引用次数: 40
Modeling plants language for definition of L-systems l -系统的建模语言
5th International Conference on Intelligent Systems Design and Applications (ISDA'05) Pub Date : 2005-09-08 DOI: 10.1109/ISDA.2005.66
K. Lukasik, Elzbieta Hudyma
{"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}
引用次数: 1
An automatic multi-objective adjustment system for optical axes using genetic algorithms 基于遗传算法的光轴自动多目标调整系统
5th International Conference on Intelligent Systems Design and Applications (ISDA'05) Pub Date : 2005-09-08 DOI: 10.1109/ISDA.2005.21
Nobuharu Murata, T. Furuya, H. Nosato, M. Murakawa
{"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}
引用次数: 8
Support vector machines in handwritten digits classification 支持向量机在手写数字分类中的应用
5th International Conference on Intelligent Systems Design and Applications (ISDA'05) Pub Date : 2005-09-08 DOI: 10.1109/ISDA.2005.87
Urszula Markowska-Kaczmar, Pawel Kubacki
{"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}
引用次数: 10
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信