| 000 | 05333nam a22005415i 4500 | ||
|---|---|---|---|
| 001 | u374140 | ||
| 003 | SIRSI | ||
| 005 | 20160812084219.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100407s2010 gw | s |||| 0|eng d | ||
| 020 |
_a9783642119286 _9978-3-642-11928-6 |
||
| 040 | _cMX-MeUAM | ||
| 050 | 4 | _aQ334-342 | |
| 050 | 4 | _aTJ210.2-211.495 | |
| 082 | 0 | 4 |
_a006.3 _223 |
| 100 | 1 |
_aKwuida, Léonard. _eeditor. |
|
| 245 | 1 | 0 |
_aFormal Concept Analysis _h[recurso electrónico] : _b8th International Conference, ICFCA 2010, Agadir, Morocco, March 15-18, 2010. Proceedings / _cedited by Léonard Kwuida, Baris Sertkaya. |
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010. |
|
| 300 |
_aXII, 340p. 91 illus. _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 Computer Science, _x0302-9743 ; _v5986 |
|
| 505 | 0 | _aInvited Talks -- About the Enumeration Algorithms of Closed Sets -- Mathematics Presenting, Reflecting, Judging -- The Role of Concept, Context, and Component for Dependable Software Development -- Statistical Methods for Data Mining and Knowledge Discovery -- Regular Contributions -- Formal Concept Analysis of Two-Dimensional Convex Continuum Structures -- Counting of Moore Families for n=7 -- Lattice Drawings and Morphisms -- Approximations in Concept Lattices -- Hardness of Enumerating Pseudo-intents in the Lectic Order -- On Links between Concept Lattices and Related Complexity Problems -- An Algorithm for Extracting Rare Concepts with Concise Intents -- Conditional Functional Dependencies: An FCA Point of View -- Constrained Closed Datacubes -- Conceptual Navigation in RDF Graphs with SPARQL-Like Queries -- An Approach to Exploring Description Logic Knowledge Bases -- On Categorial Grammars as Logical Information Systems -- Describing Role Models in Terms of Formal Concept Analysis -- Approaches to the Selection of Relevant Concepts in the Case of Noisy Data -- Concept Analysis as a Framework for Mining Functional Features from Legacy Code -- Concept Neighbourhoods in Lexical Databases -- A Survey of Hybrid Representations of Concept Lattices in Conceptual Knowledge Processing -- History -- Two Basic Algorithms in Concept Analysis. | |
| 520 | _aThis volume contains selected papers presented at ICFCA 2010, the 8th Int- national Conference on Formal Concept Analysis. The ICFCA conference series aims to be the prime forum for dissemination of advances in applied lattice and order theory, and in particular advances in theory and applications of Formal Concept Analysis. Formal Concept Analysis (FCA) is a ?eld of applied mathematics with its mathematical root in order theory, in particular the theory of complete lattices. Researchershadlongbeenawareofthefactthatthese?eldshavemanypotential applications.FCAemergedinthe1980sfrome?ortstorestructurelattice theory to promote better communication between lattice theorists and potential users of lattice theory. The key theme was the mathematical formalization of c- cept and conceptual hierarchy. Since then, the ?eld has developed into a growing research area in its own right with a thriving theoretical community and an - creasingnumberofapplicationsindataandknowledgeprocessingincludingdata visualization, information retrieval, machine learning, sofware engineering, data analysis, data mining in Web 2.0, analysis of social networks, concept graphs, contextual logic and description logics. ICFCA 2010 took place during March 15–18, 2010 in Agadir, Morocco. We received 37 high-quality submissions out of which 17 were chosen as regular papers in these proceedings after a competitive selection process. Less mature works that were still considered valuable for discussion at the conference were collected in the supplementary proceedings. The papers in the present volume coveradvancesinvariousaspectsofFCArangingfromitstheoreticalfoundations to its applications in numerous other ?elds. In addition to the regular papers, thisvolumealsocontainsfourkeynotepapersarisingfromtheseveninvitedtalks given at the conference. We are also delighted to include a reprint of Bernhard Ganter’sseminalpaper on hiswell-knownalgorithmfor enumerating closedsets. | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aComputational complexity. | |
| 650 | 0 | _aData mining. | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 0 | _aAlgebra. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
| 650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
| 650 | 2 | 4 | _aData Mining and Knowledge Discovery. |
| 650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 650 | 2 | 4 | _aOrder, Lattices, Ordered Algebraic Structures. |
| 700 | 1 |
_aSertkaya, Baris. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642119279 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v5986 |
|
| 856 | 4 | 0 |
_zLibro electrónico _uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-11928-6 |
| 596 | _a19 | ||
| 942 | _cLIBRO_ELEC | ||
| 999 |
_c202020 _d202020 |
||