Publications (4)0 Total impact
-
Conference Proceeding: Knowledge reduction in a new information view
[show abstract] [hide abstract]
ABSTRACT: Knowledge reduction is a very important issue in the rough set theory. In inconsistent decision tables, knowledge reduction under the traditional information view is not equivalent to that under the algebra view, and reducts obtained under the information view may not be reducts under the algebra view. In this paper we propose these new definitions of conditional entropy and attribute significance to overcome this problem. Because attribute significance under the new definition is able to reflect the change of the condition attributes distribution with respect to the positive region in the process of reduction, it is a better heuristic information compared with existing attribute significance. We also propose a complete heuristic algorithm for knowledge reduction. Empirical evidence shows that this algorithm is both efficient and tends to obtain minimal or optimal reducts.Communications, Circuits and Systems, 2005. Proceedings. 2005 International Conference on; 06/2005 -
Conference Proceeding: A Divide-and-Conquer Discretization Algorithm.
Fuzzy Systems and Knowledge Discovery, Second International Conference, FSKD 2005, Changsha, China, August 27-29, 2005, Proceedings, Part I; 01/2005 -
Article: A divide-and-conquer discretization algorithm
[show abstract] [hide abstract]
ABSTRACT: The problem of real value attribute discretization can be converted into the reduct problem in the Rough Set Theory, which is NP-hard and can be solved by some heuristic algorithms. In this paper we show that the straightforward conversion is not scalable and propose a divide-and-conquer algorithm. This algorithm is fully scalable and can reduce the time complexity dramatically especially while integrated with the tournament discretization algorithm. Parallel versions of this algo-rithm can be easily written, and their complexity depends on the number of objects in each subtable rather than the number of objects in the ini-tial decision table. There is a tradeoff between the time complexity and the quality of the discretization scheme obtained, and this tradeoff can be made through adjusting the number of subtables, or equivalently, the number of objects in each subtable. Experimental results confirm our analysis and indicate appropriate parameter setting. -
Article: Secure Grid Information Service System
[show abstract] [hide abstract]
ABSTRACT: A Grid Information Service (GIS) stores informa-tion about the resources of a distributed computing environment and answers questions about it. Currently, no enough attention has been devoted to the security issue. We are developing SecureGIS, a new GIS pattern combining digital certificate with Universal Description, Discovery, and Integration (UDDI) and Role-Based Access Control (RBAC) technologies. SecureGIS checks user identity, confirms the authenticity of service infor-mation and ensures the privacy of private and/or secret grid services. Furthermore, since UDDI is adopted, grid service and web service information can be stored and managed in a unified manner.
