首页 > 最新文献

The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03.最新文献

英文 中文
Tuning complex fuzzy systems by supervised learning algorithms 用监督学习算法调整复杂模糊系统
Pub Date : 2003-05-25 DOI: 10.1109/FUZZ.2003.1209366
F. J. Moreno-Velo, I. Baturone, R. Senhadji, S. Sánchez-Solano
Tuning a fuzzy system to meet a given set of input/output patterns is usually a difficult task that involves many parameters. This paper presents an study of different approaches that can be applied to perform this tuning process automatically, and describes a CAD tool, named xfsl, which allows applying a wide set of these approaches: (a) a large number of supervised learning algorithms; (b) different processes to simplify the learned system; (c) tuning only specific parameters of the system; (d) the ability to tune hierarchical fuzzy systems, systems with continuous output (like fuzzy controller) as well as with categorical output (like fuzzy classifiers), and even systems that employ user-defined fuzzy functions; and, finally, (e) the ability to employ this tuning within the design flow of a fuzzy system, because xfsl is integrated into the fuzzy system development environment Xfuzzy 3.0.
调整模糊系统以满足给定的一组输入/输出模式通常是一项涉及许多参数的困难任务。本文介绍了可用于自动执行此调优过程的不同方法的研究,并描述了一个名为xfsl的CAD工具,该工具允许应用广泛的这些方法:(a)大量监督学习算法;(b)不同的过程来简化学习系统;(c)只调整系统的特定参数;(d)调整层次模糊系统的能力,具有连续输出(如模糊控制器)和分类输出(如模糊分类器)的系统,甚至使用用户定义的模糊函数的系统;最后,(e)在模糊系统的设计流程中使用这种调优的能力,因为xfsl集成到模糊系统开发环境Xfuzzy 3.0中。
{"title":"Tuning complex fuzzy systems by supervised learning algorithms","authors":"F. J. Moreno-Velo, I. Baturone, R. Senhadji, S. Sánchez-Solano","doi":"10.1109/FUZZ.2003.1209366","DOIUrl":"https://doi.org/10.1109/FUZZ.2003.1209366","url":null,"abstract":"Tuning a fuzzy system to meet a given set of input/output patterns is usually a difficult task that involves many parameters. This paper presents an study of different approaches that can be applied to perform this tuning process automatically, and describes a CAD tool, named xfsl, which allows applying a wide set of these approaches: (a) a large number of supervised learning algorithms; (b) different processes to simplify the learned system; (c) tuning only specific parameters of the system; (d) the ability to tune hierarchical fuzzy systems, systems with continuous output (like fuzzy controller) as well as with categorical output (like fuzzy classifiers), and even systems that employ user-defined fuzzy functions; and, finally, (e) the ability to employ this tuning within the design flow of a fuzzy system, because xfsl is integrated into the fuzzy system development environment Xfuzzy 3.0.","PeriodicalId":212172,"journal":{"name":"The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116761036","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}
引用次数: 18
Stability analysis of variation model for linguistic fuzzy modeling 语言模糊建模变分模型的稳定性分析
Pub Date : 2003-05-25 DOI: 10.1109/FUZZ.2003.1209346
A. Suratgar, S. Nikravesh
This paper presents two new approaches for linguistic modeling which are suitable for stability analysis of linguistic models. The first approach, which is named called Infinite Place model, is described by modified fuzzy Petri net and uses a new place definition based on physical infinity state. This method has some practical difficulties. In order to overcome practical difficulties, variation model is presented. The paper presents some definitions and a necessary and sufficient condition for linguistic fuzzy system stability. This stability analysis method is verified using a benchmark network simulation.
本文提出了两种新的语言建模方法,它们适用于语言模型的稳定性分析。第一种方法是用改进的模糊Petri网来描述无限空间模型,并使用基于物理无限状态的新空间定义。这种方法有一些实际的困难。为了克服实际困难,提出了变分模型。本文给出了语言模糊系统稳定性的一些定义和充要条件。通过基准网络仿真验证了该稳定性分析方法的有效性。
{"title":"Stability analysis of variation model for linguistic fuzzy modeling","authors":"A. Suratgar, S. Nikravesh","doi":"10.1109/FUZZ.2003.1209346","DOIUrl":"https://doi.org/10.1109/FUZZ.2003.1209346","url":null,"abstract":"This paper presents two new approaches for linguistic modeling which are suitable for stability analysis of linguistic models. The first approach, which is named called Infinite Place model, is described by modified fuzzy Petri net and uses a new place definition based on physical infinity state. This method has some practical difficulties. In order to overcome practical difficulties, variation model is presented. The paper presents some definitions and a necessary and sufficient condition for linguistic fuzzy system stability. This stability analysis method is verified using a benchmark network simulation.","PeriodicalId":212172,"journal":{"name":"The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125292680","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
Causal possibility model structures 因果可能性模型结构
Pub Date : 2003-05-25 DOI: 10.1109/FUZZ.2003.1209446
L. Mazlack
Causality occupies a position of centrality in human reasoning. It plays an essential role in commonsense human decision-making. Determining causes has been a tantalizing goal throughout human history. Proper sacrifices to the gods were thought to bring rewards; failure to make the proper observations to led to disaster. Today, data mining holds the promise of extracting unsuspected information from very large databases. The most common methods build association rules. In many ways, the interest in association rules is that they offer the promise (or illusion) of causal, or at least, predictive relationships. However, association rules only calculate a joint occurrence frequency; they do not express a causal relationship. If causal relationships could be discovered, it would be very useful. This paper explores the possible representation of causality drawn from large data sets.
因果关系在人类推理中占有中心地位。它在人类的常识性决策中起着至关重要的作用。在整个人类历史上,确定原因一直是一个诱人的目标。人们认为适当的祭祀神灵会带来回报;未能做出正确的观察导致了灾难。如今,数据挖掘有望从非常大的数据库中提取不受怀疑的信息。最常见的方法是构建关联规则。在许多方面,对关联规则的兴趣在于它们提供了因果关系的承诺(或幻觉),或者至少是预测关系。然而,关联规则只计算联合出现的频率;它们并不表示因果关系。如果能发现因果关系,那将是非常有用的。本文探讨了从大数据集中抽取的因果关系的可能表示。
{"title":"Causal possibility model structures","authors":"L. Mazlack","doi":"10.1109/FUZZ.2003.1209446","DOIUrl":"https://doi.org/10.1109/FUZZ.2003.1209446","url":null,"abstract":"Causality occupies a position of centrality in human reasoning. It plays an essential role in commonsense human decision-making. Determining causes has been a tantalizing goal throughout human history. Proper sacrifices to the gods were thought to bring rewards; failure to make the proper observations to led to disaster. Today, data mining holds the promise of extracting unsuspected information from very large databases. The most common methods build association rules. In many ways, the interest in association rules is that they offer the promise (or illusion) of causal, or at least, predictive relationships. However, association rules only calculate a joint occurrence frequency; they do not express a causal relationship. If causal relationships could be discovered, it would be very useful. This paper explores the possible representation of causality drawn from large data sets.","PeriodicalId":212172,"journal":{"name":"The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122648535","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}
引用次数: 2
Resolution principle based on finite chain lattice-valued proposition logic FCLP(X) 基于有限链格值命题逻辑FCLP(X)的分解原理
Pub Date : 2003-05-25 DOI: 10.1109/FUZZ.2003.1209338
D. Meng, Xiaoping Qiu
In the present paper, resolution-based automated reasoning theory and algorithm in a finite chain lattice-valued proposition logic are focused. Concretely, the resolution principle, which is based on a finite chain lattice-valued propositional logic FCLP(X) is investigated. And soundness theorem and completeness theorem of this resolution principle are also proved. In order to realize resolution, the concrete algorithm of resolution is discussed. It is hoped that this research will make forward theoretical research of automated reasoning based on lattice-valued logic.
本文主要研究了有限链格值命题逻辑中基于分辨率的自动推理理论和算法。具体地,研究了基于有限链格值命题逻辑FCLP(X)的解析原理。并证明了该分解原理的完备性定理和完备性定理。为了实现分辨率,讨论了分辨率的具体算法。希望本研究能对基于格值逻辑的自动推理理论研究起到一定的推动作用。
{"title":"Resolution principle based on finite chain lattice-valued proposition logic FCLP(X)","authors":"D. Meng, Xiaoping Qiu","doi":"10.1109/FUZZ.2003.1209338","DOIUrl":"https://doi.org/10.1109/FUZZ.2003.1209338","url":null,"abstract":"In the present paper, resolution-based automated reasoning theory and algorithm in a finite chain lattice-valued proposition logic are focused. Concretely, the resolution principle, which is based on a finite chain lattice-valued propositional logic FCLP(X) is investigated. And soundness theorem and completeness theorem of this resolution principle are also proved. In order to realize resolution, the concrete algorithm of resolution is discussed. It is hoped that this research will make forward theoretical research of automated reasoning based on lattice-valued logic.","PeriodicalId":212172,"journal":{"name":"The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122880286","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}
引用次数: 1
Measuring interpretability in rule-based classification systems 测量基于规则的分类系统中的可解释性
Pub Date : 2003-05-25 DOI: 10.1109/FUZZ.2003.1209361
D. Nauck
The "unique selling point" of fuzzy systems is usually the interpretability of its rule base. However, very often only the accuracy of the rule base is measured and used to compare a fuzzy system to other solutions. We have suggested an index to measure the interpretability of fuzzy rule bases for classification problems. However, the index can be used to describe the interpretability of any rule-based system that uses sets to partition variables. We demonstrate the features of the index by using two data sets, one simple benchmark set and a real-world example.
模糊系统的“独特卖点”通常是其规则库的可解释性。然而,通常只测量规则库的准确性,并将其用于将模糊系统与其他解决方案进行比较。我们提出了一个指标来衡量分类问题的模糊规则库的可解释性。但是,索引可用于描述任何使用集合来划分变量的基于规则的系统的可解释性。我们通过使用两个数据集、一个简单的基准集和一个实际示例来演示索引的特性。
{"title":"Measuring interpretability in rule-based classification systems","authors":"D. Nauck","doi":"10.1109/FUZZ.2003.1209361","DOIUrl":"https://doi.org/10.1109/FUZZ.2003.1209361","url":null,"abstract":"The \"unique selling point\" of fuzzy systems is usually the interpretability of its rule base. However, very often only the accuracy of the rule base is measured and used to compare a fuzzy system to other solutions. We have suggested an index to measure the interpretability of fuzzy rule bases for classification problems. However, the index can be used to describe the interpretability of any rule-based system that uses sets to partition variables. We demonstrate the features of the index by using two data sets, one simple benchmark set and a real-world example.","PeriodicalId":212172,"journal":{"name":"The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131590079","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}
引用次数: 73
Concept-based Web communities for Google/spl trade/ search engine 基于概念的网络社区的谷歌/spl贸易/搜索引擎
Pub Date : 2003-05-25 DOI: 10.1109/FUZZ.2003.1206589
T. Tomiyama, R. Ohgaya, Akiyoshi Shimmura, T. Kawabata, T. Takagi, M. Nikravesh
The objective of this paper is to develop an intelligent computer system with some deductive capabilities to conceptually cluster, match and rank pages based on predefined linguistic formulations and rules defined by experts or based on a set of known homepages. The conceptual fuzzy set (CFS) model will be used for intelligent information and knowledge retrieval through conceptual matching of both text and links (here defined as "Concept"). The selected query doesn't need to match the decision criteria exactly, which gives the system a more human-like behavior. The model can be used for intelligent information and knowledge retrieval through Web-connectivity-based clustering.
本文的目标是开发一个具有一定演绎能力的智能计算机系统,根据专家定义的预定义语言公式和规则或基于一组已知的主页,从概念上对页面进行聚类、匹配和排序。概念模糊集(CFS)模型将通过文本和链接(这里定义为“概念”)的概念匹配,用于智能信息和知识检索。所选择的查询不需要完全匹配决策标准,这使系统的行为更像人类。该模型可用于基于web连接的聚类智能信息和知识检索。
{"title":"Concept-based Web communities for Google/spl trade/ search engine","authors":"T. Tomiyama, R. Ohgaya, Akiyoshi Shimmura, T. Kawabata, T. Takagi, M. Nikravesh","doi":"10.1109/FUZZ.2003.1206589","DOIUrl":"https://doi.org/10.1109/FUZZ.2003.1206589","url":null,"abstract":"The objective of this paper is to develop an intelligent computer system with some deductive capabilities to conceptually cluster, match and rank pages based on predefined linguistic formulations and rules defined by experts or based on a set of known homepages. The conceptual fuzzy set (CFS) model will be used for intelligent information and knowledge retrieval through conceptual matching of both text and links (here defined as \"Concept\"). The selected query doesn't need to match the decision criteria exactly, which gives the system a more human-like behavior. The model can be used for intelligent information and knowledge retrieval through Web-connectivity-based clustering.","PeriodicalId":212172,"journal":{"name":"The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121777381","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}
引用次数: 1
A fuzzy approach to find Hirschberg points and to determine fixation in digital images of infants 一种寻找赫希伯格点并确定婴儿数字图像固定的模糊方法
Pub Date : 2003-05-25 DOI: 10.1109/FUZZ.2003.1206560
T. Wang, J. Keller, G. Cibis
Screening infants for eye problems is loaded with uncertainty. Babies are unable to describe symptoms and in general may not be cooperative. In an ongoing research project, we are developing methods to screen infants for amblyopia, a common, but treatable, eye problem. The approach consists of processing a sequence of digital frames of the baby, searching for the few images where the infant "fixes" on a light positioned by the camera. Measurements made on the detected pupils are used to produce fuzzy confidence values that are fused together to create an overall confidence of fixation (the key factor in determining amblyopia). One of the most important and difficult factors in this calculation is the determination of the Hirschberg points - points of reflection of the light source off the front of the eye- if they exist at all. The criteria for detection are best thought of as fuzzy rules and methods to score potential Hirschberg points are developed. Results are shown on a variety of imagery collected in a clinical setting.
对婴儿进行眼疾筛查充满了不确定性。婴儿无法描述症状,通常可能不合作。在一项正在进行的研究项目中,我们正在开发筛查婴儿弱视的方法,弱视是一种常见但可治疗的眼疾。该方法包括处理婴儿的一系列数字帧,寻找婴儿“固定”在相机定位的光线上的少数图像。对检测到的瞳孔所做的测量被用来产生模糊的置信值,这些置信值被融合在一起,以创建固定的总体置信值(确定弱视的关键因素)。在这种计算中,最重要也是最困难的因素之一是确定赫施伯格点——光源在眼睛前部的反射点——是否存在。检测标准最好被认为是模糊规则和方法来评分潜在的赫施伯格点被开发。结果显示在临床环境中收集的各种图像。
{"title":"A fuzzy approach to find Hirschberg points and to determine fixation in digital images of infants","authors":"T. Wang, J. Keller, G. Cibis","doi":"10.1109/FUZZ.2003.1206560","DOIUrl":"https://doi.org/10.1109/FUZZ.2003.1206560","url":null,"abstract":"Screening infants for eye problems is loaded with uncertainty. Babies are unable to describe symptoms and in general may not be cooperative. In an ongoing research project, we are developing methods to screen infants for amblyopia, a common, but treatable, eye problem. The approach consists of processing a sequence of digital frames of the baby, searching for the few images where the infant \"fixes\" on a light positioned by the camera. Measurements made on the detected pupils are used to produce fuzzy confidence values that are fused together to create an overall confidence of fixation (the key factor in determining amblyopia). One of the most important and difficult factors in this calculation is the determination of the Hirschberg points - points of reflection of the light source off the front of the eye- if they exist at all. The criteria for detection are best thought of as fuzzy rules and methods to score potential Hirschberg points are developed. Results are shown on a variety of imagery collected in a clinical setting.","PeriodicalId":212172,"journal":{"name":"The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121790222","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}
引用次数: 2
A boosting algorithm with subset selection of training patterns 一种训练模式子集选择的增强算法
Pub Date : 2003-05-25 DOI: 10.1109/FUZZ.2003.1209447
T. Nakashima, G. Nakai, H. Ishibuchi
This paper proposes a boosting algorithm of fuzzy rule-based systems for pattern classification problems. In the proposed algorithm, several fuzzy rule-based classification systems are incrementally constructed from a small number of training patterns. A subset of training patterns for constructing a fuzzy rule-based classification system is chosen according to weights associated to them. The weight for a training pattern is high when it is correctly classified many times. On the other hand, a low weight is assigned to those training patterns that are misclassified many times. Training patterns with a low weight are included in a subset of training patterns for constructing a single fuzzy rule-based classification system. We select the same number of training patterns from each class so that the bias in the number of training patterns among different classes is minimized. In computer simulations, we examine the performance of the boosting algorithm for the fuzzy rule-based classification systems on several real-world pattern classification problems.
针对模式分类问题,提出了一种基于模糊规则系统的增强算法。在该算法中,基于少量训练模式的模糊规则分类系统被逐步构建。根据与训练模式相关联的权重选择训练模式子集,用于构建基于模糊规则的分类系统。当一个训练模式被多次正确分类时,它的权重就会很高。另一方面,对于那些多次被错误分类的训练模式,分配的权重较低。将低权重的训练模式包含在训练模式的子集中,用于构建单一的基于模糊规则的分类系统。我们从每个类中选择相同数量的训练模式,从而使不同类之间的训练模式数量偏差最小化。在计算机模拟中,我们研究了基于模糊规则的分类系统的增强算法在几个现实世界模式分类问题上的性能。
{"title":"A boosting algorithm with subset selection of training patterns","authors":"T. Nakashima, G. Nakai, H. Ishibuchi","doi":"10.1109/FUZZ.2003.1209447","DOIUrl":"https://doi.org/10.1109/FUZZ.2003.1209447","url":null,"abstract":"This paper proposes a boosting algorithm of fuzzy rule-based systems for pattern classification problems. In the proposed algorithm, several fuzzy rule-based classification systems are incrementally constructed from a small number of training patterns. A subset of training patterns for constructing a fuzzy rule-based classification system is chosen according to weights associated to them. The weight for a training pattern is high when it is correctly classified many times. On the other hand, a low weight is assigned to those training patterns that are misclassified many times. Training patterns with a low weight are included in a subset of training patterns for constructing a single fuzzy rule-based classification system. We select the same number of training patterns from each class so that the bias in the number of training patterns among different classes is minimized. In computer simulations, we examine the performance of the boosting algorithm for the fuzzy rule-based classification systems on several real-world pattern classification problems.","PeriodicalId":212172,"journal":{"name":"The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133975519","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
Controller synthesis of fuzzy dynamic systems based on piecewise Lyapunov functions and bilinear matrix inequalities 基于分段李雅普诺夫函数和双线性矩阵不等式的模糊动态系统控制器综合
Pub Date : 2003-05-25 DOI: 10.1109/FUZZ.2003.1206623
G. Feng
This paper presents a controller design method for fuzzy dynamic systems based on techniques of piecewise smooth Lyapunov functions and bilinear matrix inequalities. The basic idea of the proposed approaches is to construct the controller for the fuzzy dynamic systems in such a way that a piecewise continuous Lyapunov function can be used to establish the global stability of the resulting closed loop fuzzy control systems. It is shown that the control law can be obtained by solving a set of Bilinear Matrix Inequalities (BMI). An example is given to illustrate the application of the proposed method.
本文提出了一种基于分段光滑李雅普诺夫函数和双线性矩阵不等式的模糊动态系统控制器设计方法。所提出的方法的基本思想是构造模糊动态系统的控制器,使得可以使用分段连续Lyapunov函数来建立闭环模糊控制系统的全局稳定性。通过求解一组双线性矩阵不等式(BMI)得到控制律。最后通过一个算例说明了该方法的应用。
{"title":"Controller synthesis of fuzzy dynamic systems based on piecewise Lyapunov functions and bilinear matrix inequalities","authors":"G. Feng","doi":"10.1109/FUZZ.2003.1206623","DOIUrl":"https://doi.org/10.1109/FUZZ.2003.1206623","url":null,"abstract":"This paper presents a controller design method for fuzzy dynamic systems based on techniques of piecewise smooth Lyapunov functions and bilinear matrix inequalities. The basic idea of the proposed approaches is to construct the controller for the fuzzy dynamic systems in such a way that a piecewise continuous Lyapunov function can be used to establish the global stability of the resulting closed loop fuzzy control systems. It is shown that the control law can be obtained by solving a set of Bilinear Matrix Inequalities (BMI). An example is given to illustrate the application of the proposed method.","PeriodicalId":212172,"journal":{"name":"The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134554072","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}
引用次数: 111
A convex cluster merging algorithm using support vector machines 基于支持向量机的凸聚类合并算法
Pub Date : 2003-05-25 DOI: 10.1109/FUZZ.2003.1206549
F. Rhee, Byung-In Choi
In this paper, we propose a fast and reliable distance measure between two convex clusters using support vector machines (SVM). In doing so, the optimal hyperplane obtained by the SVM is used to calculate the minimal distance between the two clusters. As a result, an effective cluster merging algorithm that groups convex clusters resulted from the fuzzy convex clustering (FCC) method in is developed using this optimal distance. Hence, the number of clusters can be further reduced without losing its representation of the data. Several experimental results are given.
本文提出了一种基于支持向量机(SVM)的快速可靠的凸聚类距离度量方法。在此过程中,使用支持向量机获得的最优超平面来计算两个簇之间的最小距离。在此基础上,提出了一种有效的聚类合并算法,将模糊凸聚类(FCC)方法产生的凸聚类进行分组。因此,可以进一步减少簇的数量,而不会丢失其对数据的表示。给出了几个实验结果。
{"title":"A convex cluster merging algorithm using support vector machines","authors":"F. Rhee, Byung-In Choi","doi":"10.1109/FUZZ.2003.1206549","DOIUrl":"https://doi.org/10.1109/FUZZ.2003.1206549","url":null,"abstract":"In this paper, we propose a fast and reliable distance measure between two convex clusters using support vector machines (SVM). In doing so, the optimal hyperplane obtained by the SVM is used to calculate the minimal distance between the two clusters. As a result, an effective cluster merging algorithm that groups convex clusters resulted from the fuzzy convex clustering (FCC) method in is developed using this optimal distance. Hence, the number of clusters can be further reduced without losing its representation of the data. Several experimental results are given.","PeriodicalId":212172,"journal":{"name":"The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134571611","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
期刊
The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03.
全部 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