Crew grouping is an important problem and formulating a good solution always involves many challenges. For example, grouping soldiers intelligently to tank combat units, we should take into consideration the combined technical proficiency of the soldiers, the amount of military training, the units from which the soldiers come, their service age, personal background, etc. In this paper, we propose a hybrid fuzzy-genetic algorithm (FGA) approach to solve the crew grouping problem. Fuzzy logic based controllers are applied to fine-tune dynamically the crossover and mutation probability in the genetic algorithms, in an attempt to improve the algorithm performance. The FGA approach is compared with the standard genetic algorithm (SGA). Empirical results clearly demonstrates that while the SGA approach gives satisfactory solutions for the problem, the FGA method usually performs significantly better.
{"title":"Hybrid fuzzy-genetic algorithm approach for crew grouping","authors":"Hongbo Liu, Zhang Xu, A. Abraham","doi":"10.1109/ISDA.2005.51","DOIUrl":"https://doi.org/10.1109/ISDA.2005.51","url":null,"abstract":"Crew grouping is an important problem and formulating a good solution always involves many challenges. For example, grouping soldiers intelligently to tank combat units, we should take into consideration the combined technical proficiency of the soldiers, the amount of military training, the units from which the soldiers come, their service age, personal background, etc. In this paper, we propose a hybrid fuzzy-genetic algorithm (FGA) approach to solve the crew grouping problem. Fuzzy logic based controllers are applied to fine-tune dynamically the crossover and mutation probability in the genetic algorithms, in an attempt to improve the algorithm performance. The FGA approach is compared with the standard genetic algorithm (SGA). Empirical results clearly demonstrates that while the SGA approach gives satisfactory solutions for the problem, the FGA method usually performs significantly better.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"1 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":"130026461","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}
Due to the wide deployment of sensor networks recently security in sensor networks has become a hot research topic. Popular ways to secure a sensor network are by including cryptographic techniques or by safeguarding sensitive information from unauthorized access/manipulation and by implementing efficient intrusion detection mechanisms. This paper proposes a novel ant colony based intrusion detection mechanism which could also keep track of the intruder trials. The IDEAS technique could work in conjunction with the conventional machine learning based intrusion detection techniques to secure the sensor networks. The algorithm is presented and illustrated by simulating a sensor network.
{"title":"IDEAS: intrusion detection based on emotional ants for sensors","authors":"S. Banerjee, C. Grosan, A. Abraham","doi":"10.1109/ISDA.2005.53","DOIUrl":"https://doi.org/10.1109/ISDA.2005.53","url":null,"abstract":"Due to the wide deployment of sensor networks recently security in sensor networks has become a hot research topic. Popular ways to secure a sensor network are by including cryptographic techniques or by safeguarding sensitive information from unauthorized access/manipulation and by implementing efficient intrusion detection mechanisms. This paper proposes a novel ant colony based intrusion detection mechanism which could also keep track of the intruder trials. The IDEAS technique could work in conjunction with the conventional machine learning based intrusion detection techniques to secure the sensor networks. The algorithm is presented and illustrated by simulating a sensor network.","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":"126507299","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}
I. L. Ruiz, G. C. García, Manuel Urbano-Cuadrado, M. Gómez-Nieto
The recovery of information from large databases based on similarity approach supposes a high computational cost -when the process is carried out comparing each one of the records with the search pattern. If the database records store some data structure representing the information of the problem domain by means of a graph it is possible to classify these records using a hierarchical model which considers the structural basic elements of the graphs and diminishes the computational cost of the recovery process considerably. In this paper we propose a classification model based on structural elements (cycles and chains) for large and medium databases.
{"title":"New models for the clustering of large databases through a hierarchical paradigm","authors":"I. L. Ruiz, G. C. García, Manuel Urbano-Cuadrado, M. Gómez-Nieto","doi":"10.1109/ISDA.2005.72","DOIUrl":"https://doi.org/10.1109/ISDA.2005.72","url":null,"abstract":"The recovery of information from large databases based on similarity approach supposes a high computational cost -when the process is carried out comparing each one of the records with the search pattern. If the database records store some data structure representing the information of the problem domain by means of a graph it is possible to classify these records using a hierarchical model which considers the structural basic elements of the graphs and diminishes the computational cost of the recovery process considerably. In this paper we propose a classification model based on structural elements (cycles and chains) for large and medium databases.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"1 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":"129211069","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}
Iris detection is a crucial part of an iris recognition system. One of the main issues in iris segmentation is coping with occlusions that happen due to eyelids and eyelashes. In this paper, only the lower part of the iris is utilized for recognition. Wavelet based texture features along with a mixed Hamming; harmonic mean distance classifier is used for identification. It is observed that relying in a smaller but more reliable part of the iris, though reducing the net amount of information, improves the overall performance. Experimental results on CASIA database show that the method has a promising performance with an accuracy of more than 99%.
{"title":"A half-eye wavelet based method for iris recognition","authors":"A. Poursaberi, Babak Nadjar Araabi","doi":"10.1109/ISDA.2005.6","DOIUrl":"https://doi.org/10.1109/ISDA.2005.6","url":null,"abstract":"Iris detection is a crucial part of an iris recognition system. One of the main issues in iris segmentation is coping with occlusions that happen due to eyelids and eyelashes. In this paper, only the lower part of the iris is utilized for recognition. Wavelet based texture features along with a mixed Hamming; harmonic mean distance classifier is used for identification. It is observed that relying in a smaller but more reliable part of the iris, though reducing the net amount of information, improves the overall performance. Experimental results on CASIA database show that the method has a promising performance with an accuracy of more than 99%.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"15 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":"122349784","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}
Implementation of data mining applications is a challenging and complicated task, and the applications are often built from scratch. In this paper, a component-based application framework, called smart archive (SA) designed for implementing data mining applications, is presented. SA provides functionality common to most data mining applications and components for utilizing history information. Using SA, it is possible to build high-quality applications with shorter development times by configuring the framework to process application-specific data. The architecture, the components, the implementation and the design principles of the framework are presented. The advantages of a framework-based implementation are demonstrated by presenting a case study which compares the framework approach to implementing a real-world application with the option of building an equivalent application from scratch. In conclusion, the paper presents a lucid framework for creating data mining applications and illustrates the importance and advantages of using the presented approach.
{"title":"Smart archive: a component-based data mining application framework","authors":"P. Laurinen, L. Tuovinen, J. Röning","doi":"10.1109/ISDA.2005.83","DOIUrl":"https://doi.org/10.1109/ISDA.2005.83","url":null,"abstract":"Implementation of data mining applications is a challenging and complicated task, and the applications are often built from scratch. In this paper, a component-based application framework, called smart archive (SA) designed for implementing data mining applications, is presented. SA provides functionality common to most data mining applications and components for utilizing history information. Using SA, it is possible to build high-quality applications with shorter development times by configuring the framework to process application-specific data. The architecture, the components, the implementation and the design principles of the framework are presented. The advantages of a framework-based implementation are demonstrated by presenting a case study which compares the framework approach to implementing a real-world application with the option of building an equivalent application from scratch. In conclusion, the paper presents a lucid framework for creating data mining applications and illustrates the importance and advantages of using the presented approach.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"44 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":"122017194","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}
Neural networks are widely used in time-series forecasting. One of the issues that arise in neural networks applications is that when a neural network is trained for too long the quality of the predictions tends to deteriorate. To overcome this problem various methods of early stopping are employed. This paper proposes a new approach to early stopping issue in neural network training. In the approach presented the validation series is chosen based on its mean dynamic correlation with forecasted series. The approach is verified by application to macroeconomic data where suitable sets of series are commonly available.
{"title":"Dynamic correlation approach to early stopping in artificial neural network training: macroeconomic forecasting example","authors":"Krzysztof Michalak, R. Raciborski","doi":"10.1109/ISDA.2005.41","DOIUrl":"https://doi.org/10.1109/ISDA.2005.41","url":null,"abstract":"Neural networks are widely used in time-series forecasting. One of the issues that arise in neural networks applications is that when a neural network is trained for too long the quality of the predictions tends to deteriorate. To overcome this problem various methods of early stopping are employed. This paper proposes a new approach to early stopping issue in neural network training. In the approach presented the validation series is chosen based on its mean dynamic correlation with forecasted series. The approach is verified by application to macroeconomic data where suitable sets of series are commonly available.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"63 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":"123369287","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}
Bayesian techniques are attractive and viable tools for modeling complex stochastic processes in general and the groundwater contamination process in particular. This is mainly because these techniques do not only emphasize the stochastic nature of this process but also the precision and the accuracy of the tested methods used by environmental laboratories. In this work, we describe the development and application of a prototype dynamic Bayesian network (DBN) that models groundwater quality in order to assess and predict the impact of pollutants on the water column.
{"title":"Modeling groundwater quality with Bayesian techniques","authors":"K. Shihab","doi":"10.1109/ISDA.2005.65","DOIUrl":"https://doi.org/10.1109/ISDA.2005.65","url":null,"abstract":"Bayesian techniques are attractive and viable tools for modeling complex stochastic processes in general and the groundwater contamination process in particular. This is mainly because these techniques do not only emphasize the stochastic nature of this process but also the precision and the accuracy of the tested methods used by environmental laboratories. In this work, we describe the development and application of a prototype dynamic Bayesian network (DBN) that models groundwater quality in order to assess and predict the impact of pollutants on the water column.","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":"122773278","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}
The accurate input-output universe of discourse (UOD) on which membership functions are defined is hard to acquire, especially for nonlinear multi-input and multi-output (MIMO) systems, and control accuracy will reduce greatly in the steady state due to limited fuzzy control rules. This paper presents a design scheme for the adaptive fuzzy logic controllers to control a MIMO system with online changeable input-output UOD of the controller, which could solve two problems mentioned above to a great extent. We obtain fuzzy inference rules that are defined by the error and change of error to describe the variation law of the input-output UOD according to the current trend of the controlled process, so the proper widths of the UOD can be derived from the fuzzy inference rules dynamically in real-time. Simulation results for the nonlinear MIMO system show the effectiveness of the proposed fuzzy logic controller.
{"title":"Adaptive fuzzy logic controller with rule-based changeable universe of discourse for a nonlinear MIMO system","authors":"Yi Wang, Huiwen Deng, Zheng Chen","doi":"10.1109/ISDA.2005.18","DOIUrl":"https://doi.org/10.1109/ISDA.2005.18","url":null,"abstract":"The accurate input-output universe of discourse (UOD) on which membership functions are defined is hard to acquire, especially for nonlinear multi-input and multi-output (MIMO) systems, and control accuracy will reduce greatly in the steady state due to limited fuzzy control rules. This paper presents a design scheme for the adaptive fuzzy logic controllers to control a MIMO system with online changeable input-output UOD of the controller, which could solve two problems mentioned above to a great extent. We obtain fuzzy inference rules that are defined by the error and change of error to describe the variation law of the input-output UOD according to the current trend of the controlled process, so the proper widths of the UOD can be derived from the fuzzy inference rules dynamically in real-time. Simulation results for the nonlinear MIMO system show the effectiveness of the proposed fuzzy logic controller.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"28 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":"131618428","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 concept of active hypercontours as well as a formalized description of contextual classification and relationship between them are presented. The idea of active hypercontours generalizes traditional active contour methods which are extensively developed in image analysis. The proposed concepts can enable an incorporation of techniques specific for traditional contextual and non-contextual classification problems to active contour approach and vice versa.
{"title":"Active hypercontours and contextual classification","authors":"Arkadiusz Tomczyk","doi":"10.1109/ISDA.2005.16","DOIUrl":"https://doi.org/10.1109/ISDA.2005.16","url":null,"abstract":"In the paper a concept of active hypercontours as well as a formalized description of contextual classification and relationship between them are presented. The idea of active hypercontours generalizes traditional active contour methods which are extensively developed in image analysis. The proposed concepts can enable an incorporation of techniques specific for traditional contextual and non-contextual classification problems to active contour approach and vice versa.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"30 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":"129977914","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}
The paper presents an attempt to match signal processing derived features to the higher-level (linguistic) description of timbre in order to support the timbre driven retrieval of violins. The experiments are performed on a set of 53 instruments recorded during the 10/sup th/ Henryk Wieniawski International Violinmakers Competition held in Poznan, Poland, in 2001. The results add to the recent research approach to apply computational intelligence to bridge the semantic and conceptual gap, which exists between the low level description and higher-level interpretation of multimedia. The taxonomy used for violin voices is correlated with objective attributes of entirely distinct character so that semantically disjoint categories are created, providing supportive cues for further analysis. The results should deliver new, enriching aspect to the design of methodology of inferring preference models from the objective characteristics of digital media.
{"title":"Towards timbre-driven semantic retrieval of violins","authors":"E. Lukasik","doi":"10.1109/ISDA.2005.94","DOIUrl":"https://doi.org/10.1109/ISDA.2005.94","url":null,"abstract":"The paper presents an attempt to match signal processing derived features to the higher-level (linguistic) description of timbre in order to support the timbre driven retrieval of violins. The experiments are performed on a set of 53 instruments recorded during the 10/sup th/ Henryk Wieniawski International Violinmakers Competition held in Poznan, Poland, in 2001. The results add to the recent research approach to apply computational intelligence to bridge the semantic and conceptual gap, which exists between the low level description and higher-level interpretation of multimedia. The taxonomy used for violin voices is correlated with objective attributes of entirely distinct character so that semantically disjoint categories are created, providing supportive cues for further analysis. The results should deliver new, enriching aspect to the design of methodology of inferring preference models from the objective characteristics of digital media.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"41 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":"132941775","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
扫码关注我们
求助内容：
应助结果提醒方式：