{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T19:40:01Z","timestamp":1751226001563,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":32,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF","award":["CNS-1513939","CNS-1408944"],"award-info":[{"award-number":["CNS-1513939","CNS-1408944"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1145\/3041021.3054195","type":"proceedings-article","created":{"date-parts":[[2018,1,11]],"date-time":"2018-01-11T18:39:25Z","timestamp":1515695965000},"page":"662-671","source":"Crossref","is-referenced-by-count":2,"title":["Numerical Facet Range Partition"],"prefix":"10.1145","author":[{"given":"Xueqing","family":"Liu","sequence":"first","affiliation":[{"name":"UIUC, Urbana, IL, USA"}]},{"given":"Chengxiang","family":"Zhai","sequence":"additional","affiliation":[{"name":"UIUC, Urbana, IL, USA"}]},{"given":"Wei","family":"Han","sequence":"additional","affiliation":[{"name":"WalmartLabs, Sunnyvale, CA, USA"}]},{"given":"Onur","family":"Gungor","sequence":"additional","affiliation":[{"name":"WalmartLabs, Sunnyvale, CA, USA"}]}],"member":"320","reference":[{"key":"key-10.1145\/3041021.3054195-1","doi-asserted-by":"crossref","unstructured":"J. Acharya, I. Diakonikolas, C. Hegde, J. Z. Li, and L. Schmidt. Fast and near-optimal algorithms for approximating distributions by histograms. In T. Milo and D. Calvanese, editors, PODS, pages 249--263. ACM, 2015.","DOI":"10.1145\/2745754.2745772"},{"key":"key-10.1145\/3041021.3054195-2","unstructured":"M. B. Arouxet, N. Echebest, and E. A. Pilotta. Active-set strategy in Powell's method for optimization without derivatives. Computational & Applied Mathematics, 30:171--196, 00 2011."},{"key":"key-10.1145\/3041021.3054195-3","doi-asserted-by":"crossref","unstructured":"L. Azzopardi. Modelling interaction with economic models of search. In S. Geva, A. Trotman, P. Bruza, C. L. A. Clarke, and K. Järvelin, editors, SIGIR, pages 3--12. ACM, 2014.","DOI":"10.1145\/2600428.2609574"},{"key":"key-10.1145\/3041021.3054195-4","doi-asserted-by":"crossref","unstructured":"S. Basu Roy, H. Wang, G. Das, U. Nambiar, and M. Mohania. Minimum-effort driven dynamic faceted search in structured databases. In Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM '08, pages 13--22, New York, NY, USA, 2008. ACM.","DOI":"10.1145\/1458082.1458088"},{"key":"key-10.1145\/3041021.3054195-5","unstructured":"L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and Regression Trees. Pacific Grove, 1984."},{"key":"key-10.1145\/3041021.3054195-6","unstructured":"R. Brent. Algorithms for minimization without derivatives. Prentice-Hall, 1973."},{"key":"key-10.1145\/3041021.3054195-7","doi-asserted-by":"crossref","unstructured":"N. Craswell, O. Zoeter, M. Taylor, and B. Ramsey. An experimental comparison of click position-bias models. In Proceedings of the 2008 International Conference on Web Search and Data Mining, WSDM '08, pages 87--94, New York, NY, USA, 2008. ACM.","DOI":"10.1145\/1341531.1341545"},{"key":"key-10.1145\/3041021.3054195-8","doi-asserted-by":"crossref","unstructured":"A. Dvoretzky, J. Kiefer, and J. Wolfowitz. Asymptotic minimax character of the sample distribution function and of the classical multinomial estimator. The Annals of Mathematical Statistics, pages 1397--1400. ACM, 1956.","DOI":"10.1214\/aoms\/1177728174"},{"key":"key-10.1145\/3041021.3054195-9","doi-asserted-by":"crossref","unstructured":"F. Gao and L. Han. Implementing the nelder-mead simplex algorithm with adaptive parameters. Comp. Opt. and Appl., 51(1):259--277, 2012.","DOI":"10.1007\/s10589-010-9329-3"},{"key":"key-10.1145\/3041021.3054195-10","unstructured":"M. A. Hearst. Uis for faceted navigation: Recent advances and remaining open problems. 2008."},{"key":"key-10.1145\/3041021.3054195-11","doi-asserted-by":"crossref","unstructured":"M. A. Hearst. Search User Interfaces. Cambridge University Press, 1 edition, 2009.","DOI":"10.1017\/CBO9781139644082"},{"key":"key-10.1145\/3041021.3054195-12","unstructured":"H. V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. C. Sevcik, and T. Suel. Optimal histograms with quality guarantees. In A. Gupta, O. Shmueli, and J. Widom, editors, VLDB, pages 275--286. Morgan Kaufmann, 1998."},{"key":"key-10.1145\/3041021.3054195-13","doi-asserted-by":"crossref","unstructured":"K. Järvelin. Cumulated gain-based evaluation of ir techniques. volume 20, page 2002, 2002.","DOI":"10.1145\/582415.582418"},{"key":"key-10.1145\/3041021.3054195-14","doi-asserted-by":"crossref","unstructured":"C. Kang, D. Yin, R. Zhang, N. Torzec, J. He, and Y. Chang. Learning to rank related entities in web search. Neurocomputing, 166:309--318, 2015.","DOI":"10.1016\/j.neucom.2015.04.004"},{"key":"key-10.1145\/3041021.3054195-15","doi-asserted-by":"crossref","unstructured":"A. Kashyap, V. Hristidis, and M. Petropoulos. Facetor: cost-driven exploration of faceted query results. In J. Huang, N. Koudas, G. J. F. Jones, X. Wu, K. Collins-Thompson, and A. An, editors, CIKM, pages 719--728. ACM, 2010.","DOI":"10.1145\/1871437.1871530"},{"key":"key-10.1145\/3041021.3054195-16","doi-asserted-by":"crossref","unstructured":"J. Koren, Y. Zhang, and X. Liu. Personalized interactive faceted search. In Proceedings of the 17th International Conference on World Wide Web, WWW '08, pages 477--486, New York, NY, USA, 2008. ACM.","DOI":"10.1145\/1367497.1367562"},{"key":"key-10.1145\/3041021.3054195-17","doi-asserted-by":"crossref","unstructured":"B. Kules, R. Capra, M. Banta, and T. Sierra. What do exploratory searchers look at in a faceted search interface? In JCDL '09: Proceedings of the 9th ACM\/IEEE-CS joint conference on Digital libraries, pages 313--322, New York, NY, USA, 2009. ACM.","DOI":"10.1145\/1555400.1555452"},{"key":"key-10.1145\/3041021.3054195-18","doi-asserted-by":"crossref","unstructured":"S. Liberman and R. Lempel. Approximately optimal facet selection. In Proceedings of the 27th Annual ACM Symposium on Applied Computing, SAC '12, pages 702--708, New York, NY, USA, 2012. ACM.","DOI":"10.1145\/2245276.2245409"},{"key":"key-10.1145\/3041021.3054195-19","doi-asserted-by":"crossref","unstructured":"A. Moffat and J. Zobel. Rank-biased precision for measurement of retrieval effectiveness. ACM Trans. Inf. Syst., 27(1), 2008.","DOI":"10.1145\/1416950.1416952"},{"key":"key-10.1145\/3041021.3054195-20","doi-asserted-by":"crossref","unstructured":"M. Muralikrishna and D. J. DeWitt. Equi-depth histograms for estimating selectivity factors for multi-dimensional queries. In H. Boral and P.-Ã. Larson, editors, SIGMOD Conference, pages 28--36. ACM Press, 1988.","DOI":"10.1145\/971701.50205"},{"key":"key-10.1145\/3041021.3054195-21","doi-asserted-by":"crossref","unstructured":"J. A. Nelder and R. Mead. A simplex method for function minimization. Computer Journal, 7:308--313, 1965.","DOI":"10.1093\/comjnl\/7.4.308"},{"key":"key-10.1145\/3041021.3054195-22","doi-asserted-by":"crossref","unstructured":"P. Pirolli and S. Card. Information foraging. Psychological Review, 106. 4:634--675, 1999.","DOI":"10.1037\/0033-295X.106.4.643"},{"key":"key-10.1145\/3041021.3054195-23","doi-asserted-by":"crossref","unstructured":"S. E. Robertson. The probability ranking principle in ir. Journal of Documentation 33, pages 294--304, 1997.","DOI":"10.1108\/eb026647"},{"key":"key-10.1145\/3041021.3054195-24","doi-asserted-by":"crossref","unstructured":"S. B. Roy, H. Wang, G. Das, U. Nambiar, and M. K. Mohania. Minimum-effort driven dynamic faceted search in structured databases. In CIKM, pages 13--22. ACM, 2008.","DOI":"10.1145\/1458082.1458088"},{"key":"key-10.1145\/3041021.3054195-25","unstructured":"K. Sparck Jones and P. Willett, editors. Readings in Information Retrieval. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1997."},{"key":"key-10.1145\/3041021.3054195-26","doi-asserted-by":"crossref","unstructured":"R. Tibshirani. Regression shrinkage and selection via the Lasso. Journal of the Royal Statistical Society. Series B (Methodological), pages 267--288, 1996.","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"key-10.1145\/3041021.3054195-27","unstructured":"H. Valizadegan, R. Jin, R. Zhang, and J. Mao. Learning to rank by optimizing ndcg measure. In NIPS, pages 1883--1891, 2009."},{"key":"key-10.1145\/3041021.3054195-28","doi-asserted-by":"crossref","unstructured":"R. van Zwol, B. SigurbjÃrnsson, R. Adapala, L. G. Pueyo, A. Katiyar, K. Kurapati, M. Muralidharan, S. Muthu, V. Murdock, P. Ng, A. Ramani, A. Sahai, S. T. Sathish, H. Vasudev, and U. Vuyyuru. Faceted exploration of image search results. In WWW, pages 961--970. ACM, 2010.","DOI":"10.1145\/1772690.1772788"},{"key":"key-10.1145\/3041021.3054195-29","doi-asserted-by":"crossref","unstructured":"D. Vandic, F. Frasincar, and U. Kaymak. Facet selection algorithms for web product search. In Proceedings of the 22Nd ACM International Conference on Conference on Information & Knowledge Management, CIKM '13, pages 2327--2332, New York, NY, USA, 2013. ACM.","DOI":"10.1145\/2505515.2505664"},{"key":"key-10.1145\/3041021.3054195-30","doi-asserted-by":"crossref","unstructured":"E. Yilmaz, M. Verma, N. Craswell, F. Radlinski, and P. Bailey. Relevance and effort: An analysis of document utility. In CIKM, pages 91--100. ACM, 2014.","DOI":"10.1145\/2661829.2661953"},{"key":"key-10.1145\/3041021.3054195-31","doi-asserted-by":"crossref","unstructured":"Y. Yue, T. Finley, F. Radlinski, and T. Joachims. A support vector method for optimizing average precision. In SIGIR, pages 271--278. ACM, 2007.","DOI":"10.1145\/1277741.1277790"},{"key":"key-10.1145\/3041021.3054195-32","doi-asserted-by":"crossref","unstructured":"Y. Zhang and C. Zhai. Information retrieval as card playing: A formal model for optimizing interactive retrieval interface. In SIGIR, pages 685--694. ACM, 2015.","DOI":"10.1145\/2766462.2767761"}],"event":{"number":"26","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"acronym":"WWW '17 Companion","name":"the 26th International Conference","start":{"date-parts":[[2017,4,3]]},"location":"Perth, Australia","end":{"date-parts":[[2017,4,7]]}},"container-title":["Proceedings of the 26th International Conference on World Wide Web Companion - WWW '17 Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3041021.3054195","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3054195&ftid=1865246&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T19:20:56Z","timestamp":1751224856000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3041021.3054195"}},"subtitle":["Evaluation Metric and Methods"],"proceedings-subject":"World Wide Web Companion","short-title":[],"issued":{"date-parts":[[2017]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1145\/3041021.3054195","relation":{},"subject":[],"published":{"date-parts":[[2017]]}}}