Weighted Pseudo-distances for Categorization in Semantic Hierarchies

Joslyn, Cliff; Bruno, William

doi:10.1007/11524564_26

Cited by 6 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These frameworks are based on the premise that the stronger the semantic relationship of two objects, the closer they will be in the network representation. However, as it has been discussed by several authors, issues arise when attempting to apply distance‐based schemes for measuring object similarities in certain classes of networks where links may not represent uniform distances (Jiang & Conrath, ; Joslyn & Bruno, ; Resnik, ). In addition, some authors have argued against the suitability of relying on distance metrics when computing similarity or relevance.…”

Section: Related Workmentioning

confidence: 99%

A study of relevance propagation in large topic ontologies

Xamena

Brignole

Maguitman

2013

J Am Soc Inf Sci Tec

View full text Add to dashboard Cite

Topic ontologies or web directories consist of large collections of links to websites, arranged by topic in different categories. The structure of these ontologies is typically not flat because there are hierarchical and nonhierarchical relationships among topics. As a consequence, websites classified under a certain topic may be relevant to other topics. Although some of these relevance relations are explicit, most of them must be discovered by an analysis of the structure of the ontologies. This article proposes a family of models of relevance propagation in topic ontologies. An efficient computational framework is described and used to compute nine different models for a portion of the Open Directory Project graph consisting of more than half a million nodes and approximately 1.5 million edges of different types. After performing a quantitative analysis, a user study was carried out to compare the most promising models. It was found that some general difficulties rule out the possibility of defining flawless models of relevance propagation that only take into account structural aspects of an ontology. However, there is a clear indication that including transitive relations induced by the nonhierarchical components of the ontology results in relevance propagation models that are superior to more basic approaches.

show abstract

Section: Related Workmentioning

confidence: 99%

A study of relevance propagation in large topic ontologies

Xamena

Brignole

Maguitman

2013

J Am Soc Inf Sci Tec

View full text Add to dashboard Cite

show abstract

“…Our research program [7,8,9,10,11,12,17,18] is built on the representation of taxonomic ontologies as ordered sets. This technology encompasses not only existing ontology analysis mechanisms such as semantic similarities [2,13], but also provides methods for ontology integration which are especially appropriate for the open-world modeling of semantic web services and SSWAP.…”

Section: Order Theoretical Representations Of Distributed Semantic Himentioning

confidence: 99%

Knowledge Integration in OpenWorlds: Utilizing the Mathematics of Hierarchical Structure

Joslyn

Verspoor

Gessler

2007

International Conference on Semantic Computing (ICSC 2007)

Self Cite

View full text Add to dashboard Cite

Semantic web services present a new challenge in distributed knowledge integration. Under the Simple SemanticWeb Architecture and Protocol (SSWAP, http://sswap.info), web resources publish information about their data and services in terms of OWL ontologies. With semantic tagging, the output of one service can drive the input of another, presenting the alluring prospect of machines autonomously assessing the suitability of web resources for distributed workflows. Ontological reasoning under OWL greatly expands the potential for semantic web service interoperability by guaranteeing the compatibility of resources using such techniques as inferencing, typing, and class subsumption. Formal methods for managing such structures are urgently needed. Recent advances in the mathematics of hierarchies can formalize the construction of synthetic hierarchies from unstructured information, identifying mutual subsumption architectures. Here we examine the problem space and describe the promise of mathematical order theory (formal concept analysis and lattice metrics) for advancing knowledge integration in open worlds.

show abstract

“…We need a formal grounding for knowledge integration over distributed semantic hierarchies, and thus turn to the mathematics of hierarchy, that is order theory, or the theory of lattices and ordered sets (posets) [1,3]. Our research program [7,8,9,10,11,12,17,18] is built on the representation of taxonomic ontologies as ordered sets. This technology encompasses not only existing ontology analysis mechanisms such as semantic similarities [2,13], but also provides methods for ontology integration which are especially appropriate for the open-world modeling of semantic web services and SSWAP.…”

Section: Order Theoretical Representations Of Distributed Semantic Himentioning

confidence: 99%

Knowledge Integration in OpenWorlds: Utilizing the Mathematics of Hierarchical Structure

Joslyn

Verspoor

Gessler

2007

International Conference on Semantic Computing (ICSC 2007)

Self Cite

View full text Add to dashboard Cite

Semantic web services present a new challenge in distributed knowledge integration. Under the Simple Semantic Web Architecture and Protocol (SSWAP, http://sswap.info), web resources publish information about their data and services in terms of OWL ontologies. With semantic tagging, the output of one service can drive the input of another, presenting the alluring prospect of machines autonomously assessing the suitability of web resources for distributed workflows. Ontological reasoning under OWL greatly expands the potential for semantic web service interoperability by guaranteeing the compatibility of resources using such techniques as inferencing, typing, and class subsumption. Formal methods for managing such structures are urgently needed. Recent advances in the mathematics of hierarchies can formalize the construction of synthetic hierarchies from unstructured information, identifying mutual subsumption architectures. Here we examine the problem space and describe the promise of mathematical order theory (formal concept analysis and lattice metrics) for advancing knowledge integration in open worlds.

show abstract

Weighted Pseudo-distances for Categorization in Semantic Hierarchies

Cited by 6 publications

References 11 publications

A study of relevance propagation in large topic ontologies

A study of relevance propagation in large topic ontologies

Knowledge Integration in OpenWorlds: Utilizing the Mathematics of Hierarchical Structure

Knowledge Integration in OpenWorlds: Utilizing the Mathematics of Hierarchical Structure

Contact Info

Product

Resources

About