信息表中不完備數據的填補方法

<th id="5nh9l"></th><strike id="5nh9l"></strike>

<th id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"></th><strike id="5nh9l"></strike>

<progress id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"><noframes id="5nh9l">

<th id="5nh9l"></th> <strike id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"></span>

<progress id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"></span>

<strike id="5nh9l"><noframes id="5nh9l"><strike id="5nh9l"></strike>

<span id="5nh9l"><noframes id="5nh9l">

<span id="5nh9l"><noframes id="5nh9l">

<span id="5nh9l"></span>

<th id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"></th>

<progress id="5nh9l"><noframes id="5nh9l">

留言板

尊敬的讀者、作者、審稿人, 關于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復。謝謝您的支持!

姓名
郵箱
手機號碼
標題
留言內容
驗證碼

信息表中不完備數據的填補方法

鄂旭, 高學東, 武森, 張秋月

文章導航 > 工程科學學報 > 2005 > 27(3): 364-366

鄂旭, 高學東, 武森, 張秋月. 信息表中不完備數據的填補方法[J]. 工程科學學報, 2005, 27(3): 364-366. doi: 10.13374/j.issn1001-053x.2005.03.027

引用本文:

鄂旭, 高學東, 武森, 張秋月. 信息表中不完備數據的填補方法[J]. 工程科學學報, 2005, 27(3): 364-366. doi: 10.13374/j.issn1001-053x.2005.03.027

E Xu, GAO Xuedong, WU Sen, ZHANG Qiuyue. A New method of packing the missing data[J]. Chinese Journal of Engineering, 2005, 27(3): 364-366. doi: 10.13374/j.issn1001-053x.2005.03.027

Citation:

E Xu, GAO Xuedong, WU Sen, ZHANG Qiuyue. A New method of packing the missing data[J]. Chinese Journal of Engineering, 2005, 27(3): 364-366. doi: 10.13374/j.issn1001-053x.2005.03.027

鄂旭, 高學東, 武森, 張秋月. 信息表中不完備數據的填補方法[J]. 工程科學學報, 2005, 27(3): 364-366. doi: 10.13374/j.issn1001-053x.2005.03.027

引用本文:

鄂旭, 高學東, 武森, 張秋月. 信息表中不完備數據的填補方法[J]. 工程科學學報, 2005, 27(3): 364-366. doi: 10.13374/j.issn1001-053x.2005.03.027

E Xu, GAO Xuedong, WU Sen, ZHANG Qiuyue. A New method of packing the missing data[J]. Chinese Journal of Engineering, 2005, 27(3): 364-366. doi: 10.13374/j.issn1001-053x.2005.03.027

Citation:

E Xu, GAO Xuedong, WU Sen, ZHANG Qiuyue. A New method of packing the missing data[J]. Chinese Journal of Engineering, 2005, 27(3): 364-366. doi: 10.13374/j.issn1001-053x.2005.03.027

信息表中不完備數據的填補方法

doi: 10.13374/j.issn1001-053x.2005.03.027

1. 北京科技大學管理學院, 北京 100083;
2. 遼寧工學院計算機系, 錦州 121001;
3. 北京科技大學管莊校區, 北京 100083

基金項目:

內蒙古自治區高等學校科學研究項目(No.NJ02112)

作者簡介:
鄂旭(1971-).男,講師,博上研究生

中圖分類號: TP18
計量
- 文章訪問數: 151
- HTML全文瀏覽量: 26
- PDF下載量: 6
- 被引次數: 0
出版歷程
- 收稿日期: 2004-06-25
- 修回日期: 2004-11-03
- 網絡出版日期: 2021-08-17

A New method of packing the missing data

1. Management School, University of Science and Technology Beijing, Beijing 100083, China;
2. Department of Computer Science, Liaoning Institute of Technology, Jinzhou 121001, China;
3. Guanzhuang Campus, University of Science and Technology Beijing, Beijing 100024, China

摘要: 提出了一種基于粗糙集的不完備數據填補方法.本算法以突出信息表的決策規則為主要目的,選取重要斷點為主要手段,以分類質量作為迭代約束條件.實驗和數值實例表明,本算法不但不會產生沖突規則,而且能夠進一步突出決策規則.
- 粗糙集 /
- 相關性 /
- 等價類 /
- 斷點
Abstract: A new algorithm for filling up in complete data was presented according to rough sets. In this method, the main purpose was emphasizing the decision rules, the main means was selecting the important breaking points, and the iterative constraint was the quality of classification. Numerical illustration and database experiments show that the algorithm did not generate conflict rules,but highlighted them.
- rough sets /
- correlation /
- equivalent class /
- breaking point

參考文獻(0)

資源附件(0)

WeChat

點擊查看大圖

計量

文章訪問數: 151
HTML全文瀏覽量: 26
PDF下載量: 6
被引次數: 0

/

下載: 全尺寸圖片幻燈片

分享

用微信掃碼二維碼

分享至好友和朋友圈

返回

<th id="5nh9l"></th><strike id="5nh9l"></strike>

<th id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"></th><strike id="5nh9l"></strike>

<progress id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"><noframes id="5nh9l">

<th id="5nh9l"></th> <strike id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"></span>

<progress id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"></span>

<strike id="5nh9l"><noframes id="5nh9l"><strike id="5nh9l"></strike>

<span id="5nh9l"><noframes id="5nh9l">

<span id="5nh9l"><noframes id="5nh9l">

<span id="5nh9l"></span>

<th id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"></th>

<progress id="5nh9l"><noframes id="5nh9l">