000 06215nam a22006615i 4500
001 978-3-540-24651-0
003 DE-He213
005 20240423125830.0
007 cr nn 008mamaa
008 121227s2004 gw | s |||| 0|eng d
020 _a9783540246510
_9978-3-540-24651-0
024 7 _a10.1007/b95548
_2doi
050 4 _aQA8.9-10.3
072 7 _aPBCD
_2bicssc
072 7 _aPBC
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aPBCD
_2thema
072 7 _aPBC
_2thema
082 0 4 _a511.3
_223
245 1 0 _aConcept Lattices
_h[electronic resource] :
_bSecond International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings /
_cedited by Peter Eklund.
250 _a1st ed. 2004.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2004.
300 _aX, 418 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v2961
505 0 _aPreconcept Algebras and Generalized Double Boolean Algebras -- Protoconcept Graphs: The Lattice of Conceptual Contents -- Signs and Formal Concepts -- A Mathematical Model for TOSCANA-Systems: Conceptual Data Systems -- BLID: An Application of Logical Information Systems to Bioinformatics -- Formal Concept Analysis: Its Role in Teaching Lattice Theory -- Concept Lattices for Information Visualization: Can Novices Read Line-Diagrams? -- Browsing Search Results via Formal Concept Analysis: Automatic Selection of Attributes -- Formal Concept Analysis and Semantic File Systems -- Numerical Analysis in Conceptual Systems with ToscanaJ -- Tool Support for FCA -- Automated Lattice Drawing -- Congruences of Finite Distributive Concept Algebras -- When Is a Concept Algebra Boolean? -- Background Knowledge in Concept Graphs -- Agreement Contexts in Formal Concept Analysis -- Towards a Conceptual Theory of Indistinguishable Objects -- Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies -- A First Step towards Protoconcept Exploration -- Geometry of Data Tables -- Concept Extensions and Weak Clusters Associated with Multiway Dissimilarity Measures -- Unlocking the Semantics of Roget’s Thesaurus Using Formal Concept Analysis -- FCA in Knowledge Technologies: Experiences and Opportunities -- Applying Formal Concept Analysis to Description Logics -- Machine Learning and Formal Concept Analysis -- A Comparative Study of FCA-Based Supervised Classification Algorithms -- Modelling Tacit Knowledge via Questionnaire Data -- Predicate Invention and the Revision of First-Order Concept Lattices -- The Power of Peircean Algebraic Logic (PAL) -- Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges -- AddIntent: A New Incremental Algorithm for Constructing ConceptLattices -- QuDA: Applying Formal Concept Analysis in a Data Mining Environment -- A Parallel Algorithm to Generate Formal Concepts for Large Data -- Using Concept Lattices for Requirements Reconciliation.
520 _aThis volume contains the Proceedings of ICFCA 2004, the 2nd International Conference on Formal Concept Analysis. The ICFCA conference series aims to be the premier forum for the publication of advances in applied lattice and order theory and in particular scienti?c advances related to formal concept analysis. Formal concept analysis emerged in the 1980s from e?orts to restructure lattice theory to promote better communication between lattice theorists and potentialusersoflatticetheory.Sincethen,the?eldhasdevelopedintoagrowing research area in its own right with a thriving theoretical community and an increasing number of applications in data and knowledge processing including data visualization, information retrieval, machine learning, data analysis and knowledge management. In terms of theory, formal concept analysis has been extended into attribute exploration, Boolean judgment, contextual logic and so on to create a powerful general framework for knowledge representation and reasoning. This conference aims to unify theoretical and applied practitioners who use formal concept an- ysis, drawing on the ?elds of mathematics, computer and library sciences and software engineering. The theme of the 2004 conference was ‘Concept Lattices” to acknowledge the colloquial term used for the line diagrams that appear in almost every paper in this volume. ICFCA 2004 included tutorial sessions, demonstrating the practical bene?ts of formal concept analysis, and highlighted developments in the foundational theory and standards. The conference showcased the increasing variety of formal concept analysis software and included eight invited lectures from distinguished speakersinthe?eld.Sevenoftheeightinvitedspeakerssubmittedaccompanying papers and these were reviewed andappear in this volume.
650 0 _aMathematical logic.
650 0 _aArtificial intelligence.
650 0 _aSoftware engineering.
650 0 _aMachine theory.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aInformation storage and retrieval systems.
650 1 4 _aMathematical Logic and Foundations.
650 2 4 _aArtificial Intelligence.
650 2 4 _aSoftware Engineering.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aInformation Storage and Retrieval.
700 1 _aEklund, Peter.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540210436
776 0 8 _iPrinted edition:
_z9783662171059
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v2961
856 4 0 _uhttps://doi.org/10.1007/b95548
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c182174
_d182174