By Marcin Szczuka (auth.), Pawan Lingras, Marcin Wolski, Chris Cornelis, Sushmita Mitra, Piotr Wasilewski (eds.)

This publication constitutes the completely refereed convention lawsuits of the eighth foreign convention on tough units and information expertise, RSKT 2013, held in Halifax, Canada in October 2013 as one of many co-located meetings of the 2013 Joint tough Set Symposium, JRS 2013. The sixty nine papers (including forty four standard and 25 brief papers) integrated within the JRS lawsuits (LNCS 8170 and LNCS 8171) have been conscientiously reviewed and chosen from 106 submissions. The papers during this quantity hide themes reminiscent of historical past and way forward for tough units; foundations and probabilistic tough units; principles, reducts, ensembles; new developments in computing; three-way choice tough units; and studying, predicting, modeling.

Show description

Read Online or Download Rough Sets and Knowledge Technology: 8th International Conference, RSKT 2013, Halifax, NS, Canada, October 11-14, 2013, Proceedings PDF

Best international books

The Routledge International Handbook of Globalization Studies (Routledge International Handbooks)

The Routledge International Handbook of Globalization reports deals scholars transparent and expert chapters at the historical past of globalization and key theories that experience thought of the factors and effects of the globalization approach. There are major sections taking a look at demographic, fiscal, technological, social and cultural alterations in globalization.

The Chern Symposium 1979: Proceedings of the International Symposium on Differential Geometry in honor of S.-S. Chern, held in Berkeley, California, June 1979

This quantity attests to the power of differential geometry because it probes deeper into its inner constitution and explores ever widening connections with different matters in arithmetic and physics. To such a lot folks Professor S. S. Chern is glossy differential geometry, and we, his scholars, are thankful to him for major us to this fertile panorama.

Partially Supervised Learning: Second IAPR International Workshop, PSL 2013, Nanjing, China, May 13-14, 2013, Revised Selected Papers

This ebook constitutes the completely refereed revised chosen papers from the second one IAPR overseas Workshop, PSL 2013, held in Nanjing, China, in might 2013. the ten papers incorporated during this quantity have been conscientiously reviewed and chosen from 26 submissions. partly supervised studying is a quickly evolving region of computer studying.

Extra info for Rough Sets and Knowledge Technology: 8th International Conference, RSKT 2013, Halifax, NS, Canada, October 11-14, 2013, Proceedings

Example text

For simplicity, we use the index set {0, 1, 2, . . , n} to denote 20 Y. , the ground level) and n the coarsest granularity. The simple two-way decisions can be viewed as decision-making at the ground level 0. For sequential three-way decisions, we assume that a three-way decision is made at levels n, n − 1, . . , 1 and a two-way decision is made at the ground level 0. That is, the final result of sequential three-way decisions is a two-way decision. At each stage, only objects with a non-commitment decision will be further explored in the next level.

Information Sciences 178(4), 1219–1234 (2008) 57. : A ten-year review of granular computing. In: IEEE International Conference on Granular Computing, pp. 734–734. IEEE (2007) 58. : Recent developments in granular computing: a bibliometrics study. In: IEEE International Conference on Granular Computing, pp. 74–79. IEEE (2008) 59. : Granular computing: Perspectives and challenges. IEEE Transactions on Cybernetics PP(99), 1–13 (2013) 60. 3233/FI2013-881 61. : Two views of the theory of rough sets in finite universes.

Let l(x) denote the level at which a decision of an acceptance or a rejection is made for x. The object x is considered in all levels from level n down to level l(x). The processing cost of x can be computed as: n COST3P (x) = Ci = Cn→l(x) , (15) i=l(x) where Cn→i denote the cost incurred from level n down to level i. The total processing cost for all objects can be computed as follows: COST3P = COST3P (x) x∈U n (|POS(αi ,βi ) (vi )| + |NEG(αi ,βi ) (vi )|) ∗ Cn→i . = (16) i=0 According to this equation, if the cost C0 is very large and we can make an acceptance or a rejection decision for a majority of objects before reaching the ground level 0, the advantages of sequential three-way decisions will be more pronounced.

Download PDF sample

Rated 4.48 of 5 – based on 17 votes