Loading…
Accelerating Ranking in E-Commerce Search Engines through Contextual Factor Selection
In large-scale search systems, the quality of the ranking results is continually improved with the introduction of more factors from complex procedures. Meanwhile, the increase in factors demands more computation resources and increases system response latency. It has been observed that, under some...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Citations: | Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c173t-d6bb203d41092a656466535d271b4741c5f4c209619416d1b5e5ab9f3e6d55ab3 |
---|---|
cites | |
container_end_page | 13219 |
container_issue | 8 |
container_start_page | 13212 |
container_title | |
container_volume | 34 |
creator | Zeng, Anxiang Yu, Han Da, Qing Zhan, Yusen Miao, Chunyan |
description | In large-scale search systems, the quality of the ranking results is continually improved with the introduction of more factors from complex procedures. Meanwhile, the increase in factors demands more computation resources and increases system response latency. It has been observed that, under some certain context a search instance may require only a small set of useful factors instead of all factors in order to return high quality results. Therefore, removing ineffective factors accordingly can significantly improve system efficiency. In this paper, we report our experience incorporating our Contextual Factor Selection (CFS) approach into the Taobao e-commerce platform to optimize the selection of factors based on the context of each search query in order to simultaneously achieve high quality search results while significantly reducing latency time. This problem is treated as a combinatorial optimization problem which can be tackled through a sequential decision-making procedure. The problem can be efficiently solved by CFS through a deep reinforcement learning method with reward shaping to address the problems of reward signal scarcity and wide reward signal distribution in real-world search engines. Through extensive off-line experiments based on data from the Taobao.com platform, CFS is shown to significantly outperform state-of-the-art approaches. Online deployment on Taobao.com demonstrated that CFS is able to reduce average search latency time by more than 40% compared to the previous approach with negligible reduction in search result quality. Under peak usage during the Single's Day Shopping Festival (November 11th) in 2017, CFS reduced peak load search latency time by 33% compared to the previous approach, helping Taobao.com achieve 40% higher revenue than the same period during 2016.
Corrigendum
The spelling of coauthor Yusen Zan in the paper "Accelerating Ranking in E-Commerce Search Engines through Contextual Factor Selection" has been changed from Zan to Zhan. The original spelling was a typographical error. |
doi_str_mv | 10.1609/aaai.v34i08.7026 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1609_aaai_v34i08_7026</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1609_aaai_v34i08_7026</sourcerecordid><originalsourceid>FETCH-LOGICAL-c173t-d6bb203d41092a656466535d271b4741c5f4c209619416d1b5e5ab9f3e6d55ab3</originalsourceid><addsrcrecordid>eNotkE9LwzAchoMoOObuHvMFOvNr_nQ5jtKpMBDUnUOapm20TSXJRL-9LfO9PO_h5T08CN0D2YIg8kFr7bbflDmy2xYkF1doldOCZZSJ3fXcgcuMUylv0SbGDzKHSQAoVui0N8YONujkfIdftf9c6DyusnIaRxuMxW9WB9PjynfO24hTH6Zz1-Ny8sn-pLMe8EGbNIV5OFiT3OTv0E2rh2g3_1yj06F6L5-y48vjc7k_ZgYKmrJG1HVOaMOAyFwLLpgQnPImL6BmBQPDW2ZyIgVIBqKBmluua9lSKxo-N7pG5PJrwhRjsK36Cm7U4VcBUYsZtZhRFzNqMUP_ADl6V7o</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Accelerating Ranking in E-Commerce Search Engines through Contextual Factor Selection</title><source>Freely Accessible Science Journals</source><creator>Zeng, Anxiang ; Yu, Han ; Da, Qing ; Zhan, Yusen ; Miao, Chunyan</creator><creatorcontrib>Zeng, Anxiang ; Yu, Han ; Da, Qing ; Zhan, Yusen ; Miao, Chunyan</creatorcontrib><description>In large-scale search systems, the quality of the ranking results is continually improved with the introduction of more factors from complex procedures. Meanwhile, the increase in factors demands more computation resources and increases system response latency. It has been observed that, under some certain context a search instance may require only a small set of useful factors instead of all factors in order to return high quality results. Therefore, removing ineffective factors accordingly can significantly improve system efficiency. In this paper, we report our experience incorporating our Contextual Factor Selection (CFS) approach into the Taobao e-commerce platform to optimize the selection of factors based on the context of each search query in order to simultaneously achieve high quality search results while significantly reducing latency time. This problem is treated as a combinatorial optimization problem which can be tackled through a sequential decision-making procedure. The problem can be efficiently solved by CFS through a deep reinforcement learning method with reward shaping to address the problems of reward signal scarcity and wide reward signal distribution in real-world search engines. Through extensive off-line experiments based on data from the Taobao.com platform, CFS is shown to significantly outperform state-of-the-art approaches. Online deployment on Taobao.com demonstrated that CFS is able to reduce average search latency time by more than 40% compared to the previous approach with negligible reduction in search result quality. Under peak usage during the Single's Day Shopping Festival (November 11th) in 2017, CFS reduced peak load search latency time by 33% compared to the previous approach, helping Taobao.com achieve 40% higher revenue than the same period during 2016.
Corrigendum
The spelling of coauthor Yusen Zan in the paper "Accelerating Ranking in E-Commerce Search Engines through Contextual Factor Selection" has been changed from Zan to Zhan. The original spelling was a typographical error. </description><identifier>ISSN: 2159-5399</identifier><identifier>EISSN: 2374-3468</identifier><identifier>DOI: 10.1609/aaai.v34i08.7026</identifier><language>eng</language><ispartof>Proceedings of the ... AAAI Conference on Artificial Intelligence, 2020, Vol.34 (8), p.13212-13219</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c173t-d6bb203d41092a656466535d271b4741c5f4c209619416d1b5e5ab9f3e6d55ab3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Zeng, Anxiang</creatorcontrib><creatorcontrib>Yu, Han</creatorcontrib><creatorcontrib>Da, Qing</creatorcontrib><creatorcontrib>Zhan, Yusen</creatorcontrib><creatorcontrib>Miao, Chunyan</creatorcontrib><title>Accelerating Ranking in E-Commerce Search Engines through Contextual Factor Selection</title><title>Proceedings of the ... AAAI Conference on Artificial Intelligence</title><description>In large-scale search systems, the quality of the ranking results is continually improved with the introduction of more factors from complex procedures. Meanwhile, the increase in factors demands more computation resources and increases system response latency. It has been observed that, under some certain context a search instance may require only a small set of useful factors instead of all factors in order to return high quality results. Therefore, removing ineffective factors accordingly can significantly improve system efficiency. In this paper, we report our experience incorporating our Contextual Factor Selection (CFS) approach into the Taobao e-commerce platform to optimize the selection of factors based on the context of each search query in order to simultaneously achieve high quality search results while significantly reducing latency time. This problem is treated as a combinatorial optimization problem which can be tackled through a sequential decision-making procedure. The problem can be efficiently solved by CFS through a deep reinforcement learning method with reward shaping to address the problems of reward signal scarcity and wide reward signal distribution in real-world search engines. Through extensive off-line experiments based on data from the Taobao.com platform, CFS is shown to significantly outperform state-of-the-art approaches. Online deployment on Taobao.com demonstrated that CFS is able to reduce average search latency time by more than 40% compared to the previous approach with negligible reduction in search result quality. Under peak usage during the Single's Day Shopping Festival (November 11th) in 2017, CFS reduced peak load search latency time by 33% compared to the previous approach, helping Taobao.com achieve 40% higher revenue than the same period during 2016.
Corrigendum
The spelling of coauthor Yusen Zan in the paper "Accelerating Ranking in E-Commerce Search Engines through Contextual Factor Selection" has been changed from Zan to Zhan. The original spelling was a typographical error. </description><issn>2159-5399</issn><issn>2374-3468</issn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2020</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotkE9LwzAchoMoOObuHvMFOvNr_nQ5jtKpMBDUnUOapm20TSXJRL-9LfO9PO_h5T08CN0D2YIg8kFr7bbflDmy2xYkF1doldOCZZSJ3fXcgcuMUylv0SbGDzKHSQAoVui0N8YONujkfIdftf9c6DyusnIaRxuMxW9WB9PjynfO24hTH6Zz1-Ny8sn-pLMe8EGbNIV5OFiT3OTv0E2rh2g3_1yj06F6L5-y48vjc7k_ZgYKmrJG1HVOaMOAyFwLLpgQnPImL6BmBQPDW2ZyIgVIBqKBmluua9lSKxo-N7pG5PJrwhRjsK36Cm7U4VcBUYsZtZhRFzNqMUP_ADl6V7o</recordid><startdate>20200403</startdate><enddate>20200403</enddate><creator>Zeng, Anxiang</creator><creator>Yu, Han</creator><creator>Da, Qing</creator><creator>Zhan, Yusen</creator><creator>Miao, Chunyan</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20200403</creationdate><title>Accelerating Ranking in E-Commerce Search Engines through Contextual Factor Selection</title><author>Zeng, Anxiang ; Yu, Han ; Da, Qing ; Zhan, Yusen ; Miao, Chunyan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c173t-d6bb203d41092a656466535d271b4741c5f4c209619416d1b5e5ab9f3e6d55ab3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2020</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Zeng, Anxiang</creatorcontrib><creatorcontrib>Yu, Han</creatorcontrib><creatorcontrib>Da, Qing</creatorcontrib><creatorcontrib>Zhan, Yusen</creatorcontrib><creatorcontrib>Miao, Chunyan</creatorcontrib><collection>CrossRef</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zeng, Anxiang</au><au>Yu, Han</au><au>Da, Qing</au><au>Zhan, Yusen</au><au>Miao, Chunyan</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Accelerating Ranking in E-Commerce Search Engines through Contextual Factor Selection</atitle><btitle>Proceedings of the ... AAAI Conference on Artificial Intelligence</btitle><date>2020-04-03</date><risdate>2020</risdate><volume>34</volume><issue>8</issue><spage>13212</spage><epage>13219</epage><pages>13212-13219</pages><issn>2159-5399</issn><eissn>2374-3468</eissn><abstract>In large-scale search systems, the quality of the ranking results is continually improved with the introduction of more factors from complex procedures. Meanwhile, the increase in factors demands more computation resources and increases system response latency. It has been observed that, under some certain context a search instance may require only a small set of useful factors instead of all factors in order to return high quality results. Therefore, removing ineffective factors accordingly can significantly improve system efficiency. In this paper, we report our experience incorporating our Contextual Factor Selection (CFS) approach into the Taobao e-commerce platform to optimize the selection of factors based on the context of each search query in order to simultaneously achieve high quality search results while significantly reducing latency time. This problem is treated as a combinatorial optimization problem which can be tackled through a sequential decision-making procedure. The problem can be efficiently solved by CFS through a deep reinforcement learning method with reward shaping to address the problems of reward signal scarcity and wide reward signal distribution in real-world search engines. Through extensive off-line experiments based on data from the Taobao.com platform, CFS is shown to significantly outperform state-of-the-art approaches. Online deployment on Taobao.com demonstrated that CFS is able to reduce average search latency time by more than 40% compared to the previous approach with negligible reduction in search result quality. Under peak usage during the Single's Day Shopping Festival (November 11th) in 2017, CFS reduced peak load search latency time by 33% compared to the previous approach, helping Taobao.com achieve 40% higher revenue than the same period during 2016.
Corrigendum
The spelling of coauthor Yusen Zan in the paper "Accelerating Ranking in E-Commerce Search Engines through Contextual Factor Selection" has been changed from Zan to Zhan. The original spelling was a typographical error. </abstract><doi>10.1609/aaai.v34i08.7026</doi><tpages>8</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 2159-5399 |
ispartof | Proceedings of the ... AAAI Conference on Artificial Intelligence, 2020, Vol.34 (8), p.13212-13219 |
issn | 2159-5399 2374-3468 |
language | eng |
recordid | cdi_crossref_primary_10_1609_aaai_v34i08_7026 |
source | Freely Accessible Science Journals |
title | Accelerating Ranking in E-Commerce Search Engines through Contextual Factor Selection |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T19%3A59%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Accelerating%20Ranking%20in%20E-Commerce%20Search%20Engines%20through%20Contextual%20Factor%20Selection&rft.btitle=Proceedings%20of%20the%20...%20AAAI%20Conference%20on%20Artificial%20Intelligence&rft.au=Zeng,%20Anxiang&rft.date=2020-04-03&rft.volume=34&rft.issue=8&rft.spage=13212&rft.epage=13219&rft.pages=13212-13219&rft.issn=2159-5399&rft.eissn=2374-3468&rft_id=info:doi/10.1609/aaai.v34i08.7026&rft_dat=%3Ccrossref%3E10_1609_aaai_v34i08_7026%3C/crossref%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c173t-d6bb203d41092a656466535d271b4741c5f4c209619416d1b5e5ab9f3e6d55ab3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |