Mehryar Mohri


Ontology type: schema:Person     


Person Info

NAME

Mehryar

SURNAME

Mohri

Publications in SciGraph latest 50 shown

  • 2019-01 Relative deviation learning bounds and generalization with unbounded loss functions in ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE
  • 2017-01 Generalization bounds for non-stationary mixing processes in MACHINE LEARNING
  • 2016 Learning with Rejection in ALGORITHMIC LEARNING THEORY
  • 2016 Structural Online Learning in ALGORITHMIC LEARNING THEORY
  • 2015 On the Rademacher Complexity of Weighted Automata in ALGORITHMIC LEARNING THEORY
  • 2015 On the Disambiguation of Weighted Automata in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2015 Learning with Deep Cascades in ALGORITHMIC LEARNING THEORY
  • 2015 Learning Weighted Automata in ALGEBRAIC INFORMATICS
  • 2014 Generalization Bounds for Time Series Prediction with Non-stationary Processes in ALGORITHMIC LEARNING THEORY
  • 2012 New Analysis and Algorithm for Learning with Drifting Distributions in ALGORITHMIC LEARNING THEORY
  • 2012 Ensemble Nyström in ENSEMBLE MACHINE LEARNING
  • 2012 A Disambiguation Algorithm for Finite Automata and Functional Transducers in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2011 Domain Adaptation in Regression in ALGORITHMIC LEARNING THEORY
  • 2011 Large-Scale Training of SVMs with Automata Kernels in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2010-09 Preference-based learning to rank in MACHINE LEARNING
  • 2009 Weighted Automata Algorithms in HANDBOOK OF WEIGHTED AUTOMATA
  • 2008 3-Way Composition of Weighted Finite-State Transducers in IMPLEMENTATION AND APPLICATIONS OF AUTOMATA
  • 2008 Sample Selection Bias Correction Theory in ALGORITHMIC LEARNING THEORY
  • 2008 Speech Recognition with Weighted Finite-State Transducers in SPRINGER HANDBOOK OF SPEECH PROCESSING
  • 2008 General Algorithms for Testing the Ambiguity of Finite Automata in DEVELOPMENTS IN LANGUAGE THEORY
  • 2008 A Machine Learning Framework for Spoken-Dialog Classification in SPRINGER HANDBOOK OF SPEECH PROCESSING
  • 2007 Learning Languages with Rational Kernels in LEARNING THEORY
  • 2007 Factor Automata of Automata and Applications in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2007 An Alternative Ranking Problem for Search Engines in EXPERIMENTAL ALGORITHMS
  • 2007 OpenFst: A General and Efficient Weighted Finite-State Transducer Library in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2006 Efficient Computation of the Relative Entropy of Probabilistic Automata in LATIN 2006: THEORETICAL INFORMATICS
  • 2006 Learning Linearly Separable Languages in ALGORITHMIC LEARNING THEORY
  • 2006 On the Computation of Some Standard Distances Between Probabilistic Automata in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2006 A Unified Construction of the Glushkov, Follow, and Antimirov Automata in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006
  • 2005-09 Moment Kernels for Regular Distributions in MACHINE LEARNING
  • 2005-06-29 A rational design for a weighted finite-state transducer library in AUTOMATA IMPLEMENTATION
  • 2005 A General Weighted Grammar Library in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2005 Margin-Based Ranking Meets Boosting in the Middle in LEARNING THEORY
  • 2005 Multi-armed Bandit Algorithms and Empirical Evaluation in MACHINE LEARNING: ECML 2005
  • 2004 Weighted Finite-State Transducer Algorithms. An Overview in FORMAL LANGUAGES AND APPLICATIONS
  • 2003-06-24 Edit-Distance of Weighted Automata in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2003-06-24 p-Subsequentiable Transducers in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2003-06-24 An Efficient Pre-determinization Algorithm in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2003 Learning from Uncertain Data in LEARNING THEORY AND KERNEL MACHINES
  • 2003 Positive Definite Rational Kernels in LEARNING THEORY AND KERNEL MACHINES
  • 2001-09-20 Generic ε-Removal Algorithm for Weighted Automata in IMPLEMENTATION AND APPLICATION OF AUTOMATA
  • 2001 Weighted Grammar Tools: The GRM Library in ROBUSTNESS IN LANGUAGE AND SPEECH TECHNOLOGY
  • 2001 Regular Approximation of Context-Free Grammars through Transformation in ROBUSTNESS IN LANGUAGE AND SPEECH TECHNOLOGY
  • 2000-05 Context-Free Recognition with Weighted Automata in GRAMMARS
  • 1995 Matching patterns of an automaton in COMBINATORIAL PATTERN MATCHING
  • 1994 Minimization of sequential transducers in COMBINATORIAL PATTERN MATCHING
  • JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
          {
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.137628.9", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.7645.0", 
            "type": "Organization"
          }
        ], 
        "familyName": "Mohri", 
        "givenName": "Mehryar", 
        "id": "sg:person.014747403275.19", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014747403275.19"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:58", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1734.json", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.014747403275.19'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.014747403275.19'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.014747403275.19'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.014747403275.19'


     




    Preview window. Press ESC to close (or click here)


    ...