基于pawlak属性重要度的属性约简算法源码代码--大学毕业论文.doc

上传人:红**** 文档编号:91480079 上传时间:2023-05-27 格式:DOC 页数:22 大小:105.50KB
返回 下载 相关 举报
基于pawlak属性重要度的属性约简算法源码代码--大学毕业论文.doc_第1页
第1页 / 共22页
基于pawlak属性重要度的属性约简算法源码代码--大学毕业论文.doc_第2页
第2页 / 共22页
点击查看更多>>
资源描述

《基于pawlak属性重要度的属性约简算法源码代码--大学毕业论文.doc》由会员分享,可在线阅读,更多相关《基于pawlak属性重要度的属性约简算法源码代码--大学毕业论文.doc(22页珍藏版)》请在taowenge.com淘文阁网|工程机械CAD图纸|机械工程制图|CAD装配图下载|SolidWorks_CaTia_CAD_UG_PROE_设计图分享下载上搜索。

1、大概一年前写代码实现了这个算法,今天有人问我要,在这里贴出来好了。具体算法思路我也忘了,但是代码应该还算清晰。只需要事先了解下STL。view plaincopy to clipboardprint?/* 测试数据 21/10 X1 X2 X3 X4 X5 X6 X7 X8 X9 y U1 c 6 y E m h h a m m U2 c 6 n E m m h ma m m U3 c 6 n E m h h ma m m U4 c 4 y E m h h ma l h U5 c 6 n E m m m ma m m U6 c 6 n B m m m a he lo U7 c 6 n E m

2、m h ma he lo U8 s 4 n B sm h lo ma l h U9 c 4 n B sm h lo ma m m U10 c 4 n B sm h m a m m U11 s 4 n E sm h lo ma l h U12 s 4 n E m m m ma m h U13 c 4 n B m m m ma m m U14 s 4 y E sm h h ma m h U15 s 4 n B sm m lo ma m h U16 c 4 y E m m h ma m m U17 c 6 n E m m h a m m U18 c 4 n E m m h a m m U19 s 4

3、 n E sm h m ma m h U20 c 4 n E sm h m ma m h U21 c 4 n B sm h m ma m m */ #include #include #include #include #include #include using namespace std; #define DATA_FILE_NAME ./data.txt #define DEF_ATTR_CNT 10 #define DEF_OBJ_CNT 21 int g_attr_cnt = 0; int g_obj_cnt = 0; class object; vector g_attr_set

4、; vector g_mask; vector g_obj_set; vector g_core_set; vector g_b_set; vectorvector * g_ind_c_set; vectorvector * g_ind_b_set; void clr_mask(const string &attr) int i = 0; for (i = 0; i g_attr_cnt; i+) if (attr = g_attr_seti) g_maski = false; else g_maski = true; void set_mask() int i = 0; for (i = 0

5、; i g_attr_cnt; i+) g_maski = true; void set_mask_set(vector &str_set) int i = 0, j = 0; bool found = false; for (i = 0; i g_attr_cnt; i+) found = false; for (j = 0; j str_set.size(); j+) if (g_attr_seti = str_setj) found = true; break; if (found) g_maski = true; else g_maski = false; class object p

6、ublic: vector attr_val; string obj_name; public: object(const string &name) : obj_name(name) attr_val.reserve(DEF_ATTR_CNT); object() bool operator = (const object &r_obj) const bool res = true; int i = 0; for (i = 0; i strTmp; g_obj_cnt = atoi(strTmp.substr(0, strTmp.find(/).c_str(); g_attr_cnt = a

7、toi(strTmp.substr(strTmp.find(/) + 1, strTmp.length().c_str(); for (i = 0; i strTmp; g_attr_set.push_back(strTmp); g_mask.push_back(true); for (i = 0; i strTmp; p_obj = new object(strTmp); for (j = 0; j strTmp; p_obj-attr_val.push_back(strTmp); / add object g_obj_set.push_back(p_obj); / close file d

8、ata_in.close(); void print_data() int i = 0, j = 0; cout g_obj_cnt / g_attr_cnt ; for (i = 0; i g_attr_cnt; i+) cout setw(4) setiosflags(ios:left) g_attr_seti; if (i g_attr_cnt - 1) cout ; cout endl; cout - endl; for (i = 0; i g_obj_cnt; i+) cout setw(3) obj_name ; for (j = 0; j g_attr_cnt; j+) cout

9、 setw(3) setiosflags(ios:left) attr_valj; if (j g_attr_cnt - 1) cout setw(3) ; cout endl; void clear_data() int i = 0; for (i = 0; i g_obj_cnt; i+) delete g_obj_seti; g_obj_seti = NULL; void clear_ind_set(vectorvector * &ind_set) vector *tmp = NULL; while (!ind_set.empty() tmp = ind_set.back(); dele

10、te tmp; tmp = NULL; ind_set.pop_back(); void app_exit() clear_ind_set(g_ind_c_set); clear_ind_set(g_ind_b_set); void add_obj_to_ind_set(vectorvector * &ind_set, object *p_obj) vector *vec_tmp = NULL; int i = 0; bool found = false; for (i = 0; i push_back(p_obj); break; if (!found) vec_tmp = new vect

11、or; vec_tmp-push_back(p_obj); ind_set.push_back(vec_tmp); bool obj_set_equal(vector &l_obj_set, vector &r_obj_set) if (l_obj_set.size() != r_obj_set.size() return false; bool found = false; int i = 0, j = 0; for (i = 0; i l_obj_set.size(); i+) found = false; for (j = 0; j r_obj_set.size(); j+) if (l

12、_obj_seti = r_obj_setj) found = true; break; if (!found) return false; return true; bool ind_set_equal(vectorvector * &l_ind_set, vectorvector * &r_ind_set) if (l_ind_set.size() != r_ind_set.size() return false; bool found = false; int i = 0, j = 0; for (i = 0; i l_ind_set.size(); i+) found = false;

13、 for (j = 0; j r_ind_set.size(); j+) if (obj_set_equal(*l_ind_seti, *r_ind_setj) found = true; break; if (!found) return false; return true; void core() / get IND(C) int i = 0; vectorvector * ind_set_tmp; set_mask(); for (i = 0; i g_obj_cnt; i+) add_obj_to_ind_set(g_ind_c_set, g_obj_seti); int j = 0

14、; for (i = 0; i g_attr_cnt; i+) clear_ind_set(ind_set_tmp); clr_mask(g_attr_seti); / get IND(C-xi) for (j = 0; j g_obj_cnt; j+) add_obj_to_ind_set(ind_set_tmp, g_obj_setj); if (!ind_set_equal(g_ind_c_set, ind_set_tmp) g_core_set.push_back(g_attr_seti); clear_ind_set(ind_set_tmp); / already get core

15、cout - endl; cout core:n; for (i = 0; i g_core_set.size(); i+) /copy to B g_b_set.push_back(g_core_seti); cout g_core_seti; if (i g_core_set.size() - 1) cout , ; cout n; bool attr_set_equal(vector &l_attr_set, vector &r_attr_set) if (l_attr_set.size() != r_attr_set.size() return false; int i = 0, j

16、= 0; bool found = false; for (i = 0; i l_attr_set.size(); i+) found = false; for (j = 0; j r_attr_set.size(); j+) if (l_attr_seti = r_attr_setj) found = true; break; if (!found) return false; return true; void attr_set_sub(vector &l_attr_set, vector &r_attr_set, vector &res_set) int i = 0, j = 0; bo

17、ol found = false; for (i = 0; i l_attr_set.size(); i+) found = false; for (j = 0; j r_attr_set.size(); j+) if (l_attr_seti = r_attr_setj) found = true; break; if (!found) res_set.push_back(l_attr_seti); void get_ind_set(vector &mask_set, vectorvector * &res_ind_set) int i = 0; / get IND set set_mask

18、_set(mask_set); for (i = 0; i g_obj_cnt; i+) add_obj_to_ind_set(res_ind_set, g_obj_seti); void attr_set_copy(vector &dst_attr_set, vector &src_attr_set) int i = 0; dst_attr_set.clear(); for (i = 0; i src_attr_set.size(); i+) dst_attr_set.push_back(src_attr_seti); void reduction() vector b_set_tmp; v

19、ector c_sub_b; vector max_sig; vectorvector * ind_set_tmp; int max = 0, max_idx = 0, max_cnt = 0; int i = 0, j = 0; / get IND(B) get_ind_set(g_b_set, g_ind_b_set); while (!ind_set_equal(g_ind_c_set, g_ind_b_set) if (attr_set_equal(g_b_set, g_attr_set) break; c_sub_b.clear(); attr_set_sub(g_attr_set,

20、 g_b_set, c_sub_b); max_sig.clear(); for (i = 0; i c_sub_b.size(); i+) attr_set_copy(b_set_tmp, g_b_set); b_set_tmp.push_back(c_sub_bi); clear_ind_set(ind_set_tmp); get_ind_set(b_set_tmp, ind_set_tmp); max_sig.push_back(ind_set_tmp.size() - g_ind_b_set.size(); / now, process max_sig max = max_sig0;

21、max_idx = 0; max_cnt = 0; for (j = 1; j max) max = max_sigj; max_idx = j; max_cnt = 1; else if (max = max_sigj) max_cnt+; g_b_set.push_back(c_sub_bmax_idx); if (attr_set_equal(g_b_set, g_attr_set) break; / get IND(B) clear_ind_set(g_ind_b_set); get_ind_set(g_b_set, g_ind_b_set); clear_ind_set(ind_se

22、t_tmp); / get reduction now cout - endl; cout reduction set:n; for (i = 0; i g_b_set.size(); i+) cout g_b_seti; if (i g_b_set.size() - 1) cout , ; cout n; void print_red_data() int i = 0, j = 0; set_mask_set(g_b_set); cout - endl; cout ; for (i = 0; i g_attr_cnt; i+) if (g_maski) cout setw(4) setios

23、flags(ios:left) g_attr_seti; if (i g_attr_cnt - 1) cout ; cout endl; cout - endl; for (i = 0; i g_obj_cnt; i+) cout setw(3) obj_name ; for (j = 0; j g_attr_cnt; j+) if (g_maskj) cout setw(3) setiosflags(ios:left) attr_valj; if (j g_attr_cnt - 1) cout setw(3) ; cout endl; int main() read_data(); prin

24、t_data(); core(); reduction(); print_red_data(); clear_data(); app_exit(); /* 测试数据21/10 X1 X2 X3 X4 X5 X6 X7 X8 X9 yU1 c 6 y E m h h a m mU2 c 6 n E m m h ma m mU3 c 6 n E m h h ma m mU4 c 4 y E m h h ma l hU5 c 6 n E m m m ma m mU6 c 6 n B m m m a he loU7 c 6 n E m m h ma he loU8 s 4 n B sm h lo ma l hU9 c 4 n B sm h lo ma m mU10 c 4 n B sm h m a m mU11 s 4 n E sm h lo ma l hU12 s 4 n E m m m ma m hU13 c 4 n B m m m ma m mU14 s 4 y E sm h h ma m hU15 s 4 n B

展开阅读全文
相关资源
相关搜索

当前位置:首页 > 教育专区 > 教案示例

本站为文档C TO C交易模式,本站只提供存储空间、用户上传的文档直接被用户下载,本站只是中间服务平台,本站所有文档下载所得的收益归上传人(含作者)所有。本站仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。若文档所含内容侵犯了您的版权或隐私,请立即通知淘文阁网,我们立即给予删除!客服QQ:136780468 微信:18945177775 电话:18904686070

工信部备案号:黑ICP备15003705号© 2020-2023 www.taowenge.com 淘文阁