覆盖粗糙集及其属性约简算法研究.pdf

文档介绍：河北大学
硕士学位论文
覆盖粗糙集及其属性约简算法研究
姓名:刘凯
申请学位级别:硕士
专业:管理科学与工程
指导教师:任志波
2011-05
ʼᡅ
ʼᡅ
௳؄Ǎʻ͔ˇĚՈ4ǡí&rȴʌႮᵯՈঢuĄÃńϣ“^ඓዩẋ࣏ࢳ╓
r#ₓՈϔǒϢ໐ΞŁºẝ‡ϔǒǣ4ƅãȨՈǍʻ«ϔǒźǼƚ࢕ᡅᢧΟՈₑͥ
᫂L7P4୛஝▊ˊ᩾«ϵ Pawlak ȴϦՈP࢑̠ˊϔǒźǼ:ǻ]ܲǎɳʐ]ǀ̣
Ȍ1ͣ4᪩ˊ᩾ՈʴȏɁ«Ȗz਍ã͟ிՈZẕĨʐ[ẕĨȋ­ẝ
᪊Ոϔǒکɳ
ՈƮś4ϵzȖz਍ã͟ிՈ᪊ᜬ߾tΟਚᢈکɁdzÑȺ╔ȯńǍʻிඣՈ
ඓͤ୛஝▊ˊ᩾ń̩ƾՈǍʻிඣՈàϬǛ4r└:üǸ̶᩼ۘऺ້ȭ͢ẟᜐrȌ
ˊ▊Ë͢ -Ϭ᩾ǻZՈᡊ֚ȀỤrZ[ẕĨਜ਼Ƅº໐ņএrᡊ֚୛஝
Ȁrᡊ֚୛஝▊ˊ᩾4᩾.C. Tsang ǎ5r᪵Ȱᡊ֚୛஝▊ˊ᩾᪩ˊ᩾ẟPǹ
ϵz୛஝▊ˊ᩾Z[ẕĨਜ਼ƄՈₑᡅɳᯬȭɢɳń᪵Ȱᡊ֚୛஝▊ˊ᩾Â]tএ
üǸƨȭ .C. Tsang ǎ5ՈZ[ẕĨਜ਼ƄẟᜐrǚΝūͣ͢ƅȭɢɳÂᩬ᩾r
࢑µƧՈּ͟ɳᯬʐƷØ7ⒸՈ͟ி4
ϵzඓͤ୛஝▊ˊ᩾]IJǛ†̌ϔǒՈƽˑ»ǭ⏝࿁Ÿ:üǸ Ziarko ǜஂò୛
஝▊µƧỞẋš͑Pdžϔǡ̠ˊẝି⒲LIJ᪩ˊ᩾¹ϢǛ└z᩾ǻZՈ]dzľ
͟
ிƨȋℸǜஂò୛஝▊ˊ᩾Ոɩ̿ǎ5rȖz᪵Ȱᡊ֚Ոdzǜஂò୛஝▊µƧÂ
ȭּ͢͟ɁʐÏϔɳᯬẟᜐrᩬ᩾4
«ϔǒźǼ:ǻՈPₑͥ⒲L୛஝▊ˊ᩾ň&P࢑ϔ᪊൪੄ʒɳ൪੄ک
ǒźǼ1̶ͣÀǡPָႸŸzȭʒɳ൪੄ਜ਼ͩՈۘऺ4Ñnjȭzᡊ֚୛஝▊ˊ᩾Ոۘऺ
ƓₑzẕĨਜ਼Ƅǎ͢ɳᯬՈۘऺWilliam Zhu ń ᡊ֚୛஝▊µƧՈ̶̓
᪊ß΃ŅϔǒՈäƫ±«4┨Pک┨ZȴϦrP࢑൪੄5ͩ᪩5ͩň&P࢑4܄Ȗ
ᡊ֚Ո΃Ņ̯௤üǸ͢àϬᇇĐǛ4rǽ̓Ո└:ƨȺ᪅ǒˊ᩾^Ȗz᪵Ȱ
ᡊ֚୛஝▊ˊ᩾Ոɩ̿඗Ȍ᰻ǡȴϦrP࢑,Ոᡊ֚୛஝▊ʒɳ൪੄ਜ਼ͩŷȖz᪅ǒ
᩾Ո᪵Ȱᡊ֚୛஝▊Bʒɳ൪੄ਜ਼ͩżȒȺ᪩ਜ਼ͩàϬz̶ȨǍʻிඣ4ˊ
⏲᪑୛஝▊ʒɳ൪੄᪅ǒˊ᩾ᡊ֚͟
I
Abstract
Abstract
With the advant of globalization of panies has accumulated vast amounts
of data in the process of production and management for the purpose of improving their
competitive advantage. How to get valuable information from these data is one of the key
problems to be solved in the field of data mining. Rough set theory bas been proposed by
Pawlak as a tool of data analysis for dealing with uncert ainty and plete knowledge in
data core concepts of the rough sets are lower and upper approximations based on
eqivalence relations, and the knowledge which hidden in the information system can be
expressed in the form of decision rules by m eans of these two concepts. Since classical rough
set based on equivalence relations has been limited plex information system,it has been
generalized by many researchers. Z. Bonikowski establish a covering rough set theory by
using the covering of th e domain to construct the lower and upper approximations. .C.
Tsang defi