scholarly journals Generating Interpretable Fuzzy Systems for Classification Problems

TecnoLógicas ◽  
2009 ◽  
pp. 239
Author(s):  
Juan A. Contreras-Montes ◽  
Oscar S. Acuña-Camacho
Keyword(s):  
Breast Cancer ◽  
Fuzzy Systems ◽  
Data Classification ◽  
Classification Problem ◽  
Classification Problems ◽  
Iris Data

En este artículo se presenta un nuevo método para generar sistemas difusos interpretables, a partir de datos experimentalesde entrada y salida, para resolver problemas de clasificación. En la partición antecedente se emplean conjuntos triangulares con interpolación de 0.5 lo cual evita la presencia de solapamientos complejos que suceden en otros métodos. Los consecuentes, tipo Singleton, son generados por la proyección de los valores modales de cada función de membresía triangular en el espacio de salida y se emplea el método de mínimos cuadrados para el ajuste de los consecuentes. El método propuesto consigue una mayor precisión que la alcanzada con los métodos actuales existentes, empleando un número reducido de reglas y parámetros y sin sacrificar la interpretabilidad del modelo difuso. El enfoque propuesto es aplicado a dos problemas clásicos de clasificación: el Wisconsin Breast Cancer (WBC) y el Iris Data Classification Problem, para mostrar las ventajas del método y comparar los resultados con los alcanzados por otros investigadores.

scholarly journals K-Means Cluster Based Undersampling Ensemble for Imbalanced Data Classification

2020 ◽  
Vol 9 (3) ◽  
pp. 2074-2079
Keyword(s):  
Imbalanced Data ◽  
Data Classification ◽  
Classification Problem ◽  
Classification Algorithms ◽  
Classification Problems ◽  
Imbalanced Classification ◽  
Imbalanced Data Classification ◽  
Traditional Classification ◽  
Boosting Method ◽  
Ensemble Algorithms

Imbalanced data classification is a critical and challenging problem in both data mining and machine learning. Imbalanced data classification problems present in many application areas like rare medical diagnosis, risk management, fault-detection, etc. The traditional classification algorithms yield poor results in imbalanced classification problems. In this paper, K-Means cluster based undersampling ensemble algorithm is proposed to solve the imbalanced data classification problem. The proposed method combines K-Means cluster based undersampling and boosting method. The experimental results show that the proposed algorithm outperforms the other sampling ensemble algorithms of previous studies.

scholarly journals K-Means Cluster Based Oversampling Algorithm for Imbalanced Data Classification

2020 ◽  
Vol 8 (5) ◽  
pp. 3436-3440
Keyword(s):  
Machine Learning ◽  
Data Distribution ◽  
Imbalanced Data ◽  
Data Classification ◽  
Classification Problem ◽  
Disease Diagnosis ◽  
Skewed Data ◽  
Challenging Problem ◽  
Classification Problems ◽  
Imbalanced Data Classification

Imbalanced data classification problems endeavor to find a dependent variable in a skewed data distribution. Imbalanced data classification problems present in many application areas like, medical disease diagnosis, risk management, fault-detection, etc. It is a challenging problem in the field of machine learning and data mining. In this paper, K-Means cluster based oversampling algorithm is proposed to solve the imbalanced data classification problem. The experimental results show that the proposed algorithm outperforms the existing oversampling algorithms of previous studies.

scholarly journals Confidence interval for micro-averaged F1 and macro-averaged F1 scores

2021 ◽  
Author(s):  
Kanae Takahashi ◽  
Kouji Yamamoto ◽  
Aya Kuchiba ◽  
Tatsuki Koyama
Keyword(s):  
Binary Classification ◽  
Classification Problem ◽  
Classification Problems ◽  
Summary Measure ◽  
Medical Field ◽  
Predictive Values ◽  
Binary Classification Problem ◽  
Multi Class Classification ◽  
Sensitivity Specificity ◽  
Measures Of Performance

AbstractA binary classification problem is common in medical field, and we often use sensitivity, specificity, accuracy, negative and positive predictive values as measures of performance of a binary predictor. In computer science, a classifier is usually evaluated with precision (positive predictive value) and recall (sensitivity). As a single summary measure of a classifier’s performance, F1 score, defined as the harmonic mean of precision and recall, is widely used in the context of information retrieval and information extraction evaluation since it possesses favorable characteristics, especially when the prevalence is low. Some statistical methods for inference have been developed for the F1 score in binary classification problems; however, they have not been extended to the problem of multi-class classification. There are three types of F1 scores, and statistical properties of these F1 scores have hardly ever been discussed. We propose methods based on the large sample multivariate central limit theorem for estimating F1 scores with confidence intervals.

Cost-sensitive design of error correcting output codes

2017 ◽  
Vol 232 (10) ◽  
pp. 1871-1881
Author(s):  
Aijun Xue ◽  
Xiaodan Wang
Keyword(s):  
Classification Problem ◽  
Learning Problems ◽  
Classification Problems ◽  
Cost Sensitive Learning ◽  
Misclassification Costs ◽  
Real World Applications ◽  
Cost Sensitive Classification ◽  
Comparable Performance ◽  
The Given ◽  
Error Correcting Output Codes

Many real world applications involve multiclass cost-sensitive learning problems. However, some well-worked binary cost-sensitive learning algorithms cannot be extended into multiclass cost-sensitive learning directly. It is meaningful to decompose the complex multiclass cost-sensitive classification problem into a series of binary cost-sensitive classification problems. So, in this paper we propose an alternative and efficient decomposition framework, using the original error correcting output codes. The main problem in our framework is how to evaluate the binary costs for each binary cost-sensitive base classifier. To solve this problem, we proposed to compute the expected misclassification costs starting from the given multiclass cost matrix. Furthermore, the general formulations to compute the binary costs are given. Experimental results on several synthetic and UCI datasets show that our method can obtain comparable performance in comparison with the state-of-the-art methods.

THE CLASSIFICATION PROBLEM FOR p-LOCAL TORSION-FREE ABELIAN GROUPS OF RANK TWO

2006 ◽  
Vol 06 (02) ◽  
pp. 233-251 ◽  
Author(s):  
GREG HJORTH ◽  
SIMON THOMAS
Keyword(s):  
Abelian Groups ◽  
Classification Problem ◽  
Classification Problems ◽  
Borel Reducibility ◽  
Free Abelian Groups ◽  
Torsion Free

We prove that if p ≠ q are distinct primes, then the classification problems for p-local and q-local torsion-free abelian groups of rank two are incomparable with respect to Borel reducibility.

Sign in / Sign up

Export Citation Format

Share Document