Detecting code clones has many software engineering applications. Existing approaches
either do not scale to large code bases or are not robust against minor code modifications. In …

Graph data have become ubiquitous and manipulating them based on similarity is essential
for many applications. Graph edit distance is one of the most widely accepted measures to …

In the last few years we have observed a proliferation of approaches for clustering XML
documents and schemas based on their structure and content. The presence of such a huge …

Several techniques have been developed for identifying similar code fragments in programs.
These similar fragments, referred to as code clones, can be used to identify redundant code …

We consider the classical tree edit distance between ordered labeled trees, which is defined
as the minimum-cost sequence of node edit operations that transform one tree into another …

We consider the classical tree edit distance between ordered labelled trees, which is
defined as the minimum-cost sequence of node edit operations that transform one tree into …

The tree structure is one of the most powerful structures for data organization. An efficient
learning framework for transforming tree-structured data into vectorial representations is …

Graphs are popular models for representing complex structure data and similarity search for
graphs has become a fundamental research problem. Many techniques have been …

When integrating data from autonomous sources, exact matches of data items that represent
the same real-world object often fail due to a lack of common keys. Yet in many cases …

Improving the precision of information retrieval has been a challenging issue on Chinese
Web. As exemplified by Chinese recipes on the Web, it is not easy/natural for people to use …