Extended sub tree: a new similarity function for tree struc
Although several distance or similarity functions for trees have been introduced, their performance is not always satisfactory in many applications, ranging from document clustering to natural language processing. This research proposes a new similarity function for trees, namely Extended Subtree (EST),.
where a new subtree mapping is proposed. EST generalizes the edit base distances by providing new rules for subtree mapping. Further, the new approach seeks to resolve the problems and limitations of previous approaches. Extensive evaluation frameworks are developed to evaluate the performance of the new approach against previous proposals.
http://kaashivinfotech.com/
http://inplanttrainingchennai.com/
http://inplanttraining-in-chennai.com/
http://internshipinchennai.in/
http://inplant-training.org/
http://kernelmind.com/
http://inplanttraining-in-chennai.com/
http://inplanttrainingchennai.com/
Contact Us
91 98406 78906, 91 90037 18877
kaashiv.info@gmail.com
www.kaashivinfotech.com
Shivanantha Building (Second building to Ayyappan Temple),
X41, 5th Floor, 2nd avenue,
Anna Nagar,Chennai-40.
★
★
★
★
★
200 views • 9 slides
