2008 |
43 | EE | Marzena Kryszkiewicz,
Piotr Lasek:
FUN: Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute.
T. Rough Sets 9: 76-95 (2008) |
2007 |
42 | | Marzena Kryszkiewicz,
James F. Peters,
Henryk Rybinski,
Andrzej Skowron:
Rough Sets and Intelligent Systems Paradigms, International Conference, RSEISP 2007, Warsaw, Poland, June 28-30, 2007, Proceedings
Springer 2007 |
41 | EE | Henryk Rybinski,
Marzena Kryszkiewicz,
Grzegorz Protaziuk,
Aleksandra Kontkiewicz,
Katarzyna Marcinkowska,
Alexandre Delteil:
Discovering Word Meanings Based on Frequent Termsets.
MCD 2007: 82-92 |
40 | EE | Marzena Kryszkiewicz:
Certain, Generalized Decision, and Membership Distribution Reducts Versus Functional Dependencies in Incomplete Systems.
RSEISP 2007: 162-174 |
39 | EE | Marzena Kryszkiewicz,
Piotr Lasek:
Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute.
RSEISP 2007: 320-331 |
38 | EE | Grzegorz Protaziuk,
Marzena Kryszkiewicz,
Henryk Rybinski,
Alexandre Delteil:
Discovering Compound and Proper Nouns.
RSEISP 2007: 505-515 |
37 | EE | Henryk Rybinski,
Marzena Kryszkiewicz,
Grzegorz Protaziuk,
Adam Jakubowski,
Alexandre Delteil:
Discovering Synonyms Based on Frequent Termsets.
RSEISP 2007: 516-525 |
2006 |
36 | EE | Marzena Kryszkiewicz:
Generalized Disjunction-Free Representation of Frequents Patterns with at Most k Negations.
PAKDD 2006: 468-472 |
2005 |
35 | EE | Marzena Kryszkiewicz:
Using Generators for Discovering Certain and Generalized Decision Rules.
HIS 2005: 181-186 |
34 | | Marzena Kryszkiewicz,
Lukasz Skonieczny:
Faster Clustering with DBSCAN.
Intelligent Information Systems 2005: 605-614 |
33 | EE | Marzena Kryszkiewicz,
Katarzyna Cichon:
Support Oriented Discovery of Generalized Disjunction-Free Representation of Frequent Patterns with Negation.
PAKDD 2005: 672-682 |
32 | EE | Marzena Kryszkiewicz:
Generalized disjunction-free representation of frequent patterns with negation.
J. Exp. Theor. Artif. Intell. 17(1-2): 63-82 (2005) |
2004 |
31 | | Marzena Kryszkiewicz,
Katarzyna Cichon:
Scalable Methods of Discovering Rough Sets Reducts.
Intelligent Information Systems 2004: 547-556 |
30 | EE | Marzena Kryszkiewicz:
Reducing borders of k-disjunction free representations of frequent patterns.
SAC 2004: 559-563 |
29 | EE | Marzena Kryszkiewicz:
Upper Bound on the Length of Generalized Disjunction-Free Patterns.
SSDBM 2004: 31-40 |
28 | EE | Marzena Kryszkiewicz,
Henryk Rybinski,
Marcin Gajek:
Dataless Transitions Between Concise Representations of Frequent Patterns.
J. Intell. Inf. Syst. 22(1): 41-70 (2004) |
27 | EE | Marzena Kryszkiewicz,
Katarzyna Cichon:
Towards Scalable Algorithms for Discovering Rough Set Reducts.
T. Rough Sets: 120-143 (2004) |
2003 |
26 | EE | 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) |
2002 |
25 | EE | Marzena Kryszkiewicz,
Marcin Gajek:
Why to Apply Generalized Disjunction-Free Generators Representation of Frequent Patterns?
ISMIS 2002: 383-392 |
24 | EE | Marzena Kryszkiewicz,
Marcin Gajek:
Concise Representation of Frequent Patterns Based on Generalized Disjunction-Free Generators.
PAKDD 2002: 159-171 |
23 | EE | Marzena Kryszkiewicz:
Concise Representations of Association Rules.
Pattern Detection and Discovery 2002: 92-109 |
22 | EE | Marzena Kryszkiewicz:
Inferring Knowledge from Frequent Patterns.
Soft-Ware 2002: 247-262 |
2001 |
21 | EE | Marzena Kryszkiewicz:
Concise Representation of Frequent Patterns Based on Disjunction-Free Generators.
ICDM 2001: 305-312 |
20 | EE | Marzena Kryszkiewicz:
Closed Set Based Discovery of Representative Association Rules.
IDA 2001: 350-359 |
19 | EE | Marzena Kryszkiewicz:
Direct and Incremental Computing of Maximal Covering Rules.
PAKDD 2001: 400-405 |
18 | | Marzena Kryszkiewicz:
Comparative study of alternative types of knowledge reduction in inconsistent systems.
Int. J. Intell. Syst. 16(1): 105-120 (2001) |
2000 |
17 | EE | Marzena Kryszkiewicz:
Mining around Association and Representative Rules.
ADBIS-DASFAA 2000: 117-127 |
16 | EE | Marzena Kryszkiewicz,
Henryk Rybinski:
Legitimate Approach to Association Rules under Incompleteness.
ISMIS 2000: 505-514 |
15 | EE | Marzena Kryszkiewicz:
Mining with Cover and Extension Operators.
PKDD 2000: 476-482 |
14 | EE | Marzena Kryszkiewicz:
Inducing Theory for the Rule Set.
Rough Sets and Current Trends in Computing 2000: 391-398 |
13 | EE | Marzena Kryszkiewicz:
Probabilistic Approach to Association Rules in Incomplete Databases.
Web-Age Information Management 2000: 133-138 |
1999 |
12 | | Marzena Kryszkiewicz,
Henryk Rybinski:
Incomplete Database Issues for Representative Association Rules.
ISMIS 1999: 583-591 |
11 | EE | Marzena Kryszkiewicz:
Association Rules in Incomplete Databases.
PAKDD 1999: 84-93 |
10 | | Marzena Kryszkiewicz:
Rules in Incomplete Information Systems.
Inf. Sci. 113(3-4): 271-292 (1999) |
1998 |
9 | | Marzena Kryszkiewicz:
Representative Association Rules.
PAKDD 1998: 198-209 |
8 | | Marzena Kryszkiewicz:
Representative Association Rules and Minimum Condition Maximum Consequence Association Rules.
PKDD 1998: 361-369 |
7 | EE | Marzena Kryszkiewicz:
Fast Discovery of Representative Association Rules.
Rough Sets and Current Trends in Computing 1998: 214-221 |
6 | | Marzena Kryszkiewicz:
Rough Set Approach to Incomplete Information Systems.
Inf. Sci. 112(1-4): 39-49 (1998) |
1997 |
5 | | Marzena Kryszkiewicz:
Generalized Rules in Incomplete Information Systems.
ISMIS 1997: 421-430 |
4 | | Marzena Kryszkiewicz:
Generation of Rules from Incomplete Information Systems.
PKDD 1997: 156-166 |
1996 |
3 | | Marzena Kryszkiewicz,
Henryk Rybinski:
Reducing Information Systems with Uncertain Attributes.
ISMIS 1996: 285-294 |
2 | | Marzena Kryszkiewicz,
Henryk Rybinski:
Computation of Reducts of Composed Information Systems.
Fundam. Inform. 27(2/3): 183-195 (1996) |
1993 |
1 | | Marzena Kryszkiewicz,
Henryk Rybinski:
Finding Reducts in Composed Information Systems.
RSKD 1993: 261-273 |