One crucial issue in genetic programming (GP) is how to acquire promising building blocks efficiently. In this paper, we propose a GP method (called GPTM, GP with Tree Mining) which protects the subtrees repeatedly appearing in superior individuals. Currently GPTM utilizes a FREQT-like efficient data mining method to find such subtrees. GPTM is evaluated by three benchmark problems, and the res...

This paper proposes a dependency parsing method that uses bilingual constraints to improve the accuracy of parsing bilingual texts (bitexts). In our method, a targetside tree fragment that corresponds to a source-side tree fragment is identified via word alignment and mapping rules that are automatically learned. Then it is verified by checking the subtree list that is collected from large scal...

This study proposes a text summarization model that simultaneously performs sentence extraction and compression. We translate the text summarization task into a problem of extracting a set of dependency subtrees in the document cluster. We also encode obligatory case constraints as must-link dependency constraints in order to guarantee the readability of the generated summary. In order to handl...

We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large document tree, e.g., DBLP with 26M nodes, using the canonical tree edit distance as a similarity measure between subtrees. Evaluating the tree edit distance for large XML trees is difficult: the best known algorithms have cubic runti...

background: two main muscles studied in the hand for evaluation of median nerve injuries are opponens pollicis (op) and abductor pollicis brevis (apb). however, riché-cannieu communicating branch (rccb) may limit the use of these muscles in electrodiagnosis. this condition is confusing in the case of median nerve injuries. this study was conducted to evaluate the prevalence of rccb.   methods: ...

A conjecture of Luo, Tian and Wu (2022) says that for every positive integer k finite tree T with bipartition X Y (denote t=max⁡{|X|,|Y|}), k-connected bipartite graph G δ(G)≥k+t contains a subtree T′≅T such κ(G−V(T′))≥k. In this paper, we confirm caterpillars when k=3 spiders k≤3.

Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 22 June 2020Accepted: 29 October 2021Published online: 27 January 2022Keywordsmaximum agreement subtree, random tree, stochastic fragmentationAMS Subject Headings60C05, 05C80Publication DataISSN (print): 0895-4801ISSN (online): 1095-7146Publisher: Society for Industrial a...