Po-Chen Chen, K. Yeh, Cheng-Wu Chen, Chen-Yuan Chen
In this study, we strive to combine the advantages of fuzzy theory, genetic algorithms (GA), H-infinite tracking control schemes, smooth control and adaptive laws to design an adaptive fuzzy sliding model controller for the rapid and efficient stabilization of complex and nonlinear systems. First, we utilize a reference model and a fuzzy model (both involvingrules) to describe and well-approximate an uncertain, nonlinear plant. The FLC rules and the consequent parameter are decided on via GA. A boundary-layer function is introduced into these updated laws to cover modeling errors and to guarantee that the state errors converge into a specified error bound. After this, a H-infinite tracking problem is characterized. We solve an eigenvalue problem (EVP), and derive a modified adaptive neural network controller (MANNC) to simultaneously stabilize and control the system and achieve H-infinite control performance.
{"title":"Application to GA-Based Fuzzy Control for Nonlinear Systems with Uncertainty","authors":"Po-Chen Chen, K. Yeh, Cheng-Wu Chen, Chen-Yuan Chen","doi":"10.1109/ACIIDS.2009.86","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.86","url":null,"abstract":"In this study, we strive to combine the advantages of fuzzy theory, genetic algorithms (GA), H-infinite tracking control schemes, smooth control and adaptive laws to design an adaptive fuzzy sliding model controller for the rapid and efficient stabilization of complex and nonlinear systems. First, we utilize a reference model and a fuzzy model (both involvingrules) to describe and well-approximate an uncertain, nonlinear plant. The FLC rules and the consequent parameter are decided on via GA. A boundary-layer function is introduced into these updated laws to cover modeling errors and to guarantee that the state errors converge into a specified error bound. After this, a H-infinite tracking problem is characterized. We solve an eigenvalue problem (EVP), and derive a modified adaptive neural network controller (MANNC) to simultaneously stabilize and control the system and achieve H-infinite control performance.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131040714","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}
Since data mining problems contain a large amount of data, sampling is a necessity for the success of the task. Decision trees have been developed for prediction, and finding decision trees with smaller error rates has been a major task for their success. This paper suggests a structural sampling technique that is based on a generated decision tree, where the tree is generated based on fast and dirty tree generation algorithm. Experiments with several sample sizes and representative decision tree algorithms showed that the method is more effective with respect to decision tree size and error rate than conventional random sampling method especially for small sample size.
{"title":"A Structural Sampling Technique for Better Decision Trees","authors":"H. Sug","doi":"10.1109/ACIIDS.2009.24","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.24","url":null,"abstract":"Since data mining problems contain a large amount of data, sampling is a necessity for the success of the task. Decision trees have been developed for prediction, and finding decision trees with smaller error rates has been a major task for their success. This paper suggests a structural sampling technique that is based on a generated decision tree, where the tree is generated based on fast and dirty tree generation algorithm. Experiments with several sample sizes and representative decision tree algorithms showed that the method is more effective with respect to decision tree size and error rate than conventional random sampling method especially for small sample size.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128115237","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 ubiquitous computing environments like smart home, context awareness is a very important component which aims at providing automatic services. This paper proposes chaining case based reasoning (CCBR) as the reasoning method which solves the vagueness of traditional case based reasoning (CBR) approach "In the certain case with more than one solution, we don’t know which solution or activity will be chosen to satisfy user's needs in smart home’s context". The context's contents in smart home are described in this paper. Also, we introduce the framework of context awareness based on CCBR, and discuss the case representation, case adaptation, and similarity computation in detail. Our proposed CCBR integrated into the virtual smart home environment acquires knowledge about user actions that are recorded to determine their preferences and then simultaneously activates the devices with predefined settings.
{"title":"CCBR: Chaining Case Based Reasoning in Context-Aware Smart Home","authors":"Tam V. Nguyen, Yi Chang Woo, Deokjai Choi","doi":"10.1109/ACIIDS.2009.20","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.20","url":null,"abstract":"In ubiquitous computing environments like smart home, context awareness is a very important component which aims at providing automatic services. This paper proposes chaining case based reasoning (CCBR) as the reasoning method which solves the vagueness of traditional case based reasoning (CBR) approach \"In the certain case with more than one solution, we don’t know which solution or activity will be chosen to satisfy user's needs in smart home’s context\". The context's contents in smart home are described in this paper. Also, we introduce the framework of context awareness based on CCBR, and discuss the case representation, case adaptation, and similarity computation in detail. Our proposed CCBR integrated into the virtual smart home environment acquires knowledge about user actions that are recorded to determine their preferences and then simultaneously activates the devices with predefined settings.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126832656","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}
Policy-based security is an effective and convenient approach to manage information systems. By this approach, we can handle easily all behaviors of a system thought a set of rules. However, conflicts between rules are one of the most common problems we have to deal with in administrative process. In this paper, we propose a new axiomatic approach to solve this problem. Several postulates are presented and analyzed as well as some algorithms are proposed next. The algorithms also have been implemented and tested, and experimental results are presented.
{"title":"Security Policy Integration Method for Information Systems","authors":"T. Tran, N. Nguyen","doi":"10.1109/ACIIDS.2009.14","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.14","url":null,"abstract":"Policy-based security is an effective and convenient approach to manage information systems. By this approach, we can handle easily all behaviors of a system thought a set of rules. However, conflicts between rules are one of the most common problems we have to deal with in administrative process. In this paper, we propose a new axiomatic approach to solve this problem. Several postulates are presented and analyzed as well as some algorithms are proposed next. The algorithms also have been implemented and tested, and experimental results are presented.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129171871","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}
K. Yeh, Cheng-Wu Chen, Shu-Hao Lin, Chen-Yuan Chen
This study presents an H-infinite controller design for time-delay Takagi-Sugeno (T-S) fuzzy systems based on the fuzzy Lyapunov method, which is defined in terms of fuzzy blending quadratic Lyapunov functions. The delay-dependent robust stability criterion is derived in terms of the fuzzy Lyapunov method to guarantee the stability of time-delay T-S fuzzy systems subjected to disturbances. Based on the delay-dependent condition and parallel distributed compensation (PDC) scheme, the controller design problem is transformed into solving linear matrix inequalities (LMI).
{"title":"Stability Analysis of Time-Delay Fuzzy Systems Using Fuzzy Lyapunov Method","authors":"K. Yeh, Cheng-Wu Chen, Shu-Hao Lin, Chen-Yuan Chen","doi":"10.1109/ACIIDS.2009.85","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.85","url":null,"abstract":"This study presents an H-infinite controller design for time-delay Takagi-Sugeno (T-S) fuzzy systems based on the fuzzy Lyapunov method, which is defined in terms of fuzzy blending quadratic Lyapunov functions. The delay-dependent robust stability criterion is derived in terms of the fuzzy Lyapunov method to guarantee the stability of time-delay T-S fuzzy systems subjected to disturbances. Based on the delay-dependent condition and parallel distributed compensation (PDC) scheme, the controller design problem is transformed into solving linear matrix inequalities (LMI).","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117346377","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}
An automated wood species recognition system using computer vision techniques is not widely used today, it is highly needed in various industries, but a wood identification expert is not easily trained to meet the market demand. This paper proposes a rotational invariant method using the grey level co-occurrence matrices (GLCM) as the features, an energy value representing the similarity between the test sample and the template is computed to decide whether the test sample is the same species as the template. A template is accepted when the energy is lower than the threshold value. The species with the highest number of accepted templates will be regarded as the recognition result. The experiment is conducted on six wood species of the CAIRO dataset with a total of 450 training samples and 60 testing samples and achieved a result of 80.00%.
{"title":"Rotational Invariant Wood Species Recognition through Wood Species Verification","authors":"J. Y. Tou, Yong Haur Tay, P. Lau","doi":"10.1109/ACIIDS.2009.10","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.10","url":null,"abstract":"An automated wood species recognition system using computer vision techniques is not widely used today, it is highly needed in various industries, but a wood identification expert is not easily trained to meet the market demand. This paper proposes a rotational invariant method using the grey level co-occurrence matrices (GLCM) as the features, an energy value representing the similarity between the test sample and the template is computed to decide whether the test sample is the same species as the template. A template is accepted when the energy is lower than the threshold value. The species with the highest number of accepted templates will be regarded as the recognition result. The experiment is conducted on six wood species of the CAIRO dataset with a total of 450 training samples and 60 testing samples and achieved a result of 80.00%.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131820287","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 introduce a novel approach to cross-media learning based on argument based machine learning (ABML). ABML is a recent method that combines argumentation and machine learning from examples, and its main idea is to use arguments for some of the learning examples. Arguments are usually provided by a domain expert. In this paper, we present an alternative approach, where arguments used in ABML are automatically extracted from text with a technique for relation extraction. We demonstrate and evaluate the approach through a case study of learning to classify animals by using arguments automatically extracted from Wikipedia.
{"title":"Argument Based Machine Learning from Examples and Text","authors":"M. Mozina, C. Giuliano, I. Bratko","doi":"10.1109/ACIIDS.2009.60","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.60","url":null,"abstract":"We introduce a novel approach to cross-media learning based on argument based machine learning (ABML). ABML is a recent method that combines argumentation and machine learning from examples, and its main idea is to use arguments for some of the learning examples. Arguments are usually provided by a domain expert. In this paper, we present an alternative approach, where arguments used in ABML are automatically extracted from text with a technique for relation extraction. We demonstrate and evaluate the approach through a case study of learning to classify animals by using arguments automatically extracted from Wikipedia.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131600235","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}
Accurate forecasting of electricity load has been one of the most important issues in the electricity industry. Recently, along with power system privatization and deregulation, accurate forecast of electricity load has received increasing attention. According to the chaotic and non-linear characters of power load data, the model of support vector machines (SVM) based on Lyapunov exponents was established. The time series matrix was established according to the theory of phase-space reconstruction, and then Lyapunov exponents was computed to determine time delay and embedding dimension. Then support vector machines algorithm was used to predict power load. In order to prove the rationality of chosen dimension, another two random dimensions were selected to compare with the calculated dimension. And to prove the effectiveness of the model, BP algorithm was used to compare with the result of SVM. The results show that the model is effective and highly accurate in the forecasting of short-term power load. It is denoted that the model combining SVM and chaotic time series learning system has advantage than other models.
{"title":"A New Model to Short-Term Power Load Forecasting Combining Chaotic Time Series and SVM","authors":"D. Niu, Yongli Wang","doi":"10.1109/ACIIDS.2009.22","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.22","url":null,"abstract":"Accurate forecasting of electricity load has been one of the most important issues in the electricity industry. Recently, along with power system privatization and deregulation, accurate forecast of electricity load has received increasing attention. According to the chaotic and non-linear characters of power load data, the model of support vector machines (SVM) based on Lyapunov exponents was established. The time series matrix was established according to the theory of phase-space reconstruction, and then Lyapunov exponents was computed to determine time delay and embedding dimension. Then support vector machines algorithm was used to predict power load. In order to prove the rationality of chosen dimension, another two random dimensions were selected to compare with the calculated dimension. And to prove the effectiveness of the model, BP algorithm was used to compare with the result of SVM. The results show that the model is effective and highly accurate in the forecasting of short-term power load. It is denoted that the model combining SVM and chaotic time series learning system has advantage than other models.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130076716","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}
Feng Zhang, Guang Qiu, Jiajun Bu, Mingcheng Qu, Chun Chen
Online advertising has now turned to be one of the major revenue sources for today's Internet companies. Among the different channels of advertising, contextual advertising takes the great part. There are already lots of studies done for the keyword extraction problem in contextual advertising for English, however, little has been conducted for Chinese, which is mainly different from English linguistically. In this paper, we focus on the problem of Chinese advertising keywords extraction and propose a novel approach based on the idea of classification. We adopt C4.5 as the classifier model and select appropriate features with Chinese linguistic characteristic taken into consideration. The experimental results indicate that our approach is promising.
{"title":"A Novel Approach to Keyword Extraction for Contextual Advertising","authors":"Feng Zhang, Guang Qiu, Jiajun Bu, Mingcheng Qu, Chun Chen","doi":"10.1109/ACIIDS.2009.27","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.27","url":null,"abstract":"Online advertising has now turned to be one of the major revenue sources for today's Internet companies. Among the different channels of advertising, contextual advertising takes the great part. There are already lots of studies done for the keyword extraction problem in contextual advertising for English, however, little has been conducted for Chinese, which is mainly different from English linguistically. In this paper, we focus on the problem of Chinese advertising keywords extraction and propose a novel approach based on the idea of classification. We adopt C4.5 as the classifier model and select appropriate features with Chinese linguistic characteristic taken into consideration. The experimental results indicate that our approach is promising.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132388445","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 number of content-generation devices is expected to increase explosively in the near future thanks to evolution in the field of input/output devices and Consumer Generated Media (CGM) tools. Users will simultaneously wear communicating sensor devices wherever they are, whenever they need them,and whatever they are doing. Under such circumstances, various contents will be generated,updated by the devices and moved much more frequently than they are now. We propose an architecture for a real-time information-delivery system that enables users to quickly discover the freshest, most accurate content. We compared three types of well-known data searching algorithms, i.e., in DNS-like static-tree method, Web crawler method,and Chord method, which can be used in servers in existing systems to retrieve the metadata on the content.We first developed a simulator and evaluated the algorithms to assess the methods to find which generation, update, and movement of content occurred more frequently. We discovered that the Web crawler method and Chord method both offered roughly the same correct answer rate. However, the number of messages increased dramatically with the Web crawler method when the content-update interval shortened.The average search time also increased with the Chord method as the number of user nodes increased.
{"title":"Comparison of Data-Searching Algorithms for a Real-Time Information-Delivery System","authors":"Takayuki Shizuno, T. Kitamura, T. Okabe, H. Tani","doi":"10.1109/ACIIDS.2009.54","DOIUrl":"https://doi.org/10.1109/ACIIDS.2009.54","url":null,"abstract":"The number of content-generation devices is expected to increase explosively in the near future thanks to evolution in the field of input/output devices and Consumer Generated Media (CGM) tools. Users will simultaneously wear communicating sensor devices wherever they are, whenever they need them,and whatever they are doing. Under such circumstances, various contents will be generated,updated by the devices and moved much more frequently than they are now. We propose an architecture for a real-time information-delivery system that enables users to quickly discover the freshest, most accurate content. We compared three types of well-known data searching algorithms, i.e., in DNS-like static-tree method, Web crawler method,and Chord method, which can be used in servers in existing systems to retrieve the metadata on the content.We first developed a simulator and evaluated the algorithms to assess the methods to find which generation, update, and movement of content occurred more frequently. We discovered that the Web crawler method and Chord method both offered roughly the same correct answer rate. However, the number of messages increased dramatically with the Web crawler method when the content-update interval shortened.The average search time also increased with the Chord method as the number of user nodes increased.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"52 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114133154","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
扫码关注我们
求助内容：
应助结果提醒方式：