Matching Ontologies: Achieving Semantic Interoperability by matching SHIQ Ontologies,Used

Matching Ontologies: Achieving Semantic Interoperability by matching SHIQ Ontologies,Used

In Stock
SKU: DADAX3847310984
Brand: LAP Lambert Academic Publishing
Condition: New
Regular price$78.48
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

This monograph discusses the structural matching of description logic ontologies. Our belief is that structural matches of ontologies hold some deeper information about the similarities between different ontologies than a mere syntactic match. Ontologies are parsed into attributed trees where nodes represent the concepts and edges represent the relationship between concepts. T h e match between any two nodes is calculated by traversing the derived trees in an efficient algorithm that limit the number of comparisons to be performed by eliminating unnecessary comparison in order to maintain a polynomial running time. For each pair of node, an aggregated weight that defines the level of the match is evaluated by using the level of similarity of their parents and those of their successors. The obtained weights are finally used to predict the similarities between concepts and consequently, that of ontologies.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed