In our approach, each fragment in the graph is associated with a hidden structure, which means that we cannot reduce it to a labelling task.
furthermore, we use averaged weights (Collins, 2002;freund and Schapire, 1999) in Algorithm 1.