How to Quickly Find a Witness

Daniel Kifer, Johannes Gehrke, Cristian Bucila, Walker White

Research output: Contribution to conferencePaperpeer-review

12 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 languageEnglish (US)
Pages272-283
Number of pages12
DOIs
StatePublished - Jan 1 2003
EventTwenty second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2003 - San Diego, CA, United States
Duration: Jun 9 2003Jun 11 2003

Other

OtherTwenty second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2003
CountryUnited States
CitySan Diego, CA
Period6/9/036/11/03

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'How to Quickly Find a Witness'. Together they form a unique fingerprint.

Cite this