\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={A Study on Efficient Data Mining Approach on Compressed Transaction},
 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-19 (revised: 19 July 2011)}
\def\TheID{\makeatother }
\def\TheDate{2011-07-19}
\title{A Study on Efficient Data Mining Approach on Compressed Transaction}
\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. vidhya  rani}

             \author[2]{elizabeth  shanthi}

             \affil[1]{  avinashilingam university}

\renewcommand\Authands{ and }

\date{\small \em Received: 10 June 2011 Accepted: 9 July 2011 Published: 19 July 2011}

\maketitle


\begin{abstract}
        


Data mining can be viewed as a result of the natural evolution of information technology. The spread of computing has led to an explosion in the volume of data to be stored on hard disks and sent over the Internet. This growth has led to a need for data compression, that is, the ability to reduce the amount of storage or Internet bandwidth required to handle the data. This paper analysis the various data mining approaches which is used to compress the original database into a smaller one and perform the data mining process for compressed transaction such as M2TQT,PINCER-SEARCH algorithm, APRIORI & ID3 algorithm, TM algorithm, AIS & SETM, CT-Apriori algorithm, CBMine, CT-ITL algorithm, FIUT-Tree. Among the various techniques M2TQT uses the relationship of transactions to merge related transactions and builds a quantification table to prune the candidate item sets which are impossible to become frequent in order to improve the performance of mining association rules. Thus M2TQT is observed to perform better than existing approaches.

\end{abstract}


\keywords{Association rule, merged transaction, quantification table.}

\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 used to help users discover interesting and useful knowledge more easily. It is more and more popular to apply the association rule mining in recent years because of its wide applications in many fields such as stock analysis, web log mining, medical diagnosis, customer market analysis and bioinformatics. The main focus is on association mining and data pre-process with data compression.\par
The process of mining association rules consists of two main steps: ? Find the frequent item sets or large item sets with a minimum support ? Use the large item sets to generate association rules that meet a confidence threshold.\par
Finding frequent item sets is more expensive since the number of item sets grows exponentially with the number of items. A large number of increasingly efficient algorithms to mine frequent item sets have been developed over the years . 
\section[{II.}]{II.} 
\section[{FREQUENT PATTERN MINING TECHNIQUE a) Apriori Algorithm}]{FREQUENT PATTERN MINING TECHNIQUE a) Apriori Algorithm}\par
In computer science and data mining, Apriori is a classic algorithm for learning association rules. Apriori is designed to operate on databases containing transactions (for example, collections of items bought by customers, or details of a website frequentation). The algorithm attempts to find subsets which are common to at least a minimum number C (the cutoff, or confidence For example, association rules were first defined for transaction databases \hyperref[b2]{[3]}. An association rule R is an implication of the form X ? Y, where X and Y are set of items and X ? Y =Ø. The support of a rule X ? Y is the fraction of transactions in the database which contain X ? Y. The confidence of a rule X ? Y is the fraction of transactions containing X which also contain Y. An association rule can be considered interesting if it satisfies the minimum support threshold and minimum confidence threshold, which are specified by domain experts. The most common approach to mining association rules consists of two separate tasks: in the first phase, all frequent item sets that satisfy the user specified minimum support are generated; the second phase uses these frequent item sets in order to discover all the association rules that meet a confidence threshold. Since the first problem is more computationally expensive and straight forward, a large number of algorithms have been developed over years.\par
A transaction database is a set of records representing transactions, where each record consists of a number of items that occurs together in a transaction. The most famous example of transaction data is market basket data, in which each transaction corresponds to the set of items bought by a customer during a single visit to a store. Transaction databases have important role in data mining. Association rules identify relationships among sets of items in a transaction database. Ever since its introduction (Agrawal, Imielinski and Swami 1993), association rule discovery has been an active research area.\par
This paper is a study of existing data mining techniques for pattern discovery and technique that produce compression form .The rest of the paper is organized as follows: section 2 discusses frequent pattern mining techniques, section 3 reports compact representation of transaction database and mining, section 4 discusses concludes the paper. This is an efficient algorithm \hyperref[b14]{[14]} for discovering maximum frequent set. pincer-search approach combines both top-down searches and bottom -up searches to prune candidates. Bottom -up approach is used in the case ,where all maximal frequent item sets are short whereas top-down approach is used when all maximal frequent item sets are long .It reduces number of candidate and number of passes in frequent set discovery process.\par
The data mining techniques \hyperref[b5]{[6]} for database compression such as Apriori algorithm and ID3 algorithm(Goh et al.,2001),Decision Tree(Babu et al.,2001), and FUP\&FUP2 algorithm  {\ref (Lee \& Tang,2004}) .An efficient approach named as Adjust FTCP-split algorithm for incremental mining to solve the problem of data maintenance when compressed database occur variation.\par
The data mining in particular focuses on discovering the data usage pattern of compressed transaction from the database.\par
A sample based method for mining frequent pattern s from database \hyperref[b22]{[22]} consists of three phases. In the first phase, a small sample of data to estimate the set of frequent patterns. The second phase computes the actual support of the pattern and identifies a subset of pattern that needs to be further examines in the next phase. The third phase explores the set and finds all missing frequent pattern.\par
A new algorithm \hyperref[b13]{[13]} suitable for mining association rules in databases is designated as CBMine(Compressed Binary Mine).This algorithm Show better performance the several algorithm like Bandon's Apriori algorithms and in sparse databases .\par
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach is a novel data structure \hyperref[b26]{[26]}, frequent pattern tree (FP-tree), for storing compressed ,crucial information about frequent patterns, and developed a pattern growth method, FP-growth, for efficient mining of frequent patterns in large databases. They have implemented the FP-growth method, studied its performance in comparison with several influential frequent pattern mining algorithms in large databases. Our performance study shows that the method mines both short and long patterns efficiently in large databases, outperforming the current candidate pattern generation-based algorithms. Efficient mining of association rules by reducing the number of passes over the database \hyperref[b32]{[32]} discusses one algorithm called And, which is usually used in logical algorithms, And Code (AC) algorithm can discover frequent itemsets without producing candidates and setting thresholds for candidates. Frequent itemsets can be fast discovered by corresponding codes which are cited by this paper to describe different itemsets for AC algorithm. The support count of frequent itemsets can be computed before the process of scanning during processes of AC algorithm. 
\section[{COMPACT REPRESENTATION OF TRANSACTION DATABASE AND MINING a) M 2 TQT Approach}]{COMPACT REPRESENTATION OF TRANSACTION DATABASE AND MINING a) M 2 TQT Approach}\par
In the research \hyperref[b0]{[1]}, a more efficient approach, called Mining Merged Transactions with the Quantification Table (M 2 TQT) is proposed, which can compress the original database into a smaller one and perform the data mining process without the problems such as :\par
The paper focuses on compressed transaction, a technology that both reduces the effective price of logical data storage capacity, and improves query performance. 
\section[{III. b) Merge-Mining Algorithm}]{III. b) Merge-Mining Algorithm}\par
This algorithm \hyperref[b0]{[1]} is used to find frequent itemsets from the new transaction. There are two phases in this algorithm is used.\par
M 2 TQT has the following characteristics: ? The compressed database can be decompressed to the original form. ? Reduce the process time of association rule mining by using a quantification table. ? Reduce I/O time by using only the compressed database to do data mining. ? Allow incremental data mining.\par
? The compressed database is not reversible after the original database is transformed by the data preprocess step. ? It is very difficult to maintain this database in the future. ? Although some rules can be mined from the new transactions, it still needs to scan the database again to verify the result. This is because the data mining step produces potentially ambiguous results. ? It is a serious problem to scan the database multiple times because of the high cost of re-checking the frequent item sets\par
Paper \hyperref[b15]{[15]}, RP-global method as theoretical bound, and works well on small collections of frequent patterns. The Rplocal method is quite efficient and preserves reasonable compression quality. Two algorithms AIS and SETM are combined into a hybrid algorithm called Apriori Hybrid scales linear \hyperref[b16]{[16]}, \hyperref[b17]{[17]} with the number of transactions has been discussed. It is used for discovering all significant association rules between items in a large database of transaction.\par
1. Finding frequent itemsets 2. To prune redundancy.\par
M 2 TQT uses transaction relation distance to merge the relevant transactions. Based on the distance relation between transactions. It can be merged with closer relationship to generate a better compressed database. Then we create a quantification table to reduce number of candidate's itemsets to be generated. It helps to prune non-frequent itemsets.\par
Another algorithm called partition \hyperref[b3]{[4]} reads the database at most two times to generate all significant association rules. This algorithm is especially suitable for very large size databases .For very large databases, the CPU overhead was reduced by as much as a factor of four and i/o was reduced by order of magnitude. HI-mine algorithm is effective and efficient and improves the performance of indirect association mining significantly. It consist of a strategy that compresses a transaction database into a super compact transaction database, which dramatically reduces not only the number of transaction in original database, but also memory requirement for storing frequent item and the runtime for mining indirect associations.\par
Paper \hyperref[b23]{[23]} reports FPTree algorithm as Horizontal and vertical Compact Frequent Itemset Pattern Mining Tree (HVCFPMINETREE). HVCFPMineTree combines all the maximum occurrence of frequent itemsets before converting into the tree structure a new algorithm HVCFP Mine Tree in both horizontal and vertical layouts. It leads to a compressed FPTree structure in an efficient manner A new algorithm TM using the vertical database representation has been discussed in paper \hyperref[b24]{[24]}. Transaction ids of each itemsets are transformed and compressed to continuous transaction interval lists in a different space using the transaction tree and frequent itemsets are found by transaction intervals intersection along a lexicographic tree in depth first order. This compression greatly saves the intersection time. Through experiments, TM algorithm has been shown to gain significant performance improvement over FPgrowth and dEclat on datasets with short frequent patterns, and also some improvement on datasets with long frequent patterns. We have also performed the compression and time analysis of transaction mapping using the transaction tree and proved that transaction mapping can greatly compress the transaction ids into continuous transaction intervals especially when the minimum support is high. Although FP-growth is faster than TM in this experiment, the comparison is unfair. In our future work we plan to improve the implementation of the TM algorithm and make a fair comparison with FP-growth.\par
Compact tree structure called CT-tree \hyperref[b1]{[2]},to compress the original transactional data. This allows the CT-Apriori algorithm, which is revised from the classical Apriori algorithm, to generate frequent patterns by skipping the initial database scan and reduce great amount of I/O time per database scan's tree data structure will fit into main memory. It will not apply for very large databases.\par
FIUT-Tree \hyperref[b20]{[20]},Frequent items ultrametric tree ,this algorithm is used for mining frequent itemsets. It is classified into candidate itemsets approach such as Apriori called Apriori-Like; a method without candidate itemsets-generation approach such as FP-growth algorithm called FP-growth-like. It is an improved method to partition a database by clustering the transactions and significantly reducing the search space. FIUT-tree is also used for storing compressed databases.\par
CT-ITL algorithm \hyperref[b21]{[21]} for mining complete set of frequent Itemset. It uses Item-Trans Link(ITL) data structure that combines both horizontal and vertical layout for association rule mining.\par
A Compress-Based Association Mining Algorithm for Large Dataset \hyperref[b25]{[25]}, is efficient when the size of dataset is huge that cannot be load in the main memory. Outcome of our algorithm is to reduce the search space by eliminating 1-itemsets from the transactions after the first pass. This feature may prove useful for finding frequent itemset from many real life dense dataset.\par
A General Incremental Technique for Maintaining Discovered Association Rules \hyperref[b31]{[31]} is developed for maintaining the association rules discovered in a database in the cases including insertion, deletion, and modification of transactions in the database. The algorithm FUP2 makes use of the previous mining result to cut down the cost of finding the new rules in an updated database. FUP2 can efficiently update the discovered rules when new transactions are added to a transaction database, and obsolete transactions are removed from it. This algorithm has been implemented and its performance is studied and compared with the best algorithms for mining.\par
IV. 
\section[{OTHER RELATED WORKS}]{OTHER RELATED WORKS}\par
Mining Multiple-Level Association Rules in Large Databases \hyperref[b27]{[27]} compares the performance of the proposed algorithms of all four algorithms DML T2L1; ML T1LA; ML TML1; and ML T2LA . They are implemented and tested on a Sun/Sparcstation20 with 32 MB of main memory running Solaris 2.5.\par
Mining important association rules based on the RFMD (Recency, Frequency, Monetary value and  \hyperref[b18]{[18]} is an algorithm for finding maximal frequent Itemset .The breakdown of algorithmic components and dynamic reordering were quite beneficial in reducing the search space while relative compression of vertical bitmap representation of database with efficient bitmap compression schema.\par
Duration)technique \hyperref[b28]{[28]} is a novel method that combines RFMD analysis with the association rule mining technique to extract effective rules from distributed databases.\par
Fuzzy Association Rule Mining Algorithm for Fast and Efficient Performance on Very Large Datasets  {\ref [33]},a new fuzzy Association rule mining (ARM) algorithm meant for fast and efficient performance on very large datasets. As compared to fuzzy Apriori, our algorithm is 8-19 times faster for the very large standard real-life dataset we have used for testing with various mining workloads, both typical and extreme ones. A novel combination of features like two-phased multiple partition tidlist-style processing, byte-vector representation of tidlists, and fast compression of tidlists contributes a lot to the efficiency in performance. In addition, unlike most two phased ARM algorithms, the second phase is totally different from the first one in the method of processing (individual itemset processing as opposed to simultaneous itemset processing at each klevel), and is also many times faster. Our algorithm also includes an effective preprocessing technique for converting a crisp dataset to a fuzzy dataset.\par
An efficient algorithm for mining association rules in large databases \hyperref[b30]{[30]},is an efficient algorithm for mining association rules that is fundamentally different from known algorithms. Compared to previous algorithms, our algorithm not only reduces the I/O overhead significantly but also has lower CPU overhead for most cases. It was found that for large databases, the CPU overhead was reduced by as much as a factor of four and I/O was reduced by almost an order of magnitude. Hence this algorithm is especially suitable for very large size databases.\par
Fast Algorithms for Mining Association Rules \hyperref[b29]{[29]} proposes an algorithm called AprioriHybrid. Scale-up experiments show that AprioriHybrid scales linearly with the number of transactions. AprioriHybrid also has excellent scale-up properties with respect to the transaction size and the number of items in the database.\par
V. 
\section[{CONCLUSION AND FUTURE WORK}]{CONCLUSION AND FUTURE WORK}\par
In this paper, we have analyzed the various data mining techniques and algorithms used to compress data such as M 2 TQT, PINCER-SEARCH algorithm, APRIORI \& ID3 algorithm, TM algorithm, AIS \& SETM, CT-Apriori algorithm, CBMine, CT-ITL algorithm and FIUT-Tree. These techniques were analyzed. Among them algorithm M 2 TQT performs in a better way by reducing the processing time and I/O time and by decompression of compressed database to original database and by scanning the transaction database only once. The M 2 TQT approach utilizes the compressed transactions to mining association rule efficiently with a quantification table. 
\section[{August}]{August}\par
We have also given the overview of frequent pattern mining, several algorithms and techniques and approaches used for data compression and algorithms for database compresses transaction our next focus is to improve the compression rate by incorporating FP-Tree in M 2 TQT.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}A}\end{figure}
 			\footnote{August© 2011 Global Journals Inc. (US)} 			\footnote{© 2011 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[ A Study on Efficient Data Mining Approach on Compressed Transaction]{b11}\label{b11} 	 		\textit{},  	 	 		\textit{A Study on Efficient Data Mining Approach on Compressed Transaction}  		 	 
\bibitem[Dai et al. ()]{b0}\label{b0} 	 		\textit{},  		 			Jia-Yu Dai 		,  		 			Don-Lin Yang 		,  		 			Jungpin Wu 		,  		 			Ming-Chuan Hung 		.  	 	 		\textit{An Efficient Data Mining Approach on Compressed Transactions}  		2 2008. 3.  	 	 (International Journal of Electrical and Computer Engineering) 
\bibitem[Ashrafi et al. ()]{b24}\label{b24} 	 		‘A Compress-Based Association Mining Algorithm for Large Dataset’.  		 			M Z Ashrafi 		,  		 			D Taniar 		,  		 			K Smith 		.  	 	 		\textit{Proceedings of International Conference on Computational Science},  				 (International Conference on Computational Science)  		2003. p. .  	 
\bibitem[Hernandez Palancar]{b13}\label{b13} 	 		\textit{A Compressed vertical Binary Algorithm for Mining Frequent Pattern},  		 			Jose Hernandez Palancar 		.  		 	 
\bibitem[Cheung et al. ()]{b30}\label{b30} 	 		‘A general incremental technique for maintaining discovered association rules’.  		 			D W L Cheung 		,  		 			S D Lee 		,  		 			B Kao 		.  	 	 		\textit{Proceedings of the 15th International Conference on Database Systems for Advanced Applications},  				 (the 15th International Conference on Database Systems for Advanced Applications)  		1997. p. .  	 
\bibitem[Chen and Ho (2010)]{b22}\label{b22} 	 		‘A Sampling Based Method for Mining Frequent Patterns From Database". in the proceedings of Fuzzy systems and knowledge discovery in second international Dr.K.Alagarsamy and A.Meenakshi’.  		 			Yang-Liang Chen 		,  		 			Chin-Yuan Ho 		.  	 	 		\textit{International Journal of Computer Applications}  		November 2010. 10  (5)  p. .  	 	 (A Novelty Approach for Finding Frequent Itemsets in Horizontal and Vertical Layout-HVCFPMINETREE) 
\bibitem[Song and Rajasekaran]{b23}\label{b23} 	 		‘A Transaction Mapping Algorithm for Frequent Itemsets Mining’.  		 			Mingjun Song 		,  		 			Sanguthevar Rajasekaran 		.  	 	 		\textit{the proceeding of IEEE transactions on knowledge and data engineering},  				 	 
\bibitem[Savasere et al. ()]{b3}\label{b3} 	 		‘An Efficient Algorithm for Mining Association Rules in Large Databases’.  		 			E Savasere 		,  		 			S Omiecinski 		,  		 			Navathe 		.  	 	 		\textit{Proceedings of the 21 st International Conference on Very Large Data Bases},  				 (the 21 st International Conference on Very Large Data Bases)  		1995. p. .  	 
\bibitem[Savasere et al. ()]{b29}\label{b29} 	 		‘An Efficient Algorithm for Mining Association Rules in Large Databases’.  		 			E Savasere 		,  		 			S Omiecinski 		,  		 			Navathe 		.  	 	 		\textit{Proceedings of the 21 st International Conference on Very Large Data Bases},  				 (the 21 st International Conference on Very Large Data Bases)  		1995. p. .  	 
\bibitem[Agarwal et al. (1993)]{b2}\label{b2} 	 		‘Association rules between sets of items in large databases’.  		 			R Agarwal 		,  		 			T Imielinski 		,  		 			A Swami 		,  		 			Minign 		.  	 	 		\textit{proceeding ACM SIGMOD International conference on management of data},  				 (eeding ACM SIGMOD International conference on management of dataWashington, D.C., USA)  		May 1993. p. .  	 
\bibitem[Qigarwal et al.]{b1}\label{b1} 	 		\textit{Compact Transaction Database for Efficient Frequent Pattern Mining},  		 			T Qigarwal 		,  		 			Aijun Wan 		,  		 			An 		.  		 	 
\bibitem[Al-Laham1 & Ibrahiem and Emary]{b12}\label{b12} 	 		\textit{Comparative Study Between Various Algorithms of Data Compression Techniques},  		 			Mohammed Al-Laham1 \& Ibrahiem 		,  		 			M M El Emary 		.  		 	 
\bibitem[Giri Sucahyo and Gopalan]{b21}\label{b21} 	 		\textit{CT-ITL: Efficient Frequent Item Set Mining Using A Compressed Prefix Tree With Pattern Growth},  		 			Yudho Giri Sucahyo 		,  		 			Raj P Gopalan 		.  		 	 
\bibitem[Lee and Tsai]{b6}\label{b6} 	 		‘Efficient Associating Mining Approaches for Compressing Incrementally Updatable Native XML Databases’.  		 			Chin-Feng Lee 		,  		 			Chia-Hsing Tsai 		.  	 	 		\textit{IAENG International Journal of Computer Science}  		33  (1)  p. .  	 
\bibitem[Wan and An]{b19}\label{b19} 	 		\textit{Efficient Indirect Association Discovery using compact Transaction Database},  		 			Qian Wan 		,  		 			Aijun An 		.  		 	 
\bibitem[Li Qingzhong et al. ()]{b31}\label{b31} 	 		‘Efficient Mining of Association Rules by Reducing the Number of Passes over the Database’.  		 			Wang Li Qingzhong 		,  		 			Haiyang 		,  		 			Yan Zhongmin 		,  		 			Ma Shaohan 		.  	 	 		\textit{J] Journal of Computer Science and Technology}  		2001. 16  (2)  p. .  	 
\bibitem[Margahny and Mitwaly (2005)]{b9}\label{b9} 	 		‘Fast Algorithm for Mining Association Rules’.  		 			M H Margahny 		,  		 			A A Mitwaly 		.  	 	 		\textit{AIML 05 Conference},  				 (CICC, Cairo, Egypt)  		19-21 December 2005.  	 
\bibitem[Grahne and Zhu ()]{b7}\label{b7} 	 		‘Fast algorithms for frequent item set mining using FP-trees’.  		 			G Grahne 		,  		 			J Zhu 		.  	 	 		\textit{IEEE Transactions on Knowledge and Data Engineering}  		2005. 17 p. .  	 
\bibitem[Agrawal and Srikant ()]{b16}\label{b16} 	 		‘Fast Algorithms for Mining Association Rules’.  		 			R Agrawal 		,  		 			R Srikant 		.  	 	 		\textit{Proceedings of the 20th International Conference on Very Large Data Bases},  				 (the 20th International Conference on Very Large Data Bases)  		1994. p. .  	 
\bibitem[Agrawal and Srikant ()]{b28}\label{b28} 	 		‘Fast Algorithms for Mining Association Rules’.  		 			R Agrawal 		,  		 			R Srikant 		.  	 	 		\textit{Proceedings of the 20th International Conference on Very Large Data Bases},  				 (the 20th International Conference on Very Large Data Bases)  		1994. p. .  	 
\bibitem[Agarwal et al.]{b17}\label{b17} 	 		\textit{Fast Discovery of Association Rules},  		 			Rakesh Agarwal 		,  		 			Heikki Mannila 		,  		 			Ramakrishnan Srikant 		,  		 			A Hannu Toivonen 		,  		 			Verkamo 		.  		 	 	 (inthe proceeding of IEEE) 
\bibitem[Tsay et al. ()]{b20}\label{b20} 	 		\textit{FIUT:A new method for mining frequent itemset},  		 			Yuh-Jiuan Tsay 		,  		 			Tain-Jung Hsu 		,  		 			Jing-Rung Yu 		.  		2009.  	 	 (in the proceeding of information science) 
\bibitem[Mangalampalli and Pudi]{b32}\label{b32} 	 		‘Fuzzy Association Rule Mining Algorithm for Fast and Efficient Performance on Very Large Datasets’.  		 			Ashish Mangalampalli 		,  		 			Vikram Pudi 		.  		 IIIT/TR/2009/173.  	 	 		\textit{IEEE International Conference on Fuzzy Systems},  				 (Jeju Island, Korea Report)  		FUZZ-IEEE.  	 
\bibitem[Kumar ()]{b4}\label{b4} 	 		‘Implementation of Web Usage Mining Using APRIORI and FP Growth Algorithms’.  		 			Santhosh Kumar 		.  	 	 		\textit{Int. J. of Advanced Networking and Applications}  		2010. 400 p. .  	 
\bibitem[Burdick et al. ()]{b18}\label{b18} 	 		‘MAFIA: A maximal frequent item set algorithm’.  		 			D Burdick 		,  		 			M Calimlim 		,  		 			J Flannick 		,  		 			J Gehrke 		,  		 			T Yiu 		.  	 	 		\textit{IEEE Transactions on Knowledge and Data Engineering}  		2005. 17 p. .  	 
\bibitem[Sharma et al. ()]{b10}\label{b10} 	 		‘Management of Data, Global Journal of Computer Science and Technology Volume XI Issue XIV Version I pp’.  		 			M K Sharma 		,  		 			* 		,  		 			Jyotsana Sah 		,  		 			** ; Rimt-Iet 		,  		 			Mandi Gobindgarh 		.  	 	 		\textit{Proceedings of 2nd National Conference on Challenges \& Opportunities in Information Technology},  				 (2nd National Conference on Challenges \& Opportunities in Information Technology)  		March 29. 2008. 2000. p. .  	 	 (Applications of Data Compression Approach In Data Warehouse Design) 
\bibitem[Xin et al. ()]{b15}\label{b15} 	 		‘Mining Compressed Frequent-Pattern Sets’.  		 			D Xin 		,  		 			J Han 		,  		 			X Yan 		,  		 			H Cheng 		.  	 	 		\textit{Proceedings of the 31st international conference on Very Large Data Bases},  				 (the 31st international conference on Very Large Data Bases)  		2005. p. .  	 
\bibitem[Han et al. ()]{b25}\label{b25} 	 		‘Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach’.  		 			Jiawei Han 		,  		 			Jian Pei 		,  		 			Yiwen Yin 		,  		 			Runying Mao 		.  	 	 		\textit{Microsoft Corporation Data Mining and Knowledge Discovery},  				2004. 8 p. .  	 
\bibitem[Asgharzadeh Sekhavat et al. ()]{b27}\label{b27} 	 		‘Mining important association rules based on the RFMD technique’.  		 			Yoones Asgharzadeh Sekhavat 		,  		 			M Fathian 		,  		 			M R Gholamian 		,  		 			S Alizadeh 		.  	 	 		\textit{Int. J. Data Analysis Techniques and Strategies}  		2010. 2  (1) .  	 
\bibitem[Han and Fu (1999)]{b26}\label{b26} 	 		‘Mining Multiple-Level Association Rules in Large Databases’.  		 			Jiawei Han 		,  		 			Yongjian Fu 		.  	 	 		\textit{IEEE transactions on knowledge and data engineering}  		september/october 1999. 11  (5) .  	 
\bibitem[Arokia Renjit Dr and Shunmuganathan (2010)]{b8}\label{b8} 	 		‘Mining The Data From Distributed Database Using An Improved Mining Algorithm’.  		 			J K L Arokia Renjit Dr 		,  		 			Shunmuganathan 		.  	 	 		\textit{IJCSIS) International Journal of Computer Science and Information Security}  		March 2010. 7  (3) .  	 
\bibitem[Lin and Kedem ()]{b14}\label{b14} 	 		‘Pincer-search: an efficient algorithm for discovering the maximum frequent set’.  		 			D I Lin 		,  		 			Z M Kedem 		.  	 	 		\textit{IEEE Transactions on Knowledge and Data Engineering}  		2002. 14 p. .  	 
\bibitem[Bratko and Bra ()]{b5}\label{b5} 	 		‘Spam Filtering Using Statistical Data Compression Models’.  		 			Andrej Bratko 		,  		 			Bra 		.  	 	 		\textit{Journal of Machine Learning Research}  		2006. 7 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
