{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:05:30Z","timestamp":1729627530689,"version":"3.28.0"},"reference-count":46,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/cec.2013.6557983","type":"proceedings-article","created":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T18:57:12Z","timestamp":1374778632000},"page":"3371-3378","source":"Crossref","is-referenced-by-count":2,"title":["Learning non-linear ranking functions for web search using probabilistic model building GP"],"prefix":"10.1109","author":[{"given":"Hiroyuki","family":"Sato","sequence":"first","affiliation":[]},{"given":"Danushka","family":"Bollegala","sequence":"additional","affiliation":[]},{"given":"Yoshihiko","family":"Hasegawa","sequence":"additional","affiliation":[]},{"given":"Hitoshi","family":"Iba","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1108\/EUM0000000007186"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277808"},{"key":"17","first-page":"308","article-title":"How effective are multiple populations in genetic programming","volume":"308","author":"punch","year":"1998","journal-title":"Genetic Programming 1998 Proceedings of the Third Annual Conference"},{"key":"36","article-title":"Query-level loss functions for information retrieval","author":"qin","year":"2007","journal-title":"Informa Tion Processing and Management"},{"key":"18","article-title":"Letor: A benchmark collection for learning to rank for information retrieval","author":"qin","year":"2007","journal-title":"Microsoft Research Asia"},{"key":"33","article-title":"Pranking with ranking","author":"crammer","year":"2001","journal-title":"NIPS'01"},{"key":"15","first-page":"292","article-title":"A representation scheme to perform program induction in a canonical genetic algorithm","author":"wineberg","year":"1994","journal-title":"Proceedings of the i Nternational Conference on Evolutionary Computation The Third Conference on Parallel Problem Solving from Nature"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"16","first-page":"291","article-title":"An adverse interaction between the crossover operator and a restriction on tree depth","author":"gathercole","year":"1996","journal-title":"Proc 1st Annu Conf Genetic Programming"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390306"},{"key":"13","first-page":"1","article-title":"A novel graph-based estimation of distribution algorithm and its extension using reinforcement learning, \" Evolutionary Computation","volume":"99","author":"li","year":"2013","journal-title":"IEEE Transactions on"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.915999"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15246-7_12"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553449"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2001.934337"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/984321.984322"},{"key":"43","first-page":"399","article-title":"A combined component approach for finding collection-adapted ranking functions based on genetic programming","author":"de almeida","year":"2007","journal-title":"SIGIR 2007"},{"key":"42","first-page":"20","article-title":"Personalization of search engine services for effective retrieval and knowledge management","author":"fan","year":"2000","journal-title":"Twenty First International Conference on Information Systems (ICIS'00)"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20009"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.1269663"},{"key":"45","first-page":"2000","article-title":"Additive logistic regression: A statistical view of boosting","volume":"28","author":"friedman","year":"1998","journal-title":"Annals of Statistics"},{"key":"44","article-title":"Learning to rank for information retrieval using genetic programming","author":"yeh","year":"2007","journal-title":"SIGIR Workshop on Learning to Rank for Information Retrieval (LR4IR)"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9473(01)00065-2"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076068"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148189"},{"key":"24","article-title":"Relevance propagation for topic distillation uiuc trec 2003 web track experiments","author":"shakery","year":"2003","journal-title":"TREC'03"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076105"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001814"},{"key":"27","first-page":"97","article-title":"Support vector learning for ordinal regression","author":"herbrich","year":"1999","journal-title":"ICANN'99"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1162\/jmlr.2003.4.6.933"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1569904"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"2","first-page":"1","article-title":"Yahoo! learning to rank challenge overview","volume":"14","author":"chapelle","year":"2011","journal-title":"Journal of Machine Learning Research-Proceedings Track"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2012.6256483"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071"},{"key":"30","article-title":"Learning to Rank for Information Retrieval Using Genetic Programming","author":"yeh","year":"2007","journal-title":"SIGIR 2007 Workshop on Learning to Rank for Information Retrieval"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.08.003"},{"journal-title":"Genetic Programming On the Programming of Computers by Means of Natural Selection","year":"1992","author":"koza","key":"6"},{"key":"32","doi-asserted-by":"crossref","first-page":"115","DOI":"10.7551\/mitpress\/1113.003.0010","article-title":"Large margin rank boundaries for ordinal regression","author":"herbrich","year":"2000","journal-title":"Advances in Large Margin Classifiers"},{"journal-title":"Modern Information Retrieval","year":"1999","author":"baeza-yates","key":"5"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2007.01.003"},{"key":"4","article-title":"The pagerank citation ranking: Bringing order to the web","author":"page","year":"1999","journal-title":"Stanford Infolab"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1997.5.2.123"},{"key":"8","article-title":"Grammar transformations in an EDA for genetic programming","author":"bosman","year":"2004","journal-title":"GECCO 2004 Workshop Proceedings"}],"event":{"name":"2013 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2013,6,20]]},"location":"Cancun, Mexico","end":{"date-parts":[[2013,6,23]]}},"container-title":["2013 IEEE Congress on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6552460\/6557545\/06557983.pdf?arnumber=6557983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,15]],"date-time":"2024-05-15T11:02:15Z","timestamp":1715770935000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6557983\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/cec.2013.6557983","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}