• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 5 of 5

An Efficient Algorithm for Mining Erasable Itemsets

by Zhihong Deng, Xiaoran Xu
"... Abstract. Mining erasable itemsets first introduced in 2009 is one of new emerging data mining tasks. In this paper, we present a new data representation called PID_list, which keeps track of the id_nums (identification number) of products that include an itemset. Based on PID_list, we propose a new ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract. Mining erasable itemsets first introduced in 2009 is one of new emerging data mining tasks. In this paper, we present a new data representation called PID_list, which keeps track of the id_nums (identification number) of products that include an itemset. Based on PID_list, we propose a

An Incremental Approach for Mining Erasable Itemsets

by Suchi Shah, Jayna Shah
"... A factory has a production plan to produce products which are created from number of components and thus create profit. During financial crisis, the factory cannot afford to purchase all the necessary items as usual. Mining of erasable itemsets finds the itemsets which can be eliminated and do not g ..."
Abstract - Add to MetaCart
A factory has a production plan to produce products which are created from number of components and thus create profit. During financial crisis, the factory cannot afford to purchase all the necessary items as usual. Mining of erasable itemsets finds the itemsets which can be eliminated and do

An Efficient Algorithm for Mining Erasable Itemsets Using the Difference of NC-Sets

by Tuong Le, Ho Chi, Bay Vo, Ho Chi, Frans Coenen
"... Abstract—This paper proposes an improved version of the MERIT algorithm, dMERIT+, for mining all “erasable itemsets”. We first establish an algorithm MERIT+, a revised version of MERIT, which is then used as the foundation for dMERIT+. The proposed algorithm uses: a weight index, a hash table and th ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract—This paper proposes an improved version of the MERIT algorithm, dMERIT+, for mining all “erasable itemsets”. We first establish an algorithm MERIT+, a revised version of MERIT, which is then used as the foundation for dMERIT+. The proposed algorithm uses: a weight index, a hash table

A Parallel and Distributed Method to mine Erasable Itemsets from

by High Utility Patterns, Ms. Ruchi Patel
"... High utility pattern mining becomes a very important research issue in data mining by considering the non-binary frequency values of items in transactions and different profit values for each item. These profit values can be computed efficiently inorder to determine the gain of an itemset which in-t ..."
Abstract - Add to MetaCart
-turn will help in production planning of any company. This gain value is needed to prune some of the irrelevant items from the high utility patterns at the time of economic crisis through erasable itemset mining. But all of the existing erasable itemset mining algorithms are based on centralized database

ISSN 22773061 712 | P a g e J u n e 1 5, 2 0 1 3 Improving Efficiency of META Algorithm Using Record Reduction

by Shweta Dr. Kanwal Garg
"... Abstract — Erasable Itemset Mining is the key approach of data mining in production planning. The erasable itemset mining is the process of finding erasable itemsets that satisfy the constraint i.e. user defined threshold. Efficient algorithm to mine erasable itemsets is extremely important in data ..."
Abstract - Add to MetaCart
Abstract — Erasable Itemset Mining is the key approach of data mining in production planning. The erasable itemset mining is the process of finding erasable itemsets that satisfy the constraint i.e. user defined threshold. Efficient algorithm to mine erasable itemsets is extremely important in data
Results 1 - 5 of 5
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University