Szymon Jaroszewicz Papers on DiSC'04 Interestingness of Frequent Itemsets Using Bayesian Networks as Background Knowledge Publications Note: Links lead to the DBLP on the Web. Szymon Jaroszewicz Szymon Jaroszewicz, Dan A. Simovici : Interestingness of frequent itemsets using Bayesian networks as background knowledge. KDD 2004 : 178-186 Dan A. Simovici , Szymon Jaroszewicz: A Metric Approach to Building Decision Trees Based on Goodman-Kruskal Association Index. PAKDD 2004 : 181-190 Ivo G. Rosenberg , Dan A. Simovici , Szymon Jaroszewicz: On Functions Defined on Free Boolean Algebras. ISMVL 2002 : 192- Szymon Jaroszewicz, Dan A. Simovici : Pruning Redundant Association Rules Using Maximum Entropy Principle. PAKDD 2002 : 135-147 Szymon Jaroszewicz, Dan A. Simovici : Support Approximations Using Bonferroni-Type Inequalities. PKDD 2002 : 212-224 Dan A. Simovici , Szymon Jaroszewicz: An axiomatization of partition entropy. IEEE Transactions on Information Theory 48 (7): 2138-2142 (2002) Dan A. Simovici , Szymon Jaroszewicz: An Axiomatization of Generalized Entropy of Partitions. ISMVL 2001 : 259- Szymon Jaroszewicz, Dan A. Simovici : A General Measure of Rule Interestingness. PKDD 2001 : 253-265 Szymon Jaroszewicz, Dan A. Simovici : Data Mining of Weak Functional Decompositions. ISMVL 2000 : 77-82 Szymon Jaroszewicz, Dan A. Simovici : On Axiomatization of Conditional Entropy of Functions Between Finite Sets. ISMVL 1999 : 24-28 1 [ 8 ] 2 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] ©2005 Association for Computing Machinery