\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={Research of Data Mining Algorithm based on Cloud Database},
 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{2014-01-15 (revised: 15 January 2014)}
\def\TheID{\makeatother }
\def\TheDate{2014-01-15}
\title{Research of Data Mining Algorithm based on Cloud Database}
\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]{Xia  Zhang}

             \affil[1]{  henyang University of Technology}

\renewcommand\Authands{ and }

\date{\small \em Received: 12 December 2013 Accepted: 5 January 2014 Published: 15 January 2014}

\maketitle


\begin{abstract}
        


There is an immense amount of data in the cloud database and among these data, much potential and valuable knowledge are implicit. The key point is to discover and pick out the useful knowledge, and to do so automatically. In this paper, the data model of the cloud database is analyzed. Through analyzing and classifying, the common features of the data are extracted to form a feature data set. The relationships among different areas in the data are then analyzed, from which the new knowledge can be found. In the paper, the basic data mining model based on the cloud database is defined, and the discovery algorithm is presented. 

\end{abstract}


\keywords{cloud database, data mining, association rules, classification characteristic}

\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
loud computing is derived from technologies such as distributed processing, parallel processing, grid computing, etc. It is an emerging approach to sharing the infrastructure architecture \hyperref[b0]{[1]}. It distributes all the computing tasks on the resource pool that is made of many computers, making sure all the application systems can acquire desired computing power, memory space and software service according to their demand  {\ref [2]}. All the computing is provided to the terminal user by the form of service, and all the application software in the cloud as shared resources. A cloud database is a database deployed and virtualized in the cloud computing environment. It is predicated that as it develops overtime, more and more people and companies will store all their data in the cloud, which will make data mining based on the cloud computing one of the trends in the future data mining systems \hyperref[b2]{[3]}.\par
There is a massive amount of data in the cloud database, and among them, lives potentially valuable knowledge. How to discover such useful knowledge is the key point in database research. Data mining is the process of picking out the hidden knowledge and regulations, which possess potential value that could influence decision making \hyperref[b3]{[4]}. Data mining namely refers to the knowledge discovery from a database and is comprised of the following procedures: data preprocessing, data alternating, data mining operation, rule expression and evaluation \hyperref[b4]{[5]}. A data mining system includes: control unit -used to control all parts in a harmonious way; database interface -used to generate and process data according to the given query; database -used to store and manage relevant knowledge; focus -refers to the data extent that needs to be inquired; model extracting -refers to the various data mining algorithms; and finally, knowledge evaluation-used to evaluate the extracted conclusion \hyperref[b5]{[6]}. 
\section[{II.}]{II.} 
\section[{Cloud Database}]{Cloud Database}\par
A distributed database is a logical set of the databases at various sites or nodes in a computer network and logically, such databases belong to the same system \hyperref[b6]{[7]}. Different from the traditional distributed database, a cloud database contains isolated as well as shared data; a cloud database can be designed by using different data models, which mainly include the key-value model and relationship model.\par
All data of the key-value model, including the rows and columns, are stored in the cells of a table. Contents are partitioned by row, the rows make up a tablet, and the tablet is stored on a server node. 
\section[{a) Row Key}]{a) Row Key}\par
Data is maintained in the lexicographic order on the row key. For a table, a row interval is dynamically partitioned according to the value of the row key and is the basic unit in which load balancing and data distribution are performed. Row keys are distributed amongst data servers. 
\section[{b) Column Key}]{b) Column Key}\par
Column keys are grouped into sets of many "column families" and are the basic units in which access control is performed. All data stored in a column family usually belong to the same data type, which means data is compressed at a higher rate. Data can be stored in a column key of the column family. 
\section[{c) Timestamp}]{c) Timestamp}\par
Each cell contains multiple versions of the same data and these versions are indexed by the timestamp. Data model for key-value cloud database is as shown in Fig.  {\ref 1}:\par
Figure  {\ref 1} : Data model for key-value cloud database "com.cnn.www" "contents" "anchor:cnnsi.com" "anchor:mylook.ca" "<html>" "<html>" "<html>" "cnn" "cnn.com"t5 t9 t3 t6 t8\par
The data model for the relational cloud database involves such relevant terms as row group and table group. A table is a logical relationship and includes a partitioning key, which is used for partitioning the table. The set of many tables with the same partitioning key is called a table group. In that table group, the set of rows with the same partitioning key value is called a row group. The rows in that row group are always allocated to the same data node. Each table group contains many row groups, which are allocated to different data nodes. A data partition contains many row groups, so each data node stores all rows with a certain partitioning key value. The data model for the relational cloud database is as shown in Fig. \hyperref[fig_0]{2}: The normal target of the association rules is to discover the data relations among the data item set in the relationship type cloud database. Through mining based on the association rules, we can discover the relevance of the data.\par
In the subject item set, there are some target features in the relationship type cloud database. For instance, the commodity data item set in the commercial behavior analysis \{T-shirt, coat, shoes, milk, bread ... \}; data item set in the medical diagnosis analysis \{hypertension, diabetes... \}.\par
Classifying item set has the similar features with the subject item set, for instance, customer data item set in the commercial behavior analysis \{vocation, gender, age... \}; diagnosis behavior in medical diagnosis and signs and symptoms item set \{smoking, polysaccharide, hyperlipidemia ... \}.\par
Sample item set, which has both the features in the subject item set and the transaction data item set in the classifying item set. For instance, transaction data in the commercial activity analysis \{ \{Zhangsan, milk\}, \{Zhangsan, bread\}, \{Lisi, T-shirt\} ... \}, health check information in the medical diagnosis \{\{ Zhangsan, smoking, hypertension\}, \{Lisi, hyperlipidemia, diabetes\}... \}.\par
Through the mining based on the association rules, we can find that 90\% of the customers who bought milk also bought bread; 50\% of the patients who have hyperlipidemia also have diabetes.\par
The common targets of the association rules are transaction databases with the characters of subjects oriented item set. In practice, most databases are relational, and many applications and the required knowledge are from many different item sets(or multiitem set for simplicity). For relational databases, it is difficult to describe the complicated association rules between the multi-item set with models of general association rules. We present the association rules model of multi-item set for the relational databases: Definition 1: I is the subject item set, J is the taxonomy item set, each transaction corresponds to a subset T of the subject item sets and a taxonomy item U of the taxonomy item sets, called T belonging to class U.\par
Model 1: it is supposed that R=(r1,r2,?, rn) is the rows group in the relational cloud database, rk is one of the rows item set, D is a sample item set relevant to R, and each sample d corresponds to one rows item set, i.e. d?R. Each sample is marked with SID (sample identifier). As for the classifying item set X, only when X?d, the sample X belongs to d. association rules is a formula like X?d?Y?d, it can be X?Y, therein, X?R, Y?R and X?Y=?.\par
The rule X?Y in the sample item set D is constrained by degree of confidence C and degree of support S. Degree of confidence C is defined as C\% in the transaction X in D also contains Y. Degree of support S is defined as transaction X?Y accounts for S\% in D. Degree of confidence represents the strength of the rule, while Degree of support means the frequency of the model, which is shown in the rule.\par
In the cloud database containing cases information, 66\% of the crime site in the theft cases happened in factories, so the C is 66\%. Theft cases and factory cases account for 17\% of the total cases, so the S is 17\%.\par
The data frequency item set can be defined as the data item set where the degree of support S is over the pre-defined minimum degree of support S. The association rules with high degree of support S and degree of confidence C is considered strong association rules, otherwise it is considered weak association rules. Association rules mining means to find the line group that accord to the strong association rules in the database.\par
The procedure for mining these kinds of association rules of multi-item set is as follows:\par
1. Divide transaction D into several transaction subset D'=\{D1',D2',?Dn'\} according to taxonomy item sets. 
\section[{For all D1'<D' Do}]{For all D1'<D' Do}\par
Find the strong sets of the main subject item Derive the association rules using the strong set 3. Next These association rules of the multi-item set possess a feature where only one value is available in each sample (SID) set. With this method, mining the data's association rules is applicable for one-to-many relational databases. This is more practical and expands the mining range for the association rules.\par
In practice, most of the applications and knowledge is from the multiple data item set. For example, we regard a criminal case as the sample item set. For each case, there is one mark SID, several suspects, as well as several methods by which the crime is committed. So we can first take the education level of the suspects as one data item set, and the methods of committing crime as another data item set.\par
There are association rules with several multiitem sets, the association rules model can be termed as:\par
Model 2: It is supposed that I=(i 1 ,i 2 ,?, i n ) is a classifying item set, J=(j 1 ,j 2 ,?,j m ) is another one, D is a sample item set, each sample has two classifying item sets T(T?I) and T'(T'?J), and each sample is marked with SID. The formula is X?I?Y?J, degree of confidence C can be termed as that in sample where D contains X?I, C\% has Y?J, degree of support S can be defined as transaction with X?I and Y?J accounts for S\% in D. 
\section[{b) Mining Algorithm}]{b) Mining Algorithm}\par
There are many algorithms in the association rules, and the representative Apriori Algorithm follows the rule that the sub-item sets of all the strong item sets are classified to the strong item sets, while the super item sets of the weak item sets are weak item sets.\par
The first pass of the algorithm simply counts item occurrences to determine the strong 1-itemsets. A subsequent pass, pass k, consists of two phases. First, the strong item sets L found in the (k-1)th pass are used to generate the candidate item sets Ck, using the apriori-gen function. Next, the database is scanned and the support of candidates in Ck is counted. For fast counting, we need to efficiently determine the candidates in Ck that are contained in a given samples.\par
As for the association rules of multiple data item sets, we need to have strong item sets L1 with item 1, and then we can have C2 from L1 with the item 2, after this we can have L2, based on this method we can finally have Ck, and get Lk from the database.\par
Classifying item set D into m classifying item sets D1, D2, ... Dm according to the separating item set J, then we can find out the association rules after using Apriori Algorithm to each sub-sample item set D. Since Model 2 corresponds to two classifying item sets and each sample S?D includes classifying item set I and J, 1-itemsets represent the strong item sets we select from I and J, which is Li,j. From Li,j we can have C1,2 from L1,2, done with the similar manner, and then get L1,k. From L1,1, we can have C2,1 from L2,1, the algorithm is: In management information systems, the relational database is widely used; the connection among different data is one-to-many and many-tomany, so it is universal to discover knowledge in the database. As the cloud age is coming, data mining from the cloud data is more practical. The mining method that is used in the association rules is applied to the cloud database, making the association rules more L 1, 
\section[{Data Mining for Classification Characteristic Rule}]{Data Mining for Classification Characteristic Rule}\par
Knowledge discovered from a database with massive data is diversified in variety. Knowledge classification refers to clustering or classifying tuples in the database to divide these tuples into different categories by characteristic rules extracted from a certain target class, and thus achieve the purpose of describing the characteristics of the tuples of that class.\par
Clustering refers to categorizing a group of individuals into several categories, which means those with the same characteristic are classified as one category. Clustering is a process in which a data object with multiple attributes is continuously classified. In such process, classification is automatically executed by the classification algorithm to divide the data into several classes by identifying data features. A relational database mainly containing character information may be equivalently partitioned into equivalence classes according to the concept of equivalence class. The resulting equivalence classes are a group of classes. The characteristics of each class are further analyzed and this can lead to the determination of the classification characteristic rules. Such analysis process is of practical significance. For example, symptoms and reaction characteristics of various diseases can be determined by analyzing a great amount of medical diagnosis cases. 
\section[{a) Classification Model For Key-Value Model Based}]{a) Classification Model For Key-Value Model Based}\par
Cloud Database\par
Let D be a key-value model based cloud database, K represents the set of all row keys in D with the formula K=\{k1, k2 ,?,kn\}, At represents the set of all column keys in D with the formula A =\{a1,a2,?,am\}, V represents the dataset of certain attribute characters of the column keys with the formula V=\{v11,v12,?,vmn\} and f represents a function of a and k with the formula Vi,j=f(ai,kj). Definition 2: For ?a?A t (A t is the dataset of column keys, A t ?A), if k i ?K, k j ?K, i?j and f(a, ki)= f(a, kj), then ki is said to be equivalent to kj based on the dataset of column key attributes At Example 1: Let D be a key-value model based cloud database, K is the set of all row keys in D, A is the set of all column keys in D and At is a subset of A. V is the dataset of certain attribute characters of the column keys and each data has the latest timestamp. K=\{ k1, k2, k3, k4, k5, k6, k7, k8, k9, k10, k11, k12 \} A =\{a1,a2,a3\} At =\{a1\} V=\{ v10,v11, v12,v20, v21,v30, v31,v32\} The values of f(k,a) are as shown in Table \hyperref[tab_2]{1}. In the above mentioned database, the field \{a1\} in the column key set At can be classified into three classes: K1 = \{k1, k4, k5, k8, k9, k11\}?K2 = \{k2,k7,k10,k12\}? K3=\{k3,k6\}. \{K1,K2,K3\} is a class based on the column key set At, the name of that class is \{v11?v10?v12\} and its classification support degree is \{50\%?33.33\%?16.67\%\}. 
\section[{b) Classification Model for Relational Model Based Cloud Database}]{b) Classification Model for Relational Model Based Cloud Database}\par
Let D be a relational model based cloud database and T be a table group of D, P represents the set of partitioning keys in T with the formula P=\{ p1, p2,?,pn \} and R represents the set of row groups of the partitioning key Pi with the formula R=\{r1,r2,?,rn\}. database and T be a table group of D, S t represents the record count of all row groups, the row group set R is the class based on the partitioning key P and S y represents the record count of Y row groups in R, then S=S y /S t *100\% is said to be the classification support degree of the class Y.\par
Example 2: Let D be a relational model based cloud database and T be a table group of D, P is the partitioning key and the value of P is \{p1,p2,p3\}, then the corresponding row group is \{r1,r2,r3\}, namely: P =\{p1,p2,p3\} R=\{r1,r2,r3\} r1=\{v11,v12,v13,v14,v15,v16\} r2=\{v21,v22,v23\} r3=\{v31\}\par
The above mentioned database can be partitioned into three classes based on the partitioning key P: r1=\{v11, v12, v13, v14, v15, v16\}?r2=\{v21,v22,v23\}? r4=\{v31\}?the name of the class is \{r1,r2,r3\} and the classification support degree is \{60\%?30\%?10\%\}.\par
For the cloud database D, all classification support degrees \{S1,S2,S3,?\} can be obtained according to a certain classification R=\{R1,R2, R3,?\}. Definition 7: Let Sp be a given threshold, 0?S p ?1. Those classes with a classification support degree S?S p are called strong class and those with a classification support degree S<S p are called weak classes.\par
In mining knowledge from massive data, we usually are concerned about and interested in data classes with higher classification support degree, namely the strong classes. Strong classes contain more representative knowledge. 
\section[{c) Classification Characteristic Rule Model}]{c) Classification Characteristic Rule Model}\par
According to the definitions as mentioned above, data in a database can be classified and the characteristics of the strong classes need to be further analyzed.\par
Definition 8: Let E be a At-based class, A t is the complementary set of A t against the attribute A, A t ?A, B is the subset of A t , the equivalence class T based on B is called the characteristic domain in the class E, and the value \{b 1 ,b 2 ,?\} of the attribute in B is called the characteristics in the class E. Definition 9: Let ec be the record count of the class E, and tc be the record count of the characteristic domain T, then C= t c /e c *100\% is said to be the confidence degree of characteristic.\par
Definition 10: Let C p be a given threshold, 0?C p ?1, a characteristic domain with the confidence degree of characteristic C?C p is called a strong characteristic domain and a characteristic domain with the confidence degree of characteristic C<C p is called a weak characteristic domain. The value of the field with strong characteristic domain is called a strong characteristic, while the value of the field with weak characteristic domain is called a weak characteristic.\par
Strong characteristics in a strong class are usually representative knowledge and can be expressed as: ( 
\section[{Application of the Classification Characteristic Rules in Case Information Systems}]{Application of the Classification Characteristic Rules in Case Information Systems}\par
Suppose the related property is the case type, selected site and the way of commit, the related degree of the door smashed versus picked is 0.8, the given threshold of the related degree is 2.5, two cases as shown in Table \hyperref[tab_4]{2}: Based on the above definitions, as long as the related degrees of the related properties are known, the related cases can be discovered. The values of the related degrees are provided by the field experts according to the field knowledge. In order to express the related degrees, a related degree matrix Ma is defined as follows:Ma= ? ? ? ? ? ? ? ? ? ? ? ? mn m m n n C C C C C C C C C ? ? ? ? ? ? ? 2 1 2 22 21 1 12 11\par
(1) Cij: related degree of element j to element i of property a. M a is a symmetrical matrix, so only consider the lower triangle.\par
The related degree matrix of the way of commit is as shown in Table  {\ref 3}: During case analysis, the related degree matrix of all related properties must be known. The sum of case related degrees can be found based on the related properties and the related degree matrix and all the related cases can be found based on the given threshold Cp.\par
Input U, an information system, has n records, Ma is a symmetrical matrix, Mak[i,j] seeks the correlation degree in the correlation matrix. Output L, a set of case related to it.\par
For i=1 To n-1 (n is the record number) For j=i+1 TO n A[i, j] =0 For k=1 TO m A[i,j]=A[i,j]+Mak[i,j] Next If A [i,j]>=Cp uj?\{u-u relates to ui \} End If Nexts L=?\{u-u relates to ui \} Next Output L\par
Following the idea of converging classes, the case information is divided into many kinds with the equivalent dividing method. Define the base value of kinds as classifying the support degrees. The kinds can be divided into strong class ones and weak class ones. The weak class has too small classifying support degrees, no practical meanings and can be neglected. For the strong class, Rough set theory can be used to analyze their common features and form the classifying characteristic regulations.\par
Data was mined from the database for the experimental criminal case information system by using the aforementioned algorithm. Taking the crime approach table group as an example, the table contains 100762 records. Given a classification support degree threshold of 10\%, and a characteristic confidence degree threshold of 20\%, 359 classification characteristic rules were mined, for example:\par
(Residential house, night, 23.4\%) (Rubbery, less than RMB10000, 93.3\%) VI. 
\section[{Conclusions}]{Conclusions}\par
The data mining technique is new to the information society. Many subjects need to be studied in this field. In many professions, a certain amount of databases have been accumulated, in which some hidden knowledge needs to be discovered. Starting with the concept of set theory, the data model for the cloud database was analyzed; the model and algorithm for mining classification characteristic rules from cloud database were designed to make data mining of classification characteristic rule more practical.\par
The abstracted related knowledge models presented in this paper can be put into practice in the public security affairs, such as case chaining, which is one of the highly demanded, complex tasks in the public security affairs. The presented methods about the related case data mining in this paper promote the work effect of the chained cases. On the case material analysis, the mining of the classifying characteristic regulations help users with their classifying work and overcome the weaknesses that exist in the old statistics method, in which repeated experimentation are required. \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 2 :}\end{figure}
      \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.85\textwidth}}
for(j=1;j<=m;j++) do\\
begin\\
L j,1 =\{large 1-items\};\\
for (k=2;L j,k-1 ??;k++) do\\
begin\\
C k =apriori-gen(L j,k-1 );\\
forall samples s?D j do\\
begin\\
Cs=subset(C k ,s);\\
forall candidates c?Cs do\\
c.count++;\\
end\\
L j,k =\{c?C k |c.count>=minsup\}\\
end\\
Answer=? j,k L j,k ;\\
end;\\
Lj,1\end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.1789473684210526\textwidth}P{0.22368421052631576\textwidth}P{0.22368421052631576\textwidth}P{0.22368421052631576\textwidth}}
A\tabcellsep A1\tabcellsep A2\tabcellsep A3\\
k 1\tabcellsep v 11\tabcellsep v 20\tabcellsep v 32\\
k 2\tabcellsep v 10\tabcellsep v 21\tabcellsep v 30\\
k 3\tabcellsep v 12\tabcellsep v 20\tabcellsep v 30\\
k 4\tabcellsep v 11\tabcellsep v 21\tabcellsep v 30\\
k 5\tabcellsep v 11\tabcellsep v 20\tabcellsep v 32\\
k 6\tabcellsep v 12\tabcellsep v 20\tabcellsep v 30\\
k 7\tabcellsep v 10\tabcellsep v 21\tabcellsep v 31\\
k 8\tabcellsep v 11\tabcellsep v 21\tabcellsep v 31\\
k 9\tabcellsep v 11\tabcellsep v 20\tabcellsep v 32\\
k 10\tabcellsep v 10\tabcellsep v 21\tabcellsep v 31\\
k 11\tabcellsep v 11\tabcellsep v 20\tabcellsep v 32\\
k 12\tabcellsep v 10\tabcellsep v 21\tabcellsep v 31\end{longtable} \par
 
\caption{\label{tab_2}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.7755892255892255\textwidth}P{0.025757575757575757\textwidth}P{0.008585858585858586\textwidth}P{0.040067340067340064\textwidth}}
E?T?Cp)\tabcellsep \tabcellsep \tabcellsep \\
E: class\tabcellsep \tabcellsep \tabcellsep \\
T: characteristic\tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{3}{l}{Cp: confidence degree of characteristic}\tabcellsep \\
Discovery\tabcellsep Algorithm\tabcellsep for\tabcellsep Classification\\
Characteristic Rules.\tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{4}{l}{D is a cloud database and A is the set of classification}\\
attributes of D.\tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{2}{l}{For all A t For j=1 To k Do}\tabcellsep \tabcellsep \\
\multicolumn{2}{l}{if C i ?C p Then}\tabcellsep \tabcellsep \\
\multicolumn{2}{l}{(E i , T j , C j ) ?result base}\tabcellsep \tabcellsep \\
Endif\tabcellsep \tabcellsep \tabcellsep \\
Next\tabcellsep \tabcellsep \tabcellsep \\
Endif\tabcellsep \tabcellsep \tabcellsep \\
Next\tabcellsep \tabcellsep \tabcellsep \\
Next\tabcellsep \tabcellsep \tabcellsep \\
V.\tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_3}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{P{0.08333333333333333\textwidth}P{0.20833333333333331\textwidth}P{0.2583333333333333\textwidth}P{0.3\textwidth}}
\tabcellsep Case kind\tabcellsep Selected site\tabcellsep Way of commit\\
Case1\tabcellsep Burglary\tabcellsep residence\tabcellsep door picked\\
Case2\tabcellsep Burglary\tabcellsep residence\tabcellsep door smashed\end{longtable} \par
 
\caption{\label{tab_4}Table 2 :}\end{figure}
 			\footnote{© 2014 Global Journals Inc. (US)} 			\footnote{© 2014 Global Journals Inc. (US) Global Journal of Computer Science and Technology} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Zhu and Zhang]{b3}\label{b3} 	 		‘Application of the data mining technique in case information systems’.  		 			T X Zhu 		,  		 			W P Zhang 		,  		 			D 		.  	 	 		\textit{ICCSEE}  		2012  (1)  p. .  	 
\bibitem[He et al. ()]{b5}\label{b5} 	 		‘Cloud Computing-Oriented Data Mining System Architecture’.  		 			J J He 		,  		 			C M Ye 		,  		 			X B Wang 		,  		 			Z X Huang 		,  		 			Q L Liu 		.  	 	 		\textit{Application Researche of Computers}  		2011. 28  (4)  p. .  	 
\bibitem[Abouzeid et al. ()]{b6}\label{b6} 	 		‘HadoopDB: An architectural hybrid of MapReduce and DBMS technologies for analytical workloads’.  		 			A Abouzeid 		,  		 			K Bajda-Pawlikowski 		,  		 			D J Abadi 		,  		 			A Rasin 		,  		 			A Silberschatz 		.  	 	 		\textit{PVLDB}  		2009. 2  (1)  p. .  	 
\bibitem[Jaatun Zhao Rong (ed.) ()]{b1}\label{b1} 	 		\textit{Proc. of the 1st Int'l Conf. on Cloud Computing},  				 			M G Jaatun,  			G S Zhao,  			C M Rong 		 (ed.)  		 (of the 1st Int'l Conf. on Cloud ComputingBerlin)  		2009. 2009. Springer-Verlag. p. .  	 
\bibitem[Lin et al. ()]{b0}\label{b0} 	 		‘Research on cloud databases’.  		 			Z Y Lin 		,  		 			Y X Lai 		,  		 			C Lin 		,  		 			Y Xie 		,  		 			Q Zou 		.  	 	 		\textit{Journal of Software}  		2012. 23  (5)  p. .  	 
\bibitem[Feng et al. ()]{b2}\label{b2} 	 		‘Study on cloud computing security’.  		 			D G Feng 		,  		 			M Zhang 		,  		 			Y Zhang 		,  		 			Z Xu 		.  	 	 		\textit{Journal of Software}  		2011. 22  (1)  p. .  	 
\bibitem[Zhu et al. ()]{b4}\label{b4} 	 		‘Technology for Mining Classification-Characteristic Rules’.  		 			T X Zhu 		,  		 			L Li 		,  		 			Z W Xu 		.  	 	 		\textit{Journal of Shenyang Polytechnic University}  		1999. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
