Towards a Rule-Based Matcher Selection
Identifieur interne : 000218 ( Istex/Corpus ); précédent : 000217; suivant : 000219Towards a Rule-Based Matcher Selection
Auteurs : Malgorzata Mochol ; Anja JentzschSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2008.
Abstract
Abstract: The central problems w.r.t. interoperability and data integration issues in the Semantic Web are schema and ontology matching approaches. Today it takes an expert to determine the best algorithm and a decision can usually be made only after experimentation, so as both the necessary scaling and off-the-shelf use of matching algorithms are not possible. To tackle these issues, we present a rule-based evaluation method in which the best algorithms are determined semi-automatically and the selection performs prior to the execution of an algorithm.
Url:
DOI: 10.1007/978-3-540-87696-0_12
Links to Exploration step
ISTEX:29223482425926115F5F2D65F753CC03B5368D97Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Towards a Rule-Based Matcher Selection</title><author><name sortKey="Mochol, Malgorzata" sort="Mochol, Malgorzata" uniqKey="Mochol M" first="Malgorzata" last="Mochol">Malgorzata Mochol</name><affiliation><mods:affiliation>Freie Universität Berlin, Königin-Luise-Str. 24-26, D-14195, Berlin, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mochol@inf.fu-berlin.de</mods:affiliation></affiliation></author><author><name sortKey="Jentzsch, Anja" sort="Jentzsch, Anja" uniqKey="Jentzsch A" first="Anja" last="Jentzsch">Anja Jentzsch</name><affiliation><mods:affiliation>Freie Universität Berlin, Königin-Luise-Str. 24-26, D-14195, Berlin, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mail@anjajentzsch.de</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:29223482425926115F5F2D65F753CC03B5368D97</idno><date when="2008" year="2008">2008</date><idno type="doi">10.1007/978-3-540-87696-0_12</idno><idno type="url">https://api.istex.fr/document/29223482425926115F5F2D65F753CC03B5368D97/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000218</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000218</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Towards a Rule-Based Matcher Selection</title><author><name sortKey="Mochol, Malgorzata" sort="Mochol, Malgorzata" uniqKey="Mochol M" first="Malgorzata" last="Mochol">Malgorzata Mochol</name><affiliation><mods:affiliation>Freie Universität Berlin, Königin-Luise-Str. 24-26, D-14195, Berlin, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mochol@inf.fu-berlin.de</mods:affiliation></affiliation></author><author><name sortKey="Jentzsch, Anja" sort="Jentzsch, Anja" uniqKey="Jentzsch A" first="Anja" last="Jentzsch">Anja Jentzsch</name><affiliation><mods:affiliation>Freie Universität Berlin, Königin-Luise-Str. 24-26, D-14195, Berlin, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mail@anjajentzsch.de</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2008</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">29223482425926115F5F2D65F753CC03B5368D97</idno><idno type="DOI">10.1007/978-3-540-87696-0_12</idno><idno type="ChapterID">12</idno><idno type="ChapterID">Chap12</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The central problems w.r.t. interoperability and data integration issues in the Semantic Web are schema and ontology matching approaches. Today it takes an expert to determine the best algorithm and a decision can usually be made only after experimentation, so as both the necessary scaling and off-the-shelf use of matching algorithms are not possible. To tackle these issues, we present a rule-based evaluation method in which the best algorithms are determined semi-automatically and the selection performs prior to the execution of an algorithm.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Malgorzata Mochol</name><affiliations><json:string>Freie Universität Berlin, Königin-Luise-Str. 24-26, D-14195, Berlin, Germany</json:string><json:string>E-mail: mochol@inf.fu-berlin.de</json:string></affiliations></json:item><json:item><name>Anja Jentzsch</name><affiliations><json:string>Freie Universität Berlin, Königin-Luise-Str. 24-26, D-14195, Berlin, Germany</json:string><json:string>E-mail: mail@anjajentzsch.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: The central problems w.r.t. interoperability and data integration issues in the Semantic Web are schema and ontology matching approaches. Today it takes an expert to determine the best algorithm and a decision can usually be made only after experimentation, so as both the necessary scaling and off-the-shelf use of matching algorithms are not possible. To tackle these issues, we present a rule-based evaluation method in which the best algorithms are determined semi-automatically and the selection performs prior to the execution of an algorithm.</abstract><qualityIndicators><score>4.992</score><pdfVersion>1.3</pdfVersion><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>559</abstractCharCount><pdfWordCount>3984</pdfWordCount><pdfCharCount>25068</pdfCharCount><pdfPageCount>11</pdfPageCount><abstractWordCount>84</abstractWordCount></qualityIndicators><title>Towards a Rule-Based Matcher Selection</title><chapterId><json:string>12</json:string><json:string>Chap12</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2008</copyrightDate></serie><host><editor><json:item><name>Aldo Gangemi</name></json:item><json:item><name>Jérôme Euzenat</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Information Systems Applications (incl.Internet)</value></json:item><json:item><value>Information Storage and Retrieval</value></json:item><json:item><value>Computer Appl. in Administrative Data Processing</value></json:item><json:item><value>Computer Communication Networks</value></json:item></subject><isbn><json:string>978-3-540-87695-3</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Knowledge Engineering: Practice and Patterns</title><bookId><json:string>978-3-540-87696-0</json:string></bookId><volume>5268</volume><pages><last>119</last><first>109</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-540-87696-0</json:string></eisbn><copyrightDate>2008</copyrightDate><doi><json:string>10.1007/978-3-540-87696-0</json:string></doi></host><publicationDate>2008</publicationDate><copyrightDate>2008</copyrightDate><doi><json:string>10.1007/978-3-540-87696-0_12</json:string></doi><id>29223482425926115F5F2D65F753CC03B5368D97</id><score>0.07501528</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/29223482425926115F5F2D65F753CC03B5368D97/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/29223482425926115F5F2D65F753CC03B5368D97/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/29223482425926115F5F2D65F753CC03B5368D97/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Towards a Rule-Based Matcher Selection</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag Berlin Heidelberg, 2008</p></availability><date>2008</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Towards a Rule-Based Matcher Selection</title><author xml:id="author-1"><persName><forename type="first">Malgorzata</forename><surname>Mochol</surname></persName><email>mochol@inf.fu-berlin.de</email><affiliation>Freie Universität Berlin, Königin-Luise-Str. 24-26, D-14195, Berlin, Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">Anja</forename><surname>Jentzsch</surname></persName><email>mail@anjajentzsch.de</email><affiliation>Freie Universität Berlin, Königin-Luise-Str. 24-26, D-14195, Berlin, Germany</affiliation></author></analytic><monogr><title level="m">Knowledge Engineering: Practice and Patterns</title><title level="m" type="sub">16th International Conference, EKAW 2008, Acitrezza, Italy, September 29 - October 2, 2008. Proceedings</title><idno type="pISBN">978-3-540-87695-3</idno><idno type="eISBN">978-3-540-87696-0</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/978-3-540-87696-0</idno><idno type="book-ID">978-3-540-87696-0</idno><idno type="book-title-ID">182732</idno><idno type="book-sequence-number">5268</idno><idno type="book-volume-number">5268</idno><idno type="book-chapter-count">34</idno><editor><persName><forename type="first">Aldo</forename><surname>Gangemi</surname></persName></editor><editor><persName><forename type="first">Jérôme</forename><surname>Euzenat</surname></persName></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2008"></date><biblScope unit="volume">5268</biblScope><biblScope unit="page" from="109">109</biblScope><biblScope unit="page" to="119">119</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><biblScope><date>2008</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series><series><title level="s">Lecture Notes in Artificial Intelligence</title><editor><persName><forename type="first">Jaime</forename><forename type="first">G.</forename><surname>Carbonell</surname></persName></editor><editor><persName><forename type="first">Jörg</forename><surname>Siekmann</surname></persName></editor><editor><persName><forename type="first">Aldo</forename><surname>Gangemi</surname></persName></editor><editor><persName><forename type="first">Jérôme</forename><surname>Euzenat</surname></persName></editor><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><biblScope unit="seriesId">1244</biblScope></series><idno type="istex">29223482425926115F5F2D65F753CC03B5368D97</idno><idno type="DOI">10.1007/978-3-540-87696-0_12</idno><idno type="ChapterID">12</idno><idno type="ChapterID">Chap12</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2008</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: The central problems w.r.t. interoperability and data integration issues in the Semantic Web are schema and ontology matching approaches. Today it takes an expert to determine the best algorithm and a decision can usually be made only after experimentation, so as both the necessary scaling and off-the-shelf use of matching algorithms are not possible. To tackle these issues, we present a rule-based evaluation method in which the best algorithms are determined semi-automatically and the selection performs prior to the execution of an algorithm.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I21017</label><label>I18040</label><label>I18032</label><label>I2301X</label><label>I13022</label><item><term>Computer Science</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Information Systems Applications (incl.Internet)</term></item><item><term>Information Storage and Retrieval</term></item><item><term>Computer Appl. in Administrative Data Processing</term></item><item><term>Computer Communication Networks</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2008">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/29223482425926115F5F2D65F753CC03B5368D97/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SubSeries><SubSeriesInfo><SubSeriesID>1244</SubSeriesID><SubSeriesPrintISSN>0302-9743</SubSeriesPrintISSN><SubSeriesElectronicISSN>1611-3349</SubSeriesElectronicISSN><SubSeriesTitle Language="En">Lecture Notes in Artificial Intelligence</SubSeriesTitle></SubSeriesInfo><SubSeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Jaime</GivenName><GivenName>G.</GivenName><FamilyName>Carbonell</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jörg</GivenName><FamilyName>Siekmann</FamilyName></EditorName></Editor></EditorGroup></SubSeriesHeader></SubSeries><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" OutputMedium="All" TocLevels="0"><BookID>978-3-540-87696-0</BookID><BookTitle>Knowledge Engineering: Practice and Patterns</BookTitle><BookSubTitle>16th International Conference, EKAW 2008, Acitrezza, Italy, September 29 - October 2, 2008. Proceedings</BookSubTitle><BookVolumeNumber>5268</BookVolumeNumber><BookSequenceNumber>5268</BookSequenceNumber><BookDOI>10.1007/978-3-540-87696-0</BookDOI><BookTitleID>182732</BookTitleID><BookPrintISBN>978-3-540-87695-3</BookPrintISBN><BookElectronicISBN>978-3-540-87696-0</BookElectronicISBN><BookChapterCount>34</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2008</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I21017" Priority="1" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I18040" Priority="2" Type="Secondary">Information Systems Applications (incl.Internet)</BookSubject><BookSubject Code="I18032" Priority="3" Type="Secondary">Information Storage and Retrieval</BookSubject><BookSubject Code="I2301X" Priority="4" Type="Secondary">Computer Appl. in Administrative Data Processing</BookSubject><BookSubject Code="I13022" Priority="5" Type="Secondary">Computer Communication Networks</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Aldo</GivenName><FamilyName>Gangemi</FamilyName></EditorName><Contact><Email>aldo.gangemi@istc.cnr.it</Email></Contact></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jérôme</GivenName><FamilyName>Euzenat</FamilyName></EditorName><Contact><Email>Jerome.Euzenat@inrialpes.fr</Email></Contact></Editor></EditorGroup></BookHeader><Part ID="Part3"><PartInfo TocLevels="0"><PartID>3</PartID><PartSequenceNumber>3</PartSequenceNumber><PartTitle>Matching Ontologies and Data Integration</PartTitle><PartChapterCount>4</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Knowledge Engineering: Practice and Patterns</BookTitle></PartContext></PartInfo><Chapter ID="Chap12" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>12</ChapterID><ChapterDOI>10.1007/978-3-540-87696-0_12</ChapterDOI><ChapterSequenceNumber>12</ChapterSequenceNumber><ChapterTitle Language="En">Towards a Rule-Based Matcher Selection</ChapterTitle><ChapterFirstPage>109</ChapterFirstPage><ChapterLastPage>119</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2008</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>3</PartID><BookID>978-3-540-87696-0</BookID><BookTitle>Knowledge Engineering: Practice and Patterns</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Malgorzata</GivenName><FamilyName>Mochol</FamilyName></AuthorName><Contact><Email>mochol@inf.fu-berlin.de</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Anja</GivenName><FamilyName>Jentzsch</FamilyName></AuthorName><Contact><Email>mail@anjajentzsch.de</Email></Contact></Author><Affiliation ID="Aff1"><OrgName>Freie Universität Berlin</OrgName><OrgAddress><Street>Königin-Luise-Str. 24-26</Street><Postcode>D-14195</Postcode><City>Berlin</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>The central problems w.r.t. interoperability and data integration issues in the Semantic Web are schema and ontology matching approaches. Today it takes an expert to determine the best algorithm and a decision can usually be made only after experimentation, so as both the necessary scaling and off-the-shelf use of matching algorithms are not possible. To tackle these issues, we present a rule-based evaluation method in which the best algorithms are determined semi-automatically and the selection performs prior to the execution of an algorithm.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Towards a Rule-Based Matcher Selection</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Towards a Rule-Based Matcher Selection</title></titleInfo><name type="personal"><namePart type="given">Malgorzata</namePart><namePart type="family">Mochol</namePart><affiliation>Freie Universität Berlin, Königin-Luise-Str. 24-26, D-14195, Berlin, Germany</affiliation><affiliation>E-mail: mochol@inf.fu-berlin.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Anja</namePart><namePart type="family">Jentzsch</namePart><affiliation>Freie Universität Berlin, Königin-Luise-Str. 24-26, D-14195, Berlin, Germany</affiliation><affiliation>E-mail: mail@anjajentzsch.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2008</dateIssued><copyrightDate encoding="w3cdtf">2008</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: The central problems w.r.t. interoperability and data integration issues in the Semantic Web are schema and ontology matching approaches. Today it takes an expert to determine the best algorithm and a decision can usually be made only after experimentation, so as both the necessary scaling and off-the-shelf use of matching algorithms are not possible. To tackle these issues, we present a rule-based evaluation method in which the best algorithms are determined semi-automatically and the selection performs prior to the execution of an algorithm.</abstract><relatedItem type="host"><titleInfo><title>Knowledge Engineering: Practice and Patterns</title><subTitle>16th International Conference, EKAW 2008, Acitrezza, Italy, September 29 - October 2, 2008. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Aldo</namePart><namePart type="family">Gangemi</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jérôme</namePart><namePart type="family">Euzenat</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2008</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I18040">Information Systems Applications (incl.Internet)</topic><topic authority="SpringerSubjectCodes" authorityURI="I18032">Information Storage and Retrieval</topic><topic authority="SpringerSubjectCodes" authorityURI="I2301X">Computer Appl. in Administrative Data Processing</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic></subject><identifier type="DOI">10.1007/978-3-540-87696-0</identifier><identifier type="ISBN">978-3-540-87695-3</identifier><identifier type="eISBN">978-3-540-87696-0</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">182732</identifier><identifier type="BookID">978-3-540-87696-0</identifier><identifier type="BookChapterCount">34</identifier><identifier type="BookVolumeNumber">5268</identifier><identifier type="BookSequenceNumber">5268</identifier><identifier type="PartChapterCount">4</identifier><part><date>2008</date><detail type="part"><title>Matching Ontologies and Data Integration</title></detail><detail type="volume"><number>5268</number><caption>vol.</caption></detail><extent unit="pages"><start>109</start><end>119</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2008</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><originInfo><copyrightDate encoding="w3cdtf">2008</copyrightDate><issuance>serial</issuance></originInfo><relatedItem type="constituent"><titleInfo><title>Lecture Notes in Artificial Intelligence</title></titleInfo><name type="personal"><namePart type="given">Jaime</namePart><namePart type="given">G.</namePart><namePart type="family">Carbonell</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jörg</namePart><namePart type="family">Siekmann</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Aldo</namePart><namePart type="family">Gangemi</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jérôme</namePart><namePart type="family">Euzenat</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="sub-series"></genre><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SubSeriesID">1244</identifier></relatedItem><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2008</recordOrigin></recordInfo></relatedItem><identifier type="istex">29223482425926115F5F2D65F753CC03B5368D97</identifier><identifier type="DOI">10.1007/978-3-540-87696-0_12</identifier><identifier type="ChapterID">12</identifier><identifier type="ChapterID">Chap12</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2008</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2008</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Agronomie/explor/SisAgriV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000218 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000218 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Agronomie
|area= SisAgriV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:29223482425926115F5F2D65F753CC03B5368D97
|texte= Towards a Rule-Based Matcher Selection
}}
| This area was generated with Dilib version V0.6.28. |  |