Generating weighted fuzzy rules from relational database systems for estimating values using genetic algorithms

In recent years, some methods have been proposed to estimate values in relational database systems. However, the estimated accuracy of the existing methods are not good enough. In this paper, we present a new method to generate weighted fuzzy rules from relational database systems for estimating values using genetic algorithms (GAs), where the attributes appearing in the antecedent part of generated fuzzy rules have different weights. After a predefined number of evolutions of the GA, the best chromosome contains the optimal weights of the attributes, and they can be translated into a set of rules to be used for estimating values. The proposed method can get a higher average estimated accuracy rate than the methods we presented in two previous papers.     

GENERATING FUZZY RULES FROM RELATIONAL DATABASE SYSTEMS FOR ESTIMATING NULL VALUES

This paper presents a new algorithm for constructing fuzzy decision trees from relational database systems and generating fuzzy rules from the constructed fuzzy decision trees. We also present a method for dealing with the completeness of the constructed fuzzy decision trees. Based on the generated fuzzyrules, we also present a method for estimating null values in relational database systems. The proposed methods provide a useful way to estimate null values in relational database systems.     

A NEW METHOD TO GENERATE FUZZY RULES FROM RELATIONAL DATABASE SYSTEMS FOR ESTIMATING NULL VALUES

Fuzzy decision trees can be used to generate fuzzy rules from training instances to deal with forecasting and classification problems. We propose a new method to construct fuzzy decision trees from relational database systems and to generate fuzzy rules from the constructed fuzzy decision trees for estimating null values, where the weights of attributes are used to derive the values of certainty factors of the generated fuzzy rules. We use the concept of "coefficient of determination" of the statistics to derive the weights of the attributes in relational database systems and use the normalized weights of the attributes to derive the values of certainty factors of the generated fuzzy rules. Furthermore, we also use regression equations of the statistics to construct a complete fuzzy decision tree for generating better fuzzy rules. The proposed method obtains a higher average estimated accuracy rate than the existing methods for estimating null values in relational database systems.     

An efficient method for estimating null values in relational databases

Generally, a database system containing null value attributes will not operate properly. This study proposes an efficient and systematic approach for estimating null values in a relational database which utilizes clustering algorithms to cluster data, and a regression coefficient to determine the degree of influence between different attributes. Two databases are used to verify the proposed method: (1) Human resource database; and (2) Waugh's database. Furthermore, the mean of absolute error rate (MAER) and average error are used as evaluation criteria to compare the proposed method with other methods. It demonstrates that the proposed method is superior to existing methods for estimating null values in relational database systems. Jia-Wen Wang was born on September 5, 1978, in Taipei, Taiwan, Republic of China. She received the M.S. degree in information management from the National Yunlin University of Science and Technology, Yunlin, Taiwan, in 2003. Since 2003, she has been a PhD degree student in Information Management Department at the National Yunlin University of Science and Technology. Her current research interests include fuzzy systems, database systems, and artificial intelligence. Ching-Hsue Cheng received the B.S. degree in mathematics from Chinese Military Academy, Taiwan, in 1982, the M.S. degree in applied mathematics from the Chung Yuan Christian University, Taiwan, in 1988, and the Ph.D. degree in system engineering and management from National Defence University, Taiwan, in 1994. Currently, he is a professor of the Department of Information Management, National YunLin University of Technology & Science. His research interests are in decision science, soft computing, software reliability, performance evaluation, and fuzzy time series. He has published more than 120 refereed papers in these areas. He has been a principal investigator and project leader in a number of projects with government, and other research-sponsoring agencies.     

Estimating null values in relational database systems using automatic clustering and multiple regression techniques

In this paper, we present a new method for estimating null values in relational database systems using automatic clustering and multiple regression techniques. First, we present a new automatic clustering algorithm for clustering numerical data. The proposed automatic clustering algorithm does not need to determine the number of clusters in advance and does not need to sort the data in the database in advance. Then, based on the proposed automatic clustering algorithm and multiple regression techniques, we present a new method to estimate null values in relational database systems. The proposed method estimating null values in relational database systems only needs to process a particular cluster instead of the whole database. It gets a higher average estimation accuracy rate than the existing methods for estimating null values in relational database systems.     

ESTIMATING NULL VALUES IN THE DISTRIBUTED RELATIONAL DATABASES ENVIRONMENT

To estimate nullvalues in relational database systems is an important research topic. In Chen and Yeh (1997) a method for estimating null values in relational database systems was presented. In Chen and Chen (1997) a method for fuzzy query translation for information in the distributed relational databases environment was presented. In this article, the works of Chen and Chen (1997) and Chen and Yeh (1997) are extended to propose a method for estimating null values in the distributed relational databases environment. The proposed method provides a useful way to estimate incomplete data when the relations stored in a failed server cannot be accessed in the distributed relational databases environment.     

A new approach for estimating null value in relational database

In general, a database system will not operate properly if it exist some null values of attributes in the system. In this paper, we propose a new approach to estimate null values in relational database, which utilize other clustering algorithm to cluster data, and use fuzzy correlation and distance similarity to calculate the correlation of different attribute. For verifying our method, this paper utilize mean of absolute error rate (MAER) as evaluation criterion to compare with other methods; it is shown that our proposed method proves importance than the existing methods for estimating null values in relational database systems.     

Functional dependencies with null values, fuzzy values, and crispvalues

Based on the concepts of the semantic proximity, we present a definition of the fuzzy functional dependency, We show that the inference rules for fuzzy functional dependencies, which are the same as Armstrong's axioms for the crisp case, are correct and complete. We also show that dependent constraints with dull values constitute a lattice. Functional dependencies in classical relational databases and null functional dependencies can be viewed as a special case of fuzzy functional dependencies. By applying the unified functional dependencies to the relational database design, we can represent the data with fuzzy values, null values and crisp values under relational database management systems, By using fuzzy functional dependencies, we can compress the range of a fuzzy value and make this fuzzy value “clearer”     

A new method to estimate null values in relational database systems based on automatic clustering techniques

In this paper, we present a new method for estimating null values in relational database systems based on automatic clustering techniques. The proposed method clusters data in advance, such that it only needs to process the most proper clusters instead of all the data in the relational database system for estimating null values. The average estimated accuracy rate of the proposed method is better than the existing methods for estimating null values in relational database systems.     

区间值关系数据库上模糊关联规则的预测方法

讨论了区间值关系数据库上模糊关联规则的挖掘算法与预测方法。采用一种比RFCM算法省时的FCMdd算法将记录在属性的取值划分成若干个模糊集,并提出区间值关系数据库上模糊关联规则的挖掘算法。仿真实例说明挖掘算法能够通过挖掘有意义的模糊关联规则来发现区间值关系数据库中蕴涵的关联性。区间值关系数据库上模糊关联规则的预测方法改进了标准可加性模型,并通过遗传算法调整模糊关联规则中三角模糊数的参数来提高预测的精度。     

Training fuzzy logic based software components by combining adaptation algorithms

 A training framework of an effective method for off-line training of a class of control software components (e.g., for first-order nonlinear feedback control systems) using combinations of three kinds of adaptation algorithms is presented. Each control software component is represented at the abstract level by means of a set of adaptive fuzzy logic (FL) rules and at the concrete level by means of fuzzy membership functions (MBFs). At the concrete representation level adaptation algorithms specified for use in adapting MBFs are: genetic algorithms, neural net algorithms, and Monte Carlo algorithms. We specify effective combinations of these three existing adaptation algorithms to train a faulty FL rule-based software component for the tracker problem. In the framework, training consists of two phases: testing and adapting. In the testing phase, a test driver generates an effective fault scenario ( fs) and locates the faulty fuzzy elements (FFEs) by using each or a combination of three adaptation algorithms. In the adapting phase, for each fault scenario adaptation algorithms and their combinations are used to modify the MBFs of the component. Effectiveness of the two phase training is determined in terms of testability, flexibility, adaptability, and stability. An initial design of the simulation environment is presented. In the experiment, for a given circumstance (environment and fuzzy rules) we apply a combination of a genetic algorithm GA) and a neural network (NN) with an error back-propagation algorithm (BP) in the testing phase for generating fault scenarios. Then we apply GA-only method in the adapting phase for adapting the faulty software component. Simulation results on effectiveness and efficiency are discussed.     

Extraction and optimization of fuzzy association rules using multi-objective genetic algorithm

Association Rule Mining is one of the important data mining activities and has received substantial attention in the literature. Association rule mining is a computationally and I/O intensive task. In this paper, we propose a solution approach for mining optimized fuzzy association rules of different orders. We also propose an approach to define membership functions for all the continuous attributes in a database by using clustering techniques. Although single objective genetic algorithms are used extensively, they degenerate the solution. In our approach, extraction and optimization of fuzzy association rules are done together using multi-objective genetic algorithm by considering the objectives such as fuzzy support, fuzzy confidence and rule length. The effectiveness of the proposed approach is tested using computer activity dataset to analyze the performance of a multi processor system and network audit data to detect anomaly based intrusions. Experiments show that the proposed method is efficient in many scenarios.

Fuzzy rough set techniques for uncertainty processing in a relational database

This paper concerns the modeling of imprecision, vagueness, and uncertainty in databases through an extension of the relational model of data: the fuzzy rough relational database, an approach which uses both fuzzy set and rough set theories for knowledge representation of imprecise data in a relational database model. The fuzzy rough relational database is formally defined, along with a fuzzy rough relational algebra for querying. Comparisons of theoretical properties of operators in this model with those in the standard relational model are discussed. An example application is used to illustrate other aspects of this model, including a fuzzy entity–relationship type diagram for database design, a fuzzy rough data definition language, and an SQL‐like query language supportive of the fuzzy rough relational database model. This example also illustrates the ease of use of the fuzzy rough relational database, which often produces results that are better than those of conventional databases since it more accurately models the uncertainty of real‐world enterprises than do conventional databases through the use of indiscernibility and fuzzy membership values. ©2000 John Wiley & Sons, Inc.     

A Transaction Model for XML Databases

The hierarchical and semistructured nature of XML data may cause complicated update behavior. Updates should not be limited to entire document trees, but should ideally involve subtrees and even individual elements. Providing a suitable scheduling algorithm for semistructured data can significantly improve collaboration systems that store their data—e.g., word processing documents or vector graphics—as XML documents. In this paper we show that concurrency control mechanisms in CVS, relational, and object-oriented database systems are inadequate for collaborative systems based on semistructured data. We therefore propose two new locking schemes based on path locks which are tightly coupled to the document instance. We also introduce two scheduling algorithms that can both be used with any of the two proposed path lock schemes. We prove that both schedulers guarantee serializability, and show that the conflict rules are necessary.     

Integrating spectral indices with environmental parameters for estimating heavy metal concentrations in rice using a dynamic fuzzy neural-network model

A generalized dynamic fuzzy neural network (GDFNN) was created to estimate heavy metal concentrations in rice by integrating spectral indices and environmental parameters. Hyperspectral data, environmental parameters, and heavy metal content were collected from field experiments with different levels of heavy metal pollution (Cu and Cd). Input variables used in the GDFNN model were derived from 10 variables acquired by gray relational analysis. The assessment models for Cd and Cu concentration employed five and six input variables, respectively. The results showed that the GDFNN for estimating Cu and Cd concentrations in rice performed well at prediction with a compact network structure using the training, validation, and testing sets (for Cu, fuzzy rules=9, R² greater than 0.75, and RMSE less than 2.5; for Cd, fuzzy rules=9, R² greater than 0.75, and RMSE less than 1.0). The final GDFNN model was then compared with a back-propagation (BP) neural network model, adaptive-network-based fuzzy interference systems (ANFIS), and a regression model. The accuracies of GDFNN model prediction were usually slightly better than those of the other three models. This demonstrates that the GDFNN model is more suitable for predicting heavy metal concentrations in rice.     

用模糊聚类和线性回归对数据库空值估计

由于客观世界的复杂性,信息缺失、不确定信息是普遍存在的,因此数据库也不可避免地存在信息缺失的问题,本文主要针对数据库中空值缺失问题进行研究和改进。该文采用模糊聚类算法,使用MATLAB编程求解模糊相似矩阵和模糊等价矩阵,对原始数据分簇。然后根据包含空值的元组的其它属性将其划归到最相似的簇中,最后再用线性回归法对空值进行估计。     

Structural developments of fuzzy systems with the aid of information granulation

We introduce a design procedure for fuzzy systems using the concept of information granulation and genetic optimization. Information granulation and resulting information granules themselves become an important design aspect of fuzzy models. By accommodating the formalism of fuzzy sets, the model is geared towards capturing relationship between information granules (fuzzy sets) rather than concentrating on plain numeric data. Information granulation realized with the use of the standard C-Means clustering helps determine the initial values of the parameters of the fuzzy models. This in particular concerns such essential components of the rules as the initial apexes of the membership functions standing in the premise part of the fuzzy rules and the initial values of the polynomial functions standing in the consequence part. The initial parameters are afterwards tuned with the aid of the genetic algorithms (GAs) and the least square method (LSM). The overall design methodology arises as a hybrid development process involving structural and parametric optimization. Especially, genetic algorithms and C-Means are used to generate the structurally as well as parametrically optimized fuzzy model. To identify the structure and estimate parameters of the fuzzy model we exploit the methodologies such as joint and successive method realized by means of genetic algorithms. The proposed model is evaluated using experimental data and its performance is contrasted with the behavior of the fuzzy models available in the literature.     

The use of deleted tuples in database querying and updating

The traditional approach to database querying and updating treats insertions and deletions of tuples in an asymmetric manner: if a tuple is inserted then, intuitively, we think of as being true and we use this knowledge in query and update processing; in contrast, if a tuple is deleted then we think of as being false but we do not use this knowledge at all! In this paper, we present a new approach to database querying and updating in which insertions and deletions of tuples are treated in a symmetric manner. Contrary to the traditional approach, we use both inserted and deleted tuples in our derivation algorithms. Our approach works as follows: if the deletion of a tuple is requested, then we mark as being deleted without removing it from the database; if the insertion of a tuple is requested, then we simply place in the database and remove all its marked subtuples. Derivation of tuples is done using two derivation rules under one constraint: a tuple is derived only if has no marked subtuples in the database. The derivation rules reflect relational projection and relational join. The main contribution of our work is to provide a method which allows insertion or deletion of a tuple over any relation scheme in a deterministic way. Received: 12 June 1995 / 19 February 1997     

挖掘集合值关系数据库的模糊关联规则

为了挖掘集合值关系数据库的模糊关联规则，应用竞争聚集算法将记录在数量型属性上的取值划分成若干个模糊集，接着给出集合值关系数据库上数量型属的模糊关联规则的挖掘算法，此算法能将数量型属性模糊关联规则的挖掘问题转化为布尔属性关联规则的挖掘问题。最后通过一个实例说明挖掘算法的合理性。     

Application of VPRS model with enhanced threshold parameter selection mechanism to automatic stock market forecasting and portfolio selection

This study proposes a technique based upon Fuzzy C-Means (FCM) classification theory and related fuzzy theories for choosing an appropriate value of the Variable Precision Rough Set (VPRS) threshold parameter (β) when applied to the classification of continuous information systems. The VPRS model is then combined with a moving Average Autoregressive Exogenous (ARX) prediction model and Grey Systems theory to create an automatic stock market forecasting and portfolio selection mechanism. In the proposed mechanism, financial data are collected automatically every quarter and are input to an ARX prediction model to forecast the future trends of the collected data over the next quarter or half-year period. The forecast data are then reduced using a GM(1, N) model, classified using a FCM clustering algorithm, and then supplied to a VPRS classification module which selects appropriate investment stocks in accordance with a pre-determined set of decision-making rules. Finally, a grey relational analysis technique is employed to weight the selected stocks in such a way as to maximize the rate of return of the stock portfolio. The validity of the proposed approach is demonstrated using electronic stock data extracted from the financial database maintained by the Taiwan Economic Journal (TEJ). The portfolio results obtained using the proposed hybrid model are compared with those obtained using a Rough Set (RS) selection model. The effects of the number of attributes of the RS lower approximation set and VPRS β-lower approximation set on the classification are systematically examined and compared. Overall, the results show that the proposed stock forecasting and stock selection mechanism not only yields a greater number of selected stocks in the β-lower approximation set than in the RS approximation set, but also yields a greater rate of return.