Search

Extensive user check-in data incorporating user preferences for location is collected through Internet of Things (IoT) devices, including cell phones and other sensing devices in location-based social network. It can help traveling enterprises intelligently predict users’ interests and preferences, provide them with scientific tourism paths, and increase the enterprises income. Thus, successive point-of-interest (POI) recommendation has become a hot research topic in augmented Intelligence of Things (AIoT). Presently, various methods have been applied to successive POI recommendations. Among them, the recurrent neural network-based approaches are committed to mining the sequence relationship between POIs, but ignore the high-order relationship between users and POIs. The graph neural network-based methods can capture the high-order connectivity, but it does not take the dynamic timeliness of POIs into account. Therefore, we propose an I nteraction-enhanced and T ime-aware G raph C onvolution N etwork (ITGCN) for successive POI recommendation. Specifically, we design an improved graph convolution network for learning the dynamic representation of users and POIs. We also designed a self-attention aggregator to embed high-order connectivity into the node representation selectively. The enterprise management systems can predict the preferences of users, which is helpful for future planning and development. Finally, experimental results prove that ITGCN brings better results compared to the existing methods.

The graph convolution network has received a lot of attention because it extends the convolution to non-Euclidean domains. However, the graph pooling method is still less concerned, which can learn coarse graph embedding to facilitate graph classification. Previous pooling methods were based on assigning a score to each node and then pooling only the highest-scoring nodes, which might throw away whole neighbourhoods of nodes and therefore information. Here, we proposed a novel pooling method UGPool with a new point-of-view on selecting nodes. UGPool learns node scores based on node features and uniformly pools neighboring nodes instead of top nodes in the score-space, resulting in a uniformly coarsened graph. In multiple graph classification tasks, including the protein graphs, the biological graphs and the brain connectivity graphs, we demonstrated that UGPool outperforms other graph pooling methods while maintaining high efficiency. Moreover, we also show that UGPool can be integrated with multiple graph convolution networks to effectively improve performance compared to no pooling.