An Efficient Algorithm for NaiveBayes with Matrix Transposition


The KIPS Transactions:PartB , Vol. 11, No. 1, pp. 117-124, Feb. 2004
10.3745/KIPSTB.2004.11.1.117,   PDF Download:

Abstract

This paper proposes an efficient algorithm of NativeBayes without loss of its accuracy. The proposed method uses the transposition of category vectors, and minimizes the computation of the probability of NaiveBayes. The proposed method was implemented on the existing framework of the text categorization, so called, AI::categorizer and it was compared with the conventional NaiveBayes with the well-known data, Reuter-21578. The comparisons show that the proposed method outperforms Naivebayes about two times with respect to the executing time.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. J. Mun, "An Efficient Algorithm for NaiveBayes with Matrix Transposition," The KIPS Transactions:PartB , vol. 11, no. 1, pp. 117-124, 2004. DOI: 10.3745/KIPSTB.2004.11.1.117.

[ACM Style]
Lee Jae Mun. 2004. An Efficient Algorithm for NaiveBayes with Matrix Transposition. The KIPS Transactions:PartB , 11, 1, (2004), 117-124. DOI: 10.3745/KIPSTB.2004.11.1.117.