Comparison of rough-set and statistical methods in inductive learning (Q3773383)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4033127
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparison of rough-set and statistical methods in inductive learning |
scientific article; zbMATH DE number 4033127 |
Statements
Comparison of rough-set and statistical methods in inductive learning (English)
0 references
1986
0 references
statistical information theory
0 references
rough sets
0 references
inductive algorithm
0 references
inductive learning
0 references
knowledge base
0 references
approximate classification
0 references
0.8135777711868286
0 references
Quinlan suggested an inductive algorithm based on the statistical theory of information originally proposed by Shannon. Recently Pawlak showed that the principles of inductive learning (learning from examples) can be precisely formulated on the basis of the theory of rough sets. These two approaches are apparently very different, although in both methods objects in the knowledge base are assumed to be characterized by ``features'' (attributes and attribute values). The main objective of this paper is to show that the concept of ``approximate classification'' of a set is closely related to the statistical approach. In fact, in the design of inductive programs, the criterion for selecting dominant attributes based on the concept of rough sets is a special case of the statistical method if equally probable distribution of objects in the ``doubtful region'' of the approximation space is assumed.
0 references