{"title":"An Extension to the Theory of Fuzzy Discrete Event Systems","authors":"Xinyu Du, H. Ying, F. Lin","doi":"10.1109/NAFIPS.2007.383853","DOIUrl":"https://doi.org/10.1109/NAFIPS.2007.383853","url":null,"abstract":"We originated theory of fuzzy discrete event systems (FDES) by generalizing the conventional discrete event systems so that vagueness and imprecision concerning the states and/or event transitions are more effectively dealt with. Through our experience in applying the FDES theory to HIV/AIDS prescription decision making, it become evident to us that an extended FDES theory is needed to cover diverse opinions from a group of experts and uncertainties on treatment regimens when forming state vectors and/or transition matrices. To address this problem, we now propose to use fuzzy number for each component of state vectors and/or transition matrices as opposed to a crisp number in the FDES theory. Operations of the fuzzy states and fuzzy transitions involving the fuzzy numbers are established, which is based on interval number operations. Furthermore, the parallel composition is also generalized such that a complex extended FDES can be synthesized from component models of the extended type. The extended FDES theory contains the FDES theory as a special case. A detailed numerical example is provided to illustrate the extended FDES.","PeriodicalId":292853,"journal":{"name":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126330345","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":"Approximating Infinite Solution Sets by Discretization of the Scales of Truth Degrees","authors":"R. Belohlávek, M. Krupka, Vilém Vychodil","doi":"10.1109/NAFIPS.2007.383859","DOIUrl":"https://doi.org/10.1109/NAFIPS.2007.383859","url":null,"abstract":"The present paper discusses the problem of approximating possibly infinite sets of solutions by finite sets of solutions via discretization of scales of truth degrees. Infinite sets of solutions we have in mind in this paper typically appear in constraint-based problems such as \"find all collections in a given finite universe satisfying constraint C\". In crisp setting, i.e. when collections are conceived as crisp sets, the set of all such collections is finite and often computationally tractable. In fuzzy setting, i.e. when collections are conceived as fuzzy sets, the set of all such collections may be infinite and, ipso facto, computationally intractable when one uses the unit interval [0,1] as the scale of membership degrees. A natural solution to this problem is to uses, instead of [0,1], a finite subset K of [0, 1] which approximates [0,1] to a satisfactory degree. This idea is pursued in the present paper. To be sufficiently specific, we illustrate the idea on a particular method, namely, on formal concept analysis. We present several results including estimation of degrees of similarity of the finitary approximation to the possibly infinite original case by means of the degree of approximation of if of [0, 1].","PeriodicalId":292853,"journal":{"name":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","volume":"81 2 Suppl 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126220685","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 Similarity Measure between Heterogeneous Data","authors":"M. Ionescu, A. Ralescu, S. Visa","doi":"10.1109/NAFIPS.2007.383884","DOIUrl":"https://doi.org/10.1109/NAFIPS.2007.383884","url":null,"abstract":"Evaluating the proximity measure between heterogeneous data is very important since many datasets are heterogeneous. The application of classical proximity measures must insure a consistent meaning of proximity, by providing a consistent result across any domain with any scale. This paper investigates the application of fuzzy Hamming distance as a implementation of a component-based procedure for proximity measure.","PeriodicalId":292853,"journal":{"name":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132402505","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":"Nullneurons-Based Hybrid Neurofuzzy Network","authors":"M. Hell, P. Costa, F. Gomide","doi":"10.1109/NAFIPS.2007.383860","DOIUrl":"https://doi.org/10.1109/NAFIPS.2007.383860","url":null,"abstract":"In this paper we introduce design and learning schemes for hybrid neurofuzzy networks based on nullneurons. A nullneuron is a logic neuron that performs an operation psi parameterized by u (absorbing element). The nullneuron becomes a AND neuron if u = 0 and a dual OR neuron if u = 1. The operator psi is a composition of nullnorms. Based on input-output data, the learning procedure proposed here adjusts not only the weights associated with the individual inputs of the nullneurons, but also the type of the nullneuron in the network (AND or OR) learning the value of parameter u. Adjustment of u is done individually and after learning each nullneuron can be either a AND neuron or a OR neuron, independently of the state of the remaining nullneurons. Consequently, the neurofuzzy network presented in this paper is more general than alternative approaches discussed in the literature because it embeds a set of if-then rules that uses different connectives in their antecedents. Experimental results are included to show that the neurofuzzy network proposed provides accurate models after short period of learning time.","PeriodicalId":292853,"journal":{"name":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130123176","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":"Efficient Layout of Multisensors Using Fuzzy Adaptive Genetic Algorithm","authors":"Yueh-Tsun Chang, Yo-Ping Huang, F. Sandnes","doi":"10.1109/NAFIPS.2007.383840","DOIUrl":"https://doi.org/10.1109/NAFIPS.2007.383840","url":null,"abstract":"Sensor networks have been widely applied to many fields, such as products management, museum guiding, and indoor positioning. PDAs can now be employed as a feasible companion for museum visitors. The positioning of sensors in a museum that allows suitable contents to be actively recommended to viewers in range is a practical issue that deserves investigation. In this paper, a fuzzy adaptive genetic algorithm is proposed for the layout of multisensors in a given environment. The effectiveness of the selection, mutation and crossover operators employed by conventional genetic algorithm is improved by incorporating a fuzzy mechanism. Furthermore, a new pairwise-elitist selection strategy is introduced.","PeriodicalId":292853,"journal":{"name":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131161988","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":"Interval Negation in Fuzzy Logics","authors":"Eunjin Kim, L. Kohout","doi":"10.1109/NAFIPS.2007.383897","DOIUrl":"https://doi.org/10.1109/NAFIPS.2007.383897","url":null,"abstract":"This paper continues investigation of systems of fuzzy interval logics based on the Checklist Paradigm semantics of Bandler and Kohout. The paper looks at the alternative negations that may appear in the interval system rti. In the previous papers dealing with checklist paradigm based interval systems the 2ary connectives were the interval connectives but the negation was just a point, 1 - a, not an interval. In this paper we look at genuine interval pairs of negations in system m1. We compare negations generated by the Sheffer (NAND), the Nicod (NOR) and the implication connectives. We can see that each of these connectives defines a different negation, unlike in the case of 2-valued logic.","PeriodicalId":292853,"journal":{"name":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","volume":"275 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133132732","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}
S. Dick, Andrew F. Tappenden, C. Badke, O. Olarewaju
{"title":"A Novel Granular Neural Network Architecture","authors":"S. Dick, Andrew F. Tappenden, C. Badke, O. Olarewaju","doi":"10.1109/NAFIPS.2007.383808","DOIUrl":"https://doi.org/10.1109/NAFIPS.2007.383808","url":null,"abstract":"We introduce a novel granular neural network (GNN) architecture based on the multi-layer perceptron architecture. The GNN uses linguistic terms as connection weights, and uses the operations of linguistic arithmetic to update those connection weights. The GNN has been implemented in a Java-based simulation environment, with support for both regression and classification learning tasks. We present the results of a preliminary experimental comparison between the GNN and the c4.5 decision tree algorithm on two benchmark datasets. Our results show that the GNN was slightly more accurate than c4.5 on both datasets.","PeriodicalId":292853,"journal":{"name":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124452456","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":"Graphical Tools for FID","authors":"C. Janikow, L. Finney","doi":"10.1109/NAFIPS.2007.383872","DOIUrl":"https://doi.org/10.1109/NAFIPS.2007.383872","url":null,"abstract":"FID3.2 is a public software tool for supervised classification, implementing the popular and efficient recursive partitioning technique of decision trees, while utilizing fuzzy representation and approximate reasoning for dealing with noise and language uncertainty. It is loosely based on the ID3 decision tree algorithm. It handles nominal, continuous, and linguistic attributes and classes. It can also operate with noisy and unknown features, both in training and in testing data. For continuous attributes that are not pre-partitioned, the system generates fuzzy partitioning using either a top-down or a bottom-up method. Finally, FID uses a number of inferences from two classes: set-based and exemplar-based. Recently, we have implemented a GUI interface to work with FID3.2. The interface provides graphical visualization of data, partitions, and the tree, and it also allows limited graphical manipulations. This paper describes the GUI interface.","PeriodicalId":292853,"journal":{"name":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123541744","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":"Attribute Induction in Fuzzy Databases using Fuzzy Hierarchies","authors":"Lei Zhao, F. Perry, R. Ladner","doi":"10.1109/NAFIPS.2007.383856","DOIUrl":"https://doi.org/10.1109/NAFIPS.2007.383856","url":null,"abstract":"In this paper we examine the issues involving data generalization on fuzzy information. In particular we consider how to use attribute induction on fuzzy database using a fuzzy hierarchy for the generalization.","PeriodicalId":292853,"journal":{"name":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122134745","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":"Summarizations for Annotated Objects Using Semantic Similarity and Specificity","authors":"V. Cross, Y. Sun","doi":"10.1109/NAFIPS.2007.383854","DOIUrl":"https://doi.org/10.1109/NAFIPS.2007.383854","url":null,"abstract":"The QUOTA (querying with ontological terminologies and their annotations) system is being developed so that a user may query, summarize, and filter information on objects that are annotated using a vocabulary from a terminology structured as an ontology. QUOTA integrates a variety of functionality for analyzing and comparing annotated objects into one software tool and extends and enriches this functionality by examining how similarity measures and user preference selection for coverage and specificity affect the returned results. QUOTA is being developed so that it is applicable to all domains having an ontology of annotating terms and files or databases of annotated objects. The focus in this paper is the summarization query that allows a user to enter a set of annotated objects and produces a ranked list of terms taken from the ontology. This ranked list of terms is a representative description of the set of annotated objects.","PeriodicalId":292853,"journal":{"name":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129596169","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}