Low-degree Polynomial Mapping of NLP Data andFeatures Condensing by Hashing
碩士 === 國立臺灣大學 === 資訊網路與多媒體研究所 === 99 === Recently, many people handle natural language processing (NLP) tasks via support vector machines (SVM) with polynomial kernels. However, kernel computation is time consuming. Chang et al. (2010) have proposed mapping data by low-degree polynomial functions an...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/68076348148878159839 |