default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarzena Kryszkiewicz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c55]Marzena Kryszkiewicz
:
On Gower Similarity Coefficient and Missing Values. FedCSIS 2023: 1035-1040- 2021
- [j14]Piotr S. Maciag, Marzena Kryszkiewicz, Robert Bembenik, Jesus L. Lobo, Javier Del Ser:
Unsupervised Anomaly Detection in Stream Data with Online Evolving Spiking Neural Networks. Neural Networks 139: 118-139 (2021) - [c54]Marzena Kryszkiewicz:
Determining Tanimoto Similarity Neighborhoods of Real-Valued Vectors by Means of the Triangle Inequality and Bounds on Lengths. IJCRS 2021: 18-34 - 2020
- [c53]Piotr S. Maciag, Marzena Kryszkiewicz, Robert Bembenik:
Online Evolving Spiking Neural Networks for Incremental Air Pollution Prediction. IJCNN 2020: 1-8
2010 – 2019
- 2019
- [j13]Piotr S. Maciag, Nikola K. Kasabov, Marzena Kryszkiewicz, Robert Bembenik:
Air pollution prediction with clustering-based ensemble of evolving spiking neural networks and a case study for London area. Environ. Model. Softw. 118: 262-280 (2019) - [c52]Piotr S. Maciag, Marzena Kryszkiewicz, Robert Bembenik:
Discovery of closed spatio-temporal sequential patterns from event data. KES 2019: 707-716 - [p5]Marzena Kryszkiewicz, Lukasz Skonieczny:
Fast Discovery of Generalized Sequential Patterns. Intelligent Methods and Big Data in Industrial Applications 2019: 155-170 - [e12]Robert Bembenik, Lukasz Skonieczny, Grzegorz Protaziuk, Marzena Kryszkiewicz, Henryk Rybinski:
Intelligent Methods and Big Data in Industrial Applications. Studies in Big Data 40, Springer 2019, ISBN 978-3-319-77603-3 [contents] - [i1]Piotr S. Maciag, Marzena Kryszkiewicz, Robert Bembenik, Jesus L. Lobo, Javier Del Ser:
Unsupervised Anomaly Detection in Stream Data with Online Evolving Spiking Neural Networks. CoRR abs/1912.08785 (2019) - 2018
- [c51]Marzena Kryszkiewicz:
Representative Rule Templates for Association Rules Satisfying Multiple Canonical Evaluation Criteria. ACIIDS (1) 2018: 550-561 - 2017
- [c50]Marzena Kryszkiewicz:
Virtual Balancing of Decision Classes. ACIIDS (1) 2017: 673-684 - [c49]Mathurin Aché, Andrzej Janusz, Kamil Zbikowski, Dominik Slezak, Marzena Kryszkiewicz, Henryk Rybinski, Piotr Gawrysiak:
ISMIS 2017 Data Mining Competition: Trading Based on Recommendations. ISMIS 2017: 697-707 - [e11]Marzena Kryszkiewicz, Annalisa Appice, Dominik Slezak, Henryk Rybinski, Andrzej Skowron, Zbigniew W. Ras:
Foundations of Intelligent Systems - 23rd International Symposium, ISMIS 2017, Warsaw, Poland, June 26-29, 2017, Proceedings. Lecture Notes in Computer Science 10352, Springer 2017, ISBN 978-3-319-60437-4 [contents] - 2016
- [j12]Marzena Kryszkiewicz:
ACBC-Adequate Association and Decision Rules Versus Key Generators and Rough Sets Approximations. Fundam. Informaticae 148(1-2): 65-85 (2016) - [c48]Marzena Kryszkiewicz:
A Lossless Representation for Association Rules Satisfying Multiple Evaluation Criteria. ACIIDS (2) 2016: 147-158 - [c47]Marzena Kryszkiewicz, Przemyslaw Podsiadly:
Explicit Contrast Patterns Versus Minimal Jumping Emerging Patterns for Lazy Classification in High Dimensional Data. IEA/AIE 2016: 80-94 - [p4]Marzena Kryszkiewicz:
Dependence Factor as a Rule Evaluation Measure. Challenges in Computational Statistics and Data Mining 2016: 205-223 - 2015
- [c46]Marzena Kryszkiewicz:
Dependence Factor for Association Rules. ACIIDS (2) 2015: 135-145 - [e10]Marzena Kryszkiewicz, Sanghamitra Bandyopadhyay, Henryk Rybinski, Sankar K. Pal:
Pattern Recognition and Machine Intelligence - 6th International Conference, PReMI 2015, Warsaw, Poland, June 30 - July 3, 2015, Proceedings. Lecture Notes in Computer Science 9124, Springer 2015, ISBN 978-3-319-19940-5 [contents] - 2014
- [c45]Marzena Kryszkiewicz:
Using Non-Zero Dimensions and Lengths of Vectors for the Tanimoto Similarity Search among Real Valued Vectors. ACIIDS (1) 2014: 173-182 - [c44]Marzena Kryszkiewicz, Przemyslaw Podsiadly:
Efficient Search of Cosine and Tanimoto Near Duplicates among Vectors with Domains Consisting of Zero, a Positive Number and a Negative Number. IEA/AIE (2) 2014: 160-170 - [p3]Marzena Kryszkiewicz, Bartlomiej Janczak:
Basic Triangle Inequality Approach Versus Metric VP-Tree and Projection in Determining Euclidean and Cosine Neighbors. Intelligent Tools for Building a Scientific Information Platform 2014: 27-49 - [e9]Chris Cornelis, Marzena Kryszkiewicz, Dominik Slezak, Ernestina Menasalvas Ruiz, Rafael Bello, Lin Shang:
Rough Sets and Current Trends in Computing - 9th International Conference, RSCTC 2014, Granada and Madrid, Spain, July 9-13, 2014. Proceedings. Lecture Notes in Computer Science 8536, Springer 2014, ISBN 978-3-319-08643-9 [contents] - [e8]Marzena Kryszkiewicz, Chris Cornelis, Davide Ciucci, Jesús Medina-Moreno, Hiroshi Motoda, Zbigniew W. Ras:
Rough Sets and Intelligent Systems Paradigms - Second International Conference, RSEISP 2014, Held as Part of JRS 2014, Granada and Madrid, Spain, July 9-13, 2014. Proceedings. Lecture Notes in Computer Science 8537, Springer 2014, ISBN 978-3-319-08728-3 [contents] - [e7]Robert Bembenik, Lukasz Skonieczny, Henryk Rybinski, Marzena Kryszkiewicz, Marek Niezgódka:
Intelligent Tools for Building a Scientific Information Platform: From Research to Implementation. Studies in Computational Intelligence 541, Springer 2014, ISBN 978-3-319-04713-3 [contents] - 2013
- [j11]Marzena Kryszkiewicz:
Using Non-Zero Dimensions for the Cosine and Tanimoto Similarity Search Among Real Valued Vectors. Fundam. Informaticae 127(1-4): 307-323 (2013) - [c43]Marzena Kryszkiewicz:
Bounds on Lengths of Real Valued Vectors Similar with Regard to the Tanimoto Similarity. ACIIDS (1) 2013: 445-454 - [c42]Marzena Kryszkiewicz:
On Cosine and Tanimoto Near Duplicates Search among Vectors with Domains Consisting of Zero, a Positive Number and a Negative Number. FQAS 2013: 531-542 - [p2]Marzena Kryszkiewicz:
Determining Cosine Similarity Neighborhoods by Means of the Euclidean Distance. Rough Sets and Intelligent Systems (2) 2013: 323-345 - [e6]Robert Bembenik, Lukasz Skonieczny, Henryk Rybinski, Marzena Kryszkiewicz, Marek Niezgodka:
Intelligent Tools for Building a Scientific Information Platform - Advanced Architectures and Solutions. Studies in Computational Intelligence 467, Springer 2013, ISBN 978-3-642-35646-9 [contents] - 2012
- [j10]Marzena Kryszkiewicz, Sergei A. Obiedkov, Zbigniew W. Ras:
Preface. Fundam. Informaticae 115(4) (2012) - [c41]Marzena Kryszkiewicz:
Efficient Determination of Binary Non-negative Vector Neighbors with Regard to Cosine Similarity. IEA/AIE 2012: 48-57 - [c40]Marzena Kryszkiewicz:
The Triangle Inequality versus Projection onto a Dimension in Determining Cosine Similarity Neighborhoods of Non-negative Vectors. RSCTC 2012: 229-236 - 2011
- [e5]Dominik Ryzko, Henryk Rybinski, Piotr Gawrysiak, Marzena Kryszkiewicz:
Emerging Intelligent Technologies in Industry, 19th International Symposium, ISMIS 2011, Warsaw, Poland, June 28-30, 2011. Proceedings of the Industrial Session. Studies in Computational Intelligence 369, Springer 2011, ISBN 978-3-642-22731-8 [contents] - [e4]Marzena Kryszkiewicz, Henryk Rybinski, Andrzej Skowron, Zbigniew W. Ras:
Foundations of Intelligent Systems - 19th International Symposium, ISMIS 2011, Warsaw, Poland, June 28-30, 2011. Proceedings. Lecture Notes in Computer Science 6804, Springer 2011, ISBN 978-3-642-21915-3 [contents] - 2010
- [c39]Marzena Kryszkiewicz, Piotr Lasek:
A Neighborhood-Based Clustering by Means of the Triangle Inequality. IDEAL 2010: 284-291 - [c38]Marzena Kryszkiewicz, Piotr Lasek:
TI-DBSCAN: Clustering with DBSCAN by Means of the Triangle Inequality. RSCTC 2010: 60-69 - [p1]Marzena Kryszkiewicz, Henryk Rybinski, Katarzyna Cichon:
On Concise Representations of Frequent Patterns Admitting Negation. Advances in Machine Learning II 2010: 259-289 - [e3]Marzena Kryszkiewicz, Sergei A. Obiedkov:
Proceedings of the 7th International Conference on Concept Lattices and Their Applications, Sevilla, Spain, October 19-21, 2010. CEUR Workshop Proceedings 672, CEUR-WS.org 2010 [contents] - [e2]Marcin S. Szczuka, Marzena Kryszkiewicz, Sheela Ramanna, Richard Jensen, Qinghua Hu:
Rough Sets and Current Trends in Computing - 7th International Conference, RSCTC 2010, Warsaw, Poland, June 28-30,2010. Proceedings. Lecture Notes in Computer Science 6086, Springer 2010, ISBN 978-3-642-13528-6 [contents]
2000 – 2009
- 2009
- [c37]Marzena Kryszkiewicz:
Non-Derivable Item Set and Non-Derivable Literal Set Representations of Patterns Admitting Negation. DaWaK 2009: 138-150 - [c36]Marzena Kryszkiewicz:
Closures of Downward Closed Representations of Frequent Patterns. HAIS 2009: 104-112 - [c35]Marzena Kryszkiewicz:
Compressed Disjunction-Free Pattern Representation versus Essential Pattern Representation. IDEAL 2009: 350-358 - [r1]Marzena Kryszkiewicz:
Reasoning about Frequent Patterns with Negation. Encyclopedia of Data Warehousing and Mining 2009: 1667-1674 - 2008
- [j9]Marzena Kryszkiewicz, Piotr Lasek:
FUN: Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute. Trans. Rough Sets 9: 76-95 (2008) - 2007
- [c34]Henryk Rybinski, Marzena Kryszkiewicz, Grzegorz Protaziuk, Aleksandra Kontkiewicz, Katarzyna Marcinkowska, Alexandre Delteil:
Discovering Word Meanings Based on Frequent Termsets. MCD 2007: 82-92 - [c33]Marzena Kryszkiewicz:
Certain, Generalized Decision, and Membership Distribution Reducts Versus Functional Dependencies in Incomplete Systems. RSEISP 2007: 162-174 - [c32]Marzena Kryszkiewicz, Piotr Lasek:
Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute. RSEISP 2007: 320-331 - [c31]Grzegorz Protaziuk, Marzena Kryszkiewicz, Henryk Rybinski, Alexandre Delteil:
Discovering Compound and Proper Nouns. RSEISP 2007: 505-515 - [c30]Henryk Rybinski, Marzena Kryszkiewicz, Grzegorz Protaziuk, Adam Jakubowski, Alexandre Delteil:
Discovering Synonyms Based on Frequent Termsets. RSEISP 2007: 516-525 - [e1]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. Lecture Notes in Computer Science 4585, Springer 2007, ISBN 978-3-540-73450-5 [contents] - 2006
- [c29]Marzena Kryszkiewicz, Lukasz Skonieczny:
Hierarchical Document Clustering Using Frequent Closed Sets. Intelligent Information Systems 2006: 489-498 - [c28]Marzena Kryszkiewicz:
Generalized Disjunction-Free Representation of Frequents Patterns with at Most k Negations. PAKDD 2006: 468-472 - 2005
- [j8]Marzena Kryszkiewicz:
Generalized disjunction-free representation of frequent patterns with negation. J. Exp. Theor. Artif. Intell. 17(1-2): 63-82 (2005) - [c27]Marzena Kryszkiewicz:
Using Generators for Discovering Certain and Generalized Decision Rules. HIS 2005: 181-186 - [c26]Marzena Kryszkiewicz, Lukasz Skonieczny:
Faster Clustering with DBSCAN. Intelligent Information Systems 2005: 605-614 - [c25]Marzena Kryszkiewicz, Katarzyna Cichon:
Support Oriented Discovery of Generalized Disjunction-Free Representation of Frequent Patterns with Negation. PAKDD 2005: 672-682 - 2004
- [j7]Marzena Kryszkiewicz, Henryk Rybinski, Marcin Gajek:
Dataless Transitions Between Concise Representations of Frequent Patterns. J. Intell. Inf. Syst. 22(1): 41-70 (2004) - [j6]Marzena Kryszkiewicz, Katarzyna Cichon:
Towards Scalable Algorithms for Discovering Rough Set Reducts. Trans. Rough Sets 1: 120-143 (2004) - [c24]Marzena Kryszkiewicz, Katarzyna Cichon:
Scalable Methods of Discovering Rough Sets Reducts. Intelligent Information Systems 2004: 547-556 - [c23]Marzena Kryszkiewicz:
Reducing borders of k-disjunction free representations of frequent patterns. SAC 2004: 559-563 - [c22]Marzena Kryszkiewicz:
Upper Bound on the Length of Generalized Disjunction-Free Patterns. SSDBM 2004: 31-40 - 2003
- [j5]Marzena Kryszkiewicz:
Closed Set Based Discovery of Maximal Covering Rules. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 11(Supplement-1): 15-30 (2003) - 2002
- [c21]Marzena Kryszkiewicz:
Concise Representations of Association Rules. Pattern Detection and Discovery 2002: 92-109 - [c20]Marzena Kryszkiewicz, Marcin Gajek:
Why to Apply Generalized Disjunction-Free Generators Representation of Frequent Patterns? ISMIS 2002: 383-392 - [c19]Marzena Kryszkiewicz, Marcin Gajek:
Concise Representation of Frequent Patterns Based on Generalized Disjunction-Free Generators. PAKDD 2002: 159-171 - [c18]Marzena Kryszkiewicz:
Inferring Knowledge from Frequent Patterns. Soft-Ware 2002: 247-262 - 2001
- [j4]Marzena Kryszkiewicz:
Comparative study of alternative types of knowledge reduction in inconsistent systems. Int. J. Intell. Syst. 16(1): 105-120 (2001) - [c17]Marzena Kryszkiewicz:
Concise Representation of Frequent Patterns Based on Disjunction-Free Generators. ICDM 2001: 305-312 - [c16]Marzena Kryszkiewicz:
Closed Set Based Discovery of Representative Association Rules. IDA 2001: 350-359 - [c15]Marzena Kryszkiewicz:
Direct and Incremental Computing of Maximal Covering Rules. PAKDD 2001: 400-405 - 2000
- [c14]Marzena Kryszkiewicz:
Mining around Association and Representative Rules. ADBIS-DASFAA 2000: 117-127 - [c13]Marzena Kryszkiewicz, Henryk Rybinski:
Legitimate Approach to Association Rules under Incompleteness. ISMIS 2000: 505-514 - [c12]Marzena Kryszkiewicz:
Mining with Cover and Extension Operators. PKDD 2000: 476-482 - [c11]Marzena Kryszkiewicz:
Inducing Theory for the Rule Set. Rough Sets and Current Trends in Computing 2000: 391-398 - [c10]Marzena Kryszkiewicz:
Probabilistic Approach to Association Rules in Incomplete Databases. Web-Age Information Management 2000: 133-138
1990 – 1999
- 1999
- [j3]Marzena Kryszkiewicz:
Rules in Incomplete Information Systems. Inf. Sci. 113(3-4): 271-292 (1999) - [c9]Marzena Kryszkiewicz, Henryk Rybinski:
Incomplete Database Issues for Representative Association Rules. ISMIS 1999: 583-591 - [c8]Marzena Kryszkiewicz:
Association Rules in Incomplete Databases. PAKDD 1999: 84-93 - 1998
- [j2]Marzena Kryszkiewicz:
Rough Set Approach to Incomplete Information Systems. Inf. Sci. 112(1-4): 39-49 (1998) - [c7]Marzena Kryszkiewicz:
Representative Association Rules. PAKDD 1998: 198-209 - [c6]Marzena Kryszkiewicz:
Representative Association Rules and Minimum Condition Maximum Consequence Association Rules. PKDD 1998: 361-369 - [c5]Marzena Kryszkiewicz:
Fast Discovery of Representative Association Rules. Rough Sets and Current Trends in Computing 1998: 214-221 - 1997
- [c4]Marzena Kryszkiewicz:
Generalized Rules in Incomplete Information Systems. ISMIS 1997: 421-430 - [c3]Marzena Kryszkiewicz:
Generation of Rules from Incomplete Information Systems. PKDD 1997: 156-166 - 1996
- [j1]Marzena Kryszkiewicz, Henryk Rybinski:
Computation of Reducts of Composed Information Systems. Fundam. Informaticae 27(2/3): 183-195 (1996) - [c2]Marzena Kryszkiewicz, Henryk Rybinski:
Reducing Information Systems with Uncertain Attributes. ISMIS 1996: 285-294 - 1993
- [c1]Marzena Kryszkiewicz, Henryk Rybinski:
Finding Reducts in Composed Information Systems. RSKD 1993: 261-273
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
