001437569 000__ 05163cam\a2200709\i\4500
001437569 001__ 1437569
001437569 003__ OCoLC
001437569 005__ 20230309004155.0
001437569 006__ m\\\\\o\\d\\\\\\\\
001437569 007__ cr\un\nnnunnun
001437569 008__ 210625s2021\\\\sz\a\\\\o\\\\\101\0\eng\d
001437569 020__ $$a9783030778675$$q(electronic bk.)
001437569 020__ $$a3030778673$$q(electronic bk.)
001437569 020__ $$z9783030778668
001437569 020__ $$z3030778665
001437569 0247_ $$a10.1007/978-3-030-77867-5$$2doi
001437569 035__ $$aSP(OCoLC)1257549512
001437569 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dOCLCO$$dEBLCP$$dOCLCF$$dOCLCQ$$dCOM$$dOCLCO$$dOCLCQ
001437569 049__ $$aISEA
001437569 050_4 $$aQA76.9.M35$$bI48 2021
001437569 08204 $$a004.01/51$$223
001437569 1112_ $$aInternational Conference on Formal Concept Analysis$$n(16th :$$d2021 :$$cStrasbourg, France)
001437569 24510 $$aFormal concept analysis :$$b16th international conference, ICFCA 2021, Strasbourg, France, June 29 - July 2, 2021 : proceedings /$$cAgnès Braud, Aleksey Buzmakov, Tom Hanika, Florence Le Ber (eds.).
001437569 24630 $$aICFCA 2021
001437569 264_1 $$aCham :$$bSpringer,$$c[2021]
001437569 264_4 $$c©2021
001437569 300__ $$a1 online resource :$$billustrations (some color)
001437569 336__ $$atext$$btxt$$2rdacontent
001437569 337__ $$acomputer$$bc$$2rdamedia
001437569 338__ $$aonline resource$$bcr$$2rdacarrier
001437569 4901_ $$aLecture notes in computer science. Lecture notes in artificial intelligence ;$$v12733
001437569 4901_ $$aLNCS sublibrary: SL7 - artificial intelligence
001437569 500__ $$aInternational conference proceedings.
001437569 500__ $$aIncludes author index.
001437569 5050_ $$aRepresenting 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.
001437569 506__ $$aAccess limited to authorized users.
001437569 520__ $$aThis 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.
001437569 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed July 1, 2021).
001437569 650_0 $$aComputer science$$xMathematics$$vCongresses.
001437569 650_0 $$aLogic, Symbolic and mathematical$$vCongresses.
001437569 650_0 $$aFormal methods (Computer science)$$vCongresses.
001437569 650_6 $$aInformatique$$xMathématiques$$vCongrès.
001437569 650_6 $$aLogique symbolique et mathématique$$vCongrès.
001437569 650_6 $$aMéthodes formelles (Informatique)$$vCongrès.
001437569 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001437569 655_7 $$aConference papers and proceedings.$$2lcgft
001437569 655_7 $$aActes de congrès.$$2rvmgf
001437569 655_0 $$aElectronic books.
001437569 7001_ $$aBraud, Agnès,$$eeditor.
001437569 7001_ $$aBuzmakov, Aleksey,$$eeditor.
001437569 7001_ $$aHanika, Tom,$$eeditor.
001437569 7001_ $$aLe Ber, Florence,$$eeditor.
001437569 77608 $$iPrint version:$$aInternational Conference on Formal Concept Analysis (16th : 2021 : Strasbourg, France).$$tFormal concept analysis.$$dCham : Springer, [2021]$$z3030778665$$z9783030778668$$w(OCoLC)1250309044
001437569 830_0 $$aLecture notes in computer science.$$pLecture notes in artificial intelligence.
001437569 830_0 $$aLecture notes in computer science ;$$v12733.
001437569 830_0 $$aLNCS sublibrary.$$nSL 7,$$pArtificial intelligence.
001437569 852__ $$bebk
001437569 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-77867-5$$zOnline Access$$91397441.1
001437569 909CO $$ooai:library.usi.edu:1437569$$pGLOBAL_SET
001437569 980__ $$aBIB
001437569 980__ $$aEBOOK
001437569 982__ $$aEbook
001437569 983__ $$aOnline
001437569 994__ $$a92$$bISE