Top Banner
ReduCE Fanizzi, d'Amato, Esposito ReduCE Fanizzi, d'Amato, Esposito ReduCE: ReduCE: A Reduced Coulomb Energy Network Method A Reduced Coulomb Energy Network Method for Approximate Classification for Approximate Classification Dipartimento di Informatica Dipartimento di Informatica Università degli studi di Bari Università degli studi di Bari Nicola Nicola Fanizzi Fanizzi Claudia Claudia d'Amato d'Amato Floriana Floriana Esposito Esposito
20
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Eswc2009

ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

ReduCE: ReduCE: A Reduced Coulomb Energy Network Method A Reduced Coulomb Energy Network Method

for Approximate Classificationfor Approximate Classification

Dipartimento di InformaticaDipartimento di InformaticaUniversità degli studi di BariUniversità degli studi di Bari

Nicola Nicola FanizziFanizziClaudia Claudia d'Amatod'AmatoFloriana Floriana EspositoEsposito

Page 2: Eswc2009

ESWC 2009ESWC 2009 22ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

Table of ContentsTable of Contents

MotivationMotivationLearning RCE Learning RCE NetworksNetworksApproximate Classifications of IndividualsApproximate Classifications of IndividualsExperimentsExperimentsConclusions & OutlookConclusions & Outlook

Page 3: Eswc2009

ESWC 2009ESWC 2009 33ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

MotivationMotivation

Classic ML techniques for building inductive Classic ML techniques for building inductive classifiers for SW representations classifiers for SW representations explicitexplicit models: new concepts models: new concepts implicitimplicit models: neural networks, support vector models: neural networks, support vector

machines, graphic probabilistic modelsmachines, graphic probabilistic modelsInductive methods for classificationInductive methods for classification

often more often more efficientefficient and and noise-tolerantnoise-tolerant than standard than standard methodsmethods

enables enables approximationapproximationbetter exploitation of the inherently incomplete better exploitation of the inherently incomplete

information in Kbs for specific tasksinformation in Kbs for specific tasks

Page 4: Eswc2009

ESWC 2009ESWC 2009 44ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

Applications of Inductive ModelsApplications of Inductive Models

Approximate instance-checkingApproximate instance-checkingThis can be also exploited forThis can be also exploited for

approximate retrievalapproximate retrievalsubsumptionsubsumption......

It also provides alternative methods for It also provides alternative methods for ontology populationontology population

Ultimately, may be used for completing ontologies Ultimately, may be used for completing ontologies with with probabilisticprobabilistic assertions assertions enabling more sophisticate approaches to dealing with enabling more sophisticate approaches to dealing with

uncertaintyuncertainty

Page 5: Eswc2009

ESWC 2009ESWC 2009 55ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

Learning ProblemLearning Problem

Given a Given a target concepttarget conceptTrainTrain a model (hypothesis) a model (hypothesis) hhQQ using:using:

Set of pre-classified individuals: Set of pre-classified individuals: examplesexamplesA A knowledge baseknowledge base KK as background knowledge as background knowledge

thenthen

Use the learned model to classify all other Use the learned model to classify all other individuals:individuals:Given Given hhQQ and and xx00

Output Output hhQQ((xx00)) and possibly the likelihood of this assertionand possibly the likelihood of this assertion

Page 6: Eswc2009

ESWC 2009ESWC 2009 66ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

Training SetTraining Set

A A limitedlimited number of individuals number of individuals for which the intended classification is knownfor which the intended classification is known

Hypothesis: Hypothesis: the function to be approximatedthe function to be approximated

Page 7: Eswc2009

ESWC 2009ESWC 2009 77ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

The Inductive Model: RCE NetworksThe Inductive Model: RCE Networks

Q ¬Q

λ1 λ2 λ3 λN

x1 x2 xd

categorylayer

acj

pattern(radii)layer wjk

inputlayer

. . .

. . .

Page 8: Eswc2009

ESWC 2009ESWC 2009 88ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

Training the ModelTraining the Model

Page 9: Eswc2009

ESWC 2009ESWC 2009 99ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

RCE Model RCE Model ConstructionConstruction

▪ ▪▪

▪▪

▪▪

▪▪

▪ ▪▪

11 22 33

44 55 66

Page 10: Eswc2009

ESWC 2009ESWC 2009 1010ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

Similarity MeasureSimilarity Measure

Generalization of a pseudo-distance Generalization of a pseudo-distance dd [ESWC2008][ESWC2008]

Page 11: Eswc2009

ESWC 2009ESWC 2009 1111ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

RCE RCE FinalFinal Model Model

Prototypes (examples)Prototypes (examples)

Page 12: Eswc2009

ESWC 2009ESWC 2009 1212ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

((VanillaVanilla) ) ClassificationClassification Procedure Procedure

Page 13: Eswc2009

ESWC 2009ESWC 2009 1313ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

ExtensionsExtensions

generalizing the generalizing the decision-makingdecision-making step: step:

likelihood:likelihood:

Page 14: Eswc2009

ESWC 2009ESWC 2009 1414ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

ExperimentsExperiments

For each ontologyFor each ontology100100 satisfiable query concepts randomly satisfiable query concepts randomly generated by composition (conjunction / disjunction) of generated by composition (conjunction / disjunction) of

(2 through 8) primitive and defined concepts(2 through 8) primitive and defined conceptsEvaluationEvaluation

comparing inductive responses comparing inductive responses to those returned by a standard reasoner (Pellet 2)to those returned by a standard reasoner (Pellet 2)

IndicesIndicesmatch ratematch rate: : identical classificationidentical classificationomission error rateomission error rate: : 0 vs. 0 vs. ±±11commission error ratecommission error rate: : +1 vs. -1 or -1 vs. +1+1 vs. -1 or -1 vs. +1induction rateinduction rate: : ±±1 vs. 01 vs. 0

Several runs: rates averaged according to the Several runs: rates averaged according to the 632+ bootstrap632+ bootstrap procedure procedure

Page 15: Eswc2009

ESWC 2009ESWC 2009 1515ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

Experiments: OntologiesExperiments: Ontologies

Ontologies employed in the experiments:Ontologies employed in the experiments:

Page 16: Eswc2009

ESWC 2009ESWC 2009 1616ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

OutcomesOutcomes

Page 17: Eswc2009

ESWC 2009ESWC 2009 1717ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

Outcomes / 2Outcomes / 2

Page 18: Eswc2009

ESWC 2009ESWC 2009 1818ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

Outcomes / 3Outcomes / 3

Page 19: Eswc2009

ESWC 2009ESWC 2009 1919ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

Conclusions & OutlookConclusions & Outlook

ML method transposed ML method transposed to SeWeb to SeWeb representationsrepresentations

Experiments: Experiments: good performancegood performanceHigh match rateHigh match rateLow induction rateLow induction rateSome omissionsSome omissionsVery limited Very limited

commissionscommissionsLow variance wrt to past Low variance wrt to past

inductive methodsinductive methods

ExtensionsExtensionsforce binary responseforce binary response

Expected to augment Expected to augment induction rateinduction rate

Pre-computation of Pre-computation of prototypical individuals:prototypical individuals:

Medoids from ClusteringMedoids from Clustering

Use likelihood for Use likelihood for rankingrankingadding probabilities to adding probabilities to

assertionsassertions

Page 20: Eswc2009

ESWC 2009ESWC 2009 2020ReduCE Fanizzi, d'Amato, EspositoReduCE Fanizzi, d'Amato, Esposito

Questions ?Questions ?

For offline contacts:For offline contacts:Nicola Nicola FanizziFanizzi [email protected]@di.uniba.itClaudia Claudia d'Amatod'Amato [email protected]@di.uniba.itFloriana Floriana EspositoEsposito [email protected]@di.uniba.it

Other methods / systemsOther methods / systemshttp://lacam.di.uniba.it:8000/~nico/research/ontologymining.html

The EndThe End