arrow
Return

Discovering statistically non-redundant subgroups

delete2014-09-01
delete15
PRE
AI
J
Jiuyong Li *
J
Jixue Liu
H
Hannu Toivonen
K
Kenji Satou
Y
Youqiang Sun
B
Bingyu Sun
DOI:10.1016/j.knosys.2014.04.030delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The objective of subgroup discovery is to find groups of individuals who are statistically different from others in a large data set. Most existing measures of the quality of subgroups are intuitive and do not precisely capture statistical differences of a group with the other, and their discovered results contain many redundant subgroups. Odds ratio is a statistically sound measure to quantify the statistical difference of two groups for a certain outcome and it is a very suitable measure for quantifying the quality of subgroups. In this paper, we propose a statistically sound framework for statistically non-redundant subgroup discovery: measuring the quality of subgroups by the odds ratio and defining statistically non-redundant subgroups by the error bounds of odds ratios. We show that our proposed method is faster than most existing methods and discovers complete statistically non-redundant subgroups. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Subgroups
Non-redundancy
Odds ratio
Rules
Search space pruning
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

K
Knowledge-Based Systems
IF:
7.6
Papers:
1.2W
Citations:
4.5W

Organization

U
university of helsinki
Scholars:
4.1W
Papers: 3.6W
Citations: 51
U
University of South Australia
Scholars:
9.0K
Papers: 1.1W
Citations: 1.6W
K
Kanazawa University
Scholars:
1.2W
Papers: 8.8K
Citations: 7.6K
C
chinese academy of sciences
Scholars:
56.5W
Papers: 44.9W
Citations: 704
researcher View more organizations