getCITED   
  Home     Search     Add Content     Reports     Help  
Edit Publication | Edit Contributors | Delete Publication | Edit References | Edit Citations
Add to Bookstack | Show Bookstack | Change Bookstack

Frequent Itemset mining over transactional data streams using Item-Order-Tree

Post a Comment
CONTRIBUTORS:
  Author Pramod S.
  Author O.P. Vyas
JOURNAL:
  International Journal on Computer Science and Engineering (IJCSE), 2(8), 2598 - 2601.
YEAR: 2010
PUB TYPE: Journal Article
SUBJECT(S): Frequent Itemset, Freequent Itemset Mining , Online Data Mining, Item-Order-Tree
DISCIPLINE: Computer Science
HTTP: http://www.enggjournals.com/ijcse/doc/IJCSE10-02-08-138.pdf
LANGUAGE: English
PUB ID: 103-488-807 (Last edited on 2011/06/13 22:19:22 GMT-6)
SPONSOR(S):
 
ABSTRACT:
The association rule mining is one of the important area for research in data mining. In association rule mining online association rule mining is one of the hottest area due to the reason that the knowledge embedded in the data stream is more likely to be changed as time goes by. This paper proposes an algorithm as well as a data structure for online data mining. In this method the pruning in the data structure as well as the frequent itemset generation will be based on the request. The data structure which we introducing will have the capability to maintain the transactions in the sorted order. Every transaction can be extracted from the item-Order-Tree as by doing the traversal in depth. Frequent itemset can be generated as by do the traversal from the parent node that the user requested for. This ItemOrder-Tree improves the performance of the online association rule mining.
STATISTICS
Click on # to view
 Citations  
 References  
 Comments  
 Quality      0/0.00 
 Interest      0/0.00 
 View(er)s   1/92 
Quality
  N/A
High
  7
  6
  5
  4
  3
  2
  1
Low
Interest
  N/A
High
  7
  6
  5
  4
  3
  2
  1
Low
Prev | Next

    ABOUT getCITED   |    CONTACT US   |    USER INFO   |    PREFERENCES   |    PRIVACY   |    LOG IN   
Comments? Suggestions? Send them to feedback@getCITED.org.

Copyright © 2000-2013 getCITED Inc. All Rights Reserved.