Mining E-Commerce Query Relations using Customer Interaction Networks

@article{Adhikari2018MiningEQ,
  title={Mining E-Commerce Query Relations using Customer Interaction Networks},
  author={Bijaya Adhikari and Parikshit Sondhi and Wenke Zhang and Mohit Sharma and B. Aditya Prakash},
  journal={Proceedings of the 2018 World Wide Web Conference},
  year={2018}
}
Customer Interaction Networks (CINs) are a natural framework for representing and mining customer interactions with E-Commerce search engines. Customer interactions begin with the submission of a query formulated based on an initial product intent, followed by a sequence of product engagement and query reformulation actions. Engagement with a product (e.g. clicks) indicates its relevance to the customer»s product intent. Reformulation to a new query indicates either dissatisfaction with current… 

Figures and Tables from this paper

RETE: Retrieval-Enhanced Temporal Event Forecasting on Unified Query Product Evolutionary Graph

TLDR
This paper proposes a novel Retrieval-Enhanced Temporal Event (RETE) forecasting framework, which efficiently and dynamically retrieves relevant entities centrally on each user as high-quality subgraphs, preventing the noise propagation from the densely evolutionary graph structures that incorporate abundant search queries.

PSAC: Context-based Purchase Prediction Framework via User's Sequential Actions

TLDR
The Prediction framework that analyzes User’s Sequential Actions via Context (PSAC) to exploit the connection between the user’'s searching keywords and behaviors to investigate their ultimate intention on an e-commerce website and improve the purchase prediction accuracy is proposed.

Challenges and research opportunities in eCommerce search and recommendations

TLDR
Challenges and research opportunities to improve the eCommerce customer experience are identified and highlighted, spanning from classic eCommerce search problems to multi-modal documents and ranking optimization for two-sided marketplaces.

Finding Needles in Heterogeneous Haystacks

TLDR
The method is motivated by abuse detection in e-commerce, the method is applicable to other areas such as computational biology and finance, where large heterogeneous graphs are pervasive, and the amount of labeled data is very limited.

Query-driven graph models in e-commerce

References

SHOWING 1-10 OF 43 REFERENCES

Mining query log graphs towards a query folksonomy

TLDR
This paper presents and discusses results on query contextualization through the association of tags to queries, that is, query folksonomies, and shows that the inferred query folksonomy provide interesting insights both on semantic relations among queries and on web users intent.

Mining search engine query logs for query recommendation

TLDR
This paper presents a simple and intuitive method for mining search engine query logs to get fast query recommendations on a large scale industrial strength search engine, and combines this method with a traditional content based similarity method to compensate for the high sparsity of real query log data, and more specifically, the shortness of most query sessions.

Query suggestion by constructing term-transition graphs

TLDR
A novel query suggestion framework which leverages user re-query feedbacks from search engine logs and is capable of suggesting new queries on a term level which addresses the limitation of previous methods is proposed.

A unified representation of web logs for mining applications

TLDR
This paper proposes to use a richer data structure, which is able to preserve most of the information available in the Web logs, and shows that this more powerful representation can be successfully used in several Web mining tasks like discovering semantically relevant query suggestions and Web page categorization by topic.

Discovering Search Engine Related Queries Using Association Rules

This work presents a method for online generation of query related suggestions for a Web search engine. The method uses association rules to extract related queries from the log of sbumitted queries

Query suggestions using query-flow graphs

TLDR
The proposed methods can match in precision, and often improve, recommendations based on query-click graphs, without using users' clicks, and the experiments show that it is important to consider transition-type labels on edges for having good quality recommendations.

E-commerce product search: personalization, diversification, and beyond

TLDR
Top-$k$ and skylines are discussed as they form a key approach that spans the web, data mining, and database communities that present powerful tools for search across multi-dimensional items with clear preferences within each attribute, like product search as opposed to regular web search.

Clique Analysis of Query Log Graphs

TLDR
A new approach is taken to successfully and efficiently cluster these large graphs by analyzing clique overlap and a priori induced cliques, using query coverage inspection to extract semantic relations between queries and their terms.

Query Recommendation Using Query Logs in Search Engines

TLDR
A method is proposed that, given a query submitted to a search engine, suggests a list of related queries that are based in previously issued queries and can be issued by the user to the search engine to tune or redirect the search process.

Learning Query and Document Relevance from a Web-scale Click Graph

TLDR
A vector propagation algorithm on the click graph to learn vector representations for both queries and documents in the same semantic space is proposed, and NDCG scores are significantly improved against multiple baselines by using the proposed method both as a ranking model and as a feature in a learning-to-rank framework.