Zdzisaw Pawlak, Databases and Rough Sets
V. W. Marek
Department of Computer Science
University of Kentucky
Lexington, KY 40506
Abstract
We discuss work of Zdzisaw Pawlak in the area of databases and t
CS836 Rough Sets and Applications
Assignments 3
Available on March 4, 2014
Due date: March 13, 2014
1. Relative Reducts
(a) Give a denition of a relative reduct in a decision table.
(b) Give an algori
Computer Science 836
Computer Science
Rough Sets and Applications
University of Regina
Instructor: Dr. Y.Y. Yao,
Winter 2014
CW308.6, 585-5226,
e-mail: yyao@cs.uregina.ca
3:45PM
Department of
Lecture:
CS836 Rough Sets and Applications
Assignment 2
Available on January 30, 2014
Due date: February 27, 2014
1. Equivalence relations and partitions
a). Give a denition of a partition of a nite set U .
b)
CS836 Rough Sets and Applications
Sample questions
1.-2. Consider the following information table:
Object
o1
o2
o3
o4
o5
o6
A
1
1
1
2
2
1
B
1
1
1
3
3
1
C
1
1
2
1
1
2
a). Give the partition induced by
CS836 Rough Sets and Applications
Assignment 1
Available on January 16, 2014
Due date: January 30, 2014
1. Give the basic formulation of rough set approximations:
a). Give a denition of an information
Proof of the equivalence of the two formulation.
Note: we only need to prove that the two lower approximations or positive
regions are the same. The upper approximation can be dened by the lower
appro
CS836 Rough Sets and Applications
Assignments 4
Available on March 13, 2014
Due date: April 1, 2014
1. Pawlak three-step rough set analysis
(a) Give a general denition of reducts (hint: read the paper
Richard Hamming
`You and Your Research'
Transcription of the
Bell Communications Research Colloquium Seminar
7 March 1986
J. F. Kaiser
Bell Communications Research
445 South Street
Morristown, NJ 0796
Reprinted with corrections from The Bell System Technical Journal, Vol. 27, pp. 379423, 623656, July, October, 1948.
A Mathematical Theory of Communication
By C. E. SHANNON
HE recent development of va