LEADER 05468nam 22007575 450 001 9910337851803321 005 20200703221949.0 010 $a3-030-21462-1 024 7 $a10.1007/978-3-030-21462-3 035 $a(CKB)4100000008424402 035 $a(DE-He213)978-3-030-21462-3 035 $a(MiAaPQ)EBC5918486 035 $a(PPN)242823548 035 $a(EXLCZ)994100000008424402 100 $a20190522d2019 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFormal Concept Analysis $e15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25?28, 2019, Proceedings /$fedited by Diana Cristea, Florence Le Ber, Baris Sertkaya 205 $a1st ed. 2019. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2019. 215 $a1 online resource (XIII, 349 p. 560 illus., 33 illus. in color.) 225 1 $aLecture Notes in Artificial Intelligence ;$v11511 311 $a3-030-21461-3 320 $aIncludes bibliographical references and index. 327 $aInvited papers -- Elements about Hybrid, Exploratory, and Explainable Knowledge Discovery -- Too Much Information: Can AI Cope With Modern Knowledge Graphs -- Learning Implications from Data and from Queries -- Concepts in Application Context -- Theory -- Direct and Binary Direct Bases for One-set Updates of a Closure System -- Dualization in lattices given by implicational bases -- Properties of Finite Lattices -- Joining Implications in Formal Contexts and Inductive Learning in a Horn Description Logic -- Methods and Applications -- On-demand Relational Concept Analysis -- Mining Formal Concepts using Implications between Items -- Effects of Input Data Formalisation in Relational Concept Analysis for a Data Model with a Ternary Relation -- Parallelization of the GreConD Algorithm for Boolean Matrix Factorization -- Simultaneous, polynomial-time layout of Context Bigraph and Lattice Digraph -- Using Redescriptions and Formal Concept Analysis for Mining Definitions in Linked Data -- Enhanced FCA -- A Formal Context for Closures of Acyclic Hypergraphs -- Concept lattices as a search space for graph compression -- A relational extension of Galois Connections -- Short Papers -- Sampling Representation Contexts with Attribute Exploration -- Discovering Implicational Knowledge in Wikidata -- A characterization theorem for continuous lattices by closure spaces -- On Coupling FCA and MDL in Pattern Mining -- A Study of Boolean Matrix Factorization Under Supervised Settings. 330 $aThis book constitutes the proceedings of the 15th International Conference on Formal Concept Analysis, ICFCA 2019, held in Frankfurt am Main, Germany, in June 2019. The 15 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 36 submissions. The book also contains four invited contributions in full paper length. The field of Formal Concept Analysis (FCA) originated in the 1980s in Darmstadt as a subfield of mathematical order theory, with prior developments in other research groups. Its original motivation was to consider complete lattices as lattices of concepts, drawing motivation from philosophy and mathematics alike. FCA has since then developed into a wide research area with applications much beyond its original motivation, for example in logic, data mining, learning, and psychology. 410 0$aLecture Notes in Artificial Intelligence ;$v11511 606 $aArtificial intelligence 606 $aDatabase management 606 $aData mining 606 $aMathematical logic 606 $aApplication software 606 $aNumerical analysis 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aDatabase Management$3https://scigraph.springernature.com/ontologies/product-market-codes/I18024 606 $aData Mining and Knowledge Discovery$3https://scigraph.springernature.com/ontologies/product-market-codes/I18030 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aComputer Appl. in Administrative Data Processing$3https://scigraph.springernature.com/ontologies/product-market-codes/I2301X 606 $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X 615 0$aArtificial intelligence. 615 0$aDatabase management. 615 0$aData mining. 615 0$aMathematical logic. 615 0$aApplication software. 615 0$aNumerical analysis. 615 14$aArtificial Intelligence. 615 24$aDatabase Management. 615 24$aData Mining and Knowledge Discovery. 615 24$aMathematical Logic and Formal Languages. 615 24$aComputer Appl. in Administrative Data Processing. 615 24$aNumeric Computing. 676 $a004.0151 676 $a004.0151 702 $aCristea$b Diana$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLe Ber$b Florence$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSertkaya$b Baris$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910337851803321 996 $aFormal Concept Analysis$9772457 997 $aUNINA