By merging the theory of moves TOM and the fuzzy sets theory, we have developed the ลฝ . theory of fuzzy moves TFM to make better fuzzy moves for fuzzy games. Since the data granularity of conventionally used fuzzy sets is too low to contain more heuristic information and mined knowledge, we take pri
Fuzzy set technology in knowledge discovery
โ Scribed by Witold Pedrycz
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 799 KB
- Volume
- 98
- Category
- Article
- ISSN
- 0165-0114
No coin nor oath required. For personal study only.
โฆ Synopsis
Fuzzy models are constructs relying heavily both on a qualitative domain knowledge and diverse optimization techniques. What makes them different from other models is their inherent embedding in the context of nonnumeric set or fuzzy set oriented information. One can also look at the development of the fuzzy models from the perspective of data mining -a prudent and user oriented sifting of data, qualitative observations and calibration of commonsense rules in an attempt to establish meaningful and useful relationships between system's variables. The role of fuzzy sets in knowledge discovery has not been visible even though they are inherently inclined towards coping with linguistic domain knowledge. The paper re-examines the key issues of knowledge discovery by putting them in the context of the technology of fuzzy sets. Subsequently, we reveal several interesting links between fuzzy data mining and fuzzy sets. The study is also geared toward a knowledge-oriented and context-based modification of well known fuzzy clustering.
๐ SIMILAR VOLUMES
This issue of the International Journal of Intelligent Systems presents approaches to knowledge discovery based on rough set theory. [1][2][3][4][5][6][7][8] It is often the case that there are imperfections in raw input data needed for knowledge acquisition: uncertainty, vagueness, and incompletene
In the paper some problems connected with a process of knowledge discovery are considered. These problems are reduced to the set cover problem. It is known that under a plausible assumption on the class \(N P\) the greedy algorithm is close to best approximate polynomial algorithms for the set cover