Stéphane Lallich


Ontology type: schema:Person     


Person Info

NAME

Stéphane

SURNAME

Lallich

Publications in SciGraph latest 50 shown

  • 2018-07-08 MaxMin Linear Initialization for Fuzzy C-Means in MACHINE LEARNING AND DATA MINING IN PATTERN RECOGNITION
  • 2018 A Visual Quality Index for Fuzzy C-Means in ARTIFICIAL INTELLIGENCE APPLICATIONS AND INNOVATIONS
  • 2016-09 ClusPath: a temporal-driven clustering to infer typical evolution paths in DATA MINING AND KNOWLEDGE DISCOVERY
  • 2015-12 Guest editor’s introduction: special issue on quality issues, measures of interestingness and evaluation of data mining models in JOURNAL OF INTELLIGENT INFORMATION SYSTEMS
  • 2015-02 Classifying many-class high-dimensional fingerprint datasets using random forest of oblique decision trees in VIETNAM JOURNAL OF COMPUTER SCIENCE
  • 2015 Warehousing Complex Archaeological Objects in MODELING AND USING CONTEXT
  • 2013-06 Unsupervised feature construction for improving data representation and semantics in JOURNAL OF INTELLIGENT INFORMATION SYSTEMS
  • 2012-12 The use of regional platforms for managing electronic health records for the production of regional public health indicators in France in BMC MEDICAL INFORMATICS AND DECISION MAKING
  • 2012 Formal Framework for the Study of Algorithmic Properties of Objective Interestingness Measures in DATA MINING: FOUNDATIONS AND INTELLIGENT PARADIGMS
  • 2011 Mining Classification Rules without Support: an Anti-monotone Property of Jaccard Measure in DISCOVERY SCIENCE
  • 2010 A Robustness Measure of Association Rules in MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES
  • 2010 Classifying Very-High-Dimensional Data with Random Forests of Oblique Decision Trees in ADVANCES IN KNOWLEDGE DISCOVERY AND MANAGEMENT
  • 2009-10-15 Mining Interesting Rules Without Support Requirement: A General Universal Existential Upward Closure Property in DATA MINING
  • 2009 On Optimal Rule Mining: A Framework and a Necessary and Sufficient Condition of Antimonotonicity in ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING
  • 2009 A Hybrid Approach of Boosting Against Noisy Data in MINING COMPLEX DATA
  • 2008 On the behavior of the generalizations of the intensity of implication: A data-driven comparative study in STATISTICAL IMPLICATIVE ANALYSIS
  • 2008 Maps Ensemble for Semi-Supervised Learning of Large High Dimensional Datasets in FOUNDATIONS OF INTELLIGENT SYSTEMS
  • 2008 A Comparison of Different Off-Centered Entropies to Deal with Class Imbalance for Decision Trees in ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING
  • 2007-09 A Probabilistic Framework Towards the Parameterization of Association Rule Interestingness Measures in METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY
  • 2007 Association Rule Interestingness Measures: Experimental and Theoretical Studies in QUALITY MEASURES IN DATA MINING
  • 2007 Association Rule Interestingness: Measure and Statistical Validation in QUALITY MEASURES IN DATA MINING
  • 2006 Statistical inference and data mining: false discoveries control in COMPSTAT 2006 - PROCEEDINGS IN COMPUTATIONAL STATISTICS
  • 2004 Outlier Handling in the Neighbourhood-Based Learning of a Continuous Class in DISCOVERY SCIENCE
  • 2004 A Clustering of Interestingness Measures in DISCOVERY SCIENCE
  • 2004-01 Identifying and Handling Mislabelled Instances in JOURNAL OF INTELLIGENT INFORMATION SYSTEMS
  • 2002-09-18 Separability Index in Supervised Learning in PRINCIPLES OF DATA MINING AND KNOWLEDGE DISCOVERY
  • 2002 Improving Classification by Removing or Relabeling Mislabeled Instances in FOUNDATIONS OF INTELLIGENT SYSTEMS
  • Affiliations

    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.72960.3a", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Lallich", 
        "givenName": "St\u00e9phane", 
        "id": "sg:person.012641024611.45", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012641024611.45"
        ], 
        "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_1747.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.012641024611.45'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...