Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data

Identifieur interne : 004D25 ( Main/Exploration ); précédent : 004D24; suivant : 004D26

A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data

Auteurs : Mohamed Hacene Rouane [Canada] ; Marianne Huchard ; Amedeo Napoli ; Petko Valtchev [Canada]

Source :

RBID : ISTEX:1A704EBA7B846765A63376BDA041E4DEE97BBFA5

Abstract

Abstract: Recent advances in data and knowledge engineering have emphasized the need for formal concept analysis (fca) tools taking into account structured data. There are a few adaptations of the classical fca methodology for handling contexts holding on complex data formats, e.g. graph-based or relational data. In this paper, relational concept analysis (rca) is proposed, as an adaptation of fca for analyzing objects described both by binary and relational attributes. The rca process takes as input a collection of contexts and of inter-context relations, and yields a set of lattices, one per context, whose concepts are linked by relations. Moreover, a way of representing the concepts and relations extracted with rca is proposed in the framework of a description logic. The rca process has been implemented within the Galicia platform, offering new and efficient tools for knowledge and software engineering.

Url:
DOI: 10.1007/978-3-540-70901-5_4


Affiliations:


Links toward previous steps (curation, corpus...)


Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data</title>
<author>
<name sortKey="Rouane, Mohamed Hacene" sort="Rouane, Mohamed Hacene" uniqKey="Rouane M" first="Mohamed Hacene" last="Rouane">Mohamed Hacene Rouane</name>
</author>
<author>
<name sortKey="Huchard, Marianne" sort="Huchard, Marianne" uniqKey="Huchard M" first="Marianne" last="Huchard">Marianne Huchard</name>
</author>
<author>
<name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name>
</author>
<author>
<name sortKey="Valtchev, Petko" sort="Valtchev, Petko" uniqKey="Valtchev P" first="Petko" last="Valtchev">Petko Valtchev</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:1A704EBA7B846765A63376BDA041E4DEE97BBFA5</idno>
<date when="2007" year="2007">2007</date>
<idno type="doi">10.1007/978-3-540-70901-5_4</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-3R5ZK778-C/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000597</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000597</idno>
<idno type="wicri:Area/Istex/Curation">000592</idno>
<idno type="wicri:Area/Istex/Checkpoint">001110</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001110</idno>
<idno type="wicri:doubleKey">0302-9743:2007:Rouane M:a:proposal:for</idno>
<idno type="wicri:Area/Main/Merge">004E59</idno>
<idno type="wicri:Area/Main/Curation">004D25</idno>
<idno type="wicri:Area/Main/Exploration">004D25</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data</title>
<author>
<name sortKey="Rouane, Mohamed Hacene" sort="Rouane, Mohamed Hacene" uniqKey="Rouane M" first="Mohamed Hacene" last="Rouane">Mohamed Hacene Rouane</name>
<affiliation wicri:level="1">
<country xml:lang="fr">Canada</country>
<wicri:regionArea>DIRO, Université de Montréal, C.P. 6128, Succ. CV, Montréal, H3C 3J7</wicri:regionArea>
<wicri:noRegion>H3C 3J7</wicri:noRegion>
</affiliation>
</author>
<author>
<name sortKey="Huchard, Marianne" sort="Huchard, Marianne" uniqKey="Huchard M" first="Marianne" last="Huchard">Marianne Huchard</name>
<affiliation>
<wicri:noCountry code="subField"> </wicri:noCountry>
</affiliation>
</author>
<author>
<name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name>
<affiliation>
<wicri:noCountry code="subField"> </wicri:noCountry>
</affiliation>
</author>
<author>
<name sortKey="Valtchev, Petko" sort="Valtchev, Petko" uniqKey="Valtchev P" first="Petko" last="Valtchev">Petko Valtchev</name>
<affiliation wicri:level="1">
<country xml:lang="fr">Canada</country>
<wicri:regionArea>DIRO, Université de Montréal, C.P. 6128, Succ. CV, Montréal, H3C 3J7</wicri:regionArea>
<wicri:noRegion>H3C 3J7</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country xml:lang="fr">Canada</country>
<wicri:regionArea>Dépt. informatique, UQAM, C.P. 8888, Succ. CV, Montréal, H3C 3P8</wicri:regionArea>
<wicri:noRegion>H3C 3P8</wicri:noRegion>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<title level="s" type="abbrev">LNCS</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass></textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Abstract: Recent advances in data and knowledge engineering have emphasized the need for formal concept analysis (fca) tools taking into account structured data. There are a few adaptations of the classical fca methodology for handling contexts holding on complex data formats, e.g. graph-based or relational data. In this paper, relational concept analysis (rca) is proposed, as an adaptation of fca for analyzing objects described both by binary and relational attributes. The rca process takes as input a collection of contexts and of inter-context relations, and yields a set of lattices, one per context, whose concepts are linked by relations. Moreover, a way of representing the concepts and relations extracted with rca is proposed in the framework of a description logic. The rca process has been implemented within the Galicia platform, offering new and efficient tools for knowledge and software engineering.</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>Canada</li>
</country>
</list>
<tree>
<noCountry>
<name sortKey="Huchard, Marianne" sort="Huchard, Marianne" uniqKey="Huchard M" first="Marianne" last="Huchard">Marianne Huchard</name>
<name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name>
</noCountry>
<country name="Canada">
<noRegion>
<name sortKey="Rouane, Mohamed Hacene" sort="Rouane, Mohamed Hacene" uniqKey="Rouane M" first="Mohamed Hacene" last="Rouane">Mohamed Hacene Rouane</name>
</noRegion>
<name sortKey="Valtchev, Petko" sort="Valtchev, Petko" uniqKey="Valtchev P" first="Petko" last="Valtchev">Petko Valtchev</name>
<name sortKey="Valtchev, Petko" sort="Valtchev, Petko" uniqKey="Valtchev P" first="Petko" last="Valtchev">Petko Valtchev</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004D25 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 004D25 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:1A704EBA7B846765A63376BDA041E4DEE97BBFA5
   |texte=   A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022