Pub Date : 2002-08-07DOI: 10.1109/NAFIPS.2002.1018061
M. Farina, P. Amato
When dealing with many-criteria decision making and many-objectives optimization problems the concepts of Pareto optimality and Pareto dominance are inefficient for modelling and simulating human decision making. Different fuzzy-based definitions of optimality and dominated solution are introduced and tested on analytical test cases in order to show their validity and closeness to human decision making.
{"title":"On the optimal solution definition for many-criteria optimization problems","authors":"M. Farina, P. Amato","doi":"10.1109/NAFIPS.2002.1018061","DOIUrl":"https://doi.org/10.1109/NAFIPS.2002.1018061","url":null,"abstract":"When dealing with many-criteria decision making and many-objectives optimization problems the concepts of Pareto optimality and Pareto dominance are inefficient for modelling and simulating human decision making. Different fuzzy-based definitions of optimality and dominated solution are introduced and tested on analytical test cases in order to show their validity and closeness to human decision making.","PeriodicalId":348314,"journal":{"name":"2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115308893","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 : 2002-08-07DOI: 10.1109/NAFIPS.2002.1018034
M. Somodevilla, F. Petry, H. Foley
Describes a framework for developing the integration of multiple single theme datasets (maps). The novelty of this approach is that it is based on spatial data mining, in particular on spatial association rules. A spatial association rule is a rule indicating certain association relationships among of a set of spatial and possibly some non-spatial predicates. Prior to the generation of the association rules, the source maps are represented in a common vector structure. Spatial hierarchies are defined to determine the characteristics of the features belonging to distinct classes. A distance restriction to limit the search space is specified as a part of the user query. Structure, levels of abstraction and reduction of the space guarantee the use of only the necessary data to answer the user query. A characterization of the uncertainty in the fused map is given as the measure of correction of the framework.
{"title":"Discovering spatial relationships in geographic information databases for geodatasets integration","authors":"M. Somodevilla, F. Petry, H. Foley","doi":"10.1109/NAFIPS.2002.1018034","DOIUrl":"https://doi.org/10.1109/NAFIPS.2002.1018034","url":null,"abstract":"Describes a framework for developing the integration of multiple single theme datasets (maps). The novelty of this approach is that it is based on spatial data mining, in particular on spatial association rules. A spatial association rule is a rule indicating certain association relationships among of a set of spatial and possibly some non-spatial predicates. Prior to the generation of the association rules, the source maps are represented in a common vector structure. Spatial hierarchies are defined to determine the characteristics of the features belonging to distinct classes. A distance restriction to limit the search space is specified as a part of the user query. Structure, levels of abstraction and reduction of the space guarantee the use of only the necessary data to answer the user query. A characterization of the uncertainty in the fused map is given as the measure of correction of the framework.","PeriodicalId":348314,"journal":{"name":"2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124407089","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 : 2002-08-07DOI: 10.1109/NAFIPS.2002.1018084
R. Aló, A. de Korvin, François Modave
In decision under uncertainty, we aim at finding a scoring procedure to determine an optimal decision without prior knowledge on the actual state of the world. It is well known that the probability approach to this problem leads to paradoxes, that are related to independence properties required on the preferences. This naturally leads us to drop additivity and therefore, replace probabilities with fuzzy measures. The aim of this paper is to present several benefit functions to identify optimal actions, in the fuzzy measure and fuzzy logic perspective.
{"title":"Fuzzy functions to select an optimal action in decision theory","authors":"R. Aló, A. de Korvin, François Modave","doi":"10.1109/NAFIPS.2002.1018084","DOIUrl":"https://doi.org/10.1109/NAFIPS.2002.1018084","url":null,"abstract":"In decision under uncertainty, we aim at finding a scoring procedure to determine an optimal decision without prior knowledge on the actual state of the world. It is well known that the probability approach to this problem leads to paradoxes, that are related to independence properties required on the preferences. This naturally leads us to drop additivity and therefore, replace probabilities with fuzzy measures. The aim of this paper is to present several benefit functions to identify optimal actions, in the fuzzy measure and fuzzy logic perspective.","PeriodicalId":348314,"journal":{"name":"2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114673212","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 : 2002-08-07DOI: 10.1109/NAFIPS.2002.1018112
K. Kawase, T. Takagi
We consider the expression and recognition of dynamic concepts by regarding the movement patterns learned in a recurrent neural net as symbols. We then develop a method to express more abstract dynamic concepts by combining them with symbols and connecting several recurrent neural networks. Application of the method to actual recognition cases, ball bouncing and dancing, demonstrated its effectiveness. These experiments show the ability of the method to deal with dynamic concepts that are difficult to describe because of vagueness.
{"title":"A trial to represent dynamic concepts","authors":"K. Kawase, T. Takagi","doi":"10.1109/NAFIPS.2002.1018112","DOIUrl":"https://doi.org/10.1109/NAFIPS.2002.1018112","url":null,"abstract":"We consider the expression and recognition of dynamic concepts by regarding the movement patterns learned in a recurrent neural net as symbols. We then develop a method to express more abstract dynamic concepts by combining them with symbols and connecting several recurrent neural networks. Application of the method to actual recognition cases, ball bouncing and dancing, demonstrated its effectiveness. These experiments show the ability of the method to deal with dynamic concepts that are difficult to describe because of vagueness.","PeriodicalId":348314,"journal":{"name":"2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622)","volume":"203 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115188802","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 : 2002-08-07DOI: 10.1109/NAFIPS.2002.1018090
Aziz Sözer, Adnan Yazici
Spatial data are complex and have spatial components and uncertain properties. It is important to develop effective spatial and aspatial indexing techniques to facilitate spatial and/or aspatial querying for databases that deal with spatial data In this study we discuss a number of spatial index structures, such as Multi-level grid file (MLGF), R-tree, and R*-tree, for fuzzy spatial and/or aspatial queries.
{"title":"Access structures for fuzzy spatial queries","authors":"Aziz Sözer, Adnan Yazici","doi":"10.1109/NAFIPS.2002.1018090","DOIUrl":"https://doi.org/10.1109/NAFIPS.2002.1018090","url":null,"abstract":"Spatial data are complex and have spatial components and uncertain properties. It is important to develop effective spatial and aspatial indexing techniques to facilitate spatial and/or aspatial querying for databases that deal with spatial data In this study we discuss a number of spatial index structures, such as Multi-level grid file (MLGF), R-tree, and R*-tree, for fuzzy spatial and/or aspatial queries.","PeriodicalId":348314,"journal":{"name":"2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116543876","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 : 2002-08-07DOI: 10.1109/NAFIPS.2002.1018124
A. Morris, A. Steele
FuzzyCLIPS has been used in several commercial systems to allow for a rule based expert system shell that will also provide fuzzy reasoning capability. We discuss the use of FuzzyCLIPS and neuro-fuzzy term rewriting to define the network model in the distribution management system (DMS) for the Indonesian State Power system (PLN). Although, DMS is currently implemented by a mixed CLIPS/C++ system, the rules defining the behavior of the system are developed using the framework of object-oriented term-rewriting (OOTR) to guarantee the asynchronous characteristics of the program's execution. Another advantage of using OOTR is that we describe both the power propagation in the network and the alarm conditions, which have to be monitored in a uniform fashion. We show how implementing a fuzzy solution will not only provide a more intuitive approach to the propagation problem, but also a more accurate solution.
{"title":"FuzzyCLIPS and neuro-fuzzy term rewriting for power network control","authors":"A. Morris, A. Steele","doi":"10.1109/NAFIPS.2002.1018124","DOIUrl":"https://doi.org/10.1109/NAFIPS.2002.1018124","url":null,"abstract":"FuzzyCLIPS has been used in several commercial systems to allow for a rule based expert system shell that will also provide fuzzy reasoning capability. We discuss the use of FuzzyCLIPS and neuro-fuzzy term rewriting to define the network model in the distribution management system (DMS) for the Indonesian State Power system (PLN). Although, DMS is currently implemented by a mixed CLIPS/C++ system, the rules defining the behavior of the system are developed using the framework of object-oriented term-rewriting (OOTR) to guarantee the asynchronous characteristics of the program's execution. Another advantage of using OOTR is that we describe both the power propagation in the network and the alarm conditions, which have to be monitored in a uniform fashion. We show how implementing a fuzzy solution will not only provide a more intuitive approach to the propagation problem, but also a more accurate solution.","PeriodicalId":348314,"journal":{"name":"2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128489567","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 : 2002-08-07DOI: 10.1109/NAFIPS.2002.1018027
D. Meng, Yang Xu, K. Qin
In the present paper the algorithm of transforming any formula in LP(X) to a pure-generalized conjunction normal form is focused. Concretely, some important concepts and results about lattice implication algebra (LIA), lattice-valued prepositional logic LP(X) and resolution principle based on LP(X) are introduced firstly. Then algorithm of transforming any implication term to a reducible form is considered. Finally, the method of transforming any formula F in LP(X) to a pure-generalized conjunction normal form is given.
{"title":"Algorithm of transforming any formula in LP(X) to a pure-generalized conjunction normal form","authors":"D. Meng, Yang Xu, K. Qin","doi":"10.1109/NAFIPS.2002.1018027","DOIUrl":"https://doi.org/10.1109/NAFIPS.2002.1018027","url":null,"abstract":"In the present paper the algorithm of transforming any formula in LP(X) to a pure-generalized conjunction normal form is focused. Concretely, some important concepts and results about lattice implication algebra (LIA), lattice-valued prepositional logic LP(X) and resolution principle based on LP(X) are introduced firstly. Then algorithm of transforming any implication term to a reducible form is considered. Finally, the method of transforming any formula F in LP(X) to a pure-generalized conjunction normal form is given.","PeriodicalId":348314,"journal":{"name":"2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130675888","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 : 2002-08-07DOI: 10.1109/NAFIPS.2002.1018069
R. Ohgaya, T. Takagi, K. Fukano, K. Taniguchi, A. Aizawa, M. Nikravesh
In this paper, we propose a menu navigation system which conceptually matches input keywords and paths. For conceptual matching, we use conceptual fuzzy sets (CFSs) based on radial basis function (RBF) networks. In a CFS, the meaning of a concept is represented by the distribution of the activation values of the other concepts. To expand input keywords the propagation of activation values is carried out recursively. The proposed system recommends users paths to appropriate categories. We use 3D user interface to navigate users.
{"title":"Conceptual fuzzy sets-based navigation system for Yahoo!","authors":"R. Ohgaya, T. Takagi, K. Fukano, K. Taniguchi, A. Aizawa, M. Nikravesh","doi":"10.1109/NAFIPS.2002.1018069","DOIUrl":"https://doi.org/10.1109/NAFIPS.2002.1018069","url":null,"abstract":"In this paper, we propose a menu navigation system which conceptually matches input keywords and paths. For conceptual matching, we use conceptual fuzzy sets (CFSs) based on radial basis function (RBF) networks. In a CFS, the meaning of a concept is represented by the distribution of the activation values of the other concepts. To expand input keywords the propagation of activation values is carried out recursively. The proposed system recommends users paths to appropriate categories. We use 3D user interface to navigate users.","PeriodicalId":348314,"journal":{"name":"2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114835159","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 : 2002-08-07DOI: 10.1109/NAFIPS.2002.1018051
Jiexun Li, Guoqing Chen
Association rule mining is one of the most important fields in data mining. Rules explosion is a problem of concern, as conventional mining algorithms often produce too many rules for decision makers to digest. This paper discusses how to mine interesting rules with the antecedent constraint being positively associated with the consequent. Notions of simple association rules (SAR), interestingness measures and antecedent constraints are incorporated in the process of interesting rules discovery. The entire set of interesting rules can be derived from the simple rules without any information loss, and the proposed SAR-based mining algorithm performs better than conventional methods by reducing the number of candidate rules.
{"title":"A SAR-based interesting rule mining algorithm","authors":"Jiexun Li, Guoqing Chen","doi":"10.1109/NAFIPS.2002.1018051","DOIUrl":"https://doi.org/10.1109/NAFIPS.2002.1018051","url":null,"abstract":"Association rule mining is one of the most important fields in data mining. Rules explosion is a problem of concern, as conventional mining algorithms often produce too many rules for decision makers to digest. This paper discusses how to mine interesting rules with the antecedent constraint being positively associated with the consequent. Notions of simple association rules (SAR), interestingness measures and antecedent constraints are incorporated in the process of interesting rules discovery. The entire set of interesting rules can be derived from the simple rules without any information loss, and the proposed SAR-based mining algorithm performs better than conventional methods by reducing the number of candidate rules.","PeriodicalId":348314,"journal":{"name":"2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124317958","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 : 2002-08-07DOI: 10.1109/NAFIPS.2002.1018072
François Modave, V. Kreinovich
The aim of this paper is to shed light on the use of fuzzy measures and integrals as aggregation operators in multicriteria decision making. These techniques have been widely used on an ad hoc basis, but with no axiomatization. It is possible to obtain preference representation theorems in multicriteria decision making problems, relying on a formal parallelism between decision under uncertainty and multicriteria decision making. Though, it raises some commensurability problems. In this paper, we show how to obtain an axiomatization of multicriteria decision making problems, in a very natural way, and we show how to solve the commensurability problem in a particular case.
{"title":"Fuzzy measures and integrals as aggregation operators: solving the commensurability problem","authors":"François Modave, V. Kreinovich","doi":"10.1109/NAFIPS.2002.1018072","DOIUrl":"https://doi.org/10.1109/NAFIPS.2002.1018072","url":null,"abstract":"The aim of this paper is to shed light on the use of fuzzy measures and integrals as aggregation operators in multicriteria decision making. These techniques have been widely used on an ad hoc basis, but with no axiomatization. It is possible to obtain preference representation theorems in multicriteria decision making problems, relying on a formal parallelism between decision under uncertainty and multicriteria decision making. Though, it raises some commensurability problems. In this paper, we show how to obtain an axiomatization of multicriteria decision making problems, in a very natural way, and we show how to solve the commensurability problem in a particular case.","PeriodicalId":348314,"journal":{"name":"2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127765795","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
扫码关注我们
求助内容：
应助结果提醒方式：