Approximate frequent itemset mining in the presence of random noise

Hong Cheng, Philip S. Yu, Jiawei Han

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Frequent itemset mining has been a focused theme in data mining research and an important first step in the analysis of data arising in a broad range of applications. The traditional exact model for frequent itemset requires that every item occur in each supporting transaction. However, real application data is usually subject to random noise or measurement error, which poses new challenges for the efficient discovery of frequent itemset from the noisy data. Mining approximate frequent itemset in the presence of noise involves two key issues: the definition of a noise-tolerant mining model and the design of an efficient mining algorithm. In this chapter, we will give an overview of the approximate itemset mining algorithms in the presence of random noise and examine several noise-tolerant mining approaches.

Original languageEnglish (US)
Title of host publicationSoft Computing for Knowledge Discovery and Data Mining
PublisherSpringer US
Pages363-389
Number of pages27
ISBN (Print)9780387699349
DOIs
StatePublished - Dec 1 2008

Fingerprint

Measurement errors
Data mining

Keywords

  • approximate frequent itemset
  • core pattern recovery
  • error-tolerant itemset

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Cheng, H., Yu, P. S., & Han, J. (2008). Approximate frequent itemset mining in the presence of random noise. In Soft Computing for Knowledge Discovery and Data Mining (pp. 363-389). Springer US. https://doi.org/10.1007/978-0-387-69935-6_15

Approximate frequent itemset mining in the presence of random noise. / Cheng, Hong; Yu, Philip S.; Han, Jiawei.

Soft Computing for Knowledge Discovery and Data Mining. Springer US, 2008. p. 363-389.

Research output: Chapter in Book/Report/Conference proceedingChapter

Cheng, H, Yu, PS & Han, J 2008, Approximate frequent itemset mining in the presence of random noise. in Soft Computing for Knowledge Discovery and Data Mining. Springer US, pp. 363-389. https://doi.org/10.1007/978-0-387-69935-6_15
Cheng H, Yu PS, Han J. Approximate frequent itemset mining in the presence of random noise. In Soft Computing for Knowledge Discovery and Data Mining. Springer US. 2008. p. 363-389 https://doi.org/10.1007/978-0-387-69935-6_15
Cheng, Hong ; Yu, Philip S. ; Han, Jiawei. / Approximate frequent itemset mining in the presence of random noise. Soft Computing for Knowledge Discovery and Data Mining. Springer US, 2008. pp. 363-389
@inbook{25b03a8adf0e473c87ff7a2c41b5443e,
title = "Approximate frequent itemset mining in the presence of random noise",
abstract = "Frequent itemset mining has been a focused theme in data mining research and an important first step in the analysis of data arising in a broad range of applications. The traditional exact model for frequent itemset requires that every item occur in each supporting transaction. However, real application data is usually subject to random noise or measurement error, which poses new challenges for the efficient discovery of frequent itemset from the noisy data. Mining approximate frequent itemset in the presence of noise involves two key issues: the definition of a noise-tolerant mining model and the design of an efficient mining algorithm. In this chapter, we will give an overview of the approximate itemset mining algorithms in the presence of random noise and examine several noise-tolerant mining approaches.",
keywords = "approximate frequent itemset, core pattern recovery, error-tolerant itemset",
author = "Hong Cheng and Yu, {Philip S.} and Jiawei Han",
year = "2008",
month = "12",
day = "1",
doi = "10.1007/978-0-387-69935-6_15",
language = "English (US)",
isbn = "9780387699349",
pages = "363--389",
booktitle = "Soft Computing for Knowledge Discovery and Data Mining",
publisher = "Springer US",

}

TY - CHAP

T1 - Approximate frequent itemset mining in the presence of random noise

AU - Cheng, Hong

AU - Yu, Philip S.

AU - Han, Jiawei

PY - 2008/12/1

Y1 - 2008/12/1

N2 - Frequent itemset mining has been a focused theme in data mining research and an important first step in the analysis of data arising in a broad range of applications. The traditional exact model for frequent itemset requires that every item occur in each supporting transaction. However, real application data is usually subject to random noise or measurement error, which poses new challenges for the efficient discovery of frequent itemset from the noisy data. Mining approximate frequent itemset in the presence of noise involves two key issues: the definition of a noise-tolerant mining model and the design of an efficient mining algorithm. In this chapter, we will give an overview of the approximate itemset mining algorithms in the presence of random noise and examine several noise-tolerant mining approaches.

AB - Frequent itemset mining has been a focused theme in data mining research and an important first step in the analysis of data arising in a broad range of applications. The traditional exact model for frequent itemset requires that every item occur in each supporting transaction. However, real application data is usually subject to random noise or measurement error, which poses new challenges for the efficient discovery of frequent itemset from the noisy data. Mining approximate frequent itemset in the presence of noise involves two key issues: the definition of a noise-tolerant mining model and the design of an efficient mining algorithm. In this chapter, we will give an overview of the approximate itemset mining algorithms in the presence of random noise and examine several noise-tolerant mining approaches.

KW - approximate frequent itemset

KW - core pattern recovery

KW - error-tolerant itemset

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

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

U2 - 10.1007/978-0-387-69935-6_15

DO - 10.1007/978-0-387-69935-6_15

M3 - Chapter

AN - SCOPUS:65449157912

SN - 9780387699349

SP - 363

EP - 389

BT - Soft Computing for Knowledge Discovery and Data Mining

PB - Springer US

ER -