\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={Frequent Pattern Mining With Closeness Considerations: Current State Of The Art},
 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-09-04 (revised: 04 September 2011)}
\def\TheID{\makeatother }
\def\TheDate{2011-09-04}
\title{Frequent Pattern Mining With Closeness Considerations: Current State Of The Art}
\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]{Anurag  Choubey}

             \author[2]{Dr. J.L.  Rana}

             \affil[1]{  Rajiv Gandhi Technological University, Bhopal, India}

\renewcommand\Authands{ and }

\date{\small \em Received: 27 July 2011 Accepted: 24 August 2011 Published: 4 September 2011}

\maketitle


\begin{abstract}
        


Due to rising importance in frequent pattern mining in the field of data mining research, tremendous progress has been observed in fields ranging from frequent itemset mining in transaction databases to numerous research frontiers. An elaborative note on current condition in frequent pattern mining and potential research directions is discussed in this article. It?s a strong belief that with considerably increasing research in frequent pattern mining in data analysis, it will provide a strong foundation for data mining methodologies and its applications which might prove a milestone in data mining applications in mere future.

\end{abstract}


\keywords{elaborative, frequent, mining, methodologies, milestone.}

\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
requent patterns are itemsets, subsequences, or substructures which are often found as a repetitive pattern in any database, with rate of recurrence depending upon individual verge. For example: Itemsets are sets of item such as vegetables and spices that are often observed in a transaction data. Subsequence is a chronological pattern habitually followed, such as buying a camera, then a camera carry-bag and then lenses. Substructure denotes particular structural forms which may be pooled with data of itemsets or subsequences. Regular occurrences of a substructure in a data-base is called structural pattern. For enhancement in results for data indexing, classification, clustering and other data mining tasks, discovery of frequent pattern mining has turned out to be an essential data mining task.  {\ref Agarwal et al. (1993)} was the pioneer, proposing frequent pattern mining for market basket analysis in form of association rule mining which examines customer trading behavior by ruling out relations between dissimilar items that customers buy. These statistics facilitate a retailer to be careful regarding further marketing. This relevance provided a podium for various other research publications on various kinds of extensions and applications, and hence it's time to examine what more needs to be inspected to make this expertise a keystone approach for all supplementary demanding research issues.\par
Author ? ? ? :Rajiv Gandhi Technological University, Bhopal, India . E-mail : anuragphd11@gmail.com II. 
\section[{MINING PATTERNS WITH CLOSENESS AS CONSIDERATION}]{MINING PATTERNS WITH CLOSENESS AS CONSIDERATION}\par
With large data, mining generates colossal frequent patterns satisfying min\textunderscore sup threshold, principally when min\textunderscore sup is set low, because with frequent patterns comes along frequent sub patterns too. Hence the principal of closed frequent pattern mining and maximal frequent pattern mining came to subsistence.\par
The mining of frequent closed itemsets was proposed in \hyperref[b1]{[2]}, where an Apriori-based algorithm called A-Close for such mining was presented. Other closed pattern mining algorithms include  {\ref [3, 4, 5, 6, and 7]}. Pattern closeness identification is the big obstacle in closed or maximal pattern mining. The usage of hashed transaction ids is on e significant approach to overcome this complication \hyperref[b3]{[4]} and the other approach is to construct hierarchical tree structure using discovered patterns as nodes  {\ref [5, 7, and 8]}. Mining closed itemsets provides an interesting and important alternative to mining frequent itemsets since it inherits the same analytical power but generates a much smaller set of results. Better scalability and interpretability is achieved with closed itemset mining.\par
Bayardo et al \hyperref[b8]{[9]} proposed level-wise, breadthfirst search method to find max-itemset. This approach includes subspace reduction by pruning process that prunes frequency of superset and infrequency of subset for search space reduction. Transaction id list compression approach was discussed in another efficient method MAFIA \hyperref[b9]{[10]} that targets the counting efficiency. NP-Hard is the complexity of reciting maximal itemsets. 
\section[{III.}]{III.} 
\section[{MINING PATTERNS WITH SEQUENCE AS CONSIDERATION}]{MINING PATTERNS WITH SEQUENCE AS CONSIDERATION}\par
Sequential pattern mining, the mining of frequently occurring ordered events or subsequences as patterns in set of ordered elements or events that referred as sequence dataset, was first bring out by Agarwal et al \hyperref[b10]{[11]}, and has become an important problem in data mining. We first introduce the preliminary concept about sequential patterns.\par
Generalized Sequential Patterns (GSP) \hyperref[b11]{[12]} is opt to multiple pass approach and uses the down the and pruning is apriori based, which causes complex candidature maintenance in order to manage longer sequences.\par
Prefix Span \hyperref[b14]{[15,}\hyperref[b7]{8]} was developed by Pei et al that works in a divide-and-conquer way. In this model each sequential pattern considers as prefix and projects the complete set of sequential patterns and later partitioned into different subsets according to different prefixes. Finally projected datasets are mined recursively to find sub sequent patterns.Empirical study concludes that the prefixspan \hyperref[b14]{[15]} is the best when compared to GSP and SPADE. And the study also shows that PrefixSpan has the best overall performance. The CloSpan \hyperref[b15]{[16]} was proposed by Yan et al.The method is based on a property of called equivalence of projected databases, where two projected sequence datasets with same prefix and same size in total number of items, this model can prune the non-closed sequences from further consideration during the mining process.BIDE \hyperref[b16]{[17]}, a bidirectional search for mining frequent closed sequences was developed by Wang and Han et al, which can further perform projecting sequences in bidirectional. 
\section[{IV. MINING FREQUENT ITEMSETS AND NO CANDIDATURE MAINTENANCE}]{IV. MINING FREQUENT ITEMSETS AND NO CANDIDATURE MAINTENANCE}\par
The Apriori principle is significant in reducing the size of candidate sets. But multiple passes through dataset and maintaining large number of candidate sets are two major obstacles of the apriori principle. In the context of these obstacles Han et al \hyperref[b17]{[18]} proposed a model called FP-growth that mines frequent itemsets without using candidature maintenance.\par
FP-growth works by compressing the given dataset by ordering items as extended prefix-tree structure. FP-growth targets the decomposition of given dataset and mining activities, in this process the FPgrowth endorsed by divide-and-conquer approach. It uses an incremental pattern fragmentation to eliminate the candidature maintenance (generation and testing), which is used by Apriori.\par
Empirical studies in literature demonstrate that fp-growth considerably minimizes the search time. The FP-growth algorithm performs well by searching for shorter frequent patterns recursively and then concatenates least frequent items as suffix. There are suitable alternative and extensions too for this approach, few of them are Agarwal et al \hyperref[b18]{[19]}, H-mine \hyperref[b19]{[20]} Liu et al. \hyperref[b20]{[21,}\hyperref[b21]{22]} and Grahne \hyperref[b5]{[6]}.\par
V. 
\section[{CURRENT STATE OF ART}]{CURRENT STATE OF ART}\par
Authors Ya-Han Hu, Fan Wu, and Tzu-Wei-Yeh  {\ref [23]} have presented an in-detail thesis about Market based Analysis. This dat helps in finding correlation between purchasing items in databases. This study extends RFM analysis into mining process which measures frequent patterns extending in mining. Initially a RFPM tree is prepared depending upon the RFMpatterns, to compress and store entire transactional database and later RFPM growth is developed, hence efficiently find RFM patterns.\par
Association rule mining, usefull for discovering relationships among items or events in various app domains, discovers complete set of frequent patterns.\par
Here, instead of filtering patterns after discovery, constraints (specific algorithms possessing meaningfull info) are directly pushed in into process of discovering and hence desired patterns are discovered.\par
Constraints from RFM analysis examine uniqueness from frequent patterns into mining algorithm. A RFM pattern is one in which recency score, frequency score and monetary score which satisfies minimum thresholds. Wu et al. discussed the recency problem about the change of data distribution between the past data and the new data. Emerging patterns as introduced by Dong and Li discover significant pattern changes in datasets with different time periods. In mining process, it cant reflect requirement of RFM completely. RFM-Apriori defined the recency constraint of the last transaction that should satisfy the recency threshold. The paper proposed an algorithm for mining patterns satisfying RFM constraints using a fixed time gap. However their approach the different stripe lengths of recency measuring the importance of transaction. This method better interfaced and also measured RFM importance of patterns. . For a set I of items in a database, to measure the scores of RFM of itemsets, the database should contain the more information of a transaction X, like <tx,( a1 , qa1 ) ( 2 a , qa2 )?( am , qam)>, where tx stands for the transaction time when transaction X occurs, the m pairs, (ai, qai), where 1 ? i ?m and ai ? I, denotes that there are m different items are purchased in the transaction and for item ai, the purchased quantity is qai. Given an itemset Y ( ), Y is said to be contained in X if all items in Y also occur in X.Definition 1. Assume that an itemset Y is contained in transaction X. Y's transaction recency score gained from X, denoted by trscore (Y, X), is defined as: trscore An RFMP-tree contains RFM-header and RFMPtree. A RFM-header contains all 1-RFT-patterns. Each node in RFMP-tree consist item-name, Rscore, Fscore, Tta, parent-link, child-link, and sibling-link as fields, where item-name registers. A complete RFMP-tree will be constructed through two database scans, in the first DB scan, all 1-RFT-patterns will be stored in the RFMheader to pool up. After that, all 1-RFT-patterns in RFM-header will be arranged by thier Fscore in descending order. In other DB scan the root node of the tree will be sorted and label it as null, is created and prunes items for every transaction if item not found in RFM-Header. In the first step it finds all RFT-patterns from the RFMP-tree. The second step scans database once to compute the Mscore of all RFT-patterns and finally discover all RFM-patterns.Inserting of transactions in RFMP-tree generates 2 possible cases. Due to branch in the transaction, scores related to transactions are updated to nodes. If no branches are observed, nodes will have to be developed and have to calculate scores for it. With new nodes, comes along creation of parent link and node link.(Y, X) = (1-?) tcurrent-tx,\par
Observation: Three of the thresholds performs outstandingly with experiments depicting significant values which are not generalized. In my observations values should be generalized and experiments on datasets should entertain noise and uncertainity.\par
A deisgn determining interesting pattern, minimum support \& itemset count is designed by ZalizahAwang Long et al  {\ref [24]}. 1.Pre-processing 2.frequent item set algorithm and 3.data retransformation are 3 stages in it which involves 2 modules of pre-processing. The Apriori algorithm is constructed in second module. In 2 nd stage minimum support and sequence length'k' is found. In third stage, output is found which is threshold in outbreak of detection task.\par
Experiments were conducted in 3 datasets ZOO, TIC TAC TOE (UCI data repositories) and third for WSARE implementation. Results concluded that less the support more interesting pattern observed. Depending on the results, range for minimum support is 30\%-50\%. Figure below depicts support applied while experiment ranged from 10\%-100\% graphically. Positions of high gain are detected based on mean running collected output. The graph is analyzed state wise.Hence 40\%-50\% of minimum support is sufficient to generate frequent itemsets. High frequency count determines number of item sites for max detection rate. This paper is so designed to detect prospective interesting pattern from sequence item sets count and hence outbreaks in pattern are identified.\par
Observation: Exact number of min. support and length of item set reduces false rate of outbreak detection. Approx values are considerate and investigations on detection of curve are obligatory.Based upon domain driver framework, a new approach to mine pattern among data stored as schema was proposed by CláudiaAntunes et al \hyperref[b23]{[25]}, which is performed by a D2Apriori algorithm. Problems on Onto4ARframework are centered using ontology and assumes varied problem in context of ontology. The transactions provided in transactional patterns are by knowledge base and since its tuple with ontology characterization by set of features, it corresponds to traditional items. By adapted transactional pattern mining algorithm, new context mining can be achieved, to avail knowledge represented by ontology. The applications are executed on Apriori-based algoritm-D2Apriori with described procedures performed in a two step process as:-1. Receives the dataset as input followed by reception of knowledge base and the constraints applicable. 2. Data file is then read in the context of the knowledge base, creating the dataset with the incorporation of semantics for each read transaction. As a special feature for reduction of time spent in the discovery process, measures adopted by authors are:\par
? Read the set of concepts and its attributes.\par
? Propagate concept properties through the taxonomy.\par
Hence problem for pattern mining and discovery of info in data stored by framework Onto4AR is resolved by overcoming results through traditional pattern approached.\par
Observation: D2Apriori algorithm is inefficient although due to memory consumption.\par
Ya-Han Hu et al \hyperref[b24]{[26]} have highlighted study on Sequential Pattern Frequent Mining with multiple minimum supports. This determines correlations among items or itemsets which ows to varied frequencies, specyfing single minimum support cannot accurately discover interesting patterns. Based on these solutions authors argued that they are not straight forward. So an extended version of PLWAP-tree \hyperref[b27]{[28]}(Preorder linked multiple support tree) structure has been proposed. An efficient algorithm, a extended version of PLWAP-tree, named MSCP-growth(multiple supports candidate pattern) is used for detecting set of sequential patterns with MMS.\par
PLMS-tree obtained from PLWAP tree-like algorithm backups necessary information in sequence database. later, MSCP-growth develops sequential pattern with MMS based on PLMS-tree. Only items with less support than minsup are contained in PLWAP-tree © 2011 Global Journals Inc. (US) while in PLMS-tree not less than MIS(I). in PLMS-tree extra info is required to tree structure but not required for the later part.\par
Observation: In this argument minute inconveniences are detailed. The concept of MMS on sequential pattern generates interesting patterns and an algorithm named MSCP growth is described.With Global Journal of Computer Science and Technology Volume XI Issue XVII Version I 25 advantages of several algorithms combined, And experimental results exhibiting better performances than Compressed and Arranged Transaction Sequences tree(CATS tree) and Grouping Compressed tree mining algorithm, Chuang-Kai et al \hyperref[b26]{[27]} developed a new structure called Sorted Compression tree as mining algorithm for association rule. Inorder to overcome repeated mining due to several minimum support, many algorithms were were proposed, of which CATS tree is one of them. It was ruled out due to drawbacks and better algorithm called Sorted compression tree(SC tree) was brought in, which was efficient and less memory consumptive.\par
Knowledge is derived from statistical data and relationship among products. The later is obtained from "Association Rule Mining" which is usually used. Apriori algorithms and Frequent patterns growth algorithm must use CATS-tree to adjust minimum support value. Its effectiveness is improved by usage of SC-tree, which by pre-sorting dat-set SC-tree results can be reliable.\par
A. Frequent Pattern Growth Algorithm: The FP growth algorithm proposed by Han and et al. is the most typical algorithm which is employed. The technique avoids the scanning of the database frequently, avoiding generating candidate item sets and reducing the hunt space. It is resourceful, scalable and faster than Apriori algorithm. B. Compressed and Arranged Transaction Sequences Tree Algorithm: In CATS tree algorithm, there is no need for reconstruction when the minimum support is altered and it preserves all elements without decreasing. When minimum support threshold is distorted, the tree structure is unnecessary to be reconstructed. CATS algorithm constructs without sorting and hence, a need to adjust the tree structure. C. Grouping Compress Tree Algorithm: The GC-tree increases performance of CATS-tree by pre-processing and compressing data into GC data structure and hence looks out large item set depending upon complexity of data. D. Sorted Compress Tree Algorithm: This algorithm is used for tree construction and rule mining method. It consumes less memory space by the usage of SC-tree in large databases. SC algorithm mines frequent items in 3 stages. 1. Data processing-It sorts and arranges transactions for consistency which in turn help in improving tree constructing and rule mning. 2. SC-tree constructing -SC-tree is constructed by sorting transaction database. 3. Rule Mining in SC-tree-initially nodes are sorted, so as to mine in single direction i.e bottom-up. This process builds conditional mining tree and generates frequent item set.\par
Observation: CATS tree and GC-tree are verified under observations of SC-tree. Focus is on execution and memory consumption in minimum support and transaction size. Under execution and memory requirements spotlight is on efficiency on tree construction and association rule mining. "Fast and memory efficient mining of frequent closed item sets"[29] was authored by Claudio Lucchese et al. It mainly cogitate an ascending algorithm to provide a distilled approach to represent transactional often item sets which are exploited from the database. For the purpose of exploiting the often item sets, it preferred the techniques such as "divide-and-conquer" and "bitwise vertical representation" of the database. To achieve this approach, they utilized the services of separation technique of the "search space". It relies on authentic theoretical model for defining the often item sets clearly. As this algorithm faces the job of managing production of similar item set, it needs to keep an account of concise the space and time complexity for calculating item sets. To satisfy this problem, they opted for an efficient and capable trimming methodology. This methodology has the advantageous edge that it need not place all the fetched data in the main memory. It also has the facility to fetch data from each divided part of search space autonomously. The fetching operation can be pipelined and also it can be done in any sequence. Various examinations were performed over the proposed algorithm mainly commonly accessible data sets which proved this algorithm as an ascendable one which is portable for algorithms as CHARM, CLOSET+ AND FP-CLOSE even for multiple ordered applications. The efficient increments are considered more important in the case of decrement of support threshold. Here, a new walkthrough across the search space which is specific for every item set is proposed. It relies on the idea that there exist producers to maintain available pattern of the often item sets. This technique produces profitable results in the form of enabling us to create autonomous subtasks which can be pipelined.\par
Observation: The methodology proposed in this paper is practically applied to "DCI\textunderscore CLOSED". This approach adopts techniques such as "depth first traversal" and "vertical bitmap representation" of dataset. This approach satisfies all the specifications proposed in the new technique of the paper. Due to the implementation of these techniques and methodologies, the proposed algorithm has limited space and time complexity. From the conducted examinations, it can be drawn that "DCI\textunderscore CLOSED" is ascendable and supports fetching of heavy data sets even with minimum support threshold.\par
Liping Jiet al  {\ref [30]} proposed a clsode pattern detection model called "Compressed Hierarchical Mining of Frequent Closed Patterns from Dense Data Sets". The common technique followed here in all algorithms is that result will be the same whether the data is entirely mined or individually mined. Here, data is Global Journal of Computer Science and Technology Volume XI Issue XVII Version I 26 partitioned in to several blocks and mining algorithm is applied on each individual block and then combined finally. Another advantage is that this process can be done in parallel, saving time and effort with every performance measures rating good. Both the algorithms can compress the mining space and can divide data hierarchically to apply mining. The only difference between the two algorithms is the technique they follow. C-mining follows Compact-Mining technique and Bmining follows Base rows Projection. These two versions can be done in parallel successfully and is shown in this proposal. We do have many other data mining techniques like PB-mining, PC-mining, D-mining along with C and B mining algorithms.\par
Observation: The experimental results can be studied under several results by Varying data set density, Experiments on real micro data set, varying the number of processors and scalability. These show the success of parallelism in the implementation of both C and B mining techniques.\par
An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets was proposed by Jianyong Wang et al  {\ref [31]}. Authentic way of data set fetching includes considering "minimum support" threshold. It may not be feasible to specify "minimum support" everytime. Moreover, the conventional way may demand to fetch whole set of often data sets obeying the threshold. These specifications may restrict its availability as it is hard to avail "minimum support" threshold according to the situation. Moreover, "closed" item sets are compressed than a whole set of often data sets, making it portable and more applicable. Thus, to avoid such limitations, a broader methodology called "mining top-k closed item sets" is proposed. The technique followed here is that the minimum length should be "min\textunderscore l". Here, "k" represents the required count of item sets to be fetched and "min\textunderscore l" stands for the minimum length to be considered. This methodology, TFP, is constructed avoiding the need of "minimum support" threshold. The methodology initializes with the "minimum support" threshold value as 0. This value along with characteristics of top-k often data sets and length limitations, we increment the value of "minimum support" gradually. Also, utilize of "node count" and "descendant sum" techniques, allows the active trimming of FP-tree even prior or posterior to its construction. Even the fetching process can be fasten with the utilization of FP-tree including "top-down" and "bottom-up" traversals, applying heap of "search space" trimming techniques, high speed 2-stepped "hash-indexed result tree" and a new item set closure checking technique. Various examining processes proved that the proposed methodology was more efficient and linear ascendable in case of database space. The methodologies of proposed approach are: incrementing "minimum support" threshold utilizing "closed node count array" and "descendant sum", fetching only required elements initially and leaving rest for the fetch during "FP-tree" fetching, fastening fetching process by embedding "search space" trimming techniques and engaging "closure verification scheme" for packing up item sets.\par
Observation: This algorithm can be broadened to produce association principles and to embed specified limitations. From the analysis over authentic mining, the proposed algorithm is desirable as it avoids the need for specifying "minimum support" threshold. Even many reworks have been started over various elements such as top-k often closed item sets' efficiency, tractability, environment and various sequences.\par
Max-Clique[32] is a top-down Graph-based Approach to Frequent Pattern Mining was proposed by Yan Xie et al. The actual working process here is unlike in traditional methods where entire data is divided into parts and each is applied algorithm and then combined. These traditional approaches can be named Bottom-up since for mining entire data each detail is to be considered which is possible only in bottom-up process. The new strategies are that the data is processed from top to down and the most frequent top K long maximal patterns are identified and are resolved. Here the other small data sets are ignored and concentrated on those large sets. The large frequent patterns identified are called Cliques technically. These cliques are matched with some predefined pattern groups. Then apply Maximal Clique Detection on such cliques. Identifying the cliques is followed by Refinement phase where cliques are transformed into true maximal patterns.\par
Observation: This proposed model let mine only those long and interesting patterns which improve the speed and quality of the product with out negative effects on growth of other patterns which may be considered small. In fact the idea behind and the challenging factor is the identification of those large patterns to be mapped to cliques and is done just opposite to traditional bottom-up process as top-down. 
\section[{VI. ONCLUSION}]{VI. ONCLUSION}\par
The analysis of the pattern and itemset mining algorithms should target performance, scalability, flexibility and reusability for making generation of association rules in robust way. Based on the reviews drafted in this paper, we can conclude that the frequent pattern mining is a price high process. All of the algorithms are worthy to achieve required goals in terms of results. But much of them influenced by an obstacle called multiple pass through given dataset that requires © 2011 Global Journals Inc. (US) much number of disk reads. The rest algorithms those are able to perform mining with single passes are not portray the importance of these patterns. Further research should aim the concerns like flexibility, reusability and prunes in no. of derived patterns without compromising at pattern quality. These requirements influence to gain interest in further research in Frequent Itemset and pattern mining.\par
Global Journal of Computer Science and Technology Volume XI Issue XVII Version I 27\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 			\footnote{© 2011 Global Journals Inc. (US)} 			\footnote{OctoberFrequent Pattern Mining With Closeness Considerations: Current State Of The Art} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Hu]{b24}\label{b24} 	 		\textit{},  		 			Ya-Han Hu 		.  		 	 	 (Fan Wu) 
\bibitem[Agarwal et al. ()]{b18}\label{b18} 	 		‘A tree projection algorithm for generation of frequent itemsets’.  		 			R Agarwal 		,  		 			C C Aggarwal 		,  		 			Vvv Prasad 		.  	 	 		\textit{J Parallel Distribut Comput}  		2001. 61 p. .  	 
\bibitem[Wang and Han ()]{b16}\label{b16} 	 		‘BIDE: Efficient mining of frequent closed sequences’.  		 			J Wang 		,  		 			J Han 		.  	 	 		\textit{Proceeding of the 2004 international conference on data engineering (ICDE'04)},  				 (eeding of the 2004 international conference on data engineering (ICDE'04)Boston, MA)  		2004. p. .  	 
\bibitem[Zaki and Hsiao ()]{b3}\label{b3} 	 		‘CHARM: an efficient algorithm for closed itemset mining’.  		 			M J Zaki 		,  		 			C J Hsiao 		.  	 	 		\textit{Proceeding of the 2002SIAMinternational conference on data mining (SDM'02)},  				 (eeding of the 2002SIAMinternational conference on data mining (SDM'02)Arlington,VA)  		2002. p. .  	 
\bibitem[Wang and Han ()]{b4}\label{b4} 	 		‘CLOSET+: searching for the best strategies for mining frequent closed itemsets’.  		 			J Wang 		,  		 			J Han 		,  		 			PeiJ 		.  	 	 		\textit{Proceeding of the 2003 ACM SIGKDD international conference on knowledge discovery and data mining (KDD'03)},  				 (eeding of the 2003 ACM SIGKDD international conference on knowledge discovery and data mining (KDD'03)Washington, DC)  		2003. p. .  	 
\bibitem[Pei et al. ()]{b2}\label{b2} 	 		‘CLOSET: an efficient algorithm for mining frequent closed itemsets’.  		 			J Pei 		,  		 			J Han 		,  		 			R Mao 		.  	 	 		\textit{Proceeding of the 2000 ACM-SIGMOD international workshop data mining and knowledge discovery (DMKD'00)},  				 (eeding of the 2000 ACM-SIGMOD international workshop data mining and knowledge discovery (DMKD'00)Dallas, TX)  		2000. p. .  	 
\bibitem[Yan et al. ()]{b15}\label{b15} 	 		‘CloSpan: mining closed sequential patterns in large datasets’.  		 			X Yan 		,  		 			J Han 		,  		 			R Afshar 		.  	 	 		\textit{Proceeding of the 2003 SIAM international conference on data mining (SDM'03)},  				 (eeding of the 2003 SIAM international conference on data mining (SDM'03)San Fransisco, CA)  		2003. p. .  	 
\bibitem[Pasquier et al. ()]{b1}\label{b1} 	 		‘Discovering frequent closed itemsets for association rules’.  		 			N Pasquier 		,  		 			Y Bastide 		,  		 			R Taouil 		,  		 			L Lakhal 		.  	 	 		\textit{Proceeding of the 7th international conference on database theory (ICDT'99)},  				 (eeding of the 7th international conference on database theory (ICDT'99)Jerusalem, Israel)  		1999. p. .  	 
\bibitem[Zaki ()]{b13}\label{b13} 	 		‘Efficient enumeration of frequent sequences’.  		 			M J Zaki 		.  	 	 		\textit{Proceeding of the 7th international conference on information and knowledge management (CIKM'98)},  				 (eeding of the 7th international conference on information and knowledge management (CIKM'98)Washington, DC)  		1998. p. .  	 
\bibitem[Bayardo ()]{b8}\label{b8} 	 		‘Efficiently mining long patterns from databases’.  		 			R J Bayardo 		.  	 	 		\textit{Proceeding of the 1998 ACM-SIGMOD international conference on management of data (SIGMOD'98)},  				 (eeding of the 1998 ACM-SIGMOD international conference on management of data (SIGMOD'98)Seattle,WA)  		1998. p. .  	 
\bibitem[Grahne and Zhu ()]{b5}\label{b5} 	 		‘Efficiently using prefix-trees in mining frequent itemsets’.  		 			G Grahne 		,  		 			J Zhu 		.  	 	 		\textit{Proceeding of the ICDM'03 international workshop on frequent itemset mining implementations (FIMI'03)},  				 (eeding of the ICDM'03 international workshop on frequent itemset mining implementations (FIMI'03)Melbourne, FL)  		2003. p. .  	 
\bibitem[frequent pattern mining for outbreak detection, 2nd Conference on Data Mining and Optimization (2009)]{b22}\label{b22} 	 		\textit{frequent pattern mining for outbreak detection, 2nd Conference on Data Mining and Optimization},  		2009. Oct. 2009. p. .  	 	 (DMO '09, Issue Date. On page(s) 
\bibitem[Ezeife and Min Chen (2004)]{b27}\label{b27} 	 		\textit{Incremental mining of Web sequential patterns using PLWAP tree on tolerance MinSupport, Database Engineering and Applications Symposium},  		 			C I Ezeife 		,  		 			Min Chen 		.  		2004. July 2004. p. .  	 	 (On page(s) 
\bibitem[Burdick et al. ()]{b9}\label{b9} 	 		‘MAFIA: a maximal frequent itemset algorithm for transactional databases’.  		 			D Burdick 		,  		 			M Calimlim 		,  		 			J Gehrke 		.  	 	 		\textit{Proceeding of the 2001 international conference on data engineering (ICDE'01)},  				 (eeding of the 2001 international conference on data engineering (ICDE'01)Heidelberg, Germany)  		2001. p. .  	 
\bibitem[Agrawal et al. ()]{b0}\label{b0} 	 		‘Mining association rules between sets of items in large databases’.  		 			R Agrawal 		,  		 			T Imielinski 		,  		 			A Swami 		.  	 	 		\textit{Proceedings of the 1993ACM-SIGMODinternational conference on management of data (SIGMOD'93)},  				 (the 1993ACM-SIGMODinternational conference on management of data (SIGMOD'93)Washington, DC)  		1993. p. .  	 
\bibitem[Liu et al. ()]{b20}\label{b20} 	 		‘Mining frequent item sets by opportunistic projection’.  		 			J Liu 		,  		 			Y Pan 		,  		 			K Wang 		,  		 			J Han 		.  	 	 		\textit{Proceeding of the 2002 ACM SIGKDD international conference on knowledge discovery in databases (KDD'02)},  				 (eeding of the 2002 ACM SIGKDD international conference on knowledge discovery in databases (KDD'02)Edmonton, Canada)  		2002. p. .  	 
\bibitem[Han et al. ()]{b17}\label{b17} 	 		‘Mining frequent patterns without candidate generation’.  		 			J Han 		,  		 			J Pei 		,  		 			Y Yin 		.  	 	 		\textit{Proceeding of the 2000 ACM-SIGMOD international conference on management of data (SIGMOD'00)},  				 (eeding of the 2000 ACM-SIGMOD international conference on management of data (SIGMOD'00)Dallas, TX)  		2000. p. .  	 
\bibitem[Agrawal and Srikant ()]{b10}\label{b10} 	 		‘Mining sequential patterns’.  		 			R Agrawal 		,  		 			R Srikant 		.  	 	 		\textit{Proceedings of the 1995 international conference on data engineering (ICDE'95)},  				 (the 1995 international conference on data engineering (ICDE'95)Taipei, Taiwan)  		1995. p. .  	 
\bibitem[Pei et al. ()]{b7}\label{b7} 	 		‘Mining sequential patterns by pattern-growth: the prefixspan approach’.  		 			J Pei 		,  		 			J Han 		,  		 			Wang J Mortazavi-Aslb 		,  		 			Pintoh 		,  		 			Chenq 		,  		 			Dayalu 		,  		 			-C Hsum 		.  	 	 		\textit{IEEETransKnowl Data Eng}  		2004. 16 p. .  	 
\bibitem[Srikantr ()]{b11}\label{b11} 	 		‘Mining sequential patterns: generalizations and performance improvements’.  		 			Agrawalr Srikantr 		.  	 	 		\textit{Proceeding of the 5th international conference on extending database technology (EDBT'96)},  				 (eeding of the 5th international conference on extending database technology (EDBT'96)Avignon, France)  		1996. p. .  	 
\bibitem[Liu et al. ()]{b6}\label{b6} 	 		‘On computing, storing and querying frequent patterns’.  		 			G Liu 		,  		 			H Lu 		,  		 			W Lou 		,  		 			J X Yu 		.  	 	 		\textit{Proceeding of the 2003 ACM SIGKDD international conference on knowledge discovery and data mining (KDD'03)},  				 (eeding of the 2003 ACM SIGKDD international conference on knowledge discovery and data mining (KDD'03)Washington, DC)  		2003. p. .  	 
\bibitem[Liu et al. ()]{b21}\label{b21} 	 		‘On computing, storing and querying frequent patterns’.  		 			G Liu 		,  		 			H Lu 		,  		 			W Lou 		,  		 			J X Yu 		.  	 	 		\textit{Proceeding of the 2003 ACM SIGKDD international conference on knowledge discovery and data mining (KDD'03)},  				 (eeding of the 2003 ACM SIGKDD international conference on knowledge discovery and data mining (KDD'03)Washington, DC)  		2003. p. .  	 
\bibitem[Antunes (2009)]{b23}\label{b23} 	 		‘Pattern Mining over Star Schemas in the Onto4AR Framework’.  		 			C Antunes 		.  	 	 		\textit{IEEE International Conference on Data Mining Workshops},  				2009. Dec. 2009. p. .  	 	 (ICDMW '09, Issue Date. On page(s) 
\bibitem[Pei et al. ()]{b14}\label{b14} 	 		‘PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth’.  		 			J Pei 		,  		 			J Han 		,  		 			B Mortazavi-Asl 		,  		 			H Pinto 		,  		 			Q Chen 		,  		 			U Dayal 		,  		 			M-C Hsu 		.  	 	 		\textit{Proceeding of the 2001 international conference on data engineering (ICDE'01)},  				 (eeding of the 2001 international conference on data engineering (ICDE'01)Heidelberg, Germany)  		2001. p. .  	 
\bibitem[Pei et al. ()]{b19}\label{b19} 	 		‘PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth’.  		 			J Pei 		,  		 			J Han 		,  		 			B Mortazavi-Asl 		,  		 			H Pinto 		,  		 			Q Chen 		,  		 			U Dayal 		,  		 			M-C Hsu 		.  	 	 		\textit{Proceeding of the 2001 international conference on data engineering (ICDE'01)},  				 (eeding of the 2001 international conference on data engineering (ICDE'01)Heidelberg, Germany)  		2001. p. .  	 
\bibitem[Liao (2010)]{b25}\label{b25} 	 		‘Sequential pattern mining with multiple minimum supports: A tree based approach’.  		 			Yi-Chun Liao 		.  	 	 		\textit{2nd International Conference on Software Engineering and Data Mining (SEDM)},  				June 2010. p. .  	 	 (Issue Date: 23-25. On page(s) 
\bibitem[Chiou and Tseng (2010)]{b26}\label{b26} 	 		‘Sorted Compressed Tree: An Improve Method of Frequent Patterns Mining without Support Constraint’.  		 			Chuang-Kai Chiou 		,  		 			Judy C R Tseng 		.  	 	 		\textit{2nd International Conference on Software Engineering and Data Mining (SEDM)},  				2010. June 2010. p. .  	 	 (On page(s) 
\bibitem[Zakim ()]{b12}\label{b12} 	 		‘SPADE: an efficient algorithm for mining frequent sequences’.  		 			Zakim 		.  	 	 		\textit{Mach Learn}  		2001. 40 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
