{"id":{"repo_id":"regina","oai_identifier":"oai:uregina.scholaris.ca:10294/3820"},"canonical_url":"https://search.dev.ndltd.org/etd/regina/oai:uregina.scholaris.ca:10294/3820","repository":{"repo_id":"regina","name":"University of Regina","base_url":"https://uregina.scholaris.ca/server/oai/request"},"display":{"title":"Reducts and Rough Set Analysis","abstract":"Rough set theory offers a mathematical approach to data analysis and data mining. It can be used to learn classification rules that define classes of a classi- fication based on some well defined concepts. The fundamental task of rough set data analysis is to precisely construct and interpret concepts. When applying rough set theory to rule learning, the main tasks involve removing redundant attributes, redundant attribute-value pairs, and redundant rules in order to obtain a minimal set of simple and general rules. Following Pawlak, we can arrange these tasks into a three-step sequential process, called Pawlak three-step approach, based on a central notion of reducts. One problem is that reducts used in the three steps are de fined and formulated differently. Such an inconsistency in formulation may unnecessarily affects the elegancy of the approach. By adopting the classical view of concepts that interprets a concept by a pair of intension and extension, in this thesis we introduce a generic definition of reducts of a set. We define various reducts used in rough set analysis in a uni ed way. We study several mathematically equivalent, but differently formulated, definitions of reducts. Each definition captures a different aspect of a reduct and their integration provides new insights. The Pawlak three-step approach is reformulated uniformly as a search for different reducts.","abstract_html":"Rough set theory offers a mathematical approach to data analysis and data mining. It can be used to learn classification rules that define classes of a classi- fication based on some well defined concepts. The fundamental task of rough set data analysis is to precisely construct and interpret concepts. When applying rough set theory to rule learning, the main tasks involve removing redundant attributes, redundant attribute-value pairs, and redundant rules in order to obtain a minimal set of simple and general rules. Following Pawlak, we can arrange these tasks into a three-step sequential process, called Pawlak three-step approach, based on a central notion of reducts. One problem is that reducts used in the three steps are de fined and formulated differently. Such an inconsistency in formulation may unnecessarily affects the elegancy of the approach. By adopting the classical view of concepts that interprets a concept by a pair of intension and extension, in this thesis we introduce a generic definition of reducts of a set. We define various reducts used in rough set analysis in a uni ed way. We study several mathematically equivalent, but differently formulated, definitions of reducts. Each definition captures a different aspect of a reduct and their integration provides new insights. The Pawlak three-step approach is reformulated uniformly as a search for different reducts.","abstract_has_math":false,"creators":["Fu, Rong"],"institution":"Faculty of Graduate Studies and Research, University of Regina","degree_name":"Master of Science (MSc)","degree_level":"Master's","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":["Yao, Yiyu"],"committee_chairs":[],"committee_members":["Yao, JingTao","Butz, Cortney J."],"year":2012,"date_issued":"2012-10","date_published":"2012-10","updated_at":"2026-07-24T04:03:43Z","subjects":[],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.82465/4704"],"render_values":[{"text":"https://doi.org/10.82465/4704","href":"https://doi.org/10.82465/4704","code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/10294/3820","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Yao, Yiyu"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Yao, JingTao","Butz, Cortney J."]},{"key":"dc:creator","label":"Author","values":["Fu, Rong"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2013-10-31T14:26:28Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2013-10-31T14:26:28Z"]},{"key":"dc:date.issued","label":"Date","values":["2012-10"]},{"key":"dc:publisher","label":"Institution","values":["Faculty of Graduate Studies and Research, University of Regina"]},{"key":"dc:type","label":"Dc Type","values":["master thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Master's"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MSc)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Faculty of Graduate Studies and Research, University of Regina"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.82465/4704"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10294/3820"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["A Thesis Submitted to the Faculty of Graduate Studies and Research in Partial Fulfillment of the Requirements for the Degree of Master of Science in Computer Science, University of Regina. vi, 70 p."]},{"key":"dc:description.abstract","label":"Abstract","values":["Rough set theory offers a mathematical approach to data analysis and data mining. It can be used to learn classification rules that define classes of a classi- fication based on some well defined concepts. The fundamental task of rough set data analysis is to precisely construct and interpret concepts. When applying rough set theory to rule learning, the main tasks involve removing redundant attributes, redundant attribute-value pairs, and redundant rules in order to obtain a minimal set of simple and general rules. Following Pawlak, we can arrange these tasks into a three-step sequential process, called Pawlak three-step approach, based on a central notion of reducts. One problem is that reducts used in the three steps are de fined and formulated differently. Such an inconsistency in formulation may unnecessarily affects the elegancy of the approach. By adopting the classical view of concepts that interprets a concept by a pair of intension and extension, in this thesis we introduce a generic definition of reducts of a set. We define various reducts used in rough set analysis in a uni ed way. We study several mathematically equivalent, but differently formulated, definitions of reducts. Each definition captures a different aspect of a reduct and their integration provides new insights. The Pawlak three-step approach is reformulated uniformly as a search for different reducts."]},{"key":"dc:title","label":"Title","values":["Reducts and Rough Set Analysis"]}]}],"canonical_facts":{"dc:contributor.advisor":["Yao, Yiyu"],"dc:contributor.committeemember":["Yao, JingTao","Butz, Cortney J."],"dc:creator":["Fu, Rong"],"dc:date.accessioned":["2013-10-31T14:26:28Z"],"dc:date.available":["2013-10-31T14:26:28Z"],"dc:date.issued":["2012-10"],"dc:description":["A Thesis Submitted to the Faculty of Graduate Studies and Research in Partial Fulfillment of the Requirements for the Degree of Master of Science in Computer Science, University of Regina. vi, 70 p."],"dc:description.abstract":["Rough set theory offers a mathematical approach to data analysis and data mining. It can be used to learn classification rules that define classes of a classi- fication based on some well defined concepts. The fundamental task of rough set data analysis is to precisely construct and interpret concepts. When applying rough set theory to rule learning, the main tasks involve removing redundant attributes, redundant attribute-value pairs, and redundant rules in order to obtain a minimal set of simple and general rules. Following Pawlak, we can arrange these tasks into a three-step sequential process, called Pawlak three-step approach, based on a central notion of reducts. One problem is that reducts used in the three steps are de fined and formulated differently. Such an inconsistency in formulation may unnecessarily affects the elegancy of the approach. By adopting the classical view of concepts that interprets a concept by a pair of intension and extension, in this thesis we introduce a generic definition of reducts of a set. We define various reducts used in rough set analysis in a uni ed way. We study several mathematically equivalent, but differently formulated, definitions of reducts. Each definition captures a different aspect of a reduct and their integration provides new insights. The Pawlak three-step approach is reformulated uniformly as a search for different reducts."],"dc:identifier.doi":["https://doi.org/10.82465/4704"],"dc:identifier.uri":["https://hdl.handle.net/10294/3820"],"dc:language.iso":["en"],"dc:publisher":["Faculty of Graduate Studies and Research, University of Regina"],"dc:title":["Reducts and Rough Set Analysis"],"dc:type":["master thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Master's"],"thesis:degree_name":["Master of Science (MSc)"],"thesis:institution_name":["Faculty of Graduate Studies and Research, University of Regina"]},"updated_at":"2026-07-24T04:03:43Z"}