A Hash Method for Calculating Rough Set Approximations

Rough set theory (RST) contributes a practical mathematic framework for knowledge discovery and uncertainty reasoning. Hash tables, often employed in data mining, are one of important data models in data structure and can fast access an object according to its key. The computation of rough set approximations plays a crucial role as a basic step of knowledge discovery or relevant tasks under RST. The calculation process of approximations, however, is very time-consuming. To address this issue, through integrating generic information system with highly efficient hash table, the concept of hash information systems (HIS) is firstly introduced and some of their properties are explored. Then, A hash-information-system-based method is proposed for the calculation of rough-set approximations. Finally, This study offers an example for illustrating the validity of the presented approach.

[1]  Liu Shao,et al.  Research on Efficient Algorithms for Rough Set Methods , 2003 .

[2]  Dapeng Liu,et al.  An empirical study on the performance of hash table , 2014, 2014 IEEE/ACIS 13th International Conference on Computer and Information Science (ICIS).

[3]  Andrzej Skowron,et al.  Local rough set: A solution to rough data analysis in big data , 2018, Int. J. Approx. Reason..

[4]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[5]  Xiaodong Yue,et al.  Tri-partition neighborhood covering reduction for robust classification , 2017, Int. J. Approx. Reason..

[6]  Theresa Beaubouef,et al.  Rough Sets , 2019, Lecture Notes in Computer Science.

[7]  Meng Liu,et al.  New measures of uncertainty for an interval-valued information system , 2019, Inf. Sci..

[8]  Da Ruan,et al.  A parallel method for computing rough set approximations , 2012, Inf. Sci..

[9]  Hamido Fujita,et al.  Updating three-way decisions in incomplete multi-scale information systems , 2019, Inf. Sci..

[10]  Andrzej Skowron,et al.  Rough mereology: A new paradigm for approximate reasoning , 1996, Int. J. Approx. Reason..

[11]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .

[12]  Thomas Mailund,et al.  The Joys of Hashing , 2019, Apress.

[13]  Duoqian Miao,et al.  Quantitative/qualitative region-change uncertainty/certainty in attribute reduction: Comparative region-change analyses based on granular computing , 2016, Inf. Sci..

[14]  Rajen B. Bhatt,et al.  On fuzzy-rough sets approach to feature selection , 2005, Pattern Recognit. Lett..

[15]  Decui Liang,et al.  Three-way decisions in ordered decision system , 2017, Knowl. Based Syst..

[16]  Bing Huang,et al.  Hierarchical structures and uncertainty measures for intuitionistic fuzzy approximation space , 2016, Inf. Sci..

[17]  Gui-Long Liu,et al.  The Axiomatization of the Rough Set Upper Approximation Operations , 2006, Fundam. Informaticae.

[18]  Yiyu Yao,et al.  A unified model of sequential three-way decisions and multilevel incremental processing , 2017, Knowl. Based Syst..

[19]  Tu Li,et al.  Frequent items mining on data stream using hash-table and heap , 2009, 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems.

[20]  Geert Wets,et al.  A rough sets based characteristic relation approach for dynamic attribute generalization in data mining , 2007, Knowl. Based Syst..

[21]  Cungen Cao,et al.  A hybrid approach to outlier detection based on boundary region , 2011, Pattern Recognit. Lett..

[22]  Yiyu Yao,et al.  Rough set models in multigranulation spaces , 2016, Inf. Sci..

[23]  M. Jeya Sutha,et al.  An effective hashtable-based approach for incrementally mining closed frequent itemsets using sliding windows , 2016, Int. J. Data Min. Model. Manag..

[24]  Shi-Jinn Horng,et al.  Matrix-based dynamic updating rough fuzzy approximations for data mining , 2017, Knowl. Based Syst..