Formal Concept Analysis Foundations and Applications /

Formal concept analysis has been developed as a field of applied mathematics based on the mathematization of concept and concept hierarchy. It thereby allows us to mathematically represent, analyze, and construct conceptual structures. The formal concept analysis approach has been proven successful...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Ganter, Bernhard (Επιμελητής έκδοσης), Stumme, Gerd (Επιμελητής έκδοσης), Wille, Rudolf (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
Σειρά:Lecture Notes in Computer Science, 3626
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04114nam a22005895i 4500
001 978-3-540-31881-1
003 DE-He213
005 20151123192342.0
007 cr nn 008mamaa
008 100928s2005 gw | s |||| 0|eng d
020 |a 9783540318811  |9 978-3-540-31881-1 
024 7 |a 10.1007/978-3-540-31881-1  |2 doi 
040 |d GrThAP 
050 4 |a Q334-342 
050 4 |a TJ210.2-211.495 
072 7 |a UYQ  |2 bicssc 
072 7 |a TJFM1  |2 bicssc 
072 7 |a COM004000  |2 bisacsh 
082 0 4 |a 006.3  |2 23 
245 1 0 |a Formal Concept Analysis  |h [electronic resource] :  |b Foundations and Applications /  |c edited by Bernhard Ganter, Gerd Stumme, Rudolf Wille. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2005. 
300 |a X, 349 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 3626 
505 0 |a Foundations -- Formal Concept Analysis as Mathematical Theory of Concepts and Concept Hierarchies -- Semiconcept and Protoconcept Algebras: The Basic Theorems -- Features of Interaction Between Formal Concept Analysis and Algebraic Geometry -- From Formal Concept Analysis to Contextual Logic -- Contextual Attribute Logic of Many-Valued Attributes -- Treating Incomplete Knowledge in Formal Concept Analysis -- States, Transitions, and Life Tracks in Temporal Concept Analysis -- Applications -- Linguistic Applications of Formal Concept Analysis -- Using Concept Lattices for Text Retrieval and Mining -- Efficient Mining of Association Rules Based on Formal Concept Analysis -- Galois Connections in Data Analysis: Contributions from the Soviet Era and Modern Russian Research -- Conceptual Knowledge Processing in the Field of Economics -- Software Engineering -- A Survey of Formal Concept Analysis Support for Software Engineering Activities -- Concept Lattices in Software Analysis -- Formal Concept Analysis Used for Software Analysis and Modelling -- Formal Concept Analysis-Based Class Hierarchy Design in Object-Oriented Software Development -- The ToscanaJ Suite for Implementing Conceptual Information Systems. 
520 |a Formal concept analysis has been developed as a field of applied mathematics based on the mathematization of concept and concept hierarchy. It thereby allows us to mathematically represent, analyze, and construct conceptual structures. The formal concept analysis approach has been proven successful in a wide range of application fields. This book constitutes a comprehensive and systematic presentation of the state of the art of formal concept analysis and its applications. The first part of the book is devoted to foundational and methodological topics. The contributions in the second part demonstrate how formal concept analysis is successfully used outside of mathematics, in linguistics, text retrieval, association rule mining, data analysis, and economics. The third part presents applications in software engineering. 
650 0 |a Computer science. 
650 0 |a Software engineering. 
650 0 |a Mathematical logic. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Information storage and retrieval. 
650 0 |a Artificial intelligence. 
650 1 4 |a Computer Science. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
650 2 4 |a Software Engineering. 
650 2 4 |a Mathematical Logic and Formal Languages. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Information Storage and Retrieval. 
700 1 |a Ganter, Bernhard.  |e editor. 
700 1 |a Stumme, Gerd.  |e editor. 
700 1 |a Wille, Rudolf.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540278917 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 3626 
856 4 0 |u http://dx.doi.org/10.1007/978-3-540-31881-1  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)