<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">OALibJ</journal-id><journal-title-group><journal-title>Open Access Library Journal</journal-title></journal-title-group><issn pub-type="epub">2333-9705</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/oalib.1100949</article-id><article-id pub-id-type="publisher-id">OALibJ-68020</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Biomedical&amp;Life Sciences</subject><subject> Business&amp;Economics</subject><subject> Chemistry&amp;Materials Science</subject><subject> Computer Science&amp;Communications</subject><subject> Earth&amp;Environmental Sciences</subject><subject> Engineering</subject><subject> Medicine&amp;Healthcare</subject><subject> Physics&amp;Mathematics</subject><subject> Social Sciences&amp;Humanities</subject></subj-group></article-categories><title-group><article-title>
 
 
  The Research of Tax Inspection Based on Generalized Regression Neural Network
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Shihong</surname><given-names>Chen</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Xiaoqing</surname><given-names>Liu</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib></contrib-group><aff id="aff2"><addr-line>Jinan University, Guangdong University of Finance, Guangzhou, China</addr-line></aff><aff id="aff1"><addr-line>Guangdong University of Foreign Studies, Guangzhou, China</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>ibm255@126.com(SC)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>01</day><month>01</month><year>2015</year></pub-date><volume>02</volume><issue>01</issue><fpage>1</fpage><lpage>5</lpage><history><date date-type="received"><day>9</day>	<month>January</month>	<year>2015</year></date><date date-type="rev-recd"><day>accepted</day>	<month>24</month>	<year>January</year>	</date><date date-type="accepted"><day>28</day>	<month>January</month>	<year>2015</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
   
   This paper tries to use the generalized regression neural network (in short: GRNN) to assist tax inspection case selection. First, this paper briefly introduces the theory of generalized regression neural network and applies it in the tax inspection. Second, it analyzes the financial statements and tax returns of 93 commercial enterprises, and then establishes the GRNN model and gets the analyzing result. Finally, the result is compared with the known taxation case. Then we get the conclusion that the generalized regression neural network method can help the tax inspection case selection and improve the efficiency and effectiveness of inspection work. 
  
 
</p></abstract><kwd-group><kwd>Tax Inspection</kwd><kwd> Generalized Regression Neural Network</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Tax is the country’s lifeline. Tax is the country’s basic fiscal balance and security. Tax inspection is an important part of the tax enforcement, which plays an important role both in the fight against tax evasion and fraud and other illegal activities and in enhancing awareness of law-abiding taxpayers. The traditional inspection case-se- lecting is mainly based on reported information. This method to judge the delineation of the characteristics of those unscrupulous taxpayers largely depends on the past experience and some intuition of the professional inspectors. The inspection case-selecting is influenced by artificial factor and has large uncertainty. These can’t ensure the fairness and transparency of tax enforcement. Meanwhile, with the tax evasion practices emerging in market economy, the traditional case of artificial selection becomes more and more powerless [<xref ref-type="bibr" rid="scirp.68020-ref1">1</xref>] .</p><p>The existing tax inspection system based on decision support system has limited functions, although it accumulates a large number of historical data, but these data are not used effectively, and they can not meet the inspection depth of data analysis needs of decision makers. In the present research, most use the discriminant analysis method in mathematical statistics to solve this problem, but because of the linear structure of the discriminant function; it is difficult to adapt to the strong nonlinear relationship with the financial data and tax evasion. Therefore, there are big limitations in the precision of identifying. In contrast, neural networks can complete the non-linear modeling on condition of not understanding the relationship of the input or output vari- ables. Both neurons and neural networks have the characteristics of nonlinear, non-local, non-stationary, non- convexity and chaotic, which offer the possibility for better solving the problem of tax inspection case selection. This paper tries to use the generalized regression neural network (GRNN) to assist tax inspection case selection.</p></sec><sec id="s2"><title>2. Generalized Regression Neural Network</title><p>The artificial neural network (ANN) is a combination of artificial intelligence techniques such as mathematical statistics, neural computing, symbolic logic, and so on. ANN is a nonlinear dynamic system, does not require a clear understanding of the mechanisms of things, without creating complex mathematical models and having the advantages of linear mapping capability. The system’s output depends only on weight of the connection between the system’s input and output, and the weight values of these connections are obtained through the learning of the training samples. And this way is particularly effective to solve the problems that have a certain inherent laws, unclear mechanism, and a certain ambiguity problems. These features make neural networks effectively used in the exploratory study of some engineering, overcome the flaws including poor description and difficult solving of traditional mathematical model used in structural optimization.</p><p>ANN has many models, in which the general regression neural network (GRNN) is one of the RBFNN and is introduced by Specht in 1991 [<xref ref-type="bibr" rid="scirp.68020-ref2">2</xref>] [<xref ref-type="bibr" rid="scirp.68020-ref3">3</xref>] .</p><p>We have the hypothesis: Let the independent variable is<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x5.png" xlink:type="simple"/></inline-formula>, the dependent variable is<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x6.png" xlink:type="simple"/></inline-formula>, the definition of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x7.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x8.png" xlink:type="simple"/></inline-formula>of the joint probability density function is<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x9.png" xlink:type="simple"/></inline-formula>, we have known that the observed value of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x10.png" xlink:type="simple"/></inline-formula> is<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x11.png" xlink:type="simple"/></inline-formula>, then the return of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x12.png" xlink:type="simple"/></inline-formula> relative to<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x13.png" xlink:type="simple"/></inline-formula>, that is, the conditions mean is:</p><disp-formula id="scirp.68020-formula107"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/68020x14.png"  xlink:type="simple"/></disp-formula><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x15.png" xlink:type="simple"/></inline-formula>is the predicted output under the condition of inputting<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x16.png" xlink:type="simple"/></inline-formula>.</p><p>Specht had indicated that the continuous probability density function can estimated from the observed value.</p><disp-formula id="scirp.68020-formula108"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/68020x17.png"  xlink:type="simple"/></disp-formula><p>In this, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x18.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x19.png" xlink:type="simple"/></inline-formula> are respectively the i-th sample observed value of random variable <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x20.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x21.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x22.png" xlink:type="simple"/></inline-formula>is smoothing parameter, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x23.png" xlink:type="simple"/></inline-formula>is the number of dimensions of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x24.png" xlink:type="simple"/></inline-formula>, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x20.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x25.png" xlink:type="simple"/></inline-formula> is the number of samples.</p><p>We replace <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x26.png" xlink:type="simple"/></inline-formula> with<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x27.png" xlink:type="simple"/></inline-formula>, factor Equation (2) into the Equation (1), and calculate to get the result. That is:</p><disp-formula id="scirp.68020-formula109"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/68020x28.png"  xlink:type="simple"/></disp-formula><p>The GRNN topology structure includes input layer, pattern layer, summation layer and output layer. It is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>.</p><p>The number of input layer neurons is equal to the dimension of input vectors in the learning sample, each neuron is a simple distribution unit, and directly passes the elements of the input vector to the model layer.</p><p>The number of pattern layer neurons is equal to that of training sample,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x29.png" xlink:type="simple"/></inline-formula>. Each neuron is respectively different sample, and the transfer function is:</p><disp-formula id="scirp.68020-formula110"><graphic  xlink:href="http://html.scirp.org/file/68020x30.png"  xlink:type="simple"/></disp-formula><fig-group id="fig1"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> Chart of the GRNN topology.</title></caption><fig id ="fig1_1"><label></label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/68020x31.png"/></fig></fig-group><p>The summation layer includes two types of neurons, one of it is the denominator of the Equation (3), which is the arithmetic summation of the output of all of the pattern layer neurons, the connection weight between the pattern layer and each neuron is 1, and the transfer function is:</p><disp-formula id="scirp.68020-formula111"><graphic  xlink:href="http://html.scirp.org/file/68020x32.png"  xlink:type="simple"/></disp-formula><p>Another neuron is the numerator of Equation (3), which uses each element <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x33.png" xlink:type="simple"/></inline-formula> of the output sample <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x34.png" xlink:type="simple"/></inline-formula> in the pattern layer as the connection weight, and gets the weighted summation from the output of neurons in pattern layer, and the transfer function is:</p><disp-formula id="scirp.68020-formula112"><graphic  xlink:href="http://html.scirp.org/file/68020x35.png"  xlink:type="simple"/></disp-formula><p>The number of the neurons in output layer is equal to the dimension of output vectors in the training sample; each neuron divides the output of the summation layer. That is:</p><disp-formula id="scirp.68020-formula113"><graphic  xlink:href="http://html.scirp.org/file/68020x36.png"  xlink:type="simple"/></disp-formula><p>From the above we can see, GRNN topology depends on the training sample, has fewer manual adjustments of the parameters, and the only factor affecting network output is the smoothing parameter<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x37.png" xlink:type="simple"/></inline-formula>, the network training is essentially a smoothing parameter optimization process [<xref ref-type="bibr" rid="scirp.68020-ref3">3</xref>] . This feature determines the GRNN network to avoid the subjective assumptions to impact on the predicted results to greatest extent.</p></sec><sec id="s3"><title>3. Empirical Analysis of the Tax Inspection Case-Selecting</title><p>Tax inspection case-selecting problem is actually a tax inspection according to the given historical data as training samples to corporate financial data submitted as input to the classification of tax honesty as the output for dependencies between input and output to enable the unknown corporate tax inspection results to make the classification as accurate as possible, in order to support tax inspection case selection.</p><sec id="s3_1"><title>3.1. Selection of Tax Categories and Analysis Index</title><p>The value-added tax (VAT) is a main tax of the tax system of China, which is a turnover tax levied on the added value of sailing goods and taxable services. VAT is levied on the added value, and the value-added content is equivalent to deduct the transfer value consumed in production from the total value of goods, as the value of that additional value. The tax data announced in January 2010 to March from Ministry of Finance shows that the domestic value-added tax revenue in total tax revenue accounted for 28.7%, which is the largest tax revenue. Since the implementation of the tax authorities for tax revenue check was divided by the tax categories, and therefore, the inspection of tax evasion behavior of VAT is still the focus for the inspection by tax authorities. So this paper selects the VAT to study the inspection case selection.</p><p>In practice, there are more than 200 financial indicators, not all indicators are useful to audit case selection, and some even serve as a negative interference. We should choose a small number of financial indicators playing a significant election-case analysis as the indicators. Chen Ying adopts the stepwise discriminant analysis method in the article [<xref ref-type="bibr" rid="scirp.68020-ref4">4</xref>] , and then chooses seven indexes from the whole twelve indexes, that are, the tax burden rate, the actual tax rate, stock rate, quick ratio, asset net profit margin, cost of sales ratio, sales finance charge rate. Guan Xin, in the article [<xref ref-type="bibr" rid="scirp.68020-ref5">5</xref>] , uses the quantity association rule algorithm to select six indexes from the eleven ones, that are, the tax burden rate, the actual tax rate, stock rate, asset net profit margin, cost of sales ratio, sales finance charge rate, which are the most frequent, heavier weight, the role of strong. Generally speaking, the result of them is almost. So in this paper we choose seven indexes, that are, the tax burden rate, the actual tax rate, stock rate, quick ratio, asset net profit margin, cost of sales ratio, sales finance charge rate.</p><p>The data used in this paper comes from one revenue [<xref ref-type="bibr" rid="scirp.68020-ref6">6</xref>] , there are financial statements and the tax returns of 93 commercial enterprises, in which there are 31 enterprises which are dishonest tax, the other 62 enterprises are the normal tax.</p></sec><sec id="s3_2"><title>3.2. Building GRNN Model</title><p>The GRNN is a supervised learning method. Before learning it need to train the network first, and the training process need input provided and output expected. In this case, we randomly select the data of 68 enterprises as the training model samples, build the GRNN model, and set the value of the smoothing parameter, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/68020x38.png" xlink:type="simple"/></inline-formula>, as 0.05. And then we use the remaining 25 data as testing samples to start our experiment.</p><p>We carry out the GRNN model in Matlab software. Because the training samples and the testing samples are randomly selected, the result of network built and tested every time is different, so in order to reduce the chanciness, the author runs the network program for ten times and then analyses by synthesis.</p><p>The first running result is shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>. We analyze the result in <xref ref-type="table" rid="table1">Table 1</xref>. The analysis result of all 10 running is shown in <xref ref-type="table" rid="table2">Table 2</xref>. In that, Category 1 is honest taxes and Category 0 is dishonest taxes.</p></sec></sec><sec id="s4"><title>4. Result Analysis GRNN Compared with Ever Research</title><p>In previous studies, we use Binary Logistic Regression Analysis [<xref ref-type="bibr" rid="scirp.68020-ref7">7</xref>] , and BP neural network to do the same ana- lysis, now the findings of the three methods are compared. The results are shown in <xref ref-type="table" rid="table3">Table 3</xref>. With the statistics of inspection department, the accuracy rate of case-selection through manual work is not exceeding 40%. The result of Binary Logistic Regression Analysis method is also below average. The reason is that Binary Logistic Regression Analysis can’t overcome the shortcoming of linear structure of the discrimination function, which is difficult to adapt the non-linear relation of financial data and tax evasion behavior. So Binary Logistic Regres- sion Analysis has major limitation in the side of discrimination accuracy. Compared with the BP neural network, GRNN has the lower requirement with the parameter; it only needs one smoothing factor, and the result is better. So we can say that using GRNN model in tax inspection case-selecting is feasible. But the GRNN model also</p><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> The first running result chart of GRNN</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/68020x39.png"/></fig><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> The analysis result of the first running</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Num. of enterprises</th><th align="center" valign="middle" >Actual category</th><th align="center" valign="middle" >Study category</th><th align="center" valign="middle" >Study result</th><th align="center" valign="middle" >Percent of T or F</th></tr></thead><tr><td align="center" valign="middle" >15</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >True (T)</td><td align="center" valign="middle" >88.24%</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >False (F)</td><td align="center" valign="middle" >11.76%</td></tr><tr><td align="center" valign="middle" >8</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >True</td><td align="center" valign="middle" >100%</td></tr><tr><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >False</td><td align="center" valign="middle" >0%</td></tr></tbody></table></table-wrap><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> The analysis result of all 10 running</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Serial number</th><th align="center" valign="middle" >1 judged as 1 (Accuracy rate %)</th><th align="center" valign="middle" >1 judged as 0 (Error rate %)</th><th align="center" valign="middle" >0 judged as 0 (Accuracy rate %)</th><th align="center" valign="middle" >0 judged as 1 (Error rate %)</th></tr></thead><tr><td align="center" valign="middle" >First</td><td align="center" valign="middle" >88.24</td><td align="center" valign="middle" >11.76</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >0</td></tr><tr><td align="center" valign="middle" >Second</td><td align="center" valign="middle" >72.22</td><td align="center" valign="middle" >27.78</td><td align="center" valign="middle" >71.43</td><td align="center" valign="middle" >28.57</td></tr><tr><td align="center" valign="middle" >Third</td><td align="center" valign="middle" >81.25</td><td align="center" valign="middle" >18.75</td><td align="center" valign="middle" >88.89</td><td align="center" valign="middle" >11.11</td></tr><tr><td align="center" valign="middle" >Fourth</td><td align="center" valign="middle" >68.75</td><td align="center" valign="middle" >31.25</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >0</td></tr><tr><td align="center" valign="middle" >Fifth</td><td align="center" valign="middle" >70.59</td><td align="center" valign="middle" >29.41</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >0</td></tr><tr><td align="center" valign="middle" >Sixth</td><td align="center" valign="middle" >78.95</td><td align="center" valign="middle" >21.05</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >0</td></tr><tr><td align="center" valign="middle" >Seventh</td><td align="center" valign="middle" >81.25</td><td align="center" valign="middle" >18.75</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >0</td></tr><tr><td align="center" valign="middle" >Eighth</td><td align="center" valign="middle" >87.5</td><td align="center" valign="middle" >12.5</td><td align="center" valign="middle" >88.89</td><td align="center" valign="middle" >11.11</td></tr><tr><td align="center" valign="middle" >Ninth</td><td align="center" valign="middle" >85.71</td><td align="center" valign="middle" >14.29</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >0</td></tr><tr><td align="center" valign="middle" >Tenth</td><td align="center" valign="middle" >82.35</td><td align="center" valign="middle" >17.65</td><td align="center" valign="middle" >100</td><td align="center" valign="middle" >0</td></tr><tr><td align="center" valign="middle" >Average</td><td align="center" valign="middle" >79.681</td><td align="center" valign="middle" >20.319</td><td align="center" valign="middle" >94.921</td><td align="center" valign="middle" >5.079</td></tr></tbody></table></table-wrap><table-wrap id="table3" ><label><xref ref-type="table" rid="table3">Table 3</xref></label><caption><title> The comparison of the three methods</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Method</th><th align="center" valign="middle" >1 judged as 1</th><th align="center" valign="middle" >1 judged as 0</th><th align="center" valign="middle" >0 judged as 0</th><th align="center" valign="middle" >0 judged as 1</th></tr></thead><tr><td align="center" valign="middle" >Binary Logistic Regression</td><td align="center" valign="middle" >75%</td><td align="center" valign="middle" >25%</td><td align="center" valign="middle" >60%</td><td align="center" valign="middle" >40%</td></tr><tr><td align="center" valign="middle" >BP neural network</td><td align="center" valign="middle" >72.22%</td><td align="center" valign="middle" >27.78%</td><td align="center" valign="middle" >88.89%</td><td align="center" valign="middle" >11.11%</td></tr><tr><td align="center" valign="middle" >GRNN</td><td align="center" valign="middle" >79.681%</td><td align="center" valign="middle" >20.319%</td><td align="center" valign="middle" >94.921%</td><td align="center" valign="middle" >5.079%</td></tr></tbody></table></table-wrap><p>has its limitation that it strongly depends on the sample data. Over time, the way of tax evasion emerges in an endless stream, the classification error will become large, and so GRNN model is more suitable for short-term anticipation. To apply the long-term anticipation, we need to continue to add new sample data, and perfect the model.</p></sec><sec id="s5"><title>Acknowledgements</title><p>This work is supported by the 2010’ s Youth Project of Guangdong University of Foreign Studies.</p></sec><sec id="s6"><title>Cite this paper</title><p>Shihong Chen,Xiaoqing Liu, (2015) The Research of Tax Inspection Based on Generalized Regression Neural Network. Open Access Library Journal,02,1-5. doi: 10.4236/oalib.1100949</p></sec></body><back><ref-list><title>References</title><ref id="scirp.68020-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Chen, S.H. and Zhang, Y.M. (2009) Application of Binary Logistic Regression Analysis in Tax Inspection. Financial Computer of Huanan, 6, 48-49.</mixed-citation></ref><ref id="scirp.68020-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Scott, D.W. (1992) Multivariate Density Estimation: Theory, Practice and Visualization. Wiley, New York, 45-67. http://dx.doi.org/10.1002/9780470316849</mixed-citation></ref><ref id="scirp.68020-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Guan, X. (2005) Data Mining Research on Sampling of Tax-Checking. Liaoning Technical University, Fuxin.</mixed-citation></ref><ref id="scirp.68020-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Chen, Y. (2004) Research on Sampling of Tax-Checking. Tianjin University, Tianjin.</mixed-citation></ref><ref id="scirp.68020-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">(2010) 30 Case Study of MATLAB Neural Network. Beihang University Press, Beijing.</mixed-citation></ref><ref id="scirp.68020-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Specht, D.F.A. (1991) General Regression Neural Network. IEEE Transaction on Neural Networks, 2, 568-576. http://dx.doi.org/10.1109/72.97934</mixed-citation></ref><ref id="scirp.68020-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">He, Z. (2007) On the Reform Tendency of Tax Inspection System of China in the New Situation. Southwestern University of Finance and Economics, Chengdu.</mixed-citation></ref></ref-list></back></article>