FastICA and Infomax are the most popular algorithms for calculating independent components. These two optimization process usually lead to unstable results. To overcome this drawback, a genetic algorithm for independent component analysis has been developed with enhancement of the independence of the resulting components. By modifying the FastICA to start from given initial point and adopting a new feasible fitness function, the original target of obtaining the maximum mutual independence is achieved. The proposed method is evaluated and tested on a numerical simulative data set from the measures of the normalized mutual information, negentropy and kurtosis, together with the accuracy of the estimated components and mixing vectors. Experimental results on simulated data demonstrate that compared to FastICA and Infomax, the proposed algorithm can give more accurate results together with stronger independence.
{"title":"Independent component analysis based on genetic algorithms","authors":"Gaojin Wen, Chunxiao Zhang, Zhaorong Lin, Zhiming Shang, Hongming Wang, Qian Zhang","doi":"10.1109/ICNC.2014.6975837","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975837","url":null,"abstract":"FastICA and Infomax are the most popular algorithms for calculating independent components. These two optimization process usually lead to unstable results. To overcome this drawback, a genetic algorithm for independent component analysis has been developed with enhancement of the independence of the resulting components. By modifying the FastICA to start from given initial point and adopting a new feasible fitness function, the original target of obtaining the maximum mutual independence is achieved. The proposed method is evaluated and tested on a numerical simulative data set from the measures of the normalized mutual information, negentropy and kurtosis, together with the accuracy of the estimated components and mixing vectors. Experimental results on simulated data demonstrate that compared to FastICA and Infomax, the proposed algorithm can give more accurate results together with stronger independence.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124591675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-08DOI: 10.1109/ICNC.2014.6975838
Feng Wang, Yuan Man, Lichun Man
To address the k shortest paths (KSP) problem, an intelligent optimization approach based on Genetic Algorithm (GA) is presented in this paper. A simple and intuitive natural path representation is firstly employed to be the chromosome encoding scheme. Then genetic operators specific to this encoding scheme are defined respectively. Each partial route of two chosen chromosomes is exchanged by a one-point crossover operator at common intersections. A one and two-point mutation operators are adopted to perform mutation operations for directed and undirected graphs respectively. And a bidirectional searching strategy is applied to eliminate loops in the paths generated by the above genetic operators. Comparative experiments were conducted on test graphs by using different strategies of genetic operations, mutation rates and operators. And the experimental results verify the validity of the proposed algorithm.
{"title":"Intelligent optimization approach for the k shortest paths problem based on genetic algorithm","authors":"Feng Wang, Yuan Man, Lichun Man","doi":"10.1109/ICNC.2014.6975838","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975838","url":null,"abstract":"To address the k shortest paths (KSP) problem, an intelligent optimization approach based on Genetic Algorithm (GA) is presented in this paper. A simple and intuitive natural path representation is firstly employed to be the chromosome encoding scheme. Then genetic operators specific to this encoding scheme are defined respectively. Each partial route of two chosen chromosomes is exchanged by a one-point crossover operator at common intersections. A one and two-point mutation operators are adopted to perform mutation operations for directed and undirected graphs respectively. And a bidirectional searching strategy is applied to eliminate loops in the paths generated by the above genetic operators. Comparative experiments were conducted on test graphs by using different strategies of genetic operations, mutation rates and operators. And the experimental results verify the validity of the proposed algorithm.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123920328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-08DOI: 10.1109/ICNC.2014.6975902
Peili Yang, Zhongqi Yang, Shien Ge
Cache-based side channel attack has been extensively studied in recent years due to the possibly high damage it would cause. We are interested in replaying one instance of such attack to prove its feasibility and explore its details. Based on the literature review, we implemented a cache-based covert channel on a x86 machine and evaluated its performance by statistical analysis. Under certain limitations, we found that the channel can achieve a bandwidth as high as 1MB/s with over 99% accuracy, which is fairly enough to carry large amount of information.
{"title":"Establishing covert channel on shared cache architecture","authors":"Peili Yang, Zhongqi Yang, Shien Ge","doi":"10.1109/ICNC.2014.6975902","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975902","url":null,"abstract":"Cache-based side channel attack has been extensively studied in recent years due to the possibly high damage it would cause. We are interested in replaying one instance of such attack to prove its feasibility and explore its details. Based on the literature review, we implemented a cache-based covert channel on a x86 machine and evaluated its performance by statistical analysis. Under certain limitations, we found that the channel can achieve a bandwidth as high as 1MB/s with over 99% accuracy, which is fairly enough to carry large amount of information.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130497609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-08DOI: 10.1109/ICNC.2014.6975842
B. Thabti, H. Youssef, A. Mahjoub, A. Meddeb
In this paper, we studied Virtual Private Network Design Problem using tree structure and assuming a pipe traffic matrix. Today with network virtualization, Virtual Private Networks (VPNs) have more importance in networking and offers the company the ideal solution to establish ondemand overlay networks that enable their customers to securely access company resources. This is a hard combinatorial optimization problem that it has been solved in literature only with approximation methods. Generally, this kind of methods do not give any guarantee on the solution quality and we are enable to know a priori how far the given solution is from the optimal one unlike other methods such as the exact methods. For this purpose, we propose an integer linear program (ILP) with classical Pipe traffic model to design the problem under investigation. Based on the proposed integer programming formulation, we solve the problem using two approaches: The first contribution is Simulated Evolution based evolutionary algorithm and the second contribution is an exact method based on Branch and Cut (B&C) algorithm to find a tree rooted at a user specified node with minimized overall reserved bandwidth. Performance results using Brite networks show that our proposed evolutionary algorithm offers good solutions within a fraction of the time required by the B&C algorithm and bandwidth cost within at most 1.5% of the optimal solutions found by the exact method.
本文采用树形结构，假设一个管道流量矩阵，研究了虚拟专用网的设计问题。在网络虚拟化的今天，虚拟专用网(vpn)在网络中更加重要，并为公司提供了理想的解决方案，以建立按需覆盖网络，使其客户能够安全地访问公司资源。这是一个很难的组合优化问题，在文献中只能用近似方法来解决。一般来说，这种方法不保证解的质量，而且与其他方法如精确方法不同，我们可以先验地知道给定解与最优解的距离。为此，我们提出了一个基于经典管道交通模型的整数线性规划(ILP)来设计所研究的问题。基于所提出的整数规划公式，我们采用两种方法来解决问题:第一种是基于模拟进化的进化算法，第二种是基于Branch and Cut (B&C)算法的精确方法，以最小的总体保留带宽在用户指定节点上找到扎根的树。使用Brite网络的性能结果表明，我们提出的进化算法在B&C算法所需的时间的一小部分内提供了良好的解，并且带宽成本最多在精确方法找到的最优解的1.5%内。
{"title":"Simulated evolution based algorithm versus exact method for virtual private network design","authors":"B. Thabti, H. Youssef, A. Mahjoub, A. Meddeb","doi":"10.1109/ICNC.2014.6975842","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975842","url":null,"abstract":"In this paper, we studied Virtual Private Network Design Problem using tree structure and assuming a pipe traffic matrix. Today with network virtualization, Virtual Private Networks (VPNs) have more importance in networking and offers the company the ideal solution to establish ondemand overlay networks that enable their customers to securely access company resources. This is a hard combinatorial optimization problem that it has been solved in literature only with approximation methods. Generally, this kind of methods do not give any guarantee on the solution quality and we are enable to know a priori how far the given solution is from the optimal one unlike other methods such as the exact methods. For this purpose, we propose an integer linear program (ILP) with classical Pipe traffic model to design the problem under investigation. Based on the proposed integer programming formulation, we solve the problem using two approaches: The first contribution is Simulated Evolution based evolutionary algorithm and the second contribution is an exact method based on Branch and Cut (B&C) algorithm to find a tree rooted at a user specified node with minimized overall reserved bandwidth. Performance results using Brite networks show that our proposed evolutionary algorithm offers good solutions within a fraction of the time required by the B&C algorithm and bandwidth cost within at most 1.5% of the optimal solutions found by the exact method.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129259292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The genetic algorithm is widely applied to all kinds of formula problems for its characteristics of simpleness, universality, strong robustness and less mathematical demands for optimization problems. However, the traditional standard genetic algorithm has a great blindness when generating the initial population and in the crossover and mutation process, which results in extremely low efficiency. In this paper, according to the characteristics of the formula problems, we propose to add constraints of formula problems to the initial population generation process and the crossover and mutation process and this reduces the blindness and improves the algorithm efficiency. In view of recipe issues, a quick generation method for the initial population is presented and a new crossover and mutation method is presented. We implemented the optimized genetic algorithm on Matlab and verified the feasibility and high-efficiency of the algorithm.
{"title":"The application and optimization of genetic algorithms in formula problems","authors":"Nian-yun Shi, Pei-yao Li, Zhuo-jun Li, Qing-dong Zhang","doi":"10.1109/ICNC.2014.6975843","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975843","url":null,"abstract":"The genetic algorithm is widely applied to all kinds of formula problems for its characteristics of simpleness, universality, strong robustness and less mathematical demands for optimization problems. However, the traditional standard genetic algorithm has a great blindness when generating the initial population and in the crossover and mutation process, which results in extremely low efficiency. In this paper, according to the characteristics of the formula problems, we propose to add constraints of formula problems to the initial population generation process and the crossover and mutation process and this reduces the blindness and improves the algorithm efficiency. In view of recipe issues, a quick generation method for the initial population is presented and a new crossover and mutation method is presented. We implemented the optimized genetic algorithm on Matlab and verified the feasibility and high-efficiency of the algorithm.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128241269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-08DOI: 10.1109/ICNC.2014.6975880
A. Wedyan, A. Narayanan
The Capacitated Vehicle Routing Problem (CVRP) is a well-known NP-hard problem of importance to real life applications such as transportation and logistics. The CVRP finds the best set of paths between a specific number of customers to deliver goods by a number of vehicles with a fixed capacity. In this paper, we apply a new nature inspired optimization algorithm called Intelligent Water Drops (IWD) inspired by water flow. The results of this IWD approach are compared against a classical approach and show that IWD algorithm gives optimal and near optimal solutions for some CVRP instances.
{"title":"Solving capacitated vehicle routing problem using intelligent water drops algorithm","authors":"A. Wedyan, A. Narayanan","doi":"10.1109/ICNC.2014.6975880","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975880","url":null,"abstract":"The Capacitated Vehicle Routing Problem (CVRP) is a well-known NP-hard problem of importance to real life applications such as transportation and logistics. The CVRP finds the best set of paths between a specific number of customers to deliver goods by a number of vehicles with a fixed capacity. In this paper, we apply a new nature inspired optimization algorithm called Intelligent Water Drops (IWD) inspired by water flow. The results of this IWD approach are compared against a classical approach and show that IWD algorithm gives optimal and near optimal solutions for some CVRP instances.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117061808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-08DOI: 10.1109/ICNC.2014.6975844
H. Ge, Z. Ma, Liang Sun
In this paper, a Hierarchical Particle Swarm Optimizer with Random Social Cognition, briefly expressed as HPSO-RSC, is proposed. During the execution process of HPSO-RSC, the social environment is changed dynamically, and each particle is not only attracted by its previous best particle and the global best particle of the whole population, but also attracted by all other better particles randomly. During the early stage of the execution process, to speed up convergence of the algorithm, the particles are inclined to choose the global best particle as cognition object. On the other hand, during the late stage of the execution process, to keep the diversity of the population, the particles are inclined to choose the particles that better than themselves as cognition object. To solve the large scale global optimization problem, the algorithm is integrated into a cooperative coevolution framework with an efficient variable interaction checking method. Simulated experiments were conducted on the CEC'2008 benchmarks. The result demonstrates that, HPSO-RSC has strong ability to find the global optimum for most of the benchmark problems.
{"title":"A hierarchical particle swarm optimizer with random social cognition for large scale global optimization","authors":"H. Ge, Z. Ma, Liang Sun","doi":"10.1109/ICNC.2014.6975844","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975844","url":null,"abstract":"In this paper, a Hierarchical Particle Swarm Optimizer with Random Social Cognition, briefly expressed as HPSO-RSC, is proposed. During the execution process of HPSO-RSC, the social environment is changed dynamically, and each particle is not only attracted by its previous best particle and the global best particle of the whole population, but also attracted by all other better particles randomly. During the early stage of the execution process, to speed up convergence of the algorithm, the particles are inclined to choose the global best particle as cognition object. On the other hand, during the late stage of the execution process, to keep the diversity of the population, the particles are inclined to choose the particles that better than themselves as cognition object. To solve the large scale global optimization problem, the algorithm is integrated into a cooperative coevolution framework with an efficient variable interaction checking method. Simulated experiments were conducted on the CEC'2008 benchmarks. The result demonstrates that, HPSO-RSC has strong ability to find the global optimum for most of the benchmark problems.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125572739","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-08DOI: 10.1109/ICNC.2014.6975932
Zuoyong Xiang, Zhenghong Yu
This paper presents a clustering algorithm based on Voronoi diagrams. The algorithm firstly constructs irregular grids in plane by Voronoi diagrams, then assign the points among different grids to different clusters according to the property of the Voronoi diagrams' “the nearest neighbor”. It is able to automatically modify the final clustering number based on the grid points' density, and it can adjust the locations for the Voronoi's seeds by the changes of the centroids, and the final Voronoi cells becomes the clustering result. The algorithm is able to settle down the clustering numbers automatically and also can recognize the low density points automatically. The experiments prove that the algorithm can cluster effectively the data points in plane, and its performance is similar to the X-means algorithm which is improved on the K-means algorithm. It is more effective than the DBSCAN and the OPTICS which are density-based clustering algorithms. The algorithm proved to be obviously more effective while the experimental data is in a larger scale.
{"title":"Voronoi-clustering for plane data","authors":"Zuoyong Xiang, Zhenghong Yu","doi":"10.1109/ICNC.2014.6975932","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975932","url":null,"abstract":"This paper presents a clustering algorithm based on Voronoi diagrams. The algorithm firstly constructs irregular grids in plane by Voronoi diagrams, then assign the points among different grids to different clusters according to the property of the Voronoi diagrams' “the nearest neighbor”. It is able to automatically modify the final clustering number based on the grid points' density, and it can adjust the locations for the Voronoi's seeds by the changes of the centroids, and the final Voronoi cells becomes the clustering result. The algorithm is able to settle down the clustering numbers automatically and also can recognize the low density points automatically. The experiments prove that the algorithm can cluster effectively the data points in plane, and its performance is similar to the X-means algorithm which is improved on the K-means algorithm. It is more effective than the DBSCAN and the OPTICS which are density-based clustering algorithms. The algorithm proved to be obviously more effective while the experimental data is in a larger scale.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"430 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122801267","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-08DOI: 10.1109/ICNC.2014.6975814
Yalei Quan, X. Yang
Drum water level is an important parameter for boilers on both thermal power plant and nuclear power plant. It is hard to measure the level correctly. So it brings some difficulties to the control based on the drum water level, even the alarm. Usually, more than three water gauges are installed for drum water level measurement. And it adopts two-out-of-three strategy for obtaining the final alarm signal in distributed control system (DCS), which is often the false alarm. Without the right alarm, it is to result in very serious disaster on power plant. One approach based on Back-Propagation (BP) Neural Network is proposed in this paper for solving the problem. The measurements from different water gauges are inputted into the BP Neural Network after fuzzy process and the output of the Network represents the type of alarm. Some data of the drum water level from a nuclear power plant is applied with the method of the paper. From the experiments, it can be seen that the alarm accuracy is increased rapidly.
{"title":"A method for alarming water level of boiler drum on nuclear power plant based on BP Neural Network","authors":"Yalei Quan, X. Yang","doi":"10.1109/ICNC.2014.6975814","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975814","url":null,"abstract":"Drum water level is an important parameter for boilers on both thermal power plant and nuclear power plant. It is hard to measure the level correctly. So it brings some difficulties to the control based on the drum water level, even the alarm. Usually, more than three water gauges are installed for drum water level measurement. And it adopts two-out-of-three strategy for obtaining the final alarm signal in distributed control system (DCS), which is often the false alarm. Without the right alarm, it is to result in very serious disaster on power plant. One approach based on Back-Propagation (BP) Neural Network is proposed in this paper for solving the problem. The measurements from different water gauges are inputted into the BP Neural Network after fuzzy process and the output of the Network represents the type of alarm. Some data of the drum water level from a nuclear power plant is applied with the method of the paper. From the experiments, it can be seen that the alarm accuracy is increased rapidly.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130092908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-08DOI: 10.1109/ICNC.2014.6975882
Carine Pierrette Mukamakuza, Jia-yang Wang, Li Li
In this paper analysis of reduction and dynamic reducts of an information data is presented. The method of reduction in information system is explained first, the information was assumed to be in a two-dimension or in a matrix form. A discernibility matrix of the data was constructed, and then all reducts from that matrix were found. The best (optimum) reduct was selected from all reducts; that was achieved by considering the one with the highest level of frequency by using Java programming and Weka tool. Three methods of dynamic reducts computation are introduced namely: The new type of Reduct in the object-oriented rough set model which is called dynamic reduct, the method of dynamic reduct calculation based on calculating of reduct traces and the generation F-dynamic reduct using cascading Hashes. The analysis of those three methods led to their improvement through adding one step in each algorithm which was the method of getting the optimum reducts from all reducts calculated in first steps of each algorithm. As result, the dynamic reducts were generated from optimum reducts and not from all reducts. Thus by generating an improved dynamic reducts, improvement of those three methods for calculation of dynamic reducts is achieved.
{"title":"Dynamic reducts computation analysis based on rough sets","authors":"Carine Pierrette Mukamakuza, Jia-yang Wang, Li Li","doi":"10.1109/ICNC.2014.6975882","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975882","url":null,"abstract":"In this paper analysis of reduction and dynamic reducts of an information data is presented. The method of reduction in information system is explained first, the information was assumed to be in a two-dimension or in a matrix form. A discernibility matrix of the data was constructed, and then all reducts from that matrix were found. The best (optimum) reduct was selected from all reducts; that was achieved by considering the one with the highest level of frequency by using Java programming and Weka tool. Three methods of dynamic reducts computation are introduced namely: The new type of Reduct in the object-oriented rough set model which is called dynamic reduct, the method of dynamic reduct calculation based on calculating of reduct traces and the generation F-dynamic reduct using cascading Hashes. The analysis of those three methods led to their improvement through adding one step in each algorithm which was the method of getting the optimum reducts from all reducts calculated in first steps of each algorithm. As result, the dynamic reducts were generated from optimum reducts and not from all reducts. Thus by generating an improved dynamic reducts, improvement of those three methods for calculation of dynamic reducts is achieved.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127311341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：