### Abstract

In this paper, we study the problem of data skewness. A data set is skewed/imbalanced if its dependent variable is asymmetrically distributed. Dealing with skewed data sets has been identified as one of the ten most challenging problems in data mining research. We address the problem of class skewness for supervised learning models which are based on optimizing a regularized empirical risk function. These include both classification and regression models for discrete and continuous dependent variables. Classical empirical risk minimization is akin to minimizing the arithmetic mean of prediction errors, in which approach the induction process is biased towards the majority class for skewed data. To overcome this drawback, we propose a quadratic mean based learning framework (QMLearn) that is robust and insensitive to class skewness. We will note that minimizing the quadratic mean is a convex optimization problem and hence can be efficiently solved for large and high dimensional data. Comprehensive experiments demonstrate that the QMLearn model significantly outperforms existing statistical learners including logistic regression, support vector machines, linear regression, support vector regression and quantile regression etc.

Original language | English |
---|---|

Title of host publication | Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011 |

Pages | 188-198 |

Number of pages | 11 |

Publication status | Published - 2011 |

Externally published | Yes |

Event | 11th SIAM International Conference on Data Mining, SDM 2011 - Mesa, AZ, United States Duration: 28 Apr 2011 → 30 Apr 2011 |

### Other

Other | 11th SIAM International Conference on Data Mining, SDM 2011 |
---|---|

Country | United States |

City | Mesa, AZ |

Period | 28/4/11 → 30/4/11 |

### Fingerprint

### Keywords

- Convex optimization
- Data skewness
- Quadratic mean

### ASJC Scopus subject areas

- Software

### Cite this

*Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011*(pp. 188-198)

**A quadratic mean based supervised learning model for managing data skewness.** / Liu, Wei; Chawla, Sanjay.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011.*pp. 188-198, 11th SIAM International Conference on Data Mining, SDM 2011, Mesa, AZ, United States, 28/4/11.

}

TY - GEN

T1 - A quadratic mean based supervised learning model for managing data skewness

AU - Liu, Wei

AU - Chawla, Sanjay

PY - 2011

Y1 - 2011

N2 - In this paper, we study the problem of data skewness. A data set is skewed/imbalanced if its dependent variable is asymmetrically distributed. Dealing with skewed data sets has been identified as one of the ten most challenging problems in data mining research. We address the problem of class skewness for supervised learning models which are based on optimizing a regularized empirical risk function. These include both classification and regression models for discrete and continuous dependent variables. Classical empirical risk minimization is akin to minimizing the arithmetic mean of prediction errors, in which approach the induction process is biased towards the majority class for skewed data. To overcome this drawback, we propose a quadratic mean based learning framework (QMLearn) that is robust and insensitive to class skewness. We will note that minimizing the quadratic mean is a convex optimization problem and hence can be efficiently solved for large and high dimensional data. Comprehensive experiments demonstrate that the QMLearn model significantly outperforms existing statistical learners including logistic regression, support vector machines, linear regression, support vector regression and quantile regression etc.

AB - In this paper, we study the problem of data skewness. A data set is skewed/imbalanced if its dependent variable is asymmetrically distributed. Dealing with skewed data sets has been identified as one of the ten most challenging problems in data mining research. We address the problem of class skewness for supervised learning models which are based on optimizing a regularized empirical risk function. These include both classification and regression models for discrete and continuous dependent variables. Classical empirical risk minimization is akin to minimizing the arithmetic mean of prediction errors, in which approach the induction process is biased towards the majority class for skewed data. To overcome this drawback, we propose a quadratic mean based learning framework (QMLearn) that is robust and insensitive to class skewness. We will note that minimizing the quadratic mean is a convex optimization problem and hence can be efficiently solved for large and high dimensional data. Comprehensive experiments demonstrate that the QMLearn model significantly outperforms existing statistical learners including logistic regression, support vector machines, linear regression, support vector regression and quantile regression etc.

KW - Convex optimization

KW - Data skewness

KW - Quadratic mean

UR - http://www.scopus.com/inward/record.url?scp=84857182086&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84857182086&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9780898719925

SP - 188

EP - 198

BT - Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011

ER -