The DOI matches its Crossref record; 40 of the 41 references it cites were found in a registry or an index.
Beyond Ranking: Optimizing Whole-Page Presentation
Abstract
Modern search engines aggregate results from different verticals: webpages, news, images, video, shopping, knowledge cards, local maps, etc. Unlike "ten blue links", these search results are heterogeneous in nature and not even arranged in a list on the page. This revolution directly challenges the conventional "ranked list" formulation in ad hoc search. Therefore, finding proper presentation for a gallery of heterogeneous results is critical for modern search engines.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Term-weighting approaches in automatic text retrieval
Salton, G., & Buckley, C. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90021-0 · Cited by 9,740 · cited 1×
“Design and evaluation of document ranking functions are at the central stage of IR research, dating from vector space models [37] and language modeling ranking functions [40] to more recent machine learning ranking [29] and top document reranking [11, 22, 35].”
BackgroundFriedman, J. H. (2002) · Computational Statistics & Data Analysis · doi:10.1016/s0167-9473(01)00065-2 · Cited by 7,067 · cited 1×
“Gradient boosted decision trees (GBDT) is a very effective method for learning nonlinear functions [18].”
MethodAdvances in Neural Information Processing Systems 20
Bonilla, E. V., Chai, K. M. A., & Williams, C. K. I. (2008) · neural information processing systems · Cited by 2,846
A contextual-bandit approach to personalized news article recommendation
Li, L., Chu, W., Langford, J., & Schapire, R. E. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772758 · Cited by 2,562 · cited 1×
“[28] for evaluating online recommendation systems.”
The use of MMR, diversity-based reranking for reordering documents and producing summaries
Carbonell, J., & Goldstein, J. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.291025 · Cited by 2,329
The Use of MMR, Diversity-Based Reranking for Reordering Documents and Producing Summaries
Carbonell, J., & Goldstein, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130369 · Cited by 2,156
Learning to rank for information retrieval
Liu, T.-Y. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835676 · Cited by 1,856
Learning to Rank for Information Retrieval
Liu, T.-Y. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000016 · Cited by 1,568
A Study of Smoothing Methods for Language Models Applied to Ad Hoc Information Retrieval
Zhai, C., & Lafferty, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130377 · Cited by 1,537
Research works printed but not linked: 3
- 10.5555/1996889.1996909 · doi:10.5555/1996889.1996909
- 10.5555/1296180 · doi:10.5555/1296180
- 10.5555/2600139 · doi:10.5555/2600139
Cited by
Unbiased Learning-to-Rank with Biased Feedback
Joachims, T., Swaminathan, A., & Schnabel, T. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018699 · Cited by 531
“Our approach uses inverse propensity scoring (IPS), originally employed in survey sampling [7] and causal inference from observational studies [19], but more recently also in whole page optimization [29], IR evaluation with manual judgments [20], and recommender evaluation [13, 21].”
MethodFinding Faster Configurations Using FLASH
Nair, V., Yu, Z., Menzies, T., Siegmund, N., & Apel, S. (2020) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2018.2870895 · Cited by 166
“Among numerous other problems which are similar to performance configuration optimization, the problem of how to maximize conversions on landing pages or click-through rates on search-engine result pages [4], [36], [37] has gathered interest.”
BackgroundZhao, X., Xia, L., Tang, J., & Yin, D. (2019) · ACM SIGWEB Newsletter · doi:10.1145/3320496.3320500 · Cited by 165
“In [Wang et al. 2016; Wang et al. 2018], a framework is proposed to learn the optimal page presentation to render heterogeneous results onto SERP.”
BackgroundSelf-citationA General Framework for Counterfactual Learning-to-Rank
Agarwal, A., Takatsu, K., Zaitsev, I., & Joachims, T. (2019) · Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3331184.3331202 · Cited by 115
“tual approach uses inverse propensity scoring (IPS), originally employed in survey sampling [8] and causal inference from observational studies [17], but more recently also in whole page optimization [27], IR evaluation with manual judgments [18], and recommender evaluation [12, 19]. This approach is similar in spirit…”
MethodAn Efficient Bandit Algorithm for Realtime Multivariate Optimization
Hill, D. N., Nassif, H., Liu, Y., Iyer, A., & Vishwanathan, S. V. N. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098184 · Cited by 113
“Our approach is most similar to [21] where the authors used a model of pairwise interactions to optimize whole-page presentation.”
Method
Metadata
- Authors
- Wang, Y., Yin, D., Jie, L., Wang, P., Yamada, M., Chang, Y., & Mei, Q.
- Affiliations
- University of Michigan (US)
- Yahoo (United States) (US)
- Snap (United States) (US)
- Kyoto University (JP)
- Venue
- Proceedings of the Ninth ACM International Conference on Web Search and Data Mining
- Publisher
- ACM
- Published
- 2016-02-08
- Pages
- 103-112
- OpenAlex
- W2271350114
- Cited by
- 66
- References
- 41
- Citations by year
- 2026: 2 · 2025: 3 · 2024: 4 · 2023: 4 · 2022: 1 · 2021: 8 · 2020: 4 · 2019: 12 · 2018: 16 · 2017: 9 · 2016: 3
- FWCI
- 11.32
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM International Conference on Web Search and Data Mining (WSDM) (publishedVersion)
- Funders
- National Science Foundation (IIS-1054199)
- Topics
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Data Visualization and Analytics
- Keywords
- search result presentation, ad-hoc search, search result ranking
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Beyond Ranking: Optimizing Whole-Page Presentation. https://app.cochat.ai/papers/10.1145/2835776.2835824
- The paper
- Wang, Y., Yin, D., Jie, L., Wang, P., Yamada, M., Chang, Y., & Mei, Q. (2016). Beyond Ranking: Optimizing Whole-Page Presentation. Proceedings of the Ninth ACM International Conference on Web Search and Data Mining. https://doi.org/10.1145/2835776.2835824
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.