English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90120/105277 (86%)
Visitors : 8140006      Online Users : 223
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/8884

    Title: Computing approximations of dominance-based rough sets by bit-vector encodings
    Authors: Chan, Chien-Chung;Tzeng, Gwo-Hshiung
    Contributors: Department of Information Science and Applications
    Keywords: Approximation algorithms;Decision making;Decision theory;Encoding (symbols);Equivalence classes;Fuzzy sets;Rough set theory;Set theory;Approximate reasoning;Approximation spaces;Decision classes;Decision values;Dominance relations;Dominance-based rough sets;Encodings;Equivalence relations;Lower and upper approximations;Multiple criteria decision analysis (MCDA);Rough sets;Rough Sets theories
    Date: 2008
    Issue Date: 2010-04-08 20:36:10 (UTC+8)
    Publisher: Asia University
    Abstract: This paper introduces a mechanism for computing approximations of Dominance-Based Rough Sets (DBRS) by bit-vector encodings. DBRS was introduced by Greco et al. as an extension of Pawlak's classical rough sets theory by using dominance relations in place of equivalence relations for approximating sets of preference ordered decision classes. Our formulation of dominance-based approximation spaces is based on the concept of indexed blocks introduced by Chan and Tzeng. Indexed blocks are sets of objects indexed by pairs of decision values where approximations of sets of decision classes are defined in terms of exclusive neighborhoods of indexed blocks. In this work, we introduced an algorithm for updating indexed blocks incrementally, and we show that the computing of dominance-based approximations can be accomplished more intuitively and efficiently by encoding indexed blocks as bit-vectors. In addition, bit-vector encodings can simplify the definitions of lower and upper approximations greatly. Examples are given to illustrate presented concepts. © 2008 Springer Berlin Heidelberg.
    Relation: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5306:131-141
    Appears in Collections:[行動商務與多媒體應用學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    244.doc31KbMicrosoft Word335View/Open

    All items in ASIAIR are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback