Supervised clustering is the problem of training a clustering algorithm to produce desirable clusterings: given sets of items and complete clusterings over these sets, we learn ho...
In this paper we propose a method for predicting the ranking position of a Web page. Assuming a set of successive past top-k rankings, we study the evolution of Web pages in terms...
Michalis Vazirgiannis, Dimitris Drosos, Pierre Sen...
More and more documents on the World Wide Web are based on templates. On a technical level this causes those documents to have a quite similar source code and DOM tree structure. G...
We propose an original automatic alignment of definitions taken from different dictionaries that could be associated to the same concept although they may have different labels. Th...
Laura Diosan, Alexandrina Rogozan, Jean-Pierre P&e...
This paper presents the first Rademacher complexity-based error bounds for noni.i.d. settings, a generalization of similar existing bounds derived for the i.i.d. case. Our bounds ...