Run
OpenML
Help
Sign in
×
Sign in
No account? Join OpenML
Forgot password
×
JavaScript is required to properly view the contents of this page!
OpenML
Explore
Data
Task
Flow
Run
Study
Task type
Measure
People
Help
Blog
Contact
Please cite us
1760051
JSON
XML
RDF
Run 1760051
Task 53975 (Subgroup Discovery)
monks-problems-2
Uploaded 24-07-2016 by
Jan van Rijn
0 likes
downloaded by 0 people
0 issues
0 downvotes
, 0 total downloads
Cortana
Add tag
Issue
#Downvotes for this reason
By
Flow
SubgroupDiscovery(1)
Subgroup Discovery search algorithm.
SubgroupDiscovery(1)_search_depth
4
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
1024
SubgroupDiscovery(1)_numeric_operators
≤, ≥
SubgroupDiscovery(1)_numeric_strategy
best-bins
SubgroupDiscovery(1)_nr_bins
2
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
Result files
xml
Description
XML file describing the run, including user-defined evaluation measures.
csv
Subgroups
7 Evaluation measures
Cortana quality
0.135
Coverage
100
Positives
84
Probability
0.84
Quality
0.135
Joint entropy
6.0711
Pattern team auroc10
0.5685