Presentation is loading. Please wait.

Presentation is loading. Please wait.

April 15, 2004SPIE1 Association in Level 2 Fusion Mieczyslaw M. Kokar Christopher J. Matheus Jerzy A. Letkowski Kenneth Baclawski Paul Kogut.

Similar presentations


Presentation on theme: "April 15, 2004SPIE1 Association in Level 2 Fusion Mieczyslaw M. Kokar Christopher J. Matheus Jerzy A. Letkowski Kenneth Baclawski Paul Kogut."— Presentation transcript:

1 April 15, 2004SPIE1 Association in Level 2 Fusion Mieczyslaw M. Kokar Christopher J. Matheus Jerzy A. Letkowski Kenneth Baclawski Paul Kogut

2 April 15, 2004SPIE2 Overview Data association in Level 1 and Level 2 Ontologies Reasoning process Examples of reasoning about associations Useful OWL constructs Confidence of association Conclusion

3 April 15, 2004SPIE3 Level 1 Data Association Data to object –Measurement to object –Measurement to track Object to object –Track to track –ID to ID Approach –Define a measure of distance (quantitative) –Minimize distance

4 April 15, 2004SPIE4 Level 2 Data Association Problem Data may be text Identification of “the same” individuals – called “co-reference” No quantitative properties of objects Text processing tools used Possibly translated to logic Logic based tools (reasoners or theorem provers) are used for deriving conclusions Why not for data association?

5 April 15, 2004SPIE5 Ontology An explicit specification of a conceptualization: the objects, concepts, and other entities that are assumed to exist in some area of interest and the relationships that hold among them (Genesereth & Nilsson, 1997) Definitions associate the names of entities in the universe of discourse (e.g., classes, relations, functions, or other objects) with human-readable text describing what the names mean, and formal axioms that constrain the interpretation and well-formed use of these terms. A statement of a logical theory. (Gruber) An agent commits to an ontology if its observable actions are consistent with the definitions in the ontology (knowledge level). A common ontology defines the vocabulary with which queries and assertions are exchanged among agents.

6 April 15, 2004SPIE6 An Ontology (in UML)

7 April 15, 2004SPIE7 Identifying Associations in Level 2 Fusion Annotation Ontology OWL Ontology Text Document Query ConsVISor Consistency Checker consistent unknown inconsistent AeroSWARM Ontological Annotator

8 Ontology Fragment in OWL Person 1 1 Leader 1 Organization 1

9 Ontology (cont.)

10 Annotation Osama old Osama old Strossen mature al- Queda terrorist Unknown ACLU non- profit USA

11 April 15, 2004SPIE11 Association Through Reasoning The OWL language specifies names of individuals using a Uniform Resource Identifier (URI). Characteristics of individuals (such as position or velocity) are defined using properties. An OWL property that specifies a characteristic of an individual is called a DatatypeProperty. Relations between individuals are also specified using properties. An OWL property of this kind is called an ObjectProperty. There are two special OWL properties that can be used for explicit data association: sameAs and differentFrom. A whole set of URIs can refer to different individuals by using the AllDifferent construct. OWL properties are binary. OWL properties are many-to-many unless one specifies constraints on the properties.

12 April 15, 2004SPIE12 Use of ConsVISor (a rule-based consistency verification tool) http://vistology.com/consvisor Ground Truth: Two names represent the same individual and the ontology has support for this. Two names represent two different individuals and the ontology has support for this. Hypotheses (statements added to an annotation): The names represent the same individual in the world (expressed in OWL as sameAs) The names represent different individuals in the world (expressed in OWL as differentFrom) ConsVISor’s Decision: ConsVISor can decide that a given annotation (with the added hypothesis) is either “consistent ”or “inconsistent ”.

13 April 15, 2004SPIE13 Association and Consistency Consider a case where ConsVISor returns consistent for both hypotheses. Since it is consistent to believe either that they are the same or that they are different we cannot make any association claims at all (not enough information in the annotations) The converse case in which both hypotheses produce inconsistent results should never occur unless there is an inconsistency in the underlying ontology. The interesting cases occur when one hypothesis is consistent and the other is inconsistent. If the sameAs hypothesis is consistent and the differentFrom inconsistent, they must be co-references. Conversely, if the sameAs hypothesis is inconsistent and the differentFrom hypothesis is consistent, the two references cannot refer to the same individual.

14 Two individuals are the same Two individuals are different         inconsistent consistent Impossible! http://vistology.com/exp/1.owl http://vistology.com/exp/3.owl http://vistology.com/exp/4.owl http://vistology.com/exp/5.owl http://vistology.com/exp/6.owl http://vistology.com/exp/7.owl Ground Truth: Hypothesis:ConsVISor’s Decision:Annotation Example: consistent inconsistent Impossible! inconsistent

15 Reasoning about Associations Osama old Strossen mature al-Queda terrorist ACLU non- profit ConsVISor’s Decision: inconsistent

16 April 15, 2004SPIE16 Useful OWL Constructs FunctionalProperty and InverseFunctionalProperty –If a property is functional then a given individual can be related to at most one other value or individual. –If a property is inverse functional, then an individual or value can be used by at most one individual. –For example, one specifies that a leadership is functional by asserting that ledBy is an instance of FunctionalProperty or that its inverse leaderOf is an instance of InverseFunctionalProperty. If one of these is specified and if two individual names are both known to refer to the leader of the same organization, then those names must represent the same individual. Cardinality constraints. –A cardinality constraint restricts the number of individuals (or values) that a given individual can be related to. –A maxCardinality constraint specifies an upper bound on this number, a minCardinality constraint specifies a lower bound. –A cardinality constraint specifies the exact number. –The maxCardinality and cardinality constraints are especially useful for proving that two individual names refer to the same individual.

17 April 15, 2004SPIE17 Useful OWL Constructs Cont. disjointWith –When two classes are specified to be disjoint, then they cannot have any instances (individuals) in common. complementOf –an extreme form of disjointness oneOf –members of a class must all come from a given list of instances. unionOf –a class is the union of some other classes. subClassOf, equivalentClass subPropertyOf, equivalentProperty domain and range SymmetricProperty and TransitiveProperty

18 April 15, 2004SPIE18 Confidence No notion of uncertainty in OWL (so far) OWL reasoners don’t have any way to deal with uncertainty even if an ontology has an explicit way for incorporating uncertainty into its annotations ConsVISor can provide annotations involved in the determination of an inconsistency (trace) Using an external process it is possible in some cases to combine the uncertainties of the implicated annotations to make statements about the uncertainty associated with an association claim E.g., map ontology/annotation into a Bayesian net Work in progress

19 April 15, 2004SPIE19 Conclusion Showed examples of reasoning about co- reference in annotations (in OWL) –Merge two annotation files –Insert sameAs or differentFrom hypothesis –Use ConsVISor consistency checker –Consistent - plausible –Inconsistency – evidence against OWL becoming a de-facto standard Discussed useful OWL constructs Confidence – work in progress (Bayesian nets) Using ConsVISor in a system for generating and testing association hypotheses – future work


Download ppt "April 15, 2004SPIE1 Association in Level 2 Fusion Mieczyslaw M. Kokar Christopher J. Matheus Jerzy A. Letkowski Kenneth Baclawski Paul Kogut."

Similar presentations


Ads by Google