HIERARCHICAL-INTERPOLATIVE FUZZY SYSTEM CONSTRUCTION BY GENETIC AND BACTERIAL MEMETIC PROGRAMMING APPROACHES

2012 ◽  
Vol 20 (supp02) ◽  
pp. 105-131 ◽  
Author(s):  
KRISZTIÁN BALÁZS ◽  
LÁSZLÓ T. KÓCZY
Keyword(s):  
Machine Learning ◽  
System Modeling ◽  
Fuzzy Rule ◽  
Knowledge Bases ◽  
Learning System ◽  
Supervised Machine Learning ◽  
Rule Base ◽  
System Construction ◽  
Rule Bases ◽  
Programming Algorithms

In this paper a family of new methods are proposed for constructing hierarchical-interpolative fuzzy rule bases in the frame of a fuzzy rule based supervised machine learning system modeling black box systems defined by input-output pairs. The resulting hierarchical rule base is constructed by using structure building pure evolutionary and memetic techniques, namely, Genetic and Bacterial Programming Algorithms and their memetic variants containing local search steps. Applying hierarchical-interpolative fuzzy rule bases is a rather efficient way of reducing the complexity of knowledge bases, whereas evolutionary methods (including memetic techniques) ensure a relatively fast convergence in the learning process. As it is presented in the paper, by applying a newly proposed representation schema these approaches can be combined to form hierarchical-interpolative machine learning systems.

scholarly journals Entity Type Recognition for Heterogeneous Semantic Graphs

AI Magazine ◽  
2015 ◽  
Vol 36 (1) ◽  
pp. 75-86 ◽  
Author(s):  
Jennifer Sleeman ◽  
Tim Finin ◽  
Anupam Joshi
Keyword(s):  
Machine Learning ◽  
Background Knowledge ◽  
Knowledge Bases ◽  
Heterogeneous Data ◽  
Unstructured Data ◽  
Supervised Machine Learning ◽  
Coreference Resolution ◽  
Multiple Sources ◽  
Fine Grained ◽  
High Level

We describe an approach for identifying fine-grained entity types in heterogeneous data graphs that is effective for unstructured data or when the underlying ontologies or semantic schemas are unknown. Identifying fine-grained entity types, rather than a few high-level types, supports coreference resolution in heterogeneous graphs by reducing the number of possible coreference relations that must be considered. Big data problems that involve integrating data from multiple sources can benefit from our approach when the datas ontologies are unknown, inaccessible or semantically trivial. For such cases, we use supervised machine learning to map entity attributes and relations to a known set of attributes and relations from appropriate background knowledge bases to predict instance entity types. We evaluated this approach in experiments on data from DBpedia, Freebase, and Arnetminer using DBpedia as the background knowledge base.

Fuzzy Rule Interpolation

2011 ◽  
pp. 728-733 ◽  
Author(s):  
Szilveszter Kovács
Keyword(s):  
Fuzzy Inference ◽  
Fuzzy Rule ◽  
Fuzzy Reasoning ◽  
Fuzzy Relation ◽  
Rule Base ◽  
Rule Based ◽  
Fuzzy Rule Base ◽  
Current Observation ◽  
Rule Bases ◽  
Takagi Sugeno

The “fuzzy dot” (or fuzzy relation) representation of fuzzy rules in fuzzy rule based systems, in case of classical fuzzy reasoning methods (e.g. the Zadeh-Mamdani- Larsen Compositional Rule of Inference (CRI) (Zadeh, 1973) (Mamdani, 1975) (Larsen, 1980) or the Takagi - Sugeno fuzzy inference (Sugeno, 1985) (Takagi & Sugeno, 1985)), are assuming the completeness of the fuzzy rule base. If there are some rules missing i.e. the rule base is “sparse”, observations may exist which hit no rule in the rule base and therefore no conclusion can be obtained. One way of handling the “fuzzy dot” knowledge representation in case of sparse fuzzy rule bases is the application of the Fuzzy Rule Interpolation (FRI) methods, where the derivable rules are deliberately missing. Since FRI methods can provide reasonable (interpolated) conclusions even if none of the existing rules fires under the current observation. From the beginning of 1990s numerous FRI methods have been proposed. The main goal of this article is to give a brief but comprehensive introduction to the existing FRI methods.

scholarly journals Credibility Detection on Twitter News Using Machine Learning Approach

2021 ◽  
Vol 13 (3) ◽  
pp. 1-10
Author(s):  
Marina Azer ◽  
◽  
Mohamed Taha ◽  
Hala H. Zayed ◽  
Mahmoud Gadallah
Keyword(s):  
Machine Learning ◽  
Logistic Regression ◽  
Random Forest ◽  
Learning System ◽  
Supervised Machine Learning ◽  
Support Vector ◽  
Sources Of Information ◽  
Supervised Machine Learning Classifiers ◽  
False News ◽  
The Impact

Social media presence is a crucial portion of our life. It is considered one of the most important sources of information than traditional sources. Twitter has become one of the prevalent social sites for exchanging viewpoints and feelings. This work proposes a supervised machine learning system for discovering false news. One of the credibility detection problems is finding new features that are most predictive to better performance classifiers. Both features depending on new content, and features based on the user are used. The features' importance is examined, and their impact on the performance. The reasons for choosing the final feature set using the k-best method are explained. Seven supervised machine learning classifiers are used. They are Naïve Bayes (NB), Support vector machine (SVM), Knearest neighbors (KNN), Logistic Regression (LR), Random Forest (RF), Maximum entropy (ME), and conditional random forest (CRF). Training and testing models were conducted using the Pheme dataset. The feature's analysis is introduced and compared to the features depending on the content, as the decisive factors in determining the validity. Random forest shows the highest performance while using user-based features only and using a mixture of both types of features; features depending on content and the features based on the user, accuracy (82.2 %) in using user-based features only. We achieved the highest results by using both types of features, utilizing random forest classifier accuracy(83.4%). In contrast, logistic regression was the best as to using features that are based on contents. Performance is measured by different measurements accuracy, precision, recall, and F1_score. We compared our feature set with other studies' features and the impact of our new features. We found that our conclusions exhibit high enhancement concerning discovering and verifying the false news regarding the discovery and verification of false news, comparing it to the current results of how it is developed.

Special Issue on Fuzzy Rule Interpolation

2011 ◽  
Vol 15 (3) ◽  
pp. 253-253 ◽  
Author(s):  
Szilveszter Kov?cs
Keyword(s):  
Knowledge Representation ◽  
Fuzzy Sets ◽  
Fuzzy Rule ◽  
Rule Base ◽  
Special Issue ◽  
Control Applications ◽  
Euclidean Metric ◽  
Fuzzy Rule Base ◽  
Fuzzy Function ◽  
Rule Bases

Fuzzy Rule Interpolation (FRI) methods are well known tools for reasoning in case of insufficient knowledge expressed as sparse fuzzy rule-bases. It also provides a simple way to define fuzzy functions. Despite these advantages, FRI techniques are relatively rarely applied in practice. Enabling sparse fuzzy rule-bases, FRI dramatically simplifies rule-base creation. Regardless of whether the rule-base is generated by a human expert, or automatically from input-output data, the ability to provide reasonable interpolated conclusions even if no rule fires for a given observation, help to concentrate on cardinal actions alone. This reduces the number of rules needed, speeds up parameter optimization and validation steps, and hence simplifies rule-base creation itself. This special issuefs six papers take six different directions in current FRI research. The first introduces the FRI concept and sets up a unified criteria and evaluation system. This work collects the main properties an FRI method generally has to fulfill. The next two papers are related to the constantly important mainstream research on the more and more sophisticated FRI methods, the endeavor of finding the best way for defining a fuzzy valued fuzzy function based on data given in the form of the relation of fuzzy sets, i.e., in fuzzy rules. The second paper introduces a novel FRI method that is able to handle fuzzy observations activating multiple rule antecedents applying the concept of nonlinear fuzzy-valued function. The third paper presents a novel ganalogical-basedh FRI method that rather fits into the traditional FRI research line, improving the n-rule-based gscale and move transformationh FRI to ensure continuous approximate functions. The fourth paper addresses the issue of defining a distance function between fuzzy sets on a domain that is not necessarily Euclidean metric space. In FRI, this takes on the importance if antecedent or consequent domains are non-Euclidean metric spaces. The last two papers discuss direct FRI control applications. One is an example proving that the sparse fuzzy rule-base is an efficient knowledge representation in intelligent control solutions. The last deals with the computational efficiency of implemented FRI methods applied to direct control area, clearly showing that the sparse fuzzy rule-base is not only a convenient way for knowledge representation, but also makes FRI methods possible devices for direct embedded control applications.

scholarly journals Self-Supervised Chinese Ontology Learning from Online Encyclopedias

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Fanghuai Hu ◽  
Zhiqing Shao ◽  
Tong Ruan
Keyword(s):  
Machine Learning ◽  
Structural Information ◽  
Relation Extraction ◽  
Knowledge Bases ◽  
The Self ◽  
Supervised Machine Learning ◽  
Ontology Learning ◽  
High Coverage ◽  
Category Labels ◽  
Training Examples

Constructing ontology manually is a time-consuming, error-prone, and tedious task. We present SSCO, a self-supervised learning based chinese ontology, which contains about 255 thousand concepts, 5 million entities, and 40 million facts. We explore the three largest online Chinese encyclopedias for ontology learning and describe how to transfer the structured knowledge in encyclopedias, including article titles, category labels, redirection pages, taxonomy systems, and InfoBox modules, into ontological form. In order to avoid the errors in encyclopedias and enrich the learnt ontology, we also apply some machine learning based methods. First, we proof that the self-supervised machine learning method is practicable in Chinese relation extraction (at least for synonymy and hyponymy) statistically and experimentally and train some self-supervised models (SVMs and CRFs) for synonymy extraction, concept-subconcept relation extraction, and concept-instance relation extraction; the advantages of our methods are that all training examples are automatically generated from the structural information of encyclopedias and a few general heuristic rules. Finally, we evaluate SSCO in two aspects, scale and precision; manual evaluation results show that the ontology has excellent precision, and high coverage is concluded by comparing SSCO with other famous ontologies and knowledge bases; the experiment results also indicate that the self-supervised models obviously enrich SSCO.

scholarly journals Inference Algorithm Independent SVD Fuzzy Rule Base Complexity Reduction

2001 ◽  
Vol 5 (1) ◽  
pp. 22-30 ◽  
Author(s):  
Péter Baranyi ◽  
◽  
Yeung Yamb ◽  
Chi Tin Yang ◽  
Péter Várlakic ◽  
...  
Keyword(s):  
Reduction Method ◽  
Fuzzy Rule ◽  
Reduction Process ◽  
Complexity Reduction ◽  
Rule Base ◽  
Inference Algorithm ◽  
Reduction Techniques ◽  
Fuzzy Algorithms ◽  
Rule Bases ◽  
Exponential Complexity

This paper is motivated by the fact that fuzzy technique is popular engineering tool, however, its use is restricted by its exponential complexity. One of the complexity reduction techniques is the SVD based reduction method which deals with arbitrary shaped fuzzy sets. Despite its advantages it is applicable to rule bases only which are based on product-sum-gravity (PSG) inference algorithm. This paper introduces the extension of the PSG based SVD-reduction method to arbitrary inference based fuzzy algorithms. An example with the control of an automatic guided system is presented to demonstrate the reduction process.

scholarly journals Performance Analysis of Supervised Machine Learning Algorithms on Medical Dataset

2020 ◽  
Vol 8 (6) ◽  
pp. 1637-1642
Keyword(s):  
Machine Learning ◽  
Support Vector Machine ◽  
Random Forest ◽  
Decision Tree ◽  
Naive Bayes ◽  
Naïve Bayes ◽  
Learning System ◽  
Supervised Machine Learning ◽  
Support Vector ◽  
Heart Problem

Machine learning (ML) algorithms are designed to perform prediction based on features. With the help of machine learning, system can automatically learn and improve by experience. Machine learning comes under Artificial intelligence. Machine learning is broadly categorized in two types: supervised and unsupervised. Supervised ML performs classification and unsupervised is for clustering. In present scenario, machine learning is used in various areas. It can be used for biometric recognition, hand writing recognition, medical diagnosis etc. In medical field, machine learning plays an important role in identifying diseases based on patient’s features. Presently,doctors use software application based on machine learning algorithm in various disease diagnosis like cancer, cardiac arrest and many more. In this paper we used an ensemble learning method to predict heart problem. Our study described the performance of ML algorithms by comparing various evaluating parameters such as F-measure, Recall, ROC, precision and accuracy. The study done with various combination ML classifiers such as, Decision Tree (DT), Naïve Bayes (NB), Support Vector Machine (SVM), Random Forest (RF) algorithm to predict heart problem. The result showed that by combining two ML algorithm, DT with NB, 81.1% accuracy was achieved. Simultaneously, the models like Support Vector machine (SVM), Decision tree, Naïve Bayes, Random Forest models were also trained and tested individually.

Sign in / Sign up

Export Citation Format

Share Document