Abstract

With the rapid growth of e-tail, the cost to handle returned online orders also increases significantly and has become a major challenge in the ecommerce industry. Accurate prediction of product returns allows e-tailers to prevent problematic transactions in advance. However, the limited existing work for modeling customer online shopping behaviors and predicting their return actions fail to integrate the rich information in the product purchase and return history (e.g., return history, purchase-no-return behavior, and customer/product similarity). Furthermore, the large-scale data sets involved in this problem, typically consisting of millions of customers and tens of thousands of products, also render existing methods inefficient and ineffective at predicting the product returns. To address these problems, in this paper, we propose to use a weighted hybrid graph to represent the rich information in the product purchase and return history, in order to predict product returns. The proposed graph consists of both customer nodes and product nodes, undirected edges reflecting customer return history and customer/product similarity based on their attributes, as well as directed edges discriminating purchase-no-return and nopurchase actions. Based on this representation, we study a random-walk-based local algorithm for predicting product return propensity for each customer, whose computational complexity depends only on the size of the output cluster rather than the entire graph. Such a property makes the proposed local algorithm particularly suitable for processing the large-scale data sets to predict product returns. To test the performance of the proposed techniques, we evaluate the graph model and algorithm on multiple e-commerce data sets, showing improved performance over state-of-the-art methods.

Original languageEnglish (US)
Title of host publicationProceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018
EditorsJerome Lang
PublisherInternational Joint Conferences on Artificial Intelligence
Pages3718-3724
Number of pages7
Volume2018-July
ISBN (Electronic)9780999241127
StatePublished - Jan 1 2018
Event27th International Joint Conference on Artificial Intelligence, IJCAI 2018 - Stockholm, Sweden
Duration: Jul 13 2018Jul 19 2018

Other

Other27th International Joint Conference on Artificial Intelligence, IJCAI 2018
CountrySweden
CityStockholm
Period7/13/187/19/18

Fingerprint

Electronic commerce
History
Computational complexity
Processing
Costs
Industry

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Zhu, Y., Li, J., He, J., Quanz, B. L., & Deshpande, A. A. (2018). A local algorithm for product return prediction in E-commerce. In J. Lang (Ed.), Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018 (Vol. 2018-July, pp. 3718-3724). International Joint Conferences on Artificial Intelligence.

A local algorithm for product return prediction in E-commerce. / Zhu, Yada; Li, Jianbo; He, Jingrui; Quanz, Brian L.; Deshpande, Ajay A.

Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. ed. / Jerome Lang. Vol. 2018-July International Joint Conferences on Artificial Intelligence, 2018. p. 3718-3724.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhu, Y, Li, J, He, J, Quanz, BL & Deshpande, AA 2018, A local algorithm for product return prediction in E-commerce. in J Lang (ed.), Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. vol. 2018-July, International Joint Conferences on Artificial Intelligence, pp. 3718-3724, 27th International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden, 7/13/18.
Zhu Y, Li J, He J, Quanz BL, Deshpande AA. A local algorithm for product return prediction in E-commerce. In Lang J, editor, Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. Vol. 2018-July. International Joint Conferences on Artificial Intelligence. 2018. p. 3718-3724
Zhu, Yada ; Li, Jianbo ; He, Jingrui ; Quanz, Brian L. ; Deshpande, Ajay A. / A local algorithm for product return prediction in E-commerce. Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. editor / Jerome Lang. Vol. 2018-July International Joint Conferences on Artificial Intelligence, 2018. pp. 3718-3724
@inproceedings{26238db6657e418ebd125e12cc511ee2,
title = "A local algorithm for product return prediction in E-commerce",
abstract = "With the rapid growth of e-tail, the cost to handle returned online orders also increases significantly and has become a major challenge in the ecommerce industry. Accurate prediction of product returns allows e-tailers to prevent problematic transactions in advance. However, the limited existing work for modeling customer online shopping behaviors and predicting their return actions fail to integrate the rich information in the product purchase and return history (e.g., return history, purchase-no-return behavior, and customer/product similarity). Furthermore, the large-scale data sets involved in this problem, typically consisting of millions of customers and tens of thousands of products, also render existing methods inefficient and ineffective at predicting the product returns. To address these problems, in this paper, we propose to use a weighted hybrid graph to represent the rich information in the product purchase and return history, in order to predict product returns. The proposed graph consists of both customer nodes and product nodes, undirected edges reflecting customer return history and customer/product similarity based on their attributes, as well as directed edges discriminating purchase-no-return and nopurchase actions. Based on this representation, we study a random-walk-based local algorithm for predicting product return propensity for each customer, whose computational complexity depends only on the size of the output cluster rather than the entire graph. Such a property makes the proposed local algorithm particularly suitable for processing the large-scale data sets to predict product returns. To test the performance of the proposed techniques, we evaluate the graph model and algorithm on multiple e-commerce data sets, showing improved performance over state-of-the-art methods.",
author = "Yada Zhu and Jianbo Li and Jingrui He and Quanz, {Brian L.} and Deshpande, {Ajay A.}",
year = "2018",
month = "1",
day = "1",
language = "English (US)",
volume = "2018-July",
pages = "3718--3724",
editor = "Jerome Lang",
booktitle = "Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018",
publisher = "International Joint Conferences on Artificial Intelligence",

}

TY - GEN

T1 - A local algorithm for product return prediction in E-commerce

AU - Zhu, Yada

AU - Li, Jianbo

AU - He, Jingrui

AU - Quanz, Brian L.

AU - Deshpande, Ajay A.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - With the rapid growth of e-tail, the cost to handle returned online orders also increases significantly and has become a major challenge in the ecommerce industry. Accurate prediction of product returns allows e-tailers to prevent problematic transactions in advance. However, the limited existing work for modeling customer online shopping behaviors and predicting their return actions fail to integrate the rich information in the product purchase and return history (e.g., return history, purchase-no-return behavior, and customer/product similarity). Furthermore, the large-scale data sets involved in this problem, typically consisting of millions of customers and tens of thousands of products, also render existing methods inefficient and ineffective at predicting the product returns. To address these problems, in this paper, we propose to use a weighted hybrid graph to represent the rich information in the product purchase and return history, in order to predict product returns. The proposed graph consists of both customer nodes and product nodes, undirected edges reflecting customer return history and customer/product similarity based on their attributes, as well as directed edges discriminating purchase-no-return and nopurchase actions. Based on this representation, we study a random-walk-based local algorithm for predicting product return propensity for each customer, whose computational complexity depends only on the size of the output cluster rather than the entire graph. Such a property makes the proposed local algorithm particularly suitable for processing the large-scale data sets to predict product returns. To test the performance of the proposed techniques, we evaluate the graph model and algorithm on multiple e-commerce data sets, showing improved performance over state-of-the-art methods.

AB - With the rapid growth of e-tail, the cost to handle returned online orders also increases significantly and has become a major challenge in the ecommerce industry. Accurate prediction of product returns allows e-tailers to prevent problematic transactions in advance. However, the limited existing work for modeling customer online shopping behaviors and predicting their return actions fail to integrate the rich information in the product purchase and return history (e.g., return history, purchase-no-return behavior, and customer/product similarity). Furthermore, the large-scale data sets involved in this problem, typically consisting of millions of customers and tens of thousands of products, also render existing methods inefficient and ineffective at predicting the product returns. To address these problems, in this paper, we propose to use a weighted hybrid graph to represent the rich information in the product purchase and return history, in order to predict product returns. The proposed graph consists of both customer nodes and product nodes, undirected edges reflecting customer return history and customer/product similarity based on their attributes, as well as directed edges discriminating purchase-no-return and nopurchase actions. Based on this representation, we study a random-walk-based local algorithm for predicting product return propensity for each customer, whose computational complexity depends only on the size of the output cluster rather than the entire graph. Such a property makes the proposed local algorithm particularly suitable for processing the large-scale data sets to predict product returns. To test the performance of the proposed techniques, we evaluate the graph model and algorithm on multiple e-commerce data sets, showing improved performance over state-of-the-art methods.

UR - http://www.scopus.com/inward/record.url?scp=85055697612&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85055697612&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85055697612

VL - 2018-July

SP - 3718

EP - 3724

BT - Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018

A2 - Lang, Jerome

PB - International Joint Conferences on Artificial Intelligence

ER -