Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Idan Hasson

dblp:276/5006 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Recommender systems · 46% Data mining · 36% Information retrieval · 18%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
sequential recommendation
0.612022
Sequential Modeling with Multiple Attributes for Watchlist Recommendation in E-Commerce · WSDM 2022
Recommender systems
session-based recommendation
0.612022
Sequential Modeling with Multiple Attributes for Watchlist Recommendation in E-Commerce · WSDM 2022
Information retrieval
e-commerce search
0.512021
Category Recognition in E-Commerce using Sequence-to-Sequence Hierarchical Classification · WSDM 2021
Data mining › text mining › text classification
hierarchical classification
0.512021
Category Recognition in E-Commerce using Sequence-to-Sequence Hierarchical Classification · WSDM 2021
Data mining › text mining › text classification
product classification
0.512021
Category Recognition in E-Commerce using Sequence-to-Sequence Hierarchical Classification · WSDM 2021

Methods — techniques the papers use, named apart from their topics

transformer · 0.6attention mechanism · 0.6sequence-to-sequence model · 0.5hierarchical classification · 0.5
YearPublicationVenuePosition
2022 Sequential Modeling with Multiple Attributes for Watchlist Recommendation in E-Commerce
abstract
In e-commerce, the watchlist enables users to track items over time and has emerged as a primary feature, playing an important role in users' shopping journey. Watchlist items typically have multiple attributes whose values may change over time (e.g., price, quantity). Since many users accumulate dozens of items on their watchlist, and since shopping intents change over time, recommending the top watchlist items in a given context can be valuable. In this work, we study the watchlist functionality in e-commerce and introduce a novel watchlist recommendation task. Our goal is to prioritize which watchlist items the user should pay attention to next by predicting the next items the user will click. We cast this task as a specialized sequential recommendation task and discuss its characteristics. Our proposed recommendation model, Trans2D, is built on top of the Transformer architecture, where we further suggest a novel extended attention mechanism (Attention2D) that allows to learn complex item-item, attribute-attribute and item-attribute patterns from sequential-data with multiple item attributes. Using a large-scale watchlist dataset from eBay, we evaluate our proposed model, where we demonstrate its superiority compared to multiple state-of-the-art baselines, many of which are adapted for this task.
Uriel Singer, Haggai Roitman, Yotam Eshel, Alexander Nus, Ido Guy, Or Levi, Idan Hasson, Eliyahu Kiperwasser
WSDM7
2021 Category Recognition in E-Commerce using Sequence-to-Sequence Hierarchical Classification
abstract
E-commerce platforms often use a predefined structured hierarchy of product categories. Apart from helping buyers sort between different product types, listing categorization is also critical for multiple downstream tasks, including the platform's main listing search. Traditionally, when creating a new listing, sellers need to assign the product they sell to a single category. However, the high diversity of product types in the platform, along with the hierarchy's low level of granularity result in tens of thousands of different possible categories that sellers need to pick from. This, in turn, creates a unique classification challenge, especially for sellers with a large number of listings. Moreover, the expected cost of making a category classification error is high, as it can impact the likelihood that their listing will get discovered by relevant buyers, and eventually sold.
Idan Hasson, Slava Novgorodov, Gilad Fuchs, Yoni Acriche
WSDM1
2020 Intent-Driven Similarity in E-Commerce Listings
abstract
Discovering similarities between online listings is a common backend task being used across different downstream experiences in eBay. Our baseline unstructured listing similarity method relies on measuring the semantic textual similarity between the embedding vectors of listing titles. However, we discovered that even with the latest contextualized embedding methods, our similarity fails to give the proper weight to the key tokens in the title that matter. This often results in identifying listing similarities that are not sufficient, which later hurts the downstream experiences. In this paper we present a method we call "Listing2Query", or "L2Q", which uses a Sequence Labeling approach to learn token importance from our users? search queries and on-site behaviour. We used pairs of listing titles and their matching search queries, and leveraged a contextualized character language model, to train L2Q as a bidirectional recurrent neural network to produce token importance weights. We demonstrate that plugging these weights into relatively straightforward listing similarity methods is a simple way to significantly improve the similarity results, even to the extent that it consistently outperforms those created by popular representations such as BERT. Notably, this approach is not reserved to only large online marketplaces but can be generalized to other cases that include a search-driven experience and a recall set of short documents.
Gilad Fuchs, Yoni Acriche, Idan Hasson, Pavel Petrov
CIKM3