{"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}
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.