arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1912.12264cs.LGstat.ML
收藏

利用网络结构预测节点属性

Predicting Attributes of Nodes Using Network Structure

Lahore University of Management Sciences(拉合尔管理科学大学);Islamic University(伊斯兰大学);Hazara University(哈扎拉大学)

Sarwan Ali, Muhammad Haroon Shakeel, Imdadullah Khan, Safiullah Faizullah, Muhammad Asad Khan

摘要:

在诸如社交网络的许多图中,节点具有表示其行为的关联属性。预测这些图中的节点属性是许多领域中的应用的重要问题,如推荐系统,隐私保护和有针对性的广告。属性值可以通过分析模式和属性之间的相关性并采用分类/回归算法来预测。然而,这些方法不利用容易获得的网络拓扑信息。在这方面,可以利用节点的不同属性之间的互连来提高预测精度。在本文中,我们提出了一种方法来表示一个节点的属性$a_i$(这是作为机器学习算法的输入)使用所有属性的邻居预测属性值$a_i$的特征映射。我们在10个真实世界的数据集上进行了广泛的实验,结果表明,与这些数据集上的基线方法相比,所提出的特征映射显着提高了预测精度。

英文摘要:

In many graphs such as social networks, nodes have associated attributes representing their behavior. Predicting node attributes in such graphs is an important problem with applications in many domains like recommendation systems, privacy preservation, and targeted advertisement. Attributes values can be predicted by analyzing patterns and correlations among attributes and employing classification/regression algorithms. However, these approaches do not utilize readily available network topology information. In this regard, interconnections between different attributes of nodes can be exploited to improve the prediction accuracy. In this paper, we propose an approach to represent a node by a feature map with respect to an attribute $a_i$ (which is used as input for machine learning algorithms) using all attributes of neighbors to predict attributes values for $a_i$. We perform extensive experimentation on ten real-world datasets and show that the proposed feature map significantly improves the prediction accuracy as compared to baseline approaches on these datasets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑