\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={Nomenclature and Benchmarking Models of Text Classification Models: Contemporary Affirmation of the Recent Literature},
 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 2014-01-15 (revised: 20 Year 2014 15 January 2014)}
\def\TheID{\makeatother }
\def\TheDate{2014 2014-01-15}
\title{Nomenclature and Benchmarking Models of Text Classification Models: Contemporary Affirmation of the Recent Literature}
\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]{Venkata  Ramana.A}

             \author[2]{Dr. E. Kesavulu  Reddy}

             \affil[1]{  S.V.University,}

\renewcommand\Authands{ and }

\date{\small \em Received: 8 December 2013 Accepted: 31 December 2013 Published: 15 January 2014}

\maketitle


\begin{abstract}
        


In this paper we present automated text classification in text mining that is gaining greater relevance in various fields every day. Text mining primarily focuses on developing text classification systems able to automatically classify huge volume of documents, comprising of unstructured and semi structured data. The process of retrieval, classification and summarization simplifies extract of information by the user. The finding of the ideal text classifier, feature generator and distinct dominant technique of feature selection leading all other previous research has received attention from researchers of diverse areas as information retrieval, machine learning and the theory of algorithms.To automatically classify and discover patterns from the different types of the documents [1], techniques like Machine Learning, Natural Language Processing (NLP) and Data Mining are applied together. In this paper we review some effective feature selection researches and show the results in a table form.

\end{abstract}


\keywords{}

\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[{I. INTRODUCTION}]{I. INTRODUCTION}\par
esearch on text categorization has emerged into a new level with the speed in advancement of internet technology. Various techniques were developed such as Machine Learning, Support Vector Machines (SVMs), KNN, Neural Network, Boosting and Naive Bayes variants \hyperref[b1]{[2]} etc. Machine learning technique has evolved into a foremost model of text categorization \hyperref[b2]{[3]}.\par
Text classification is used in diverse fields for managing documents stored as texts in databases. The information today is composed of a large set of documents from multiple sources, such as news, articles, books, digital libraries, e-mail messages and web pages. Applications of text classification are being used in areas such as; in news delivery for classifying articles automatically into subjects and made available to users based on their search profile or interests.\par
In content management, grouping documents into many-sided categories is to simplify searching and browsing.\par
In identifying spam mail where thequestionable mails are flagged as suspected spam and separated for batch deletion. In e-commerce for a) Document Preprocessing Document preprocessing step indexes the documents to minimize the complexity in documents. 
\section[{b) Feature Selection}]{b) Feature Selection}\par
Feature selection methods are a preprocessing step. The selected features from the training set are then used to classify new incoming documents. The popular feature selection methods are document frequency, term frequency, chi-square statistic and Accuracy. Feature selection consists of the following steps;\par
i. Preprocessing -In the preprocessing stage, the various steps are; a. Feature Extraction -To generate text features based on the occurrence of the words in the document. b. Feature Filtering -To eliminate irrelevant or noisy features and non-discrimination in the data \hyperref[b3]{[4]} effectively reducing the size of feature set. c. Document Representation -The document is transformed from a full text version to a vector space representation. ii. Classifier building -Is performed by a score based strategy where words are scored with respect to their occurrence in the given document. This is predefined by the measure of weight of the word to decrease the high dimensionality space. The selected features are then used to apply feature selection using different policies for text classification.\par
In this paper we discuss feature selection methodologies in text classification and review some effective methods for text classification and how performance can be increased \hyperref[b4]{[5,}\hyperref[b5]{6]}. C item descriptions in shopping and auction web sites where short texts are used for classification. In call centers offering support services, the text notes of call logs are classified with respect to defined criteria to identify trends periodically. These are but a few examples of how text classification is finding its way into applications and text classification systems. The text classification process involves various steps like indexing, feature generation, feature filtering and feature selection. 
\section[{a) Text Classification}]{a) Text Classification}\par
Text classification is the process of classifying the documents into predetermined categories. The engineering methodologies define a group of consistent rules for accurately classifying documents into a categorical set. The nature of classifying the documents can be of 3 types: i) Unsupervised, ii) Supervised and iii) Semi Supervised. Automatic text classification widely studied since the last few years has rapidly evolved due to fast development of internet technology.\par
1. Document Preprocessing -Document preprocessing step indexing of documents to minimize the complexity in the documents. The documents are classified into 2 types based on the class: (i) Single Label and (ii) Multi-Label. Single label document are fit for only a single class whereas multi label documents may be fit for single and multiple classes. 2. Feature Selections -Feature selection involves generation of filters focusing on relevant and informative data. The feature filtering process and feature selection are used for selecting features useful for text categorization with respect to scalability, efficiency as well as accuracy. 3. Applying Feature Selection: To apply feature selection in text categorization there are two major policies; (i) Local Policy: In the local policy a varied set of features are chosen from each class not dependent on other classes providing identical weight to each class and optimizing the performance by choosing the most important features for each class. (ii) Global policy: In the global policy a single set of features are chosen from all classes, providing a global view of the whole dataset and a single global score from the local scores \hyperref[b7]{[8,}\hyperref[b8]{9]}. E.g.: The automatic labeling of every inbound news item with a predefined subject like "media", "politics" or "sports" or "art". First a training set D = (d1?.. dn) of documents that are already labeled with a class C1, C2 (e.g. politics, sport) is selected. Next a classification model that is competent enough for labeling a new document d of the vertical with the right class is determined. The most commonly used document representation is known as vector space model (SMART) \hyperref[b6]{[7]}. In this paper we focus on classification of single label document. The process of Text Feature Generation is to come up with an array of feature generators that make the feature selector choose powerful predictive features.\par
First it is important to ascertain what qualifies to be counted as a word or a term. Difficulty arises in instances like 'HP-UX' qualifying as single word or couple of words and how to ascertain the type of term '650-857-1501'? In programming, a simple solution requires contiguous sequence of alphabetic characters; or alphanumeric characters including identifiers like 'ioctl32', that are occasionally helpful. By means of the Posix regular expression \textbackslash p\{L\&\}+ we evade breaking 'na?ve' in two and also several accented words in French, German, etc. Difficulty arises in case of words like 'win 32', 'can't' or words that may be hyphenated over a line break. Similar to several other data cleaning techniques, the list of exceptions is never-ending and we have to limit the expectation and expect for an 80\%-20\% exchange. An advantage is semantic errors in word parsing are generally observed by the core learning algorithm. So their statistical properties are of importance not its readability or intuitiveness to people. Major feature generators that are useful differ according to the domain text qualities. The typical feature generators applied are; i. Word Merging Merging is a technique of decreasing the size of the feature space considerably by merging different word variants and treating the new entity as a single feature. This significantly improves the predictive value of certain features.\par
Force conversion of all letters to lowercase is a generally accepted technique. Letters at the start of a sentence, which does alter the word's meaning, and helps lessen the dispersion. In case of proper nouns, it frequently conflates other word meanings, e.g. 'Bush' or 'LaTeX.' Several word stemming algorithms could be used for merging multiple related word forms. For merged into a common feature. Stemming normally is advantageous for recall however affects the precision. As in the example above if one is searching for 'catty' and the word is considered the same as 'cat,' then essentially a definite amount of precision is lost. In case of exceedingly skewed class distributions, this loss may greatly affect precision. 
\section[{Global}]{Global}\par
Also stemming algorithms give errors of both over-stemming and under-stemming; however, the semantics occupy less significance compared to feature's statistical properties. Stemmers have to be individually designed for every natural language and there are several fine stemmers existing for Roman languages whereas for other languages such as Hebrew and Arabic the stemming process becomes difficult. Further for some applications of text classification, there occurs mixing of multiple natural languages together, at times even inside only one training case. This necessitates a language recognizer to determine the type of stemming algorithm that needs to be used for each case or each sentence. However this level of complexity and slowdown is not desired. Stemming by merely considering the initial few characters of every word may give equal classification accuracy for several classification problems. Misspellings that commonly occur in technical texts or blogs and resolving with an automatic spelling correction step provided in the processing pipeline is occasionally proposed to ease classification but the errors revealed may overshadow the supposed advantage. A familiar problem with the spell checker is that out-of-vocabulary (OOV) words are forced to the nearest known word that can have totally different meaning. This is generally seen with technical terms that can be crucial predictors. Common misspellings may give frequent misspelled form and appear as a useful feature, e.g. 'volcano.'\par
Out-of-vocabulary (OOV) words are mostly words like abbreviations and acronyms found in governmental or technical texts. In case if glossaries can be referred, the short and long forms can be merged into a single term. Though several acronym dictionaries exist online, there are many types of short acronyms that are extremely document and even domain-specific. A few of the researches have shown success identifying acronym definitions in text, such as '(OOV)' above, that gives a locally clear-cut definition for the term. Online thesauruses may as well be used to merge together dissimilar words, e.g. to resolve the 'color' vs. 'hue' problem however the technique hardly ever helps, as multiple meanings exist for many words that distorted their final meanings. To disambiguate word meanings correctly would require a much deeper understanding of the text than is needed for text classification. However, this problem is overcome by using domain-specific thesauruses of synonyms. For instance in representing a huge set of part numbers corresponding to a common product line a single feature to represent all proves very beneficial.\par
While merging related words with each other can turn out features with additional frequent occurrence (characteristically with greater recall and lower precision).\par
ii. Word Phrases Identifying multiple word phrases as a single term can generate rarer, highly specific features (which regularly aid precision and have lower recall), e.g. 'John Denver' or 'user interface.' However instead of using a dictionary of phrases as in the above case an easy technique is to consider all successive pairs of words as a phrase term and let feature selection decide which are helpful for prediction. Modeled on the new technology of online searching, the recent trend to eliminate spaces in proper names, e.g. 'SourceForge,' gives the specificity of phrases devoid of any particular software deliberations. Also the same can be applied to phrases having three or more words with intermittently more specificity and also with strictly decreasing frequency. Maximum advantage is gained with two-word phrases \hyperref[b9]{[10]} to some extent as the parts of the phrase may previously have the identical statistical properties, e.g. the phrase with four words 'United States of America' is previously enclosed by the two-word phrase 'United States.' Also, the extent of a two-word phrase can be extended by removing general stopwords, e.g. 'head of the household' turns into 'head household.' However the stop word lists are language specific and have limitations. The main advantage of classification lies in increasing the extent of phrases, instead of removing frequently useless words that could be already removed in a language-independent fashion with maximum feature selection techniques. 
\section[{iii. Character N-grams}]{iii. Character N-grams}\par
The word identification techniques discussed previously do not succeed in some cases and cannot succeed in spotting some good features. For instance, languages like Chinese and Japanese do not employ a space character. Segmenting such text into words is difficult, however approximately comparable accuracy might be gained just by means of every set of adjoining Unicode characters as features n grams ? . Definitely several of the variants will be worthless; however feature selection is able to identify the maximum predictive features. In case of languages that utilize the Latin character set, 3-grams or 6-grams may be right The general Adobe PDF document format, records the position of each character on the page and does not clearly records spaces. Software libraries to pull out the text from PDF utilize heuristics to determine where to output a space character. Due to this reason text extracts either occasionally overlook spaces amid the words or have a space character placed among every pair of letters. Obviously, such issues will cause chaos with a classifier that relies on spaces to recognize words. A more strong technique is for the feature generator to remove all whitespace that gives n-grams from the resulting sequence. 
\section[{iv. Multi-Field Records}]{iv. Multi-Field Records}\par
Multi-field records are regularly used as maximum applications have multiple text (and non-text) fields with respect to each record, though in most applications of text classification research deal with training cases as a single string. These fields in document management are usually title, author, abstract, key-words, body and references. In the field of technical support, these may be title, product, keywords, engineer, customer, symptoms, problem description, and solution. Additionally classifying long strings, e.g. arbitrary file contents, the first few kilobytes are usually taken as a separate field and that is generally adequate for generating desired features without the need to deal with huge files like star or zip archives.\par
The simplest approach is to concatenate all strings together. However, supposing the classification goal is to separate technical support cases by product type and model, then the most informative features may be generated from the product description field alone, and concatenating all fields will tend to water down the specificity of the features.\par
Another uncomplicated strategy is to provide every field with its own separate bag-of-words feature space. For example the word 'OfficeJet' given as the title field would be addressed as if it were not connected to a feature for the similar word in the product field. Occasionally multiple fields are required to be combined, and at the same time set aside as separate and while the rest are isolated. Such choices are done manually and an automated search improves computation time for the search and essentially reduces the expert's time, and it may identify better options not possible in manual search. 
\section[{v. Other properties}]{v. Other properties}\par
In case of certain classification issues, text properties other than words or n grams ? generate the key predictors for high accuracy. Certain kinds of spam use deceptions such as ' 4 v!@gr@4 u!' ree 'to prevent word-based features though these might easily be found by features identifying their abnormal word lengths and the density symbols. Similarly identifying Perl or awkcode, is done with specific alphanumeric identifiers, less specific in occurrence than the distribution of particular keywords and special characters. Information of formatting like the amount of whitespace, the word count, or the average number of words per line can be key features for specific tasks. Here task-specific features created are usually extremely expensive like parsing particular XML structures that hold name-value pairs. The features being task-specific, it is especially difficult to provide common useful comments about their generation or selection. The insufficient information available regarding task-specific features in literature of text classification overrides their true importance in many practical applications. 
\section[{vi. Feature values}]{vi. Feature values}\par
Next with the determination of the word that could be considered as a feature term, the significance of the numerical feature must be ascertained. For certain purposes a binary value is enough to represent if the term actually occurs. This depiction is employed by the Bernoulli formulation of the Naive Bayes classifier \hyperref[b10]{[11]}. A lot of other classifiers utilize the term frequency , t k tf (the word count in document k) directly as the feature value, e.g. the Multinomial Naive Bayes classifier \hyperref[b10]{[11]}.\par
The support vector machine (SVM) has demonstrated to be extremely effective in text classification. In such kernel techniques, the distance between two feature vectors is normally calculated as their dot product (cosine similarity), which is dominated by the dimensions with larger values. In order to avoid a situation where the extremely frequent but nondiscriminative words (such as stop-words) dominate the distance function, we can either use binary features or weight of the term frequency value , t k tf inversely to the feature's document frequency t df in the corpus (the number of documents in which the word appears one or more times). In this way, very common words are downplayed. This technique commonly known as TF.IDF has a many variants, one form being, 1 log 1 t t k M tf df ? ? ? ? ? ? ? ? ?\par
, where M is the number of documents.\par
Though this technique necessitates greater computation and storage per feature compared to binary features, it may further offer superior accuracy for kernel methods. The document length typically varies according to the document type short or long word counts with the same topic. To make these feature vectors more comparable, Feature selection process scores each possible feature with respect to a specific feature selection metric and selecting the most excellent k features. As discussed in the previous sections, a wide array of feature generation approaches, we now concentrate on feature filtering.\par
Selection of the best feature differs extensively from job to job where a number of values ought to be used. Keywords are extracted and examined according to criteria such as the incidence of repeated words or frequently used terms not definite to any category to eliminate irrelevant and noisy information. Feature filtering with respect to the training class labels scores each feature independently. The scoring counts the number of feature examples in training positive-and negative-class separately and next over these it computes a function. Increase in the number of features results in increase in the time necessary for initiation and training time affecting the accurateness of the classifier. To achieve dimensionality reduction the two most common approaches in machine learning or data mining are the filter and the wrapper \hyperref[b7]{[8,}\hyperref[b11]{12]}. 1. The filter chooses a subset of features by filtering based on scores assigned by specific weighting and is independent of any learning algorithm. i. First in the process, the a) rare words and b) common words are removed; a. The rare words can be eliminated, since they may not have any presence in future classifications. For instance, words with presence less than two times can be eliminated. Word frequencies characteristically pursue a Zipf distribution: the frequency of each word's incidence is proportional to where rank is its rank among words sorted by frequency, and is a fitting factor close to 1.0 \hyperref[b12]{(Miller 1958)}  \hyperref[b12]{[13]}. Since of the total distinct words, a part equal to half of the total number can appear only once, so deleting terms below a specific low rate of incidence generates great savings. The meticulous choice of threshold value may affect the accuracy. If we remove rare words with respect to the count of the entire dataset prior to splitting off a training set, it will result in leaking a part of the information regarding the test set to the training phase. Avoiding major resource allocation for crossvalidation studies, the research creates feasibility since avoiding class labels of the test set. b. Excessively common words, or regular words such as conjunctions, prepositions and articles such as 'a' and 'of', may also be eliminated because of their high frequency of occurrence so as to not discriminate any specific class. Common words can be recognized either by a threshold on the number of documents the word occurs in, e.g. if it occurs in over half of all documents, or by supplying a stop word list. Stop word are language-specific and often domain-specific. Depending on the classification task, they may run the risk of removing words that are essential predictors, e.g. the word 'can' is discriminating between 'aluminum' and 'glass' recycling. ii. Second in the process it is stated that the commonprocess of stemming or lemmatizingmerging various word forms such as plurals and verb conjugations into one distinct term-also reduces the number of features to be considered and which however is a feature engineering option. Suffix stripping Suffix stripping is used to stem words having a common stem and similar meanings can be merged into one term. Example, "invent," "invented," "inventing,""inventive," "invention," and "inventions" can be combined into the same term "invent" by removing the suffixes. iii. Attribute selection. Other than the simple steps of stop-word removal and suffix stripping, attribute selection is a important step that can usually lessen significantly the attributes count. The attributes are typically term weights (determined by an indexing method) and the attribute space results in high computational overhead and increased training times making its removal necessary. It is depicted as a vector of features in a vector space model \hyperref[b4]{[5]} or "bag-of-words" in a probabilistic model; features are the components in a vector or "words".\par
The filtering process is usually chosen because it is easily understood and has independent classifiers. In the filter approach, the attributes are evaluated based on some relevance measure, independent of any learning algorithm. In this paper, we use the term "relevance" informally to refer to the degree to which an attribute is relevant to the prediction of the class. For a proper definition of "relevance," please refer to Avrim and Pat (1997) \hyperref[b13]{[14]}. The relevance measure is designed to measure the dependency between the class and an attribute and the attributes most applicable for predicting the class are selected.\par
Since the attributes required to be evaluated only one time, the filter method is computationally efficient.\par
However, the attributes selected are not particularly trained on the learning algorithm used as it is actually not used in building the classifier. Also as the attributes are mostly individually assessed, the selected attributes, when considered as a set, may not be the most excellent possible subset.\par
In automatic classification, feature size reduction using simple filtering methods like stop words deletion or words stemming gives inadequate results. So a feature selection technique or algorithms ought to be used to optimize the performance of classification systems for visual detection.  As an alternative, a single loop of cross-validation must be combined with a multi parameter search strategy. The easiest way of programming is done by measuring the cross validation accuracy (or Fmeasure) at each point on a simple grid, and then deciding on the top parameters. There has been a huge research done on multi-parameter optimization and the methods though more complex to program are much more efficient. In the wrapper approach, the subset of features is chosen based on the Accuracy of classifiers. Exhaustively trying all the subsets is not computationally feasible \hyperref[b14]{[15]}. Technically, the wrapper is relatively difficult to implement, especially with a large amount of data. 
\section[{3.}]{3.}\par
An optional feature selection process is the depiction of feature value. Usually for most of the cases it is adequate if a Boolean indicator for the word occurrence in the document. Additional options are; the number of times in the document the word occurs, the frequency of its incidence normalized by the length of the document, the count normalized by the inverse document frequency of the word. In cases where there are wide variations of document length, it can be essential to normalize the counts. In our study the datasets of most documents considered are short, that does not require any normalization. Also the words in short documents most probably do not repeat, resulting in Boolean word indicators to be as informative as counts. The result is of vast savings in training resources and in the search space of the induction algorithm. If not it may attempt to discrete each feature optimally, searching over the number of bins and each bin's threshold. In our study, we had chosen Boolean indicators for each feature that enlarges the selection of FS metrics that would be considered, e.g. Odds Ratio deals with Boolean features, and was reported by  {\ref Mladenic and Grobelnik (1999)}  Feature selection refers to the selection of those features that are more important for relevant and informative data useful for text categorization. It enhances the scalability, efficiency as well as accuracy of a text classifier and plays a very important role in later steps influencing overall system performance. As many systems are large scale in various areas of data collection, feature selection is an important and widely grown. Some of basic applications of feature selection are Image Recognition, Clustering, Text Categorization, System monitoring, Rule Induction and Bioinformatics.   \hyperref[b44]{[48]}.\par
Feature selection consists after preprocessing and feature filtering selects the best features depending on the highest scores.\par
In document categorization or text classification, various methods of feature selection are used and they are;\par
Filter methods evaluate each feature independently and determine a ranking of all the features, from which the top ranked features are selected \hyperref[b3]{[4]}. They can also be used as a pre-processing step to reduce the feature dimensionality to enable other, less scalable methods. 2. The wrapper -The wrapper approach fundamentally depends on the learning algorithm. There are two algorithm. Wrapper methods have traditionally sought specific combinations of individual features from the power set of features, but this approach scales poorly for the large number of features inherent with classifying text. The wrapper methods have higher time complexity and accuracy compared to filter methods.\par
Embedded methods build a usually linear prediction model that tries to maximize the goodness-offit of the model and at the same time minimizes the number of input features \hyperref[b17]{[18]}.\par
Cross-validation method is used to select the best among feature generators and optimize other parameters, is somewhat like a wrapper method, but one that involves far fewer runs of the induction algorithm than typical wrapper feature selection.\par
Some variants build a classifier on the complete dataset where the classifier deletes the features it finds no application iteratively \hyperref[b18]{[19]} as they are minimally scalable. However in case of large feature spaces, the memory may be insufficient for representing all the potential features and vectors. In this study such methods are not considered.\par
Text Classifiers Evaluation: Performance evaluation of the classifiers is the last stage of text classification. It is an experimental evaluation and not an analytical one. It is based on the capability and effectiveness of a classifier in taking the right categorization decisions rather than the Efficiency issues. The performance is measured with the help of many techniques like precision, recall \hyperref[b3]{[4]}, fallout, error, accuracy etc.;\par
(i) Precision w.r.t. ci (Pri) is defined as the as the probability that if a random document dx is classified under ci, this decision is correct. (ii) Recall w.r.t. ci (Rei) is defined as the conditional that, if a random document dx ought to be classified under ci, this decision is taken, where TPi-The number of document correctly assigned to this category. (iii) FN -The number of document incorrectly assigned to this category. FPi -The number of document incorrectly rejected assigned to this category. TNi -The number of document correctly rejected assigned to this category. Fallout = FNi / FNi + TNi (iv) Error = FNi +FPi / TPi + FNi +FPi +TNi (v) Accuracy = TPi + TNi For obtaining estimates of precision and recall relative to the whole category set, methods such as i) Micro-averaging, ii) Macro-averaging are mostly used. Other measures like iii) Breakeven point, iv) F-measure and v) Interpolation \hyperref[b6]{[7]} are also used. 
\section[{ii. Feature Selection Methods and metrics}]{ii. Feature Selection Methods and metrics}\par
The central design of Feature Selection (FS) is the selection of a subset of features from the original documents. In data mining or machine learning the methods that are regularly used for feature selection are: Filter methods and Wrapper methods \hyperref[b11]{[12]}. 
\section[{Filtering methods:}]{Filtering methods:}\par
Filter methods use statistical techniques and are independent of the learning algorithm for FS. The filter method is usually chosen because it is easily understood and has independent classifiers. The various filtering metrics researched are; Document Frequency (DF), Term Frequency (TF-IDF), Chi Squared CHI2, Information Gain (IG), Accuracy (Acc2), Mutual Information (MI) \hyperref[b1]{[2]}, Association Word Mining [21], Expected Cross Entropy, Odds Ratio, Sampling Method, Gini Index etc.  {\ref [22]}. The filter method is appropriate to treat very large feature space, is also the most scalable and is the focus of study in this paper;\par
All features are evaluated independently with respect to the class labels in the training set to establish a ranking and the top ranking or scoring features are chosen \hyperref[b17]{[18]} for classification. A few filtering techniques metrics or scoring schemes are studied in this paper as they can be applied for most of the texts classification problems. These filter metrics use a term goodness criterion threshold to attain a preferred degree of term purging in the entire terminology of a document. They are; (i) DF, (ii) TF-IDF (ii) Chi-square (iv) IG and (v) Acc2.\par
(i) DF: Document frequency is an easiest way of assessing feature significance; it simply determines in how many documents a word occurs where choosing regular words will advance the probability of the features presence in the next test cases. The DF of a specific term simply corresponds to the number of documents in a class containing that term \hyperref[b1]{[2,}\hyperref[b3]{4,} {\ref 23]}. It is computed independent of class labels and the total test set can also be included in the computation. (ii) TF-IDF: Term Frequency method associates maximum scores to the terms that appear in some documents with a max frequency. That is a term occurring more number of times in a document means it is more discriminative whereas if it occurs in the majority of the documents, then it is less discriminative for the content. (iii) Chi2Max: Chi-Squared is a statistical test that is widely used. It calculates the independence of 2 events between feature occurrence and class value \hyperref[b20]{[24]} and the deviation from the expected distribution based on the assumption of actual independence. The fourth method or Genetic Selection (GS) is a new FS employs the genetic algorithm (GA) optimization especially for issues of high dimensionality \hyperref[b2]{[3]}. GA based selection has demonstrated to be reasonably capable and quick among many suboptimal search algorithms like sequential forward and backward selections \hyperref[b23]{[27]}. GA theory is based on the survival of the fittest solutions from the entire potential solutions for a given issue \hyperref[b24]{[28]}. Accordingly the latest generations formed from the surviving solutions are estimated to offer better accurateness to the best possible solution. The solutions match to chromosomes that are programmed with a proper alphabet. The fitness value of each chromosome is defined by a fitness function. New generations are generated by means of genetic operators i.e. crossover and mutation, with definite probabilities on the fittest members of the entire set. The primary set can be defined arbitrarily or manually. Population size, number of generations, probability of crossover and mutation are defined empirically. GS technique is simple and helpful and the chromosome length is equivalent to the dimension of a full feature set. The chromosomes are encoded as \{0, 1\} binary alphabet. In a chromosome, the indices denoted as "1" specify the chosen features, whereas "0" refers to the features not selected ones. For example, a chromosome defined as; \{ 1 0 1 0 1 1 0 0 0 1\} implies that the 1 st , 3 rd , 5 th , 6 th , and 10 th features are chosen and the remaining are eliminated. The fitness value related to a chromosome is defined by a specific success factor that is generated with the chosen features. A few instances of genetic feature selection research are presented in papers \hyperref[b23]{[27,}\hyperref[b25]{29,}\hyperref[b26]{30]}.(\par
a) The Feature Selection Techniques or Methods This paper concentrates on filter methods because; i) they are comparatively more scalable to huge collections and ii) their objectives considerations are diverse from those of classifiers. There are four filter methods core, variant, combined and redundancy reducing methods; i. Core Methods We incorporated a few feature selection methods; (DF) document frequency (just count the number of documents including the feature), (IG) information gain (number of bits of information collected for category prediction for a particular feature) and (CHI) (measuring the absence of independence between a term and the category) \hyperref[b1]{[2]}. Also the binary version of information gain (IG2) was included because it is widely used. Mutual information due to its poor performance was excluded.\par
ii. Variant methods ? Term frequency is used as a substitute for a binary value for every document counted in the scores (such variants would be recognized by TF in the results; because not one of these methods were amid the top three performers, they are not shown on the graphs.) ? The methods having one value per type (IG2, CHI, IG), we used average and also the maximum value as the score. (Identified by AVG, MAX) ? The methods, IG and CHI, were also tested with their generalized versions (cumulating evidence from all classes) are recognized by GEN. ? Also the rare words are eliminated (DF ? 5) (identified by "cut")\par
iii. Combined methods\par
We analyzed the correlation among some of the best performing methods and observed that a few (like the multiclass version of IG and CHI MAX) have minimum negative correlation, indicating a promising performance gain in combination. The two methods were combined by first normalizing the scores for all word and next selecting the higher of the two scores (thus giving an OR with equal weights to the two methods to be combined). 
\section[{iv. Redundancy Reducing Methods}]{iv. Redundancy Reducing Methods}\par
We executed a variant of the ? co-occurrence method as in \hyperref[b27]{[31]} that utilizes the other filter feature measures the decrease in entropy when the feature is given vs. absent that helps in deciding III. Contemporary Affirmation of he Literature About ext Classification, Feature Selection and Filtering Strategies t t as the size of the vocabulary may vary broadly with collections. We executed a variant of this method, with a percentage-based initial pool (1\% instead of 5 terms), smooth weighting in place of collection-dependent thresholding on the coocurrence and the multi-class version in place of 2-class.\par
As discussed above, the total number of features, variants as well as combinations is well over 100 where each of the core methods has an average of approximately 3 variants, and the cca. 15 resulting methods were combined in pairs. 
\section[{b) Feature Selection Metrics -Evaluation and Exploration}]{b) Feature Selection Metrics -Evaluation and Exploration}\par
In this study, we discuss criteria defining the feature selection metrics that have demonstrated excellent performance in text categorization. The five widely used feature selection metrics are: Document Frequency thresholding (DF), Term frequency-Inverse document frequency (TF-IDF), Chi-Square statistics (CHI), Information Gain (IG), Accuracy2 (Acc2); i. Document Frequency Threshold (DF) Document frequency is a metric used for remove the rare terms that are non-informative and confusing for classification. It is a very basic and accepted method that determines the number of documents in which the term appears without class labels \hyperref[b3]{[4,}\hyperref[b28]{32,}\hyperref[b29]{33]}. It is based on the theory that a term belonging to a less number of documents is not an excellent feature for the classification task \hyperref[b30]{[34]}. So, only the words that are present in a number of documents more than a defined threshold are chosen. This threshold can be calculated using a training set. Given a term k t , this condition can be computed globally on the collection (   {\ref , )})k i DFL t c ( , ) ( ) k i A DFL t c P t c A C ? ? ? ( , ) ( ) k i A DFL t c P t c A C ? ? ?\par
One common technique to use this method is removing all the words which are present in less than x documents, x varying between 1 and 3 \hyperref[b30]{[34,}\hyperref[b31]{35,}\hyperref[b32]{36]}. Commonly, this procedure is used with another feature selection method. The terms with low or high document frequency are frequently referred to as rare or common terms, in that order. The FS method discussed here is based on the first basic measurement that the terms with higher document frequency are more helpful for classification. However this supposition fails in giving any information sometimes. For instance the stop words (e.g., the, a, an) have very high DF scores, but hardly ever add to classification. More specifically, this uncomplicated method shoes good performance in few topic-based classification tasks \hyperref[b2]{(Yang and Pedersen, 1997)}.\par
ii. Term Frequency-inverse Document Frequency (TF-IDF)\par
The tf idf ? feature selection method is based on selecting the words with the highest tf idf ? scores. This method gives the highest scores to the words that are present in some documents with a high frequency meaning that it is more discriminative and if it is present in max number of the documents and then it is less discriminative for the content.\par
In tf idf ? \hyperref[b21]{[25]}, tf represents the term frequency of a term in a document. idf is defined as the inverse document frequency, i.e., the ratio of the total number of documents present in a dataset to the number of documents a given term appears in. A higher idf of a term implies that the term appears in relatively few documents and may be more significant at some stage in the process of text classification. tfidf is mostly used for term weighing in the field of information retrieval and is also used in text classification. Chi-square (2) statistics is a method commonly used in text categorization \hyperref[b3]{[4,}\hyperref[b7]{8,}\hyperref[b28]{32,}\hyperref[b29]{33]}, is a relevant measure, effective in text classification applications \hyperref[b4]{(Sebastiani 2002)}  \hyperref[b4]{[5]} to measure the independence of two random variables \hyperref[b33]{(Liu and Setiono 1995)}  \hyperref[b33]{[37]}. In text categorization, the two random variables are occurrence of term k t and occurrence of class t c and chi-square statistics measures the independence between k t and t c . The formula for chi-square score is: Due to the presence of words that rarely occurs and also due to limited number of positive training instances irregular behavior for very small expected counts, common in text classification, is observed. iv.2 [ ( , ) ( , ) ( , ) ( , )] ( , ) ( ) ( ) ( ) ( ) k k k k k k k t t 
\section[{Information Gain (IG)}]{Information Gain (IG)}\par
An accepted feature selection method in text categorization, information gain (IG) \hyperref[b3]{[4,}\hyperref[b29]{33,}\hyperref[b34]{38,}\hyperref[b35]{39]} measures how much information the occurrence or nonexistence of a term helps to decide the correct classification criteria for any class \hyperref[b1]{[2,}\hyperref[b3]{4,}\hyperref[b36]{40]}. The terms with scores of highest information gain has maximum information about the classes. Here class membership and the presence/absence of a specific term in a certain category are seen as random variables; one computes how much information about the class membership is gained by knowing the presence/absence statistics. If the class membership is defined as a random variable cwith two values, positive ( ) c? ? ? ? ? 5. Accuracy2\textbf{(Acc2)}\par
Accuracy2 has showed better efficiency in comparison to other feature selection metrics in the earlier studies \hyperref[b3]{[4,}\hyperref[b28]{32]}. In this metric, only the number of documents in which the term occurs is considered and not the number of actual documents. It measures the difference between the documents belonging to a class with a distributed term in the documents not belonging to k t that class. Thus, the term that never occurs in a class t c can be selected as a feature for t c . Below is the formula for calculation of accuracy2 score:2( , )\textbf{( , ) ( , )}k t k t k t Acc t c P t c P t c ? ? c) Feature Classification Strategies\par
The classification approaches for categorizing the selected features is performed by using 3 methods;\par
(i) Binary Classification, (ii) Multi-Class Classification, and (iii) Hierarchical Classification. i. Binary Classification Binary or binomial classification is categorizing the components of a given set into two sets based on specified classification rule. Binary domain tasks are regularly used and also as a subroutine to address maximum types of multi-class tasks. Some usual binary classification tasks are (i) the effectiveness to the user in distinguishing spam email from good email. (ii) a "pass or fail" test method or quality control in factories; i.e. deciding if a specification has or has not been met: a Go/no go classification; (iii) an item may have a Qualitative property; it does or does not have a specified characteristic information retrieval, namely deciding whether a page or an article should be in the result set of a search or not -the classification property is the relevance of the article. (iv) to decide in medical testing if a patient has a specific disease or not -the classification property is the presence of the disease.\par
The two groups are not symmetric and this is observed in many practical binary classification instances. The focus is on the relative proportion of varied types of errors rather than on the overall accuracy. For example, in medical testing, a false positive (detecting a disease when it is not present) is considered differently from a false negative (not detecting a disease when it is present). 
\section[{ii. Multi-Class Classification}]{ii. Multi-Class Classification}\par
There are two main types of multi-class classification: (ii) Multi-label ( ) m of n ? ? classification, where every individual case may belong to several, none, or even all classes. In the multi-label case, the difficulty is logically decomposed into n binary classification tasks:(i) Single-label (1 ) of n ? ? classification,\par
. . . 
\section[{i i class vs notclass}]{i i class vs notclass}\par
These Individual binary tasks are solved independently where each may comprise its own feature selection to enhance its precision. And also a few ( ) m of n ? ? applications programmable de novo require multi-class feature selection for performance and scalability reasons.\par
Other (1 ) of n ? ? induction algorithms carry out a good deal of binary decomposition, e.g. algorithms finding optimal splitting hierarchies, or error-correcting code classifiers based on 2 ( ) o n dichotomies. In case of problems of this type, possibly we may carry out one multi-class feature selection rather than a separate binary feature selection for each dichotomy.\par
Theoretically all multi-class tasks could be performed with binary decompositions eliminating the requirement for multi-class feature selection. However, in reality lots of excellent software products APIs and libraries suppose the conversion of text into numerical feature vectors to be executed as a pre-processing step, and devoid of any capability for injecting feature selection into the inner loops, where the decompositions occur. For instance, a centralized server task to classify millions of items on the network into multiple, orthogonal taxonomies, may be performed with more efficiency to establish a single, plausible sized feature vector to send through the network rather than sending individually to all the large documents.\par
For an application \hyperref[b37]{[41]}, of huge database of unstructured, multi-field (technical support) cases has memory by a cached, limited size feature vector representation for quick interactive examination, classification and labeling into multiple (1 ) of n ? ? and( ) m of n ? ?\par
taxonomies, where the classifiers are from time to time retrained in real time. It would be unfeasible to re-extract features for every binary decomposition or union of all the features into a exceptionally long feature vector that would be requested by all the binary feature selection sub tasks.\par
From various schemes of multi-class feature selection a few methods such as Chi-squared logically scale to multiple classes. However they face an underlying problem that is; an instance of a multi-class topic recognition case, with one of the classes holding all German texts. Now the German class will create many exceptionally predictive words. Almost all feature selection methods favor the stronger features and limit other classes for features. Similarly, if one class is mainly complicated, multi-class feature selectors will be inclined to disregard it, in view of the fact that it presents no strong features. These difficult classes require more features rather than fewer features.\par
A way out to this dilemma is to execute feature selection separately for each class through binary decompositions, and then to decide the final ranking of features using a round-robin algorithm where each class gets to vote its most preferred features in turn \hyperref[b37]{[41]}. Since few classes are simpler to recognize than others this enhances performance even for well-balanced research benchmarks, however the difference results in most feature selection methods to be ignored, the very features that require most help. The aim of this scheme is to advance strength in atypical situations that arise only sporadically in practice that affects the average performance.\par
iii. Hierarchical Classifications Hierarchy is one of the most predominant strategies for organizing abstractions. Hierarchical classification involves multiple tasks with the aim to classify items into a set of classes for organizing into a tree or directed acyclic graph, such as the Yahoo web directory. Here for some settings, the task is a single label problem to select (1) of n ? ?\par
nodes-or even limited to the leaf classes in the case of a 'virtual hierarchy.' For some other settings, the problem is of a multi-label task to select multiple interior nodes, optionally including all super-classes along the paths to the root.\par
Regardless of the given hierarchy of the classes, such issues are occasionally considered simply as flat multi-class tasks, either accommodating training examples up the tree structure for each class or a topdown hierarchy of classifiers may be generated to match the class hierarchy. The training set for each step down the tree is composed of all the training instances under each child subtree, optionally including a set of items positioned at the interior node itself, which terminates the recursion. Although this decomposition of classes is different from a flat treatment of the problem, in either decomposition, the same single-label or multilabel feature selection methods apply to the many subproblems. It has been proposed that each internal hierarchical classifier may be quicker because dependency of each can be only for a few features (selected by feature selection), and can be further accurate because it only takes into account cases within a limited framework.  (ii) Debole and Sebastiani (2003) \hyperref[b7]{[8]} stated that gain ratio and chi-square outperformed information gain, iii) Forman (  {\ref 2003}) \hyperref[b3]{[4]} reported that information gain performed better than 10 other attribute selection methods in most experiments, (iii) Halland Holmes 2003 \hyperref[b38]{[42]} stated that wrapper method is very expensive for large datasets consisting of huge number of attributes.  For instance an interior node concerning recycling with subtopics for glass recycling and can recycling there might be separate classifier intended for cases involving recycling. In this approach the training d) Combination of Feature Selection Methods Several researches have been done to enhance the efficiency of feature selection strategies on text categorization; however they generally are about improving the performance of the individual feature selection methods. The success of a feature selection method is determined by various variables and it is very difficult to understand which method is better performer than others though several selection methods are prevalent. So the combination of distinct feature selection methodologies gives more efficiency in text classification. The output of classifiers combination is a potential strategy and it is being studied extensively in the area of information retrieval. This section covers strategies for combining the outputs of the individual feature selections metrics. 
\section[{i. The Common Combining Strategies}]{i. The Common Combining Strategies}\par
There are several strategies of combining the outputs of the different FS methods. Some combination strategies or most popular approaches to combine various outputs are;\par
1. Linear Combining Methods such as (i) Averaging and (ii) Weighted Averaging 2. Non-Linear Combining Methods such as (i) Ranking and (ii) Voting Averaging (Tumer and Ghosh, 1999) \hyperref[b39]{[43]}, a Linear Combining method is the most frequently used combining strategy. Fox and Shaw, 1994, significantly state that most excellent combining strategy depends on adding the outputs of the algorithms that is similar to averaging on comparing six combining strategies \hyperref[b40]{[44]}. Also  {\ref Hull et al., 1996, [45]} show that the accuracy of the simple averaging strategy is far better than the complex combinations of the classifiers.\par
With respect to the above studies and considering the results, we decide to apply the averaging strategy in two ways:\par
(1-a) Score Combination and (1-b) Rank Combination.\par
In the Score and Rank Combination Strategy, the preceding research finds that the efficiency of the combination and the number of feature selection methods considered in combination are inversely related and vice versa. Also it is reported that maximum efficiency is achieved essentially by the combination of two feature selection methods \hyperref[b29]{[33,}\hyperref[b42]{46]}. So we only choose combining two distinct feature selection methods. In the paper, we assess the performance of all potential binary-combinations  {\ref (2-combinations)}  The strategy of the feature selection methods is of two steps. In the first step score is given to the terms that are more relevant for classification and in the second step is of selecting the terms with highest score. In scoring stage, the different feature selection methods and their scores of each term are normalized using the maximum and minimum scores according to the below formula: Score = (s1, s2, ...,sn) where si score of the i th term, n is the total number of term.  where M is the number of feature selection methods which is 2 for this study.\par
(1-b) Rank Combination Rank Combination is averaging the term ranks collected from the term scores of the different feature selection methods. Rank = (r1, r2, ...,rn) where ri rank of the th i term, n is the total number of term.1 M i rank i Rank c M ? ? ?\par
There are several modes for determining rankings like i) Standard Competition Ranking, ii) Modified Competition Ranking, iii) Dense Ranking, iv) Ordinal Ranking and v) Fractional Ranking. We rank the terms in our research as per the descending order of their scores and with standard competition ranking strategy. Here in competition ranking ("1, 2, 2, 4" ranking), terms with similar score are assigned the same ranking number and next a gap is given in the ranking numbers. The first method, the logarithmic combination is based on the score combination that is simply averaging the term scores of the feature selection methods. The principle applied is the same where in the proposed combination the logarithmic scores of the terms are averaged in place of term scores. The principal involved is increasing the interval between the highest and the lowest scores, taking benefit of the logarithm. The interval between the scores increases as the scores decrease and it decreases as the scores increase. The natural logarithm is used as a logarithm function where if the value of the score is zero, then it will substitute the value with 0.00001 for computing the logarithm. The calculation of the C1 Combination is given by the following formula: In the second method, the Square Combination proposed is also based on the score combination, however the term scores are squared and averaged rather than only averaging the term scores. The interval between the scores exponentially increases rather than the interval between the highest scores and lowest scores that remains unchanged with the increases of scores. The difference between the scores increases as the scores increase and decreases as the scores decrease in contrast to preceding methods. Thus, if the term is considered essential for classification, this method elevates the importance of the term compared to the remaining terms prior to combination. The formula used is: The third method, the product combination with fraction (C3) initially the rank of the term is multiplied with the scores of the terms. Next the outputs of the multiplication of the individual feature selection methods are added and divided with one for combining the outputs of the feature selection metrics. In case the value of score is equal to 1, then it will substitute the value with 0.99999 to prevent division by zero. The highest value terms are selected in feature selection step. The formula is:  
\section[{?}]{?}\par
When we assess the effectiveness of the combinations in classification we see that both score and rank combinations of the feature selection methods enhance the performance of the individual methods. This led us to consider using both rank and score values in the same function. The central idea of the "product combinations" in 1, 2, 3, 4, 5, 6 and 7 is to take benefit of the score and rank of the terms while identifying the most effective terms. Here both rank of the term and the score of the term have equal weight in the combination. Based on this principle, if the scores of terms of different feature selection methods are equal then greater importance is given to the term with highest rank. Different versions of the product combination are derived and are described below. 
\section[{d. C4 Combination -Product Combination with Fraction}]{d. C4 Combination -Product Combination with Fraction}\par
The fourth method, the product combination with fraction (C4) is different from the above proposed third method. In this method the logarithm of the rank is multiplied with the square of the score of the term. The formula of the C4 Combination is given as below: The fifth method, the product combination with fraction, is different from the third method discussed above. In this method the square root of the rank is multiplied with the square of the score of the term. The formula is:5 1 ' 2 2 1 1 ( )\textbf{( 1 )}M i i i C Rank Score ? ? ? ? ? f. C6 Combination - Logarithmic Product Combination\par
The sixth method, the logarithmic product combination is sum of the products of each terms logarithm of the rank and the logarithm of the score of each feature selection method. The formula is: In the seven proposed combinations the first and second combinations are comparable to score combination and are a variation of the score combination. The remaining five combinations are a product combination of both score and rank value of the terms. 
\section[{ii. Proposed Combinations of Feature Selection Methods}]{ii. Proposed Combinations of Feature Selection Methods}\par
We present seven latest methods for the efficiency in combining the different metrics for feature selection and compare them as discussed below; 
\section[{IV. Conclusion}]{IV. Conclusion}\par
Feature Selection \hyperref[b43]{[47]} continually handles huge and complex datasets and faces typical problems of feature space, which if very high, increases computational costs and also the training time.\par
Feature selection relevance has decreased with the constant developments in accuracy and scalability of core machine learning algorithms. An algorithm for instance, when considering more than 800,000 text cases was developed by Joachims that is an innovative linear SVM classifier. Using a 3.6GHz PC processor \hyperref[b17]{[18]}, it may be trained with approximately 50,000 word features in less than 3 minutes. As in some cases where feature selection does not improve the accuracy of the training sets, researchers interested in approaches other than feature selection can avoid the problems associated with feature selection and go for an input representation that is fixed and conveniently replicable. However a case where a researcher of data mining is provided with a training set for generating an excellent possible classifier should definitely consider feature selection. The method can improve certainly Accuracy for certain datasets or at least give slight improvements on average. Thus, feature selection still has a role to play for those who seek to maximize Accuracy, e.g. industrial practitioners, application programmers and contestants in data-mining competitions. The seventh method, the product combination or C7 Combination is the last method that is the multiplication of the square root of the rank with the \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_1}}\end{figure}
             \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{}
\end{longtable} \par
  {\small\itshape [Note: Natural Language Processing (NLP) and Data Mining are applied together. In this paper we review some effective feature selection researches and show the results in a table form.]} 
\caption{\label{tab_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.85\textwidth}}
Nomenclature and benchmarking models of Text Classification Models: Contemporary Affirmation of the\\
Recent Literature\\
Wrapper methods search for the 'best' subset of features, repeatedly evaluating different feature subsets via cross validation with a particular induction\\
perfect sign for class association, that is, if the\\
term is occurs in a document and if and only if the\\
document belongs to the respective class. (v) Acc2: Accuracy considers only the number of\\
documents in which the term occurs, without\\
taking into account the number of actual\\
documents.\\
Wrapper methods: Wrapper methods employ learning algorithm as the appraisal function. Classic AI search\\
methods-such as simulated-annealing-to or greedy hill-\\
climbing [19] explore for the 'best' subset of features\\
and repetitively appraise different feature subsets with cross validation using a specific induction algorithm\\
(Nejad et al., 2013) [20].\\
(i) Sequential Forward Selection (SFS),\\
(ii) Sequential Backward Selection (SBS),\\
(iii) Neural Networks (Dave, 2011, Eyheramendy and Madigan, 2005) [26],\\
(iv) Genetic Algorithm (GA) based selection.\\
D D D D D D D D ) C\\
(\end{longtable} \par
 
\caption{\label{tab_5}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.7394570707070707\textwidth}P{0.011805555555555555\textwidth}P{0.011805555555555555\textwidth}P{0.03434343434343434\textwidth}P{0.05258838383838384\textwidth}}
\tabcellsep t P c\tabcellsep is\\
\multicolumn{3}{l}{the percentage of documents belonging to class t c ,}\\
\multicolumn{3}{l}{( ) t P c is the percentage of documents not belonging to}\\
\multicolumn{3}{l}{class t c , belonging to class t ( , ) k t P t c , is the percentage of documents c in which term k t occurs, ( , ) k i P t c , is the percentage of documents not belonging to class t c}\tabcellsep Year 2014\\
\multicolumn{3}{l}{in which term k t does not occur, ( , ) k i P t c is the}\\
\multicolumn{3}{l}{percentage of documents belonging to class t c in}\\
which term k t does not occur and ( , ) k t P t c\tabcellsep \multicolumn{2}{l}{is the}\\
\multicolumn{3}{l}{percentage of documents not belonging to class t c in}\\
\multicolumn{3}{l}{which term k t occurs. If chi-square score of a term k t is}\\
\multicolumn{3}{l}{of low value, this means k t is independent from the}\\
\multicolumn{3}{l}{class t c and if chi-square score of a term k t is of high}\\
value, this means k\tabcellsep \tabcellsep \\
\tabcellsep \tabcellsep \tabcellsep D D D D D D D D )\\
\tabcellsep \tabcellsep \tabcellsep (\\
\tabcellsep \tabcellsep t CHI t c\tabcellsep N ? ?\tabcellsep t P t P t P c P c t P t c P t c P t c P t c t t ?\end{longtable} \par
  {\small\itshape [Note: t is dependent of the class t c . Thus the chi-square feature selection method selects the terms with the highest chi-square score which are more informative for classification.]} 
\caption{\label{tab_7}C}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{P{0.10222101841820151\textwidth}P{0.00414409534127844\textwidth}P{0.28087757313109424\textwidth}P{0.007827735644637053\textwidth}P{0.027627302275189596\textwidth}P{0.15701516793066086\textwidth}P{0.2159534127843987\textwidth}P{0.05433369447453955\textwidth}}
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \multicolumn{2}{l}{.4 : Prior Studies on Attribute Selection Methods}\\
References\tabcellsep \tabcellsep \multicolumn{4}{l}{attribute selection method}\tabcellsep Outcome\\
\multicolumn{2}{l}{Debole Sebastiani 2003 and}\tabcellsep \multicolumn{3}{l}{2 ? , information gain, gr}\tabcellsep GR and 2 ? outperformed Information Gain\\
Forman (2003)\tabcellsep \tabcellsep \multicolumn{4}{l}{accuracy, accuracy balanced,}\tabcellsep 2 ? ,\tabcellsep Information Gain outperformed other methods in most situations\\
\tabcellsep \tabcellsep \multicolumn{4}{l}{document frequency, F1 measure,}\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{information}\tabcellsep gain,\tabcellsep odds\tabcellsep ratio\\
\tabcellsep \tabcellsep \multicolumn{4}{l}{numerator, odds ratio, pow, pr, rand}\\
\multicolumn{2}{l}{Hall and Holmes}\tabcellsep \multicolumn{4}{l}{Correlation-based Feature Selection,}\tabcellsep Wrapper was not applicable on the dataset with 1557 attributes\\
(2003)\tabcellsep \tabcellsep \multicolumn{4}{l}{information gain, wrapper, relief,}\tabcellsep due to time limitation. Wrapper and Correlation-Based Feature\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{consistency}\tabcellsep based,\tabcellsep principle\tabcellsep Selection outperformed other methods on the dataset with 293\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{component}\tabcellsep \tabcellsep attributes by NB.\\
Lewis\tabcellsep and\tabcellsep \multicolumn{3}{l}{information gain}\tabcellsep Both propBayes and DT-MIN 10 provided reasonable\\
Ringuette\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep performance\\
Liu(2004)\tabcellsep \tabcellsep \multicolumn{4}{l}{information gain, mutual information, 2 ? , odds ratio, simplified-chi-square}\tabcellsep Information Gain an d 2 ? were most effective for NB. No benefit for SVM was found.\\
McCallum\tabcellsep and\tabcellsep \multicolumn{3}{l}{information gain}\tabcellsep MNB outperformed NB in large attributes set\\
Nigam (1998)\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{2}{l}{Madenic (1994)}\tabcellsep \multicolumn{4}{l}{information gain, odds ratio, word}\tabcellsep Odds Ratio outperformed other methods\\
\tabcellsep \tabcellsep \multicolumn{3}{l}{frequency, rand}\\
Ribone (2002)\tabcellsep \tabcellsep \multicolumn{4}{l}{information gain, word frequency,}\tabcellsep Information Gain>Word Frequency>Document Frequency\\
\tabcellsep \tabcellsep \multicolumn{3}{l}{document frequency}\\
\multicolumn{2}{l}{Rogati and Yang (2002)}\tabcellsep \multicolumn{4}{l}{Document frequency, information gain 2 ?}\tabcellsep 2 ? outperformed other methods\\
\multicolumn{2}{l}{Joachims (1996)}\tabcellsep \multicolumn{3}{l}{information gain}\tabcellsep SVM outperformed other classifiers\\
Liu(2002)\tabcellsep \tabcellsep 2 ? ,\tabcellsep \multicolumn{3}{l}{Correlation-based}\tabcellsep Feature\tabcellsep Entropy was the best, followed by 2 ? , on the datasets.\\
\tabcellsep \tabcellsep \multicolumn{4}{l}{Selection, mit correlation, entropy,}\tabcellsep Correlation-based feature selection outperformed others on the\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep ovarian cancer dataset.\\
\multicolumn{2}{l}{Sebastiani (2002)}\tabcellsep \tabcellsep \tabcellsep \tabcellsep Summary of previous studies as \{Odds Ratio, NGL coefficient,\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep SS\}>\{ 2 ? , Information Gain\}>Mutual Information\\
Yang\tabcellsep and\tabcellsep \multicolumn{4}{l}{Document frequency, information}\\
\multicolumn{2}{l}{Pedersen (1997)}\tabcellsep \multicolumn{4}{l}{gain, mutual information,}\end{longtable} \par
 
\caption{\label{tab_10}Table 2}\end{figure}
 			\footnote{© 2014 Global Journals Inc. (US)} 			\footnote{© 2014 Global Journals Inc. (US)26Year 2014} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Yang and Pedersen ()]{b2}\label{b2} 	 		‘A comparative study on feature selection in text categorization’.  		 			Y Yang 		,  		 			J O Pedersen 		.  	 	 		\textit{Proceedings of the 14th International Conference on Machine Learning},  				 (the 14th International Conference on Machine Learning)  		1997. p. .  	 
\bibitem[Mccallum and Nigam ()]{b10}\label{b10} 	 		‘A comparison of event models for naïve bayes text classification’.  		 			A Mccallum 		,  		 			K Nigam 		.  		 TR WS-98-05.  	 	 		\textit{AAAI/ICML-98 Workshop on Learning for Text Categorization},  				1998. AAAI Press. p. .  	 
\bibitem[Huang and Wang ()]{b25}\label{b25} 	 		‘A GA-based feature selection and parameters optimization for support vector machines’.  		 			C L Huang 		,  		 			C J Wang 		.  	 	 		\textit{Expert Systems with Applications}  		2006. 31 p. .  	 
\bibitem[Caropreso et al. ()]{b34}\label{b34} 	 		‘A learner-independent evaluation of the usefulness of statistical phrases for automated text categorization’.  		 			M F Caropreso 		,  		 			S Matwin 		,  		 			F Sebastiani 		.  	 	 		\textit{Text Databases and Document Management: Theory and Practice},  				 			A G Chin 		 (ed.)  		 (Hershey, US)  		2001. Idea Group Publishing. p. .  	 
\bibitem[Wiener et al. ()]{b30}\label{b30} 	 		‘A neural network approach to topic spotting’.  		 			E Wiener 		,  		 			J O Pedersen 		,  		 			A S Weigend 		.  	 	 		\textit{SDAIR'95: Proceedings of the 4th Symposium on Document Analysis and Information Retrieval},  				1995. p. .  	 
\bibitem[Zhao ()]{b1}\label{b1} 	 		‘A New Feature Selection Algorithm in Text Categorization’.  		 			Wei Zhao 		.  	 	 		\textit{Communication, Control and Automation}  		2010.  	 	 (International Symposium on Computer) 
\bibitem[Forman ()]{b37}\label{b37} 	 		‘A pitfall and solution in multi-class feature selection for text classification’.  		 			G Forman 		.  	 	 		\textit{ICML '04: Proc. of the 21st Int'l Conf. on Machine learning},  				2004. ACM Press. p. .  	 
\bibitem[Yang and Liu ()]{b16}\label{b16} 	 		‘A Re-examination of Text Categorization Methods’.  		 			Yiming Yang 		,  		 			Xin Liu 		.  	 	 		\textit{Proceedings of the Twenty-Second International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR)},  				 (the Twenty-Second International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR))  		1999. p. .  	 
\bibitem[Soucy and Mineau ()]{b27}\label{b27} 	 		‘A simple feature selection method for text classification’.  		 			P Soucy 		,  		 			P Mineau 		.  	 	 		\textit{Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence},  				 (the Seventeenth International Joint Conference on Artificial Intelligence)  		2001. p. .  	 
\bibitem[Wanas et al. ()]{b8}\label{b8} 	 		‘A Study of Local and Global Thresholding Techniques in Text Categorization’.  		 			N Wanas 		,  		 			D A Said 		,  		 			N H Hegazy 		,  		 			N M Darwish 		.  	 	 		\textit{Proc. Fifth Australasian Data Mining Conference},  				 (Fifth Australasian Data Mining Conference)  		2006.  	 
\bibitem[Nejad et al. ()]{b19}\label{b19} 	 		‘An Efficient Method for Automatic Text Categorization’.  		 			M B Nejad 		,  		 			I Attarzadeh 		,  		 			M Hosseinzadeh 		.  	 	 		\textit{Introduction to Information Retrieval},  				 			. C D Manning,  			P Raghavan,  			H Sch¨utze 		 (ed.)  		 (Cambridge)  		2013. 2008. Cambridge University Press.  	 
\bibitem[Chih and &kulathuramaiyer ()]{b21}\label{b21} 	 		‘An empirical study of feature selection for text Categorization based on term weightage’.  		 			H Chih 		,  		 			N \&kulathuramaiyer 		.  	 	 		\textit{Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence},  				 (the 2004 IEEE/WIC/ACM International Conference on Web IntelligenceWashington, DC)  		2004. IEEE. p. .  	 
\bibitem[Tasci ()]{b28}\label{b28} 	 		\textit{An evaluation of existing and new feature selection metrics in text categorization},  		 			S Tasci 		.  		2006.  		 			Computer Engineering, Bogaziçi University 		 	 
\bibitem[Yang ()]{b20}\label{b20} 	 		‘An evaluation of statistical approaches to text categorization’.  		 			Y Yang 		.  	 	 		\textit{Information Retrieval}  		1999. p. .  	 
\bibitem[Forman ()]{b3}\label{b3} 	 		‘An extensive empirical study of feature selection metrics for text classification’.  		 			G Forman 		.  	 	 		\textit{Journal of Machine Learning Research}  		2003. 3 p. .  	 
\bibitem[Hall and Holmes ()]{b38}\label{b38} 	 		‘Benchmarking Attribute Selection Techniques for Discrete Class Data Mining’.  		 			M A Hall 		,  		 			G Holmes 		.  	 	 		\textit{IEEE Transactions on Knowledge and Data Engineering}  		2003. 15  (6)  p. .  	 
\bibitem[Liu and Setiono ()]{b33}\label{b33} 	 		‘Chi2: Feature Selection and Discretization of Numeric Attributes’.  		 			H Liu 		,  		 			R Setiono 		.  	 	 		\textit{proceedings of the Seventh International Conference on Tools with Artificial Intelligence},  				 (the Seventh International Conference on Tools with Artificial Intelligence)  		1995.  	 
\bibitem[Li and Jain ()]{b32}\label{b32} 	 		‘Classification of text documents’.  		 			Y H Li 		,  		 			A K Jain 		.  	 	 		\textit{The Computer Journal}  		1998. 41 p. .  	 
\bibitem[Olsson and Oard ()]{b42}\label{b42} 	 		\textit{Combining Feature Selectors for Text Classification},  		 			J S Olsson 		,  		 			D W Oard 		.  		2006.  	 
\bibitem[Li et al. ()]{b29}\label{b29} 	 		‘Combining Multiple Feature Selection Methods for Text Categorization by Using Rank-Score Characteristics’.  		 			Y Li 		,  		 			D F Hsu 		,  		 			S M Chung 		.  	 	 		\textit{International Conference on Tools with Artificial Intelligence -ICTAI},  				2009. p. .  	 
\bibitem[Jensen ()]{b5}\label{b5} 	 		\textit{Combining rough and fuzzy sets for feature selection},  		 			R Jensen 		.  		2005. UK.  		 			University of Edinburgh 		 	 	 (PhD Thesis) 
\bibitem[Jensen ()]{b44}\label{b44} 	 		\textit{Combining rough and fuzzy sets for feature selection},  		 			R Jensen 		.  		2005.  		 			PhD thesis for University of Edinburgh UK. 		 	 
\bibitem[Dunjamladenic and Grobelnik ()]{b15}\label{b15} 	 		‘Feature Selection for Unbalanced Class Distribution and Naïve Bayes’.  		 			Marko Dunjamladenic 		,  		 			Grobelnik 		.  	 	 		\textit{Proceedings of the Sixteenth International Conference on Machine Learning (ICML)},  				 (the Sixteenth International Conference on Machine Learning (ICML))  		1999. p. .  	 
\bibitem[Dasgupta et al. ()]{b43}\label{b43} 	 		\textit{Feature Selection Methods for Text Classification},  		 			A Dasgupta 		,  		 			P Drineas 		,  		 			B Harb 		.  		2007. ACM.  	 
\bibitem[Yang and Honavar ()]{b26}\label{b26} 	 		‘Feature subset selection using a genetic algorithm’.  		 			J Yang 		,  		 			V Honavar 		.  	 	 		\textit{IEEE Intelligent Systems}  		1998. 13 p. .  	 
\bibitem[Das ()]{b11}\label{b11} 	 		‘Filters, wrappers and a boosting-based hybrid for feature selection’.  		 			S Das 		.  	 	 		\textit{International Conference on Machine Learning},  				2001.  	 
\bibitem[Goldberg ()]{b24}\label{b24} 	 		 			D E Goldberg 		.  		\textit{Genetic Algorithms in Search, Optimization, and Machine Learning},  				 (Reading, Massachusetts, Addison-Wesley)  		1989.  	 
\bibitem[Quinlan ()]{b36}\label{b36} 	 		‘Induction of decision trees’.  		 			J Quinlan 		.  	 	 		\textit{Machine Learning}  		1986. 1  (1)  p. .  	 
\bibitem[Dumais et al. ()]{b31}\label{b31} 	 		‘Inductive learning algorithms and representations for text categorization’.  		 			S Dumais 		,  		 			J Platt 		,  		 			D Heckerman 		,  		 			M Sahami 		.  	 	 		\textit{CIKM'98: Proceedings of the 7th international conference on Information and knowledge management},  				 (New York, NY, USA)  		1998. ACM. p. .  	 
\bibitem[Lee and Lee ()]{b35}\label{b35} 	 		‘Information gain and divergencebased feature selection for machine learning-based text categorization’.  		 			C Lee 		,  		 			G G Lee 		.  	 	 		\textit{Information Processing and Management},  				2006. 42 p. .  	 
\bibitem[Tumer and Ghosh ()]{b39}\label{b39} 	 		‘Linear and order statistics combiners for pattern classification’.  		 			K Tumer 		,  		 			J Ghosh 		.  	 	 		\textit{Combining Artificial Neural Networks},  				1999. Springer Verlag. p. .  	 
\bibitem[Sebastiani ()]{b4}\label{b4} 	 		‘Machine Learning in Automated Text Categorization’.  		 			F Sebastiani 		.  	 	 		\textit{ACM Computing Surveys}  		2002. 34  (1)  p. .  	 
\bibitem[Hull et al. ()]{b41}\label{b41} 	 		‘Method combination for document filtering’.  		 			D Hull 		,  		 			J Pedersen 		,  		 			H Schutze 		.  	 	 		\textit{Proceedings of the 19th ACM SIGIR Conference on Researchand Development in Information Retrieval},  				 (the 19th ACM SIGIR Conference on Researchand Development in Information Retrieval)  		1996. p. .  	 
\bibitem[Avrim ()]{b13}\label{b13} 	 		‘Selection of Relevant Features and Examples in Machine Learning’.  		 			L B Avrim 		,  		 			Pat 		,  		 			L 		.  	 	 		\textit{Artificial Intelligence}  		1997. 97 p. .  	 
\bibitem[Guyon and Elisseef ()]{b18}\label{b18} 	 		‘Special issue on variable and feature selection’.  		 			I Guyon 		,  		 			E Elisseef 		,  		 			A 		.  	 	 		\textit{J. of Machine Learning Research}  		2003. 3 p. .  	 
\bibitem[Dave ()]{b22}\label{b22} 	 		‘Study of feature selection algorithms for text-categorization’.  		 			K Dave 		.  	 	 		\textit{UNLV Theses/Dissertations/Professional Papers/ Capstones},  				 (Las Vegas)  		2011.  		 			University of Nevada 		 	 	 (Paper 1380) 
\bibitem[Debole and Sebastiani ()]{b7}\label{b7} 	 		‘Supervised Term Weighting for Automated Text Categorization’.  		 			F Debole 		,  		 			F Sebastiani 		.  	 	 		\textit{Proceedings of SAC-03-18th ACM Symposium on Applied Computing},  				 (SAC-03-18th ACM Symposium on Applied Computing)  		2003. ACM Press. p. .  	 
\bibitem[Miller and Newman ()]{b12}\label{b12} 	 		‘Tests of a statistical explanation of the rank-frequency relation for words in written English’.  		 			George A Miller 		,  		 			Edwin B Newman 		.  	 	 		\textit{American Journal of Psychology}  		1958. 71 p. .  	 
\bibitem[Sebastiani ()]{b0}\label{b0} 	 		‘Text categorization’.  		 			F Sebastiani 		.  	 	 		\textit{Text Mining and its Applications},  				 			Alessandro Zanasi 		 (ed.)  		 (Southampton, UK)  		2005. WIT Press. p. .  	 
\bibitem[Kjerstiaas and Eikvil (1999)]{b6}\label{b6} 	 		\textit{Text Categorization: A Survey},  		 			Line Kjerstiaas 		,  		 			Eikvil 		.  		June, 1999.  	 	 (Report) 
\bibitem[Gunal et al. ()]{b23}\label{b23} 	 		‘The search for optimal feature set in power quality event classification’.  		 			S Gunal 		,  		 			O N Gerek 		,  		 			D G Ece 		,  		 			R Edizkan 		.  	 	 		\textit{Expert Systems with Applications}  		2009. 36 p. .  	 
\bibitem[Koller and Sahami ()]{b14}\label{b14} 	 		‘Toward optimal feature selection’.  		 			D Koller 		,  		 			M Sahami 		.  	 	 		\textit{International Conference on Machine Learning},  				1996. p. .  	 
\bibitem[Joachims ()]{b17}\label{b17} 	 		‘Training linear SVMs in linear time’.  		 			T Joachims 		.  	 	 		\textit{Proc. of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining},  				 (of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining)  		2006. p. .  	 
\bibitem[Fox and Shaw ()]{b40}\label{b40} 	 		‘TREC-2), National Institute of Standards and Technology Special Publication 500-215’.  		 			E Fox 		,  		 			J Shaw 		.  	 	 		\textit{Proceedings of the 2nd Text Retrieval Conference},  				 (the 2nd Text Retrieval Conference)  		1994. p. .  	 	 (Combination of multiple searches) 
\bibitem[Mladenic and Globelnik ()]{b9}\label{b9} 	 		‘Word sequences as features in text learning’.  		 			D Mladenic 		,  		 			M Globelnik 		.  	 	 		\textit{Proceedings of the 17th Electrotechnical and Computer Sci-ence Conference (ERK98)},  				 (the 17th Electrotechnical and Computer Sci-ence Conference (ERK98)Ljubljana, Slovenia)  		1998. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
