中文
相关论文

相关论文: Sampled in Pairs and Driven by Text: A New Graph E…

200 篇论文

Knowledge Graphs (KGs) have seen increasing use across various domains -- from biomedicine and linguistics to general knowledge modelling. In order to facilitate the analysis of knowledge graphs, Knowledge Graph Embeddings (KGEs) have been…

机器学习 · 计算机科学 2024-12-20 Jeffrey Sardina , John D. Kelleher , Declan O'Sullivan

Among the top approaches of recent years, link prediction using knowledge graph embedding (KGE) models has gained significant attention for knowledge graph completion. Various embedding models have been proposed so far, among which, some…

人工智能 · 计算机科学 2021-06-01 Chengjin Xu , Mojtaba Nayyeri , Sahar Vahdati , Jens Lehmann

In the last few years, the solution to Knowledge Graph (KG) completion via learning embeddings of entities and relations has attracted a surge of interest. Temporal KGs(TKGs) extend traditional Knowledge Graphs (KGs) by associating static…

人工智能 · 计算机科学 2023-02-14 Zhongwu Chen , Chengjin Xu , Fenglong Su , Zhen Huang , You Dou

In the modern age of social media and networks, graph representations of real-world phenomena have become an incredibly useful source to mine insights. Often, we are interested in understanding how entities in a graph are interconnected.…

机器学习 · 计算机科学 2021-12-16 Aneesh Komanduri , Justin Zhan

The rise of graph-structured data has driven major advances in Graph Machine Learning (GML), where graph embeddings (GEs) map features from Knowledge Graphs (KGs) into vector spaces, enabling tasks like node classification and link…

机器学习 · 计算机科学 2026-01-27 Rosario Napoli , Gabriele Morabito , Antonio Celesti , Massimo Villari , Maria Fazio

Structured prediction tasks in machine learning involve the simultaneous prediction of multiple labels. This is typically done by maximizing a score function on the space of labels, which decomposes as a sum of pairwise elements, each…

机器学习 · 计算机科学 2014-09-23 Amir Globerson , Tim Roughgarden , David Sontag , Cafer Yildirim

Learning low-dimensional numerical representations from symbolic data, e.g., embedding the nodes of a graph into a geometric space, is an important concept in machine learning. While embedding into Euclidean space is common, recent…

机器学习 · 计算机科学 2024-10-10 Thomas Bläsius , Jean-Pierre von der Heydt , Maximilian Katzmann , Nikolai Maas

Unsupervised attributed graph representation learning is challenging since both structural and feature information are required to be represented in the latent space. Existing methods concentrate on learning latent representation via…

机器学习 · 计算机科学 2021-04-28 Zelin Zang , Siyuan Li , Di Wu , Jianzhu Guo , Yongjie Xu , Stan Z. Li

Traditional Machine Learning (ML) methods require large amounts of data to perform well, limiting their applicability in sparse or incomplete scenarios and forcing the usage of additional synthetic data to improve the model training. To…

机器学习 · 计算机科学 2025-11-18 Rosario Napoli , Giovanni Lonia , Antonio Celesti , Massimo Villari , Maria Fazio

Machine learning models for graphs in real-world applications are prone to two primary types of uncertainty: (1) those that arise from incomplete and noisy data and (2) those that arise from uncertainty of the model in its output. These…

机器学习 · 计算机科学 2024-12-10 Zohair Shafi , Germans Savcisens , Tina Eliassi-Rad

Knowledge Graphs (KGs) are widely employed in artificial intelligence applications, such as question-answering and recommendation systems. However, KGs are frequently found to be incomplete. While much of the existing literature focuses on…

人工智能 · 计算机科学 2024-06-28 Sakher Khalil Alqaaidi , Krzysztof Kochut

Text-based person retrieval (TPR) is a challenging task that involves retrieving a specific individual based on a textual description. Despite considerable efforts to bridge the gap between vision and language, the significant differences…

计算机视觉与模式识别 · 计算机科学 2024-06-11 Yiwei Ma , Xiaoshuai Sun , Jiayi Ji , Guannan Jiang , Weilin Zhuang , Rongrong Ji

The potential for machine learning systems to amplify social inequities and unfairness is receiving increasing popular and academic attention. Much recent work has focused on developing algorithmic tools to assess and mitigate such…

Recently, self-supervised learning has proved to be effective to learn representations of events suitable for temporal segmentation in image sequences, where events are understood as sets of temporally adjacent images that are semantically…

机器学习 · 计算机科学 2020-12-11 Mariella Dimiccoli , Herwig Wendt

Recently, graph neural networks have been widely used for network embedding because of their prominent performance in pairwise relationship learning. In the real world, a more natural and common situation is the coexistence of pairwise…

社会与信息网络 · 计算机科学 2021-01-19 Xiangguo Sun , Hongzhi Yin , Bo Liu , Hongxu Chen , Jiuxin Cao , Yingxia Shao , Nguyen Quoc Viet Hung

Text-attributed graphs have recently garnered significant attention due to their wide range of applications in web domains. Existing methodologies employ word embedding models for acquiring text representations as node features, which are…

机器学习 · 计算机科学 2024-12-11 Jianxiang Yu , Yuxiang Ren , Chenghua Gong , Jiaqi Tan , Xiang Li , Xuecang Zhang

Knowledge graph embedding (KGE) focuses on representing the entities and relations of a knowledge graph (KG) into the continuous vector spaces, which can be employed to predict the missing triples to achieve knowledge graph completion…

计算与语言 · 计算机科学 2023-07-25 Yichi Zhang , Wen Zhang

Knowledge graphs are useful for many artificial intelligence (AI) tasks. However, knowledge graphs often have missing facts. To populate the graphs, knowledge graph embedding models have been developed. Knowledge graph embedding models map…

人工智能 · 计算机科学 2017-11-16 Takuma Ebisu , Ryutaro Ichise

Recent advancements in deep neural networks for graph-structured data have led to state-of-the-art performance on recommender system benchmarks. In this work, we present a Graph Convolutional Network (GCN) algorithm SWAG (Sample Weight and…

信息检索 · 计算机科学 2020-08-24 Amit Pande , Kai Ni , Venkataramani Kini

Our objective is to sample the node set of a large unknown graph via crawling, to accurately estimate a given metric of interest. We design a random walk on an appropriately defined weighted graph that achieves high efficiency by…

社会与信息网络 · 计算机科学 2011-03-29 M. Kurant , M. Gjoka , C. T. Butts , A. Markopoulou