How to Quickly Find a Witness

Daniel Kifer; Johannes Gehrke; Cristian Bucila; Walker White

doi:10.1145/773153.773180

How to Quickly Find a Witness

Daniel Kifer, Johannes Gehrke, Cristian Bucila, Walker White

Research output: Contribution to conference › Paper › peer-review

14 Scopus citations

Abstract

The subfield of itemset mining is essentially a collection of algorithms. Whenever anew type of constraint is discovered, a specialized algorithm is proposed to handle it. All of these algorithms are highly tuned to take advantage of the unique properties of their associated constraints, and so they are not very compatible with other constraints. In this paper we present a more unified view of mining constrained itemsets such that most existing algorithms can be easily extended to handle constraints for which they were not designed a-priori. We apply this technique to mining itemsets with restrictions on their variance - a problem that has been open for several years in the data mining community.

Original language	English (US)
Pages	272-283
Number of pages	12
DOIs	https://doi.org/10.1145/773153.773180
State	Published - 2003
Event	Twenty second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2003 - San Diego, CA, United States Duration: Jun 9 2003 → Jun 11 2003

Other

Other	Twenty second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2003
Country/Territory	United States
City	San Diego, CA
Period	6/9/03 → 6/11/03

All Science Journal Classification (ASJC) codes

Software
Information Systems
Hardware and Architecture

Access to Document

10.1145/773153.773180

Cite this

@conference{75bf252c1a6d448f8637029f4e54d8b5,

title = "How to Quickly Find a Witness",

abstract = "The subfield of itemset mining is essentially a collection of algorithms. Whenever anew type of constraint is discovered, a specialized algorithm is proposed to handle it. All of these algorithms are highly tuned to take advantage of the unique properties of their associated constraints, and so they are not very compatible with other constraints. In this paper we present a more unified view of mining constrained itemsets such that most existing algorithms can be easily extended to handle constraints for which they were not designed a-priori. We apply this technique to mining itemsets with restrictions on their variance - a problem that has been open for several years in the data mining community.",

author = "Daniel Kifer and Johannes Gehrke and Cristian Bucila and Walker White",

year = "2003",

doi = "10.1145/773153.773180",

language = "English (US)",

pages = "272--283",

note = "Twenty second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2003 ; Conference date: 09-06-2003 Through 11-06-2003",

}

TY - CONF

T1 - How to Quickly Find a Witness

AU - Kifer, Daniel

AU - Gehrke, Johannes

AU - Bucila, Cristian

AU - White, Walker

PY - 2003

Y1 - 2003

N2 - The subfield of itemset mining is essentially a collection of algorithms. Whenever anew type of constraint is discovered, a specialized algorithm is proposed to handle it. All of these algorithms are highly tuned to take advantage of the unique properties of their associated constraints, and so they are not very compatible with other constraints. In this paper we present a more unified view of mining constrained itemsets such that most existing algorithms can be easily extended to handle constraints for which they were not designed a-priori. We apply this technique to mining itemsets with restrictions on their variance - a problem that has been open for several years in the data mining community.

AB - The subfield of itemset mining is essentially a collection of algorithms. Whenever anew type of constraint is discovered, a specialized algorithm is proposed to handle it. All of these algorithms are highly tuned to take advantage of the unique properties of their associated constraints, and so they are not very compatible with other constraints. In this paper we present a more unified view of mining constrained itemsets such that most existing algorithms can be easily extended to handle constraints for which they were not designed a-priori. We apply this technique to mining itemsets with restrictions on their variance - a problem that has been open for several years in the data mining community.

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

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

U2 - 10.1145/773153.773180

DO - 10.1145/773153.773180

M3 - Paper

AN - SCOPUS:1142299758

SP - 272

EP - 283

T2 - Twenty second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2003

Y2 - 9 June 2003 through 11 June 2003

ER -

How to Quickly Find a Witness

Abstract

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this