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
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.
MotivationMotivationLearning RCE Learning RCE NetworksNetworksApproximate Classifications of IndividualsApproximate Classifications of IndividualsExperimentsExperimentsConclusions & OutlookConclusions & Outlook
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
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
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
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
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
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