國立高雄大學圖資館 |

Language: English

Back

Formal concept analysis15th Internat...

(1998 :)

Formal concept analysis15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25-28, 2019 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Formal concept analysisedited by Diana Cristea, Florence Le Ber, Baris Sertkaya.
Reminder of title:	15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25-28, 2019 : proceedings /
remainder title:	ICFCA 2019
other author:	Cristea, Diana.
corporate name:
Published:	Cham :Springer International Publishing :2019.
Description:	xiii, 349 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Computer scienceMathematics
Online resource:	https://doi.org/10.1007/978-3-030-21462-3
ISBN:	9783030214623$q(electronic bk.)

Formal concept analysis15th 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] :ICFCA 2019edited by Diana Cristea, Florence Le Ber, Baris Sertkaya. - Cham :Springer International Publishing :2019. - xiii, 349 p. :ill., digital ;24 cm. - Lecture notes in computer science,115110302-9743 ;. - Lecture notes in computer science ;4891..

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$q(electronic bk.)

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

253427
Computer science
--Mathematics

LC Class. No.: QA76.9.M35 / I58 2019

Dewey Class. No.: 004.0151

Formal concept analysis15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25-28, 2019 : proceedings /
LDR:03573nmm a2200361 a 4500 001 586847
003 DE-He213
005 20200703221949.0
006 m d
007 cr nn 008maaau
008 210326s2019 sz s 0 eng d
020 $a 9783030214623$q(electronic bk.)
020 $a 9783030214616$q(paper)
024 7 $a 10.1007/978-3-030-21462-3 $2 doi
035 $a 978-3-030-21462-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35 $b I58 2019
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 004.0151 $2 23
090 $a QA76.9.M35 $b I61 2019
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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.
246 3 $a ICFCA 2019
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xiii, 349 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11511
490 1 $a Lecture notes in artificial intelligence
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 Computer science $x Mathematics $3 253427
650 0 $a Logic, Symbolic and mathematical $3 254195
650 0 $a Formal methods (Computer science) $3 277520
650 1 4 $a Artificial Intelligence. $3 212515
650 2 4 $a Database Management. $3 273994
650 2 4 $a Data Mining and Knowledge Discovery. $3 275288
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Computer Appl. in Administrative Data Processing. $3 275283
650 2 4 $a Numeric Computing. $3 275524
700 1 $a Cristea, Diana. $3 878350
700 1 $a Le Ber, Florence. $3 723248
700 1 $a Sertkaya, Baris. $3 485019
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Lecture notes in artificial intelligence. $3 822012
856 4 0 $u https://doi.org/10.1007/978-3-030-21462-3
950 $a Computer Science (SpringerNature-11645)