|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2009 WRI World Congress on Computer Science and Information Engineering
An Efficient Text Classification Algorithm in E-commerce Application
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
| ASCII Text | x | ||
| Wu Da-sheng, Yu Qin-fen, Liu Li-juan, "An Efficient Text Classification Algorithm in E-commerce Application," Computer Science and Information Engineering, World Congress on, vol. 4, pp. 458-461, 2009 WRI World Congress on Computer Science and Information Engineering, 2009. | |||
| BibTex | x | ||
| @article{ 10.1109/CSIE.2009.346, author = {Wu Da-sheng and Yu Qin-fen and Liu Li-juan}, title = {An Efficient Text Classification Algorithm in E-commerce Application}, journal ={Computer Science and Information Engineering, World Congress on}, volume = {4}, year = {2009}, isbn = {978-0-7695-3507-4}, pages = {458-461}, doi = {http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.346}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Computer Science and Information Engineering, World Congress on TI - An Efficient Text Classification Algorithm in E-commerce Application SN - 978-0-7695-3507-4 SP458 EP461 A1 - Wu Da-sheng, A1 - Yu Qin-fen, A1 - Liu Li-juan, PY - 2009 KW - text classification algorithm KW - e-commerce KW - Text similarity VL - 4 JA - Computer Science and Information Engineering, World Congress on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.346
In this paper, an efficient text classification algorithm for repeating-text information on the e-commerce site can automatically classify and sort the similar string. This algorithm will greatly increase the efficiency and accuracy of audited information. All tests show that for the number of information between 100 and 1000 the algorithm is very efficient, and the 1000 text information(strings) comparison can be controlled in two seconds. When the amount of information is over 1000, the computation time will be significantly increased. The precision can be rectified to adjust the relevant parameters of the algorithm, such as the number of the same substring in comparison results and the length of split string. For too short information, such as less than 10 words, the algorithm can be combined with the Levenshtein algorithm, in order to improve the text-search flexibility.
Index Terms:
text classification algorithm, e-commerce, Text similarity
Citation:
Wu Da-sheng, Yu Qin-fen, Liu Li-juan, "An Efficient Text Classification Algorithm in E-commerce Application," csie, vol. 4, pp.458-461, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.