Rearch of optimal reduct under preference

CORC > 兰州理工大学 > 兰州理工大学

	Rearch of optimal reduct under preference
	Li, M; Sui, YF; Zhang, XF
	2004
页码	303-308
英文摘要	With more and more users sharing with the same data resource, different users have different preference and requirement, to the same data, information. Based on this, a new data mining technique emerges, called requirement oriented knowledge discovery. According to the problem of retrieving reducts in rough sets, this article presents a special preference relation ---- dictionary relation. The article describes the optimal reduct under such preference relation,. constructs the data structure to solve the problem and the corresponding algorithm on the designed structure. At last it constructs the algorithm to retrieve the optimal reduct under the such preference relation, and proves the correctness of the algorithm theoretically.
会议录	CONCURRENT ENGINEERING: THE WORLDWIDE ENGINEERING GRID, PROCEEDINGS
会议录出版者	TSINGHUA UNIVERSITY PRESS
会议录出版地	TSINGHUA UNIVERSITY HAIDIANQU, BEIJING 100084, PEOPLES R CHINA
语种	英语
WOS研究方向	Computer Science ; Engineering
WOS记录号	WOS:000225230100045
内容类型	会议论文
源URL	[http://119.78.100.223/handle/2XXMBERH/38349]
专题	兰州理工大学
通讯作者	Li, M
作者单位	Lanzhou Univ Technol, Inst Intelligent Informat Proc, Lanzhou, Peoples R China
推荐引用方式 GB/T 7714	Li, M,Sui, YF,Zhang, XF. Rearch of optimal reduct under preference[C]. 见:.