 | 2009 |
|---|
| 24 |       | Szymon Jaroszewicz,
Tobias Scheffer,
Dan A. Simovici:
Scalable pattern mining with Bayesian networks as background knowledge.
Data Min. Knowl. Discov. 18(1): 56-100 (2009) |
| 2008 |
|---|
| 23 | | Szymon Jaroszewicz:
Minimum Variance Associations - Discovering Relationships in Numerical Data.
PAKDD 2008: 172-183 |
| 22 | | Szymon Jaroszewicz,
Lenka Ivantysynova,
Tobias Scheffer:
Schema matching on streams with accuracy guarantees.
Intell. Data Anal. 12(3): 253-270 (2008) |
| 2007 |
|---|
| 21 | | Toon Calders,
Szymon Jaroszewicz:
Efficient AUC Optimization for Classification.
PKDD 2007: 42-53 |
| 20 | | Szymon Jaroszewicz,
Marcin Korzen:
Approximating Representations for Large Numerical Databases.
SDM 2007 |
| 2006 |
|---|
| 19 | | Szymon Jaroszewicz,
Marcin Korzen:
Comparison of Information Theoretical Measures for Reduct Finding.
ICAISC 2006: 518-527 |
| 18 | | Szymon Jaroszewicz:
Polynomial association rules with applications to logistic regression.
KDD 2006: 586-591 |
| 17 | | Toon Calders,
Bart Goethals,
Szymon Jaroszewicz:
Mining rank-correlated sets of numerical attributes.
KDD 2006: 96-105 |
| 16 | | Dan A. Simovici,
Szymon Jaroszewicz:
Generalized Conditional Entropy and a Metric Splitting Criterion for Decision Trees.
PAKDD 2006: 35-44 |
| 15 | | Dan A. Simovici,
Szymon Jaroszewicz:
A new metric splitting criterion for decision trees.
IJPEDS 21(4): 239-256 (2006) |
| 2005 |
|---|
| 14 | | Marcin Korzen,
Szymon Jaroszewicz:
Finding Reducts Without Building the Discernibility Matrix.
ISDA 2005: 450-455 |
| 13 | | Szymon Jaroszewicz,
Tobias Scheffer:
Fast discovery of unexpected patterns in data, relative to a Bayesian network.
KDD 2005: 118-127 |
| 2004 |
|---|
| 12 | | Szymon Jaroszewicz,
Dan A. Simovici:
Interestingness of frequent itemsets using Bayesian networks as background knowledge.
KDD 2004: 178-186 |
| 11 | | Dan A. Simovici,
Szymon Jaroszewicz:
A Metric Approach to Building Decision Trees Based on Goodman-Kruskal Association Index.
PAKDD 2004: 181-190 |
| 10 | | Szymon Jaroszewicz,
Dan A. Simovici,
Ivo G. Rosenberg:
Measures on Boolean polynomials and their applications in data mining.
Discrete Applied Mathematics 144(1-2): 123-139 (2004) |
| 2003 |
|---|
| 9 |  | Dan A. Simovici,
Szymon Jaroszewicz:
Generalized Conditional Entropy and Decision Trees.
EGC 2003: 369-380 |
| 2002 |
|---|
| 8 | | Ivo G. Rosenberg,
Dan A. Simovici,
Szymon Jaroszewicz:
On Functions Defined on Free Boolean Algebras.
ISMVL 2002: 192- |
| 7 | | Szymon Jaroszewicz,
Dan A. Simovici:
Pruning Redundant Association Rules Using Maximum Entropy Principle.
PAKDD 2002: 135-147 |
| 6 | | Szymon Jaroszewicz,
Dan A. Simovici:
Support Approximations Using Bonferroni-Type Inequalities.
PKDD 2002: 212-224 |
| 5 | | Dan A. Simovici,
Szymon Jaroszewicz:
An axiomatization of partition entropy.
IEEE Transactions on Information Theory 48(7): 2138-2142 (2002) |
| 2001 |
|---|
| 4 | | Dan A. Simovici,
Szymon Jaroszewicz:
An Axiomatization of Generalized Entropy of Partitions.
ISMVL 2001: 259- |
| 3 | | Szymon Jaroszewicz,
Dan A. Simovici:
A General Measure of Rule Interestingness.
PKDD 2001: 253-265 |
| 2000 |
|---|
| 2 | | Szymon Jaroszewicz,
Dan A. Simovici:
Data Mining of Weak Functional Decompositions.
ISMVL 2000: 77-82 |
| 1999 |
|---|
| 1 | | Szymon Jaroszewicz,
Dan A. Simovici:
On Axiomatization of Conditional Entropy of Functions Between Finite Sets.
ISMVL 1999: 24-28 |
