Minimal k-free representations of frequent sets

T. Calders; B. Goethals

doi:10.1007/978-3-540-39804-2_9

Minimal k-free representations of frequent sets

T. Calders, B. Goethals

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

32 Citations (Scopus)

Abstract

Due to the potentially immense amount of frequent sets that can be generated from transactional databases, recent studies have demonstrated the need for concise representations of all frequent sets. These studies resulted in several successful algorithms that only generate a lossless subset of the frequent sets. In this paper, we present a unifying framework encapsulating most known concise representations. Because of the deeper understanding of the different proposals thus obtained, we are able to provide new, provably more concise, representations. These theoretical results are supported by several experiments showing the practical applicability.

Original language	English
Title of host publication	Knowledge Discovery in Databases : PKDD 2003 (Proceedings 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, Cavtat-Dubrovnik, Croatia, September 22-26, 2003)
Editors	N. Lavrac, D. Gamberger, H. Blockeel, L. Todorovski
Place of Publication	Berlin
Publisher	Springer
Pages	71-82
ISBN (Print)	3-540-20085-1
DOIs	https://doi.org/10.1007/978-3-540-39804-2_9
Publication status	Published - 2003

Publication series

Name	Lecture Notes in Computer Science
Volume	2838
ISSN (Print)	0302-9743

Access to Document

10.1007/978-3-540-39804-2_9

Cite this

Calders, T., & Goethals, B. (2003). Minimal k-free representations of frequent sets. In N. Lavrac, D. Gamberger, H. Blockeel, & L. Todorovski (Eds.), Knowledge Discovery in Databases : PKDD 2003 (Proceedings 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, Cavtat-Dubrovnik, Croatia, September 22-26, 2003) (pp. 71-82). (Lecture Notes in Computer Science; Vol. 2838). Springer. https://doi.org/10.1007/978-3-540-39804-2_9

Calders, T. ; Goethals, B. / Minimal k-free representations of frequent sets. Knowledge Discovery in Databases : PKDD 2003 (Proceedings 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, Cavtat-Dubrovnik, Croatia, September 22-26, 2003). editor / N. Lavrac ; D. Gamberger ; H. Blockeel ; L. Todorovski. Berlin : Springer, 2003. pp. 71-82 (Lecture Notes in Computer Science).

@inproceedings{6ff435292f0b41eab3cebaa2be636b25,

title = "Minimal k-free representations of frequent sets",

abstract = "Due to the potentially immense amount of frequent sets that can be generated from transactional databases, recent studies have demonstrated the need for concise representations of all frequent sets. These studies resulted in several successful algorithms that only generate a lossless subset of the frequent sets. In this paper, we present a unifying framework encapsulating most known concise representations. Because of the deeper understanding of the different proposals thus obtained, we are able to provide new, provably more concise, representations. These theoretical results are supported by several experiments showing the practical applicability.",

author = "T. Calders and B. Goethals",

year = "2003",

doi = "10.1007/978-3-540-39804-2_9",

language = "English",

isbn = "3-540-20085-1",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "71--82",

editor = "N. Lavrac and D. Gamberger and H. Blockeel and L. Todorovski",

booktitle = "Knowledge Discovery in Databases : PKDD 2003 (Proceedings 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, Cavtat-Dubrovnik, Croatia, September 22-26, 2003)",

address = "Germany",

}

Calders, T & Goethals, B 2003, Minimal k-free representations of frequent sets. in N Lavrac, D Gamberger, H Blockeel & L Todorovski (eds), Knowledge Discovery in Databases : PKDD 2003 (Proceedings 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, Cavtat-Dubrovnik, Croatia, September 22-26, 2003). Lecture Notes in Computer Science, vol. 2838, Springer, Berlin, pp. 71-82. https://doi.org/10.1007/978-3-540-39804-2_9

Minimal k-free representations of frequent sets. / Calders, T.; Goethals, B.
Knowledge Discovery in Databases : PKDD 2003 (Proceedings 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, Cavtat-Dubrovnik, Croatia, September 22-26, 2003). ed. / N. Lavrac; D. Gamberger; H. Blockeel; L. Todorovski. Berlin: Springer, 2003. p. 71-82 (Lecture Notes in Computer Science; Vol. 2838).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Minimal k-free representations of frequent sets

AU - Calders, T.

AU - Goethals, B.

PY - 2003

Y1 - 2003

N2 - Due to the potentially immense amount of frequent sets that can be generated from transactional databases, recent studies have demonstrated the need for concise representations of all frequent sets. These studies resulted in several successful algorithms that only generate a lossless subset of the frequent sets. In this paper, we present a unifying framework encapsulating most known concise representations. Because of the deeper understanding of the different proposals thus obtained, we are able to provide new, provably more concise, representations. These theoretical results are supported by several experiments showing the practical applicability.

AB - Due to the potentially immense amount of frequent sets that can be generated from transactional databases, recent studies have demonstrated the need for concise representations of all frequent sets. These studies resulted in several successful algorithms that only generate a lossless subset of the frequent sets. In this paper, we present a unifying framework encapsulating most known concise representations. Because of the deeper understanding of the different proposals thus obtained, we are able to provide new, provably more concise, representations. These theoretical results are supported by several experiments showing the practical applicability.

U2 - 10.1007/978-3-540-39804-2_9

DO - 10.1007/978-3-540-39804-2_9

M3 - Conference contribution

SN - 3-540-20085-1

T3 - Lecture Notes in Computer Science

SP - 71

EP - 82

BT - Knowledge Discovery in Databases : PKDD 2003 (Proceedings 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, Cavtat-Dubrovnik, Croatia, September 22-26, 2003)

A2 - Lavrac, N.

A2 - Gamberger, D.

A2 - Blockeel, H.

A2 - Todorovski, L.

PB - Springer

CY - Berlin

ER -

Calders T, Goethals B. Minimal k-free representations of frequent sets. In Lavrac N, Gamberger D, Blockeel H, Todorovski L, editors, Knowledge Discovery in Databases : PKDD 2003 (Proceedings 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, Cavtat-Dubrovnik, Croatia, September 22-26, 2003). Berlin: Springer. 2003. p. 71-82. (Lecture Notes in Computer Science). doi: 10.1007/978-3-540-39804-2_9

Minimal k-free representations of frequent sets

Abstract

Publication series

Access to Document

Fingerprint

Cite this