Mining erasable itemsets

In this paper, we introduce a new kind of mining problem - mining erasable itemsets, which is derived from planning products of the manufacturing industry. For this problem, we first present the formal definition of mining erasable itemsets and discuss some basic properties of the problem. Based on...

Full description

Saved in:
Bibliographic Details
Published in2009 International Conference on Machine Learning and Cybernetics Vol. 1; pp. 67 - 73
Main Authors Zhi-Hong Deng, Guo-Dong Fang, Zhong-Hui Wang, Xiao-Ran Xu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2009
Subjects
Cybernetics
Data mining
Forward contracts
Itemsets
Machine learning
Manufacturing
META
Mining erasable itemsets
Mining industry
Mining problem
Pattern analysis
Production facilities
Online AccessGet full text

Cover

More Information
Summary:In this paper, we introduce a new kind of mining problem - mining erasable itemsets, which is derived from planning products of the manufacturing industry. For this problem, we first present the formal definition of mining erasable itemsets and discuss some basic properties of the problem. Based on our analyses, we propose an efficient algorithm, META, for mining erasable itemsets. For evaluating META algorithm, we built three synthetic product databases. The results of applying META algorithm to these synthetic databases show its effectiveness.
ISBN:9781424437023
1424437024
ISSN:2160-133X
DOI:10.1109/ICMLC.2009.5212520