Fuzzy methods in machine learning and data mining: Status and prospects
Fuzzy Sets and SystemsPublished 21 June 2005
Eyke Hüllermeier
Citations207
SJR quartileQ1
SJR score0.75
SNIP1.25
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A critical consideration of recent developments is considered and potential contributions that fuzzy set theory can make to machine learning, data mining, and related fields are highlighted.
Abstract
Over the past years, methods for the automated induction of models and the extraction of interesting patterns from empirical data have attracted considerable attention in the fuzzy set community. This paper briefly reviews some typical applications and highlights potential contributions that fuzzy set theory can make to machine learning, data mining, and related fields. The paper concludes with a critical consideration of recent developments and some suggestions for future research directions.
Keywords
Computer Science
The Nature of Statistical Learning Theory
39,279 Citations1995Vladimir Vapnik
BiometricsClassification and Regression Trees.
23,841 Citations1984Alexander Gordon, Leo Breiman +3 more
C4.5: Programs for Machine Learning
23,665 Citations1992J. R. Quinlan
A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
16,927 Citations1988Judea Pearl
The author provides a coherent explication of probability as a language for reasoning with partial belief and offers a unifying perspective on other AI approaches to uncertainty, such as the Dempster-Shafer formalism, truth maintenance systems, and nonmonotonic logic.
Machine LearningBagging predictors
16,377 Citations1996Leo Breiman
Tests on real and simulated data sets using classification and regression trees and subset selection in linear regression show that bagging can give substantial gains in accuracy.
Fast algorithms for mining association rules
10,739 Citations1998Rakesh Agrawal, Ramakrishnan Srikant
The Nature of Statistical Learning Theory
10,566 Citations2000Vladimir Vapnik
The MIT Press eBooksLearning with Kernels
9,548 Citations2001Bernhard Schölkopf, Alexander J. Smola
Learning with Kernels provides an introduction to SVMs and related kernel methods that provide all of the concepts necessary to enable a reader equipped with some basic mathematical knowledge to enter the world of machine learning using theoretically well-founded yet easy-to-use kernel algorithms.
Lecture notes in computer scienceEnsemble Methods in Machine Learning
7,862 Citations2000Thomas G. Dietterich
Experiments with a new boosting algorithm
7,585 Citations1996Yoav Freund, Robert E. Schapire
Programs for Machine Learning
5,794 Citations1994Steven L. Salzberg, Alberto M. Segre
In his new book, C4.5: Programs for Machine Learning, Quinlan has put together a definitive, much needed description of his complete system, including the latest developments, which will be a welcome addition to the library of many researchers and students.
Journal of the American Statistical AssociationLearning With Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
4,326 Citations2003Christopher K. I. Williams
Learning with Kernels provides an introduction to SVMs and related kernel methods that provide all of the concepts necessary to enable a reader equipped with some basic mathematical knowledge to enter the world of machine learning using theoretically well-founded yet easy-to-use kernel algorithms.
Cambridge University Press eBooksCase-Based Reasoning
4,254 Citations2005Janet L. Kolodner
It is argued that CBR systems are easy to assess, develop, and deploy and can be evaluated in terms of their cost benefits and argued that CBR systems are easy to assess, develop, and deploy.
A theory of the learnable
4,242 Citations1984Leslie G. Valiant
This paper regards learning as the phenomenon of knowledge acquisition in the absence of explicit programming, and gives a precise methodology for studying this phenomenon from a computational viewpoint.
Machine LearningInstance-Based Learning Algorithms
4,117 Citations1991David W. Aha, Dennis Kibler +1 more
This paper describes how storage requirements can be significantly reduced with, at most, minor sacrifices in learning rate and classification accuracy and extends the nearest neighbor algorithm, which has large storage requirements.
Journal of the Royal Statistical Society Series B (Statistical Methodology)Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems
3,970 Citations1988Steffen L. Lauritzen, David J. Spiegelhalter
This work exploits a range of local representations for the joint probability distribution, combined with topological changes to the original network termed 'marrying' and 'filling-in', which allows efficient algorithms for transfer between representations, providing rapid absorption and propagation of evidence.
Communications of the ACMA theory of the learnable
3,268 Citations1984Leslie G. Valiant
This paper regards learning as the phenomenon of knowledge acquisition in the absence of explicit programming, and gives a precise methodology for studying this phenomenon from a computational viewpoint.
Machine LearningInstance-based learning algorithms
2,915 Citations1991David W. Aha, Dennis Kibler +1 more
This paper describes how storage requirements can be significantly reduced with, at most, minor sacrifices in learning rate and classification accuracy and extends the nearest neighbor algorithm, which has large storage requirements.
IEEE Transactions on Systems Man and CyberneticsGenerating fuzzy rules by learning from examples
2,876 Citations1992L.-X. Wang, Jerry M. Mendel
IEEE Transactions on Fuzzy SystemsA possibilistic approach to clustering
2,480 Citations1993Raghu Krishnapuram, James M. Keller
An appropriate objective function whose minimum will characterize a good possibilistic partition of the data is constructed, and the membership and prototype update equations are derived from necessary conditions for minimization of the criterion function.
An Efficient Algorithm for Mining Association Rules in Large Databases
1,598 Citations1995Ashoka Savasere, Edward Omiecinski +1 more
This paper presents an efficient algorithm for mining association rules that is fundamentally different from known algorithms and not only reduces the I/O overhead significantly but also has lower CPU overhead for most cases.
Elsevier eBooksUncertainty in Artificial Intelligence
1,434 Citations1992
Qualitative Probabilistic Reasoning and Cognitive models, Dempster-Shafer Theory in Knowledge Representation, and Possibility Theory: Semantics and Applications.
Psychology Press eBooksInside Case-Based Reasoning
1,409 Citations2013Christopher K. Riesbeck, Roger C. Schank
CBR tends to be a good approach for rich, complex domains in which there are myriad ways to generalize a case, and is similar to the rule-induction algorithms of machine learning.
IEEE Transactions on Systems Man and CyberneticsA k-nearest neighbor classification rule based on Dempster-Shafer theory
977 Citations1995Thierry Denœux
In this paper, the problem of classifying an unseen pattern on the basis of its nearest neighbors in a recorded data set is addressed from the point of view of Dempster-Shafer theory to provide a global treatment of such issues as ambiguity and distance rejection, and imperfect knowledge regarding the class membership of training patterns.
International series in intelligent technologiesFuzzy Modeling for Control
915 Citations1998Robert Babuška
Fuzzy Modeling for Control addresses fuzzy modeling from the systems and control engineering point of view and focuses on the selection of appropriate model structures, on the acquisition of dynamic fuzzy models from process measurements, and on the design of nonlinear controllers based on fuzzy models.
WORLD SCIENTIFIC eBooksMetric Spaces of Fuzzy Sets: Theory and Applications
880 Citations1994Phil Diamond, Peter E. Kloeden
Studies in fuzziness and soft computingA k-Nearest Neighbor Classification Rule Based on Dempster-Shafer Theory
835 Citations2008Thierry Denœux
Fuzzy Sets and SystemsTen years of genetic fuzzy systems: current framework and new trends
821 Citations2003Óscar Cordón, Fernando Gomide +3 more
Japanese Circulation JournalFuzzy Cluster Analysis
818 Citations1998Robert Peters, Stanley A. Shanies +1 more
FCA better predicts future cardiac events in patients with positive stress tests than the ST-segment alone, which combined with its usefulness in predicting the extent of coronary disease provides the basis of a clinical strategy for managing patients withpositive stress tests.
Medical Entomology and ZoologyFoundations of neuro-fuzzy systems
812 Citations1997Detlef Nauck, Frank Klawonn +1 more
The authors' informed analysis of practical neuro-fuzzy applications will be an asset to industrial practitioners using fuzzy technology and neural networks for control systems, data analysis and optimization tasks.
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)Fuzzy decision trees: issues and methods
654 Citations1998Cezary Z. Janikow
This work presents another modification, aimed at combining symbolic decision trees with approximate reasoning offered by fuzzy representation, to exploit complementary advantages of both: popularity in applications to learning from examples, high knowledge comprehensibility of decision trees, and the ability to deal with inexact and uncertain information of fuzzy representation.
BMC NursingThe Need for Biases in Learning Generalizations
527 Citations2007Tom M. Mitchell
The current study showed that the Digital Education Package (DEP) is an effective method for reducing children’s anxiety during hospitalization and recommended it as a preferred and simple method rather than routine education for pediatric nurses.
Artificial Intelligence ReviewSeparate-and-Conquer Rule Learning
523 Citations1999Johannes Fürnkranz
This paper is a survey of inductive rule learning algorithms that use a separate-and-conquer strategy and analyzes them along three different dimensions, namely their search, language and overfitting avoidance biases.
Genome biologyExploring the conditional coregulation of yeast gene expression through fuzzy k-means clustering
477 Citations2002Audrey P. Gasch, Michael B. Eisen
Fuzzy k-means clustering is a useful analytical tool for extracting biological insights from gene-expression data and suggests that a prevalent theme in the regulation of yeast gene expression is the condition-specific coregulation of overlapping sets of genes.
Fuzzy Sets and SystemsWhat are fuzzy rules and how to use them
462 Citations1996Didier Dubois, Henri Prade
A survey of different possible semantics for a fuzzy rule and shows how they can be captured in the framework of fuzzy set and possibility theory.
Studies in fuzziness and soft computingInterpretability Issues in Fuzzy Modeling
437 Citations2003Jorge Casillas, Óscar Cordón +2 more
Interpretability improvements to find the balance interpretability-accuracy in fuzzy modeling: finding the saturation problem for certain FRBSs and a formal model of interpretability of linguistic variables.
Fuzzy Sets and SystemsA complete fuzzy decision tree technique
413 Citations2003Cristina Olaru, Louis Wehenkel
This method combines tree growing and pruning, to determine the structure of the soft decision tree, with refitting and backfitting, to improve its generalization capabilities.
IEEE Transactions on Fuzzy SystemsFuzzy association rules: general model and applications
323 Citations2003Miguel Delgado‐Rodríguez, Nicolás Marı́n +2 more
A general model to discover association rules among items in a (crisp) set of fuzzy transactions is developed, which can be particularized in several ways; each particular instance corresponds to a certain kind of pattern and/or repository of data.
The Handbooks of fuzzy sets seriesFuzzy Sets in Decision Analysis, Operations Research and Statistics
305 Citations1998Roman Słowiński
This chapter discusses Fuzzy Preference Modeling, Dynamic Programming, Maintenance and Replacement, and Set-Theoretic Methods in Statistics, which are based on the work of A.O. Esogbue, J. Kacprzyk, and others.
Fuzzy Data Analysis
249 Citations1992Hans Bandemer, Wolfgang Näther
This chapter discusses the construction of basic Notions of Data Analysis and its applications in qualitative and quantitative analysis.
Lecture notes in computer sciencePairwise Preference Learning and Ranking
226 Citations2003Johannes Fürnkranz, Eyke Hüllermeier
The main objective of this work is to investigate the trade-off between the quality of the induced ranking function and the computational complexity of the algorithm, both depending on the amount of preference information given for each example.
IEEE Transactions on Fuzzy SystemsSupport vector learning for fuzzy rule-based classification systems
219 Citations2003Yixin Chen, James Z. Wang
This paper investigates the connection between fuzzy classifiers and kernel machines, establishes a link between fuzzy rules and kernels, and proposes a learning algorithm for fuzzy classifier (PDFC) using the support vector learning approach.
Lazy Learning
217 Citations1997David W. Aha
The survey discusses distance functions, smoothing parameters, weighting functions, local model structures, regularization of the estimates and bias, assessing predictions, handling noisy data and outliers, improving the quality of predictions by tuning fit parameters, interference between old and new data, and applications of locally weighted learning.
Lecture notes in computer scienceConstraint Classification: A New Approach to Multiclass Classification
176 Citations2002Sariel Har-Peled, Dan Roth +1 more
A new view of multiclass classification is presented and the constraint classification problem is introduced, a generalization that captures many flavors of multiclass classification and provides the first optimal, distribution independent bounds for many multiclass learning algorithms, including winner-take-all (WTA).
Graphical Models: Methods for Data Analysis and Mining
144 Citations2002Christian Borgelt, Rudolf Kruse
This book provides a self-contained introduction to the learning of graphical models from data, and is the first to include detailed coverage of possibilistic networks - a relatively new reasoning tool that allows the user to infer results from problems with imprecise data.
IEEE Transactions on Systems Man and Cybernetics - Part A Systems and HumansRepresenting partial ignorance
129 Citations1996Didier Dubois, Henri Prade +1 more
It is pointed out that within a numerical framework, two numbers are needed to account for partial ignorance about events, because on top of truth and falsity, the state of total ignorance must be encoded independently of the number of underlying alternatives.
International Journal of Intelligent SystemsFuzzy set modelling in case-based reasoning
99 Citations1998Didier Dubois, Henri Prade +4 more
Extensions of the proposed approach in order to handle imprecise or fuzzy descriptions or to manage more general forms of the principle underlying case‐based reasoning are briefly discussed in the conclusion.
The Handbooks of fuzzy sets seriesFuzzy Regression Analysis
84 Citations1998Phil Diamond, Hideo Tanaka
This chapter considers two types of fuzzy regression, the first is based on possibilistic concepts and the second upon a least squares approach, both of which reduce to linear programming.
Lecture notes in computer scienceA Note on Quality Measures for Fuzzy Association Rules
75 Citations2003Didier Dubois, Eyke Hüllermeier +1 more
This paper suggests a theoretical basis of fuzzy association rules by generalizing the classification of the data stored in a database into positive, negative, and irrelevant examples of a rule.
IEEE Transactions on Fuzzy SystemsFuzzy set-based methods in instance-based reasoning
55 Citations2002Didier Dubois, Eyke Hüllermeier +1 more
A formal framework of instance-based prediction is presented in which the generalization beyond experience is founded on the concepts of similarity and possibility, and the underlying extrapolation principle is formalized within the framework of fuzzy rules.
Lecture notes in computer scienceImplication-Based Fuzzy Association Rules
54 Citations2001Eyke Hüllermeier
This paper introduces a semantic model of fuzzy association rules which suggests to consider them as a convex combination of simple association rules and provides a sound theoretical basis and gives an explicit meaning to fuzzy associations.
Fuzzy Sets and SystemsExamples, counterexamples, and measuring fuzzy associations
53 Citations2004Thomas Sudkamp
The measurement of the degree to which tuples in a database support a relation among attributes based on a comparison of the number of examples and counterexamples of the relation is examined.
Artificial IntelligencePossibilistic instance-based learning
35 Citations2003Eyke Hüllermeier
A possibilistic version of the similarity-guided extrapolation principle underlying the instance-based learning paradigm is proposed and this version is compared to the commonly used probabilistic approach from a methodological point of view.
Intelligent Data AnalysisA new approach for the generation of fuzzy summaries based on fuzzy multidimensional databases1
30 Citations2003Anne Laurent
A new architecture based on fuzzy multidimensional databases to generate fuzzy summaries is proposed, which provides a scalable framework due to the use of a database management system and provides a framework to handle all classical crisp cases.
Dialnet (Universidad de la Rioja)Analyzing the reasoning mechanisms in fuzzy rule based classification systems
29 Citations1998Óscar Cordón García, María José del Jesús +1 more
This paper proposes to use FRMs that combine the different rules that have been fired by a pattern and describes the behaviour of a general reasoning method and analyzes two kinds of models, the first using all the fired rules and the second using partial information due to the fact that the rules with a lower association degree are not considered.
Lecture notes in computer sciencePossibilistic Induction in Decision-Tree Learning
26 Citations2002Eyke Hüllermeier
A generalization of Ockham's razor is proposed, a widely applied principle of inductive inference that is not simply used for identifying a single, apparently optimal model, but rather for concluding on the possibility of various candidate models.
A possibilistic interpretation of fuzzy sets by the context model
25 Citations2003Jörg Gebhardt, Rudolf Kruse
The authors apply the context model to clarify the numerical foundations of fuzzy set theory and some well-known concepts like the extension principle to provide a formal framework for the representation, interpretation, and analysis of vague and uncertain data.
Applied IntelligenceSoft Aggregation Methods in Case Based Reasoning
18 Citations2004Ronald R. Yager
This work introduces a methodology for matching the target and cases which uses a hierarchical representation of the target object and a method for fusing the information provided by relevant retrieved cases.
Document Server@UHasselt (UHasselt)Overview of fuzzy associations mining
15 Citations2003Guoqing Chen, Qiang Wei +2 more
This paper focuses on associations of three kinds, namely, association rules, functional dependencies and pattern associations, and overviews major fuzzy logic extensions accordingly.
Cho-k-NN: a method for combining interacting pieces of evidence in case-based learning
9 Citations2005Eyke Hüllermeier
It is argued that cases retrieved from a case library must not be considered as independent information sources, as implicitly done by most case-based learning methods, and a new inference principle is proposed that combines potentially interacting pieces of evidence by means of the so-called Choquet-integral.
Similarity as a foundation for possibility
6 Citations2002Thomas Sudkamp
A semantics for possibilistic evidential reasoning based on similarity with paradigmatic examples distinguishes possibility from classical approaches to classification and diagnosis problems based on probabilistic techniques.
UPCommons (Polytechnic University of Catalonia)An evolutionary approach to constraint-regularized learning
6 Citations2004Eyke Hüllermeier, Ingo Renners +1 more
An operationalization of constraint regularized learning is offered, based on evolutionary methods for model optimization and employs fuzzy rule bases of the Takagi Sugeno type as flexible function approximators.
HAL (Le Centre pour la Communication Scientifique Directe)Measures of information for inductive learning
5 Citations2004Thanh Ha Dang, Bernadette Bouchon‐Meunier +1 more