Kaikki kirjat 25 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

Graph Isomorphism Algorithms - Daniel Baggenstos

englanti
2008-01-01
68,63 € 91,50 €

-25% koodilla BOOKS

Toimittajalla varastossa

Toimitus 10-16 arkipäivässä

30 päivän palautusoikeus

This thesis introduces similarity measures to be used by comparing XML workflows and RDF or OWL structures. These structures are accessed and converted into a generic graph representation. Two graphs are compared by a measure to conclude in a single value indicating the similarity of the graphs. Similarity is calculated by two different similarity measures, the graph isomorphism measure and the subgraph iso ... Täydellinen kuvaus

Saatat myös pitää

Kuvaus

This thesis introduces similarity measures to be used by comparing XML workflows and RDF or OWL structures. These structures are accessed and converted into a generic graph representation. Two graphs are compared by a measure to conclude in a single value indicating the similarity of the graphs. Similarity is calculated by two different similarity measures, the graph isomorphism measure and the subgraph isomorphism measure. The graph isomorphism measure detects structurally identical graphs and calculates the similarity upon the nearness of the node labels. Structurally different graphs are compared by the subgraph isomorphism measure to find matching parts. The size and the label similarity of the nodes of a matched part contribute to its similarity based upon the compared graphs. The highest similarity value of all parts is defined to be the similarity of the two graphs. Performance improvements were developed and implemented which led to a decreasing runtime. Further improvements were analyzed and proposed to be implemented at a later date.

Lisätietoja

Kirjoittaja Daniel Baggenstos
Julkaisija KS Omniscriptum Publishing
Julkaisuvuosi 2008
Kannen tyyppi Pehmeäkantinen
EAN 9783836469456
Kirjoita oma arvostelusi
Arvostelet: Graph Isomorphism Algorithms
Arvostelusi:

Goodreads-arvostelut

68,63 € 91,50 €