\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={An Aprori Algorithm in Distributed Data Mining System},
 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{2013-01-15 (revised: 15 January 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-01-15}
\title{An Aprori Algorithm in Distributed Data Mining System}
\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 C.Sunil  Kumar}

             \affil[1]{  }

\renewcommand\Authands{ and }

\date{\small \em Received: 13 December 2012 Accepted: 31 December 2012 Published: 15 January 2013}

\maketitle


\begin{abstract}
        


Many existing data mining (DM) tasks can be proficient effectively only in a distributed condition.The ground of distributed data mining (DDM) has therefore gained growing weightage in the preceding decades. The Apriori algorithm (AA) has appeared as one of the greatest Association Rule mining (ARM) algorithms. Ii also provides the foundation algorithm in majority of parallel algorithms (PAs). The size and elevated dimensionality of datasets characteristically existing as a key to difficulty of AR finding, makes it perfect difficulty for solving on numerous processors in parallel. The main causes are the computer memory and central processing unit pace constraints looked by single workstations. This paper is based on an Optimized Distributed AR mining algorithm for biologically distributed information is used in similar and distributed surroundings so that it decreases communication costs.

\end{abstract}


\keywords{association rules (ars), apriori algorithm (aa), distributed data mining (ddm), xml data, parallel.}

\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
RM has turn out to be one of the hub DM tasks and has attracted marvelous interest among DM investigators. ARM is an unsupervised DM method which works on variable length data, and produces understandable results. There are two foremost approaches for utilizing numerous workstations that have appeared in distributed computer memory in which each CPU has a confidential memory; and public memory in which all CPUs access universal memory \hyperref[b3]{[4]}. Collective memory planning has many gorgeous assets. Each CPU has straight and identical right to use memory in the computer system. Equivalent applications are easy to execute on such a distributed system. In allocated memory design each CPU has its own restricted memory that can simply right to use directly by that CPU \hyperref[b9]{[10]}. For a CPU to have contact with facts in the restricted memory of another CPU a replica of the preferred data ingredient must be sent from one CPU to the other throughout message passing. XML information is used with the optimized distributed association rule mining (ODAM) algorithm. A similar application could be divided into numeral of jobs and implemented in parallel on different CPUs in the system \hyperref[b1]{[2,}\hyperref[b8]{9]}. Though the performance of a similar function on a distributed system is mainly depe-ndent on the distribution of the jobs contains the applic ation onto the obtainable CPUs in the system.\par
Modern associations are biologically dispersed. Classically, each location locally stores its ever growing amount of every day data. Using centralized DM to find out useful patterns in such institutions' data isn't always practicable because integration of data sets from dissimilar locations into a centralized location earns enormous communication system costs. Information from these institutions' is not only spread to a variety of sites but also vertically incoherent, making it complex if not unfeasible to merge them in an essential site.\par
Distributed DM therefore emerged as vigorous subarea of DM investigation. In this paper an ODAM Algorithm is used for executing the mining procedure. 
\section[{II. Association Rule Mining Algorithms}]{II. Association Rule Mining Algorithms}\par
An AR is a rule which implies certain association relationships among a set of objects in a database.\par
Given a set of transactions, where each transaction is a set of items, an AR is an expression of the form X Y, where X and Y are sets of items. The intuitive meaning of such a rule is that transactions of the database which contain X tend to contain Y \hyperref[b0]{[1]}. 
\section[{a) Apriori Algorithm}]{a) Apriori Algorithm}\par
Apriori has been urbanized for rule mining in large business databases by Quest project team of IBMs. An item set (IS) is a non-empty set of things. 
\section[{They have decayed the difficulty of mining ARs into two (2) pieces}]{They have decayed the difficulty of mining ARs into two (2) pieces}\par
? Find all groupings of items that have business support above smallest support. Call those groupings frequent ISs \hyperref[b4]{[5]}. ? Use the recurrent IS to produce the preferred rules.\par
The universal idea is that if, say, EFGH and EF are recurrent ISs, then we can determine if the rule EF GH holds by computing the ratio R = support(EFGH)/support(EF). The rule holds only if R >= min assurance. The algorithm is extremely scalable \hyperref[b6]{[7]}. The AA used in Quest to find all recurrent ISs is specified below.\par
Procedure AprioriAlg () begin M1 := \{frequent 1-itemsets\}; for ( k := 2; Mk-1 0; k++ ) do \{Nk= Apriori-gen (Mk-1); // new candidates for all transactions t in the dataset do\} \{for all candidates c Nk contained in t do c: count++\} In the first pass, the algorithm simply counts item occurrences to determine the frequent 1-itemsets. A succeeding pass, say pass k, consists of two phases. First, the recurrent ISs Mk-1 found in the (k-1) th pass are used to make the candidate ISs Nk, using the Apriori-gen () function. This task first joins Mk-1 with Mk-1, the joining condition being that the lexicographically ordered first k-2 items are the same. Next, it deletes all those ISs from the join result that have some (k-1)subset that is not in Mk-1 yielding Nk. The algorithm now examines the database. For each deal, it concludes which of the candidates in Nk are limited in the deal using a hash-tree data structure and increases the count of those candidates \hyperref[b7]{[8]}, at the end of the pass, Ck is observed to decide which of the candidates' frequent, yielding Mk. The algorithm quits when Mk becomes vacant. 
\section[{III. Optimized Distributed Mining Algorithm}]{III. Optimized Distributed Mining Algorithm}\par
The presentation of Apriori agent rule mining algorithms humiliates for diverse causes. It requires 'N' number of database examines to produce a common n-IS. In addition, it doesn't differentiate operations in the data set with identical ISs if that data set is not burdened into the memory.\par
Consequently, it needlessly occupies resources for frequently generating ISs from such matching transactions. For e.g., if a data set has 10 matching transactions, the AA not only indicates the same candidate ISs 10 times but also informs.\par
The support counts for those candidate ISs 10 times for every iteration. Furthermore, openly loading a unprocessed data set into the memory won't find an significant number of equal transactions because each business of a raw data set contains both recurrent and non-recurrent items. To overcome these difficulties, candidate support counts can't be supported from the raw data set following the first pass. This method not only decreases the average business length but also decreases the data set size considerably. The number of items in the data set might be huge, but only a few will gratify the support threshold (TH).\par
Consider  ODAM eliminates all globally infrequent 1itemsets from every transaction and inserts them into the main memory; it reduces the transaction size and finds more alike transactions. This is because the data set initially contains both frequent and rare items. However, total transactions could surpass the main memory limit.\par
ODAM removes rare items and inserts each transaction into the main memory. While inserting the transactions, it checks whether they are already in memory. If yes, it increases that transaction's counter by one. Otherwise, it inserts that transaction into the main memory with a count equal to one. Finally, it writes all main-memory entries for this separation into a temporary file. This process continues for all other divisions.\par
IV. 
\section[{Pada Rule with Xml Data}]{Pada Rule with Xml Data}\par
Parallelism is predictable to relieve current ARM methods from sequential blockages, providing the ability to scale to enormous datasets and improving the response time. The parallel and Distributed Association rule (PADA) design space spans three main components including the hardware platform, the kind of parallelism broken and the load balancing strategy used \hyperref[b7]{[8]}. Shared memory architecture has all the processors access common memory. Each processor has direct and equal access to all the memory in the system.\par
Parallel programs are easy to execute on such a system. The data warehouse (DW) is partitioned among 'P' processors logically. Each processor works on its local partition of the database but performs the same computation of counting support. Dynamic load balancing seeks to address this issue by balancing the load and reassigning the loads to the lighter ones. The development of distributed rule mining is a challenging and vital task, since it requires knowledge of all the data stored at different locations and the ability to combine partial results from individual databases into a single result.\par
The AR from XML data with a sample XML document is considered. For example, the set of transactions are identified by the tag <transactions> and each transaction in the transactions set is identified by the tag <transaction>. The set of items in each transaction is: Transaction document (transactions.xml) is identified by the tag <items> and an item is identified by the tag <item>. Consider the problem of mining all ARs among items that emerge in the transactions document. With the understanding of traditional AR mining is expected to obtain the large item sets document and ARs document from the source document.\par
Let the minimum support (minsupp) = 35\% and minimum confidence (minconfi) = 99\%.\par
V. 
\section[{Performance Assessment}]{Performance Assessment}\par
The number of messages that ODAM exchanges among various locations to generate the globally frequent item sets in a distributed environment, the original data set is partitioned into five partitions. To decrease the dependency among dissimilar partitions, each one contains only 25 percent of the original data set's transactions. So, the number of identical transactions among different partitions is very low.\par
ODAM provides a proficient method for generating ARs from different datasets, distributed among various locations.\par
The datasets are generated arbitrarily depending on the number of different items, the maximum number of items in each transaction and the number of transactions. The performance of the XQuery implementation is dependent on the number of large item sets found and the size of the dataset as shown in the  The running time for dataset-1 with minimum support 20\% is much higher than the running time of dataset-2 and dataset-3, since the number of large item sets found for dataset-1 is about 2 times more than the other datasets. The Response time of the parallel and distributed data mining task on XML data is carried out by the time taken for communication, computation cost involved \hyperref[b5]{[6]}. Communication time is largely dependent on the DDM operational model and the architecture of the DDM systems. The computation time is the time to perform the mining process on the distributed data sets. AR mining is a vital problem of DM. It's a new and challenging area to perform AR mining on XML data due to the difficulty of XML data. In our approach, numerous problems in XML data is handled suitably to assure the correctness of the result. The ODAM Algorithm is used for the mining process in a parallel and distributed setting. The response time with the communication and computation factors are measured to achieve an improved response time. The performance examination is done by increasing the number of processors in a distributed environment. As the mining process is done in parallel an optimal solution is obtained. \begin{figure}[htbp]
\noindent\textbf{2013}\includegraphics[]{image-2.png}
\caption{\label{fig_0}A © 2013}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-3.png}
\caption{\label{fig_1}CFigure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}}\end{figure}
    \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.85\textwidth}}
NF= \{Non-frequent global 1-itemset\} for all transaction\\
t £ D \{for all 2-subsets s of t\\
if (s £ C2) s.sup++:\\
t/=delete\textunderscore nonfrequent\textunderscore items(t);\\
Table.add (t/);\}\\
Send\textunderscore to\textunderscore receiver (C2);\\
/* Global Frequent support counts from receiver*/\\
F2=receive\textunderscore from\textunderscore receiver (F?);\\
C3= (Candidate item set);\\
T=Table.getTransactions (); k=3;\\
While (Ck ?\{\}) \{For all transaction t £ T\\
For all k-subsets s of t\\
If (s £ Ck) s.sup++;\\
k++; Send\textunderscore to\textunderscore receiver (Ck);\\
/* Generating candidate item set of k+1 pass*/\\
Ck+1=\{Candidate item set); \}\\
Volume XIII Issue XII Version I\\
Global Journal of Computer Science and Technology\\
© 2013 Global Journals Inc. (US)\end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Cheung ()]{b2}\label{b2} 	 		‘A Fast Distributed Algorithm for Mining Association Rules’.  		 			D W Cheung 		.  	 	 		\textit{Proc. Parallel and Distributed Information Systems},  				 (Parallel and Distributed Information Systems)  		1996. IEEE CS Press. p. .  	 
\bibitem[Park et al. ()]{b7}\label{b7} 	 		‘An Effective Hash Based Algorithm for Mining Association Rules’.  		 			J S Park 		,  		 			M Chen 		,  		 			P S Yu 		.  	 	 		\textit{Proc. 1995 ACM SIGMOD Int'l Conf. Management of Data},  				 (1995 ACM SIGMOD Int'l Conf. Management of Data)  		1995. ACM Press. p. .  	 
\bibitem[Savasere et al. ()]{b3}\label{b3} 	 		‘An Efficient Algorithm for Mining Association Rules in Large Database’.  		 			A Savasere 		,  		 			E Omiecinski 		,  		 			S B Navathe 		.  	 	 		\textit{Proc. 21st Int'l Conf. Very Large Databases (VLDB 94)},  				 (21st Int'l Conf. Very Large Databases (VLDB 94))  		1995. Morgan Kaufmann. p. .  	 
\bibitem[Cheung ()]{b9}\label{b9} 	 		‘Efficient Mining of Association Rules in Distributed Databases’.  		 			D W Cheung 		.  	 	 		\textit{IEEE Trans.Knowledge and Data Eng}  		1996. 8  (6)  p. .  	 
\bibitem[Agrawal and Srikant ()]{b0}\label{b0} 	 		‘Fast Algorithms for Mining Association Rules in Large Database’.  		 			R Agrawal 		,  		 			R Srikant 		.  	 	 		\textit{Proc. 20th Int'l Conf. Very Large Databases},  				 (20th Int'l Conf. Very Large Databases)  		1994. Morgan Kaufmann. p. .  	 
\bibitem[Zaki and Pin ()]{b5}\label{b5} 	 		‘Introduction: Recent Developments in Parallel and Distributed Data Mining’.  		 			M J Zaki 		,  		 			Y Pin 		.  	 	 		\textit{J. Distributed and Parallel Databases}  		2002. 11  (2)  p. .  	 
\bibitem[Han et al. ()]{b4}\label{b4} 	 		‘Mining Frequent Patterns without Candidate Generation’.  		 			J Han 		,  		 			J Pei 		,  		 			Y Yin 		.  	 	 		\textit{Proc. ACM SIGMOD Int'l. Conf. Management of Data},  				 (ACM SIGMOD Int'l. Conf. Management of Data)  		2000. ACM Press. p. .  	 
\bibitem[Zaki ()]{b8}\label{b8} 	 		\textit{Parallel Data Mining for Association Rules on Shared-Memory Multiprocessors},  		 			M J Zaki 		.  		 TR 618.  		1996.  		 			Computer Science Dept., Univ. of Rochester 		 	 	 (tech. report) 
\bibitem[Shafer ()]{b1}\label{b1} 	 		‘Parallel Mining of Association Rules’.  		 			R 		,  		 			J C Shafer 		.  	 	 		\textit{IEEE Tran}  		March 2004. 1996. 8  (6)  p. .  	 	 (Data Eng.) 
\bibitem[Zaki ()]{b6}\label{b6} 	 		‘Scalable Algorithms for Association Mining’.  		 			M J Zaki 		.  	 	 		\textit{IEEE Trans. Knowledge and Data Eng}  		2000. 12  (2)  p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
