000 04466nam a22006015i 4500
001 978-3-540-32016-6
003 DE-He213
005 20240730200211.0
007 cr nn 008mamaa
008 100316s2005 gw | s |||| 0|eng d
020 _a9783540320166
_9978-3-540-32016-6
024 7 _a10.1007/11574798
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aTransactions on Rough Sets IV
_h[electronic resource] /
_cedited by James F. Peters.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aX, 378 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTransactions on Rough Sets,
_x1861-2067 ;
_v3700
505 0 _aRegular Papers -- A Treatise on Rough Sets -- On Optimization of Decision Trees -- Dealing with Missing Data: Algorithms Based on Fuzzy Set and Rough Set Theories -- Characteristic Relations for Incomplete Data: A Generalization of the Indiscernibility Relation -- Supervised Learning in the Gene Ontology Part I: A Rough Set Framework -- Supervised Learning in the Gene Ontology Part II: A Bottom-Up Algorithm -- Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity Local Approach -- A Fast Host-Based Intrusion Detection System Using Rough Set Theory -- Incremental Learning and Evaluation of Structures of Rough Decision Tables -- Dissertations and Monographs -- A Framework for Reasoning with Rough Sets -- Analogy-Based Reasoning in Classifier Construction.
520 _aVolume IV of the Transactions on Rough Sets (TRS) introduces a number of new advances in the theory and application of rough sets. Rough sets and - proximationspaceswereintroducedmorethan30yearsagobyZdzis lawPawlak. These advances have profound implications in a number of research areas such as the foundations of rough sets, approximate reasoning, arti?cial intelligence, bioinformatics,computationalintelligence, cognitivescience, intelligentsystems, datamining,machineintelligence,andsecurity. Inaddition,itisevidentfromthe papers included in this volume that the foundations and applications of rough sets is a very active research area worldwide. A total of 16 researchers from 7 countries are represented in this volume, namely, Canada, India, Norway, S- den, Poland, Russia and the United States of America. Evidence of the vigor, breadth and depth of research in the theory and applications of rough sets can be found in the 10 articles in this volume. Prof. Pawlak has contributed a treatise on the philosophical underpinnings of rough sets. In this treatise, observations are made about the Cantor notion of a set, antinomies arising from Cantor sets, the problem of vagueness (es- cially, vague (imprecise) concepts), fuzzy sets, rough sets, fuzzy vs. rough sets as well as logic and rough sets. Among the many vistas and research directions suggested by Prof. Pawlak, one of the most fruitful concerns the model for a rough membership function, which was incarnated in many di?erent forms since its introduction by Pawlakand Skowronin 1994. Recall, here, that Prof.
650 0 _aArtificial intelligence.
_93407
650 0 _aMachine theory.
_9162439
650 0 _aComputer science.
_99832
650 0 _aDatabase management.
_93157
650 0 _aComputer vision.
_9162440
650 1 4 _aArtificial Intelligence.
_93407
650 2 4 _aFormal Languages and Automata Theory.
_9162441
650 2 4 _aTheory of Computation.
_9162442
650 2 4 _aDatabase Management.
_93157
650 2 4 _aComputer Vision.
_9162443
700 1 _aPeters, James F.
_eeditor.
_0(orcid)
_10000-0002-1026-4638
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_911752
710 2 _aSpringerLink (Online service)
_9162444
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540298304
776 0 8 _iPrinted edition:
_z9783540817468
830 0 _aTransactions on Rough Sets,
_x1861-2067 ;
_v3700
_9162445
856 4 0 _uhttps://doi.org/10.1007/11574798
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95932
_d95932