\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Discovering Patterns from Temporal Databases Using Temporal Association Rule},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2011-07-29 (revised: 29 July 2011)}
\def\TheID{\makeatother }
\def\TheDate{2011-07-29}
\title{Discovering Patterns from Temporal Databases Using Temporal Association Rule}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Dr.N.  Ughazendi}

             \author[2]{  Mr.N.Pughazendi}

             \affil[1]{  Anna University}

\renewcommand\Authands{ and }

\date{\small \em Received: 21 June 2011 Accepted: 18 July 2011 Published: 29 July 2011}

\maketitle


\begin{abstract}
        


Data mining is the process of discovering and examining data from diverse viewpoint, using automatic or semiautomatic techniques to remove knowledge or useful information and discover correlations or meaningful patterns and rules from large databases. One of the most vital characteristic missed by the traditional data mining systems is their capability to record and process time-varying aspects of the real world databases. . Temporal data mining, which mines or discovers knowledge and patterns from temporal databases, is an extension of data mining with capability to include time attribute analysis. The pattern discovery task of temporal data mining discovers all patterns of interest from a large dataset. This paper presents an overview of temporal data mining and focus on pattern discovery using temporal association rules.

\end{abstract}


\keywords{Association Rules, Pattern Discovery, Temporal Data Mining, Temporal Rules.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{INTRODUCTION}]{INTRODUCTION}\par
ata mining is the process of exploring and analyzing data from different perspective, using automatic or semiautomatic techniques to extract knowledge or useful information and discover correlations or meaningful patterns and rules from large databases. Using these patterns it is possible for business enterprises to identify new and unexpected trends, subtle relations in the data and use them to increase revenue and cut cost. The techniques and tools are used in various businesses, scientific and engineering companies. Data mining has been proved to be advantageous in many areas. Examples include (i) Finance (to identify patterns that help be used to decide the result of a future loan application), (ii) Satellite research (to identify potential undetected natural resources or to identify disaster situations like oil slicks), (iii) Health care (to predict outbreaks of infectious diseases) and (iv) Market research (to predict trend in purchase). Various data mining techniques and their applications to different domain are discussed by many researchers (Witten and Frank 2000; \hyperref[b10]{Han and Kamber 2001;}\hyperref[b13]{Hand et al 2001)}.\par
One of the most vital characteristic missed by the traditional data mining systems is their capability to record and process time-varying aspects of the real world databases. In simple words, the traditional data mining techniques lack in their ability to analyze variation of data over time and treat them as ordinary data. Examples of temporal datasets include stock market data, manufacturing or production data, maintenance data, web mining and point-of-sale records. Temporal data mining, which mines or discovers knowledge and patterns from temporal databases, is an extension of data mining with capability to include time attribute analysis. Due to the importance and complexity of the time attribute, a lot of different kinds of patterns are of interest.\par
The temporal database usually includes two time aspects, namely, valid time and transaction time. Valid time denotes the time period during which a fact is true with respect to the real world. Transaction time is the time period during which a fact is stored in the database. These two time aspects allow the distinction of three different forms of temporal databases. They are (i) A historical database stores data with respect to valid time. (ii) A rollback database stores data with respect to transaction time. (iii) A bitemporal database stores data with respect to both valid and transaction time, that is, they store the history of data with respect to valid time and transaction time. A temporal database supports three major datatypes: temporal data, static data, and snapshot data. Regardless of the data type, the temporal data mining algorithms should be transparent and should treat all data as some form of temporal data \hyperref[b8]{(Gadia and Nair 1993)}. Temporal data mining tasks that works with temporal data types can be grouped into (i) prediction (ii) classification (iii) clustering (iv) search \& retrieval and (v) pattern discovery \hyperref[b16]{(Laxman and Sastry, 2006)}.\par
Prediction is the task of forecasting future values of the time series from past or historical samples. In classification, each temporal object or data is assumed to belong to one of the predefined class or category and the primary objective here is to automatically determine the corresponding category for the given input sequence. Clustering of temporal data involves grouping a collection of time series based on their similarity. It is the most frequently used technique in temporal data mining, as it can automatically find structures or patterns in large data sets that would be otherwise difficult to summarize (or visualize). Searching for sequences in large databases is another important task in temporal data mining. Sequence search and retrieval techniques play an important role in interactive explorations of large sequential databases. The problem is concerned with efficiently locating subsequences (often referred to as queries) in large archives of sequences (or sometimes in a single long sequence).\par
The pattern discovery task of temporal data mining discovers all patterns of interest from a large dataset and is the main topic of study in this paper. Several works has been proposed by several researchers and academicians and this study aims to report some of them. The remaining of the paper is organized as follows. The concepts behind association rules and temporal association rules are provided in the next section. Section 3 provides a brief review of the various solutions proposed for temporal association rule mining and Section 4 concludes the study with future research directions. 
\section[{II.}]{II.} 
\section[{BASIC CONCEPTS}]{BASIC CONCEPTS}\par
This section introduces the concepts behind association rules, temporal association rules and types of temporal association rules. 
\section[{a) Association Rules}]{a) Association Rules}\par
The pattern discovering task works with patterns (local structure in the data) and frequent patterns (patterns that occur frequently in s dataset). Much of data mining literature is concerned with formulating useful pattern structures and developing efficient algorithms for discovering frequent patterns. The importance of finding frequent patterns is two fold. The first is that they can be used to discover useful rules and the second is that these discovered rules can then be used to discover some interesting regularities in the data. The main aim here is find all useful pattern structures and use efficient algorithms to identify frequently occurring patterns. From these frequent patterns, useful rules can be generated, which can be used to infer knowledge.\par
A rule consists of an antecedent (left-hand side proposition) and consequent (right-hand side proposition) and states that when the antecedent is true, then the consequent will also be true. Association rules are most frequently used for capturing such correlations \hyperref[b0]{(Agrawal and Srikant, 1994)}. Each association rule is combined with two constraints namely, support and confidence, which are normally used to select interesting rules from the set of all possible rules. Support is defined as the proportion of transaction in the dataset which contain the itemset and confidence is defined as an estimate of the probability of finding the right-hand side of the rule in transactions under the condition that these transactions also contain the lefthand side \hyperref[b14]{(Hipp et al., 2000)}. 
\section[{b) Temporal Association Rules}]{b) Temporal Association Rules}\par
A temporal association rule is defined as the frequency of an itemset over a time period T and is the number of transactions in which it occurs divided by total number of transaction over a time period (Equation  {\ref 1}). In a similar fashion, confidence of a item with another item is the transaction of both items over the period divided by first item of that period (Equation \hyperref[formula_0]{2}). ? = = ? ]) , [\textbf{(2)}\par
Where T s is the valid start time and T e is the valid end time of the temporal data. 
\section[{c) Discovery of Temporal Association Rules}]{c) Discovery of Temporal Association Rules}\par
The problem of association rule mining can be described as the selection of interesting rules from a huge set of extracted rules.  (Dunham, 2003), intertransaction rules \hyperref[b18]{(Lu et al., 2000)}. Regardless of the type of association rule, the main aim of the discovery process is to identify important or rules that help in data mining. Roddick and Spiliopoulou (2002) have presented a comprehensive overview of techniques for the mining of temporal data using three dimensions: data type, mining operations and type of timing information (ordering). On the other hand, Antunes and Oliviera (2001) base their classification on representation, similarity and operations. In general, an effective algorithm to discover association rules is the apriori. Several variations that enhance these algorithms for temporal database also exist. 
\section[{III.}]{III.} 
\section[{TEMPORAL ASSOCIATION RULE MINING}]{TEMPORAL ASSOCIATION RULE MINING}\par
Temporal association rule mining can be performed in four sequential steps, (i) Data Preprocessing, (ii) Find temporal frequent itemsets (iii) Identify temporal association rules and Generate rules set and output.\par
Data preprocessing performs several steps to improve the quality of the input dataset. Some operations include removal of unwanted or irrelevant data, integration of databases and data exchange and data reduction. The second step uses time constraints on the two parameters support and confidence to general frequent itemsets. Using these frequent itemsets, the next step generates association rules. Time constraint can be ignored at this stage, as it is already included during frequent itemset generation step. The resulting rules are called temporal rules. Out of this, the second and third steps have received much attention.\par
The temporal association rules introduced in Ale and Rossi  {\ref (2000)} are an extension of the non-temporal model. The basic idea is to limit the search for frequent sets of items, or itemsets, to the lifetime of the itemset's members. On the other hand, to avoid considering frequent an itemset with a very short period of life (for example, an item that is sold once), the concept of temporal support is introduced. Thus, each rule has an associated time frame, corresponding to the lifetime of the items participating in the rule. If the extent of a rule's lifetime exceeds a minimum stipulated by the user, we analyze whether the rule is frequent in that period. This concept allows us to find rules that with the traditional frequency viewpoint, it would not be possible to discover.\par
The lifespan of an itemset may include a set of subintervals. The subintervals are those such that the given itemset: (a) has maximal temporal support and (b) is frequent. This new model addresses the solution of two problems: (1) Itemsets not frequent in the entire lifespan but just in certain subintervals, and (2) the discovery of every itemset frequent in, at least, subintervals resulting from the intersection of the lifespans of their components, assuring in this way the anti-monotone property \hyperref[b0]{(Agrawal and Srikant, 1994)}.   {\ref 2002}) explore a new model of mining general temporal association rules from large databases where the exhibition periods of the items are allowed to be different from one to another. The algorithm referred to as algorithm SPF (Segmented Progressive Filter) first segments the database into subdatabases in such a way that items in each subdatabase will have either the common starting time or the common ending time. Then, for each sub-database, SPF progressively filters candidate 2-itemsets with cumulative filtering thresholds either forward or backward in time. This feature allows SPF of adopting the scan reduction technique by generating all candidate k-itemsets (k > 2) from candidate 2-itemsets directly. The experimental results showed that algorithm SPF significantly outperforms other schemes which are extended from prior methods in terms of the execution time and scalability.\par
Tansel and Imberman (2007) proposed a method where association rules were extracted for consecutive time intervals with different time granularities. An enumeration operation that extracts portions of a temporal relation was used during mining process and was combined with the first step of discovering association rules. Using this approach, the process of knowledge discovery can observe the changes and fluctuation in the association rules over the time period when these rules are valid.\par
Thuan (2010) extended the a priori algorithm and developed an optimization technique for mining time pattern association rules. The algorithm, termed as, Mining of Time Pattern Association (MTPA) rules algorithm, identifies all rules that are repeated daily, monthly, yearly, thus exploiting the temporal characteristic. The report provides proof for the correctness of MTPA but lacks in experimental results.\par
Gharib et al. (2010) presented a system for generating temporal association rules to solve the problem of handling time series by including time expressions into association rules. They considered the problem of reworking when new records are added into the temporal database. To solve this they extended an incremental algorithm to maintain the temporal association rules in a transaction database, at the same time maintains the benefits from the results of earlier mining to derive the final mining output. The experimental results on both the synthetic and the real dataset illustrated a significant improvement over the conventional approach of mining the entire updated database.\par
An algorithm termed as T-Apriori was proposed by Liang et al. (2005) which modified the traditional Apriori algorithm to include temporal characteristics. The efficiency of extracting temporal association rules was demonstrated using an ecological database. However, performance evaluation of the algorithm is not presented. Ning et al. (  {\ref 2006}) proposed an temporal association rule mining algorithm, where the order of mining steps were altered. In the first step, the algorithm generated association rules were created in the in: E. Simoudis, J. Han, U. Fayyad (Eds.), Proceedings of the 2nd International Conference on 
\section[{REFRENCES REFRENCES REFRENCIAS}]{REFRENCES REFRENCES REFRENCIAS}\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
  			\footnote{© 2011 Global Journals Inc. (US) Global Journal of Computer Science and Technology Volume XI Issue XIV Version I} 			\footnote{August} 			\footnote{© 2011 Global Journals Inc. (US)} 			\footnote{traditional fashion, after generation the valid time Global Journal of Computer Science and Technology Volume XI Issue XIV Version I} 			\footnote{August} 		 		\backmatter  			 \par
August constraints were considered. Because there are no timeconstraints, it is unavoidable to scan the database repeatedly. The candidate frequent itemset generated by the algorithm promptly decreases. It is unnecessary to take mergence mining operations. The time complexity of the execution of the first step is negligible.\par
Using a non Apriori-based technique that avoids multiple database scans, (Winarko and Roddick, 2005) achieved to efficiently mine arrangements and rules in a temporal database. However, in their methods they do not consider any constraints for the temporal relations and do not examine any measures for their rules other than the traditional confidence. 
\subsection[{IV. CONCLUSION}]{IV. CONCLUSION}\par
Analyzing large sequential data streams to unearth any hidden regularities is important in many applications ranging from finance to manufacturing processes to bioinformatics. In this article, an overview of temporal data mining techniques for such problems is presented. From the study, it is understood that the field is not yet considered mature and improvements in many areas can be considered. In particular, three areas can be explored. The first is to analyze methods that can reduce number of passes over the database. This will reduce the number of computations required during the generation of frequent patterns and association rules.\par
The second is to add extra constraint on the structure of the patterns.\par
Identifying and removing redundant temporal rules can also be analyzed. These challenges will be considered in future and experiments to evaluate these methods will be proposed and implemented.  
\subsection[{August}]{August}			 			  				\begin{bibitemlist}{1}
\bibitem[Agrawal et al. ()]{b2}\label{b2} 	 		‘A Mining association rules between sets of items in large databases’.  		 			R Agrawal 		,  		 			T Imielinski 		,  		 			A N Swami 		.  	 	 		\textit{Proc. ACM SIGMOD Conf. on Management of Data},  				 (ACM SIGMOD Conf. on Management of Data)  		1993. p. .  	 
\bibitem[Laxman and Sastry ()]{b16}\label{b16} 	 		‘A survey of temporal data mining’.  		 			S Laxman 		,  		 			P S Sastry 		.  	 	 		\textit{Academy Proceedings in Engineering Sciences}  		2006. 31  (2)  p. .  	 
\bibitem[Hipp et al. ()]{b14}\label{b14} 	 		‘Algorithms for Association Rule Mining -A General Survey and Comparison’.  		 			J Hipp 		,  		 			U Guntzer 		,  		 			G Nakhaeizadeh 		.  	 	 		\textit{SIGKDD Explorations}  		2000. 2  (2)  p. .  	 
\bibitem[Ale and Rossi ()]{b3}\label{b3} 	 		‘An approach to discovering temporal association rules’.  		 			J M Ale 		,  		 			G H Rossi 		.  	 	 		\textit{Proceedings of the 2000 ACM Symposium on Applied Computing},  				 (the 2000 ACM Symposium on Applied Computing)  		2000. p. .  	 
\bibitem[Gharib et al. ()]{b9}\label{b9} 	 		‘An efficient algorithm for incremental mining of temporal association rules’.  		 			T F Gharib 		,  		 			H Nassar 		,  		 			M Taha 		,  		 			A Abraham 		.  	 	 		\textit{Data and Knowledge Engineering}  		2010. 69 p. .  	 
\bibitem[Lu et al. ()]{b18}\label{b18} 	 		‘Beyond intratransaction association analysis: mining multidimensional intertransaction association rules’.  		 			H Lu 		,  		 			L Feng 		,  		 			J Han 		.  	 	 		\textit{ACM Transactions on Information Systems}  		2000. 4  (18)  p. .  	 
\bibitem[Han and Kamber ()]{b10}\label{b10} 	 		\textit{Data mining: Concepts and techniques},  		 			J Han 		,  		 			M Kamber 		.  		2001. San Fransisco, CA: Morgan Kauffmann.  	 
\bibitem[Mannila and Toivonen ()]{b19}\label{b19} 	 		\textit{Discovering generalised episodes using minimal occurrences},  		 			H Mannila 		,  		 			H Toivonen 		.  		1996.  	 
\bibitem[Dunham ()]{b7}\label{b7} 	 		 			M Dunham 		.  		\textit{Data Mining: Introductory and Advanced Topics},  				2003. Prentice Hall.  	 
\bibitem[Agrawal and Srikant ()]{b0}\label{b0} 	 		‘Fast algorithms for mining association rules in large databases’.  		 			R Agrawal 		,  		 			R Srikant 		.  	 	 		\textit{Proceedings of 20th International Conference on Very Large Data Bases},  				 (20th International Conference on Very Large Data Bases)  		1994. p. .  	 
\bibitem[Han et al. ()]{b12}\label{b12} 	 		\textit{FreeSpan: Frequent pattern-projected sequential pattern mining},  		 			J Han 		,  		 			J Pei 		,  		 			B Mortazavi-Asl 		,  		 			Q Chen 		,  		 			U Dayal 		,  		 			M Hsu 		.  		2000b. ACM SIGKDD. p. .  	 
\bibitem[Janetzko et al. ()]{b15}\label{b15} 	 		‘Knowledge-based selection of association rules for text mining’.  		 			D Janetzko 		,  		 			H Cherfi 		,  		 			R Kennke 		,  		 			A Napoli 		,  		 			Y Toussaint 		.  	 	 		\textit{Proceedings of ECAI'2004},  				 (ECAI'2004)  		2004. IOS Press. p. .  	 
\bibitem[Han et al. ()]{b11}\label{b11} 	 		‘Mining Frequent Patterns without Candidate Generation’.  		 			J Han 		,  		 			J Pei 		,  		 			Y Yin 		.  	 	 		\textit{ACM SIGMOD Int. Conf. on Management of Data},  				2000a. p. .  	 
\bibitem[Chang et al. ()]{b5}\label{b5} 	 		‘Mining General Temporal Association Rules for Items with Different Exhibition Periods’.  		 			C Y Chang 		,  		 			M S Chen 		,  		 			C H Lee 		.  	 	 		\textit{Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02},  				 (the 2002 IEEE International Conference on Data Mining (ICDM'02Maebashi City, Japan)  		2002. IEEE Computer Society. p. .  	 
\bibitem[Agrawal and Srikant ()]{b1}\label{b1} 	 		‘Mining sequential patterns’.  		 			R Agrawal 		,  		 			R Srikant 		.  	 	 		\textit{Proceedings of the 11th International Conference on Data Engineering (ICDE'95)},  				 			P S Yu,  			A S P Chen 		 (ed.)  		 (the 11th International Conference on Data Engineering (ICDE'95)Taipei, Taiwan)  		1995. IEE Computer Society Press. p. .  	 
\bibitem[Hand et al. ()]{b13}\label{b13} 	 		\textit{Principles of data mining},  		 			D Hand 		,  		 			H Mannila 		,  		 			P Smyth 		.  		2001. Cambridge, MA: MIT Press.  	 
\bibitem[Das et al. ()]{b6}\label{b6} 	 		‘Rule Discovery from Time Series’.  		 			G Das 		,  		 			H Mannila 		,  		 			P Smyth 		.  	 	 		\textit{KDD}  		1998. p. .  	 
\bibitem[Liang et al. ()]{b17}\label{b17} 	 		‘Temporal association rule mining based on T-Apriori algorithm and its typical application’.  		 			Z Liang 		,  		 			T Xinming 		,  		 			L Ling 		,  		 			J Webliang 		.  	 	 		\textit{Proceedings of International Symposium on Spatiotemporal Modeling, Spatial Reasoning, Analysis, Data Mining and Data Fusion},  				 (International Symposium on Spatiotemporal Modeling, Spatial Reasoning, Analysis, Data Mining and Data Fusion)  		2005.  	 
\bibitem[Antunes and Oliveira ()]{b4}\label{b4} 	 		‘Temporal data mining: An overview’.  		 			C M Antunes 		,  		 			A L Oliveira 		.  	 	 		\textit{Proceedings of the KDD'01 Workshop on Temporal Data Mining},  				 (the KDD'01 Workshop on Temporal Data MiningSan Francisco, USA)  		2001. p. .  	 
\bibitem[Gadia and Nair (ed.) ()]{b8}\label{b8} 	 		\textit{Temporal Databases: A Prelude to Parametic Data, Temporal Databases: Theory, Design, and Implementation},  		 			S K Gadia 		,  		 			S S Nair 		.  		A. Tansel, et al. (ed.)  		1993. The Benjamin/Cummings Publishing Company, Inc. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}