Pub Date : 2006-06-07DOI: 10.1109/ICCIS.2006.252282
P. Lenca, B. Vaillant, S. Lallich
Association rules discovery is one of the most important tasks in knowledge discovery in data bases. The rules produced with a priori-like algorithms are then usually used for decision aiding in expert and knowledge based systems and/or by a human end user. Unfortunately such algorithms may produce huge amounts of rules and thus one of the most important steps in association rules discovery nowadays is the evaluation and the interpretation of their interestingness. Objective measures provide numerical information on the quality of a rule and a rule is said "of quality" if its evaluation by a measure is greater than a user defined threshold. In this paper we propose a new specificity of association rule objective interestingness measures: the threshold sensitivity. By dealing with this problem we intend to provide means of measuring the strength/robustness of the interest of a rule. We propose a general framework allowing us to determine the number of examples that a rule can lose while remaining acceptable, for a panel of classical measures that are transformation of the confidence
{"title":"On the robustness of association rules","authors":"P. Lenca, B. Vaillant, S. Lallich","doi":"10.1109/ICCIS.2006.252282","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252282","url":null,"abstract":"Association rules discovery is one of the most important tasks in knowledge discovery in data bases. The rules produced with a priori-like algorithms are then usually used for decision aiding in expert and knowledge based systems and/or by a human end user. Unfortunately such algorithms may produce huge amounts of rules and thus one of the most important steps in association rules discovery nowadays is the evaluation and the interpretation of their interestingness. Objective measures provide numerical information on the quality of a rule and a rule is said \"of quality\" if its evaluation by a measure is greater than a user defined threshold. In this paper we propose a new specificity of association rule objective interestingness measures: the threshold sensitivity. By dealing with this problem we intend to provide means of measuring the strength/robustness of the interest of a rule. We propose a general framework allowing us to determine the number of examples that a rule can lose while remaining acceptable, for a panel of classical measures that are transformation of the confidence","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125321694","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-06-07DOI: 10.1109/ICCIS.2006.252287
Z. A. Bakar, R. Mohemad, A. Ahmad, M. M. Deris
Existing studies in data mining mostly focus on finding patterns in large datasets and further using it for organizational decision making. However, finding such exceptions and outliers has not yet received as much attention in the data mining field as some other topics have, such as association rules, classification and clustering. Thus, this paper describes the performance of control chart, linear regression, and Manhattan distance techniques for outlier detection in data mining. Experimental studies show that outlier detection technique using control chart is better than the technique modeled from linear regression because the number of outlier data detected by control chart is smaller than linear regression. Further, experimental studies shows that Manhattan distance technique outperformed compared with the other techniques when the threshold values increased
{"title":"A Comparative Study for Outlier Detection Techniques in Data Mining","authors":"Z. A. Bakar, R. Mohemad, A. Ahmad, M. M. Deris","doi":"10.1109/ICCIS.2006.252287","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252287","url":null,"abstract":"Existing studies in data mining mostly focus on finding patterns in large datasets and further using it for organizational decision making. However, finding such exceptions and outliers has not yet received as much attention in the data mining field as some other topics have, such as association rules, classification and clustering. Thus, this paper describes the performance of control chart, linear regression, and Manhattan distance techniques for outlier detection in data mining. Experimental studies show that outlier detection technique using control chart is better than the technique modeled from linear regression because the number of outlier data detected by control chart is smaller than linear regression. Further, experimental studies shows that Manhattan distance technique outperformed compared with the other techniques when the threshold values increased","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127504035","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-06-07DOI: 10.1109/ICCIS.2006.252277
Y. Sun, Y. Lee, J. Sun, J. Liu
The framework of three dimensional (3D) reconstruction of opaque model is discussed. The issues in regularity extraction and application in the reconstruction are analyzed to reveal the problems existing in the reconstruction process. A 3D reconstruction system needs to handle both useful information and noises. To obtain an efficient and effective reconstruction, a model based reconstruction strategy is proposed to seek for a suitable reconstruction system. Support vector machine (SVM) based methods are suggested for further investigation
{"title":"Discussions of Sketch-based Transparent Model Reconstruction","authors":"Y. Sun, Y. Lee, J. Sun, J. Liu","doi":"10.1109/ICCIS.2006.252277","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252277","url":null,"abstract":"The framework of three dimensional (3D) reconstruction of opaque model is discussed. The issues in regularity extraction and application in the reconstruction are analyzed to reveal the problems existing in the reconstruction process. A 3D reconstruction system needs to handle both useful information and noises. To obtain an efficient and effective reconstruction, a model based reconstruction strategy is proposed to seek for a suitable reconstruction system. Support vector machine (SVM) based methods are suggested for further investigation","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127730662","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-06-07DOI: 10.1109/ICCIS.2006.252273
Badong Chen, Jinchun Hu, Hongbo Li, Zeng-qi Sun
Recent research suggested that the error entropy (EE) criteria could be used to achieve a better error distribution in estimation, adaptation and learning. In this paper, we formulated the adaptive inverse control under a generalized error entropy criterion, i.e. (h, ø)-entropy criterion, and derived the associated error-entropy minimization algorithm. Several detailed schemes of adaptive filtering and inverse control under (h, ø)-entropy criterion were also presented. Finally, a simple simulation example has illustrated the effectiveness and advantages of this new method.
{"title":"Adaptive Inverse Control under (h,ø)-Entropy Criterion","authors":"Badong Chen, Jinchun Hu, Hongbo Li, Zeng-qi Sun","doi":"10.1109/ICCIS.2006.252273","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252273","url":null,"abstract":"Recent research suggested that the error entropy (EE) criteria could be used to achieve a better error distribution in estimation, adaptation and learning. In this paper, we formulated the adaptive inverse control under a generalized error entropy criterion, i.e. (h, ø)-entropy criterion, and derived the associated error-entropy minimization algorithm. Several detailed schemes of adaptive filtering and inverse control under (h, ø)-entropy criterion were also presented. Finally, a simple simulation example has illustrated the effectiveness and advantages of this new method.","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122531840","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-06-07DOI: 10.1109/ICCIS.2006.252226
K. Junaid, K. Usman, K. AttaUllah, J. A. Raza
Due to varying dynamics of sea-going vessels with changes in gross tonnage, speed of the vessel and depth of water, the key factor limiting the performance of current autopilot systems using PID/PD controllers, is the wide range of vessels' dynamical behavior. Previous research proposes adaptive controllers to overcome these difficulties, but such systems can also suffer from disadvantages such as potential instabilities. This paper investigates the application of artificial neural networks to automatic yaw control of mine sweepers at various speeds, where the practical issues like speed of response relevant to this particular class of ship are carefully considered. The proposed networks are trained offline to capture the controllers' dynamics and use it in the control loop thus incorporating the properties of a series of conventional PD controllers designed at different forward speeds and hence improves the vessel's automatic steering performance under a variety of operational conditions
{"title":"A Neural Network Based Adaptive Autopilot for Marine Applications","authors":"K. Junaid, K. Usman, K. AttaUllah, J. A. Raza","doi":"10.1109/ICCIS.2006.252226","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252226","url":null,"abstract":"Due to varying dynamics of sea-going vessels with changes in gross tonnage, speed of the vessel and depth of water, the key factor limiting the performance of current autopilot systems using PID/PD controllers, is the wide range of vessels' dynamical behavior. Previous research proposes adaptive controllers to overcome these difficulties, but such systems can also suffer from disadvantages such as potential instabilities. This paper investigates the application of artificial neural networks to automatic yaw control of mine sweepers at various speeds, where the practical issues like speed of response relevant to this particular class of ship are carefully considered. The proposed networks are trained offline to capture the controllers' dynamics and use it in the control loop thus incorporating the properties of a series of conventional PD controllers designed at different forward speeds and hence improves the vessel's automatic steering performance under a variety of operational conditions","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126275760","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-06-07DOI: 10.1109/ICCIS.2006.252265
D. Yamaguchi, GuoDong Li, K. Mizutani, T. Akabane, M. Nagai, M. Kitaoka
Grey structural modeling (GSM in short) is a new approach of system modeling methods succeeding to ISM and FSM. GSM has two procedures: estimating a hierarchy of given elements, estimating paths among given elements. The former procedure is constructed from complex equations. In this paper we developed one realization algorithm of the GSM procedure. The main problem we should solve is how to group given elements into several classes and to decide their hierarchy. We are possible to group analyzing an error matrix which is obtained from the localized grey relational grade, and we are also possible to decide their hierarchy according to the localized grey relational grade. We used the topological-based grey relational analysis. These procedures are shown as a pseudo language with several figures, and are realized by MATLAB. Several examples applied with the developed program are shown in this paper
{"title":"A Realization Algorithm of Grey Structural Modeling with MATLAB","authors":"D. Yamaguchi, GuoDong Li, K. Mizutani, T. Akabane, M. Nagai, M. Kitaoka","doi":"10.1109/ICCIS.2006.252265","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252265","url":null,"abstract":"Grey structural modeling (GSM in short) is a new approach of system modeling methods succeeding to ISM and FSM. GSM has two procedures: estimating a hierarchy of given elements, estimating paths among given elements. The former procedure is constructed from complex equations. In this paper we developed one realization algorithm of the GSM procedure. The main problem we should solve is how to group given elements into several classes and to decide their hierarchy. We are possible to group analyzing an error matrix which is obtained from the localized grey relational grade, and we are also possible to decide their hierarchy according to the localized grey relational grade. We used the topological-based grey relational analysis. These procedures are shown as a pseudo language with several figures, and are realized by MATLAB. Several examples applied with the developed program are shown in this paper","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126477882","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-06-07DOI: 10.1109/ICCIS.2006.252345
B. Ramadoss, S. Balasundaram
Metaphors are widely seen in the user interfaces of today's Web based applications. Some of the major features of metaphors are their ability to organize information related to any concept and to provide better understanding of the information. The traditional teaching and learning activities of educational systems have enjoyed the benefits of metaphors in several ways. This includes representing metaphors in various forms such as text, graphics, animated images etc. One of the challenges for Web based learning (WBL) courseware developer is to design the appropriate metaphors relevant to the context of information presented in the courseware. This paper focuses on the method of selecting one or more metaphors constructed already by the courseware developers that will help in understanding as well as learning the characteristics needed for the WBL courseware development. The selected metaphors can be considered as guideline objects, from which the desirable characteristics can be applied or recommended for the new metaphors to be defined. To decide upon the candidate metaphors, the repertory grid analysis is proposed
{"title":"Management and Selection of Visual Metaphors for Courseware Development in Web Based Learning","authors":"B. Ramadoss, S. Balasundaram","doi":"10.1109/ICCIS.2006.252345","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252345","url":null,"abstract":"Metaphors are widely seen in the user interfaces of today's Web based applications. Some of the major features of metaphors are their ability to organize information related to any concept and to provide better understanding of the information. The traditional teaching and learning activities of educational systems have enjoyed the benefits of metaphors in several ways. This includes representing metaphors in various forms such as text, graphics, animated images etc. One of the challenges for Web based learning (WBL) courseware developer is to design the appropriate metaphors relevant to the context of information presented in the courseware. This paper focuses on the method of selecting one or more metaphors constructed already by the courseware developers that will help in understanding as well as learning the characteristics needed for the WBL courseware development. The selected metaphors can be considered as guideline objects, from which the desirable characteristics can be applied or recommended for the new metaphors to be defined. To decide upon the candidate metaphors, the repertory grid analysis is proposed","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122254886","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-06-07DOI: 10.1109/ICCIS.2006.252366
Hallam Nasreddine, Hendra Poh, G. Kendall
One of the effective ways of optimising the evaluation function of a chess game is by tuning each of its parameters. Evolutionary algorithms have become an appropriate choice as optimisers. In the past works related to this domain, the values of the parameters are within a fixed boundary which means that no matter how the recombination and mutation operators are applied, the value of a given parameter cannot go beyond its corresponding interval. In this paper, we propose a new strategy called "dynamic boundary strategy" where the boundaries of the interval of each parameter are dynamic. A real-coded evolutionary algorithm that incorporates this strategy and uses the polynomial mutation as its main exploitative tool is implemented. The effectiveness of the proposed strategy is tested by competing our program against a popular commercial chess software. Our chess program has shown an autonomous improvement in performance after learning for hundreds of generations
{"title":"Using an Evolutionary Algorithm for the Tuning of a Chess Evaluation Function Based on a Dynamic Boundary Strategy","authors":"Hallam Nasreddine, Hendra Poh, G. Kendall","doi":"10.1109/ICCIS.2006.252366","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252366","url":null,"abstract":"One of the effective ways of optimising the evaluation function of a chess game is by tuning each of its parameters. Evolutionary algorithms have become an appropriate choice as optimisers. In the past works related to this domain, the values of the parameters are within a fixed boundary which means that no matter how the recombination and mutation operators are applied, the value of a given parameter cannot go beyond its corresponding interval. In this paper, we propose a new strategy called \"dynamic boundary strategy\" where the boundaries of the interval of each parameter are dynamic. A real-coded evolutionary algorithm that incorporates this strategy and uses the polynomial mutation as its main exploitative tool is implemented. The effectiveness of the proposed strategy is tested by competing our program against a popular commercial chess software. Our chess program has shown an autonomous improvement in performance after learning for hundreds of generations","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116116073","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-06-07DOI: 10.1109/ICCIS.2006.252358
P. Changsakol, N. Chotikakamthorn, O. Wongwirat
In this paper, a problem of visual programming of PLC (programmable logic controller) devices is described. A programming by demonstration method is developed so that a problem-domain expert can program such devices without computer programming skill. The method is novel in the sense that, unlike other programming-by-demonstration methods, it requires little a priori knowledge of the controlled system model, nor it needs to interact with a real system. A simulation model, which captures the laws of nature governing the system behavior, is jointly programmed with a control device (PLC). A PLC programming tool, developed based on the proposed joint controller-simulator programming by demonstration paradigm, can generate a high-level structure text program code, from the demonstrated actions as performed by a user
{"title":"A Joint Controller-Simulator Programming by Demonstration Method for PLC Devices","authors":"P. Changsakol, N. Chotikakamthorn, O. Wongwirat","doi":"10.1109/ICCIS.2006.252358","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252358","url":null,"abstract":"In this paper, a problem of visual programming of PLC (programmable logic controller) devices is described. A programming by demonstration method is developed so that a problem-domain expert can program such devices without computer programming skill. The method is novel in the sense that, unlike other programming-by-demonstration methods, it requires little a priori knowledge of the controlled system model, nor it needs to interact with a real system. A simulation model, which captures the laws of nature governing the system behavior, is jointly programmed with a control device (PLC). A PLC programming tool, developed based on the proposed joint controller-simulator programming by demonstration paradigm, can generate a high-level structure text program code, from the demonstrated actions as performed by a user","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128126526","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-06-07DOI: 10.1109/ICCIS.2006.252328
Jiangjiang Wang, D. An
This paper studied the application of neural network PID in the central air-conditioning system. From the control viewpoint, the central air-conditioning system has chrematistic as large inertia, delay and nonlinear and uncertain disturbance factor, for example the indoor and outdoor. In order to acquire better performance in the central air-conditioning system, the neural network PID control was studied through comparing the traditional PID control in simulation and experiments. The output of system was predicted through the algorithm of nonlinear, at last based on the mathematical model of air-conditioning space, the simulation and the experiment in a studio of TV station have found that neural network PID controller has the capability of self-studying and self-adapting and obtain faster response and better performance
{"title":"Simulation and Experiment Study of Neural Network PID Controller in Central Air-conditioning System","authors":"Jiangjiang Wang, D. An","doi":"10.1109/ICCIS.2006.252328","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252328","url":null,"abstract":"This paper studied the application of neural network PID in the central air-conditioning system. From the control viewpoint, the central air-conditioning system has chrematistic as large inertia, delay and nonlinear and uncertain disturbance factor, for example the indoor and outdoor. In order to acquire better performance in the central air-conditioning system, the neural network PID control was studied through comparing the traditional PID control in simulation and experiments. The output of system was predicted through the algorithm of nonlinear, at last based on the mathematical model of air-conditioning space, the simulation and the experiment in a studio of TV station have found that neural network PID controller has the capability of self-studying and self-adapting and obtain faster response and better performance","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132478978","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
扫码关注我们
求助内容：
应助结果提醒方式：