Z. Zhu, Hui Li, Guangyao Dai, A. Abraham, Wanqing Yang
{"title":"A rough set multi-knowledge extraction algorithm and its formal concept analysis","authors":"Z. Zhu, Hui Li, Guangyao Dai, A. Abraham, Wanqing Yang","doi":"10.1109/ISDA.2014.7066261","DOIUrl":"https://doi.org/10.1109/ISDA.2014.7066261","url":null,"abstract":"Rough set theory provides an effective method to reduce attributes and extract knowledge. This paper represents a rough set multi-knowledge extraction algorithm and its formal concept analysis. The proposed algorithm can obtain multi-reducts by using rough set in decision table. The formal concept analysis is used to obtain rules from the main values of the attributes influencing the decision making and these rules build a multi-knowledge. Experimental results show that the proposed multi-knowledge extraction algorithm is efficient.","PeriodicalId":328479,"journal":{"name":"2014 14th International Conference on Intelligent Systems Design and Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134366805","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}
{"title":"Evolving directed graphs with artificial bee colony algorithm","authors":"Xianneng Li, Guangfei Yang, K. Hirasawa","doi":"10.1109/ISDA.2014.7066282","DOIUrl":"https://doi.org/10.1109/ISDA.2014.7066282","url":null,"abstract":"Artificial bee colony (ABC) algorithm is a relatively new optimization technique that simulates the intelligent foraging behavior of honey bee swarms. It has been applied to several optimization domains to show its efficient evolution ability. In this paper, ABC algorithm is applied for the first time to evolve a directed graph chromosome structure, which derived from a recent graph-based evolutionary algorithm called genetic network programming (GNP). Consequently, it is explored to new application domains which can be efficiently modeled by the directed graph of GNP. In this work, a problem of controlling the agents's behavior under a wellknown benchmark testbed called Tileworld are solved using the ABC-based evolution strategy. Its performance is compared with several very well-known methods for evolving computer programs, including standard GNP with crossover/mutation, genetic programming (GP) and reinforcement learning (RL).","PeriodicalId":328479,"journal":{"name":"2014 14th International Conference on Intelligent Systems Design and Applications","volume":"263 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132741027","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}
{"title":"Assembling bloat control strategies in genetic programming for image noise reduction","authors":"Keiko Ono, Y. Hanada","doi":"10.1109/ISDA.2014.7066279","DOIUrl":"https://doi.org/10.1109/ISDA.2014.7066279","url":null,"abstract":"We address the problem of controlling bloat in genetic programming(GP) for image noise reduction. One of the most basic nonlinear filters for image noise reduction is the stack filter, and GP is suitable for estimating the min-max function used for a stack filter. However, bloat often occurs when the min-max function is estimated with GP. In order to enhance image noise reduction with GP, we extend the size-fair model GP, and propose a novel bloat control method based on tree size and frequent trees for image noise reduction, where the frequent trees are the relatively small subtrees appearing frequently among the population. By using texture images with impulse noise, we demonstrate that the size-fair model can achieve bloat control, and performance improvement can be achieved through bloat control based on tree size and frequent trees. Further, we demonstrate that the proposed method outperforms a typical image noise reduction method.","PeriodicalId":328479,"journal":{"name":"2014 14th International Conference on Intelligent Systems Design and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131830686","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}
{"title":"Application of xie-beni-type validity index to fuzzy co-clustering models based on cluster aggregation and pseudo-cluster-center estimation","authors":"Mai Muranishi, Katsuhiro Honda, A. Notsu","doi":"10.1109/ISDA.2014.7066274","DOIUrl":"https://doi.org/10.1109/ISDA.2014.7066274","url":null,"abstract":"In k-Means-type clustering, cluster validation is an important problem, where the most plausible solution supported by several validity indices is selected from results with various parameter settings. Xie-Beni index is a popular validity index in FCM clustering, which measures the plausibility level of fuzzy partitions by considering partition quality and geometrical features. In this research, the applicability of a Xie-Beni-type co-cluster validity index is studied with several fuzzy co-clustering models such as cluster aggregation models (FCCM and Fuzzy CoDoK) and pseudo-cluster-center models (FSKWIC and SCAD2), and is demonstrated in a document clustering application.","PeriodicalId":328479,"journal":{"name":"2014 14th International Conference on Intelligent Systems Design and Applications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129831329","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}
{"title":"Decision making and partner selection based on trust in multi-context environment","authors":"J. Samek, Ondrej Malacka, F. Zboril, F. Zboril","doi":"10.1109/ISDA.2014.7066268","DOIUrl":"https://doi.org/10.1109/ISDA.2014.7066268","url":null,"abstract":"Currently there are exist many different trust models for different purposes. These models are often used for collaborative filtering to find partner for interaction in distributed systems. Most of these models simple uses decision making and partner selection approaches based on highest trust level selection method to choose an entity for an interaction. We assume that decision making and selection most reliable partner based on trust require more complex solutions because it is key aspect when evaluating an efficient trust model. In this article we compares two different kind of partner selection methods based on highest trust level selection and the roulette wheel selection.","PeriodicalId":328479,"journal":{"name":"2014 14th International Conference on Intelligent Systems Design and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127020621","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}