{"title":"Aggregation of inconsistent rules for fuzzy rule base simplification","authors":"A. Gegov, D. Sanders, B. Vatchova","doi":"10.3233/KES-170358","DOIUrl":"https://doi.org/10.3233/KES-170358","url":null,"abstract":"","PeriodicalId":210048,"journal":{"name":"Int. J. Knowl. Based Intell. Eng. Syst.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114381694","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}
A. Gegov, Nedyalko Petrov, D. Sanders, B. Vatchova
This paper proposes a linguistic composition based modelling approach by networked fuzzy systems that are known as fuzzy networks. The nodes in these networks are modules of fuzzy rule bases and the connections between these modules are the outputs from some rule bases that are fed as inputs to other rule bases. The proposed approach represents a fuzzy network as an equivalent fuzzy system by linguistic composition of the network nodes. In comparison to the known multiple rule base approaches, this networked rule base approach reflects adequately the structure of the modelled process in terms of interacting sub-processes and leads to more accurate solutions. The approach improves significantly the transparency of the associated model while ensuring a high level of accuracy. Another advantage of this fuzzy network approach is that it fits well within the existing approaches with single rule base and multiple rule bases.
{"title":"Modular rule base fuzzy networks for linguistic composition based modelling","authors":"A. Gegov, Nedyalko Petrov, D. Sanders, B. Vatchova","doi":"10.3233/KES-170352","DOIUrl":"https://doi.org/10.3233/KES-170352","url":null,"abstract":"This paper proposes a linguistic composition based modelling approach by networked fuzzy systems that are known as fuzzy networks. The nodes in these networks are modules of fuzzy rule bases and the connections between these modules are the outputs from some rule bases that are fed as inputs to other rule bases. The proposed approach represents a fuzzy network as an equivalent fuzzy system by linguistic composition of the network nodes. In comparison to the known multiple rule base approaches, this networked rule base approach reflects adequately the structure of the modelled process in terms of interacting sub-processes and leads to more accurate solutions. The approach improves significantly the transparency of the associated model while ensuring a high level of accuracy. Another advantage of this fuzzy network approach is that it fits well within the existing approaches with single rule base and multiple rule bases.","PeriodicalId":210048,"journal":{"name":"Int. J. Knowl. Based Intell. Eng. Syst.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117312180","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}
A. Gegov, Nedyalko Petrov, D. Sanders, B. Vatchova
This paper proposes a novel approach for modelling complex interconnected systems by means of fuzzy networks. The nodes in these networks are interconnected rule bases whereby outputs from some rule bases are fed as inputs to other rule bases. The approach allows any fuzzy network of this type to be presented as an equivalent fuzzy system by linguistic composition of its nodes. The composition process makes use of formal models for fuzzy networks and basic operations in such networks. These models and operations are used for defining several node identification cases in fuzzy networks. In this case, the unknown nodes are derived by solving Boolean matrix equations in a way that guarantees a pre-specified overall performance of the network. The main advantage of the proposed approach over other approaches is that it has better transparency and facilitates not only the analysis but also the design of complex interconnected systems.
{"title":"Boolean matrix equations for node identification in fuzzy rule based networks","authors":"A. Gegov, Nedyalko Petrov, D. Sanders, B. Vatchova","doi":"10.3233/KES-170353","DOIUrl":"https://doi.org/10.3233/KES-170353","url":null,"abstract":"This paper proposes a novel approach for modelling complex interconnected systems by means of fuzzy networks. The nodes in these networks are interconnected rule bases whereby outputs from some rule bases are fed as inputs to other rule bases. The approach allows any fuzzy network of this type to be presented as an equivalent fuzzy system by linguistic composition of its nodes. The composition process makes use of formal models for fuzzy networks and basic operations in such networks. These models and operations are used for defining several node identification cases in fuzzy networks. In this case, the unknown nodes are derived by solving Boolean matrix equations in a way that guarantees a pre-specified overall performance of the network. The main advantage of the proposed approach over other approaches is that it has better transparency and facilitates not only the analysis but also the design of complex interconnected systems.","PeriodicalId":210048,"journal":{"name":"Int. J. Knowl. Based Intell. Eng. Syst.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127299261","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 new approaches for maximal constraint satisfaction problems (Max-CSPs). Inspired by the honey- bee marriage process, our approaches try to reach a solution that satisfies as many constraints as possible in a reasonable period of time. Our approaches are a centralized and distributed honey-bee optimization enhanced by a new parameter called local optimum detector. The latter allows detection of the local optimum. In this paper, newer algorithms and their experimental results are presented.
{"title":"A family of honey-bee optimization algorithms for Max-CSPs","authors":"Ines Methlouthi, Sadok Bouamama","doi":"10.3233/KES-150323","DOIUrl":"https://doi.org/10.3233/KES-150323","url":null,"abstract":"This paper presents new approaches for maximal constraint satisfaction problems (Max-CSPs). Inspired by the honey- bee marriage process, our approaches try to reach a solution that satisfies as many constraints as possible in a reasonable period of time. Our approaches are a centralized and distributed honey-bee optimization enhanced by a new parameter called local optimum detector. The latter allows detection of the local optimum. In this paper, newer algorithms and their experimental results are presented.","PeriodicalId":210048,"journal":{"name":"Int. J. Knowl. Based Intell. Eng. Syst.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122216878","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 versatility and application of Intelligent Multi-Agent Systems (I-MASs) is becoming more complex. The increase in complexity is due to a sudden requirement for Intelligent Agents (IAs) and I-MASs to exhibit more human-like functionality. Thisincludes the abilityto represent knowledge using perception, learning, recognition, reasoning and rationality. In addition, this "wishlist" of functionality also needs to be constrained within the limits of current technology. Designers of I-MASs are looking at mechanisms and processes that can satisfy more involved requirements. Two such paradigms are cognitive architectures and computational intelligence. The Agent Coordination and Cooperation Cognitive Model (AC 3 M) was developed to primarily illustrate the link between agent coordination and cooperation. Whilst analysing AC 3 M, the Stimulate-Orient-Decide-Act (SODA) methodology was discovered. This methodology is a result of integrating cognitive architecture principles with computational intelligence. SODA was the integration of the Belief, Desire and Intention (BDI) methodology with the Observe-Orient-Decide-Act (OODA) loop and results in the components of BDI being linked to phases of the OODA loop. The main advantage of the SODA methodology is the enhancement of an agent's situational awareness, which has proven to be paramount in the area of team automation.
智能多主体系统(I-MASs)的通用性和应用正变得越来越复杂。复杂性的增加是由于突然需要智能代理(IAs)和I-MASs来展示更多类似人类的功能。这包括用感知、学习、识别、推理和理性来表达知识的能力。此外，这个功能的“愿望清单”也需要限制在当前技术的范围内。I-MASs的设计者正在寻找能够满足更多复杂需求的机制和流程。两个这样的范例是认知架构和计算智能。Agent Coordination and Cooperation Cognitive Model (ac3m)主要阐述了Agent Coordination and Cooperation之间的联系。在分析ac3m时，发现了刺激-定向-决定-行动(SODA)方法。这种方法是将认知架构原理与计算智能相结合的结果。SODA是信念、欲望和意图(BDI)方法与观察-定向-决定-行动(OODA)循环的整合，结果是BDI的组成部分与OODA循环的各个阶段相关联。SODA方法的主要优点是增强了代理的态势感知，这在团队自动化领域已被证明是至关重要的。
{"title":"The integration of cognitive architectures and computational intelligence using the SODA methodology","authors":"Angela Consoli","doi":"10.3233/KES-150325","DOIUrl":"https://doi.org/10.3233/KES-150325","url":null,"abstract":"The versatility and application of Intelligent Multi-Agent Systems (I-MASs) is becoming more complex. The increase in complexity is due to a sudden requirement for Intelligent Agents (IAs) and I-MASs to exhibit more human-like functionality. Thisincludes the abilityto represent knowledge using perception, learning, recognition, reasoning and rationality. In addition, this \"wishlist\" of functionality also needs to be constrained within the limits of current technology. Designers of I-MASs are looking at mechanisms and processes that can satisfy more involved requirements. Two such paradigms are cognitive architectures and computational intelligence. The Agent Coordination and Cooperation Cognitive Model (AC 3 M) was developed to primarily illustrate the link between agent coordination and cooperation. Whilst analysing AC 3 M, the Stimulate-Orient-Decide-Act (SODA) methodology was discovered. This methodology is a result of integrating cognitive architecture principles with computational intelligence. SODA was the integration of the Belief, Desire and Intention (BDI) methodology with the Observe-Orient-Decide-Act (OODA) loop and results in the components of BDI being linked to phases of the OODA loop. The main advantage of the SODA methodology is the enhancement of an agent's situational awareness, which has proven to be paramount in the area of team automation.","PeriodicalId":210048,"journal":{"name":"Int. J. Knowl. Based Intell. Eng. Syst.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122543093","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}
A formal framework for ranking procedures is proposed. The case of interest is where relatively few items are to be ranked with a complex procedure and according to a large number of criteria. A typical example of this scenario is a competition where several companies bid for a contract, and where the selection of the winner is done with multiple criteria according to an intricate selection procedure. A case study of a bidding procedure is presented, and a logical theory for matrix algebra is proposed as the formal framework for working with Pairwise Comparisons.
{"title":"A formal approach to ranking procedures","authors":"Michael Soltys","doi":"10.3233/KES-150324","DOIUrl":"https://doi.org/10.3233/KES-150324","url":null,"abstract":"A formal framework for ranking procedures is proposed. The case of interest is where relatively few items are to be ranked with a complex procedure and according to a large number of criteria. A typical example of this scenario is a competition where several companies bid for a contract, and where the selection of the winner is done with multiple criteria according to an intricate selection procedure. A case study of a bidding procedure is presented, and a logical theory for matrix algebra is proposed as the formal framework for working with Pairwise Comparisons.","PeriodicalId":210048,"journal":{"name":"Int. J. Knowl. Based Intell. Eng. Syst.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126783638","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 problem of community detection has been widely studied in numerous research papers in the last decade. There have been several proposed solutions for this problem; however the challenges of this problem have not been fully addressed yet. In this paper, we hybridize the idea of Ant Colony clustering, which is a local search solution, with global search ability of Honey Bee Hive Optimization to detect communities faster and more accurately. We use the dancer bees for exchanging information among nodes, and a node is considered as an ant in the ant colony clustering. Experimental results on real world networks and also artificial generated graphs show superior performance of our algorithm in comparison to other previous approaches.
{"title":"Community detection in social networks using a hybrid swarm intelligence approach","authors":"Alireza Ghasabeh, M. S. Abadeh","doi":"10.3233/KES-150326","DOIUrl":"https://doi.org/10.3233/KES-150326","url":null,"abstract":"The problem of community detection has been widely studied in numerous research papers in the last decade. There have been several proposed solutions for this problem; however the challenges of this problem have not been fully addressed yet. In this paper, we hybridize the idea of Ant Colony clustering, which is a local search solution, with global search ability of Honey Bee Hive Optimization to detect communities faster and more accurately. We use the dancer bees for exchanging information among nodes, and a node is considered as an ant in the ant colony clustering. Experimental results on real world networks and also artificial generated graphs show superior performance of our algorithm in comparison to other previous approaches.","PeriodicalId":210048,"journal":{"name":"Int. J. Knowl. Based Intell. Eng. Syst.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124708723","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}
Pegah Barekati, Mehrdad Jalali, M. V. Jahan, Vahideh Amel Mahboob
Social networks are generally sets of individuals or organizations that are connected with one or more links. Usually, social networks are presented by undirected graphs, where the set of vertices V and the set of edges E state the individuals and relation between them respectively. One of the most applicable problems in these networks is the centrality values allocation problem to the vertices and edges. Recently, a new evaluation criterion for the edge centrality so called centrality index of k paths has been proposed which is based on intranet issuing the messages along with random paths composed of k edges. From the other side, it has been vivid the importance of computing the edges centrality through these years. In this study, by referring to message propagation along random paths, a new diffusion model was reached by applying heat diffusion algorithm. This model was based such that the vertex on the way of heat diffusion of most of vertices could be considered as an important node and it could obtain centrality edges by scoring the edges on the heat diffusion path. The proposed technique was compared with centrality drawing method by means of random paths of length k and the results of analyzing the algorithm performance on online large social networks’ data set show a remarkable efficacy of the proposed method to the mentioned method. Utilizing known large social networks in evaluation proves the efficiency of the proposed method for analyzing the large scale network.
{"title":"Extracting edge centrality from social networks using heat diffusion algorithm","authors":"Pegah Barekati, Mehrdad Jalali, M. V. Jahan, Vahideh Amel Mahboob","doi":"10.3233/KES-150306","DOIUrl":"https://doi.org/10.3233/KES-150306","url":null,"abstract":"Social networks are generally sets of individuals or organizations that are connected with one or more links. Usually, social networks are presented by undirected graphs, where the set of vertices V and the set of edges E state the individuals and relation between them respectively. One of the most applicable problems in these networks is the centrality values allocation problem to the vertices and edges. Recently, a new evaluation criterion for the edge centrality so called centrality index of k paths has been proposed which is based on intranet issuing the messages along with random paths composed of k edges. From the other side, it has been vivid the importance of computing the edges centrality through these years. In this study, by referring to message propagation along random paths, a new diffusion model was reached by applying heat diffusion algorithm. This model was based such that the vertex on the way of heat diffusion of most of vertices could be considered as an important node and it could obtain centrality edges by scoring the edges on the heat diffusion path. The proposed technique was compared with centrality drawing method by means of random paths of length k and the results of analyzing the algorithm performance on online large social networks’ data set show a remarkable efficacy of the proposed method to the mentioned method. Utilizing known large social networks in evaluation proves the efficiency of the proposed method for analyzing the large scale network.","PeriodicalId":210048,"journal":{"name":"Int. J. Knowl. Based Intell. Eng. Syst.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129336139","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":"Rule-based decision support tools for injection moulding","authors":"M. Marinov, Tsvetelin M. Pavlov","doi":"10.3233/KES-150311","DOIUrl":"https://doi.org/10.3233/KES-150311","url":null,"abstract":"","PeriodicalId":210048,"journal":{"name":"Int. J. Knowl. Based Intell. Eng. Syst.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127208043","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":"Automatic logo based document image retrieval","authors":"M. Shirdhonkar, M. Kokare","doi":"10.3233/KES-150305","DOIUrl":"https://doi.org/10.3233/KES-150305","url":null,"abstract":"","PeriodicalId":210048,"journal":{"name":"Int. J. Knowl. Based Intell. Eng. Syst.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126798454","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
扫码关注我们
求助内容：
应助结果提醒方式：