Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing: by Yiyu Yao, Qinghua Hu, Hong Yu, Jerzy W. Grzymala-Busse PDF

By Yiyu Yao, Qinghua Hu, Hong Yu, Jerzy W. Grzymala-Busse

ISBN-10: 331925782X

ISBN-13: 9783319257822

This booklet constitutes the refereed convention complaints of the fifteenth foreign convention on tough units, Fuzzy units, facts Mining and Granular Computing, RSFDGrC 2015, held in Tianjin, China in November 2015 as one of many co-located convention of the 2015 Joint tough Set Symposium, JRS 2015.

The forty four papers have been rigorously reviewed and chosen from ninety seven submissions. The papers during this quantity hide issues similar to tough units: the specialists converse; generalized tough units; tough units and graphs; tough and fuzzy hybridization; granular computing; info mining and computer studying; three-way judgements; IJCRS 2015 info challenge.

Show description

Read or Download Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing: 15th International Conference, RSFDGrC 2015, Tianjin, China, November 20-23, 2015, Proceedings PDF

Similar international_1 books

New PDF release: Parameterized and Exact Computation: 8th International

This publication constitutes the completely refereed post-conference complaints of the eighth foreign Symposium on Parameterized and unique Computation, IPEC 2013, in Sophia Antipolis, France, in September 2013. The 29 revised complete papers provided have been rigorously reviewed and chosen from fifty eight submissions.

New PDF release: XVIITH International Congress on Mathematical Physics

The overseas Congress on Mathematical Physics is a massive convention in its box that pulls a truly extensive spectrum of researchers. Held each 3 years, it offers an summary of modern advancements and achievements in mathematical physics. This quantity offers the plenary lectures and invited topical consultation lectures from the XVIIth ICMP, which was once held in Aalborg, Denmark, August 2012.

Y. Fong, U. Knauer, A. V. Mikhalev's First International Tainan-Moscow Algebra Workshop: PDF

The sequence is aimed particularly at publishing peer reviewed reports and contributions provided at workshops and meetings. every one quantity is linked to a selected convention, symposium or workshop. those occasions hide numerous themes inside natural and utilized arithmetic and supply up to date assurance of latest advancements, tools and functions.

Additional info for Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing: 15th International Conference, RSFDGrC 2015, Tianjin, China, November 20-23, 2015, Proceedings

Sample text

The probability that a patient has the disease with this set of manifestations:SI(Satisfactory Index) 3. the ratio of the patients who satisfy the set to all the patients of this disease:CI(Covering Index) 4. 0 then end. Otherwise, goto 5. 5. For the patients with this disease who do not satisfy all the collected set of manifestations, goto 1. Therefore a positive rule is described by a set of manifestations, its satisfactory index (SI), which corresponds to accuracy measure, and its covering index (CI), which corresponds to total positive rate.

E) Diagnostic criteria gives temporal information about episodes of headache. In the previous studies, automated extraction of knowledge with respect to (a), (b), (c) has been solved. However, (d) and (e) still remains. Dealing with exceptions is related with complications detection, so partially (d) is solved. However, in some cases, exceptions are used for case-based reasoning by medical experts. Thus, combination of rule-based and case-based reasoning should be introduced. Acquisition of temporal knowledge is important because medical experts use temporal reasoning in a flexible way.

Sl Generalized Decision Measures From now on, we will assume a fixed set of decisions. We go back to notation A = (U, A ∪ D). Moreover, for simplicity, we will write ∂B instead of ∂D/B . The following measures can be used to evaluate subsets of attributes. Definition 6. Let A = (U, A ∪ D) be given. Functions g∂ , e∂ : 2A → (0, 1] and h∂ : 2A → [0, +∞) are defined as follows, for each B ⊆ A: g∂ (B) = 1 |U | u∈U 1 |∂B (u)| e∂ (B) = 1 |U | u∈U 1 2|∂B (u)|−1 h∂ (B) = u∈U log |∂B (u)| |U | For subsets C ⊆ B ⊆ A, there are always inequalities g∂ (C) ≤ g∂ (B), e∂ (C) ≤ e∂ (B) and h∂ (C) ≥ h∂ (B).

Download PDF sample

Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing: 15th International Conference, RSFDGrC 2015, Tianjin, China, November 20-23, 2015, Proceedings by Yiyu Yao, Qinghua Hu, Hong Yu, Jerzy W. Grzymala-Busse


by Anthony
4.0

Rated 4.27 of 5 – based on 11 votes