Patents by Inventor Domenico DATO

Domenico DATO has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Method to rank documents by a computer, using additive ensembles of regression trees and cache optimisation, and search engine using such a method
    Patent number: 11106685
    Abstract: The present invention concerns a novel method to efficiently score documents (texts, images, audios, videos, and any other information file) by using a machine-learned ranking function modeled by an additive ensemble of regression trees. A main contribution is a new representation of the tree ensemble based on bitvectors, where the tree traversal, aimed to detect the leaves that contribute to the final scoring of a document, is performed through efficient logical bitwise operations. In addition, the traversal is not performed one tree after another, as one would expect, but it is interleaved, feature by feature, over the whole tree ensemble. Tests conducted on publicly available LtR datasets confirm unprecedented speedups (up to 6.5×) over the best state-of-the-art methods.
    Type: Grant
    Filed: June 17, 2015
    Date of Patent: August 31, 2021
    Assignee: Istella S.p.A.
    Inventors: Domenico Dato, Claudio Lucchese, Franco Maria Nardini, Salvatore Orlando, Raffaele Perego, Nicola Tonellotto, Rossano Venturini
  • A METHOD TO RANK DOCUMENTS BY A COMPUTER, USING ADDITIVE ENSEMBLES OF REGRESSION TREES AND CACHE OPTIMISATION, AND SEARCH ENGINE USING SUCH A METHOD
    Publication number: 20180217991
    Abstract: The present invention concerns a novel method to efficiently score documents (texts, images, audios, videos, and any other information file) by using a machine-learned ranking function modeled by an additive ensemble of regression trees. A main contribution is a new representation of the tree ensemble based on bitvectors, where the tree traversal, aimed to detect the leaves that contribute to the final scoring of a document, is performed through efficient logical bitwise operations. In addition, the traversal is not performed one tree after another, as one would expect, but it is interleaved, feature by feature, over the whole tree ensemble. Tests conducted on publicly available LtR datasets confirm unprecedented speedups (up to 6.5×) over the best state-of-the-art methods.
    Type: Application
    Filed: June 17, 2015
    Publication date: August 2, 2018
    Applicant: Istella S.p.A.
    Inventors: Domenico DATO, Claudio LUCCHESE, Franco Maria NARDINI, Salvatore ORLANDO, Raffaele PEREGO, Nicola TONELLOTTO, Rossano VENTURINI