000 04227nam a22005775i 4500
001 978-3-540-78921-5
003 DE-He213
005 20160624102118.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540789215
_9978-3-540-78921-5
024 7 _a10.1007/978-3-540-78921-5
_2doi
050 4 _aQA76.9.D343
072 7 _aUNF
_2bicssc
072 7 _aUYQE
_2bicssc
072 7 _aCOM021030
_2bisacsh
082 0 4 _a006.312
_223
245 1 0 _aConcept Lattices and Their Applications
_h[electronic resource] :
_bFourth International Conference, CLA 2006 Tunis, Tunisia, October 30-November 1, 2006 Selected Papers /
_cedited by Sadok Ben Yahia, Engelbert Mephu Nguifo, Radim Belohlavek.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
300 _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 ;
_v4923
505 0 _aInvited Contributions -- An Intelligent User Interface for Browsing and Searching MPEG-7 Images Using Concept Lattices -- First Elements on Knowledge Discovery Guided by Domain Knowledge (KDDK) -- Formal Concept Analysis as Applied Lattice Theory -- Foundations -- Direct Factorization by Similarity of Fuzzy Concept Lattices by Factorization of Input Data -- Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions -- Closure Systems of Equivalence Relations and Their Labeled Class Geometries -- Generalizations of Approximable Concept Lattice -- Methods -- Rule Validation of a Meta-classifier Through a Galois (Concept) Lattice and Complementary Means -- Graded LinClosure and Its Role in Relational Data Analysis -- Yet Another Approach for Completing Missing Values -- Efficient Generic Association Rules Based Classifier Approach -- Galois Lattices and Bases for MGK-Valid Association Rules -- Generic Association Rule Bases: Are They so Succinct? -- Concept Lattice Representations of Annotated Taxonomies -- An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy -- Applications -- Unique Factorization Theorem and Formal Concept Analysis -- Towards Concise Representation for Taxonomies of Epistemic Communities -- Towards an Iterative Classification Based on Concept Lattice -- Using Formal Concept Analysis for Mining and Interpreting Patient Flows within a Healthcare Network -- Using FCA to Suggest Refactorings to Correct Design Defects -- Type Signature Induction with FCAType.
520 _aThis book constitutes the refereed proceedings of the Fourth International Conference on Concept Lattices and their Applications, CLA 2006, held in Tunis, Tunisia, October 30-November 1, 2006. The 18 revised full papers together with 3 invited contributions presented were carefully reviewed and selected from 41 submissions. The topics include formal concept analysis, foundations of FCA, mathematical structures related to FCA, relationship of FCA to other methods of data analysis, visualization of data in FCA, and applications of FCA.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aData mining.
650 0 _aInformation storage and retrieval systems.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aData Mining and Knowledge Discovery.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aInformation Storage and Retrieval.
650 2 4 _aData Structures.
650 2 4 _aData Storage Representation.
700 1 _aYahia, Sadok Ben.
_eeditor.
700 1 _aNguifo, Engelbert Mephu.
_eeditor.
700 1 _aBelohlavek, Radim.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540789208
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4923
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-540-78921-5
942 _2EBK8064
_cEBK
999 _c37358
_d37358