0.25
0.5
0.75
1.25
1.5
1.75
2
Non-Redundant Subgroup Discovery in Large and Complex Data
Published on Nov 29, 20112905 Views
Large and complex data is challenging for most existing discovery algorithms, for several reasons. First of all, such data leads to enormous hypothesis spaces, making exhaustive search infeasible. Sec
Related categories
Chapter list
Non-Redundant Subgroup Discovery in Large and Complex Data00:00
Subgroup Discovery00:22
Example - 101:15
Example - 201:53
Problem #1 - 102:50
Problem #1 - 204:15
Problem #1 - 304:38
Problem #1 - 405:50
Problem #1 - 505:52
Non-Redundant Subgroup Set Mining07:01
Problem #208:01
Heuristic Search09:19
Degrees of Redundancy10:56
Non-Redundant Beam Search12:15
Beam Selection Strategies in Action13:24
Top-k Beam Selection15:10
Description-based Beam Selection15:34
Cover-based Beam Selection15:57
Subgroup Discovery Results16:31
Subgroup Discovery Results16:47
Exceptional Model Mining Results - 118:40
Exceptional Model Mining Results - 218:51
Conclusions19:46
Thank you20:38