摘要
Generallyadatabaseencompassesvariouskindsofknowledgeandissharedbymanyusers.Differentusersmaypreferdifferentkindsofknowledge.Soitisimportantforadataminingalgorithmtooutputspecificknowledgeaccordingtousers'currentrequire-ments(preference).Wecallthiskindofdataminingrequirement-orientedknowledgediscovery(ROKD).Whentheroughsettheoryisusedindatamining,theROKDproblemishowtofindareductandcorrespondingrulesinterestingfortheuser.Sincereductsandrulesaregeneratedinthesameway,thispaperonlyconcernswithhowtofindaparticularreduct.Theuser'srequirementisdescribedbyanorderofattributes,calledattributeorder,whichimpliestheim-portanceofattributesfortheuser.Intheorder,moreimportantattributesarelocatedbeforelessimportantones.Thentheproblembecomeshowtofindareductincludingthoseattributesanteriorintheattributeorder.Anapproachtodealingwithsuchaproblemisproposed.Anditscompletenessforreductisproved.Afterthat,threekindsofattributeorderaredevelopedtodescribevarioususerrequirements.
出版日期
2002年05月15日（中国期刊网平台首次上网日期，不代表论文的发表时间）
