Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Indonesian Journal of Electrical Engineering and Computer Science
Zhi Huilai
Henan Polytechnic University

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

 1 
A Bisection Method for Information System Knowledge Reduction Zhi Huilai
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 9: September 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In rough set theory, attribute reduction aims to retain the discernability of the original attribute set, and many attribute reduction algorithms have been proposed in literatures. However, these methods are computationally time-consuming for large scale datasets. We develop a bisection method for attribute reduction and the main opinion is to partition the universe into smaller ones by using partition core attributes to reduce the complexity. Experiments and analysis show that, compared with the traditional un-bisection reduction algorithm, the developed bisection algorithm can significantly reduce computational time while maintaining their results as same as before. http://dx.doi.org/10.11591/telkomnika.v12i9.4913 
Reduction on Propositional Logic Set based on Correlation Analysis Zhi Huilai
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 7: July 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i7.pp5567-5574

Abstract

A knowledge base is redundant if it contains parts that can be inferred from the rest of it. In this paper, with no district bound, we study the reduction theory and algorithm on proposition logic set. The propositions of a given proposition set fall into three categories: necessary proposition, useful proposition, and useless proposition. A reduction of a given set is composed of all the necessary propositions and some useful propositions. At the beginning we introduce induced formal context of proposition set, and then propose the method of reduction on proposition set based on correlation analysis.
A Complete Lattice Lossless Compression Storage Model Zhi Huilai
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 8: August 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In this paper, a complete lattice lossless compression storage model is proposed to improve the storage efficiency. In order to build the proposed model, first all the upper and lower irreducible elements of the complete lattice are identified respectively, then an isomorphic mapping form the complete lattice to a concept lattice is founded, and finally a matrix is used to store the formal context of the concept lattice. Compared with using adjacent matrix, example and analysis show that the proposed method can improve the storage efficiency of complete lattice. DOI: http://dx.doi.org/10.11591/telkomnika.v12i8.5854 
Co-Authors