Fan Min


Ontology type: schema:Person     


Person Info

NAME

Fan

SURNAME

Min

Publications in SciGraph latest 50 shown

  • 2019-03 Tri-partition cost-sensitive active learning through kNN in SOFT COMPUTING
  • 2018-12 Magic barrier estimation models for recommended systems under normal distribution in APPLIED INTELLIGENCE
  • 2018-03-03 Efficient collaborative filtering recommendations with multi-channel feature vectors in INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS
  • 2017-12 A two-stage discretization algorithm based on information entropy in APPLIED INTELLIGENCE
  • 2017-12 A PSO algorithm for multi-objective cost-sensitive attribute reduction on numeric data with error ranges in SOFT COMPUTING
  • 2017-04 TDUP: an approach to incremental mining of frequent itemsets with three-way-decision pattern updating in INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS
  • 2017 A Three-Way Recommender System for Popularity-Based Costs in ROUGH SETS
  • 2016-10 Multi-objective cost-sensitive attribute reduction on data with error ranges in INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS
  • 2016-09 Semi-greedy heuristics for feature selection with test cost constraints in GRANULAR COMPUTING
  • 2016 Representative-Based Active Learning with Max-Min Distance in ROUGH SETS
  • 2015-12 Representative-based classification through covering-based neighborhood rough sets in APPLIED INTELLIGENCE
  • 2015 A Teacher-Cost-Sensitive Decision-Theoretic Rough Set Model in ROUGH SETS AND KNOWLEDGE TECHNOLOGY
  • 2015 Methods and Practices of Three-Way Decisions for Complex Problem Solving in ROUGH SETS AND KNOWLEDGE TECHNOLOGY
  • 2014-10 An improved artificial bee colony algorithm for minimal time cost reduction in INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS
  • 2014 Mining Significant Granular Association Rules for Diverse Recommendation in ROUGH SETS AND CURRENT TRENDS IN SOFT COMPUTING
  • 2014 Feature Selection with Positive Region Constraint for Test-Cost-Sensitive Data in TRANSACTIONS ON ROUGH SETS XVIII
  • 2014 Top-N Recommendation Based on Granular Association Rules in ROUGH SETS AND KNOWLEDGE TECHNOLOGY
  • 2012 Granular Association Rule Mining through Parametric Rough Sets in BRAIN INFORMATICS
  • 2012 Minimal Test Cost Feature Selection with Positive Region Constraint in ROUGH SETS AND CURRENT TRENDS IN COMPUTING
  • 2012 A Competition Strategy to Cost-Sensitive Decision Trees in ROUGH SETS AND KNOWLEDGE TECHNOLOGY
  • 2011 Bipartite Graphs and Coverings in ROUGH SETS AND KNOWLEDGE TECHNOLOGY
  • 2011 Optimal Sub-Reducts with Test Cost Constraint in ROUGH SETS AND KNOWLEDGE TECHNOLOGY
  • 2011 Transversal and Function Matroidal Structures of Covering-Based Rough Sets in ROUGH SETS AND KNOWLEDGE TECHNOLOGY
  • 2011 Minimal Cost Attribute Reduction through Backtracking in DATABASE THEORY AND APPLICATION, BIO-SCIENCE AND BIO-TECHNOLOGY
  • 2011 Test Cost Constraint Reduction with Common Cost in FUTURE GENERATION INFORMATION TECHNOLOGY
  • 2011 Covering Numbers in Covering-Based Rough Sets in ROUGH SETS, FUZZY SETS, DATA MINING AND GRANULAR COMPUTING
  • 2011 Accumulated Cost Based Test-Cost-Sensitive Attribute Reduction in ROUGH SETS, FUZZY SETS, DATA MINING AND GRANULAR COMPUTING
  • 2009 OFFD: Optimal Flexible Frequency Discretization for Naïve Bayes Classification in ADVANCED DATA MINING AND APPLICATIONS
  • 2009 A Comparative Study of Pattern Matching Algorithms on Sequences in ROUGH SETS, FUZZY SETS, DATA MINING AND GRANULAR COMPUTING
  • 2008 Research on Rough Set Theory and Applications in China in TRANSACTIONS ON ROUGH SETS VIII
  • 2008 Intra-cluster Similarity Index Based on Fuzzy Rough Sets for Fuzzy C-Means Algorithm in ROUGH SETS AND KNOWLEDGE TECHNOLOGY
  • 2007 Minimal Attribute Space Bias for Attribute Reduction in ROUGH SETS AND KNOWLEDGE TECHNOLOGY
  • 2007 Reduction Based Symbolic Value Partition in ADVANCES IN HYBRID INFORMATION TECHNOLOGY
  • 2006 A New Adaptive Crossover Operator for the Preservation of Useful Schemata in ADVANCES IN MACHINE LEARNING AND CYBERNETICS
  • 2006 The M-Relative Reduct Problem in ROUGH SETS AND KNOWLEDGE TECHNOLOGY
  • 2006 Weighted Reduction for Decision Tables in FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY
  • 2006 Knowledge Reduction in Inconsistent Decision Tables in ADVANCED DATA MINING AND APPLICATIONS
  • 2005 A Divide-and-Conquer Discretization Algorithm in FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY
  • 2004 Integrating New Cost Model into HMA-Based Grid Resource Scheduling in GRID AND COOPERATIVE COMPUTING
  • 2003 An IP Traceback Scheme Integrating DPM and PPM in ROBOCUP 2005: ROBOT SOCCER WORLD CUP IX
  • 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.437806.e", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Min", 
        "givenName": "Fan", 
        "id": "sg:person.015204352277.87", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015204352277.87"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:00", 
        "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_1776.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.015204352277.87'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...