We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 21 Issue 3
May  2006
Turn off MathJax
Article Contents
Abstract
References
Su-Qing Han, Jue Wang. Second Attribute Algorithm Based on Tree Expression[J]. Journal of Computer Science and Technology, 2006, 21(3): 383-392.
Citation: Su-Qing Han, Jue Wang. Second Attribute Algorithm Based on Tree Expression[J]. Journal of Computer Science and Technology, 2006, 21(3): 383-392.
shu

Second Attribute Algorithm Based on Tree Expression

  • 1Department of Mathematics, Taiyuan Normal University, Taiyuan 030031, P.R. China2Key Laboratory of Complex Systems and Intelligence Science, Institute of Automation, Chinese Academy of Sciences Beijing 100080, P.R. China

More Information
  • Received Date: May 02, 2005
  • Revised Date: November 13, 2005
  • Published Date: May 14, 2006
    Abstract
  • One view of finding a personalized solution of reduct in an informationsystem is grounded on the viewpoint that attribute order can serve as akind of semantic representation of user requirements. Thus the problemof finding personalized solutions can be transformed into computing thereduct on an attribute order. The second attribute theorem describes therelationship between the set of attribute orders and the set of reducts,and can be used to transform the problem of searching solutions to meetuser requirements into the problem of modifying reduct based on a givenattribute order. An algorithm is implied based on the second attributetheorem, with computation on the discernibility matrix. Its timecomplexity is O(n^2*m) (n is the number of the objects andm the number of the attributes of an information system). Thispaper presents another effective second attribute algorithm forfacilitating the use of the second attribute theorem, with computationon the tree expression of an information system. The time complexity ofthe new algorithm is linear in n. This algorithm is proved to beequivalent to the algorithm on the discernibility matrix.
    • FullText(HTML)
    • References (5)
  • [1]
    Wang Jue, Wang Ju. Reduct algorithms on discernibility matrix: The ordered attributes method. \it J. Computer Science and Technology, \rm 2001, 16(6): 489--504.
    [2]
    Zhao Ming. Data description based on reduct theory
    [Dissertation]. Institute of Automation, Chinese Academy of Sciences, 2004.
    [3]
    Han Suqing, Wang Jue. Reduct and attribute order. \it J. Computer Science and Technology, \rm 2004, 19(4): 429--449.
    [4]
    Pawlak Z. Rough sets. \it Int. J. Comput. Inform. Sci., \rm 1982, 11(5): 341--356.
    [5]
    Skowron A, Rauszer C. The Discernibility Matrices and Functions in Information Systems. Intelligent Decision Support Handbook of Applications and Advance of the Rough Sets Theory, Slowinski R (ed.), Kluwer Academic Publishers, 1991, pp.331--362.
    • Relative Articles
  • Supplements (0)

Catalog

    Get Citation
    XML
    Article views (9) PDF downloads (1392) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return