Recent approaches of graph comparison consider graphs as sets of paths [6, 5]. Kernels on graphs are then computed from kernels on paths. A common strategy for graph retrieval is ...
The Universum data, defined as a collection of "nonexamples" that do not belong to any class of interest, have been shown to encode some prior knowledge by representing ...
Dan Zhang, Jingdong Wang, Fei Wang, Changshui Zhan...
It has been observed that precision increases with collection size. One explanation could be that the redundancy of information increases, making it easier to find multiple docum...