5,590 research outputs found
Super Fuzzy Matrices and Super Fuzzy Models for Social Scientists
This book introduces the concept of fuzzy super matrices and operations on
them. This book will be highly useful to social scientists who wish to work
with multi-expert models. Super fuzzy models using Fuzzy Cognitive Maps, Fuzzy
Relational Maps, Bidirectional Associative Memories and Fuzzy Associative
Memories are defined here. The authors introduce 13 multi-expert models using
the notion of fuzzy supermatrices. These models are described with illustrative
examples. This book has three chapters. In the first chaper, the basic concepts
about super matrices and fuzzy super matrices are recalled. Chapter two
introduces the notion of fuzzy super matrices adn their properties. The final
chapter introduces many super fuzzy multi expert models.Comment: 280 page
A novel approach for ANFIS modelling based on Grey system theory for thermal error compensation
The fast and accurate modelling of thermal errors in machining is an important aspect for the implementation of thermal error compensation. This paper presents a novel modelling approach for thermal error compensation on CNC machine tools. The method combines the Adaptive Neuro Fuzzy Inference System (ANFIS) and Grey system theory to predict thermal errors in machining. Instead of following a traditional approach, which utilises original data patterns to construct the ANFIS model, this paper proposes to exploit Accumulation Generation Operation (AGO) to simplify the modelling procedures. AGO, a basis of the Grey system theory, is used to uncover a development tendency so that the features and laws of integration hidden in the chaotic raw data can be sufficiently revealed. AGO properties make it easier for the proposed model to design and predict. According to the simulation results, the proposed model demonstrates stronger prediction power than standard ANFIS model only with minimum number of training samples
AsterixDB: A Scalable, Open Source BDMS
AsterixDB is a new, full-function BDMS (Big Data Management System) with a
feature set that distinguishes it from other platforms in today's open source
Big Data ecosystem. Its features make it well-suited to applications like web
data warehousing, social data storage and analysis, and other use cases related
to Big Data. AsterixDB has a flexible NoSQL style data model; a query language
that supports a wide range of queries; a scalable runtime; partitioned,
LSM-based data storage and indexing (including B+-tree, R-tree, and text
indexes); support for external as well as natively stored data; a rich set of
built-in types; support for fuzzy, spatial, and temporal types and queries; a
built-in notion of data feeds for ingestion of data; and transaction support
akin to that of a NoSQL store.
Development of AsterixDB began in 2009 and led to a mid-2013 initial open
source release. This paper is the first complete description of the resulting
open source AsterixDB system. Covered herein are the system's data model, its
query language, and its software architecture. Also included are a summary of
the current status of the project and a first glimpse into how AsterixDB
performs when compared to alternative technologies, including a parallel
relational DBMS, a popular NoSQL store, and a popular Hadoop-based SQL data
analytics platform, for things that both technologies can do. Also included is
a brief description of some initial trials that the system has undergone and
the lessons learned (and plans laid) based on those early "customer"
engagements
A Divide-and-Conquer Approach for Solving Fuzzy Max-Archimedean t
A system of fuzzy relational equations with the max-Archimedean t-norm composition was considered. The relevant literature indicated that this problem can be reduced to the problem of finding all the irredundant coverings of a binary matrix. A divide-and-conquer approach is proposed to solve this problem and, subsequently, to solve the original problem. This approach was used to analyze the binary matrix and then decompose the matrix into several submatrices such that the irredundant coverings of the original matrix could be constructed using the irredundant coverings of each of these submatrices. This step was performed recursively for each of these submatrices to obtain the irredundant coverings. Finally, once all the irredundant coverings of the original matrix were found, they were easily converted into the minimal solutions of the fuzzy relational equations. Experiments on binary matrices, with the number of irredundant coverings ranging from 24 to 9680, were also performed. The results indicated that, for test matrices that could initially be partitioned into more than one submatrix, this approach reduced the execution time by more than three orders of magnitude. For the other test matrices, this approach was still useful because certain submatrices could be partitioned into more than one submatrix
Fuzzy-Granular Based Data Mining for Effective Decision Support in Biomedical Applications
Due to complexity of biomedical problems, adaptive and intelligent knowledge discovery and data mining systems are highly needed to help humans to understand the inherent mechanism of diseases. For biomedical classification problems, typically it is impossible to build a perfect classifier with 100% prediction accuracy. Hence a more realistic target is to build an effective Decision Support System (DSS). In this dissertation, a novel adaptive Fuzzy Association Rules (FARs) mining algorithm, named FARM-DS, is proposed to build such a DSS for binary classification problems in the biomedical domain. Empirical studies show that FARM-DS is competitive to state-of-the-art classifiers in terms of prediction accuracy. More importantly, FARs can provide strong decision support on disease diagnoses due to their easy interpretability. This dissertation also proposes a fuzzy-granular method to select informative and discriminative genes from huge microarray gene expression data. With fuzzy granulation, information loss in the process of gene selection is decreased. As a result, more informative genes for cancer classification are selected and more accurate classifiers can be modeled. Empirical studies show that the proposed method is more accurate than traditional algorithms for cancer classification. And hence we expect that genes being selected can be more helpful for further biological studies
Identification of Evolving Rule-based Models.
An approach to identification of evolving fuzzy rule-based (eR) models is proposed. eR models implement a method for the noniterative update of both the rule-base structure and parameters by incremental unsupervised learning. The rule-base evolves by adding more informative rules than those that previously formed the model. In addition, existing rules can be replaced with new rules based on ranking using the informative potential of the data. In this way, the rule-base structure is inherited and updated when new informative data become available, rather than being completely retrained. The adaptive nature of these evolving rule-based models, in combination with the highly transparent and compact form of fuzzy rules, makes them a promising candidate for modeling and control of complex processes, competitive to neural networks. The approach has been tested on a benchmark problem and on an air-conditioning component modeling application using data from an installation serving a real building. The results illustrate the viability and efficiency of the approach. (c) IEEE Transactions on Fuzzy System
- …