Arbitrary Relations in Formal Concept Analysis and Logical Information Systems

Arbitrary Relations in Formal Concept Analysis and Logical Information Systems

A logical view of formal concept analysis considers attributes of a formal context as unary predicates. In a first part, we propose an augmented definition that handles binary relations between objects. A Galois connection is defined on augmented contexts. It represents concept inheritance as usual,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ferré, Sébastien, Ridoux, Olivier, Sigonneau, Benjamin
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Applied sciences
Artificial intelligence
Computer science
control theory
systems
Exact sciences and technology
Learning and adaptive systems
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 180
container_issue
container_start_page 166
container_title
container_volume
creator Ferré, Sébastien
Ridoux, Olivier
Sigonneau, Benjamin
description A logical view of formal concept analysis considers attributes of a formal context as unary predicates. In a first part, we propose an augmented definition that handles binary relations between objects. A Galois connection is defined on augmented contexts. It represents concept inheritance as usual, but also relations between concepts. As usual, labeling operators are also defined. In particular, concepts and relations are visible and labeled in a single structure. In a second part, we show how relations can be used for navigating in an augmented concept lattice. This part augments the theory of Logical Information Systems. An implementation is sketched, and first experimental results are presented.
doi_str_mv 10.1007/11524564_11
format Conference Proceeding
fullrecord <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17027554</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17027554</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-da89b7d22f0fde2b56435c982fb6264d5212e3417f64d4303cd97aa53f89cb7f3</originalsourceid><addsrcrecordid>eNpNUMtOwzAQNC-JqvTED_jCgUPA67Xj-FhVFCpVIPE4W87DVSB1IjuX_j2OWiH2MlrN7GpmCLkF9gCMqUcAyYXMhQE4IwutCpSCIRSF1OdkBjlAhij0xR_H1YSXZMaQ8UwrgddkEeM3S4Occ4Yz8roMZTsGGw70vens2PY-0tbTdR_2tqOr3lfNMNKlt90htpFaX9Ntv2urRG68m1TTDf04xLHZxxty5WwXm8UJ5-Rr_fS5esm2b8-b1XKbDRz0mNW20KWqOXfM1Q0vUyqUlS64K3Oei1py4A0KUC4tAhlWtVbWSnSFrkrlcE7ujn8HG5MVF6yv2miG0O5TFAMqhZdSJN39URcT5XdNMGXf_0QDzEydmn-d4i-ZYWMM</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Arbitrary Relations in Formal Concept Analysis and Logical Information Systems</title><source>Springer Books</source><creator>Ferré, Sébastien ; Ridoux, Olivier ; Sigonneau, Benjamin</creator><contributor>Stumme, Gerd ; Dau, Frithjof ; Mugnier, Marie-Laure</contributor><creatorcontrib>Ferré, Sébastien ; Ridoux, Olivier ; Sigonneau, Benjamin ; Stumme, Gerd ; Dau, Frithjof ; Mugnier, Marie-Laure</creatorcontrib><description>A logical view of formal concept analysis considers attributes of a formal context as unary predicates. In a first part, we propose an augmented definition that handles binary relations between objects. A Galois connection is defined on augmented contexts. It represents concept inheritance as usual, but also relations between concepts. As usual, labeling operators are also defined. In particular, concepts and relations are visible and labeled in a single structure. In a second part, we show how relations can be used for navigating in an augmented concept lattice. This part augments the theory of Logical Information Systems. An implementation is sketched, and first experimental results are presented.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540277835</identifier><identifier>ISBN: 3540277838</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540318859</identifier><identifier>EISBN: 3540318852</identifier><identifier>DOI: 10.1007/11524564_11</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Artificial intelligence ; Computer science; control theory; systems ; Exact sciences and technology ; Learning and adaptive systems</subject><ispartof>Conceptual Structures: Common Semantics for Sharing Knowledge, 2005, p.166-180</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11524564_11$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11524564_11$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4035,4036,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=17027554$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Stumme, Gerd</contributor><contributor>Dau, Frithjof</contributor><contributor>Mugnier, Marie-Laure</contributor><creatorcontrib>Ferré, Sébastien</creatorcontrib><creatorcontrib>Ridoux, Olivier</creatorcontrib><creatorcontrib>Sigonneau, Benjamin</creatorcontrib><title>Arbitrary Relations in Formal Concept Analysis and Logical Information Systems</title><title>Conceptual Structures: Common Semantics for Sharing Knowledge</title><description>A logical view of formal concept analysis considers attributes of a formal context as unary predicates. In a first part, we propose an augmented definition that handles binary relations between objects. A Galois connection is defined on augmented contexts. It represents concept inheritance as usual, but also relations between concepts. As usual, labeling operators are also defined. In particular, concepts and relations are visible and labeled in a single structure. In a second part, we show how relations can be used for navigating in an augmented concept lattice. This part augments the theory of Logical Information Systems. An implementation is sketched, and first experimental results are presented.</description><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Learning and adaptive systems</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540277835</isbn><isbn>3540277838</isbn><isbn>9783540318859</isbn><isbn>3540318852</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNUMtOwzAQNC-JqvTED_jCgUPA67Xj-FhVFCpVIPE4W87DVSB1IjuX_j2OWiH2MlrN7GpmCLkF9gCMqUcAyYXMhQE4IwutCpSCIRSF1OdkBjlAhij0xR_H1YSXZMaQ8UwrgddkEeM3S4Occ4Yz8roMZTsGGw70vens2PY-0tbTdR_2tqOr3lfNMNKlt90htpFaX9Ntv2urRG68m1TTDf04xLHZxxty5WwXm8UJ5-Rr_fS5esm2b8-b1XKbDRz0mNW20KWqOXfM1Q0vUyqUlS64K3Oei1py4A0KUC4tAhlWtVbWSnSFrkrlcE7ujn8HG5MVF6yv2miG0O5TFAMqhZdSJN39URcT5XdNMGXf_0QDzEydmn-d4i-ZYWMM</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Ferré, Sébastien</creator><creator>Ridoux, Olivier</creator><creator>Sigonneau, Benjamin</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Arbitrary Relations in Formal Concept Analysis and Logical Information Systems</title><author>Ferré, Sébastien ; Ridoux, Olivier ; Sigonneau, Benjamin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-da89b7d22f0fde2b56435c982fb6264d5212e3417f64d4303cd97aa53f89cb7f3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Learning and adaptive systems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ferré, Sébastien</creatorcontrib><creatorcontrib>Ridoux, Olivier</creatorcontrib><creatorcontrib>Sigonneau, Benjamin</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ferré, Sébastien</au><au>Ridoux, Olivier</au><au>Sigonneau, Benjamin</au><au>Stumme, Gerd</au><au>Dau, Frithjof</au><au>Mugnier, Marie-Laure</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Arbitrary Relations in Formal Concept Analysis and Logical Information Systems</atitle><btitle>Conceptual Structures: Common Semantics for Sharing Knowledge</btitle><date>2005</date><risdate>2005</risdate><spage>166</spage><epage>180</epage><pages>166-180</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540277835</isbn><isbn>3540277838</isbn><eisbn>9783540318859</eisbn><eisbn>3540318852</eisbn><abstract>A logical view of formal concept analysis considers attributes of a formal context as unary predicates. In a first part, we propose an augmented definition that handles binary relations between objects. A Galois connection is defined on augmented contexts. It represents concept inheritance as usual, but also relations between concepts. As usual, labeling operators are also defined. In particular, concepts and relations are visible and labeled in a single structure. In a second part, we show how relations can be used for navigating in an augmented concept lattice. This part augments the theory of Logical Information Systems. An implementation is sketched, and first experimental results are presented.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11524564_11</doi><tpages>15</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Conceptual Structures: Common Semantics for Sharing Knowledge, 2005, p.166-180
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_17027554
source Springer Books
subjects Applied sciences
Artificial intelligence
Computer science
control theory
systems
Exact sciences and technology
Learning and adaptive systems
title Arbitrary Relations in Formal Concept Analysis and Logical Information Systems
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T00%3A55%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Arbitrary%20Relations%20in%20Formal%20Concept%20Analysis%20and%20Logical%20Information%20Systems&rft.btitle=Conceptual%20Structures:%20Common%20Semantics%20for%20Sharing%20Knowledge&rft.au=Ferr%C3%A9,%20S%C3%A9bastien&rft.date=2005&rft.spage=166&rft.epage=180&rft.pages=166-180&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540277835&rft.isbn_list=3540277838&rft_id=info:doi/10.1007/11524564_11&rft_dat=%3Cpascalfrancis_sprin%3E17027554%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540318859&rft.eisbn_list=3540318852&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true