{"title":"通过子图替换简化过滤器/流图","authors":"F. Haag, S. Lohmann, T. Ertl","doi":"10.1109/VLHCC.2012.6344501","DOIUrl":null,"url":null,"abstract":"Although the filter/flow model is a useful concept for query visualization, the resulting graphs can be quite complex. We aim to reduce this complexity by substituting recurring subgraphs with more compact structures. Based on related work on extensions to the filter/flow concept, we have identified four recurring subgraphs that can be significantly simplified by substitutions. We describe these substitutions and discuss the preconditions that must be satisfied for their application. An example of news filtering illustrates how the substitutions can be used to simplify the overall structure of filter/flow graphs and increase their readability.","PeriodicalId":156972,"journal":{"name":"2012 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Simplifying filter/flow graphs by subgraph substitution\",\"authors\":\"F. Haag, S. Lohmann, T. Ertl\",\"doi\":\"10.1109/VLHCC.2012.6344501\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Although the filter/flow model is a useful concept for query visualization, the resulting graphs can be quite complex. We aim to reduce this complexity by substituting recurring subgraphs with more compact structures. Based on related work on extensions to the filter/flow concept, we have identified four recurring subgraphs that can be significantly simplified by substitutions. We describe these substitutions and discuss the preconditions that must be satisfied for their application. An example of news filtering illustrates how the substitutions can be used to simplify the overall structure of filter/flow graphs and increase their readability.\",\"PeriodicalId\":156972,\"journal\":{\"name\":\"2012 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VLHCC.2012.6344501\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VLHCC.2012.6344501","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Simplifying filter/flow graphs by subgraph substitution
Although the filter/flow model is a useful concept for query visualization, the resulting graphs can be quite complex. We aim to reduce this complexity by substituting recurring subgraphs with more compact structures. Based on related work on extensions to the filter/flow concept, we have identified four recurring subgraphs that can be significantly simplified by substitutions. We describe these substitutions and discuss the preconditions that must be satisfied for their application. An example of news filtering illustrates how the substitutions can be used to simplify the overall structure of filter/flow graphs and increase their readability.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
