Feature hashing, also called as the hashing trick, is a method to transform
features of a instance to a vector. Thus, it is a method to transform a real dataset to a matrix.
Without looking up the indices in an associative array,
it applies a hash function to the features and uses their hash values as indices directly.
The method of feature hashing in this package was proposed in Weinberger et al. (2009)
Implement feature hashing with R
Feature hashing, also called as the hashing trick, is a method to transform features to vector. Without looking the indices up in an associative array, it applies a hash function to the features and uses their hash values as indices directly.
The package FeatureHashing implements the method in (Weinberger, Dasgupta, Langford, Smola, and Attenberg, 2009) to transform
data.frame to sparse matrix. The package provides a formula interface similar to model.matrix
in R and Matrix::sparse.model.matrix in the package Matrix. Splitting of concatenated data,
check the help of
test.tag for explanation of concatenated data, during the construction of the model matrix.
To install the stable version from Cran, run this command:
For up-to-date version, please install from github. Windows user will need to install RTools first.
Feature hashing is useful when the user does not easy to know the dimension of the feature vector. For example, the bag-of-word representation in document classification problem requires scanning entire dataset to know how many words we have, i.e. the dimension of the feature vector.
In general, feature hashing is useful in the following environment:
Because it is expensive or impossible to know the real dimension of the feature vector.
The following scripts show how to use the
FeatureHashing to construct
Matrix::dgCMatrix and train a model in other packages which supports
Matrix::dgCMatrix as input.
The dataset is a sample from iPinYou dataset which is described in (Zhang, Yuan, Wang, and Shen, 2014).
# The following script assumes that the data.frame# of the training dataset and testing dataset are# assigned to variable `ipinyou.train` and `ipinyou.test`# respectivelylibrary(FeatureHashing)
## Loading required package: methods
# Checking version.stopifnot(packageVersion("FeatureHashing") >= package_version("0.9"))data(ipinyou)f <- ~ IP + Region + City + AdExchange + Domain +URL + AdSlotId + AdSlotWidth + AdSlotHeight +AdSlotVisibility + AdSlotFormat + CreativeID +Adid + split(UserTag, delim = ",")# if the version of FeatureHashing is 0.8, please use the following command:# m.train <- as(hashed.model.matrix(f, ipinyou.train, 2^16, transpose = FALSE), "dgCMatrix")m.train <- hashed.model.matrix(f, ipinyou.train, 2^16)m.test <- hashed.model.matrix(f, ipinyou.test, 2^16)# logistic regression with glmnetlibrary(glmnet)
## Loading required package: Matrix ## Loading required package: foreach ## Loaded glmnet 2.0-2
cv.g.lr <- cv.glmnet(m.train, ipinyou.train$IsClick,family = "binomial")#, type.measure = "auc")p.lr <- predict(cv.g.lr, m.test, s="lambda.min")auc(ipinyou.test$IsClick, p.lr)
##  0.5076923
Following the script above,
# GBDT with xgboostlibrary(xgboost)cv.g.gdbt <- xgboost(m.train, ipinyou.train$IsClick, max.depth=7, eta=0.1,nround = 100, objective = "binary:logistic", verbose = ifelse(interactive(), 1, 0))p.lm <- predict(cv.g.gdbt, m.test)glmnet::auc(ipinyou.test$IsClick, p.lm)
##  0.6554945
The following scripts use an implementation of the FTRL-Proximal for Logistic Regresion, which is published in (McMahan, Holt, Sculley, Young, Ebner, Grady, Nie, Phillips, Davydov, Golovin, Chikkerur, Liu, Wattenberg, Hrafnkelsson, Boulos, and Kubica, 2013), to predict the probability (1-step prediction) and update the model simultaneously.
source(system.file("ftprl.R", package = "FeatureHashing"))m.train <- hashed.model.matrix(f, ipinyou.train, 2^16, transpose = TRUE)ftprl <- initialize.ftprl(0.1, 1, 0.1, 0.1, 2^16)ftprl <- update.ftprl(ftprl, m.train, ipinyou.train$IsClick, predict = TRUE)auc(ipinyou.train$IsClick, attr(ftprl, "predict"))
##  0.5986472
If we use the same algorithm to predict the click through rate of the 3rd season of iPinYou, the overall AUC will be 0.77 which is comparable to the overall AUC of the 3rd season 0.76 reported in (Zhang, Yuan, Wang, et al., 2014).
c("a,b", "a,b,c", "a,c", "")
 H. B. McMahan, G. Holt, D. Sculley, et al. "Ad click prediction: a view from the trenches". In: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2013, Chicago, IL, USA, August 11-14, 2013. Ed. by I. S. Dhillon, Y. Koren, R. Ghani, T. E. Senator, P. Bradley, R. Parekh, J. He, R. L. Grossman and R. Uthurusamy. ACM, 2013, pp. 1222-1230. DOI: 10.1145/2487575.2488200. <URL: http://doi.acm.org/10.1145/2487575.2488200>.
 K. Q. Weinberger, A. Dasgupta, J. Langford, et al. "Feature hashing for large scale multitask learning". In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, June 14-18, 2009. Ed. by A. P. Danyluk, L. Bottou and M. L. Littman. 2009, pp. 1113-1120. DOI: 10.1145/1553374.1553516. <URL: http://doi.acm.org/10.1145/1553374.1553516>.
 W. Zhang, S. Yuan, J. Wang, et al. "Real-Time Bidding Benchmarking with iPinYou Dataset". In: arXiv preprint arXiv:1407.7073 (2014).