Time-aware adaptive interest point recommendation method based on K-means clustering

A recommendation method and point-of-interest technology, applied in the field of artificial intelligence and machine learning, can solve the problem of ignoring the time-dimensional dynamic characteristics of user similarity, user needs that are not good at dealing with dynamic changes, and sparse user-time-point-of-interest three-dimensional matrix data. and other problems, to achieve the effect of increasing accuracy and interpretability, broad industrial application prospects, and alleviating the problem of data sparseness

Pending Publication Date: 2022-05-24
NANJING VOCATIONAL UNIV OF IND TECH
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Most point-of-interest recommendation technologies are not good at dealing with dynamically changing user needs, it is difficult to support the correction and adjustment of user preferences over time, and it is impossible to provide real-time point-of-interest recommendation results that best meet the current time situation
[0008] (2) Ignoring the time-dimensional dynamic characteristics of user similarity
Therefore, using the global user similarity at different times is not in line with the factual law
[0009] (3) The problem of data sparsity in the three-dimensional matrix of user-time-point of interest
[0010] The above is the deficiency of the existing time-aware point of interest recommendation technology, which brings great disadvantages in the design, development, deployment and operation of different social network platforms, especially in the network platform of massive project information. The decline of system service quality will affect the sales performance of e-commerce system

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Time-aware adaptive interest point recommendation method based on K-means clustering
  • Time-aware adaptive interest point recommendation method based on K-means clustering
  • Time-aware adaptive interest point recommendation method based on K-means clustering

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0032] The present invention will be described in further detail below in conjunction with the accompanying drawings and specific examples.

[0033] The specific flow of the design and implementation of the present invention is as follows: figure 2 The main variables and parameters in the process are shown in Table 1.

[0034] Table 1 Functions of main variables and parameters

[0035]

[0036] The first step is to collect and organize the user's original check-in data set, and convert it into a user-time-point-of-interest three-dimensional scoring matrix. The operation steps are as follows:

[0037] (1.a) Organize the user's original check-in data set C, and obtain n check-in records, denoted as C={c 1 ,c 2 ,…,c n }. Each check-in record is formalized as a five-tuple of user ID, check-in time time, geographic latitude, geographic longitude, and POI ID. All sets of users in the check-in dataset are denoted by U, and all sets of points of interest are denoted by L, w...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a time-aware adaptive interest point recommendation method based on K-means clustering. The method comprises the following steps: 1, converting a sign-in data set into a three-dimensional scoring matrix; 2, counting the number of sign-in users, the number of accessed interest points and sign-in times in each time slot, and constructing a three-dimensional sign-in feature vector of each time slot; 3, performing K-means clustering on the time slots, and calculating the time similarity between the time slots in the same cluster; 4, calculating the user similarity at the current time by using the score information in other time slots in the same time cluster; step 5, improving a traditional user-based collaborative filtering method by using a time clustering result and time similarity in a cluster, so that the traditional user-based collaborative filtering method can adaptively generate interest point prediction scores according to current recommendation time; and 6, comparing the recommendation precision of the recommendation system provided by the invention with the recommendation precision of other classic recommendation systems, and evaluating the accuracy and effectiveness of the provided technology.

Description

technical field [0001] The invention relates to a time-aware adaptive interest point recommendation method based on K-means clustering in a location social network, and belongs to the technical field of artificial intelligence and machine learning. Background technique [0002] In recent years, with the rapid development of communication technology, positioning technology and mobile Internet technology, Location-based Social Networks (LBSNs) have become a new form of media for people to share and transmit information. The real world below provides a close-knit platform. At present, there are a large number of mature location-based social network platforms at home and abroad, such as Facebook, YouTube, Twitter, Weibo, Douban, Dianping, Meituan and WeChat Moments. In location-based social networks, users can establish complex social relationships, such as friends, colleagues, relatives, etc; , movie theaters, etc.; use mobile devices to check in when visiting points-of-inter...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F16/9535G06F16/9537G06F16/9536G06F16/2458G06K9/62G06Q10/06G06Q50/00G06Q30/02
CPCG06F16/9535G06F16/9537G06F16/9536G06F16/2462G06Q10/06393G06Q10/06395G06Q50/01G06Q30/0271Y02D10/00
Inventor 朱俊梁太波韩立新
Owner NANJING VOCATIONAL UNIV OF IND TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products