This paper proposes a Thai vehicle license plate recognition system, called the hierarchical cross-correlation ARTMAP. An ability to separately train each segment of the network gives the hierarchical cross-correlation ARTMAP an advantage over the other approaches. The experimental results show that the hierarchical cross-correlation ARTMAP outperforms the other approaches by a wide margin
{"title":"Thai Vehicle License Plate Recognition Using the Hierarchical Cross-correlation ARTMAP","authors":"P. Duangphasuk, A. Thammano","doi":"10.1109/IS.2006.348496","DOIUrl":"https://doi.org/10.1109/IS.2006.348496","url":null,"abstract":"This paper proposes a Thai vehicle license plate recognition system, called the hierarchical cross-correlation ARTMAP. An ability to separately train each segment of the network gives the hierarchical cross-correlation ARTMAP an advantage over the other approaches. The experimental results show that the hierarchical cross-correlation ARTMAP outperforms the other approaches by a wide margin","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132586126","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 agent-based simulation discussed in this paper, we study the dynamics of the power market, when suppliers act following a Q-learning based bidding strategy. Power suppliers aim to satisfy two objectives: the maximization of their profit and their utilization rate. To meet with success their goals, they need to acquire a complex behavior by learning through a continuous exploiting and exploring process. Reinforcement learning theory provides a formal framework, along with a family of learning methods. In this paper we use Q-learning algorithm, perhaps the most popular among temporal difference methods. Q-learning offers suppliers the ability to evaluate their actions and to retain the most profitable of them. A five bus power system is used for our case studies; our experiments are contacted with three supplier-agents in all cases but the last one where sine agents participate. The locational marginal pricing (LMP) system serves as the market clearing mechanism
{"title":"Multi-Agent Reinforcement Learning for Strategic Bidding in Power Markets","authors":"A. C. Tellidou, A. Bakirtzis, Senior Member","doi":"10.1109/IS.2006.348454","DOIUrl":"https://doi.org/10.1109/IS.2006.348454","url":null,"abstract":"In the agent-based simulation discussed in this paper, we study the dynamics of the power market, when suppliers act following a Q-learning based bidding strategy. Power suppliers aim to satisfy two objectives: the maximization of their profit and their utilization rate. To meet with success their goals, they need to acquire a complex behavior by learning through a continuous exploiting and exploring process. Reinforcement learning theory provides a formal framework, along with a family of learning methods. In this paper we use Q-learning algorithm, perhaps the most popular among temporal difference methods. Q-learning offers suppliers the ability to evaluate their actions and to retain the most profitable of them. A five bus power system is used for our case studies; our experiments are contacted with three supplier-agents in all cases but the last one where sine agents participate. The locational marginal pricing (LMP) system serves as the market clearing mechanism","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116259898","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 this paper intelligent agents and DSP techniques are integrated to detect single and multiple faults in electrical circuits. Agents are used to model the AC electrical circuit. A DSP engine is embedded into the agents to analyse the signals, i.e. the energy transfer between the physical components. An AC to DC rectifier circuit is chosen as test-bed for the proposed solutions
{"title":"Detecting Single and Multiple Faults Using Intelligent DSP and Agents","authors":"O. Zaki, K. Brown, J. Fletcher, D. Lane","doi":"10.1109/IS.2006.348388","DOIUrl":"https://doi.org/10.1109/IS.2006.348388","url":null,"abstract":"In this paper intelligent agents and DSP techniques are integrated to detect single and multiple faults in electrical circuits. Agents are used to model the AC electrical circuit. A DSP engine is embedded into the agents to analyse the signals, i.e. the energy transfer between the physical components. An AC to DC rectifier circuit is chosen as test-bed for the proposed solutions","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116101246","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. Tsoulos, G. Georgoulas, D. Gavrilis, C. Stylios, J. Bernardes, P. Groumpos
Electronic fetal monitoring is an essential tool for fetal surveillance during labor. It is mainly based on the monitoring and evaluation of the fetal heart rate (FHR) signal, which has to be interpreted online. Evaluation and interpretation of FHR gives an indication of the fetal condition. A lot of research efforts have been done towards the development of automatic and reliable methods for processing and evaluating FHR. This research work introduces an integrated methodology for processing and classifying FHR based on the novel approach of grammatical evolution for feature construction and selection. The proposed methodology is presented, and it is applied to a data set. Experimental results are promising paving the way for further research in that direction
{"title":"Introducing Grammatical Evolution in Fetal Heart Rate Analysis and Classification","authors":"I. Tsoulos, G. Georgoulas, D. Gavrilis, C. Stylios, J. Bernardes, P. Groumpos","doi":"10.1109/IS.2006.348480","DOIUrl":"https://doi.org/10.1109/IS.2006.348480","url":null,"abstract":"Electronic fetal monitoring is an essential tool for fetal surveillance during labor. It is mainly based on the monitoring and evaluation of the fetal heart rate (FHR) signal, which has to be interpreted online. Evaluation and interpretation of FHR gives an indication of the fetal condition. A lot of research efforts have been done towards the development of automatic and reliable methods for processing and evaluating FHR. This research work introduces an integrated methodology for processing and classifying FHR based on the novel approach of grammatical evolution for feature construction and selection. The proposed methodology is presented, and it is applied to a data set. Experimental results are promising paving the way for further research in that direction","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115431204","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 this paper we present PACE - a probabilistic ant based clustering algorithm for distributed databases. This algorithm is based on the well-known swarm based approach to clustering. Its characteristic feature is the formation of numerous zones in various distributed sites based on the user query to the distributed database. Keywords, extracted out of the query, are used to assign a range of values according to their corresponding probability of occurrence or hit ratio at each site. An ant odor identification model is used as a preceding step to the colony building and formation of clusters inside the zones. Reordering or sorting of the heap trees formed by the ants to enable agglomeration of only the most probable data forms the crux of this algorithm. Experimental results are reported showing the comparison of PACE with other existing clustering algorithms
{"title":"Probabilistic Ant based Clustering for Distributed Databases","authors":"R. Chandrasekar, V. Vijaykumar, T. Srinivasan","doi":"10.1109/IS.2006.348477","DOIUrl":"https://doi.org/10.1109/IS.2006.348477","url":null,"abstract":"In this paper we present PACE - a probabilistic ant based clustering algorithm for distributed databases. This algorithm is based on the well-known swarm based approach to clustering. Its characteristic feature is the formation of numerous zones in various distributed sites based on the user query to the distributed database. Keywords, extracted out of the query, are used to assign a range of values according to their corresponding probability of occurrence or hit ratio at each site. An ant odor identification model is used as a preceding step to the colony building and formation of clusters inside the zones. Reordering or sorting of the heap trees formed by the ants to enable agglomeration of only the most probable data forms the crux of this algorithm. Experimental results are reported showing the comparison of PACE with other existing clustering algorithms","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121321048","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}
Pub Date : 2006-09-01DOI: 10.1007/978-3-540-77623-9_4
P. Bosc, N. I. Hssaien, O. Pivert
{"title":"On the evaluation of cardinality-based generalized yes/no queries","authors":"P. Bosc, N. I. Hssaien, O. Pivert","doi":"10.1007/978-3-540-77623-9_4","DOIUrl":"https://doi.org/10.1007/978-3-540-77623-9_4","url":null,"abstract":"","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121586380","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 low error rate of naive Bayes (NB) classifier has been described as surprising. It is known that class conditional independence of the features is sufficient but not a necessary condition for optimality of NB. This study is about the difference between the estimated error and the true error of NB taking into account feature dependencies. Analytical results are derived for two binary features. Illustration examples are also provided
{"title":"Naive Bayes classifier: True and estimated errors for 2-class, 2-features case","authors":"Z. Hoare","doi":"10.1109/IS.2006.348481","DOIUrl":"https://doi.org/10.1109/IS.2006.348481","url":null,"abstract":"The low error rate of naive Bayes (NB) classifier has been described as surprising. It is known that class conditional independence of the features is sufficient but not a necessary condition for optimality of NB. This study is about the difference between the estimated error and the true error of NB taking into account feature dependencies. Analytical results are derived for two binary features. Illustration examples are also provided","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121595407","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}
Alexander V. Lyaletski, A. Paskevich, K. Verchinine
Formal methods are widely used in the computer science community. Formal verification and certification is an important component of any formal approach. Such a work can not be done by hand, hence the software that can do a part of it is rather required. The verification methods are often based on a deductive system and "verify" means "prove". Corresponding software is called proof assistant. We describe in this paper the System for Automated Deduction (SAD): its architecture, input language, and reasoning facilities. We show how to use SAD as a proof assistant. We outline specific features of SAD - a handy input language, powerful reasoning strategy, opportunity to use various low level inference engines. Examples and results of some experiments are also given
{"title":"The SAD System: Deductive Assistance in an Intelligent Linguistic Environment","authors":"Alexander V. Lyaletski, A. Paskevich, K. Verchinine","doi":"10.1109/IS.2006.348446","DOIUrl":"https://doi.org/10.1109/IS.2006.348446","url":null,"abstract":"Formal methods are widely used in the computer science community. Formal verification and certification is an important component of any formal approach. Such a work can not be done by hand, hence the software that can do a part of it is rather required. The verification methods are often based on a deductive system and \"verify\" means \"prove\". Corresponding software is called proof assistant. We describe in this paper the System for Automated Deduction (SAD): its architecture, input language, and reasoning facilities. We show how to use SAD as a proof assistant. We outline specific features of SAD - a handy input language, powerful reasoning strategy, opportunity to use various low level inference engines. Examples and results of some experiments are also given","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128115528","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}
There is a growing necessity to embed a simulator within a decision support system. For a complex system, there is usually the need both to utilize a commercial package to perform the simulations and to read data from an in-house database. The DSS is programmed in different software packages which interact via the user-friendly, readily available MSExcel. A situation in which a company is faced with a sequencing problem is presented
{"title":"Integrating Simulation into Decision Support Systems","authors":"Javier Otamendi","doi":"10.1109/IS.2006.348525","DOIUrl":"https://doi.org/10.1109/IS.2006.348525","url":null,"abstract":"There is a growing necessity to embed a simulator within a decision support system. For a complex system, there is usually the need both to utilize a commercial package to perform the simulations and to read data from an in-house database. The DSS is programmed in different software packages which interact via the user-friendly, readily available MSExcel. A situation in which a company is faced with a sequencing problem is presented","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128316083","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}
Differently from pure probability theory the common uncertain information is perception-based and imprecise (L.A. Zadeh, 2002). Human belief, confidence level, etc., are approximate human perceptions and the intelligent systems need a general approximate reasoning logic for them. We propose a family of intuitionistic bilattices with full truth-knowledge duality to be used in logic programming for such uncertain information. The simplest of them, based on intuitionistic truth-functually complete extension of Belnap's 4-valued bilattice, can be used in paraconsistent programming, that is, for knowledge bases with incomplete and inconsistent information. The other two families are useful for an approximate logic theory where the uncertainty in the knowledge about a piece of information is in the form of human granulation cognition types: as an interval-probability belief or as a confidence level. Such logic programs can be parameterized by different kinds of probabilistic conjunctive/disjunctive strategies for their rules, based on intuitionistic implication, which express the user perception-based correlation between observed knowledge facts
{"title":"Intuitionistic Truth-Knowledge Symmetric Bilattices for Uncertainty in Intel1igent systems","authors":"Z. Majkic","doi":"10.1109/IS.2006.348505","DOIUrl":"https://doi.org/10.1109/IS.2006.348505","url":null,"abstract":"Differently from pure probability theory the common uncertain information is perception-based and imprecise (L.A. Zadeh, 2002). Human belief, confidence level, etc., are approximate human perceptions and the intelligent systems need a general approximate reasoning logic for them. We propose a family of intuitionistic bilattices with full truth-knowledge duality to be used in logic programming for such uncertain information. The simplest of them, based on intuitionistic truth-functually complete extension of Belnap's 4-valued bilattice, can be used in paraconsistent programming, that is, for knowledge bases with incomplete and inconsistent information. The other two families are useful for an approximate logic theory where the uncertainty in the knowledge about a piece of information is in the form of human granulation cognition types: as an interval-probability belief or as a confidence level. Such logic programs can be parameterized by different kinds of probabilistic conjunctive/disjunctive strategies for their rules, based on intuitionistic implication, which express the user perception-based correlation between observed knowledge facts","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131139774","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
扫码关注我们
求助内容：
应助结果提醒方式：