A dynamic approach for discovering maximal frequent itemsets

M. Geetha; R. J. D'Souza

doi:10.1109/ICCET.2009.153

A dynamic approach for discovering maximal frequent itemsets

M. Geetha, R. J. D'Souza

Department of Computer Science and Engineering, Manipal Institute of Technology, Manipal

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We present a novel method, which reads the database at regular intervals as in Dynamic Itemsets Counting Technique and creates a tree called Dynamic Itemset Tree containing items which may be frequent, potentially frequent and infrequent. This algorithm requires less time to discover all maximal frequent itemsets since it involves a method for reducing the size of the database. This method prunes the transactions and items of the transactions which are not of our interest after every scan of the database. Also, this method is independent of the order of the items.

Original language	English
Title of host publication	Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009
Pages	62-66
Number of pages	5
Volume	2
DOIs	https://doi.org/10.1109/ICCET.2009.153
Publication status	Published - 01-06-2009

All Science Journal Classification (ASJC) codes

Computer Science Applications
Software

Access to Document

10.1109/ICCET.2009.153

Cite this

@inproceedings{2a5c658d23404c9c8900ae5e4205871c,

title = "A dynamic approach for discovering maximal frequent itemsets",

abstract = "We present a novel method, which reads the database at regular intervals as in Dynamic Itemsets Counting Technique and creates a tree called Dynamic Itemset Tree containing items which may be frequent, potentially frequent and infrequent. This algorithm requires less time to discover all maximal frequent itemsets since it involves a method for reducing the size of the database. This method prunes the transactions and items of the transactions which are not of our interest after every scan of the database. Also, this method is independent of the order of the items.",

author = "M. Geetha and D'Souza, {R. J.}",

year = "2009",

month = jun,

day = "1",

doi = "10.1109/ICCET.2009.153",

language = "English",

isbn = "9780769535210",

volume = "2",

pages = "62--66",

booktitle = "Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009",

}

TY - GEN

T1 - A dynamic approach for discovering maximal frequent itemsets

AU - Geetha, M.

AU - D'Souza, R. J.

PY - 2009/6/1

Y1 - 2009/6/1

N2 - We present a novel method, which reads the database at regular intervals as in Dynamic Itemsets Counting Technique and creates a tree called Dynamic Itemset Tree containing items which may be frequent, potentially frequent and infrequent. This algorithm requires less time to discover all maximal frequent itemsets since it involves a method for reducing the size of the database. This method prunes the transactions and items of the transactions which are not of our interest after every scan of the database. Also, this method is independent of the order of the items.

AB - We present a novel method, which reads the database at regular intervals as in Dynamic Itemsets Counting Technique and creates a tree called Dynamic Itemset Tree containing items which may be frequent, potentially frequent and infrequent. This algorithm requires less time to discover all maximal frequent itemsets since it involves a method for reducing the size of the database. This method prunes the transactions and items of the transactions which are not of our interest after every scan of the database. Also, this method is independent of the order of the items.

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

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

U2 - 10.1109/ICCET.2009.153

DO - 10.1109/ICCET.2009.153

M3 - Conference contribution

AN - SCOPUS:65949116808

SN - 9780769535210

VL - 2

SP - 62

EP - 66

BT - Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009

ER -

A dynamic approach for discovering maximal frequent itemsets

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this