000 04196nam a22005775i 4500
001 978-3-642-11928-6
003 DE-He213
005 20140220084532.0
007 cr nn 008mamaa
008 100407s2010 gw | s |||| 0|eng d
020 _a9783642119286
_9978-3-642-11928-6
024 7 _a10.1007/978-3-642-11928-6
_2doi
050 4 _aQ334-342
050 4 _aTJ210.2-211.495
072 7 _aUYQ
_2bicssc
072 7 _aTJFM1
_2bicssc
072 7 _aCOM004000
_2bisacsh
082 0 4 _a006.3
_223
100 1 _aKwuida, Léonard.
_eeditor.
245 1 0 _aFormal Concept Analysis
_h[electronic resource] :
_b8th International Conference, ICFCA 2010, Agadir, Morocco, March 15-18, 2010. Proceedings /
_cedited by Léonard Kwuida, Barış Sertkaya.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXII, 340p. 91 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5986
505 0 _aInvited Talks -- About the Enumeration Algorithms of Closed Sets -- Mathematics Presenting, Reflecting, Judging -- The Role of Concept, Context, and Component for Dependable Software Development -- Statistical Methods for Data Mining and Knowledge Discovery -- Regular Contributions -- Formal Concept Analysis of Two-Dimensional Convex Continuum Structures -- Counting of Moore Families for n=7 -- Lattice Drawings and Morphisms -- Approximations in Concept Lattices -- Hardness of Enumerating Pseudo-intents in the Lectic Order -- On Links between Concept Lattices and Related Complexity Problems -- An Algorithm for Extracting Rare Concepts with Concise Intents -- Conditional Functional Dependencies: An FCA Point of View -- Constrained Closed Datacubes -- Conceptual Navigation in RDF Graphs with SPARQL-Like Queries -- An Approach to Exploring Description Logic Knowledge Bases -- On Categorial Grammars as Logical Information Systems -- Describing Role Models in Terms of Formal Concept Analysis -- Approaches to the Selection of Relevant Concepts in the Case of Noisy Data -- Concept Analysis as a Framework for Mining Functional Features from Legacy Code -- Concept Neighbourhoods in Lexical Databases -- A Survey of Hybrid Representations of Concept Lattices in Conceptual Knowledge Processing -- History -- Two Basic Algorithms in Concept Analysis.
520 _aThis book constitutes the refereed proceedings of the 8th International Conference on Formal Concept Analysis, ICFCA 2010, held in Agadir, Morocco, in March 2010. The 17 revised full papers presented together with 4 invited lectures and a reprint of a historical paper were carefully reviewed and selected from 37 submissions. The papers comprise state of the art research and present new results in applied lattice and order theory, and in particular advances in theory and applications of Formal Concept Analysis. These results range from theoretical novelties to advances in FCA-related algorithmic issues, as well as application domains of FCA such as data visualization, information retrieval, machine learning, data analysis and knowledge management.
650 0 _aComputer science.
650 0 _aComputational complexity.
650 0 _aData mining.
650 0 _aArtificial intelligence.
650 0 _aAlgebra.
650 1 4 _aComputer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aData Mining and Knowledge Discovery.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aOrder, Lattices, Ordered Algebraic Structures.
700 1 _aSertkaya, Barış.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642119279
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5986
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-11928-6
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c111963
_d111963