InforLorV4, PascalFrancis, Corpus, bibRecord, 000902

Intelligent structuring and reducing of association rules with Formal Concept Analysis

Identifieur interne : 000902 ( PascalFrancis/Corpus ); précédent : 000901; suivant : 000903

Intelligent structuring and reducing of association rules with Formal Concept Analysis

Auteurs : Gerd Stumme ; Rafik Taouil ; Yves Bastide ; Nicolas Pasquier ; Lotfi Lakhal

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2001.

RBID : Pascal:02-0050428

Descripteurs français

Pascal (Inist)
- Représentation connaissances, Analyse conceptuelle, Découverte connaissance, Base donnée, Base connaissance, Système expert, Analyse concept formel, Règle association.

English descriptors

KwdEn :
- Association rule, Conceptual analysis, Database, Expert system, Knowledge base, Knowledge discovery, Knowledge representation.

Abstract

Association rules are used to investigate large databases. The analyst is usually confronted with large lists of such rules and has to find the most relevant ones for his purpose. Based on results about knowledge representation within the theoretical framework of Formal Concept Analysis, we present relatively small bases for association rules from which all rules can be deduced. We also provide algorithms for their calculation.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2174`
A08	`01`	`1`	`ENG`	`@1 Intelligent structuring and reducing of association rules with Formal Concept Analysis`
A09	`01`	`1`	`ENG`	`@1 KI 2001 : advances in artificial intelligence : Vienna, 19-21 September 2001`
A11	`01`	`1`		`@1 STUMME (Gerd)`
A11	`02`	`1`		`@1 TAOUIL (Rafik)`
A11	`03`	`1`		`@1 BASTIDE (Yves)`
A11	`04`	`1`		`@1 PASQUIER (Nicolas)`
A11	`05`	`1`		`@1 LAKHAL (Lotfi)`
A12	`01`	`1`		`@1 BAADER (Franz) @9 ed.`
A12	`02`	`1`		`@1 BREWKA (Gerhard) @9 ed.`
A12	`03`	`1`		`@1 EITER (Thomas) @9 ed.`
A14	`01`			`@1 Institut für Angewandte Informatik und Formale Beschreibungsverfahren (AIFB), Universität Karlsruhe (TH) @2 76128 Karlsruhe @3 DEU @Z 1 aut.`
A14	`02`			`@1 INRIA Lorraine, LORIA, BP 239 @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 2 aut.`
A14	`03`			`@1 Laboratoire d'Informatique (LIMOS), Université Blaise Pascal, Complexe Scientifique des Cézeaux, 24 Av. des Landais @2 63177 Aubière @3 FRA @Z 3 aut.`
A14	`04`			`@1 I3S, CNRS UMR-6070, Université de Nice - Sophia Antipolis, Les Algorithmes, 2000 route des Lucioles @2 06903 Sophia Antipolis @3 FRA @Z 4 aut.`
A14	`05`			`@1 LIM, CNRS FRE-2246, Université de la Méditerranée, Case 90, 163 Avenue de Luminy @2 13288 Marseille @3 FRA @Z 5 aut.`
A20				`@1 335-350`
A21				`@1 2001`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-42612-4`
A43	`01`			`@1 INIST @2 16343 @5 354000097047100230`
A44				`@0 0000 @1 © 2002 INIST-CNRS. All rights reserved.`
A45				`@0 44 ref.`
A47	`01`	`1`		`@0 02-0050428`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
A66	`02`			`@0 USA`
C01	`01`		`ENG`	`@0 Association rules are used to investigate large databases. The analyst is usually confronted with large lists of such rules and has to find the most relevant ones for his purpose. Based on results about knowledge representation within the theoretical framework of Formal Concept Analysis, we present relatively small bases for association rules from which all rules can be deduced. We also provide algorithms for their calculation.`
C02	`01`	`X`		`@0 001D02B07D`
C02	`02`	`X`		`@0 001D02C02`
C03	`01`	`X`	`FRE`	`@0 Représentation connaissances @5 01`
C03	`01`	`X`	`ENG`	`@0 Knowledge representation @5 01`
C03	`01`	`X`	`SPA`	`@0 Representación conocimientos @5 01`
C03	`02`	`X`	`FRE`	`@0 Analyse conceptuelle @5 02`
C03	`02`	`X`	`ENG`	`@0 Conceptual analysis @5 02`
C03	`02`	`X`	`SPA`	`@0 Análisis conceptual @5 02`
C03	`03`	`X`	`FRE`	`@0 Découverte connaissance @5 03`
C03	`03`	`X`	`ENG`	`@0 Knowledge discovery @5 03`
C03	`03`	`X`	`SPA`	`@0 Descubrimiento conocimiento @5 03`
C03	`04`	`X`	`FRE`	`@0 Base donnée @5 04`
C03	`04`	`X`	`ENG`	`@0 Database @5 04`
C03	`04`	`X`	`SPA`	`@0 Base dato @5 04`
C03	`05`	`X`	`FRE`	`@0 Base connaissance @5 05`
C03	`05`	`X`	`ENG`	`@0 Knowledge base @5 05`
C03	`05`	`X`	`SPA`	`@0 Base conocimiento @5 05`
C03	`06`	`X`	`FRE`	`@0 Système expert @5 06`
C03	`06`	`X`	`ENG`	`@0 Expert system @5 06`
C03	`06`	`X`	`SPA`	`@0 Sistema experto @5 06`
C03	`07`	`X`	`FRE`	`@0 Analyse concept formel @4 INC @5 82`
C03	`08`	`X`	`FRE`	`@0 Règle association @4 CD @5 96`
C03	`08`	`X`	`ENG`	`@0 Association rule @4 CD @5 96`
N21				`@1 021`

A30	`01`	`1`	`ENG`	`@1 Joint German/Austrian conference on AI @3 Vienna AUT @4 2001-09-19`

Format Inist (serveur)

NO :	PASCAL 02-0050428 INIST
ET :	Intelligent structuring and reducing of association rules with Formal Concept Analysis
AU :	STUMME (Gerd); TAOUIL (Rafik); BASTIDE (Yves); PASQUIER (Nicolas); LAKHAL (Lotfi); BAADER (Franz); BREWKA (Gerhard); EITER (Thomas)
AF :	Institut für Angewandte Informatik und Formale Beschreibungsverfahren (AIFB), Universität Karlsruhe (TH)/76128 Karlsruhe/Allemagne (1 aut.); INRIA Lorraine, LORIA, BP 239/54506 Vandœuvre-lès-Nancy/France (2 aut.); Laboratoire d'Informatique (LIMOS), Université Blaise Pascal, Complexe Scientifique des Cézeaux, 24 Av. des Landais/63177 Aubière/France (3 aut.); I3S, CNRS UMR-6070, Université de Nice - Sophia Antipolis, Les Algorithmes, 2000 route des Lucioles/06903 Sophia Antipolis/France (4 aut.); LIM, CNRS FRE-2246, Université de la Méditerranée, Case 90, 163 Avenue de Luminy/13288 Marseille/France (5 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2001; Vol. 2174; Pp. 335-350; Bibl. 44 ref.
LA :	Anglais
EA :	Association rules are used to investigate large databases. The analyst is usually confronted with large lists of such rules and has to find the most relevant ones for his purpose. Based on results about knowledge representation within the theoretical framework of Formal Concept Analysis, we present relatively small bases for association rules from which all rules can be deduced. We also provide algorithms for their calculation.
CC :	001D02B07D; 001D02C02
FD :	Représentation connaissances; Analyse conceptuelle; Découverte connaissance; Base donnée; Base connaissance; Système expert; Analyse concept formel; Règle association
ED :	Knowledge representation; Conceptual analysis; Knowledge discovery; Database; Knowledge base; Expert system; Association rule
SD :	Representación conocimientos; Análisis conceptual; Descubrimiento conocimiento; Base dato; Base conocimiento; Sistema experto
LO :	INIST-16343.354000097047100230
ID :	02-0050428

Links to Exploration step

Pascal:02-0050428

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Intelligent structuring and reducing of association rules with Formal Concept Analysis</title>
<author><name sortKey="Stumme, Gerd" sort="Stumme, Gerd" uniqKey="Stumme G" first="Gerd" last="Stumme">Gerd Stumme</name>
<affiliation><inist:fA14 i1="01"><s1>Institut für Angewandte Informatik und Formale Beschreibungsverfahren (AIFB), Universität Karlsruhe (TH)</s1>
<s2>76128 Karlsruhe</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Taouil, Rafik" sort="Taouil, Rafik" uniqKey="Taouil R" first="Rafik" last="Taouil">Rafik Taouil</name>
<affiliation><inist:fA14 i1="02"><s1>INRIA Lorraine, LORIA, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Bastide, Yves" sort="Bastide, Yves" uniqKey="Bastide Y" first="Yves" last="Bastide">Yves Bastide</name>
<affiliation><inist:fA14 i1="03"><s1>Laboratoire d'Informatique (LIMOS), Université Blaise Pascal, Complexe Scientifique des Cézeaux, 24 Av. des Landais</s1>
<s2>63177 Aubière</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Pasquier, Nicolas" sort="Pasquier, Nicolas" uniqKey="Pasquier N" first="Nicolas" last="Pasquier">Nicolas Pasquier</name>
<affiliation><inist:fA14 i1="04"><s1>I3S, CNRS UMR-6070, Université de Nice - Sophia Antipolis, Les Algorithmes, 2000 route des Lucioles</s1>
<s2>06903 Sophia Antipolis</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Lakhal, Lotfi" sort="Lakhal, Lotfi" uniqKey="Lakhal L" first="Lotfi" last="Lakhal">Lotfi Lakhal</name>
<affiliation><inist:fA14 i1="05"><s1>LIM, CNRS FRE-2246, Université de la Méditerranée, Case 90, 163 Avenue de Luminy</s1>
<s2>13288 Marseille</s2>
<s3>FRA</s3>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">02-0050428</idno>
<date when="2001">2001</date>
<idno type="stanalyst">PASCAL 02-0050428 INIST</idno>
<idno type="RBID">Pascal:02-0050428</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000902</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Intelligent structuring and reducing of association rules with Formal Concept Analysis</title>
<author><name sortKey="Stumme, Gerd" sort="Stumme, Gerd" uniqKey="Stumme G" first="Gerd" last="Stumme">Gerd Stumme</name>
<affiliation><inist:fA14 i1="01"><s1>Institut für Angewandte Informatik und Formale Beschreibungsverfahren (AIFB), Universität Karlsruhe (TH)</s1>
<s2>76128 Karlsruhe</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Taouil, Rafik" sort="Taouil, Rafik" uniqKey="Taouil R" first="Rafik" last="Taouil">Rafik Taouil</name>
<affiliation><inist:fA14 i1="02"><s1>INRIA Lorraine, LORIA, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Bastide, Yves" sort="Bastide, Yves" uniqKey="Bastide Y" first="Yves" last="Bastide">Yves Bastide</name>
<affiliation><inist:fA14 i1="03"><s1>Laboratoire d'Informatique (LIMOS), Université Blaise Pascal, Complexe Scientifique des Cézeaux, 24 Av. des Landais</s1>
<s2>63177 Aubière</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Pasquier, Nicolas" sort="Pasquier, Nicolas" uniqKey="Pasquier N" first="Nicolas" last="Pasquier">Nicolas Pasquier</name>
<affiliation><inist:fA14 i1="04"><s1>I3S, CNRS UMR-6070, Université de Nice - Sophia Antipolis, Les Algorithmes, 2000 route des Lucioles</s1>
<s2>06903 Sophia Antipolis</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Lakhal, Lotfi" sort="Lakhal, Lotfi" uniqKey="Lakhal L" first="Lotfi" last="Lakhal">Lotfi Lakhal</name>
<affiliation><inist:fA14 i1="05"><s1>LIM, CNRS FRE-2246, Université de la Méditerranée, Case 90, 163 Avenue de Luminy</s1>
<s2>13288 Marseille</s2>
<s3>FRA</s3>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2001">2001</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Association rule</term>
<term>Conceptual analysis</term>
<term>Database</term>
<term>Expert system</term>
<term>Knowledge base</term>
<term>Knowledge discovery</term>
<term>Knowledge representation</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Représentation connaissances</term>
<term>Analyse conceptuelle</term>
<term>Découverte connaissance</term>
<term>Base donnée</term>
<term>Base connaissance</term>
<term>Système expert</term>
<term>Analyse concept formel</term>
<term>Règle association</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Association rules are used to investigate large databases. The analyst is usually confronted with large lists of such rules and has to find the most relevant ones for his purpose. Based on results about knowledge representation within the theoretical framework of Formal Concept Analysis, we present relatively small bases for association rules from which all rules can be deduced. We also provide algorithms for their calculation.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2174</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Intelligent structuring and reducing of association rules with Formal Concept Analysis</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>KI 2001 : advances in artificial intelligence : Vienna, 19-21 September 2001</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>STUMME (Gerd)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>TAOUIL (Rafik)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>BASTIDE (Yves)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>PASQUIER (Nicolas)</s1>
</fA11>
<fA11 i1="05" i2="1"><s1>LAKHAL (Lotfi)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>BAADER (Franz)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>BREWKA (Gerhard)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1"><s1>EITER (Thomas)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Institut für Angewandte Informatik und Formale Beschreibungsverfahren (AIFB), Universität Karlsruhe (TH)</s1>
<s2>76128 Karlsruhe</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>INRIA Lorraine, LORIA, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>Laboratoire d'Informatique (LIMOS), Université Blaise Pascal, Complexe Scientifique des Cézeaux, 24 Av. des Landais</s1>
<s2>63177 Aubière</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="04"><s1>I3S, CNRS UMR-6070, Université de Nice - Sophia Antipolis, Les Algorithmes, 2000 route des Lucioles</s1>
<s2>06903 Sophia Antipolis</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</fA14>
<fA14 i1="05"><s1>LIM, CNRS FRE-2246, Université de la Méditerranée, Case 90, 163 Avenue de Luminy</s1>
<s2>13288 Marseille</s2>
<s3>FRA</s3>
<sZ>5 aut.</sZ>
</fA14>
<fA20><s1>335-350</s1>
</fA20>
<fA21><s1>2001</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-42612-4</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000097047100230</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2002 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>44 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>02-0050428</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fA66 i1="02"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>Association rules are used to investigate large databases. The analyst is usually confronted with large lists of such rules and has to find the most relevant ones for his purpose. Based on results about knowledge representation within the theoretical framework of Formal Concept Analysis, we present relatively small bases for association rules from which all rules can be deduced. We also provide algorithms for their calculation.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02B07D</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02C02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Représentation connaissances</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Knowledge representation</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Representación conocimientos</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Analyse conceptuelle</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Conceptual analysis</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Análisis conceptual</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Découverte connaissance</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Knowledge discovery</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Descubrimiento conocimiento</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Base donnée</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Database</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Base dato</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Base connaissance</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Knowledge base</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Base conocimiento</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Système expert</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Expert system</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Sistema experto</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Analyse concept formel</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Règle association</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Association rule</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>021</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>Joint German/Austrian conference on AI</s1>
<s3>Vienna AUT</s3>
<s4>2001-09-19</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 02-0050428 INIST</NO>
<ET>Intelligent structuring and reducing of association rules with Formal Concept Analysis</ET>
<AU>STUMME (Gerd); TAOUIL (Rafik); BASTIDE (Yves); PASQUIER (Nicolas); LAKHAL (Lotfi); BAADER (Franz); BREWKA (Gerhard); EITER (Thomas)</AU>
<AF>Institut für Angewandte Informatik und Formale Beschreibungsverfahren (AIFB), Universität Karlsruhe (TH)/76128 Karlsruhe/Allemagne (1 aut.); INRIA Lorraine, LORIA, BP 239/54506 Vandœuvre-lès-Nancy/France (2 aut.); Laboratoire d'Informatique (LIMOS), Université Blaise Pascal, Complexe Scientifique des Cézeaux, 24 Av. des Landais/63177 Aubière/France (3 aut.); I3S, CNRS UMR-6070, Université de Nice - Sophia Antipolis, Les Algorithmes, 2000 route des Lucioles/06903 Sophia Antipolis/France (4 aut.); LIM, CNRS FRE-2246, Université de la Méditerranée, Case 90, 163 Avenue de Luminy/13288 Marseille/France (5 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2001; Vol. 2174; Pp. 335-350; Bibl. 44 ref.</SO>
<LA>Anglais</LA>
<EA>Association rules are used to investigate large databases. The analyst is usually confronted with large lists of such rules and has to find the most relevant ones for his purpose. Based on results about knowledge representation within the theoretical framework of Formal Concept Analysis, we present relatively small bases for association rules from which all rules can be deduced. We also provide algorithms for their calculation.</EA>
<CC>001D02B07D; 001D02C02</CC>
<FD>Représentation connaissances; Analyse conceptuelle; Découverte connaissance; Base donnée; Base connaissance; Système expert; Analyse concept formel; Règle association</FD>
<ED>Knowledge representation; Conceptual analysis; Knowledge discovery; Database; Knowledge base; Expert system; Association rule</ED>
<SD>Representación conocimientos; Análisis conceptual; Descubrimiento conocimiento; Base dato; Base conocimiento; Sistema experto</SD>
<LO>INIST-16343.354000097047100230</LO>
<ID>02-0050428</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000902 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000902 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:02-0050428
   |texte=   Intelligent structuring and reducing of association rules with Formal Concept Analysis
}}

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

	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.

Serveur d'exploration sur la recherche en informatique en Lorraine

Intelligent structuring and reducing of association rules with Formal Concept Analysis

Intelligent structuring and reducing of association rules with Formal Concept Analysis

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

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