Catálogo de publicaciones - libros
Transactions on Rough Sets VI: Commemorating the Life and Work of Zdzislaw Pawlak, Part I
James F. Peters ; Andrzej Skowron ; Ivo Düntsch ; Jerzy Grzymała-Busse ; Ewa Orłowska ; Lech Polkowski (eds.)
Resumen/Descripción – provisto por la editorial
No disponible.
Palabras clave – provistas por la editorial
Artificial Intelligence (incl. Robotics); Data Mining and Knowledge Discovery; Theory of Computation; Mathematical Logic and Formal Languages; Computation by Abstract Devices; Database Management
Disponibilidad
| Institución detectada | Año de publicación | Navegá | Descargá | Solicitá |
|---|---|---|---|---|
| No detectada | 2007 | SpringerLink |
Información
Tipo de recurso:
libros
ISBN impreso
978-3-540-71198-8
ISBN electrónico
978-3-540-71200-8
Editor responsable
Springer Nature
País de edición
Reino Unido
Fecha de publicación
2007
Información sobre derechos de publicación
© Springer-Verlag Berlin Heidelberg 2007
Tabla de contenidos
A Model PM for Preprocessing and Data Mining Proper Process
Anita Wasilewska; Ernestina Menasalvas; Christelle Scharff
Data Mining, as defined in 1996 by Piatetsky-Shapiro ([1]) is a step (crucial, but a step nevertheless) in a KDD (Knowledge Discovery in Data Bases) process. The Piatetsky-Shapiro’s definition states that the KDD process consists of the following steps: developing an understanding of the application domain, creating a target data set, choosing the data mining task i.e. deciding whether the goal of the KDD process is classification, regression, clustering, etc..., choosing the data mining algorithm(s), data preprocessing, data mining (DM), interpreting mined patterns, deciding if a re-iteration is needed, and consolidating discovered knowledge.
- Contributed Papers | Pp. 397-399
Lattice Theory for Rough Sets
Jouni Järvinen
This work focuses on lattice-theoretical foundations of rough set theory. It consist of the following sections: 1: Introduction 2: Basic Notions and Notation, 3: Orders and Lattices, 4: Distributive, Boolean, and Stone Lattices, 5: Closure Systems and Topologies, 6: Fixpoints and Closure Operators on Ordered Sets, 7: Galois Connections and Their Fixpoints, 8: Information Systems, 9: Rough Set Approximations, and 10: Lattices of Rough Sets. At the end of each section, brief bibliographic remarks are presented.
- Monographs | Pp. 400-498