Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Formal Concept Analysis [[electronic resource] ] : 15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25–28, 2019, Proceedings / / edited by Diana Cristea, Florence Le Ber, Baris Sertkaya
| Formal Concept Analysis [[electronic resource] ] : 15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25–28, 2019, Proceedings / / edited by Diana Cristea, Florence Le Ber, Baris Sertkaya |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XIII, 349 p. 560 illus., 33 illus. in color.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Database management Data mining Mathematical logic Application software Numerical analysis Artificial Intelligence Database Management Data Mining and Knowledge Discovery Mathematical Logic and Formal Languages Computer Appl. in Administrative Data Processing Numeric Computing |
| ISBN | 3-030-21462-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited papers -- Elements about Hybrid, Exploratory, and Explainable Knowledge Discovery -- Too Much Information: Can AI Cope With Modern Knowledge Graphs -- Learning Implications from Data and from Queries -- Concepts in Application Context -- Theory -- Direct and Binary Direct Bases for One-set Updates of a Closure System -- Dualization in lattices given by implicational bases -- Properties of Finite Lattices -- Joining Implications in Formal Contexts and Inductive Learning in a Horn Description Logic -- Methods and Applications -- On-demand Relational Concept Analysis -- Mining Formal Concepts using Implications between Items -- Effects of Input Data Formalisation in Relational Concept Analysis for a Data Model with a Ternary Relation -- Parallelization of the GreConD Algorithm for Boolean Matrix Factorization -- Simultaneous, polynomial-time layout of Context Bigraph and Lattice Digraph -- Using Redescriptions and Formal Concept Analysis for Mining Definitions in Linked Data -- Enhanced FCA -- A Formal Context for Closures of Acyclic Hypergraphs -- Concept lattices as a search space for graph compression -- A relational extension of Galois Connections -- Short Papers -- Sampling Representation Contexts with Attribute Exploration -- Discovering Implicational Knowledge in Wikidata -- A characterization theorem for continuous lattices by closure spaces -- On Coupling FCA and MDL in Pattern Mining -- A Study of Boolean Matrix Factorization Under Supervised Settings. |
| Record Nr. | UNISA-996466282903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal Concept Analysis : 15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25–28, 2019, Proceedings / / edited by Diana Cristea, Florence Le Ber, Baris Sertkaya
| Formal Concept Analysis : 15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25–28, 2019, Proceedings / / edited by Diana Cristea, Florence Le Ber, Baris Sertkaya |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XIII, 349 p. 560 illus., 33 illus. in color.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Database management Data mining Mathematical logic Application software Numerical analysis Artificial Intelligence Database Management Data Mining and Knowledge Discovery Mathematical Logic and Formal Languages Computer Appl. in Administrative Data Processing Numeric Computing |
| ISBN | 3-030-21462-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited papers -- Elements about Hybrid, Exploratory, and Explainable Knowledge Discovery -- Too Much Information: Can AI Cope With Modern Knowledge Graphs -- Learning Implications from Data and from Queries -- Concepts in Application Context -- Theory -- Direct and Binary Direct Bases for One-set Updates of a Closure System -- Dualization in lattices given by implicational bases -- Properties of Finite Lattices -- Joining Implications in Formal Contexts and Inductive Learning in a Horn Description Logic -- Methods and Applications -- On-demand Relational Concept Analysis -- Mining Formal Concepts using Implications between Items -- Effects of Input Data Formalisation in Relational Concept Analysis for a Data Model with a Ternary Relation -- Parallelization of the GreConD Algorithm for Boolean Matrix Factorization -- Simultaneous, polynomial-time layout of Context Bigraph and Lattice Digraph -- Using Redescriptions and Formal Concept Analysis for Mining Definitions in Linked Data -- Enhanced FCA -- A Formal Context for Closures of Acyclic Hypergraphs -- Concept lattices as a search space for graph compression -- A relational extension of Galois Connections -- Short Papers -- Sampling Representation Contexts with Attribute Exploration -- Discovering Implicational Knowledge in Wikidata -- A characterization theorem for continuous lattices by closure spaces -- On Coupling FCA and MDL in Pattern Mining -- A Study of Boolean Matrix Factorization Under Supervised Settings. |
| Record Nr. | UNINA-9910337851803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Formal Concept Analysis [[electronic resource] ] : 8th International Conference, ICFCA 2010, Agadir, Morocco, March 15-18, 2010, Procedings / / edited by Léonard Kwuida, Baris Sertkaya
| Formal Concept Analysis [[electronic resource] ] : 8th International Conference, ICFCA 2010, Agadir, Morocco, March 15-18, 2010, Procedings / / edited by Léonard Kwuida, Baris Sertkaya |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XII, 340 p. 91 illus.) |
| Disciplina | 512 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Algebra
Artificial intelligence Mathematical models Data mining Machine theory Computer science—Mathematics Discrete mathematics Artificial Intelligence Mathematical Modeling and Industrial Mathematics Data Mining and Knowledge Discovery Formal Languages and Automata Theory Discrete Mathematics in Computer Science |
| ISBN |
1-280-38579-0
9786613563712 3-642-11928-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited 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. |
| Record Nr. | UNISA-996465304403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal concept analysis : 8th International Conference, ICFCA 2010, Agadir, Morocco, March 15-18, 2010 : proceedings / / Leonard Kwuida, Bars Sertkaya (eds.)
| Formal concept analysis : 8th International Conference, ICFCA 2010, Agadir, Morocco, March 15-18, 2010 : proceedings / / Leonard Kwuida, Bars Sertkaya (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | New York, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XII, 340 p. 91 illus.) |
| Disciplina | 512 |
| Altri autori (Persone) |
KwuidaLeonard
SertkayaBaris |
| Collana |
Lecture notes in computer science. Lecture notes in artificial intelligence
LNCS sublibrary. SL 7, Artificial intelligence |
| Soggetto topico |
Comprehension (Theory of knowledge)
Artificial intelligence - Mathematical models Information theory Lattice theory Logic, Symbolic and mathematical |
| ISBN |
1-280-38579-0
9786613563712 3-642-11928-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited 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. |
| Altri titoli varianti | ICFCA 2010 |
| Record Nr. | UNINA-9910484303303321 |
| New York, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||