question: public Object2DoubleOpenHashMap < int [ ] > supportMap ( int supportThreshold ) { List < ItemSet > itemSets = learn ( ) ; Object2DoubleOpenHashMap < int [ ] > supportMap = new Object2DoubleOpenHashMap < > ( itemSets . size ( ) ) ; for ( ItemSet itemSet : itemSets ) { if ( itemSet . support >= supportThreshold ) { supportMap . put ( itemSet . items , itemSet . support ) ; } } return supportMap ; }
target:  Returns a map of discovered ItemSets and their support, where the support is the number of times the combination appears in the input data. The map returned contains only those items whose support is greater than the given supportThreshold