OPFython: A Python-Inspired Optimum-Path Forest Classifier

• URL: http://arxiv.org/abs/2001.10420v3
• Date: Fri, 30 Jul 2021 20:15:52 GMT
• Title: OPFython: A Python-Inspired Optimum-Path Forest Classifier
• Authors: Gustavo Henrique de Rosa, Jo\~ao Paulo Papa, Alexandre Xavier Falc\~ao
• Abstract summary: This paper proposes a Python-based Optimum-Path Forest framework, denoted as OPFython. As OPFython is a Python-based library, it provides a more friendly environment and a faster prototyping workspace than the C language.
• Score: 68.8204255655161
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Machine learning techniques have been paramount throughout the last years, being applied in a wide range of tasks, such as classification, object recognition, person identification, and image segmentation. Nevertheless, conventional classification algorithms, e.g., Logistic Regression, Decision Trees, and Bayesian classifiers, might lack complexity and diversity, not suitable when dealing with real-world data. A recent graph-inspired classifier, known as the Optimum-Path Forest, has proven to be a state-of-the-art technique, comparable to Support Vector Machines and even surpassing it in some tasks. This paper proposes a Python-based Optimum-Path Forest framework, denoted as OPFython, where all of its functions and classes are based upon the original C language implementation. Additionally, as OPFython is a Python-based library, it provides a more friendly environment and a faster prototyping workspace than the C language.

Related papers

• LCE: An Augmented Combination of Bagging and Boosting in Python [45.65284933207566]
  lcensemble is a high-performing, scalable and user-friendly Python package for the general tasks of classification and regression. Local Cascade Ensemble (LCE) is a machine learning method that further enhances the prediction performance of the current state-of-the-art methods Random Forest and XGBoost.
  arXiv  Detail & Related papers  (2023-08-14T16:34:47Z)
• Dynamic Perceiver for Efficient Visual Recognition [87.08210214417309]
  We propose Dynamic Perceiver (Dyn-Perceiver) to decouple the feature extraction procedure and the early classification task. A feature branch serves to extract image features, while a classification branch processes a latent code assigned for classification tasks. Early exits are placed exclusively within the classification branch, thus eliminating the need for linear separability in low-level features.
  arXiv  Detail & Related papers  (2023-06-20T03:00:22Z)
• problexity -- an open-source Python library for binary classification problem complexity assessment [0.0]
  The classification problem's complexity assessment is an essential element of many topics in the supervised learning domain. The tools currently available for the academic community, which would enable the calculation of problem complexity measures, are available only as libraries of the C++ and R languages. This paper describes the software module that allows for the estimation of 22 complexity measures for the Python language.
  arXiv  Detail & Related papers  (2022-07-14T07:32:15Z)
• Scikit-dimension: a Python package for intrinsic dimension estimation [58.8599521537]
  This technical note introduces textttscikit-dimension, an open-source Python package for intrinsic dimension estimation. textttscikit-dimension package provides a uniform implementation of most of the known ID estimators based on scikit-learn application programming interface. We briefly describe the package and demonstrate its use in a large-scale (more than 500 datasets) benchmarking of methods for ID estimation in real-life and synthetic data.
  arXiv  Detail & Related papers  (2021-09-06T16:46:38Z)
• Speeding Up OPFython with Numba [0.0]
  Optimum-Path Forest (OPF) has proven to be a state-of-the-art algorithm comparable to Logistic Regressors, Support Vector Machines. Recently, its Python-based version, denoted as OPFython, has been proposed to provide a more friendly framework and a faster prototyping environment. This paper proposes a simple yet highly efficient speed up using the Numba package, which accelerates Numpy-based calculations and attempts to increase the algorithm's overall performance.
  arXiv  Detail & Related papers  (2021-06-22T14:39:32Z)
• BOML: A Modularized Bilevel Optimization Library in Python for Meta Learning [52.90643948602659]
  BOML is a modularized optimization library that unifies several meta-learning algorithms into a common bilevel optimization framework. It provides a hierarchical optimization pipeline together with a variety of iteration modules, which can be used to solve the mainstream categories of meta-learning methods.
  arXiv  Detail & Related papers  (2020-09-28T14:21:55Z)
• Kernel methods library for pattern analysis and machine learning in python [0.0]
  The kernelmethods library fills that important void in the python ML ecosystem in a domain-agnostic fashion. The library provides a number of well-defined classes to make various kernel-based operations efficient.
  arXiv  Detail & Related papers  (2020-05-27T16:44:42Z)
• Fine-Grained Visual Classification with Efficient End-to-end Localization [49.9887676289364]
  We present an efficient localization module that can be fused with a classification network in an end-to-end setup. We evaluate the new model on the three benchmark datasets CUB200-2011, Stanford Cars and FGVC-Aircraft.
  arXiv  Detail & Related papers  (2020-05-11T14:07:06Z)
• fastai: A Layered API for Deep Learning [1.7223564681760164]
  fastai is a deep learning library which provides practitioners with high-level components. It provides researchers with low-level components that can be mixed and matched to build new approaches.
  arXiv  Detail & Related papers  (2020-02-11T21:16:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.