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: | Po-Han Chung, 鐘博瀚 |
---|---|
Other Authors: | 林智仁 |
Format: | Others |
Language: | zh-TW |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/68076348148878159839 |
Similar Items
-
Hash Functions for Polynomial Feature Mapping in Large Scale Linear Classification
by: Xiaocong Zhou, et al.
Published: (2017) -
Low-degree Polynomial Mapping of Data for SVM
by: Yin-Wen Chang, et al.
Published: (2009) -
The research of long-range transport effects upon the quality of air andfeatures of meteorology of ozone pollutions in Taiwan
by: Ming-Huang Lin, et al.
Published: (2008) -
Polynomial Mappings with Small Degree
by: Jelonek Zbigniew
Published: (2015-06-01) -
Polynomials and degrees of maps in real normed algebras
by: Sakkalis Takis
Published: (2020-06-01)