國立虎尾科技大學 |

Formal Concept Analysis = 15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25–28, 2019, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Formal Concept Analysis/ edited by Diana Cristea, Florence Le Ber, Baris Sertkaya.
其他題名:	15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25–28, 2019, Proceedings /
其他作者:	Cristea, Diana.
面頁冊數:	XIII, 349 p. 560 illus., 33 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Artificial intelligence. -
電子資源:	https://doi.org/10.1007/978-3-030-21462-3
ISBN:	9783030214623

Formal Concept Analysis = 15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25–28, 2019, Proceedings /
Formal Concept Analysis15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25–28, 2019, Proceedings /[electronic resource] :edited by Diana Cristea, Florence Le Ber, Baris Sertkaya. - 1st ed. 2019. - XIII, 349 p. 560 illus., 33 illus. in color.online resource. - Lecture Notes in Artificial Intelligence ;11511. - Lecture Notes in Artificial Intelligence ;9285.

Invited 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.

This 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.

ISBN: 9783030214623

Standard No.: 10.1007/978-3-030-21462-3doiSubjects--Topical Terms:

559380
Artificial intelligence.

LC Class. No.: Q334-342

Dewey Class. No.: 006.3

Formal Concept Analysis = 15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25–28, 2019, Proceedings /
LDR:03828nam a22004095i 4500 001 1005550
003 DE-He213
005 20200703221949.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030214623 $9 978-3-030-21462-3
024 7 $a 10.1007/978-3-030-21462-3 $2 doi
035 $a 978-3-030-21462-3
050 4 $a Q334-342
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 006.3 $2 23
245 1 0 $a Formal Concept Analysis $h [electronic resource] : $b 15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25–28, 2019, Proceedings / $c edited by Diana Cristea, Florence Le Ber, Baris Sertkaya.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XIII, 349 p. 560 illus., 33 illus. in color. $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 Artificial Intelligence ; $v 11511
505 0 $a Invited 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.
520 $a This 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.
650 0 $a Artificial intelligence. $3 559380
650 0 $a Database management. $3 557799
650 0 $a Data mining. $3 528622
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Application software. $3 528147
650 0 $a Numerical analysis. $3 527939
650 1 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Database Management. $3 669820
650 2 4 $a Data Mining and Knowledge Discovery. $3 677765
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Computer Appl. in Administrative Data Processing. $3 669633
650 2 4 $a Numeric Computing. $3 669943
700 1 $a Cristea, Diana. $e editor. $1 https://orcid.org/0000-0003-1440-3786 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1299007
700 1 $a Le Ber, Florence. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1060473
700 1 $a Sertkaya, Baris. $e editor. $1 https://orcid.org/0000-0002-4196-0150 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1299008
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030214616
776 0 8 $i Printed edition: $z 9783030214630
830 0 $a Lecture Notes in Artificial Intelligence ; $v 9285 $3 1253845
856 4 0 $u https://doi.org/10.1007/978-3-030-21462-3
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)