GraphCharter: Combining browsing with query to explore large semantic graphs

Ying Tu, Han-Wei Shen
{"title":"GraphCharter: Combining browsing with query to explore large semantic graphs","authors":"Ying Tu, Han-Wei Shen","doi":"10.1109/PacificVis.2013.6596127","DOIUrl":null,"url":null,"abstract":"Large scale semantic graphs such as social networks and knowledge graphs contain rich and useful information. However, due to combined challenges in scale, density, and heterogeneity, it is impractical for users to answer many interesting questions by visual inspection alone. This is because even a semantically simple question, such as which of my extended friends are also fans of my favorite band, can in fact require information from a non-trivial number of nodes to answer. In this paper, we propose a method that combines graph browsing with query to overcome the limitation of visual inspection. By using query as the main way for information discovery in graph exploration, our “query, expand, and query again” model enables users to probe beyond the visible part of the graph and only bring in the interesting nodes, leaving the view clutter-free. We have implemented a prototype called GraphCharter and demonstrated its effectiveness and usability in a case study and a user study on Freebase knowledge graph with millions of nodes and edges.","PeriodicalId":179865,"journal":{"name":"2013 IEEE Pacific Visualization Symposium (PacificVis)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Pacific Visualization Symposium (PacificVis)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PacificVis.2013.6596127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Large scale semantic graphs such as social networks and knowledge graphs contain rich and useful information. However, due to combined challenges in scale, density, and heterogeneity, it is impractical for users to answer many interesting questions by visual inspection alone. This is because even a semantically simple question, such as which of my extended friends are also fans of my favorite band, can in fact require information from a non-trivial number of nodes to answer. In this paper, we propose a method that combines graph browsing with query to overcome the limitation of visual inspection. By using query as the main way for information discovery in graph exploration, our “query, expand, and query again” model enables users to probe beyond the visible part of the graph and only bring in the interesting nodes, leaving the view clutter-free. We have implemented a prototype called GraphCharter and demonstrated its effectiveness and usability in a case study and a user study on Freebase knowledge graph with millions of nodes and edges.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
GraphCharter:结合浏览和查询来探索大型语义图
大规模的语义图,如社交网络和知识图,包含了丰富而有用的信息。然而,由于规模、密度和异质性的综合挑战,用户仅通过视觉检查来回答许多有趣的问题是不切实际的。这是因为即使是一个语义上简单的问题,比如我的朋友中哪一个也是我最喜欢的乐队的粉丝,实际上也可能需要来自大量节点的信息来回答。本文提出了一种将图形浏览与查询相结合的方法来克服视觉检测的局限性。通过将查询作为图探索中信息发现的主要方式,我们的“查询、展开、再查询”模型使用户能够探测图的可见部分之外,只引入感兴趣的节点,使视图没有杂乱。我们已经实现了一个名为GraphCharter的原型,并在Freebase知识图谱的案例研究和用户研究中展示了它的有效性和可用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
FlowGraph: A compound hierarchical graph for flow field exploration A topologically-enhanced juxtaposition tool for hybrid wind tunnel Constrained optimization for disoccluding geographic landmarks in 3D urban maps iTree: Exploring time-varying data using indexable tree Local WYSIWYG volume visualization
×
引用
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