Storage method for customer preference information in e-commerce platform based on similarity matching algorithm
by Chengliang Lin; Lihua Jiang
International Journal of Information and Communication Technology (IJICT), Vol. 19, No. 2, 2021

Abstract: In order to overcome the problems of small IOPs parameters, long response time and inaccuracy of customer access key information similarity in existing e-commerce platform information storage, this paper proposes a new method of customer preference information storage in e-commerce platform. In this method, crawler algorithm is used to collect customer access information, and key customer access information is extracted by setting indicators. LibSVM classifier is used to classify customer access key information, similarity matching algorithm is used to calculate the similarity of customer access key information, and collaborative filtering recommendation algorithm is used to recommend relevant information for customers, so as to realise the storage of customer preference information in e-commerce platform under the background of artificial intelligence. Experiments show that the proposed storage method greatly improves the IOPs parameters, and the minimum storage response time is 21 ms, which fully shows that the proposed method has better storage performance.

Online publication date: Fri, 13-Aug-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com