Rough sets of various kinds

<strong>School of Computer &amp; Systems Sciences JAWAHARLAL NEHRU UNIVERSITY</strong> <strong>"Rough sets of various kinds"</strong> <strong>Speaker: DR. MIHIR KUMAR CHAKRABORTY</strong> Retired Professor, Department of Pure mathematics, University of Calcutta. Date:<strong> 27-04-2016</strong> <strong>Abstract:</strong> Introduced by the Polish computer scientist Zdzislaw I. Pawlak, a Rough Set is a formal approximation of a crisp set (i.e., conventional set) in terms of a pair of sets which give the lower and the upper approximation of the original set. Rough sets have found significant research attention since the wide application of data analysis in numerous fields. Rough set philosophy is founded on the assumption that with every object of the universe of discourse some information (data, knowledge) is associated. Objects characterized by the same information are indiscernible (similar) in view of the available information about them. The indiscernibility relation generated in this way is the mathematical basis of rough set theory. Any set of all indiscernible (similar) objects forms a basic granule (atom) of knowledge about the universe. Any union of some elementary sets is referred to as a crisp (precise) set – otherwise the set is rough (imprecise, vague). The presentation will include various ways of defining Rough Sets and their significances. <strong>About the speaker</strong> Areas of research interest: Non-standard Logics, Fuzzy set theory, Rough Set Theory, Foundations of Mathematics , Mathematics and Culture , Logic of Diagrams, Functional Analysis, Topology, Knowledge Representation. Research Publications (in refereed journal): 120 (approximately) Research papers in conference presentations: 80 (approximately) Books: 4 (one by Springer, and three in Bengali), 6 (Edited Volumes)