國立虎尾科技大學 |

Formal Concept Analysis = 16th International Conference, ICFCA 2021, Strasbourg, France, June 29 – July 2, 2021, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Formal Concept Analysis/ edited by Agnès Braud, Aleksey Buzmakov, Tom Hanika, Florence Le Ber.
其他題名:	16th International Conference, ICFCA 2021, Strasbourg, France, June 29 – July 2, 2021, Proceedings /
其他作者:	Le Ber, Florence.
面頁冊數:	XVI, 291 p. 70 illus., 35 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematics of Computing. -
電子資源:	https://doi.org/10.1007/978-3-030-77867-5
ISBN:	9783030778675

Formal Concept Analysis = 16th International Conference, ICFCA 2021, Strasbourg, France, June 29 – July 2, 2021, Proceedings /
Formal Concept Analysis16th International Conference, ICFCA 2021, Strasbourg, France, June 29 – July 2, 2021, Proceedings /[electronic resource] :edited by Agnès Braud, Aleksey Buzmakov, Tom Hanika, Florence Le Ber. - 1st ed. 2021. - XVI, 291 p. 70 illus., 35 illus. in color.online resource. - Lecture Notes in Artificial Intelligence ;12733. - Lecture Notes in Artificial Intelligence ;9285.

Representing partition lattices through FCA -- Fixed-Point Semantics for Barebone Relational Concept Analysis -- Boolean Substructures in Formal Concept Analysis -- Enumerating Maximal Consistent Closed Sets in Closure Systems -- A new Kind of Implication to Reason with Unknown Information -- Pruning Techniques in LinCbO for Computation of the Duquenne-Guigues Basis -- Approximate Computation of Exact Association Rules -- An Incremental Recomputation of From-Below Boolean Matrix Factorization -- Clustering and Identification of Core Implications for Grouping Objects -- Extracting Relations in Texts with Concepts of Neighbours -- Triadic Exploration and Exploration with Multiple Experts -- Towards Interactive Transition from AOC Poset to Concept Lattice -- Visualization of Statistical Information in Concept Lattice Diagrams -- Force-Directed Layout of Order Diagrams Using Dimensional Reduction -- Sandwich: an Algorithm for Discovering Relevant Link Keys in an LKPS Concept Lattice -- Decision Concept Lattice vs Decision Trees and Random Forests -- Exploring Scale-Measures of Data Sets -- Filters, Ideals and Congruence on Double Boolean Algebras -- Diagrammatic Representations of Conceptual Structures.

This book constitutes the proceedings of the 16th International Conference on Formal Concept Analysis, ICFCA 2021, held in Strasbourg, France, in June/July 2021. The 14 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 32 submissions. The book also contains four invited contributions in full paper length. The research part of this volume is divided in five different sections. First, "Theory" contains compiled works that discuss advances on theoretical aspects of FCA. Second, the section "Rules" consists of contributions devoted to implications and association rules. The third section "Methods and Applications" is composed of results that are concerned with new algorithms and their applications. "Exploration and Visualization" introduces different approaches to data exploration.

ISBN: 9783030778675

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

669457
Mathematics of Computing.

LC Class. No.: Q334-342

Dewey Class. No.: 006.3

Formal Concept Analysis = 16th International Conference, ICFCA 2021, Strasbourg, France, June 29 – July 2, 2021, Proceedings /
LDR:03564nam a22004095i 4500 001 1055810
003 DE-He213
005 20210925073049.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030778675 $9 978-3-030-77867-5
024 7 $a 10.1007/978-3-030-77867-5 $2 doi
035 $a 978-3-030-77867-5
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 16th International Conference, ICFCA 2021, Strasbourg, France, June 29 – July 2, 2021, Proceedings / $c edited by Agnès Braud, Aleksey Buzmakov, Tom Hanika, Florence Le Ber.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XVI, 291 p. 70 illus., 35 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 12733
505 0 $a Representing partition lattices through FCA -- Fixed-Point Semantics for Barebone Relational Concept Analysis -- Boolean Substructures in Formal Concept Analysis -- Enumerating Maximal Consistent Closed Sets in Closure Systems -- A new Kind of Implication to Reason with Unknown Information -- Pruning Techniques in LinCbO for Computation of the Duquenne-Guigues Basis -- Approximate Computation of Exact Association Rules -- An Incremental Recomputation of From-Below Boolean Matrix Factorization -- Clustering and Identification of Core Implications for Grouping Objects -- Extracting Relations in Texts with Concepts of Neighbours -- Triadic Exploration and Exploration with Multiple Experts -- Towards Interactive Transition from AOC Poset to Concept Lattice -- Visualization of Statistical Information in Concept Lattice Diagrams -- Force-Directed Layout of Order Diagrams Using Dimensional Reduction -- Sandwich: an Algorithm for Discovering Relevant Link Keys in an LKPS Concept Lattice -- Decision Concept Lattice vs Decision Trees and Random Forests -- Exploring Scale-Measures of Data Sets -- Filters, Ideals and Congruence on Double Boolean Algebras -- Diagrammatic Representations of Conceptual Structures.
520 $a This book constitutes the proceedings of the 16th International Conference on Formal Concept Analysis, ICFCA 2021, held in Strasbourg, France, in June/July 2021. The 14 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 32 submissions. The book also contains four invited contributions in full paper length. The research part of this volume is divided in five different sections. First, "Theory" contains compiled works that discuss advances on theoretical aspects of FCA. Second, the section "Rules" consists of contributions devoted to implications and association rules. The third section "Methods and Applications" is composed of results that are concerned with new algorithms and their applications. "Exploration and Visualization" introduces different approaches to data exploration.
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Computer Applications. $3 669785
650 2 4 $a Theory of Computation. $3 669322
650 2 4 $a Information Systems and Communication Service. $3 669203
650 2 4 $a Data Mining and Knowledge Discovery. $3 677765
650 1 4 $a Artificial Intelligence. $3 646849
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Application software. $3 528147
650 0 $a Computers. $3 565115
650 0 $a Data mining. $3 528622
650 0 $a Artificial intelligence. $3 559380
700 1 $a Le Ber, Florence. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1060473
700 1 $a Hanika, Tom. $e editor. $1 https://orcid.org/0000-0002-4918-6374 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1355907
700 1 $a Buzmakov, Aleksey. $e editor. $1 https://orcid.org/0000-0002-9317-8785 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1361097
700 1 $a Braud, Agnès. $e editor. $1 https://orcid.org/0000-0003-3614-9141 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1361096
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030778668
776 0 8 $i Printed edition: $z 9783030778682
830 0 $a Lecture Notes in Artificial Intelligence ; $v 9285 $3 1253845
856 4 0 $u https://doi.org/10.1007/978-3-030-77867-5
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)