In the paper, the method of combining character classifiers for handprinted text recognition is presented. The combination rule is based on member classifiers reliability assessment. The assessment can be based on probabilistic classifier properties or it can use similarity measures individually evaluated for the character currently being recognized. The approach presented here follows soft classification paradigm, where the classifier not merely selects single class, but it provides the vector of support values corresponding to character likelihood. The proposed methods have been tested and compared in recognizing letters from polish alphabet, including nine difficult do recognize diacritic characters.
{"title":"Combining character classifiers using member classifiers assessment","authors":"J. Sas, Michal Luzyna","doi":"10.1109/ISDA.2005.34","DOIUrl":"https://doi.org/10.1109/ISDA.2005.34","url":null,"abstract":"In the paper, the method of combining character classifiers for handprinted text recognition is presented. The combination rule is based on member classifiers reliability assessment. The assessment can be based on probabilistic classifier properties or it can use similarity measures individually evaluated for the character currently being recognized. The approach presented here follows soft classification paradigm, where the classifier not merely selects single class, but it provides the vector of support values corresponding to character likelihood. The proposed methods have been tested and compared in recognizing letters from polish alphabet, including nine difficult do recognize diacritic characters.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"54 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":"124621265","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}
Considering the population size is a critical parameter to define in evolutionary computation, in this paper an improved parallel evolutionary algorithm that incorporates different mechanisms to adapt the population size to the current status, is presented. Those mechanisms are based on resizing on fitness improvement GA (PRoFIGA) and variable population size (GAVaPS). Results indicate these incorporations are a reasonable choice when refinement in solutions is necessary.
{"title":"Variable size population in parallel evolutionary algorithms","authors":"Gabriela F. Minetti, Hugo Alfonso","doi":"10.1109/ISDA.2005.99","DOIUrl":"https://doi.org/10.1109/ISDA.2005.99","url":null,"abstract":"Considering the population size is a critical parameter to define in evolutionary computation, in this paper an improved parallel evolutionary algorithm that incorporates different mechanisms to adapt the population size to the current status, is presented. Those mechanisms are based on resizing on fitness improvement GA (PRoFIGA) and variable population size (GAVaPS). Results indicate these incorporations are a reasonable choice when refinement in solutions is necessary.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"108 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":"124019553","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 grammar-based classifier system (GCS) is a new version of learning classifier systems (LCS) in which classifiers are represented by context-free grammar in Chomsky normal form. GCS evolves one grammar during induction (the Michigan approach) which gives it the ability to find the proper set of rules very quickly. However it is quite sensitive to any variations of learning parameters. This paper investigates the role of crowding selection in GCS. To evaluate the performance of GCS depending on crowding factor and crowding subpopulation we used context-free language in the form of so-called toy language. The set of experiments was performed to obtain the answer for question in the title.
{"title":"How to use crowding selection in grammar-based classifier system","authors":"O. Unold, L. Cielecki","doi":"10.1109/ISDA.2005.50","DOIUrl":"https://doi.org/10.1109/ISDA.2005.50","url":null,"abstract":"The grammar-based classifier system (GCS) is a new version of learning classifier systems (LCS) in which classifiers are represented by context-free grammar in Chomsky normal form. GCS evolves one grammar during induction (the Michigan approach) which gives it the ability to find the proper set of rules very quickly. However it is quite sensitive to any variations of learning parameters. This paper investigates the role of crowding selection in GCS. To evaluate the performance of GCS depending on crowding factor and crowding subpopulation we used context-free language in the form of so-called toy language. The set of experiments was performed to obtain the answer for question in the title.","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":"125096502","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}
Association rules are often utilized in Web recommendation systems for creation of suggested items lists. However, lists obtained in this way may be too short. Indirect association rules are introduced to extend classical, direct association rules and supplement the knowledge they contribute. The relation between ranking lists created on the basis of association rules and hyperlinks existing on Web pages has also been examined in the paper.
{"title":"The influence of indirect association rules on recommendation ranking lists","authors":"Przemyslaw Kazienko, K. Kuzminska","doi":"10.1109/ISDA.2005.90","DOIUrl":"https://doi.org/10.1109/ISDA.2005.90","url":null,"abstract":"Association rules are often utilized in Web recommendation systems for creation of suggested items lists. However, lists obtained in this way may be too short. Indirect association rules are introduced to extend classical, direct association rules and supplement the knowledge they contribute. The relation between ranking lists created on the basis of association rules and hyperlinks existing on Web pages has also been examined in the paper.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"27 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":"122364798","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}
This paper deals with the problem of thermovision application for biometric people recognition. The main goal of research was the automatization of recognition process and proving, whether the infrared imaging can be exploited for realization of the biometric system. First, the data base composed of 270 images made in different conditions, was built. Next, the multilayer perception and two optical correlators such as joint transform correlator and 4f correlator, were applied. Each system was designed for realizing two various tasks: verification and identification. Finally, the systems were tested and evaluated according to the Face Recognition Vendor Tests (FRVT). Achieved results proved that temperature distribution on the human face is a biometric trait and people can be efficiently recognized with usage of infrared imagery.
{"title":"Neural network and optical correlators for infrared imaging based face recognition","authors":"J. Bauer, J. Mazurkiewicz","doi":"10.1109/ISDA.2005.70","DOIUrl":"https://doi.org/10.1109/ISDA.2005.70","url":null,"abstract":"This paper deals with the problem of thermovision application for biometric people recognition. The main goal of research was the automatization of recognition process and proving, whether the infrared imaging can be exploited for realization of the biometric system. First, the data base composed of 270 images made in different conditions, was built. Next, the multilayer perception and two optical correlators such as joint transform correlator and 4f correlator, were applied. Each system was designed for realizing two various tasks: verification and identification. Finally, the systems were tested and evaluated according to the Face Recognition Vendor Tests (FRVT). Achieved results proved that temperature distribution on the human face is a biometric trait and people can be efficiently recognized with usage of infrared imagery.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"8 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":"127708843","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 iterated prisoner's dilemma is used to illustrate and model the phenomena in economics, sociology, psychology, as well as in the biological sciences such as evolutionary biology. The discovery and optimization of IPD strategies in real-world applications requires flexible strategy representation. The comparison of deterministic and non-deterministic finite state machines as the representations of strategies for the iterated prisoner's dilemma is presented. A novel chromosome representation scheme for non-deterministic Mealy finite state machines is proposed. The research on efficiency of the strategies evolved using genetic algorithms was made. Best results in competition with unknown strategies were obtained by non-deterministic strategies.
{"title":"Discovering effective strategies for the iterated prisoner's dilemma using genetic algorithms","authors":"M. Glomba, Tomasz Filak, H. Kwasnicka","doi":"10.1109/ISDA.2005.38","DOIUrl":"https://doi.org/10.1109/ISDA.2005.38","url":null,"abstract":"The iterated prisoner's dilemma is used to illustrate and model the phenomena in economics, sociology, psychology, as well as in the biological sciences such as evolutionary biology. The discovery and optimization of IPD strategies in real-world applications requires flexible strategy representation. The comparison of deterministic and non-deterministic finite state machines as the representations of strategies for the iterated prisoner's dilemma is presented. A novel chromosome representation scheme for non-deterministic Mealy finite state machines is proposed. The research on efficiency of the strategies evolved using genetic algorithms was made. Best results in competition with unknown strategies were obtained by non-deterministic strategies.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"19 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":"121396118","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}
This paper presents hidden Markov models (HMM) approach for forecasting stock price for interrelated markets. We apply HMM to forecast some of the airlines stock. HMMs have been extensively used for pattern recognition and classification problems because of its proven suitability for modelling dynamic systems. However, using HMM for predicting future events is not straightforward. Here we use only one HMM that is trained on the past dataset of the chosen airlines. The trained HMM is used to search for the variable of interest behavioural data pattern from the past dataset. By interpolating the neighbouring values of these datasets forecasts are prepared. The results obtained using HMM are encouraging and HMM offers a new paradigm for stock market forecasting, an area that has been of much research interest lately.
{"title":"Stock market forecasting using hidden Markov model: a new approach","authors":"Md. Rafiul Hassan, B. Nath","doi":"10.1109/ISDA.2005.85","DOIUrl":"https://doi.org/10.1109/ISDA.2005.85","url":null,"abstract":"This paper presents hidden Markov models (HMM) approach for forecasting stock price for interrelated markets. We apply HMM to forecast some of the airlines stock. HMMs have been extensively used for pattern recognition and classification problems because of its proven suitability for modelling dynamic systems. However, using HMM for predicting future events is not straightforward. Here we use only one HMM that is trained on the past dataset of the chosen airlines. The trained HMM is used to search for the variable of interest behavioural data pattern from the past dataset. By interpolating the neighbouring values of these datasets forecasts are prepared. The results obtained using HMM are encouraging and HMM offers a new paradigm for stock market forecasting, an area that has been of much research interest lately.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"36 10 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":"131841027","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}
This paper proposes a novel adaptive representation for evolutionary multiobjective optimization for solving a stock modeling problem. The standard Pareto achieved evolution strategy (PAES) uses real or binary representation for encoding solutions. Adaptive Pareto archived evolution strategy (APAES) uses dynamic alphabets for encoding solutions. APAES is applied for modeling two popular stock indices involving 4 objective functions. Further, two bench mark test functions for multiobjective optimization are also used to illustrate the performance of the algorithm. Empirical results demonstrate APAES performs well when compared to the standard PAES,.
{"title":"Multiobjective optimization using adaptive Pareto archived evolution strategy","authors":"Mihai Oltean, C. Grosan, A. Abraham, M. Köppen","doi":"10.1109/ISDA.2005.69","DOIUrl":"https://doi.org/10.1109/ISDA.2005.69","url":null,"abstract":"This paper proposes a novel adaptive representation for evolutionary multiobjective optimization for solving a stock modeling problem. The standard Pareto achieved evolution strategy (PAES) uses real or binary representation for encoding solutions. Adaptive Pareto archived evolution strategy (APAES) uses dynamic alphabets for encoding solutions. APAES is applied for modeling two popular stock indices involving 4 objective functions. Further, two bench mark test functions for multiobjective optimization are also used to illustrate the performance of the algorithm. Empirical results demonstrate APAES performs well when compared to the standard PAES,.","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":"130670283","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}
M. Gawinecki, Z. Vetulani, M. Gordon, M. Paprzycki
We consider the construction and management of user profiles for an agent-based travel support system, with the goal of providing personalized content for individual users of the system. Profiles consist of statements about the "world of travel." Conditional probabilities for each statement model the strengths of user preferences. These probabilities are derived from implicit and explicit observations of user behavior.
{"title":"Representing users in a travel support system","authors":"M. Gawinecki, Z. Vetulani, M. Gordon, M. Paprzycki","doi":"10.1109/ISDA.2005.80","DOIUrl":"https://doi.org/10.1109/ISDA.2005.80","url":null,"abstract":"We consider the construction and management of user profiles for an agent-based travel support system, with the goal of providing personalized content for individual users of the system. Profiles consist of statements about the \"world of travel.\" Conditional probabilities for each statement model the strengths of user preferences. These probabilities are derived from implicit and explicit observations of user behavior.","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":"130855864","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}
D. Neagu, M. Craciun, Silviu A. Stroia, S. Bumbaru
The main objective of this paper is to propose a homogeneous approach to represent and process in silico models for predictive toxicology and also to improve the computational representation of developed models by harmonizing new trends in predictive data mining. We propose to combine local and global models as ensemble experts by mixing technologies in hybrid systems in order to improve the prediction accuracy, and also to provide reasonable training response time by using parallel processing. More investigations have still to be done to develop an optimized strategy, but our approach demonstrates encouraging results.
{"title":"Hybrid intelligent systems for predictive toxicology - a distributed approach","authors":"D. Neagu, M. Craciun, Silviu A. Stroia, S. Bumbaru","doi":"10.1109/ISDA.2005.52","DOIUrl":"https://doi.org/10.1109/ISDA.2005.52","url":null,"abstract":"The main objective of this paper is to propose a homogeneous approach to represent and process in silico models for predictive toxicology and also to improve the computational representation of developed models by harmonizing new trends in predictive data mining. We propose to combine local and global models as ensemble experts by mixing technologies in hybrid systems in order to improve the prediction accuracy, and also to provide reasonable training response time by using parallel processing. More investigations have still to be done to develop an optimized strategy, but our approach demonstrates encouraging results.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"10 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":"116918557","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
扫码关注我们
求助内容：
应助结果提醒方式：