International Journal of Soft Computing

118
Views

1
Downloads

Efficient Graph Structure for the Mining of Frequent Itemsets From Data Streams

E.R. Naganthan and F. Ramesh Dhanaseelan
Page: 144-146 | Received 21 Sep 2022, Published online: 21 Sep 2022

By Research Area

Medicine & Public Health Life Sciences Engineering Mathematics Biomedicine Physics Chemistry Computer Science Earth Sciences Social Sciences Business and Management Psychology Materials Science Economics Education Environment Philosophy Statistics Law Political Science and International Relations Pharmacy Dentistry Energy Linguistics Geography Finance Criminology and Criminal Justice Medicine Cultural and Media Studies History Architecture / Design Literature Biomedical Sciences Religious Studies Education & Language Food Science & Nutrition Public Health

By Volume and Issue

Abstract

In this study, we propose a graph structure, that captures important data streams. This graph can be easily maintained and mined for frequent item sets as well as various other patterns like constrained item sets. This graph captures the contents of transaction in a window and arranges nodes according to some canonical order that is unaffected by changes in item frequency. This graph structure is designed for exact stream mining of regular frequent item sets.

How to cite this article:

E.R. Naganthan and F. Ramesh Dhanaseelan . Efficient Graph Structure for the Mining of Frequent Itemsets From Data Streams.
DOI: https://doi.org/10.36478/ijscomp.2008.144.146
URL: https://www.makhillpublications.co/view-article/1816-9503/ijscomp.2008.144.146