KGNIE: A Learning Method for Estimating Node Importance in Knowledge Graphs
- Publisher:
- IEEE
- Publication Type:
- Conference Proceeding
- Citation:
- 2023 IEEE International Conference on High Performance Computing & Communications, Data Science & Systems, Smart City & Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys), 2024, pp. 615-622
- Issue Date:
- 2024-03-25
Embargoed
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| KGNIE A Learning Method for Estimating Node Importance in Knowledge Graphs.pdf | Accepted version | 1.36 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is currently unavailable due to the publisher's embargo.
Estimating node importance is critical in graph data mining benefiting various downstream applications such as social network analysis and recommendation systems Existing approaches face challenges when dealing with complex knowledge graphs due to the abundance of predicate and entity information This paper introduces KGNIE an efficient knowledge graph node importance estimation network KGNIE considers the rich predicate attributes and entity types and utilizes local and global information encoders to generate node embeddings with different importance related information An attention based fusion module is employed to balance the two encoders A node importance decoder is proposed to map node embed dings to importance scores based on entity types Furthermore we introduce a margin ranking loss to determine relative node importance rankings We conducted extensive experiments on real world knowledge graphs demonstrating that our model outperforms existing approaches across all evaluation metrics
Please use this identifier to cite or link to this item: