Abstract. We propose a formal definition of the robustness of association rules for interestingness measures. It is a central concept in the evaluation of the rules and has only be...
Yannick Le Bras, Patrick Meyer, Philippe Lenca, St...
Matrix factorization (MF) models have proved efficient and well scalable for collaborative filtering (CF) problems. Many researchers also present the probabilistic interpretation o...
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
Metaprogramming adds new expressive power to logic programming which can be advantageous to transfer to the field of deductive databases. We propose metaprogramming as a way to mo...