Transactions on Rough Sets XII [electronic resource] / edited by James F. Peters, Andrzej Skowron, Roman Słowiński, Pawan Lingras, Duoqian Miao, Shusaku Tsumoto.

Contributor(s): Peters, James F [editor.] | Skowron, Andrzej [editor.] | Słowiński, Roman [editor.] | Lingras, Pawan [editor.] | Miao, Duoqian [editor.] | Tsumoto, Shusaku [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 6190Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Description: X, 339p. 5 illus. in color. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783642144677Subject(s): Computer science | Information theory | Artificial intelligence | Computer vision | Optical pattern recognition | Computer Science | Mathematical Logic and Formal Languages | Computation by Abstract Devices | Theory of Computation | Image Processing and Computer Vision | Pattern Recognition | Artificial Intelligence (incl. Robotics)Additional physical formats: Printed edition:: No titleDDC classification: 005.131 LOC classification: QA8.9-QA10.3Online resources: Click here to access online
Contents:
Granular Rough Mereological Logics with Applications to Dependencies in Information and Decision Systems -- On Topological Dominance-based Rough Set Approach -- A Study of Multiple-Source Approximation Systems -- A New Knowledge Reduction Algorithm Based on Decision Power in Rough Set -- Comparison of Some Classification Algorithms Based on Deterministic and Nondeterministic Decision Rules -- Gene Selection and Cancer Classification: A Rough Sets Based Approach -- Evolutionary-Rough Feature Selection for Face Recognition -- Spatial Reasoning Based on Rough Mereology: A Notion of a Robot Formation and Path Planning Problem for Formations of Mobile Autonomous Robots -- Perceptually Near Pawlak Partitions -- A Novel Split and Merge Technique for Hypertext Classification -- A Non-boolean Lattice Derived by Double Indiscernibility -- Rough Set Approximations in Formal Concept Analysis -- On the Relation between Jumping Emerging Patterns and Rough Set Theory with Application to Data Classification.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK9166

Granular Rough Mereological Logics with Applications to Dependencies in Information and Decision Systems -- On Topological Dominance-based Rough Set Approach -- A Study of Multiple-Source Approximation Systems -- A New Knowledge Reduction Algorithm Based on Decision Power in Rough Set -- Comparison of Some Classification Algorithms Based on Deterministic and Nondeterministic Decision Rules -- Gene Selection and Cancer Classification: A Rough Sets Based Approach -- Evolutionary-Rough Feature Selection for Face Recognition -- Spatial Reasoning Based on Rough Mereology: A Notion of a Robot Formation and Path Planning Problem for Formations of Mobile Autonomous Robots -- Perceptually Near Pawlak Partitions -- A Novel Split and Merge Technique for Hypertext Classification -- A Non-boolean Lattice Derived by Double Indiscernibility -- Rough Set Approximations in Formal Concept Analysis -- On the Relation between Jumping Emerging Patterns and Rough Set Theory with Application to Data Classification.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha