國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Formal concept analysis16th Internat...

(1998 :)

Formal concept analysis16th International Conference, ICFCA 2021, Strasbourg, France, June 29 - July 2, 2021 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Formal concept analysisedited by Agnes Braud ... [et al.].
其他題名:	16th International Conference, ICFCA 2021, Strasbourg, France, June 29 - July 2, 2021 : proceedings /
其他題名:	ICFCA 2021
其他作者:	Braud, Agnes.
團體作者:
出版者:	Cham :Springer International Publishing :2021.
面頁冊數:	xvi, 291 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Computer scienceMathematics
電子資源:	https://doi.org/10.1007/978-3-030-77867-5
ISBN:	9783030778675$q(electronic bk.)

Formal concept analysis16th 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] :ICFCA 2021edited by Agnes Braud ... [et al.]. - Cham :Springer International Publishing :2021. - xvi, 291 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,127330302-9743 ;. - Lecture notes in computer science ;4891..

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

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

253427
Computer science
--Mathematics

LC Class. No.: QA76.9.M35 / I48 2021

Dewey Class. No.: 004.0151

Formal concept analysis16th International Conference, ICFCA 2021, Strasbourg, France, June 29 - July 2, 2021 : proceedings /
LDR:03271nmm a2200361 a 4500 001 616020
003 DE-He213
005 20220124132820.0
006 m d
007 cr nn 008maaau
008 220831s2021 sz s 0 eng d
020 $a 9783030778675$q(electronic bk.)
020 $a 9783030778668$q(paper)
024 7 $a 10.1007/978-3-030-77867-5 $2 doi
035 $a 978-3-030-77867-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35 $b I48 2021
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 2021
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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 Agnes Braud ... [et al.].
246 3 $a ICFCA 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xvi, 291 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12733
490 1 $a Artificial intelligence
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 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 Data Mining and Knowledge Discovery. $3 275288
650 2 4 $a Database Management System. $3 914921
650 2 4 $a Theory of Computation. $3 274475
650 2 4 $a Computer and Information Systems Applications. $3 913125
650 2 4 $a Mathematics of Computing. $3 273710
700 1 $a Braud, Agnes. $3 914927
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 Artificial intelligence. $3 910708
856 4 0 $u https://doi.org/10.1007/978-3-030-77867-5
950 $a Computer Science (SpringerNature-11645)