Tables, as an important means of data storage, are widely used in spreadsheets, web tables, and PDFs. By integrating information from table data with knowledge re-trieved from an external knowledge base, and examining the correspondences between cell values in the table and instances in the knowledge base, we can extract knowledge from the table to augment and enrich the knowledge base. To achieve this goal, we first need to classify table cells based on their functions in the layout. Due to the diverse structures arising from the arrangements of rows and columns, as well as the complexity of content resulting from concise data storage, current automation techniques heavily rely on stylistic features of table cells, such as font or color. Moreover, these methods are rarely experimented with or validated on tables without style features. Recent literature indicates that large language models (LLMs) demonstrate an ability to understand the structure and content of tables in tasks such as table judgment reasoning. Even without extensive feature inputs or pre-training, LLMs still show comparable results to machine learning and deep learning in these tasks. Therefore, this paper attempts to apply LLMs to table cell classification without using other stylistic features. We have designed a 4-component prompt paradigm (Classification Definition, Instruction, Table, Com-pletion), representing respectively the classification definition, task instructions, table data, and result output. We conduct experiments on three datasets CIUS, SAUS, and DEEX for table cell classification with one-shot learning. Our experimental results show that with the assistance of LLMs, better results can be achieved without utilizing stylistic features.

Point-of-Interest (POI) recommendation, pivotal for guiding users to their next interested locale, grapples with the persistent challenge of data sparsity. Whereas knowledge graphs (KGs) have emerged as a favored tool to mitigate the issue, existing KG-based methods tend to overlook two crucial elements: the intention steering users’ location choices and the high-order topological structure within the KG. In this paper, we craft an Intention-aware Knowledge Graph (IKG) that harmonizes users’ visit histories, movement trajectories, and location categories to model user intentions. Building upon IKG, our novel Intention-aware Knowledge Graph Network (IKGN) delves deeper into the POI recommendation by weighing and propagating node embeddings through an attention mechanism, capturing the unique locational intent of each user. A sequential model like GRU is then employed to ensure a comprehensive representation of users’ short- and long-term location preferences. An empirical study on two real-world datasets validates the effectiveness of our proposed IKGN, with it markedly outshining seven benchmark rival models in both Recall and NDCG metrics. The code of IKGN is available at https://github.com/Jungle123456/IKGN.

In the era of big data, fragmented knowledge, multisource heterogeneity, and different representation forms of the same entities in various data sources have posed considerable challenges to entity fusion. How to effectively integrate multisource knowledge for the same entities has provoked vast amounts of attention and research from multiple disciplines. Most existing methods for entity fusion can be categorized into two classes: one is to establish an association between the same entities, and the other is to delete duplicate entities after knowledge fusion and create a new fusion entity. However, in these two classes of methods, the former does not achieve true knowledge fusion and semantic interoperability, while the latter may cause irreversible loss of original information. In this paper, we propose a novel entity fusion scheme: Hypernode. Hypernode fuses the same entity in different data sources into a new entity while retaining the original data. We verify the effectiveness of Hypernode on multiple models of link prediction experiments. Several practical application cases illustrate the applicability of Hypernode in data traceability, open domain knowledge fusion, and multi-modal knowledge graph fusion.