Abstract
Rough sets was proposed by Z. Pawlak in 1980 as the way how real-world concepts can be approximated by human measurements. For example, in a database, real-world concepts were approximated by the combination of attributes, as lower and upper approximation. The formal studies on this approximation can be viewed as the computation of information granularity, which are closely related with data mining, machine learning, multi-valued logic and fuzzy sets.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsumoto, S., Hirano, S., Inuiguchi, M. (2001). Workshop on Rough Set Theory and Granular Computing — Summary. In: Terano, T., Ohsawa, Y., Nishida, T., Namatame, A., Tsumoto, S., Washio, T. (eds) New Frontiers in Artificial Intelligence. JSAI 2001. Lecture Notes in Computer Science(), vol 2253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45548-5_26
Download citation
DOI: https://doi.org/10.1007/3-540-45548-5_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43070-4
Online ISBN: 978-3-540-45548-6
eBook Packages: Springer Book Archive