Similarity-based Rough Sets and Its Applications in Data Mining
Pawlakian spaces rely on an equivalence relation which represent indiscernibility. As a generalization of these spaces, some approximation spaces have appeared that are not based on an equivalence relation but on a tolerance relation that represents simil
- PDF / 9,945,287 Bytes
- 335 Pages / 439.37 x 666.142 pts Page_size
- 66 Downloads / 177 Views
Transactions on
Rough Sets XXII James F. Peters · Andrzej Skowron Editors-in-Chief
123
Lecture Notes in Computer Science Founding Editors Gerhard Goos Karlsruhe Institute of Technology, Karlsruhe, Germany Juris Hartmanis Cornell University, Ithaca, NY, USA
Editorial Board Members Elisa Bertino Purdue University, West Lafayette, IN, USA Wen Gao Peking University, Beijing, China Bernhard Steffen TU Dortmund University, Dortmund, Germany Gerhard Woeginger RWTH Aachen, Aachen, Germany Moti Yung Columbia University, New York, NY, USA
12485
More information about this subseries at http://www.springer.com/series/7151
James F. Peters Andrzej Skowron (Eds.) •
Transactions on Rough Sets XXII
123
Editors-in-Chief James F. Peters University of Manitoba Winnipeg, MB, Canada
Andrzej Skowron Systems Research Institute, Polish Academy of Sciences Warsaw, Poland CTN UKSW Warsaw, Poland
ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science ISSN 1861-2059 ISSN 1861-2067 (electronic) Transactions on Rough Sets ISBN 978-3-662-62797-6 ISBN 978-3-662-62798-3 (eBook) https://doi.org/10.1007/978-3-662-62798-3 © Springer-Verlag GmbH Germany, part of Springer Nature 2020 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. This Springer imprint is published by the registered company Springer-Verlag GmbH, DE part of Springer Nature. The registered company address is: Heidelberger Platz 3, 14197 Berlin, Germany
Preface
Volume XXII of the Transactions on Rough Sets (TRS) is a continuation of a number of research streams that have grown out of the seminal work of Zdzisław Pawlak1 during the first decade of the 21st century. The paper by Mohammad Azad investigates bi-objective optimization of classification and regression (CART)-like decision trees for data analysis. The results show that at least one of the considered techniques (L -19) can be useful for the
Data Loading...
