A dynamic approach for discovering maximal frequent itemsets

M. Geetha, R. J. D'Souza

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationProceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009
Pages62-66
Number of pages5
Volume2
DOIs
Publication statusPublished - 01-06-2009
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software

Cite this

Geetha, M., & D'Souza, R. J. (2009). A dynamic approach for discovering maximal frequent itemsets. In Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009 (Vol. 2, pp. 62-66). [4769559] https://doi.org/10.1109/ICCET.2009.153
Geetha, M. ; D'Souza, R. J. / A dynamic approach for discovering maximal frequent itemsets. Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009. Vol. 2 2009. pp. 62-66
@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 = "6",
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",

}

Geetha, M & D'Souza, RJ 2009, A dynamic approach for discovering maximal frequent itemsets. in Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009. vol. 2, 4769559, pp. 62-66. https://doi.org/10.1109/ICCET.2009.153

A dynamic approach for discovering maximal frequent itemsets. / Geetha, M.; D'Souza, R. J.

Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009. Vol. 2 2009. p. 62-66 4769559.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 -

Geetha M, D'Souza RJ. A dynamic approach for discovering maximal frequent itemsets. In Proceedings - 2009 International Conference on Computer Engineering and Technology, ICCET 2009. Vol. 2. 2009. p. 62-66. 4769559 https://doi.org/10.1109/ICCET.2009.153