Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Elegant Structures in Computation. To Andrzej Ehrenfeucht on His 85th Birthday
Guest editors: Gheorghe Păun, Grzegorz Rozenberg and Arto Salomaa
Article type: Research Article
Authors: Polkowski, Lech T.; *; †
Affiliations: Polish-Japanese Academy IT, Koszykowa str. 86, 02-008 Warszawa, Poland. [email protected]
Correspondence: [*] Address for correspondence: Polish-Japanese Academy IT, Koszykowa str. 86, 02-008 Warszawa, Poland
Note: [†] Also affiliated at: University of Warmia and Mazury, Słoneczna str. 54, 10-760 Olsztyn, Poland
Abstract: This work is dedicated to Profesor Andrzej Ehrenfeucht, the eleve of the Warsaw School of Logic and Mathematics on the occasion of His 85th Birthday. We propose to exploit certain of the milestone ideas created by this School and to apply them to data analysis in the framework of the rough set theory proposed by Professor Zdzisław Pawlak. To wit, we apply the idea of fractional truth states due to Jan Łukasiewicz, mereology created by Stanisław Leśniewski and the betweenness relation used by Alfred Tarski as one of primitive predicates in His axiomatization of Euclidean geometry. These ideas applied in problems of approximate reasoning permit us to formalize calculus of granules of knowledge and use it in preprocessing of data before applying a classification algorithm. Introduction of a mereological version of betweenness relation to data allows for partitioning of data into the kernel and the residuum, both sub-data sets providing a faithful representation of the whole data set and reducing the size of data without any essential loss of accuracy of classification. In the process of algorithmic construction of the partition of data into the kernel and the residuum, we exploit the Dual Indiscernibility Matrix which further allows us to introduce notions of a pair classifier and, more generally, k-classifier yet to be studied.
Keywords: truth values, mereology, betweenness relation, rough sets, shuffled simplices, dual indiscernibility matrix, kernel, residuum, pair classifier
DOI: 10.3233/FI-2017-1570
Journal: Fundamenta Informaticae, vol. 154, no. 1-4, pp. 343-358, 2017
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]