Code Monkey home page Code Monkey logo

meta-learning's Introduction

meta-learning

Utility software to compute Rough-Set-Theory-based measures for characterizing competence domain of classification models.

The software allows batch computing of rough set measures for a number of data sets and to determine a set of rules describing the domain of competence of a classification algorithm. That information can help to choose an appropriate classification algorithm for a given data set. Included rough set measures are (see rough-set project):

  • rough membership
  • rough involvement
  • rough agreement
  • rough class quality

Usage:

The software was used to create mappings of the domain of competence of classification algorithms. For that purpose, a significant amount of data sets were processed. The data sets were as diverse as possible, i.e., comming from different application domains, having different dimensions (number of examples and number of descriptive attributes), different attribute types and different apparent complexities; so that the data sets complexity measures covered as much as possible the whole space of data complexity. In that way, the dimensions of the data complexity space were defined by the rough set measures. The C4.5 classification algorithm was mapped and its good behavior region in the complexity space was learned. In that way, we were able to predict the C4.5 behavior for new data sets, just calculating the data set complexity measures and comparing its position in the complexity map with the C4.5 good behavior region.

For more details see:

  • Sanchez Tarrago, D., Bello, R., Herrera, F.: Data Complexity by means of Rough Set Measures. In: Proceedings of the Cuba-Flanders Workshop on Machine Learning and Knowledge Discovery (CF-WML-KD2010). Editorial Feijoó, Central University Marta Abreu de Las Villas (2010). (text)

More generally, a number of classification algorithms can be mapped and different volumes can be identified in the space of data complexity as the good behavior domain for each algorithm. Given a new data set, its position in the complexity coordinates can be mapped against the domain of competences of a set of classification algorithms to select the best option.

Developed with:

  • Java 1.8
  • NetBeans IDE 8.2

Dependencies:

meta-learning's People

Contributors

dstarrago avatar

Stargazers

 avatar  avatar

Watchers

 avatar

Forkers

darekjk

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.