Marzena Kryszkiewicz

According to our database1, Marzena Kryszkiewicz authored at least 71 papers between 1993 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Air pollution prediction with clustering-based ensemble of evolving spiking neural networks and a case study for London area.
Environmental Modelling and Software, 2019

Discovery of closed spatio-temporal sequential patterns from event data.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 23rd International Conference KES-2019, 2019

Fast Discovery of Generalized Sequential Patterns.
Proceedings of the Intelligent Methods and Big Data in Industrial Applications., 2019

2018
Representative Rule Templates for Association Rules Satisfying Multiple Canonical Evaluation Criteria.
Proceedings of the Intelligent Information and Database Systems - 10th Asian Conference, 2018

2017
ISMIS 2017 Data Mining Competition: Trading Based on Recommendations.
Proceedings of the Foundations of Intelligent Systems - 23rd International Symposium, 2017

Virtual Balancing of Decision Classes.
Proceedings of the Intelligent Information and Database Systems - 9th Asian Conference, 2017

2016
Dependence Factor as a Rule Evaluation Measure.
Proceedings of the Challenges in Computational Statistics and Data Mining, 2016

ACBC-Adequate Association and Decision Rules Versus Key Generators and Rough Sets Approximations.
Fundam. Inform., 2016

Explicit Contrast Patterns Versus Minimal Jumping Emerging Patterns for Lazy Classification in High Dimensional Data.
Proceedings of the Trends in Applied Knowledge-Based Systems and Data Science, 2016

A Lossless Representation for Association Rules Satisfying Multiple Evaluation Criteria.
Proceedings of the Intelligent Information and Database Systems - 8th Asian Conference, 2016

2015
Dependence Factor for Association Rules.
Proceedings of the Intelligent Information and Database Systems - 7th Asian Conference, 2015

2014
Basic Triangle Inequality Approach Versus Metric VP-Tree and Projection in Determining Euclidean and Cosine Neighbors.
Proceedings of the Intelligent Tools for Building a Scientific Information Platform: From Research to Implementation, 2014

Efficient Search of Cosine and Tanimoto Near Duplicates among Vectors with Domains Consisting of Zero, a Positive Number and a Negative Number.
Proceedings of the Modern Advances in Applied Intelligence, 2014

Using Non-Zero Dimensions and Lengths of Vectors for the Tanimoto Similarity Search among Real Valued Vectors.
Proceedings of the Intelligent Information and Database Systems - 6th Asian Conference, 2014

2013
Determining Cosine Similarity Neighborhoods by Means of the Euclidean Distance.
Proceedings of the Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, 2013

Using Non-Zero Dimensions for the Cosine and Tanimoto Similarity Search Among Real Valued Vectors.
Fundam. Inform., 2013

On Cosine and Tanimoto Near Duplicates Search among Vectors with Domains Consisting of Zero, a Positive Number and a Negative Number.
Proceedings of the Flexible Query Answering Systems - 10th International Conference, 2013

Bounds on Lengths of Real Valued Vectors Similar with Regard to the Tanimoto Similarity.
Proceedings of the Intelligent Information and Database Systems - 5th Asian Conference, 2013

2012
Preface.
Fundam. Inform., 2012

The Triangle Inequality versus Projection onto a Dimension in Determining Cosine Similarity Neighborhoods of Non-negative Vectors.
Proceedings of the Rough Sets and Current Trends in Computing, 2012

Efficient Determination of Binary Non-negative Vector Neighbors with Regard to Cosine Similarity.
Proceedings of the Advanced Research in Applied Artificial Intelligence, 2012

2010
On Concise Representations of Frequent Patterns Admitting Negation.
Proceedings of the Advances in Machine Learning II, 2010

TI-DBSCAN: Clustering with DBSCAN by Means of the Triangle Inequality.
Proceedings of the Rough Sets and Current Trends in Computing, 2010

A Neighborhood-Based Clustering by Means of the Triangle Inequality.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2010

2009
Reasoning about Frequent Patterns with Negation.
Proceedings of the Encyclopedia of Data Warehousing and Mining, Second Edition (4 Volumes), 2009

Compressed Disjunction-Free Pattern Representation versus Essential Pattern Representation.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2009

Closures of Downward Closed Representations of Frequent Patterns.
Proceedings of the Hybrid Artificial Intelligence Systems, 4th International Conference, 2009

Non-Derivable Item Set and Non-Derivable Literal Set Representations of Patterns Admitting Negation.
Proceedings of the Data Warehousing and Knowledge Discovery, 11th International Conference, 2009

2008
FUN: Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute.
Trans. Rough Sets, 2008

2007
Discovering Synonyms Based on Frequent Termsets.
Proceedings of the Rough Sets and Intelligent Systems Paradigms, International Conference, 2007

Discovering Compound and Proper Nouns.
Proceedings of the Rough Sets and Intelligent Systems Paradigms, International Conference, 2007

Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute.
Proceedings of the Rough Sets and Intelligent Systems Paradigms, International Conference, 2007

Certain, Generalized Decision, and Membership Distribution Reducts Versus Functional Dependencies in Incomplete Systems.
Proceedings of the Rough Sets and Intelligent Systems Paradigms, International Conference, 2007

Discovering Word Meanings Based on Frequent Termsets.
Proceedings of the Mining Complex Data, ECML/PKDD 2007 Third International Workshop, 2007

2006
Generalized Disjunction-Free Representation of Frequents Patterns with at Most k Negations.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2006

Hierarchical Document Clustering Using Frequent Closed Sets.
Proceedings of the Intelligent Information Processing and Web Mining, 2006

2005
Generalized disjunction-free representation of frequent patterns with negation.
J. Exp. Theor. Artif. Intell., 2005

Support Oriented Discovery of Generalized Disjunction-Free Representation of Frequent Patterns with Negation.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2005

Faster Clustering with DBSCAN.
Proceedings of the Intelligent Information Processing and Web Mining, 2005

Using Generators for Discovering Certain and Generalized Decision Rules.
Proceedings of the 5th International Conference on Hybrid Intelligent Systems (HIS 2005), 2005

2004
Towards Scalable Algorithms for Discovering Rough Set Reducts.
, 2004

Dataless Transitions Between Concise Representations of Frequent Patterns.
J. Intell. Inf. Syst., 2004

Upper Bound on the Length of Generalized Disjunction-Free Patterns.
Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), 2004

Reducing borders of k-disjunction free representations of frequent patterns.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

Scalable Methods of Discovering Rough Sets Reducts.
Proceedings of the Intelligent Information Processing and Web Mining, 2004

2003
Closed Set Based Discovery of Maximal Covering Rules.
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2003

2002
Inferring Knowledge from Frequent Patterns.
Proceedings of the Soft-Ware 2002: Computing in an Imperfect World, 2002

Concise Representation of Frequent Patterns Based on Generalized Disjunction-Free Generators.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2002

Why to Apply Generalized Disjunction-Free Generators Representation of Frequent Patterns?
Proceedings of the Foundations of Intelligent Systems, 13th International Symposium, 2002

Concise Representations of Association Rules.
Proceedings of the Pattern Detection and Discovery, 2002

2001
Comparative study of alternative types of knowledge reduction in inconsistent systems.
Int. J. Intell. Syst., 2001

Direct and Incremental Computing of Maximal Covering Rules.
Proceedings of the Knowledge Discovery and Data Mining, 2001

Closed Set Based Discovery of Representative Association Rules.
Proceedings of the Advances in Intelligent Data Analysis, 4th International Conference, 2001

Concise Representation of Frequent Patterns Based on Disjunction-Free Generators.
Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November, 2001

2000
Probabilistic Approach to Association Rules in Incomplete Databases.
Proceedings of the Web-Age Information Management, First International Conference, 2000

Inducing Theory for the Rule Set.
Proceedings of the Rough Sets and Current Trends in Computing, 2000

Mining with Cover and Extension Operators.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 2000

Legitimate Approach to Association Rules under Incompleteness.
Proceedings of the Foundations of Intelligent Systems, 12th International Symposium, 2000

Mining around Association and Representative Rules.
Proceedings of the Current Issues in Databases and Information Systems, 2000

1999
Rules in Incomplete Information Systems.
Inf. Sci., 1999

Association Rules in Incomplete Databases.
Proceedings of the Methodologies for Knowledge Discovery and Data Mining, 1999

Incomplete Database Issues for Representative Association Rules.
Proceedings of the Foundations of Intelligent Systems, 11th International Symposium, 1999

1998
Rough Set Approach to Incomplete Information Systems.
Inf. Sci., 1998

Fast Discovery of Representative Association Rules.
Proceedings of the Rough Sets and Current Trends in Computing, 1998

Representative Association Rules and Minimum Condition Maximum Consequence Association Rules.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 1998

Representative Association Rules.
Proceedings of the Research and Development in Knowledge Discovery and Data Mining, 1998

1997
Generation of Rules from Incomplete Information Systems.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 1997

Generalized Rules in Incomplete Information Systems.
Proceedings of the Foundations of Intelligent Systems, 10th International Symposium, 1997

1996
Computation of Reducts of Composed Information Systems.
Fundam. Inform., 1996

Reducing Information Systems with Uncertain Attributes.
Proceedings of the Foundations of Intelligent Systems, 9th International Symposium, 1996

1993
Finding Reducts in Composed Information Systems.
Proceedings of the Rough Sets, 1993


  Loading...