Polynomial-time metrics for attributed trees

We address the problem of comparing attributed trees and propose four novel distance measures centered around the notion of a maximal similarity common subtree. The proposed measures are general and defined on trees endowed with either symbolic or continuous-valued attributes and can be applied to r...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 27(2005), 7 vom: 01. Juli, Seite 1087-99
1. Verfasser: Torsello, Andrea (VerfasserIn)
Weitere Verfasser: Hidović-Rowe, Dzena, Pelillo, Marcello
Format: Aufsatz
Sprache:English
Veröffentlicht: 2005
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Comparative Study Evaluation Study Journal Article Research Support, Non-U.S. Gov't
LEADER 01000naa a22002652 4500
001 NLM156508338
003 DE-627
005 20231223074311.0
007 tu
008 231223s2005 xx ||||| 00| ||eng c
028 5 2 |a pubmed24n0522.xml 
035 |a (DE-627)NLM156508338 
035 |a (NLM)16013756 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Torsello, Andrea  |e verfasserin  |4 aut 
245 1 0 |a Polynomial-time metrics for attributed trees 
264 1 |c 2005 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 11.08.2005 
500 |a Date Revised 10.12.2019 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a We address the problem of comparing attributed trees and propose four novel distance measures centered around the notion of a maximal similarity common subtree. The proposed measures are general and defined on trees endowed with either symbolic or continuous-valued attributes and can be applied to rooted as well as unrooted trees. We prove that our measures satisfy the metric constraints and provide a polynomial-time algorithm to compute them. This is a remarkable and attractive property, since the computation of traditional edit-distance-based metrics is, in general, NP-complete, at least in the unordered case. We experimentally validate the usefulness of our metrics on shape matching tasks and compare them with (an approximation of) edit-distance 
650 4 |a Comparative Study 
650 4 |a Evaluation Study 
650 4 |a Journal Article 
650 4 |a Research Support, Non-U.S. Gov't 
700 1 |a Hidović-Rowe, Dzena  |e verfasserin  |4 aut 
700 1 |a Pelillo, Marcello  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 27(2005), 7 vom: 01. Juli, Seite 1087-99  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:27  |g year:2005  |g number:7  |g day:01  |g month:07  |g pages:1087-99 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 27  |j 2005  |e 7  |b 01  |c 07  |h 1087-99