大型开放数据集的可视化和交互式探索

Tianyang Liu, D. Ahmed, F. Bouali, G. Venturini
{"title":"大型开放数据集的可视化和交互式探索","authors":"Tianyang Liu, D. Ahmed, F. Bouali, G. Venturini","doi":"10.1109/IV.2013.100","DOIUrl":null,"url":null,"abstract":"We deal in this paper with the problem of creating an interactive and visual map for a large collection of Open datasets. We first describe how to define a representation space for such data, using text mining techniques to create features. Then, with a similarity measure between Open datasets, we use the k-nearest neighbors method for building a proximity graph between datasets. We use a force-directed layout method to visualize the graph (Tulip Software). We present the results with a collection of 293,000 datasets from the French Open data web site, in which the display of the graph is limited to 151,000 datasets. We study the discovered clusters and we show how they can be used to browse this large collection.","PeriodicalId":354135,"journal":{"name":"2013 17th International Conference on Information Visualisation","volume":"99 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Visual and Interactive Exploration of a Large Collection of Open Datasets\",\"authors\":\"Tianyang Liu, D. Ahmed, F. Bouali, G. Venturini\",\"doi\":\"10.1109/IV.2013.100\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We deal in this paper with the problem of creating an interactive and visual map for a large collection of Open datasets. We first describe how to define a representation space for such data, using text mining techniques to create features. Then, with a similarity measure between Open datasets, we use the k-nearest neighbors method for building a proximity graph between datasets. We use a force-directed layout method to visualize the graph (Tulip Software). We present the results with a collection of 293,000 datasets from the French Open data web site, in which the display of the graph is limited to 151,000 datasets. We study the discovered clusters and we show how they can be used to browse this large collection.\",\"PeriodicalId\":354135,\"journal\":{\"name\":\"2013 17th International Conference on Information Visualisation\",\"volume\":\"99 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 17th International Conference on Information Visualisation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IV.2013.100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 17th International Conference on Information Visualisation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IV.2013.100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在本文中,我们处理的问题是为大量开放数据集创建一个交互式和可视化的地图。我们首先描述了如何为这些数据定义一个表示空间,使用文本挖掘技术来创建特征。然后,通过开放数据集之间的相似性度量,我们使用k近邻方法在数据集之间构建接近图。我们使用力定向布局方法来可视化图形(郁金香软件)。我们使用来自法国网球公开赛数据网站的293,000个数据集来展示结果,其中图形的显示仅限于151,000个数据集。我们将研究发现的集群,并展示如何使用它们来浏览这个大型集合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Visual and Interactive Exploration of a Large Collection of Open Datasets
We deal in this paper with the problem of creating an interactive and visual map for a large collection of Open datasets. We first describe how to define a representation space for such data, using text mining techniques to create features. Then, with a similarity measure between Open datasets, we use the k-nearest neighbors method for building a proximity graph between datasets. We use a force-directed layout method to visualize the graph (Tulip Software). We present the results with a collection of 293,000 datasets from the French Open data web site, in which the display of the graph is limited to 151,000 datasets. We study the discovered clusters and we show how they can be used to browse this large collection.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信