Question

[1] AKELLA R，BRODER A，JOSIFOVSKI V.Introduction to computational advertising[C].Meet-ing of the Association for Computational Linguistics，2011.https://classes.soe.ucsc.edu/ism293/Spring09/material/Lecture%201.pdf.

[2] ANDERSON Q.Storm实时数据处理[M].卢誉声，译.北京: 机械工业出版社，2014.

[3] ARENSW.当代广告学[M].丁俊杰，程坪，译.北京: 人民邮电出版社，2005.

[4] AUDIBERT J Y，MUNOS R，SZEPESVARI C.Use of variance estimation in the multi-armed bandit problem[C].Proceedings of NIPS’06，2006.

[5] BENNETT J，LANNING S.The Netflix Prize[C].Kdd Cup & Workshop in Conjunction with Kdd，2007.

[6] BERGER A，PIETRA S AD，PIETRA V JD.A maximum entropy approach to natural language processing[J].Computational Linguistics，1996，22（1）:39-71.

[7] BERGER A.The Improved Iterative Scaling Algorithm，a Gentle Introduction[M].Pittsburgh:Carnegie MellonUniversity Press，1997.

[8] BHARADWAJ V，CHEN P，MA W，et al.SHALE: an efficient algorithm for allocation of guar-anteed display advertising[C].Proceedings of KDD，2012:1195-1203.

[9] BISHOP C M.Pattern recognition and machine learning.springer[J].IEEE Transactions on PatternAnalysis and Machine Intelligence（PAMI），2006，16（4）:049901.

[10] BLEI D M，NG A Y，JORDAN M I.Latent dirichletallocation[J].Journal of Machine Learning Research，2003，3:993-1022.

[11] BLEI D M，MCAULIFFE J D.Supervised Topic Models[C].Proceedings of NIPS，2007:993-1022.

[12] BOTTOU L.Large-scale machine learning with stochastic gradient descent[C].Proceedings ofCOMPSTAT’10.2010.

[13] BOYD S，VANDENBERGHE L.Convex Optimization[M].Cambridge: Cambridge University Press，2004.

[14] BOYD S，PARIKH N，CHU E，et al.Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers[J].Foundations&Trends in Machine Learning，2010，3（1）:883-898（16）.

[15] BRODER A Z，CARMEL D，HERSCOVICI M，et al.Efficient Query Evaluation Using a Twolevel-Retrieval Process[C].Proceedings of CIKM’03，2003: 426-434.

[16] BURGES C JC.A Tutorial on Support Vector Machines for Pattern Recognition.Data Mining and Knowledge Discovery[J].Data Mining&Knowledge Discovery，1998，2（2）:121-167.

[17] BURROWS M.The Chubby lock service for loosely-coupled distributed systems[C].Proceedings ofOSDI’06，2006.

[18] CANNY J.GaP:a factor model for discrete data[C].Proceedings of SIGIR.2004:122-129.

[19] CHAKRABORTY T，EVEN-DAR E，GUHA S，et al.Internet and Network Economics[C].Pro-ceedings of WINE’10，2010:145-157.

[20] CHANG F，DEAN J ，GHEMAWAT S，et al.Bigtable: A Distributed Storage System For Struc-tured Data[J].ACM Transactions on Computer Systems，2008，26（2）.

[21] 陈超.Spark大数据平台[M].北京，2014.http://www.chinahadoop.cn/course/7.

[22] CHENYE，PAVLOV D，CANNY J F.Large-scale behavioral targeting[C].Proceedings of KDD，2009:426-434.

[23] CHEN PEIJI，MA WENJING，MANDALAPU S，et al.Ad Serving Using a Compact Allocation-Plan[M].[S.I]:[s.n]，2012.

[24] CLARKE E H.Multipart pricing of public goods[J].Public Choice，1971，11（1）:17-33.

[25] CUI YING，ZHANG RUOFEI，LI WEI，et al.Bid landscape forecasting in online ad exchange marketplace[J].Proceedings of KDD’11，2011:265-273.

[26] DEAN J，GHEMAWAT S.MapReduce: Simplied Data Processing on Large Clusters[CJ].Pro-ceedings of OSDI’04，2004.

[27] DEERWESTER S，DUMAIS S T，FURNAS G W，et al.Richard Harshman Indexing by Latent Semantic Analysis[J].Journal of the American Society for Information Science，1990，41（6）:391-407.

[28] DEMPSTER A.P，LAIRDN.M，RUBIN D.B.Maximum likelihood from incomplete data via the EM algorithm[J].Journal of the Royal Statistical Society，1977，39（1）:1-38.

[29] DWORK C.Differential Privacy: A Survey of Results[J].Theory and Applications of Models of Computation，2008，4978:1–19.

[30] EDELMAN B，OSTROVSKY M，SCHWARZ M，et al.Internet Advertising and the Generalized Second Price Auction: Selling Billions of Dollars Worth of Keywords.Working paper 2005[J].American Economic Review，2005，97（1）:242-259.

[31] FELDMAN J，KORULA N，MIRROKNI V，et al.Online Ad Assignment with Free Disposal[C].Proceedingsof WINE，2009:374-385.

[32] FREUND Y，SCHAPIRE R E.A Short Introduction to Boosting（“Recent Dvelopments in the Theory and Applications of Machine Learning”）[J].Journal of Japanese Society for Artificial In-telligence，1999，14（5）:771-780.

[33] GATES A F.Pig: A Structured，High-Level Dataflow System for Hadoop[M].[S.I]:[s.n.].

[34] GHEMAWAT S，GOBIOFF H，LEUNG S T.The Google File System[C].Proceedings of SOSP，2003.

[35] GHOSH A，MCAFEE P，PAPINENI K，VASSILVITSKII S.Representative Allocationsfor Guar-anteed Display Advertisilng[J].Manual script，2009.

[36] GILL J.Generalized Linear Model: a Unified Approach[M].London: SAGE publications，2000.

[37] GITTINS J.Bandit processes and dynamic allocation indices[J].Journal of the Royal StatisticalSociety.1979:148-177.

[38] GROVES T.Incentives in teams[C].//Econometrica.1973:617-31.

[39] HOFMANN T.Probabilistic Latent Semantic Indexing[C].Proceedings of Proceedings of SIGIR，2009:0-57.

[40] IAB.Digital Video Ad Serving Template（VAST） 3.0[EB/OL].北京.2014.http://www.iab.net/media/file/VASTv3.0.pdf.

[41] IAB.OpenRTB API Specification Version 2.2.[EB/OL].北京.2014.http://www.iab.net/media/file/OpenRTBAPISpecificationVersion2 2.pdf.

[42] JANSEN B J，MULLEN T.Sponsored search: an overview of the concept，history，and technol-ogy[J].International Journal of Electronic Business，2008.

[43] JORDAN M I.，GHAHRAMANI Z，JAAKKOLA T S.，et al.An Introduction to Variational Methods for Graphical Models[J].Machine Learning，1999，37（2）:183-233.

[44] JUNQUEIRA F，REED B.Zookeeper: Distributed Process Coordination[M].Oreilly Media，2013.

[45] KARAUH.Spark快速数据处理[M].余璜，张磊，译.北京: 机械工业出版社，2014.

[46] KOREN Y.Factorization meets the neighborhood: a multifaceted collaborative filtering model[C].Proceedings of KDD’08，2008:426-434.

[47] KING G，ZENG L.Logistic Regression in Rare Events Data[J].Political Analysis，2002，9（2）:137-163.

[48] KRUGMAN H E.The Impact of Television Advertising: Learning Without Involvement [J].Public Opinion Quarterly，1965，29（3）:349-356.

[49] LAMPORT L.Paxos Made Simple[N].SIGACT News.2001:32（4） 51-58.

[50] LIHONG LI，WEI CHU，LANGFORD J，et al.A Contextual-Bandit Approach to Personalized News Article Recommendation[C].Proceedings of WWW’10.2010:661-670.

[51] 李子骅.Redis入门指南[M].北京: 人民邮电出版社，2013.

[52] LIN C J，WENG R C，KEERTHI S S.Trust Region Newton Method for Large-Scale Logistic Regression[J].Journal of Machine Learning Research，2008，9（2）:627-650.

[53] 刘奕群，马少平，洪涛，等.搜索引擎技术基础[M].北京: 清华大学出版社，2010.

[54] MALOUF R.A Comparison Of Algorithms For Maximum Entropy Parameter Estimation[J].Pro-ceedingsof 6th Conference on Natural Language Learning，2002:1-7.

[55] MARKOWITZ H M.Portfolio Selection: Efficient Diversification of Investment[R].London:John Wiley&Sons，Inc ，1959.

[56] MAYERS.V，CUKIER K.Big Data: A Revolution That Transforms How we Work，Live，and Think[J].Houghton Mifflin Harcourt，2012.

[57] MCCANDLESS M，HATCHER E，GOSPODNETICO.Lucene实战[M].牛长流，肖宇，译.2版.北京: 人民邮电出版社，2011.

[58] MELVILLE P，SINDHWANI V.Recommender Systems.Encyclopedia of Machine Learning[M].Berlin:Springer，2010.

[59] MEHTAA，SABERI A，VAZIRANI U，et al.Adwords And Generalized Online Matching[J].Jour-nal of ACM，2007，54（5）:264-273.

[60] NARAYANAN A，SHMATIKOV V.Robust De-anonymization of Large Sparse Datasets[C].Pro-ceedings of IEEE Symposium on Security and Privacy.IEEE，2008:111-125.

[61] NEWMAN D，ASUNCION A，SMYTH P，et al.Distributed Inference for Latent Dirichlet Allo-cation[C].Proceedings of NIPS’08.2008.

[62] NOCEDAL J，WRIGHT S J.Numerical Optimization[J].Springer.1999.

[63] OLSTON C，REED B，SRIVASTAVA U，et al.PigLatin: a not-so-foreign language for data processing[C].Proceedings of SIGMOD’08，2008:1099-1110.

[64] OSTROVSKY M，SCHWARZ M.Reserve Prices in Internet Advertising Auctions: A Field Ex-periment[J].Stanford University Graduate School of Business Research.，2009，（2054）:59-60.

[65] PEROTTE A，BARTLETT N，ELHADAD N，et al.Hierarchically Supervised Latent Dirichlet Allocation[C].Proceedings of NIPS’11，2011.

[66] PRESS W H.Numerical Recipe [M].3rd ed.Cambridge: Cambridge University Press，2007.

[67] SLEE M，AGARWAL A，KWIATKOWSKI M.Thrift: Scalable cross-language services implemen-tation[J].Facebook White Paper，2007.

[68] SU XIAOYUAN，KHOSHGOFTAAR T M.A Survey of Collaborative Filtering Techniques[J].Advances in Artificial Intelligence，2009.

[69] TANG D，AGARWAL A，BRIEN D O，et al.Meyer M.Overlapping experiment infrastructure:more，better，faster experimentation[C].Proceedings of KDD’10，2010.

[70] 陶辉.深入理解Nginx: 模块开发与架构解析[M].北京: 机械工业出版社，2013.

[71] TURNEY P D，PANTEL P.From Frequency to Meaning: Vector Space Models of Semantics[J].Journal of Artificial Intelligence Research，2010:141-188.

[72] VARIAN H R.Position auctions[J].International Journal of Industrial Organization，2007，25（6）:1163-1178.

[73] VEE E，VASSILVITSKII S，SHANMUGASUNDARAM J.Optimal online assignment with fore-casts[C].Proceedings of the ACM Conference on Electronic Commerce，2010.

[74] VICKREY W.Counterspeculation，Auctions，and Competitive Sealed Tenders.[J].Journal of Finance.1961:8-37.

[75] WANG XUERUI，BRODER A，FONTOURA M，et al.A Search-Based Method For Forecasting Ad Impression In Contextual Advertising[C].Proceedings of WWW’09.2009: 491-500.

[76] WHANG S E，MOLINA H G.Indexing Boolean Expressions.[C].Proceedings of VLDB，2009，2（1）.

[77] WHITET.Hadoop权威指南[M].周敏奇，钱卫宁，金澈清，等，译.2版.北京: 清华大学出版社，2011.

[78] ZAHARIA M，CHOWDHURY M，MA J，et al.Spark: cluster computing with working sets[M].[S.l.]:[s.n.]，2010.

[79] FORUM M P.MPI:A message-passing interface standard [J].Proc ACM International Conference on Supercompting，1994，20（2）: 179.

[80] 赵必厦，程丽明.从零开始学Storm.[M].北京: 清华大学出版社，2014.

[81] YI ZHU，WILBUR K C.Hybrid Advertising Auctions[J].Social Science Electronic Publishing，2011，30（2）:249-273.

[82] ZINKEVICH M A，SMOLA A，WEIMER M，et al.Parallelized Stochastic Gradient Descent[C].Proceedings of NIPS’10，2010.

[83] ZOBEL J，MOFFAT A.Inverted Files For Text Search Engines[J].ACM Computing Surveys Surveys，2006，38（4）.