Few-Shot Graph Classification with Structural-Enhanced Contrastive Learning for Graph Data Copyright Protection

IF 5.2 1区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Tsinghua Science and Technology Pub Date : 2023-09-22 DOI:10.26599/TST.2023.9010071
Kainan Zhang;DongMyung Shin;Daehee Seo;Zhipeng Cai
{"title":"Few-Shot Graph Classification with Structural-Enhanced Contrastive Learning for Graph Data Copyright Protection","authors":"Kainan Zhang;DongMyung Shin;Daehee Seo;Zhipeng Cai","doi":"10.26599/TST.2023.9010071","DOIUrl":null,"url":null,"abstract":"Open-source licenses can promote the development of machine learning by allowing others to access, modify, and redistribute the training dataset. However, not all open-source licenses may be appropriate for data sharing, as some may not provide adequate protections for sensitive or personal information such as social network data. Additionally, some data may be subject to legal or regulatory restrictions that limit its sharing, regardless of the licensing model used. Hence, obtaining large amounts of labeled data can be difficult, time-consuming, or expensive in many real-world scenarios. Few-shot graph classification, as one application of meta-learning in supervised graph learning, aims to classify unseen graph types by only using a small amount of labeled data. However, the current graph neural network methods lack full usage of graph structures on molecular graphs and social network datasets. Since structural features are known to correlate with molecular properties in chemistry, structure information tends to be ignored with sufficient property information provided. Nevertheless, the common binary classification task of chemical compounds is unsuitable in the few-shot setting requiring novel labels. Hence, this paper focuses on the graph classification tasks of a social network, whose complex topology has an uncertain relationship with its nodes' attributes. With two multi-class graph datasets with large node-attribute dimensions constructed to facilitate the research, we propose a novel learning framework that integrates both meta-learning and contrastive learning to enhance the utilization of graph topological information. Extensive experiments demonstrate the competitive performance of our framework respective to other state-of-the-art methods.","PeriodicalId":60306,"journal":{"name":"Tsinghua Science and Technology","volume":"29 2","pages":"605-616"},"PeriodicalIF":5.2000,"publicationDate":"2023-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/5971803/10258149/10258268.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tsinghua Science and Technology","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10258268/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Open-source licenses can promote the development of machine learning by allowing others to access, modify, and redistribute the training dataset. However, not all open-source licenses may be appropriate for data sharing, as some may not provide adequate protections for sensitive or personal information such as social network data. Additionally, some data may be subject to legal or regulatory restrictions that limit its sharing, regardless of the licensing model used. Hence, obtaining large amounts of labeled data can be difficult, time-consuming, or expensive in many real-world scenarios. Few-shot graph classification, as one application of meta-learning in supervised graph learning, aims to classify unseen graph types by only using a small amount of labeled data. However, the current graph neural network methods lack full usage of graph structures on molecular graphs and social network datasets. Since structural features are known to correlate with molecular properties in chemistry, structure information tends to be ignored with sufficient property information provided. Nevertheless, the common binary classification task of chemical compounds is unsuitable in the few-shot setting requiring novel labels. Hence, this paper focuses on the graph classification tasks of a social network, whose complex topology has an uncertain relationship with its nodes' attributes. With two multi-class graph datasets with large node-attribute dimensions constructed to facilitate the research, we propose a novel learning framework that integrates both meta-learning and contrastive learning to enhance the utilization of graph topological information. Extensive experiments demonstrate the competitive performance of our framework respective to other state-of-the-art methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于结构增强对比学习的少镜头图分类在图数据版权保护中的应用
开源许可证可以通过允许他人访问、修改和重新分发训练数据集来促进机器学习的发展。然而,并非所有开源许可证都适用于数据共享,因为有些许可证可能无法为社交网络数据等敏感或个人信息提供足够的保护。此外,无论使用何种许可模式,某些数据都可能受到限制其共享的法律或监管限制。因此,在许多现实世界的场景中,获取大量标记数据可能很困难、耗时或昂贵。少镜头图分类作为元学习在有监督图学习中的一种应用,旨在仅使用少量标记数据对看不见的图类型进行分类。然而,目前的图神经网络方法缺乏在分子图和社交网络数据集上充分利用图结构。由于已知结构特征与化学中的分子性质相关,在提供足够的性质信息的情况下,结构信息往往被忽略。然而,化合物的常见二元分类任务不适合需要新标签的少数镜头设置。因此,本文关注的是社交网络的图分类任务,其复杂拓扑与其节点的属性具有不确定关系。通过构建两个具有大节点属性维度的多类图数据集来促进研究,我们提出了一种新的学习框架,该框架集成了元学习和对比学习,以提高图拓扑信息的利用率。大量的实验证明了我们的框架相对于其他最先进的方法的竞争性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
12.10
自引率
0.00%
发文量
2340
期刊最新文献
Contents Feature-Grounded Single-Stage Text-to-Image Generation Deep Broad Learning for Emotion Classification in Textual Conversations Exploring a Promising Region and Enhancing Decision Space Diversity for Multimodal Multi-Objective Optimization Exploring a Promising Region and Enhancing Decision Space Diversity for Multimodal Multi-objective Optimization
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1