Ranking Interesting Subgroups
published: Aug. 26, 2009, recorded: June 2009, views: 3013
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Subgroup discovery is the task of identifying the top k patterns in a database with most signiﬁcant deviation in the distribution of a target attribute Y . Subgroup discovery is a popular approach for identifying interesting patterns in data, because it effectively combines statistical signiﬁcance with an understandable representation of patterns as a logical formula. However, it is often a problem that some subgroups, even if they are statistically highly signiﬁcant, are not interesting to the user for some reason. In this paper, we present an approach based on the work on ranking Support Vector Machines that ranks subgroups with respect to the user’s concept of interestingness, and ﬁnds subgroups that are interesting to the user. It will be shown that this approach can signiﬁcantly increase the quality of the subgroups.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !