Multi-relational subgroup discovery task Given:

• a relational database D with relations R ={r₁; ::::::; r_m }
• a hypothesis language LH (language of group descriptions)
• an evaluation function d: h  Î LH : D -> [0;1]
• an integer k>0

Find:

• a set H  Í L_H of hypotheses of size at most k;
• such that fo each h Î H, d(h, D) >0

and any h' Î L_H \H,d(h',D) min _hÎH d(h;D):

 

---