{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:23:14Z","timestamp":1777645394352,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2009,7]]},"abstract":"<jats:p>Dominance-based rough set introduced by Greco et al. is an extension\n\t\t\t of Pawlak\u00a1\u00afs classical rough set theory by using dominance relations\n\t\t\t in place of equivalence relations for approximating sets of preference ordered\n\t\t\t decision classes satisfying upward and downward union properties. This paper\n\t\t\t introduces the concept of indexed blocks for representing dominance-based\n\t\t\t approximation spaces. Indexed blocks are sets of objects indexed by pairs of\n\t\t\t decision values. In our study, inconsistent information is represented by\n\t\t\t exclusive neighborhoods of indexed blocks. They are used to define\n\t\t\t approximations of decision classes. It turns out that a set of indexed blocks\n\t\t\t with exclusive neighborhoods forms a partition on the universe of objects.\n\t\t\t Sequential rules for updating indexed blocks incrementally are considered and\n\t\t\t illustrated with examples.<\/jats:p>","DOI":"10.3233\/fi-2009-122","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T22:50:13Z","timestamp":1575327013000},"page":"133-146","source":"Crossref","is-referenced-by-count":4,"title":["Dominance-Based Rough Sets Using Indexed Blocks as Granules"],"prefix":"10.1177","volume":"94","author":[{"given":"Chien-Chung","family":"Chan","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Akron\r\t\t\t Akron, OH, 44325-4003, USA and Department of Information Communications, Kainan\r\t\t\t University No. 1 Kainan Road, Luchu, Taoyuan County 338, Taiwan.\r\t\t\tE-mail: chan@uakron.edu"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gwo-Hshiung","family":"Tzeng","sequence":"additional","affiliation":[{"name":"Department of Business and Entrepreneurial\r\t\t\t Administration, Kainan University No. 1 Kainan Road, Luchu, Taoyuan County 338,\r\t\t\t Taiwan and Institute of Management of Technology, National Chiao Tung\r\t\t\t University 1001 Ta-Hsueh Road, Hsinchu 300, Taiwan. E-mail: ghtzeng@mail.knu.edu.tw;\r\t\t\t ghtzeng@cc.nctu.edu.tw"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2009,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-122","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:07Z","timestamp":1777444327000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2009-122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["10.3233\/FI-2009-122"],"URL":"https:\/\/doi.org\/10.3233\/fi-2009-122","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}