This is Haji's MSc thesis codes. Use it with ultimate caution.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

references.bib 30KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707
  1. @inproceedings{boser1992,
  2. added-at = {2011-04-06T14:59:36.000+0200},
  3. address = {Pittsburgh, PA, USA},
  4. author = {Boser, Bernhard E. and Guyon, Isabelle M. and Vapnik, Vladimir N.},
  5. biburl = {https://www.bibsonomy.org/bibtex/2f4c8abb0eea7de4431f51c6dd3f3eb55/utahell},
  6. booktitle = {Proceedings of the 5th Annual Workshop on Computational Learning Theory (COLT'92)},
  7. description = {A training algorithm for optimal margin classifiers},
  8. editor = {Haussler, David},
  9. interhash = {81c1ca02cfdb4006d4ae602fcbbafcd3},
  10. intrahash = {f4c8abb0eea7de4431f51c6dd3f3eb55},
  11. keywords = {learning svm},
  12. month = {July},
  13. pages = {144--152},
  14. publisher = {ACM Press},
  15. timestamp = {2011-12-16T16:31:14.000+0100},
  16. title = {A Training Algorithm for Optimal Margin Classifiers},
  17. url = {http://doi.acm.org/10.1145/130385.130401},
  18. year = 1992
  19. }
  20. @article{Gai_piecewise,
  21. added-at = {2018-08-13T00:00:00.000+0200},
  22. author = {Gai, Kun and Zhu, Xiaoqiang and Li, Han and Liu, Kai and Wang, Zhe},
  23. biburl = {https://www.bibsonomy.org/bibtex/20a9312f3a5b0481928e589477d7dee81/dblp},
  24. ee = {http://arxiv.org/abs/1704.05194},
  25. interhash = {2c5f2e3b8e0a358d4b4d24835a6b5a33},
  26. intrahash = {0a9312f3a5b0481928e589477d7dee81},
  27. journal = {CoRR},
  28. keywords = {dblp},
  29. timestamp = {2018-08-14T13:15:00.000+0200},
  30. title = {Learning Piece-wise Linear Models from Large Scale Data for Ad Click Prediction.},
  31. url = {http://dblp.uni-trier.de/db/journals/corr/corr1704.html#GaiZLLW17},
  32. volume = {abs/1704.05194},
  33. year = 2017
  34. }
  35. @article{lecun_sgd,
  36. abstract = {Multilayer neural networks trained with the back-propagation algorithm constitute the best example of a successful gradient based learning technique. Given an appropriate network architecture, gradient-based learning algorithms can be used to synthesize a complex decision surface that can classify high-dimensional patterns, such as handwritten characters, with minimal preprocessing. This paper reviews various methods applied to handwritten character recognition and compares them on a standard handwritten digit recognition task. Convolutional neural networks, which are specifically designed to deal with the variability of 2D shapes, are shown to outperform all other techniques. Real-life document recognition systems are composed of multiple modules including field extraction, segmentation recognition, and language modeling. A new learning paradigm, called graph transformer networks (GTN), allows such multimodule systems to be trained globally using gradient-based methods so as to minimize an overall performance measure. Two systems for online handwriting recognition are described. Experiments demonstrate the advantage of global training, and the flexibility of graph transformer networks. A graph transformer network for reading a bank cheque is also described. It uses convolutional neural network character recognizers combined with global training techniques to provide record accuracy on business and personal cheques. It is deployed commercially and reads several million cheques per day},
  37. added-at = {2019-01-05T14:54:07.000+0100},
  38. author = {LeCun, Y. and Bottou, L. and Bengio, Y. and Haffner, P.},
  39. biburl = {https://www.bibsonomy.org/bibtex/28417f8e20e96a98703486b82a09583c7/slicside},
  40. doi = {10.1109/5.726791},
  41. interhash = {7a82cccacd23cf06b25ff5325a6c86c7},
  42. intrahash = {8417f8e20e96a98703486b82a09583c7},
  43. issn = {0018-9219},
  44. journal = {Proceedings of the IEEE},
  45. keywords = {ba-2018-hahnrico},
  46. number = 11,
  47. pages = {2278-2324},
  48. timestamp = {2019-01-05T14:54:07.000+0100},
  49. title = {Gradient-based learning applied to document recognition},
  50. volume = 86,
  51. year = 1998
  52. }
  53. @article{lbfgs_2008,
  54. added-at = {2020-02-17T00:00:00.000+0100},
  55. author = {Xiao, Yunhai and Wei, Zengxin and Wang, Zhiguo},
  56. biburl = {https://www.bibsonomy.org/bibtex/29a414487321cd8049eb9f34c3e8e2e61/dblp},
  57. ee = {https://doi.org/10.1016/j.camwa.2008.01.028},
  58. interhash = {d843677026f4d5722d2500525d47b5ca},
  59. intrahash = {9a414487321cd8049eb9f34c3e8e2e61},
  60. journal = {Comput. Math. Appl.},
  61. keywords = {dblp},
  62. number = 4,
  63. pages = {1001-1009},
  64. timestamp = {2020-02-18T11:38:42.000+0100},
  65. title = {A limited memory BFGS-type method for large-scale unconstrained optimization.},
  66. url = {http://dblp.uni-trier.de/db/journals/cma/cma56.html#XiaoWW08},
  67. volume = 56,
  68. year = 2008
  69. }
  70. @inproceedings{Graepel_2010,
  71. added-at = {2019-04-03T00:00:00.000+0200},
  72. author = {Graepel, Thore and Candela, Joaquin Quiñonero and Borchert, Thomas and Herbrich, Ralf},
  73. biburl = {https://www.bibsonomy.org/bibtex/2b008aa80a83b88a6e5fee59caa9b6493/dblp},
  74. booktitle = {ICML},
  75. crossref = {conf/icml/2010},
  76. editor = {Fürnkranz, Johannes and Joachims, Thorsten},
  77. ee = {https://icml.cc/Conferences/2010/papers/901.pdf},
  78. interhash = {2a83b4cd23188992c5b7a4023eedcebe},
  79. intrahash = {b008aa80a83b88a6e5fee59caa9b6493},
  80. keywords = {dblp},
  81. pages = {13-20},
  82. publisher = {Omnipress},
  83. timestamp = {2019-04-04T11:48:32.000+0200},
  84. title = {Web-Scale Bayesian Click-Through rate Prediction for Sponsored Search Advertising in Microsoft's Bing Search Engine.},
  85. url = {http://dblp.uni-trier.de/db/conf/icml/icml2010.html#GraepelCBH10},
  86. year = 2010
  87. }
  88. @inproceedings{Rendle:2010ja,
  89. added-at = {2019-05-21T10:10:49.000+0200},
  90. author = {Rendle, Steffen},
  91. biburl = {https://www.bibsonomy.org/bibtex/265ab448242aaaeb060a8b9ed87204423/sxkdz},
  92. booktitle = {Proceedings of the 2010 IEEE International Conference on Data Mining},
  93. doi = {10.1109/ICDM.2010.127},
  94. interhash = {425e17658c7386e5b35c505a1ed89aff},
  95. intrahash = {65ab448242aaaeb060a8b9ed87204423},
  96. issn = {2374-8486},
  97. keywords = {imported},
  98. month = dec,
  99. pages = {995--1000},
  100. publisher = {IEEE},
  101. series = {ICDM '10},
  102. timestamp = {2019-05-21T10:10:49.000+0200},
  103. title = {{Factorization Machines}},
  104. url = {http://ieeexplore.ieee.org/document/5694074/},
  105. year = 2010
  106. }
  107. @inproceedings{Juan_fieldawarefm1,
  108. added-at = {2018-11-06T00:00:00.000+0100},
  109. author = {Juan, Yu-Chin and Zhuang, Yong and Chin, Wei-Sheng and Lin, Chih-Jen},
  110. biburl = {https://www.bibsonomy.org/bibtex/2fbb5958a0b0b3ab03c7423e84cc08d9c/dblp},
  111. booktitle = {RecSys},
  112. crossref = {conf/recsys/2016},
  113. editor = {Sen, Shilad and Geyer, Werner and Freyne, Jill and Castells, Pablo},
  114. ee = {https://doi.org/10.1145/2959100.2959134},
  115. interhash = {b512083d1729eed87424afe44ebc8677},
  116. intrahash = {fbb5958a0b0b3ab03c7423e84cc08d9c},
  117. isbn = {978-1-4503-4035-9},
  118. keywords = {dblp},
  119. pages = {43-50},
  120. publisher = {ACM},
  121. timestamp = {2018-11-07T12:40:54.000+0100},
  122. title = {Field-aware Factorization Machines for CTR Prediction.},
  123. url = {http://dblp.uni-trier.de/db/conf/recsys/recsys2016.html#JuanZCL16},
  124. year = 2016
  125. }
  126. @article{Juan_fieldawarefm2,
  127. added-at = {2018-08-13T00:00:00.000+0200},
  128. author = {Juan, Yuchin and Lefortier, Damien and Chapelle, Olivier},
  129. biburl = {https://www.bibsonomy.org/bibtex/29ef509381d1eb3ebd24239efc195f9fb/dblp},
  130. ee = {http://arxiv.org/abs/1701.04099},
  131. interhash = {1a419341131eb2bc20e6ac71713d7a6d},
  132. intrahash = {9ef509381d1eb3ebd24239efc195f9fb},
  133. journal = {CoRR},
  134. keywords = {dblp},
  135. timestamp = {2018-08-14T13:16:14.000+0200},
  136. title = {Field-aware Factorization Machines in a Real-world Online Advertising System.},
  137. url = {http://dblp.uni-trier.de/db/journals/corr/corr1701.html#JuanLC17},
  138. volume = {abs/1701.04099},
  139. year = 2017
  140. }
  141. @article{Pan_fieldweightedfm,
  142. added-at = {2018-08-13T00:00:00.000+0200},
  143. author = {Pan, Junwei and Xu, Jian and Ruiz, Alfonso Lobos and Zhao, Wenliang and Pan, Shengjun and Sun, Yu and Lu, Quan},
  144. biburl = {https://www.bibsonomy.org/bibtex/203e245bd5b30499fbdd6ff6b60c4b022/dblp},
  145. ee = {http://arxiv.org/abs/1806.03514},
  146. interhash = {13c7bf6b08564f96ec471e2b42a90218},
  147. intrahash = {03e245bd5b30499fbdd6ff6b60c4b022},
  148. journal = {CoRR},
  149. keywords = {dblp},
  150. timestamp = {2018-08-14T13:11:25.000+0200},
  151. title = {Field-weighted Factorization Machines for Click-Through Rate Prediction in Display Advertising.},
  152. url = {http://dblp.uni-trier.de/db/journals/corr/corr1806.html#abs-1806-03514},
  153. volume = {abs/1806.03514},
  154. year = 2018
  155. }
  156. @inproceedings{Pan_sparsefm,
  157. added-at = {2019-02-11T00:00:00.000+0100},
  158. author = {Pan, Zhen and Chen, Enhong and Liu, Qi and Xu, Tong and Ma, Haiping and Lin, Hongjie},
  159. biburl = {https://www.bibsonomy.org/bibtex/2a22be9a0667f11266d704e178d8a2b6e/dblp},
  160. booktitle = {ICDM},
  161. crossref = {conf/icdm/2016},
  162. editor = {Bonchi, Francesco and Domingo-Ferrer, Josep and Baeza-Yates, Ricardo and Zhou, Zhi-Hua and Wu, Xindong},
  163. ee = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2016.0051},
  164. interhash = {639e5eb01646b897aeb0dc3257588811},
  165. intrahash = {a22be9a0667f11266d704e178d8a2b6e},
  166. keywords = {dblp},
  167. pages = {400-409},
  168. publisher = {IEEE Computer Society},
  169. timestamp = {2019-10-17T13:02:53.000+0200},
  170. title = {Sparse Factorization Machines for Click-through Rate Prediction.},
  171. url = {http://dblp.uni-trier.de/db/conf/icdm/icdm2016.html#PanCLXML16},
  172. year = 2016
  173. }
  174. @inproceedings{Freudenthaler2011BayesianFM,
  175. title={Bayesian Factorization Machines},
  176. author={Freudenthaler, C., Schmidt-Thieme, L., and Rendle, S},
  177. booktitle={In Proceedings of the NIPS Workshop on Sparse Representation and Low-rank Approximation},
  178. year={2011}
  179. }
  180. @article{Xiao_afm,
  181. added-at = {2018-08-13T00:00:00.000+0200},
  182. author = {Xiao, Jun and Ye, Hao and He, Xiangnan and Zhang, Hanwang and Wu, Fei and Chua, Tat-Seng},
  183. biburl = {https://www.bibsonomy.org/bibtex/2b66b4732b35617644835daba33d1a916/dblp},
  184. ee = {http://arxiv.org/abs/1708.04617},
  185. interhash = {4f5c499774291dc0e9184e781c365c05},
  186. intrahash = {b66b4732b35617644835daba33d1a916},
  187. journal = {CoRR},
  188. keywords = {dblp},
  189. timestamp = {2018-08-14T13:52:58.000+0200},
  190. title = {Attentional Factorization Machines: Learning the Weight of Feature Interactions via Attention Networks.},
  191. url = {http://dblp.uni-trier.de/db/journals/corr/corr1708.html#abs-1708-04617},
  192. volume = {abs/1708.04617},
  193. year = 2017
  194. }
  195. @article{srivastava2014dropout,
  196. abstract = {{Deep neural nets with a large number of parameters are very powerful machine learning systems. However, overfitting is a serious problem in such networks. Large networks are also slow to use, making it difficult to deal with overfitting by combining the predictions of many different large neural nets at test time. Dropout is a technique for addressing this problem. The key idea is to randomly drop units (along with their connections) from the neural network during training. This prevents units from co-adapting too much. During training, dropout samples from an exponential number of different "thinned" networks. At test time, it is easy to approximate the effect of averaging the predictions of all these thinned networks by simply using a single unthinned network that has smaller weights. This significantly reduces overfitting and gives major improvements over other regularization methods. We show that dropout improves the performance of neural networks on supervised learning tasks in vision, speech recognition, document classification and computational biology, obtaining state-of-the-art results on many benchmark data sets.}},
  197. added-at = {2017-07-19T15:29:59.000+0200},
  198. author = {Srivastava, Nitish and Hinton, Geoffrey and Krizhevsky, Alex and Sutskever, Ilya and Salakhutdinov, Ruslan},
  199. biburl = {https://www.bibsonomy.org/bibtex/20715644d640cdaad9258133625cc5fe9/andreashdez},
  200. citeulike-article-id = {13833631},
  201. citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=2670313},
  202. interhash = {bdad866eb5fd8994c2aeae46af6def20},
  203. intrahash = {0715644d640cdaad9258133625cc5fe9},
  204. issn = {1532-4435},
  205. journal = {J. Mach. Learn. Res.},
  206. keywords = {imported},
  207. month = jan,
  208. number = 1,
  209. pages = {1929--1958},
  210. posted-at = {2016-04-29 18:36:35},
  211. priority = {0},
  212. publisher = {JMLR.org},
  213. timestamp = {2017-07-19T15:31:02.000+0200},
  214. title = {{Dropout: A Simple Way to Prevent Neural Networks from Overfitting}},
  215. url = {http://portal.acm.org/citation.cfm?id=2670313},
  216. volume = 15,
  217. year = 2014
  218. }
  219. @inproceedings{tikhonov1943stability,
  220. title={On the stability of inverse problems},
  221. author={Tikhonov, Andrey Nikolayevich},
  222. booktitle={Dokl. Akad. Nauk SSSR},
  223. volume={39},
  224. pages={195--198},
  225. year={1943}
  226. }
  227. @inproceedings{Chen_deepctr,
  228. added-at = {2020-04-08T00:00:00.000+0200},
  229. author = {Chen, Junxuan and Sun, Baigui and Li, Hao and Lu, Hongtao and Hua, Xian-Sheng},
  230. biburl = {https://www.bibsonomy.org/bibtex/2381b8348cc449d46692ef7e7830a51b7/dblp},
  231. booktitle = {ACM Multimedia},
  232. crossref = {conf/mm/2016},
  233. editor = {Hanjalic, Alan and Snoek, Cees and Worring, Marcel and Bulterman, Dick C. A. and Huet, Benoit and Kelliher, Aisling and Kompatsiaris, Yiannis and Li, Jin},
  234. ee = {https://doi.org/10.1145/2964284.2964325},
  235. interhash = {f065025197d2320d883e2cc079fa7ac6},
  236. intrahash = {381b8348cc449d46692ef7e7830a51b7},
  237. isbn = {978-1-4503-3603-1},
  238. keywords = {dblp},
  239. pages = {811-820},
  240. publisher = {ACM},
  241. timestamp = {2020-04-09T11:42:00.000+0200},
  242. title = {Deep CTR Prediction in Display Advertising.},
  243. url = {http://dblp.uni-trier.de/db/conf/mm/mm2016.html#ChenSLLH16},
  244. year = 2016
  245. }
  246. @misc{he2015residual,
  247. abstract = {Deeper neural networks are more difficult to train. We present a residual
  248. learning framework to ease the training of networks that are substantially
  249. deeper than those used previously. We explicitly reformulate the layers as
  250. learning residual functions with reference to the layer inputs, instead of
  251. learning unreferenced functions. We provide comprehensive empirical evidence
  252. showing that these residual networks are easier to optimize, and can gain
  253. accuracy from considerably increased depth. On the ImageNet dataset we evaluate
  254. residual nets with a depth of up to 152 layers---8x deeper than VGG nets but
  255. still having lower complexity. An ensemble of these residual nets achieves
  256. 3.57% error on the ImageNet test set. This result won the 1st place on the
  257. ILSVRC 2015 classification task. We also present analysis on CIFAR-10 with 100
  258. and 1000 layers.
  259. The depth of representations is of central importance for many visual
  260. recognition tasks. Solely due to our extremely deep representations, we obtain
  261. a 28% relative improvement on the COCO object detection dataset. Deep residual
  262. nets are foundations of our submissions to ILSVRC & COCO 2015 competitions,
  263. where we also won the 1st places on the tasks of ImageNet detection, ImageNet
  264. localization, COCO detection, and COCO segmentation.},
  265. added-at = {2017-05-15T22:38:25.000+0200},
  266. author = {He, Kaiming and Zhang, Xiangyu and Ren, Shaoqing and Sun, Jian},
  267. biburl = {https://www.bibsonomy.org/bibtex/2d0b3536c45de7324284739a24006de6a/axel.vogler},
  268. description = {Deep Residual Learning for Image Recognition},
  269. interhash = {3066b045c86a0b721a053f73eb50cd95},
  270. intrahash = {d0b3536c45de7324284739a24006de6a},
  271. keywords = {deep-learning res-net},
  272. note = {cite arxiv:1512.03385Comment: Tech report},
  273. timestamp = {2017-05-15T22:38:25.000+0200},
  274. title = {Deep Residual Learning for Image Recognition},
  275. url = {http://arxiv.org/abs/1512.03385},
  276. year = 2015
  277. }
  278. @inproceedings{Nair_relu,
  279. added-at = {2019-04-03T00:00:00.000+0200},
  280. author = {Nair, Vinod and Hinton, Geoffrey E.},
  281. biburl = {https://www.bibsonomy.org/bibtex/2059683ca9b2457d248942520babbe000/dblp},
  282. booktitle = {ICML},
  283. crossref = {conf/icml/2010},
  284. editor = {Fürnkranz, Johannes and Joachims, Thorsten},
  285. ee = {https://icml.cc/Conferences/2010/papers/432.pdf},
  286. interhash = {acefcb0a5d1a937232f02f3fe0d5ab86},
  287. intrahash = {059683ca9b2457d248942520babbe000},
  288. keywords = {dblp},
  289. pages = {807-814},
  290. publisher = {Omnipress},
  291. timestamp = {2019-04-04T11:48:32.000+0200},
  292. title = {Rectified Linear Units Improve Restricted Boltzmann Machines.},
  293. url = {http://dblp.uni-trier.de/db/conf/icml/icml2010.html#NairH10},
  294. year = 2010
  295. }
  296. @article{Guo_embedding_2016,
  297. added-at = {2018-08-13T00:00:00.000+0200},
  298. author = {Guo, Cheng and Berkhahn, Felix},
  299. biburl = {https://www.bibsonomy.org/bibtex/24f27494e7e90a5cbe32c726f3b729495/dblp},
  300. ee = {http://arxiv.org/abs/1604.06737},
  301. interhash = {6e2f004f0eaeff1b3ae92bbb7662dc33},
  302. intrahash = {4f27494e7e90a5cbe32c726f3b729495},
  303. journal = {CoRR},
  304. keywords = {dblp},
  305. timestamp = {2018-08-14T13:14:38.000+0200},
  306. title = {Entity Embeddings of Categorical Variables.},
  307. url = {http://dblp.uni-trier.de/db/journals/corr/corr1604.html#GuoB16},
  308. volume = {abs/1604.06737},
  309. year = 2016
  310. }
  311. @misc{ioffe2015batch,
  312. abstract = {Training Deep Neural Networks is complicated by the fact that the
  313. distribution of each layer's inputs changes during training, as the parameters
  314. of the previous layers change. This slows down the training by requiring lower
  315. learning rates and careful parameter initialization, and makes it notoriously
  316. hard to train models with saturating nonlinearities. We refer to this
  317. phenomenon as internal covariate shift, and address the problem by normalizing
  318. layer inputs. Our method draws its strength from making normalization a part of
  319. the model architecture and performing the normalization for each training
  320. mini-batch. Batch Normalization allows us to use much higher learning rates and
  321. be less careful about initialization. It also acts as a regularizer, in some
  322. cases eliminating the need for Dropout. Applied to a state-of-the-art image
  323. classification model, Batch Normalization achieves the same accuracy with 14
  324. times fewer training steps, and beats the original model by a significant
  325. margin. Using an ensemble of batch-normalized networks, we improve upon the
  326. best published result on ImageNet classification: reaching 4.9% top-5
  327. validation error (and 4.8% test error), exceeding the accuracy of human raters.},
  328. added-at = {2018-07-09T15:43:42.000+0200},
  329. author = {Ioffe, Sergey and Szegedy, Christian},
  330. biburl = {https://www.bibsonomy.org/bibtex/2bd6078b46e07f6e32cc0462a28ad929b/analyst},
  331. description = {[1502.03167] Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift},
  332. interhash = {bf2b461f54850dbae02a295b9f5e799b},
  333. intrahash = {bd6078b46e07f6e32cc0462a28ad929b},
  334. keywords = {2015 arxiv deep-learning paper},
  335. note = {cite arxiv:1502.03167},
  336. timestamp = {2018-07-09T15:43:42.000+0200},
  337. title = {Batch Normalization: Accelerating Deep Network Training by Reducing
  338. Internal Covariate Shift},
  339. url = {http://arxiv.org/abs/1502.03167},
  340. year = 2015
  341. }
  342. @inproceedings{Guo_deepfm1,
  343. added-at = {2019-08-20T00:00:00.000+0200},
  344. author = {Guo, Huifeng and Tang, Ruiming and Ye, Yunming and Li, Zhenguo and He, Xiuqiang},
  345. biburl = {https://www.bibsonomy.org/bibtex/28c60cf7c56f3788385adec2feff31eb8/dblp},
  346. booktitle = {IJCAI},
  347. crossref = {conf/ijcai/2017},
  348. editor = {Sierra, Carles},
  349. ee = {https://doi.org/10.24963/ijcai.2017/239},
  350. interhash = {45dbc7efa61cb111c8e3e6b86fcbc1e9},
  351. intrahash = {8c60cf7c56f3788385adec2feff31eb8},
  352. isbn = {978-0-9992411-0-3},
  353. keywords = {dblp},
  354. pages = {1725-1731},
  355. publisher = {ijcai.org},
  356. timestamp = {2019-08-21T11:50:23.000+0200},
  357. title = {DeepFM: A Factorization-Machine based Neural Network for CTR Prediction.},
  358. url = {http://dblp.uni-trier.de/db/conf/ijcai/ijcai2017.html#GuoTYLH17},
  359. year = 2017
  360. }
  361. @article{Guo_deepfm2,
  362. added-at = {2018-08-13T00:00:00.000+0200},
  363. author = {Guo, Huifeng and Tang, Ruiming and Ye, Yunming and Li, Zhenguo and He, Xiuqiang and Dong, Zhenhua},
  364. biburl = {https://www.bibsonomy.org/bibtex/280f0da037e5fe04038cdadd5f576f2c3/dblp},
  365. ee = {http://arxiv.org/abs/1804.04950},
  366. interhash = {9bf85b0369ba8fdc3234a6ab5c0b0efe},
  367. intrahash = {80f0da037e5fe04038cdadd5f576f2c3},
  368. journal = {CoRR},
  369. keywords = {dblp},
  370. timestamp = {2018-08-14T13:49:28.000+0200},
  371. title = {DeepFM: An End-to-End Wide and Deep Learning Framework for CTR Prediction.},
  372. url = {http://dblp.uni-trier.de/db/journals/corr/corr1804.html#abs-1804-04950},
  373. volume = {abs/1804.04950},
  374. year = 2018
  375. }
  376. @inproceedings{Cheng_wideanddeep,
  377. added-at = {2018-11-06T00:00:00.000+0100},
  378. author = {Cheng, Heng-Tze and Koc, Levent and Harmsen, Jeremiah and Shaked, Tal and Chandra, Tushar and Aradhye, Hrishi and Anderson, Glen and Corrado, Greg and Chai, Wei and Ispir, Mustafa and Anil, Rohan and Haque, Zakaria and Hong, Lichan and Jain, Vihan and Liu, Xiaobing and Shah, Hemal},
  379. biburl = {https://www.bibsonomy.org/bibtex/2efca753e4be0e74da92bf8099da61ea8/dblp},
  380. booktitle = {DLRS@RecSys},
  381. crossref = {conf/recsys/2016dlrs},
  382. editor = {Karatzoglou, Alexandros and Hidasi, Balázs and Tikk, Domonkos and Shalom, Oren Sar and Roitman, Haggai and Shapira, Bracha and Rokach, Lior},
  383. ee = {https://doi.org/10.1145/2988450.2988454},
  384. interhash = {c8766e5f4191faa5750e5e06e508a520},
  385. intrahash = {efca753e4be0e74da92bf8099da61ea8},
  386. isbn = {978-1-4503-4795-2},
  387. keywords = {dblp},
  388. pages = {7-10},
  389. publisher = {ACM},
  390. timestamp = {2018-11-07T12:41:02.000+0100},
  391. title = {Wide and Deep Learning for Recommender Systems.},
  392. url = {http://dblp.uni-trier.de/db/conf/recsys/dlrs2016.html#Cheng0HSCAACCIA16},
  393. year = 2016
  394. }
  395. @article{Wang_asae,
  396. added-at = {2020-09-22T00:00:00.000+0200},
  397. author = {Wang, Qianqian and Liu, Fang'ai and Xing, Shuning and Zhao, Xiaohui},
  398. biburl = {https://www.bibsonomy.org/bibtex/25c758b41e113ef62b5ca3bab13069584/dblp},
  399. ee = {https://www.wikidata.org/entity/Q57300381},
  400. interhash = {55f89635b4315ec35f8b3f946914d866},
  401. intrahash = {5c758b41e113ef62b5ca3bab13069584},
  402. journal = {Comput. Math. Methods Medicine},
  403. keywords = {dblp},
  404. pages = {8056541:1-8056541:11},
  405. timestamp = {2020-09-23T11:34:11.000+0200},
  406. title = {A New Approach for Advertising CTR Prediction Based on Deep Neural Network via Attention Mechanism.},
  407. url = {http://dblp.uni-trier.de/db/journals/cmmm/cmmm2018.html#WangLXZ18},
  408. volume = 2018,
  409. year = 2018
  410. }
  411. @inproceedings{Ballard_autoencoder,
  412. added-at = {2012-12-12T00:00:00.000+0100},
  413. author = {Ballard, Dana H.},
  414. biburl = {https://www.bibsonomy.org/bibtex/23a1bf479c829398d544f4ad84e8c7657/dblp},
  415. booktitle = {AAAI},
  416. crossref = {conf/aaai/1987},
  417. editor = {Forbus, Kenneth D. and Shrobe, Howard E.},
  418. ee = {http://www.aaai.org/Library/AAAI/1987/aaai87-050.php},
  419. interhash = {c616c959bdfa632f6961529154757f25},
  420. intrahash = {3a1bf479c829398d544f4ad84e8c7657},
  421. keywords = {dblp},
  422. pages = {279-284},
  423. publisher = {Morgan Kaufmann},
  424. timestamp = {2018-06-21T11:48:19.000+0200},
  425. title = {Modular Learning in Neural Networks.},
  426. url = {http://dblp.uni-trier.de/db/conf/aaai/aaai87.html#Ballard87},
  427. year = 1987
  428. }
  429. @book{ShannonWeaver49,
  430. added-at = {2008-09-16T23:39:07.000+0200},
  431. address = {Urbana and Chicago},
  432. author = {Shannon, Claude E. and Weaver, Warren},
  433. biburl = {https://www.bibsonomy.org/bibtex/2fc189b21087056440c3194e3be26261b/brian.mingus},
  434. booktitle = {The Mathematical Theory of Communication},
  435. description = {CCNLab BibTeX},
  436. interhash = {ddf5810ad302fbd007f99a3b4fb0fae3},
  437. intrahash = {fc189b21087056440c3194e3be26261b},
  438. keywords = {stats},
  439. publisher = {University of Illinois Press},
  440. timestamp = {2008-09-16T23:41:10.000+0200},
  441. title = {The Mathematical Theory of Communication},
  442. year = 1949
  443. }
  444. @article{Naumov_embedding_dim,
  445. added-at = {2019-01-31T00:00:00.000+0100},
  446. author = {Naumov, Maxim},
  447. biburl = {https://www.bibsonomy.org/bibtex/2eccf1f0dfafd15cb01a6fbb1419a6735/dblp},
  448. ee = {http://arxiv.org/abs/1901.02103},
  449. interhash = {25df713996088bf05e247e8f192bb27d},
  450. intrahash = {eccf1f0dfafd15cb01a6fbb1419a6735},
  451. journal = {CoRR},
  452. keywords = {dblp},
  453. timestamp = {2019-02-01T11:37:02.000+0100},
  454. title = {On the Dimensionality of Embeddings for Sparse Features and Data.},
  455. url = {http://dblp.uni-trier.de/db/journals/corr/corr1901.html#abs-1901-02103},
  456. volume = {abs/1901.02103},
  457. year = 2019
  458. }
  459. @inproceedings{he2017neural,
  460. added-at = {2020-06-21T20:57:25.000+0200},
  461. address = {Republic and Canton of Geneva, CHE},
  462. author = {He, Xiangnan and Liao, Lizi and Zhang, Hanwang and Nie, Liqiang and Hu, Xia and Chua, Tat-Seng},
  463. biburl = {https://www.bibsonomy.org/bibtex/26abc7ad98fdfc7d6494a09058988c85b/sdo},
  464. booktitle = {Proceedings of the 26th International Conference on World Wide Web},
  465. doi = {10.1145/3038912.3052569},
  466. interhash = {500610c9f82426e50dbabe0ced94c2e9},
  467. intrahash = {6abc7ad98fdfc7d6494a09058988c85b},
  468. isbn = {9781450349130},
  469. keywords = {collaborative deep factorization feedback filtering implicit learning matrix networks neural},
  470. location = {Perth, Australia},
  471. numpages = {10},
  472. pages = {173–182},
  473. publisher = {International World Wide Web Conferences Steering Committee},
  474. series = {WWW ’17},
  475. timestamp = {2020-06-21T20:57:25.000+0200},
  476. title = {Neural Collaborative Filtering},
  477. url = {https://doi.org/10.1145/3038912.3052569},
  478. year = 2017
  479. }
  480. @inproceedings{maas2013leakyrelu,
  481. title={Rectifier nonlinearities improve neural network acoustic models},
  482. author={Maas, Andrew L and Hannun, Awni Y and Ng, Andrew Y},
  483. booktitle={Proc. icml},
  484. volume={30},
  485. number={1},
  486. pages={3},
  487. year={2013},
  488. organization={Citeseer}
  489. }
  490. @article{t-sne,
  491. added-at = {2017-01-24T11:10:59.000+0100},
  492. author = {van der Maaten, Laurens and Hinton, Geoffrey},
  493. biburl = {https://www.bibsonomy.org/bibtex/28b9aebb404ad4a4c6a436ea413550b30/nosebrain},
  494. interhash = {370ba8b9e1909b61880a6f47c93bcd49},
  495. intrahash = {8b9aebb404ad4a4c6a436ea413550b30},
  496. journal = {Journal of Machine Learning Research},
  497. keywords = {data t-sne visualization},
  498. pages = {2579--2605},
  499. timestamp = {2017-01-24T11:10:59.000+0100},
  500. title = {Visualizing Data using {t-SNE} },
  501. url = {http://www.jmlr.org/papers/v9/vandermaaten08a.html},
  502. volume = 9,
  503. year = 2008
  504. }
  505. @article{Ginart_MixedDimEmb,
  506. added-at = {2019-09-27T00:00:00.000+0200},
  507. author = {Ginart, Antonio and Naumov, Maxim and Mudigere, Dheevatsa and Yang, Jiyan and Zou, James},
  508. biburl = {https://www.bibsonomy.org/bibtex/2c5035c95f2b669264227e6d5ce35497a/dblp},
  509. ee = {http://arxiv.org/abs/1909.11810},
  510. interhash = {a2574b7523b570e6928cd2d28506206b},
  511. intrahash = {c5035c95f2b669264227e6d5ce35497a},
  512. journal = {CoRR},
  513. keywords = {dblp},
  514. timestamp = {2019-09-28T11:37:55.000+0200},
  515. title = {Mixed Dimension Embeddings with Application to Memory-Efficient Recommendation Systems.},
  516. url = {http://dblp.uni-trier.de/db/journals/corr/corr1909.html#abs-1909-11810},
  517. volume = {abs/1909.11810},
  518. year = 2019
  519. }
  520. @article{choi2020online,
  521. added-at = {2020-07-31T00:00:00.000+0200},
  522. author = {Choi, Hana and Mela, Carl F. and Balseiro, Santiago R. and Leary, Adam},
  523. biburl = {https://www.bibsonomy.org/bibtex/22abdd5a8fcbecc6f6c6dcff05bd30dd8/dblp},
  524. ee = {https://doi.org/10.1287/isre.2019.0902},
  525. interhash = {4449e1306bf6c274e9d57342192c0bc8},
  526. intrahash = {2abdd5a8fcbecc6f6c6dcff05bd30dd8},
  527. journal = {Inf. Syst. Res.},
  528. keywords = {dblp},
  529. number = 2,
  530. pages = {556-575},
  531. timestamp = {2020-08-01T11:38:28.000+0200},
  532. title = {Online Display Advertising Markets: A Literature Review and Future Directions.},
  533. url = {http://dblp.uni-trier.de/db/journals/isr/isr31.html#ChoiMBL20},
  534. volume = 31,
  535. year = 2020
  536. }
  537. @INPROCEEDINGS{yuan2014survey, author={Yuan, Yong and Wang, Feiyue and Li, Juanjuan and Qin, Rui}, booktitle={Proceedings of 2014 IEEE International Conference on Service Operations and Logistics, and Informatics}, title={A survey on real time bidding advertising}, year={2014}, volume={}, number={}, pages={418-423}, doi={10.1109/SOLI.2014.6960761}}
  538. @inproceedings{qin2019revenue,
  539. added-at = {2019-10-18T00:00:00.000+0200},
  540. author = {Qin, Rui and Ni, Xiaochun and Yuan, Yong and Li, Juanjuan and Wang, Fei-Yue},
  541. biburl = {https://www.bibsonomy.org/bibtex/24e703bb84e53b4b34f5168c32d365ddf/dblp},
  542. booktitle = {SMC},
  543. crossref = {conf/smc/2017},
  544. ee = {https://doi.org/10.1109/SMC.2017.8122644},
  545. interhash = {b57212f4c4a7349707a060f9b3005db9},
  546. intrahash = {4e703bb84e53b4b34f5168c32d365ddf},
  547. isbn = {978-1-5386-1645-1},
  548. keywords = {dblp},
  549. pages = {438-443},
  550. publisher = {IEEE},
  551. timestamp = {2019-10-19T11:40:41.000+0200},
  552. title = {Revenue models for demand side platforms in real time bidding advertising.},
  553. url = {http://dblp.uni-trier.de/db/conf/smc/smc2017.html#QinNYLW17},
  554. year = 2017
  555. }
  556. @incollection{reference/ml/LingS17,
  557. added-at = {2017-04-18T00:00:00.000+0200},
  558. author = {Ling, Charles X. and Sheng, Victor S.},
  559. biburl = {https://www.bibsonomy.org/bibtex/244fcb6ab821f14b0318d4f1c26db9723/dblp},
  560. booktitle = {Encyclopedia of Machine Learning and Data Mining},
  561. crossref = {reference/ml/2017},
  562. editor = {Sammut, Claude and Webb, Geoffrey I.},
  563. ee = {http://dx.doi.org/10.1007/978-1-4899-7687-1_110},
  564. interhash = {e976e365819bfb5007ab4e447b8db77c},
  565. intrahash = {44fcb6ab821f14b0318d4f1c26db9723},
  566. isbn = {978-1-4899-7687-1},
  567. keywords = {dblp},
  568. pages = {204-205},
  569. publisher = {Springer},
  570. timestamp = {2017-04-19T11:47:40.000+0200},
  571. title = {Class Imbalance Problem.},
  572. url = {http://dblp.uni-trier.de/db/reference/ml/ml2017.html#LingS17},
  573. year = 2017
  574. }
  575. @misc{pires2019high,
  576. title={High dimensionality: The latest challenge to data analysis},
  577. author={A. M. Pires and J. A. Branco},
  578. year={2019},
  579. eprint={1902.04679},
  580. archivePrefix={arXiv},
  581. primaryClass={stat.ME}
  582. }
  583. @article{journals/eswa/LikaKH14,
  584. added-at = {2018-11-14T00:00:00.000+0100},
  585. author = {Lika, Blerina and Kolomvatsos, Kostas and Hadjiefthymiades, Stathes},
  586. biburl = {https://www.bibsonomy.org/bibtex/2fc178a46831b1274c383c7f59a6e45a1/dblp},
  587. ee = {https://www.wikidata.org/entity/Q56699601},
  588. interhash = {75c03e661d776a34045e2aa7f6f25623},
  589. intrahash = {fc178a46831b1274c383c7f59a6e45a1},
  590. journal = {Expert Syst. Appl.},
  591. keywords = {dblp},
  592. number = 4,
  593. pages = {2065-2073},
  594. timestamp = {2018-11-15T12:09:50.000+0100},
  595. title = {Facing the cold start problem in recommender systems.},
  596. url = {http://dblp.uni-trier.de/db/journals/eswa/eswa41.html#LikaKH14},
  597. volume = 41,
  598. year = 2014
  599. }
  600. @article{DBLP:journals/corr/abs-1004-3732,
  601. author = {Zi{-}Ke Zhang and
  602. Chuang Liu and
  603. Yi{-}Cheng Zhang and
  604. Tao Zhou},
  605. title = {Solving the Cold-Start Problem in Recommender Systems with Social
  606. Tags},
  607. journal = {CoRR},
  608. volume = {abs/1004.3732},
  609. year = {2010},
  610. url = {http://arxiv.org/abs/1004.3732},
  611. archivePrefix = {arXiv},
  612. eprint = {1004.3732},
  613. timestamp = {Mon, 13 Aug 2018 16:46:35 +0200},
  614. biburl = {https://dblp.org/rec/journals/corr/abs-1004-3732.bib},
  615. bibsource = {dblp computer science bibliography, https://dblp.org}
  616. }
  617. @article{journals/corr/ZhangYS17aa,
  618. added-at = {2018-11-19T00:00:00.000+0100},
  619. author = {Zhang, Shuai and Yao, Lina and Sun, Aixin},
  620. biburl = {https://www.bibsonomy.org/bibtex/24638a74008191211151c5f5b989deaf6/dblp},
  621. ee = {http://arxiv.org/abs/1707.07435},
  622. interhash = {b9deeb062ab460de31016200e0fe712d},
  623. intrahash = {4638a74008191211151c5f5b989deaf6},
  624. journal = {CoRR},
  625. keywords = {dblp},
  626. timestamp = {2018-11-20T11:37:21.000+0100},
  627. title = {Deep Learning based Recommender System: A Survey and New Perspectives.},
  628. url = {http://dblp.uni-trier.de/db/journals/corr/corr1707.html#ZhangYS17aa},
  629. volume = {abs/1707.07435},
  630. year = 2017
  631. }