首页 > 最新文献

2009 IEEE International Conference on Fuzzy Systems最新文献

英文 中文
Mining pattern of supplier with the methodology of domain-driven data mining 采用领域驱动数据挖掘方法挖掘供应商模式
Pub Date : 2009-10-02 DOI: 10.1109/FUZZY.2009.5277366
Xu Xu, Jie Lin, Dongming Xu
Supplier selection has a critical effect on the competitiveness of the entire supply chain network. It is not only a significant work in supply chain management but also a complex decision making problem which includes both qualitative and quantitative factors. Research results indicate that the supplier selection process appears to satisfy different evaluation criteria and business model in deciding the success of the supply chain. Supplier selection problem related to organization strategy and it needs more critical analysis. This paper proposes a novel approach that combines expert domain knowledge with Apriori algorithm of data mining to discover the pattern of supplier under the methodology of Domain-Driven Data Mining (D3M). Apriori algorithm of data mining with the help of Intuitionistic Fuzzy Set Theory (IFST) is employed during the process of mining. The overall patterns obtained help in deciding the final selection of suppliers. Finally, AHP is used to efficiently tackle both quantitative and qualitative decision factors involved in ranking of suppliers with the help of pattern achieved. An example searching for pattern of supplier is used to demonstrate the effective implementation procedure of proposed method. The proposed method can provide the guidelines for the decision makers to effectively select their suppliers in the current competitive business scenario.
供应商选择对整个供应链网络的竞争力有着至关重要的影响。它不仅是供应链管理中的一项重要工作,而且是一个复杂的决策问题,其中包括定性和定量因素。研究结果表明,供应商选择过程在决定供应链成功与否方面表现出满足不同评价标准和商业模式的特征。供应商选择问题涉及到组织战略,需要更多的批判性分析。在领域驱动数据挖掘(D3M)方法下,提出了一种将专家领域知识与数据挖掘中的Apriori算法相结合的供应商模式发现方法。在数据挖掘过程中采用了直觉模糊集理论(IFST)辅助的Apriori算法。总体模式有助于最终确定供应商的选择。最后,运用层次分析法,利用所获得的模式,有效地解决了供应商排序中涉及的定量和定性决策因素。以供应商模式搜索为例,说明了该方法的有效实施过程。该方法可以为决策者在当前竞争激烈的商业场景中有效地选择供应商提供指导。
{"title":"Mining pattern of supplier with the methodology of domain-driven data mining","authors":"Xu Xu, Jie Lin, Dongming Xu","doi":"10.1109/FUZZY.2009.5277366","DOIUrl":"https://doi.org/10.1109/FUZZY.2009.5277366","url":null,"abstract":"Supplier selection has a critical effect on the competitiveness of the entire supply chain network. It is not only a significant work in supply chain management but also a complex decision making problem which includes both qualitative and quantitative factors. Research results indicate that the supplier selection process appears to satisfy different evaluation criteria and business model in deciding the success of the supply chain. Supplier selection problem related to organization strategy and it needs more critical analysis. This paper proposes a novel approach that combines expert domain knowledge with Apriori algorithm of data mining to discover the pattern of supplier under the methodology of Domain-Driven Data Mining (D3M). Apriori algorithm of data mining with the help of Intuitionistic Fuzzy Set Theory (IFST) is employed during the process of mining. The overall patterns obtained help in deciding the final selection of suppliers. Finally, AHP is used to efficiently tackle both quantitative and qualitative decision factors involved in ranking of suppliers with the help of pattern achieved. An example searching for pattern of supplier is used to demonstrate the effective implementation procedure of proposed method. The proposed method can provide the guidelines for the decision makers to effectively select their suppliers in the current competitive business scenario.","PeriodicalId":117895,"journal":{"name":"2009 IEEE International Conference on Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127952110","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}
引用次数: 4
Adaptive backoff scheme for contention-based vehicular networks using fuzzy logic 基于模糊逻辑的基于竞争的车辆网络自适应后退方案
Pub Date : 2009-10-02 DOI: 10.1109/FUZZY.2009.5277359
T. Abdelkader, S. Naik, A. Nayak, F. Karray
In contention-based wireless networks, collisions between data packets can be reduced by introducing a random delay before each transmission. Backoff schemes are those that provide the backoff interval from which the random delay is drawn. In this paper, we propose a new scheme which calculates the backoff interval dynamically according to the network conditions. The network conditions are measured locally by each node, which supports the distributed nature of the vehicular networks. The measures are used by a fuzzy inference system to calculate the backoff interval. We compare the proposed scheme with other known schemes: the binary exponential backoff (BEB), the sensing backoff algorithm (SBA) and an optimal scheme which requires the knowledge of the number of nodes in the network (Genie). The evaluation measures are the throughput and fairness. Results show an improvement of the fuzzy-based schemes compared to the BEB and SBA, especially for large number of nodes in the network.
在基于争用的无线网络中,可以通过在每次传输之前引入随机延迟来减少数据包之间的冲突。退避方案是那些提供退避间隔的方案,从中可以得出随机延迟。本文提出了一种根据网络条件动态计算回退间隔的新方案。网络状况由每个节点局部测量,支持车辆网络的分布式特性。利用模糊推理系统计算退避区间。我们将所提出的方案与其他已知方案进行了比较:二进制指数退退(BEB),感知退退算法(SBA)和需要了解网络中节点数量的最优方案(Genie)。评价指标为吞吐量和公平性。结果表明,与BEB和SBA相比,基于模糊的方案有很大的改进,特别是在网络中节点数量较多的情况下。
{"title":"Adaptive backoff scheme for contention-based vehicular networks using fuzzy logic","authors":"T. Abdelkader, S. Naik, A. Nayak, F. Karray","doi":"10.1109/FUZZY.2009.5277359","DOIUrl":"https://doi.org/10.1109/FUZZY.2009.5277359","url":null,"abstract":"In contention-based wireless networks, collisions between data packets can be reduced by introducing a random delay before each transmission. Backoff schemes are those that provide the backoff interval from which the random delay is drawn. In this paper, we propose a new scheme which calculates the backoff interval dynamically according to the network conditions. The network conditions are measured locally by each node, which supports the distributed nature of the vehicular networks. The measures are used by a fuzzy inference system to calculate the backoff interval. We compare the proposed scheme with other known schemes: the binary exponential backoff (BEB), the sensing backoff algorithm (SBA) and an optimal scheme which requires the knowledge of the number of nodes in the network (Genie). The evaluation measures are the throughput and fairness. Results show an improvement of the fuzzy-based schemes compared to the BEB and SBA, especially for large number of nodes in the network.","PeriodicalId":117895,"journal":{"name":"2009 IEEE International Conference on Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125339761","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}
引用次数: 7
Robust function approximation based on fuzzy sets and rough sets 基于模糊集和粗糙集的鲁棒函数逼近
Pub Date : 2009-10-02 DOI: 10.1109/FUZZY.2009.5277427
Chih-Ching Hsiao
The rough set theory is successes to deal with imprecise, incomplete or uncertain for information system. Fuzzy set and the rough set theories turned out to be particularly adequate for the analysis of various types of data, especially, when dealing with inexact, uncertain or vague knowledge. In this paper, we propose an novel algorithm, which termed as Rough-Fuzzy C-regression model (RFCRM), that define fuzzy subspaces in a fuzzy regression manner and also include Rough-set theory for TSK modeling with robust capability against outliers.
粗糙集理论是处理不精确、不完整或不确定信息系统的成功方法。模糊集和粗糙集理论被证明特别适合分析各种类型的数据,特别是当处理不精确、不确定或模糊的知识时。在本文中,我们提出了一种新的算法,称为粗糙-模糊c -回归模型(RFCRM),它以模糊回归的方式定义模糊子空间,并将粗糙集理论用于TSK建模,具有对异常值的鲁棒性。
{"title":"Robust function approximation based on fuzzy sets and rough sets","authors":"Chih-Ching Hsiao","doi":"10.1109/FUZZY.2009.5277427","DOIUrl":"https://doi.org/10.1109/FUZZY.2009.5277427","url":null,"abstract":"The rough set theory is successes to deal with imprecise, incomplete or uncertain for information system. Fuzzy set and the rough set theories turned out to be particularly adequate for the analysis of various types of data, especially, when dealing with inexact, uncertain or vague knowledge. In this paper, we propose an novel algorithm, which termed as Rough-Fuzzy C-regression model (RFCRM), that define fuzzy subspaces in a fuzzy regression manner and also include Rough-set theory for TSK modeling with robust capability against outliers.","PeriodicalId":117895,"journal":{"name":"2009 IEEE International Conference on Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121535354","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}
引用次数: 0
On hesitant fuzzy sets and decision 关于犹豫模糊集与决策
Pub Date : 2009-10-02 DOI: 10.1109/FUZZY.2009.5276884
V. Torra, Y. Narukawa
Intuitionistic Fuzzy Sets (IFS) are a generalization of fuzzy sets where the membership is an interval. That is, membership, instead of being a single value, is an interval. A large number of operations have been defined for this type of fuzzy sets, and several applications have been developed in the last years. In this paper we describe hesitant fuzzy sets. They are another generalization of fuzzy sets. Although similar in intention to IFS, some basic differences on their interpretation and on their operators exist. In this paper we review their definition, the main results and we present an extension principle, which permits to generalize existing operations on fuzzy sets to this new type of fuzzy sets. We also discuss their use in decision making.
直觉模糊集(IFS)是隶属度为区间的模糊集的推广。也就是说,隶属度不是单个值,而是一个区间。对于这种类型的模糊集,已经定义了大量的运算,并且在过去几年中已经开发了一些应用。本文描述了犹豫模糊集。它们是模糊集的另一种推广。虽然在意图上与IFS相似,但在解释和经营者上存在一些基本的差异。本文回顾了它们的定义和主要结果,并给出了一个可拓原理,该原理允许将模糊集上已有的运算推广到这种新的模糊集上。我们还讨论了它们在决策中的应用。
{"title":"On hesitant fuzzy sets and decision","authors":"V. Torra, Y. Narukawa","doi":"10.1109/FUZZY.2009.5276884","DOIUrl":"https://doi.org/10.1109/FUZZY.2009.5276884","url":null,"abstract":"Intuitionistic Fuzzy Sets (IFS) are a generalization of fuzzy sets where the membership is an interval. That is, membership, instead of being a single value, is an interval. A large number of operations have been defined for this type of fuzzy sets, and several applications have been developed in the last years. In this paper we describe hesitant fuzzy sets. They are another generalization of fuzzy sets. Although similar in intention to IFS, some basic differences on their interpretation and on their operators exist. In this paper we review their definition, the main results and we present an extension principle, which permits to generalize existing operations on fuzzy sets to this new type of fuzzy sets. We also discuss their use in decision making.","PeriodicalId":117895,"journal":{"name":"2009 IEEE International Conference on Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122987777","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}
引用次数: 1157
Fuzzy theory-based best generation mix considering renewable energy generators 基于模糊理论的可再生能源发电机组最佳发电组合
Pub Date : 2009-10-02 DOI: 10.1109/FUZZY.2009.5277196
Jeongje Park, Liang-Qi Wu, Jaeseok Choi, J. Cha, A. El-Keib, J. Watada
This paper proposes a fuzzy linear programming (LP)-based solution approach for the long-term multi-stages best generation mix (BGM) problem considering wind turbine generators (WTG) and solar cell generators (SCG), and CO2 emissions constraints. The proposed method uses fuzzy set theory to consider the uncertain circumstances ambiguities associated with budgets and reliability criterion level. The proposed approach provides a more flexible solution compared to a crisp robust plan. The effectiveness of the proposed approach is demonstrated by applying it to solve the multi-years best generation mix problem on the Korean power system, which contains nuclear, coal, LNG, oil, pumped-storage hydro, and WTGs and SCGs.
针对考虑风力发电机组(WTG)和太阳能电池发电机组(SCG)以及二氧化碳排放约束的长期多阶段最佳发电组合问题,提出了一种基于模糊线性规划(LP)的求解方法。该方法利用模糊集理论来考虑与预算和可靠性准则水平相关的不确定情况的模糊性。与清晰的健壮计划相比,所建议的方法提供了更灵活的解决方案。通过将所提出的方法应用于解决韩国电力系统的多年最佳发电组合问题,证明了该方法的有效性,该系统包含核能,煤炭,液化天然气,石油,抽水蓄能水电以及wtg和SCGs。
{"title":"Fuzzy theory-based best generation mix considering renewable energy generators","authors":"Jeongje Park, Liang-Qi Wu, Jaeseok Choi, J. Cha, A. El-Keib, J. Watada","doi":"10.1109/FUZZY.2009.5277196","DOIUrl":"https://doi.org/10.1109/FUZZY.2009.5277196","url":null,"abstract":"This paper proposes a fuzzy linear programming (LP)-based solution approach for the long-term multi-stages best generation mix (BGM) problem considering wind turbine generators (WTG) and solar cell generators (SCG), and CO2 emissions constraints. The proposed method uses fuzzy set theory to consider the uncertain circumstances ambiguities associated with budgets and reliability criterion level. The proposed approach provides a more flexible solution compared to a crisp robust plan. The effectiveness of the proposed approach is demonstrated by applying it to solve the multi-years best generation mix problem on the Korean power system, which contains nuclear, coal, LNG, oil, pumped-storage hydro, and WTGs and SCGs.","PeriodicalId":117895,"journal":{"name":"2009 IEEE International Conference on Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126092461","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}
引用次数: 5
Investigation of user RT-service generation system design 用户即时服务生成系统设计研究
Pub Date : 2009-10-02 DOI: 10.1109/FUZZY.2009.5277172
K. Ukai, Y. Ando, M. Mizukawa
In this research, we propose the robot technology (RT) Ontology for Interactive Human-Space Design and Intelligence to make robot provide appropriate services according to situations. For this, we propose to define that "Main task" as a task that the user requests and "Tsuide task" as an essential task accompanied with the "Main task" to complete it. We focus on the development of the system for identifying and defining "Tsuide task" that is changed by the intention of user and the main task. We name the proposing technique as "RT Ontology" which can be used for the infrastructure technology for structuring space information. In this paper, we describe the outline of RT Ontology and experiments.
在本研究中,我们提出了面向人机交互设计与智能的机器人技术本体(RT),使机器人能够根据不同的情况提供相应的服务。为此,我们建议将“Main task”定义为用户请求的任务,将“Tsuide task”定义为伴随“Main task”完成的必备任务。我们重点开发了识别和定义由用户意图和主任务改变的“Tsuide任务”的系统。我们将提出的技术称为“RT本体”,它可以作为空间信息结构化的基础技术。在本文中,我们描述了RT本体的轮廓和实验。
{"title":"Investigation of user RT-service generation system design","authors":"K. Ukai, Y. Ando, M. Mizukawa","doi":"10.1109/FUZZY.2009.5277172","DOIUrl":"https://doi.org/10.1109/FUZZY.2009.5277172","url":null,"abstract":"In this research, we propose the robot technology (RT) Ontology for Interactive Human-Space Design and Intelligence to make robot provide appropriate services according to situations. For this, we propose to define that \"Main task\" as a task that the user requests and \"Tsuide task\" as an essential task accompanied with the \"Main task\" to complete it. We focus on the development of the system for identifying and defining \"Tsuide task\" that is changed by the intention of user and the main task. We name the proposing technique as \"RT Ontology\" which can be used for the infrastructure technology for structuring space information. In this paper, we describe the outline of RT Ontology and experiments.","PeriodicalId":117895,"journal":{"name":"2009 IEEE International Conference on Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121175927","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}
引用次数: 6
Detection of preference shift timing using time-series clustering 使用时间序列聚类检测偏好移位时间
Pub Date : 2009-10-02 DOI: 10.1109/FUZZY.2009.5277270
Fuyuko Ito, T. Hiroyasu, M. Miki, Hisatake Yokouchi
Recommendation methods help online users to purchase products more easily by presenting products that are likely to match their preferences. In these methods, user profiles are constructed according to past activities on the site. When a user accesses an e-commerce site, the user preferences may change during the course of web shopping. We called this a “preference shift” in this paper. However, conventional recommendation methods suppose that user profiles are static, and therefore these methods cannot follow the preference shift. Here, a novel product recommendation method is proposed, which responds to the preference shift. With use of this recommendation method, the users remain at the site longer than before. This paper discusses the detection method for finding the preference shift timing using time-series clustering. In the proposed method, the products preferred by a user are clustered and the preference shift timing is detected as the change in the clustering results.
推荐方法通过向在线用户展示可能符合他们偏好的产品,帮助他们更容易地购买产品。在这些方法中,根据网站上过去的活动构建用户配置文件。当用户访问电子商务网站时,用户的偏好可能会在网上购物的过程中发生变化。在本文中,我们称之为“偏好转移”。然而,传统的推荐方法假设用户配置文件是静态的,因此这些方法不能遵循偏好的变化。本文提出了一种响应偏好变化的产品推荐方法。使用这种推荐方法,用户在网站上停留的时间比以前更长。本文讨论了一种利用时间序列聚类寻找偏好移位时间的检测方法。在该方法中,对用户偏好的产品进行聚类,并通过聚类结果的变化来检测偏好移位时间。
{"title":"Detection of preference shift timing using time-series clustering","authors":"Fuyuko Ito, T. Hiroyasu, M. Miki, Hisatake Yokouchi","doi":"10.1109/FUZZY.2009.5277270","DOIUrl":"https://doi.org/10.1109/FUZZY.2009.5277270","url":null,"abstract":"Recommendation methods help online users to purchase products more easily by presenting products that are likely to match their preferences. In these methods, user profiles are constructed according to past activities on the site. When a user accesses an e-commerce site, the user preferences may change during the course of web shopping. We called this a “preference shift” in this paper. However, conventional recommendation methods suppose that user profiles are static, and therefore these methods cannot follow the preference shift. Here, a novel product recommendation method is proposed, which responds to the preference shift. With use of this recommendation method, the users remain at the site longer than before. This paper discusses the detection method for finding the preference shift timing using time-series clustering. In the proposed method, the products preferred by a user are clustered and the preference shift timing is detected as the change in the clustering results.","PeriodicalId":117895,"journal":{"name":"2009 IEEE International Conference on Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131492212","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}
引用次数: 4
Representation by cuts in the framework of relational valued fuzzy sets 关系值模糊集框架中的切表示
Pub Date : 2009-10-02 DOI: 10.1109/FUZZY.2009.5277357
B. Seselja, A. Tepavčević
Generalized or relational-valued fuzzy sets are mappings from a set X to a relational system S = (S, p). Representation of collections of subsets by relational-valued fuzzy sets in the cutworthy framework is presented. It is proved that for every collection F of subsets of a set X there is a relational system S = (S, p) and a fuzzy set μ : X → S, such that the collection of cuts of μ coincides with F.
广义模糊集或关系值模糊集是从集合X到关系系统S = (S, p)的映射。给出了在可切框架下用关系值模糊集表示子集集合的方法。证明了对于集合X的子集的每一个集合F,存在一个关系系统S = (S, p)和一个模糊集合μ: X→S,使得μ的切点集合重合于F。
{"title":"Representation by cuts in the framework of relational valued fuzzy sets","authors":"B. Seselja, A. Tepavčević","doi":"10.1109/FUZZY.2009.5277357","DOIUrl":"https://doi.org/10.1109/FUZZY.2009.5277357","url":null,"abstract":"Generalized or relational-valued fuzzy sets are mappings from a set X to a relational system S = (S, p). Representation of collections of subsets by relational-valued fuzzy sets in the cutworthy framework is presented. It is proved that for every collection F of subsets of a set X there is a relational system S = (S, p) and a fuzzy set μ : X → S, such that the collection of cuts of μ coincides with F.","PeriodicalId":117895,"journal":{"name":"2009 IEEE International Conference on Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133728058","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}
引用次数: 0
The ”Final” model of granular computing 颗粒计算的“最终”模型
Pub Date : 2009-10-02 DOI: 10.1109/FUZZY.2009.5277238
T. Lin
Granular computing (GrC) is a recent label, roughly speaking, jointly coined by Lin and Zadeh in 1996 to denote an emerging technology that is based on the computing/mathematical theory of an ancient concept of granulation. In this paper, we present the rdquofinalrdquo GrC model that simplify the earlier version.
粗略地说,颗粒计算(GrC)是一个最近的标签,由Lin和Zadeh在1996年共同创造,用于表示基于古老的粒化概念的计算/数学理论的新兴技术。在本文中,我们提出了简化早期版本的rdquofinalrdquo GrC模型。
{"title":"The ”Final” model of granular computing","authors":"T. Lin","doi":"10.1109/FUZZY.2009.5277238","DOIUrl":"https://doi.org/10.1109/FUZZY.2009.5277238","url":null,"abstract":"Granular computing (GrC) is a recent label, roughly speaking, jointly coined by Lin and Zadeh in 1996 to denote an emerging technology that is based on the computing/mathematical theory of an ancient concept of granulation. In this paper, we present the rdquofinalrdquo GrC model that simplify the earlier version.","PeriodicalId":117895,"journal":{"name":"2009 IEEE International Conference on Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133375906","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}
引用次数: 4
Search ability of evolutionary multiobjective optimization algorithms for multiobjective fuzzy genetics-based machine learning 基于多目标模糊遗传的机器学习进化多目标优化算法的搜索能力
Pub Date : 2009-10-02 DOI: 10.1109/FUZZY.2009.5277370
H. Ishibuchi, Yusuke Nakashima, Y. Nojima
Recently evolutionary multiobjective optimization (EMO) algorithms have been actively used for the design of accurate and interpretable fuzzy rule-based systems. This research area is often referred to as multiobjective genetic fuzzy systems where EMO algorithms are used to search for a number of non-dominated fuzzy rule-based systems with respect to their accuracy and interpretability. The main advantage of the use of EMO algorithms for fuzzy system design over single-objective optimizers is that multiple alternative fuzzy rule-based systems with different accuracy-interpretability tradeoffs are obtained by their single run. The decision maker can choose a single fuzzy rule-based system according to their preference. There still exist several important issues to be discussed in this research area such as the definition of interpretability, the formulation of interpretability measures, the visualization of tradeoff relations, and the interpretability of the explanation of fuzzy reasoning results. In this paper, we discuss the ability of EMO algorithms as multiobjective optimizers to search for Pareto optimal or near Pareto optimal fuzzy rule-based systems. More specifically, we examine whether EMO algorithms can find non-dominated fuzzy rule-based systems that approximate the entire Pareto fronts of multiobjective fuzzy system design problems.
近年来,进化多目标优化(EMO)算法被广泛应用于设计精确的、可解释的模糊规则系统。这一研究领域通常被称为多目标遗传模糊系统,其中EMO算法用于搜索一些基于规则的非支配模糊系统,以考虑其准确性和可解释性。与单目标优化器相比,使用EMO算法进行模糊系统设计的主要优点是,通过单次运行可以获得具有不同精度-可解释性权衡的多个备选模糊规则系统。决策者可以根据自己的偏好选择单个模糊规则系统。可解释性的定义、可解释性测度的制定、权衡关系的可视化、模糊推理结果解释的可解释性等问题仍是该研究领域有待探讨的重要问题。本文讨论了EMO算法作为多目标优化器搜索Pareto最优或接近Pareto最优模糊规则系统的能力。更具体地说,我们研究了EMO算法是否可以找到近似多目标模糊系统设计问题的整个帕累托前沿的非支配模糊规则系统。
{"title":"Search ability of evolutionary multiobjective optimization algorithms for multiobjective fuzzy genetics-based machine learning","authors":"H. Ishibuchi, Yusuke Nakashima, Y. Nojima","doi":"10.1109/FUZZY.2009.5277370","DOIUrl":"https://doi.org/10.1109/FUZZY.2009.5277370","url":null,"abstract":"Recently evolutionary multiobjective optimization (EMO) algorithms have been actively used for the design of accurate and interpretable fuzzy rule-based systems. This research area is often referred to as multiobjective genetic fuzzy systems where EMO algorithms are used to search for a number of non-dominated fuzzy rule-based systems with respect to their accuracy and interpretability. The main advantage of the use of EMO algorithms for fuzzy system design over single-objective optimizers is that multiple alternative fuzzy rule-based systems with different accuracy-interpretability tradeoffs are obtained by their single run. The decision maker can choose a single fuzzy rule-based system according to their preference. There still exist several important issues to be discussed in this research area such as the definition of interpretability, the formulation of interpretability measures, the visualization of tradeoff relations, and the interpretability of the explanation of fuzzy reasoning results. In this paper, we discuss the ability of EMO algorithms as multiobjective optimizers to search for Pareto optimal or near Pareto optimal fuzzy rule-based systems. More specifically, we examine whether EMO algorithms can find non-dominated fuzzy rule-based systems that approximate the entire Pareto fronts of multiobjective fuzzy system design problems.","PeriodicalId":117895,"journal":{"name":"2009 IEEE International Conference on Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133797751","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}
引用次数: 9
期刊
2009 IEEE International Conference on Fuzzy Systems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1