Marzena Kryszkiewicz Papers on DiSC'04 Upper Bound on the Length of Generalized Disjunction-Free Patterns Publications Note: Links lead to the DBLP on the Web. Marzena Kryszkiewicz Marzena Kryszkiewicz, Katarzyna Cichon : Support Oriented Discovery of Generalized Disjunction-Free Representation of Frequent Patterns with Negation. PAKDD 2005 : 672-682 Marzena Kryszkiewicz, Katarzyna Cichon : Scalable Methods of Discovering Rough Sets Reducts. Intelligent Information Systems 2004 : 547-556 Marzena Kryszkiewicz: Reducing borders of k-disjunction free representations of frequent patterns. SAC 2004 : 559-563 Marzena Kryszkiewicz: Upper Bound on the Length of Generalized Disjunction-Free Patterns. SSDBM 2004 : 31-40 Marzena Kryszkiewicz, Katarzyna Cichon : Towards Scalable Algorithms for Discovering Rough Set Reducts. T. Rough Sets 2004 : 120-143 Marzena Kryszkiewicz, Henryk Rybinski , Marcin Gajek : Dataless Transitions Between Concise Representations of Frequent Patterns. J. Intell. Inf. Syst. 22 (1): 41-70 (2004) Marzena Kryszkiewicz: Closed Set Based Discovery of Maximal Covering Rules. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 11 (Supplement-1): 15-30 (2003) Marzena Kryszkiewicz, Marcin Gajek : Why to Apply Generalized Disjunction-Free Generators Representation of Frequent Patterns? ISMIS 2002 : 383-392 Marzena Kryszkiewicz, Marcin Gajek : Concise Representation of Frequent Patterns Based on Generalized Disjunction-Free Generators. PAKDD 2002 : 159-171 Marzena Kryszkiewicz: Concise Representations of Association Rules. Pattern Detection and Discovery 2002 : 92-109 Marzena Kryszkiewicz: Inferring Knowledge from Frequent Patterns. Soft-Ware 2002 : 247-262 Marzena Kryszkiewicz: Concise Representation of Frequent Patterns Based on Disjunction-Free Generators. ICDM 2001 : 305-312 Marzena Kryszkiewicz: Closed Set Based Discovery of Representative Association Rules. IDA 2001 : 350-359 Marzena Kryszkiewicz: Direct and Incremental Computing of Maximal Covering Rules. PAKDD 2001 : 400-405 Marzena Kryszkiewicz: Comparative study of alternative types of knowledge reduction in inconsistent systems. Int. J. Intell. Syst. 16 (1): 105-120 (2001) Marzena Kryszkiewicz: Mining around Association and Representative Rules. ADBIS-DASFAA 2000 : 117-127 Marzena Kryszkiewicz, Henryk Rybinski : Legitimate Approach to Association Rules under Incompleteness. ISMIS 2000 : 505-514 Marzena Kryszkiewicz: Mining with Cover and Extension Operators. PKDD 2000 : 476-482 Marzena Kryszkiewicz: Inducing Theory for the Rule Set. Rough Sets and Current Trends in Computing 2000 : 391-398 Marzena Kryszkiewicz: Probabilistic Approach to Association Rules in Incomplete Databases. Web-Age Information Management 2000 : 133-138 Marzena Kryszkiewicz, Henryk Rybinski : Incomplete Database Issues for Representative Association Rules. ISMIS 1999 : 583-591 Marzena Kryszkiewicz: Association Rules in Incomplete Databases. PAKDD 1999 : 84-93 Marzena Kryszkiewicz: Rules in Incomplete Information Systems. Inf. Sci. 113 (3-4): 271-292 (1999) Marzena Kryszkiewicz: Representative Association Rules. PAKDD 1998 : 198-209 Marzena Kryszkiewicz: Representative Association Rules and Minimum Condition Maximum Consequence Association Rules. PKDD 1998 : 361-369 Marzena Kryszkiewicz: Fast Discovery of Representative Association Rules. Rough Sets and Current Trends in Computing 1998 : 214-221 Marzena Kryszkiewicz: Rough Set Approach to Incomplete Information Systems. Inf. Sci. 112 (1-4): 39-49 (1998) Marzena Kryszkiewicz: Generalized Rules in Incomplete Information Systems. ISMIS 1997 : 421-430 Marzena Kryszkiewicz: Generation of Rules from Incomplete Information Systems. PKDD 1997 : 156-166 Marzena Kryszkiewicz, Henryk Rybinski : Reducing Information Systems with Uncertain Attributes. ISMIS 1996 : 285-294 Marzena Kryszkiewicz, Henryk Rybinski : Computation of Reducts of Composed Information Systems. Fundam. Inform. 27 (2/3): 183-195 (1996) Marzena Kryszkiewicz, Henryk Rybinski : Finding Reducts in Composed Information Systems. RSKD 1993 : 261-273 1 [ 28 ] [ 31 ] [ 32 ] 2 [ 24 ] [ 25 ] [ 27 ] 3 [ 1 ] [ 2 ] [ 3 ] [ 12 ] [ 16 ] [ 27 ] ©2005 Association for Computing Machinery