[1]

S. Jaroszewicz. Using interesting sequences to interactively build Hidden Markov Models. Data Mining and Knowledge Discovery, , 2010, accepted.
bibtex

[2]

S. Jaroszewicz. Discovering Interesting Patterns in Numerical Data with Background Knowledge. In Rare Association Rule Mining and Knowledge Discovery: Technologies for Infrequent and Critical Event Detection, pages 118-130, IGI Global, 2010.
bibtex

[3]

S. Jaroszewicz, T. Scheffer, D.A. Simovici. Scalable pattern mining with Bayesian networks as background knowledge. Data Mining and Knowledge Discovery, 18(1), pages 56-100, 2009.
bibtex abstract full text (PDF)

[4]

S. Jaroszewicz. Interactive HMM Construction Based on Interesting Sequences. In Proc. of Local Patterns to Global Models (LeGo'08) Workshop at the 12th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'08), pages 82-91, Antwerp, Belgium, 2008.
bibtex abstract full text (PDF) slides

[5]

S. Jaroszewicz. Minimum Variance Associations -- Discovering Relationships in Numerical Data. In The Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), pages 172-183, Osaka, Japan, 2008.
bibtex abstract full text (PDF) slides

[6]

T. Calders, S. Jaroszewicz. Efficient AUC Optimization for Classification. In 11th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'07), pages 42-53, Warsaw, Poland, 2007, Best paper award.
(C) Springer Verlag (Lecture Notes in Computer Science 4702)
bibtex abstract full text (PDF) slides software

[7]

S. Jaroszewicz, L. Ivantysynova, T. Scheffer. Schema Matching on Streams with Accuracy Guarantees. Intelligent Data Analysis, 12(3), pages 253-270, 2008.
bibtex abstract

[8]

S. Jaroszewicz, M. Korzeñ. Approximating Representations for Large Numerical Databases. In 7th SIAM International Conference on Data Mining (SDM'07), pages 521-526, Minneapolis, MN, 2007.
bibtex abstract full text (PDF) extended version (PDF)

[9]

S. Jaroszewicz, L. Ivantysynova, T. Scheffer. Accurate Schema Matching on Streams. In 4th International Workshop on Knowledge Discovery from Data Streams at the 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'06), pages 3-12, 2006.
bibtex abstract full text (PDF)

[10]

T. Calders, B. Goethals, S. Jaroszewicz. Mining Rank-Correlated Sets of Numerical Attributes. In Proc. of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'06), 2006.
bibtex abstract full text (PDF)

[11]

S. Jaroszewicz. Polynomial Association Rules with Applications to Logistic Regression. In Proc. of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'06), 2006.
bibtex abstract full text (PDF)

[12]

S. Jaroszewicz, M. Korzeñ. Comparison of Information Theoretical Measures for Reduct Finding. In Proc. of the 8th International Conference on Artificial Intelligence and Soft Computing (ICAISC'06), pages 518-527, Zakopane, June, 2006.
bibtex abstract

[13]

D. A. Simovici, S. Jaroszewicz. A new metric splitting criterion for decision trees. Parallel Algorithms Appl., 21(4), pages 239-256, 2006.
bibtex abstract

[14]

D. A. Simovici, S. Jaroszewicz. Generalized Conditional Entropy and a Metric Splitting Criterion for Decision Trees. In 10th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining (PAKDD'06), pages 35-44, Singapore, 2006.
bibtex abstract

[15]

S. Jaroszewicz, T. Scheffer. Fast Discovery of Unexpected Patterns in Data, Relative to a Bayesian Network. In 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2005), pages 118-127, Chicago, IL, August, 2005.
bibtex abstract full text (ps.gz) full text (PDF)

[16]

D. Simovici, S. Jaroszewicz. A New Metric Splitting Criterion for Decision Trees. International Journal of Parallel, Emergent and Distributed Systems, 21(4), pages 239-256, August, 2006.
bibtex abstract

[17]

S. Jaroszewicz, W. Kosiñski. Machine Learning for Speech Recognition Researchers. In Proceedings of the Speech Analysis, Synthesis and Recognition Applications of Phonetics Conference, Kraków, Poland, September, 2005, Publication on CD-ROM.
bibtex abstract

[18]

M. Korzeñ, S. Jaroszewicz. Finding Reducts Without Building the Discernibility Matrix.. In Proceedings of the Fifth International Conference on Intelligent Systems Design and Applications (ISDA'05), pages 450-455, Wroc³aw, Poland, 2005.
bibtex abstract

[19]

D. Simovici, S. Jaroszewicz. A Metric Approach to Building Decision Trees Based on Goodman-Kruskal Association Index. In PAKDD 2004, pages 181-190, Sydney, Australia, May, 2004.
bibtex

[20]

S. Jaroszewicz, D. A. Simovici, I. Rosenberg. Measures on Boolean Polynomials and Their Applications in Data Mining. Discrete Applied Mathematics, 144(1-2), pages 123-139, November, 2004.
bibtex abstract

[21]

Szymon Jaroszewicz, Dan Simovici. Interestingness of Frequent Itemsets Using Bayesian Networks as Background Knowledge. In 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2004), pages 178-186, Seattle, WA, August, 2004.
bibtex abstract full text (ps.gz) full text (PDF)

[22]

S. Jaroszewicz, D. A. Simovici, W. P. Kuo, L. Ohno-Machado. The Goodman-Kruskal Ceofficient and its Applications in Genetic Diagnosis of Cancer. IEEE Transactions on Biomedical Engineering, 51(7), pages 1095-1102, July, 2004.
bibtex abstract

[23]

Szymon Jaroszewicz. Information Theoretical and Combinatorial Methods in Data Mining. PhD thesis, University of Massachusetts Boston, December, 2003.
bibtex full text (ps.gz) full text (PDF)

[24]

Dan A. Simovici, Szymon Jaroszewicz. Generalized Conditional Entropy and Decision Trees. In Journees francophones d'Extraction et de Gestion de Connaissances (EGC 2003), pages 369-380, Lyon, France, January, 2003.
bibtex abstract full text (ps.gz) full text (PDF)

[25]

S. Jaroszewicz, D. A. Simovici. Support Approximations Using Bonferroni-type Inequalities. In 6th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD 2002), pages 212-223, Helsinki, Finland, August, 2002.
(C) Springer Verlag (Lecture Notes in Computer Science 2431)
bibtex abstract full text (ps.gz) full text (PDF) slides

[26]

S. Jaroszewicz, D. A. Simovici. Pruning Redundant Association Rules Using Maximum Entropy Principle. In Advances in Knowledge Discovery and Data Mining, 6th Pacific-Asia Conference, PAKDD'02, pages 135-147, Taipei, Taiwan, May, 2002.
(C) Springer Verlag (Lecture Notes in Computer Science 2336)
bibtex abstract full text (ps.gz) full text (PDF) slides

[27]

I. Rosenberg, D. A. Simovici, S. Jaroszewicz. On Functions Defined on Free Boolean Algebras. In IEEE Intenrational Symposiun on Multiple-Valued Logic ISMVL'02, Boston, MA, May, 2002.
bibtex abstract

[28]

S. Jaroszewicz, D. A. Simovici, I. Rosenberg. An Inclusion-Exclusion Result for Boolean Polynomials and Its Applications in Data Mining. In Workshop on Discrete Mathematics and Data Mining (DM&DM), Second SIAM International Conference on Data Mining, Arlington, VA, April, 2002.
bibtex abstract slides

[29]

D. A. Simovici, S. Jaroszewicz. An Axiomatization of Partition Entropy. IEEE Transactions on Information Theory, 48(7), pages 2138-2142, July, 2002.
bibtex abstract full text (PDF)

[30]

S. Jaroszewicz, D. A. Simovici. A General Measure of Rule Interestingness. In 5th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD 2001), pages 253-265, 2001.
(C) Springer Verlag (Lecture Notes in Computer Science 2168)
bibtex abstract full text (ps.gz) full text (PDF) extended version (ps.gz) extended version (PDF) slides

[31]

S. Jaroszewicz, D. A. Simovici. Data Mining of Weak Functional Decompositions. In Proc. of the 30th International Symposium on Multiple-Valued Logic (ISMVL 2000), pages 77-82, 2000.
bibtex

[32]

D. A. Simovici, S. Jaroszewicz. On Information-Theoretical Aspects of Relational Databases. In Finite versus Infinite, Springer Verlag, London, 2000.
bibtex abstract

[33]

S. Jaroszewicz, D. A. Simovici. On Axiomatization of Conditional Entropy of Functions Between Finite Sets. In Proceedings of the 29th International Symposium on Multiple-Valued Logic, pages 24-28, Freiburg, Germany, 1999.
bibtex abstract

[34]

S.Jaroszewicz. Minimization of Incompletely Specified Multiple-Valued Functions in Reed-Muller Domain. In Proc. of the 19th International Scientific Symposium for Students and Young Research Employees, pages 121-126, Zielona Góra, Poland, 1997, (in Polish).
bibtex

[35]

S.Jaroszewicz, V.Shmerko, S.Yanushkevich. Exact Irredundant Searching for a Minimal Reed-Muller Expansion for an Incompletely Specified MVL Function. In Proc. of the International Conference on Application of Computer Systems, pages 65-74, Szczecin, Poland, 1996.
bibtex

[36]

A.D.Zakrevskij, S.N.Yanushkevich, S.Jaroszewicz. Minimization of Reed-Muller Expansions for Systems of Incompletely Specified MVL Functions. In Proc. of the International Conference on Methods and Models in Automatics and Robotics (MMAR'96), pages 1085-1090, Międzyzdroje, Poland, 1996.
bibtex