TEMPORAL SEQUENTIAL PATTERN IN DATA MINING TASKS
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 7
Abstract
The rapid increase in the data available leads to the difficulty for analyzing those data and different types of frameworks are required for unearthing useful knowledge that can be extracted from such databases. The field of temporal data mining is relatively young and one expects to see many new developments in the near future. In all data mining applications, the primary constraint is the large volume of data. Hence there is always a need for efficient algorithms. This paper gives an overview of the temporal data mining task and highlights the related work in this context.
Authors and Affiliations
DR. NAVEETA MEHTA , MS. SHILPA DANG
Keywords
Related Articles
- EP ID EP102875
- DOI -
- Views 88
- Downloads 0
A Novel Pair of Replacement Algorithms for L1 and L2 Cache for FFT
Processors speed is much faster than memory; to bridge this gap cache memory is used. This paper proposes a preeminent pair of replacement algorithms for Level 1 cache (L1) and Level 2 cache (L2) respectively for the Fas...
Generation of key for Session key Distribution Using Bio-Metrics
Biometric cryptosystem gives different methods in high secure applications. Cryptography is intended to ensure the secrecy and authenticity of message. Here we will consider symmetric key cryptography. For conventional e...
Modified route-maintenance in AODV Routing protocol using static nodes in realistic mobility model
One of the popular wireless network architectures is Mobile Ad Hoc Network (MANET). It can be easily deployed in every environment, without any underlying backbone and infrastructure support. MANET is a wireless network...
Extracting Noun Phrases in Subject and Object Roles for Exploring Text Semantics
In tune with the recent developments in the automatic retrieval of text emantics, this paper is an attempt to extract one of the most fundamental semantic units from natural language text. The context is intuitively ext...
Harnessing Genetic Algorithm for Vertex Cover Problem
The problem of finding a minimum vertex cover is an NP hard optimization problem. Some approximation algorithms for the problem have been proposed but most of them are neither optimal nor complete. The work proposes the...