Search the dblp DataBase
Marzena Kryszkiewicz :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Marzena Kryszkiewicz Mining around Association and Representative Rules. [Citation Graph (0, 0)][DBLP ] ADBIS-DASFAA, 2000, pp:117-127 [Conf ] Marzena Kryszkiewicz Concise Representations of Association Rules. [Citation Graph (0, 0)][DBLP ] Pattern Detection and Discovery, 2002, pp:92-109 [Conf ] Marzena Kryszkiewicz Using Generators for Discovering Certain and Generalized Decision Rules. [Citation Graph (0, 0)][DBLP ] HIS, 2005, pp:181-186 [Conf ] Marzena Kryszkiewicz Concise Representation of Frequent Patterns Based on Disjunction-Free Generators. [Citation Graph (0, 0)][DBLP ] ICDM, 2001, pp:305-312 [Conf ] Marzena Kryszkiewicz Closed Set Based Discovery of Representative Association Rules. [Citation Graph (0, 0)][DBLP ] IDA, 2001, pp:350-359 [Conf ] Marzena Kryszkiewicz , Katarzyna Cichon Scalable Methods of Discovering Rough Sets Reducts. [Citation Graph (0, 0)][DBLP ] Intelligent Information Systems, 2004, pp:547-556 [Conf ] Marzena Kryszkiewicz , Lukasz Skonieczny Faster Clustering with DBSCAN. [Citation Graph (0, 0)][DBLP ] Intelligent Information Systems, 2005, pp:605-614 [Conf ] Marzena Kryszkiewicz Generalized Rules in Incomplete Information Systems. [Citation Graph (0, 0)][DBLP ] ISMIS, 1997, pp:421-430 [Conf ] Marzena Kryszkiewicz , Marcin Gajek Why to Apply Generalized Disjunction-Free Generators Representation of Frequent Patterns? [Citation Graph (0, 0)][DBLP ] ISMIS, 2002, pp:383-392 [Conf ] Marzena Kryszkiewicz , Henryk Rybinski Legitimate Approach to Association Rules under Incompleteness. [Citation Graph (0, 0)][DBLP ] ISMIS, 2000, pp:505-514 [Conf ] Marzena Kryszkiewicz , Henryk Rybinski Reducing Information Systems with Uncertain Attributes. [Citation Graph (0, 0)][DBLP ] ISMIS, 1996, pp:285-294 [Conf ] Marzena Kryszkiewicz , Henryk Rybinski Incomplete Database Issues for Representative Association Rules. [Citation Graph (0, 0)][DBLP ] ISMIS, 1999, pp:583-591 [Conf ] Marzena Kryszkiewicz Direct and Incremental Computing of Maximal Covering Rules. [Citation Graph (0, 0)][DBLP ] PAKDD, 2001, pp:400-405 [Conf ] Marzena Kryszkiewicz Generalized Disjunction-Free Representation of Frequents Patterns with at Most k Negations. [Citation Graph (0, 0)][DBLP ] PAKDD, 2006, pp:468-472 [Conf ] Marzena Kryszkiewicz Representative Association Rules. [Citation Graph (0, 0)][DBLP ] PAKDD, 1998, pp:198-209 [Conf ] Marzena Kryszkiewicz Association Rules in Incomplete Databases. [Citation Graph (0, 0)][DBLP ] PAKDD, 1999, pp:84-93 [Conf ] Marzena Kryszkiewicz , Katarzyna Cichon Support Oriented Discovery of Generalized Disjunction-Free Representation of Frequent Patterns with Negation. [Citation Graph (0, 0)][DBLP ] PAKDD, 2005, pp:672-682 [Conf ] Marzena Kryszkiewicz , Marcin Gajek Concise Representation of Frequent Patterns Based on Generalized Disjunction-Free Generators. [Citation Graph (0, 0)][DBLP ] PAKDD, 2002, pp:159-171 [Conf ] Marzena Kryszkiewicz Mining with Cover and Extension Operators. [Citation Graph (0, 0)][DBLP ] PKDD, 2000, pp:476-482 [Conf ] Marzena Kryszkiewicz Representative Association Rules and Minimum Condition Maximum Consequence Association Rules. [Citation Graph (0, 0)][DBLP ] PKDD, 1998, pp:361-369 [Conf ] Marzena Kryszkiewicz Generation of Rules from Incomplete Information Systems. [Citation Graph (0, 0)][DBLP ] PKDD, 1997, pp:156-166 [Conf ] Marzena Kryszkiewicz , Henryk Rybinski Finding Reducts in Composed Information Systems. [Citation Graph (0, 0)][DBLP ] RSKD, 1993, pp:261-273 [Conf ] Marzena Kryszkiewicz Inducing Theory for the Rule Set. [Citation Graph (0, 0)][DBLP ] Rough Sets and Current Trends in Computing, 2000, pp:391-398 [Conf ] Marzena Kryszkiewicz Fast Discovery of Representative Association Rules. [Citation Graph (0, 0)][DBLP ] Rough Sets and Current Trends in Computing, 1998, pp:214-221 [Conf ] Marzena Kryszkiewicz Reducing borders of k-disjunction free representations of frequent patterns. [Citation Graph (0, 0)][DBLP ] SAC, 2004, pp:559-563 [Conf ] Marzena Kryszkiewicz Inferring Knowledge from Frequent Patterns. [Citation Graph (0, 0)][DBLP ] Soft-Ware, 2002, pp:247-262 [Conf ] Marzena Kryszkiewicz Upper Bound on the Length of Generalized Disjunction-Free Patterns. [Citation Graph (0, 0)][DBLP ] SSDBM, 2004, pp:31-40 [Conf ] Marzena Kryszkiewicz Probabilistic Approach to Association Rules in Incomplete Databases. [Citation Graph (0, 0)][DBLP ] Web-Age Information Management, 2000, pp:133-138 [Conf ] Marzena Kryszkiewicz , Henryk Rybinski Computation of Reducts of Composed Information Systems. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 1996, v:27, n:2/3, pp:183-195 [Journal ] Marzena Kryszkiewicz Comparative study of alternative types of knowledge reduction in inconsistent systems. [Citation Graph (0, 0)][DBLP ] Int. J. Intell. Syst., 2001, v:16, n:1, pp:105-120 [Journal ] Marzena Kryszkiewicz Closed Set Based Discovery of Maximal Covering Rules. [Citation Graph (0, 0)][DBLP ] International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2003, v:11, n:Supplement-1, pp:15-30 [Journal ] Marzena Kryszkiewicz Rough Set Approach to Incomplete Information Systems. [Citation Graph (0, 0)][DBLP ] Inf. Sci., 1998, v:112, n:1-4, pp:39-49 [Journal ] Marzena Kryszkiewicz Rules in Incomplete Information Systems. [Citation Graph (0, 0)][DBLP ] Inf. Sci., 1999, v:113, n:3-4, pp:271-292 [Journal ] Marzena Kryszkiewicz Generalized disjunction-free representation of frequent patterns with negation. [Citation Graph (0, 0)][DBLP ] J. Exp. Theor. Artif. Intell., 2005, v:17, n:1-2, pp:63-82 [Journal ] Marzena Kryszkiewicz , Henryk Rybinski , Marcin Gajek Dataless Transitions Between Concise Representations of Frequent Patterns. [Citation Graph (0, 0)][DBLP ] J. Intell. Inf. Syst., 2004, v:22, n:1, pp:41-70 [Journal ] Marzena Kryszkiewicz , Katarzyna Cichon Towards Scalable Algorithms for Discovering Rough Set Reducts. [Citation Graph (0, 0)][DBLP ] , 2004, v:, n:, pp:120-143 [Journal ] Grzegorz Protaziuk , Marzena Kryszkiewicz , Henryk Rybinski , Alexandre Delteil Discovering Compound and Proper Nouns. [Citation Graph (0, 0)][DBLP ] RSEISP, 2007, pp:505-515 [Conf ] Henryk Rybinski , Marzena Kryszkiewicz , Grzegorz Protaziuk , Adam Jakubowski , Alexandre Delteil Discovering Synonyms Based on Frequent Termsets. [Citation Graph (0, 0)][DBLP ] RSEISP, 2007, pp:516-525 [Conf ] Marzena Kryszkiewicz Certain, Generalized Decision, and Membership Distribution Reducts Versus Functional Dependencies in Incomplete Systems. [Citation Graph (0, 0)][DBLP ] RSEISP, 2007, pp:162-174 [Conf ] Marzena Kryszkiewicz , Piotr Lasek Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute. [Citation Graph (0, 0)][DBLP ] RSEISP, 2007, pp:320-331 [Conf ] Non-Derivable Item Set and Non-Derivable Literal Set Representations of Patterns Admitting Negation. [Citation Graph (, )][DBLP ] Discovering Word Meanings Based on Frequent Termsets. [Citation Graph (, )][DBLP ] Compressed Disjunction-Free Pattern Representation versus Essential Pattern Representation. [Citation Graph (, )][DBLP ] A Neighborhood-Based Clustering by Means of the Triangle Inequality. [Citation Graph (, )][DBLP ] TI-DBSCAN: Clustering with DBSCAN by Means of the Triangle Inequality. [Citation Graph (, )][DBLP ] Closures of Downward Closed Representations of Frequent Patterns. [Citation Graph (, )][DBLP ] Search in 0.008secs, Finished in 0.010secs