{"title":"At the crossroads of database systems and fuzzy sets","authors":"P. Bosc, O. Pivert","doi":"10.1109/NAFIPS.2001.944396","DOIUrl":"https://doi.org/10.1109/NAFIPS.2001.944396","url":null,"abstract":"Research activities on fuzzy sets and databases began more or less at the same time, about thirty years ago. Outstanding results have been reached in each of these areas, among which numerous systems and products used in practical applications. However, one can notice that the interaction level between the two domains remains low despite i) the potential complementarity of the topics dealt with in each area and ii) the research activity deployed by some groups along the theme usually called \"fuzzy databases\". This paper offers a good opportunity to point out important lines of research investigated by the fuzzy database community during the past years and to focus on some current trends through a collection of presentations made by invited speakers.","PeriodicalId":227374,"journal":{"name":"Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122424418","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":"Probability-possibility transformation based on evidence theory","authors":"K. Yamada","doi":"10.1109/NAFIPS.2001.944229","DOIUrl":"https://doi.org/10.1109/NAFIPS.2001.944229","url":null,"abstract":"The transformation between probability and possibility has been studied by many researchers. Most of those studies examined the principles that must be satisfied for the transformation, and devised an equation satisfying them in a heuristic way. They did not show that the proposed transformation was the only one satisfying the principles. The paper devises three new transformation methods based on evidence theory. Each starts from some principles in the same way as the previous research, but finds the only transformation satisfying the principles. One of them considers that possibility is an ordinal scale of uncertainty, and obtains the possibilistic order from a given probability distribution. The remaining two regard possibility as a ratio scale, and transforms a probability distribution into a possibility distribution. All of the three generate the same ordinal structure of possibility. However, two of them generate different possibility distributions. Thus, the paper examines which of the two is more valid from the point of view of the given principles.","PeriodicalId":227374,"journal":{"name":"Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569)","volume":"734 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122975624","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":"An efficient clustering algorithm for mining fuzzy quantitative association rules","authors":"Been-Chian Chien, Zin Lin, T. Hong","doi":"10.1109/NAFIPS.2001.943736","DOIUrl":"https://doi.org/10.1109/NAFIPS.2001.943736","url":null,"abstract":"Mining association rules on categorical data has been discussed widely. It is a relatively difficult problem in the discovery of association rules from numerical data, since the reasonable intervals for unknown numerical attributes or quantitative data may not be discriminated easily. We propose an efficient hierarchical clustering algorithm based on variation of density to solve the problem of interval partition. We define two main characteristics of clustering numerical data: relative inter-connectivity and relative closeness. By giving a proper parameter, /spl alpha/, to determine the importance between relative closeness and relative inter-connectivity, the proposed approach can generate a reasonable interval automatically for the user. The experimental results show that the proposed clustering algorithm can have good performance on both clustering results and speed.","PeriodicalId":227374,"journal":{"name":"Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569)","volume":"230 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114160455","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":"Transitivity-related properties of fuzzy strict preference relations","authors":"Xuzhu Wang","doi":"10.1109/NAFIPS.2001.944282","DOIUrl":"https://doi.org/10.1109/NAFIPS.2001.944282","url":null,"abstract":"Given a fuzzy relation, S. Ovchinnikov and M. Roubens (1991) introduce a very general definition of fuzzy strict preference. The author investigates its transitivity-related properties including weak transitivity, consistency, acyclicity, etc.","PeriodicalId":227374,"journal":{"name":"Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121872950","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":"A generic algorithm for fuzzy constraint satisfaction problems","authors":"P. Hsu, R. Lai","doi":"10.1109/NAFIPS.2001.944700","DOIUrl":"https://doi.org/10.1109/NAFIPS.2001.944700","url":null,"abstract":"In this paper, we present a generic algorithm of solving a fuzzy constraint satisfaction problem (CSP) based on the notion of an adaptive level cut: the essence of our algorithm is to apply local propagation for solving different level-cut CSPs. The task mainly involves repair operations to speed up the fuzzified local propagation by reusing as much of the computational effort from the previous level-cut as possible. Besides dealing with constraints in a discrete domain, the algorithm can also be extended to handle constraints in a continuous domain, based on the idea of interval-based reasoning.","PeriodicalId":227374,"journal":{"name":"Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122044359","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":"Car image recognition with lacked input data","authors":"Y. Arai, K. Hirota","doi":"10.1109/NAFIPS.2001.943626","DOIUrl":"https://doi.org/10.1109/NAFIPS.2001.943626","url":null,"abstract":"A car type recognition system, using methods of the R&FHPR/FF (Rough and Fuzzy Hierarchical Pattern Recognition using Fixation Feedback), infer just about correctly based on precise input data. Although, it is difficult, features are extracted completely in general using image processing methods. For systems using fuzzy inference, if input datum is lacking, the system does not work well. A framework of a modified fuzzy inference method with lacking input data is introduced. Experimental results are provided. In the proposed method which is modified from A. Mamdani's (1975) fuzzy inference, the result of each rule is the adjustment for the purpose of protection from the influence of lacking input data. The adjustment of the resulting fuzzy labels at each rule uses the degree of importance which is set up in the rules manually. In the experimental results, the system can infer well with lacking input data using this method. The experiments used a set of eight fuzzy rules (five input and eight output), and when all combinations of input data are lacking, the system infers so correctly.","PeriodicalId":227374,"journal":{"name":"Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116620344","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":"Incremental best estimate directed search - a case study for symmetrical systems","authors":"F. Song, S.M. Smith","doi":"10.1109/NAFIPS.2001.944702","DOIUrl":"https://doi.org/10.1109/NAFIPS.2001.944702","url":null,"abstract":"This paper studies the performance of an incremental best-estimate-directed search (IBEDS) for symmetrical systems. IBEDS is a bootstrappable search algorithm designed for controller optimization. The idea is to make the training set and the rule base symmetric. By doing so, the the searching of IBEDS is expedited. The presented simulation results justify the method.","PeriodicalId":227374,"journal":{"name":"Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116741510","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":"Fuzzy disjunctive and conjunctive canonical forms: a foundation for interval-valued fuzzy techniques","authors":"1.BURHAN Turksen","doi":"10.1109/NAFIPS.2001.944440","DOIUrl":"https://doi.org/10.1109/NAFIPS.2001.944440","url":null,"abstract":"Fuzzy disjunctive and conjunctive canonical forms, FDCF, and FCCF, respectively, should be used as a foundation for interval-valued approximate reasoning. It has been shown that in the combination of linguistic concepts, membership values generated by linguistic operators, \"AND\", \"OR\", \"IMP\", etc., as opposed to crisp connectives that are known as t-norms and t-conorms and standard negation, are computed with fuzzy disjunctive and conjunctive canonical forms, FDCF and FCCF, respectively. Approximate reasoning computed with these forms reveals the information content available in information granules, as well as exposing the uncertainty and risk represented with the gradation between the lower and the upper membership degrees.","PeriodicalId":227374,"journal":{"name":"Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128545213","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":"Genetic programming for life-time learning of a mobile robot","authors":"N. Kubota, S. Hashimoto, F. Kojima","doi":"10.1109/NAFIPS.2001.944452","DOIUrl":"https://doi.org/10.1109/NAFIPS.2001.944452","url":null,"abstract":"The paper deals with a mobile robot with structured intelligence. The robot interacts with a dynamic environment. The evaluation criteria or functions are the strategy for the behavior acquisition. Generally, it is difficult for human operators to describe the internal models of the robot because the organization of the robot is quite different from that of a human. In the optimization, the evaluation function is generally given by human operators beforehand. It is easy to give the evaluation functions if the environmental condition is easy and fixed, but the robot must interact with dynamic, uncertain and unknown environments or human operators. Therefore, the robot should generate the evaluation criteria by itself based on its embodiment. A human improves its behavior by using and changing its evaluation criteria as adaptive processes. The robot also has to acquire their evaluation criteria through life-time learning. Therefore, we apply genetic programming (GP) for generating evaluation functions. The result of computer simulation shows that GP can generate the evaluation function suitable for the applicable environments, the given tasks, and the robot.","PeriodicalId":227374,"journal":{"name":"Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124671367","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":"A study on the self-organizing polynomial neural networks","authors":"Sung-Kwun Oh, T. Ahn, W. Pedrycz","doi":"10.1109/NAFIPS.2001.943806","DOIUrl":"https://doi.org/10.1109/NAFIPS.2001.943806","url":null,"abstract":"We introduce and investigate a class of neural architectures of polynomial neural networks (PNNs), discuss a comprehensive design methodology and carry out a series of numeric experiments. PNN is a flexible neural architecture whose topology is developed through learning; it is a self-organizing network. PNN has two kinds of networks, polynomial neuron-based and fuzzy polynomial neuron (FPN)-based networks, according to a polynomial structure. The essence of the design procedure of PN-based self-organizing polynomial neural networks(SOPNN) dwells on the group method of data handling. Each node of the SOPNN exhibits a high level of flexibility and realizes a polynomial type of mapping (linear, quadratic, and cubic) between input and output variables. FPN-based SOPNN dwells on the ideas of fuzzy rule-based computing and neural networks. Simulations involve a series of synthetic as well as experimental data used across various neuro-fuzzy systems. A detailed comparative analysis is also included.","PeriodicalId":227374,"journal":{"name":"Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125125698","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}