scispace - formally typeset
Journal ArticleDOI

A new data stream mining algorithm for interestingness-rich association rules

Reads0
Chats0
TLDR
An enhanced association rulemining algorithm is proposed that introduces new weightage validation in the conventional association rule mining algorithms to validate the utility and its consistency in the mined association rules.
Abstract
Frequent itemset mining and association rule generation is a challenging task in data stream. Even though, various algorithms have been proposed to solve the issue, it has been found out that only frequency does not decides the significance interestingness of the mined itemset and hence the association rules. This accelerates the algorithms to mine the association rules based on utility i.e. proficiency of the mined rules. However, fewer algorithms exist in the literature to deal with the utility as most of them deals with reducing the complexity in frequent itemset/association rules mining algorithm. Also, those few algorithms consider only the overall utility of the association rules and not the consistency of the rules throughout a defined number of periods. To solve this issue, in this paper, an enhanced association rule mining algorithm is proposed. The algorithm introduces new weightage validation in the conventional association rule mining algorithms to validate the utility and its consistency in the mined association rules. The utility is validated by the integrated calculation of the cost/price efficiency of the itemsets and its frequency. The consistency validation is performed at every defined number of windows using the probability distribution function, assuming that the weights are normally distributed. Hence, validated and the obtained rules are frequent and utility efficient and their interestingness are distributed throughout the entire time period. The algorithm is implemented and the resultant rules are compared against the rules that can be obtained from conventional mining algorithms.

read more

Citations
More filters
Journal ArticleDOI

Life beyond big data: governing with little analytics

TL;DR: Following Henri Bergson's analysis of forms of perception which ‘cut out’ a series of figures detached from the whole, it is proposed that analytical algorithms are instruments of perception without which the extensity of big data would not be comprehensible.

Mining sequential patterns from data streams: a centroid approach.

TL;DR: This paper proposes an algorithm based on sequences alignment for mining approximate sequential patterns in Web usage data streams using a greedy clustering algorithm associated to an alignment method and shows that the proposal is able to extract relevant sequences with very low thresholds.
Book ChapterDOI

Location-Based Alert System Using Twitter Analytics

TL;DR: The objective of the study was to design a platform for Location-Based Alert System which can aid Government bodies in taking corrective action against violation of Human Rights.

Nature inspired clustering method for k-means to efficiently cluster data

Sadia Syed
TL;DR: The paper addresses mainly the problem of ant and bee inspired clustering in the process of long-term electrocardiogram and electroencephalogram processing and an overview of the methods inspired by the behavior of real Bees and Ants in nature.
References
More filters
Proceedings ArticleDOI

Mining concept-drifting data streams using ensemble classifiers

TL;DR: This paper proposes a general framework for mining concept-drifting data streams using weighted ensemble classifiers, and shows that the proposed methods have substantial advantage over single-classifier approaches in prediction accuracy, and the ensemble framework is effective for a variety of classification models.
Journal ArticleDOI

Maintaining Stream Statistics over Sliding Windows

TL;DR: The problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far, is considered, and it is shown that, using $O(\frac{1}{\epsilon} \log^2 N)$ bits of memory, the number of 1's can be estimated to within a factor of $1 + \ep silon$.
Journal ArticleDOI

What's hot and what's not: tracking most frequent items dynamically

TL;DR: This work presents new methods for dynamically determining the hot items at any time in a relation which is undergoing deletion operations as well as inserts, and shows that these algorithms are accurate in dynamically tracking thehot items independent of the rate of insertions and deletions.
Proceedings ArticleDOI

Finding recent frequent itemsets adaptively over online data streams

TL;DR: This paper proposes a data mining method for finding recent frequent itemsets adaptively over an online data stream by decaying the old occurrences of each itemset as time goes by.
Related Papers (5)