This chapter is a summary of knowledge discovery algorithms that take an input of training examples of target knowledge, and output a fuzzy logic formula that best fits the training examples. The execution is done in three steps; first, the given mapping is divided into some Q-equivalent classes; second, the distances between the mapping and each local fuzzy logic function are calculated by a simplified logic formula; and last, the shortest distance is obtained by a modified graph-theoretic algorithm. After a fundamental algorithm for fitting is provided, fuzzy logic functions are applied to a more practical example of classification problem, in which expressiveness of fuzzy logic functions is examined for a well-known machine learning database. © Springer-Verlag 2004.
CITATION STYLE
Takagi, N., Kikuchi, H., & Mukaidono, M. (2004). Applications of fuzzy logic functions to knowledge discovery in databases. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3135, 107–128. https://doi.org/10.1007/978-3-540-27778-1_7
Mendeley helps you to discover research relevant for your work.