Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Choon-Hui Teo"'
Autor:
Hamed Bonab, Ashutosh Joshi, Ravi Bhatia, Ankit Gandhi, Vijay Huddar, Juhi Naik, Mutasem Al-Darabsah, Choon Hui Teo, Jonathan May, Tarun Agarwal, Vaclav Petricek
Publikováno v:
Companion Proceedings of the ACM Web Conference 2023.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41b4c0c766ff6e2f4650bedd2cfed7b1
https://doi.org/10.1145/3543873.3587629
https://doi.org/10.1145/3543873.3587629
Autor:
Aashiq Muhamed, Sriram Srinivasan, Choon-Hui Teo, Qingjun Cui, Belinda Zeng, Trishul Chilimbi, S. V. N. Vishwanathan
Publikováno v:
Advances in Knowledge Discovery and Data Mining ISBN: 9783031333798
Dense embedding-based semantic matching is widely used in e-commerce product search to address the shortcomings of lexical matching such as sensitivity to spelling variants. The recent advances in BERT-like language model encoders, have however, not
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afd962ffa8f1136c491435476aa252d6
https://doi.org/10.1007/978-3-031-33380-4_6
https://doi.org/10.1007/978-3-031-33380-4_6
Autor:
Qie Hu, Wei-Cheng Chang, Daniel Jiang, Japinder Singh, Vyacheslav Ievgrafov, Kedarnath Kolluri, Choon Hui Teo, Jiong Zhang, Hsiang-Fu Yu, Nikhil Shandilya, Kai Zhong, Inderjit S. Dhillon
Publikováno v:
KDD
We consider the problem of semantic matching in product search: given a customer query, retrieve all semantically related products from a huge catalog of size 100 million, or more. Because of large catalog spaces and real-time latency constraints, se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1ae55db7a06ff16e0413ecc83048f81
http://arxiv.org/abs/2106.12657
http://arxiv.org/abs/2106.12657
Publikováno v:
CIKM
In product search, users tend to browse results on multiple search result pages (SERPs) (e.g., for queries on clothing and shoes) before deciding which item to purchase. Users' clicks can be considered as implicit feedback which indicates their prefe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fbc5ce9711ff489a90b353d838ac3b92
https://doi.org/10.1145/3357384.3358095
https://doi.org/10.1145/3357384.3358095
Autor:
Weitian (Allen) Ding, Vijai Mohan, Vihan Lakshman, Choon Hui Teo, Ankit Shingavi, Priyanka Nigam, Yiwei Song, Bing Yin, Hao Gu
Publikováno v:
KDD
We study the problem of semantic matching in product search, that is, given a customer query, retrieve all semantically related products from the catalog. Pure lexical matching via an inverted index falls short in this respect due to several factors:
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6a8b83f69e2ed790593a2da898c0da7
https://doi.org/10.1145/3292500.3330759
https://doi.org/10.1145/3292500.3330759
Autor:
Houssam Nassif, Choon Hui Teo, Vijai Mohan, Mitchell Goodman, S. V. N. Vishwanathan, Sriram Srinavasan, Daniel Hill
Search queries are appropriate when users have explicit intent, but they perform poorly when the intent is difficult to express or if the user is simply looking to be inspired. Visual browsing systems allow e-commerce platforms to address these scena
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d48804a94b74f5f0a9ff807c60e24bac
Publikováno v:
WSDM
Relevance, diversity and personalization are key issues when presenting content which is apt to pique a user's interest. This is particularly true when presenting an engaging set of news stories. In this paper we propose an efficient algorithm for se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0641e848fae45f38054809abcad19806
https://doi.org/10.1145/2124295.2124337
https://doi.org/10.1145/2124295.2124337
Publikováno v:
WWW
News clustering, categorization and analysis are key components of any news portal. They require algorithms capable of dealing with dynamic data to cluster, interpret and to temporally aggregate news articles. These three tasks are often solved separ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb29da02499bedb2faff8dd59c6ed386
https://doi.org/10.1145/1963405.1963445
https://doi.org/10.1145/1963405.1963445
Autor:
Choon Hui Teo, Alexander J. Smola, Yi Chang, Suju Rajan, Zhaohui Zheng, Srinivas Vadrevu, Byron Dom, Kunal Punera
Publikováno v:
WSDM
In this paper, we present a system for clustering the search results of a news search engine. The news search interface includes the relevant news articles to a given query organized in terms of related news stories. Here each cluster corresponds to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e53ee63cadaad1e81eaa2488d744d4cd
https://doi.org/10.1145/1935826.1935918
https://doi.org/10.1145/1935826.1935918
Publikováno v:
KDD '07: 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
KDD
KDD
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different regularizers. Examples include linear Support Vector Machines (SVMs), Lo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fe2f285bd08b762d347c15f356cf6e4a
https://hdl.handle.net/21.11116/0000-0003-D805-4
https://hdl.handle.net/21.11116/0000-0003-D805-4