JavaScript is required to properly view the contents of this page!

Run 844254

Task 53967 (Subgroup Discovery) monks-problems-1 Uploaded 09-07-2016 by Jan van Rijn
0 likes downloaded by 0 people 0 issues 0 downvotes , 0 total downloads

Issue	#Downvotes for this reason	By

SubgroupDiscovery(1)	Subgroup Discovery search algorithm.
SubgroupDiscovery(1)_search_depth	1
SubgroupDiscovery(1)_minimum_coverage	2
SubgroupDiscovery(1)_maximum_coverage_fraction	1.0
SubgroupDiscovery(1)_maximum_subgroups	100
SubgroupDiscovery(1)_maximum_time	1.0
SubgroupDiscovery(1)_search_strategy	beam
SubgroupDiscovery(1)_use_nominal_sets	false
SubgroupDiscovery(1)_search_strategy_width	256
SubgroupDiscovery(1)_numeric_operators	=
SubgroupDiscovery(1)_numeric_strategy	best
SubgroupDiscovery(1)_nr_bins	8
SubgroupDiscovery(1)_nr_threads	1
SubgroupDiscovery(1)_alpha	0.5
SubgroupDiscovery(1)_beta	1.0
SubgroupDiscovery(1)_post_processing_do_autorun	true
SubgroupDiscovery(1)_post_processing_count	20
SubgroupDiscovery(1)_beam_seed
SubgroupDiscovery(1)_overall_ranking_loss	0.0