Virual Oral Presentation Slide by Slide

IEEE/ICACT20220156 Slide.28        [Big Slide]	Oral Presentation
	To understand the working of algorithm proposed for updating approximation sets when one or more old objects leave the system , we consider a same sample information system used in previous example. We assume that two objects leave the system , {𝒙𝟑,𝒙𝟕}. In the first step, we update decision classes and other relevant higher/lower preference ordered classes upon deletion of an object ¡®𝒙𝟑¡¯ from the system.

[Go to Next Slide]

Select Voice: Virtual Oral Presentation!!