Formal concept sampling for counting and threshold-free local pattern mining

Mario Boley; Thomas Gärtner; Henrik Grosskreutz

Formal concept sampling for counting and threshold-free local pattern mining

Mario Boley, Thomas Gärtner, Henrik Grosskreutz

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Other › peer-review

Abstract

We describe a Metropolis-Hastings algorithm for sampling formal concepts, i.e., closed (item-) sets, according to any desired strictly positive distribution. Important applications are (a) estimating the number of all formal concepts as well as (b) discovering any number of interesting, non-redundant, and representative local patterns. Setting (a) can be used for estimating the runtime of algorithms examining all formal concepts. An application of setting (b) is the construction of data mining systems that do not require any user-specified threshold like minimum frequency or confidence.

Original language	English
Title of host publication	Proceedings of the 10th SIAM International Conference on Data Mining, SDM 2010
Pages	177-188
Number of pages	12
Publication status	Published - 1 Dec 2010
Externally published	Yes
Event	SIAM International Conference on Data Mining 2010 - Columbus, United States of America Duration: 29 Apr 2010 → 1 May 2010 Conference number: 10th

Conference

Conference	SIAM International Conference on Data Mining 2010
Abbreviated title	SDM 2010
Country	United States of America
City	Columbus
Period	29/04/10 → 1/05/10

Access to Document

Link to publication in Scopus

Cite this

@inproceedings{754518bf02ea4f86bc827e996879184c,

title = "Formal concept sampling for counting and threshold-free local pattern mining",

abstract = "We describe a Metropolis-Hastings algorithm for sampling formal concepts, i.e., closed (item-) sets, according to any desired strictly positive distribution. Important applications are (a) estimating the number of all formal concepts as well as (b) discovering any number of interesting, non-redundant, and representative local patterns. Setting (a) can be used for estimating the runtime of algorithms examining all formal concepts. An application of setting (b) is the construction of data mining systems that do not require any user-specified threshold like minimum frequency or confidence.",

author = "Mario Boley and Thomas G{\"a}rtner and Henrik Grosskreutz",

year = "2010",

month = dec,

day = "1",

language = "English",

pages = "177--188",

booktitle = "Proceedings of the 10th SIAM International Conference on Data Mining, SDM 2010",

note = "SIAM International Conference on Data Mining 2010, SDM 2010 ; Conference date: 29-04-2010 Through 01-05-2010",

}

TY - GEN

T1 - Formal concept sampling for counting and threshold-free local pattern mining

AU - Boley, Mario

AU - Gärtner, Thomas

AU - Grosskreutz, Henrik

N1 - Conference code: 10th

PY - 2010/12/1

Y1 - 2010/12/1

N2 - We describe a Metropolis-Hastings algorithm for sampling formal concepts, i.e., closed (item-) sets, according to any desired strictly positive distribution. Important applications are (a) estimating the number of all formal concepts as well as (b) discovering any number of interesting, non-redundant, and representative local patterns. Setting (a) can be used for estimating the runtime of algorithms examining all formal concepts. An application of setting (b) is the construction of data mining systems that do not require any user-specified threshold like minimum frequency or confidence.

AB - We describe a Metropolis-Hastings algorithm for sampling formal concepts, i.e., closed (item-) sets, according to any desired strictly positive distribution. Important applications are (a) estimating the number of all formal concepts as well as (b) discovering any number of interesting, non-redundant, and representative local patterns. Setting (a) can be used for estimating the runtime of algorithms examining all formal concepts. An application of setting (b) is the construction of data mining systems that do not require any user-specified threshold like minimum frequency or confidence.

UR - http://www.scopus.com/inward/record.url?scp=80052655684&partnerID=8YFLogxK

M3 - Conference Paper

AN - SCOPUS:80052655684

SP - 177

EP - 188

BT - Proceedings of the 10th SIAM International Conference on Data Mining, SDM 2010

T2 - SIAM International Conference on Data Mining 2010

Y2 - 29 April 2010 through 1 May 2010

ER -