Artur Bykowski

Jouni K. Seppänen

Jaakko Hollmén

Proceedings of the Database Support for Data Mining Applications: Discovering Knowledge with Inductive Queries, 2004

Integrity Constraints over Association Rules.

[BibT_eX]

[DOI]

Proceedings of the Database Support for Data Mining Applications: Discovering Knowledge with Inductive Queries, 2004

2003

DBC: a condensed representation of frequent patterns for efficient mining.

[BibT_eX]

[DOI]

Inf. Syst., 2003

Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2003

2002

Model-independent Bounding of the Supports of Boolean Formulae in Binary Data.

[BibT_eX]

[DOI]

Jouni K. Seppänen

Jaakko Hollmén

Proceedings of the First International Workshop on Inductive Databases, 2002

Association Maps as Integrity Constraints in Inductive Databases.

[BibT_eX]

[DOI]

Proceedings of the First International Workshop on Inductive Databases, 2002

2001

A condensed representation to find frequent patterns.

[BibT_eX]

[DOI]

Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2001

2000

Approximation of Frequency Queris by Means of Free-Sets.

[BibT_eX]

[DOI]

Proceedings of the Principles of Data Mining and Knowledge Discovery, 2000

Frequent Closures as a Concise Representation for Binary Data Mining.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Discovery and Data Mining, 2000

Towards the Tractable Discovery of Association Rules with Negations.

[BibT_eX]

[DOI]

Baptiste Jeudy

Proceedings of the Flexible Query Answering Systems, 2000

Association Rule Discovery in Highly-Correlated Data: a Case Study in Web Usage Mining.

[BibT_eX]