检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Nguyen Long Giang Tran Thanh Dai Le Hoang Son Tran Thi Ngan Nguyen Nhu Son Cu Nguyen Giap
机构地区:[1]Institute of Information Technology,Vietnam Academy of Science and Technology,Hanoi,10000,Vietnam [2]Faculty of Information Technology,University of Economics-Technology for Industries,Hanoi,10000,Vietnam [3]VNU Information Technology Institute,Vietnam National University,Hanoi,10000,Vietnam [4]International School,Vietnam National University,Hanoi,10000,Vietnam [5]Center of Science and Technology Research and Development,Thuongmai University,Hanoi,10000,Vietnam
出 处:《Computers, Materials & Continua》2024年第11期3097-3124,共28页计算机、材料和连续体(英文)
基 金:funded by Vietnam National Foundation for Science and Technology Development(NAFOSTED)under Grant Number 102.05-2021.10.
摘 要:Attribute reduction through the combined approach of Rough Sets(RS)and algebraic topology is an open research topic with significant potential for applications.Several research works have introduced a strong relationship between RS and topology spaces for the attribute reduction problem.However,the mentioned recent methods followed a strategy to construct a new measure for attribute selection.Meanwhile,the strategy for searching for the reduct is still to select each attribute and gradually add it to the reduct.Consequently,those methods tended to be inefficient for high-dimensional datasets.To overcome these challenges,we use the separability property of Hausdorff topology to quickly identify distinguishable attributes,this approach significantly reduces the time for the attribute filtering stage of the algorithm.In addition,we propose the concept of Hausdorff topological homomorphism to construct candidate reducts,this method significantly reduces the number of candidate reducts for the wrapper stage of the algorithm.These are the two main stages that have the most effect on reducing computing time for the attribute reduction of the proposed algorithm,which we call the Cluster Filter Wrapper algorithm based on Hausdorff Topology.Experimental validation on the UCI Machine Learning Repository Data shows that the proposed method achieves efficiency in both the execution time and the size of the reduct.
关 键 词:Hausdorff topology rough sets topology from rough sets attribute reduction
分 类 号:TP39[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49