基于粗糙集理论的数据挖掘模型及属性约简算法研究-电路与系统专业论文.docxVIP

重庆大学硕士学位论文 重庆大学硕士学位论文 英文摘要 Abstract Knowledge discovery in database(KDD)，a new generation of tools and techniques for automatic and intelligent database analysis，is an．active area with the promise for high payo行in many business and scientific application．It is defined as the nontrivial process of identi蜘ng valid，novel，potentially useful and ultimately understandable patterns in data．Data mining is the core step ofthe knowledge discovery． The theory of Rough Sets，presented in 1982 by polish mathematician-Z．Pawlak．is powerful mathematical tool for analyzing uncertain．unclear data and is widely applied to knowledge discovery data mining． The following two aspects are focused in this paper．One is the mathematical model of the data mining based on the Rough Sets，and the other is the attribute reduction algorithm based on the Rough Sets． Traditional mathematical model of data mining based on the Rough Sets Can not be applied to deal而tll the database directly．For the sake of this，an improved mathematical model ofdata mimng based on the Rough Sets is presented in this paper Attribute reduction algorithm is the key for the model and the focus of the Rough Sets． For the time being，many reductiou algofithra B．rC presented，however，most of them are inefficient 01impractical．On the basis of the research Rough Sets theory and known reduction algorithms，an improved attribute reduction algorithm is presented in this paper．This heuristic，improved attribute reduction algorithm，based on the Hu’S algorithm and Jelonek’s algorithm，Can guarantee reduction compared wim the Hu’S algorithm，and on the other hand，has better efficiency as far as time is concerned compared with the Jdonek’S algorithm． Keyword：Data Mining， Knowledge Discovery， Rough Sets Discernibility Matrix， Reduction， H 重庆大学硕士学位论文 重庆大学硕士学位论文 1绪论 1绪论 1．1概述 信息产业是现代社会的三大支柱产业之一，信息是现代社会的基础，而数据 库技术则又是信息处理技术的基石。随着科技的发展，各种数据库规模越来越大， 数据库