The Research On Of Algorithm On Rough Set Covering And Related Problems

Inductive learning and classification of object from data set are very important areas in artificial intelligence, in order to discover hidden, unknown, potentially useful knowledge in the data, and to search the rule and the general mode from the large data set in essence. In recent years, a lot of theories based on inductive learning have been researched, and a number of techniques are developed to deal with imprecise data. The most successful technique is rough set theory.Rough set theory is a new data analysis, it was first put forward by Poland scientist Z.Pawlak. which is a powerful tool about data reasoning.At present it has been developed to be a new mathematieal tool to deal with vagueness and uneertainiy. It has been applied suceessfully to many areas including machine learning, pattern recognition, decision support, data mining and process colltrol. Presently it has developed to be an important researching direction of artificial inteligent, it has very extensive latent applying background at the field of Data Mining.The theory of Pawlak rongh set was established on the base of equivalence ralation,but in some situations,equivalence relations are not suitable for coping with granularity.Instead the reseachers put forward many kinds of generalized rough set models in order to expand its applications areas. Among these reseach areas, Z.Bonikowski established covering rough set model using a covering of universe. In this paper, we reasonably modified the new definition of the covering. At the same time, discused the propositonn of coving upper approximation oreration and covering lower approximation operation and the reduction of coverings under the new definition. Futhermore, the lower and upper approximation operations have been axiomized. In addition, on the basis of induced coverage, we propose a new coverage -extension cover , On and on the same domain on the expansion covering of the two dependent on the measure and a descripti.also three basic relations between any two elements with respect to the extension cover are discussed in detail.In this Paper,Knowledge universe and knowledge topology are defined.Four kind of topology space are constracted.The connections among and the properties of them are studied.Topological properties of map on Pawlak rough sets model are discussed.And a map between rough set model and a finete set can induce a equivalent relation on the finite set.If the map is regarded as a map between two topological space ,then it is continuous .Fourthermore ,if the map is bijective ,then it is simultaneously open and continuous ,the image and inverse image of a rough set are rough.Based on the research of covering rough set and properties of map. In this paper, by the upper approximation and lower approximation of pansystems topology, we contact insert and tree taxis over linear order system. By introducing partial macro order expend insert and tree taxis which is true over linear order to any order, put forward a general insert and tree arithmetic.In addition, we can construct topology by inserting .