data
dict |
|---|
{
"issue": {
"id": "12OmNwpGgK8",
"title": "Dec.",
"year": "2014",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwI5U2H",
"doi": "10.1109/TVCG.2014.2346291",
"abstract": "We present the design, implementation and evaluation of iVisDesigner, a web-based system that enables users to design information visualizations for complex datasets interactively, without the need for textual programming. Our system achieves high interactive expressiveness through conceptual modularity, covering a broad information visualization design space. iVisDesigner supports the interactive design of interactive visualizations, such as provisioning for responsive graph layouts and different types of brushing and linking interactions. We present the system design and implementation, exemplify it through a variety of illustrative visualization designs and discuss its limitations. A performance analysis and an informal user study are presented to evaluate the system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present the design, implementation and evaluation of iVisDesigner, a web-based system that enables users to design information visualizations for complex datasets interactively, without the need for textual programming. Our system achieves high interactive expressiveness through conceptual modularity, covering a broad information visualization design space. iVisDesigner supports the interactive design of interactive visualizations, such as provisioning for responsive graph layouts and different types of brushing and linking interactions. We present the system design and implementation, exemplify it through a variety of illustrative visualization designs and discuss its limitations. A performance analysis and an informal user study are presented to evaluate the system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present the design, implementation and evaluation of iVisDesigner, a web-based system that enables users to design information visualizations for complex datasets interactively, without the need for textual programming. Our system achieves high interactive expressiveness through conceptual modularity, covering a broad information visualization design space. iVisDesigner supports the interactive design of interactive visualizations, such as provisioning for responsive graph layouts and different types of brushing and linking interactions. We present the system design and implementation, exemplify it through a variety of illustrative visualization designs and discuss its limitations. A performance analysis and an informal user study are presented to evaluate the system.",
"title": "iVisDesigner: Expressive Interactive Design of Information Visualizations",
"normalizedTitle": "iVisDesigner: Expressive Interactive Design of Information Visualizations",
"fno": "06876042",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Information Analysis",
"Data Visualization",
"Web And Internet Services",
"Programming Profession",
"Web Based Visualization",
"Visualization Design",
"Interactive Design",
"Interaction",
"Expressiveness"
],
"authors": [
{
"givenName": "Donghao",
"surname": "Ren",
"fullName": "Donghao Ren",
"affiliation": "Department of Computer Science, University of California, Santa Barbara",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tobias",
"surname": "Hollerer",
"fullName": "Tobias Hollerer",
"affiliation": "Department of Computer Science, University of California, Santa Barbara",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoru",
"surname": "Yuan",
"fullName": "Xiaoru Yuan",
"affiliation": "Key Laboratory of Machine Perception (Ministry of Education), School of EECS",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2092-2101",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2003/2055/0/20550006",
"title": "Design Choices when Architecting Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2003/20550006/12OmNB8kHOu",
"parentPublication": {
"id": "proceedings/ieee-infovis/2003/2055/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660018",
"title": "VisTrails: Enabling Interactive Multiple-View Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660018/12OmNBscCZd",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/1996/7668/0/76680029",
"title": "On the semantics of interactive visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/1996/76680029/12OmNBtUdJb",
"parentPublication": {
"id": "proceedings/ieee-infovis/1996/7668/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532788",
"title": "VisTrails: enabling interactive multiple-view visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532788/12OmNCdBDTX",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780053",
"title": "WEAVE: A System for Visually Linking 3-D and Statistical Visualizations Applied to Cardiac Simulation and Measurement Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780053/12OmNzayN9F",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440860",
"title": "Augmenting Visualizations with Interactive Data Facts to Facilitate Interpretation and Communication",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440860/17D45Vw15v5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904428",
"title": "Photosensitive Accessibility for Interactive Data Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904428/1H1goP5OTrW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020463",
"title": "RaCAViz: Interactive Visualizations for Rapid Carbon Assessment",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020463/1KfQxJkhwxG",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/edoc/2019/2702/0/270200a132",
"title": "Modelling the Semantics for Model-Driven Interactive Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/edoc/2019/270200a132/1grPYiG4sbC",
"parentPublication": {
"id": "proceedings/edoc/2019/2702/0",
"title": "2019 IEEE 23rd International Enterprise Distributed Object Computing Conference (EDOC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222289",
"title": "Lyra 2: Designing Interactive Visualizations by Demonstration",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222289/1nTqMd2ZViE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06875988",
"articleId": "13rRUwh80uA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06875946",
"articleId": "13rRUwgQpDv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRe",
"title": "July-Aug.",
"year": "2015",
"issueNum": "04",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "35",
"label": "July-Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxCRFQl",
"doi": "10.1109/MCG.2015.51",
"abstract": "Data visualization and analytics research has great potential to empower people to improve their lives by leveraging their own personal data. However, most quantified selfers (Q-Selfers) are neither visualization experts nor data scientists. Consequently, visualizations Q-Selfers created with their data are often not ideal for conveying insights. Aiming to design a visualization system to help nonexperts gain and communicate personal data insights, the authors conducted a predesign empirical study. Through the lens of Q-Selfers, they examined what insights people gain specifically from their personal data and how they use visualizations to communicate their insights. Based on their analysis of 30 quantified self-presentations, they characterized eight insight types (detail, self-reflection, trend, comparison, correlation, data summary, distribution, and outlier) and mapped the visual annotations used to communicate them. They further discussed four areas for the design of personal visualization systems, including support for encouraging self-reflection, gaining valid insight, communicating insight, and using visual annotations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data visualization and analytics research has great potential to empower people to improve their lives by leveraging their own personal data. However, most quantified selfers (Q-Selfers) are neither visualization experts nor data scientists. Consequently, visualizations Q-Selfers created with their data are often not ideal for conveying insights. Aiming to design a visualization system to help nonexperts gain and communicate personal data insights, the authors conducted a predesign empirical study. Through the lens of Q-Selfers, they examined what insights people gain specifically from their personal data and how they use visualizations to communicate their insights. Based on their analysis of 30 quantified self-presentations, they characterized eight insight types (detail, self-reflection, trend, comparison, correlation, data summary, distribution, and outlier) and mapped the visual annotations used to communicate them. They further discussed four areas for the design of personal visualization systems, including support for encouraging self-reflection, gaining valid insight, communicating insight, and using visual annotations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data visualization and analytics research has great potential to empower people to improve their lives by leveraging their own personal data. However, most quantified selfers (Q-Selfers) are neither visualization experts nor data scientists. Consequently, visualizations Q-Selfers created with their data are often not ideal for conveying insights. Aiming to design a visualization system to help nonexperts gain and communicate personal data insights, the authors conducted a predesign empirical study. Through the lens of Q-Selfers, they examined what insights people gain specifically from their personal data and how they use visualizations to communicate their insights. Based on their analysis of 30 quantified self-presentations, they characterized eight insight types (detail, self-reflection, trend, comparison, correlation, data summary, distribution, and outlier) and mapped the visual annotations used to communicate them. They further discussed four areas for the design of personal visualization systems, including support for encouraging self-reflection, gaining valid insight, communicating insight, and using visual annotations.",
"title": "Characterizing Visualization Insights from Quantified Selfers' Personal Data Presentations",
"normalizedTitle": "Characterizing Visualization Insights from Quantified Selfers' Personal Data Presentations",
"fno": "mcg2015040028",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Quantified Selfer Personal Data Presentations",
"Data Visualization",
"Data Analytics",
"Q Selfers",
"Personal Data Insights",
"Visual Annotations",
"Personal Visualization Systems",
"Data Visualization",
"Visualization",
"Context Modeling",
"Taxonomy",
"Encoding",
"Market Research",
"Computer Graphics",
"Visualization Insights",
"Personal Information Visualization",
"Quantified Self",
"Quantified Selfers",
"Personal Informatics"
],
"authors": [
{
"givenName": "Eun Kyoung",
"surname": "Choe",
"fullName": "Eun Kyoung Choe",
"affiliation": "Pennsylvania State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bongshin",
"surname": "Lee",
"fullName": "Bongshin Lee",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "m.c.",
"surname": "schraefel",
"fullName": "m.c. schraefel",
"affiliation": "University of Southampton",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2015-07-01 00:00:00",
"pubType": "mags",
"pages": "28-37",
"year": "2015",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/2016/5670/0/5670d483",
"title": "Insights from the Design and Evaluation of a Personal Health Dashboard",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670d483/12OmNAnMuCE",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156366",
"title": "Text visualization techniques: Taxonomy, visual survey, and community insights",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156366/12OmNqAU6t7",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2017/3800/0/3800a303",
"title": "Deriving Data-Driven Insights from Climate Extreme Indices for the Continental US",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2017/3800a303/12OmNqyUUyR",
"parentPublication": {
"id": "proceedings/icdmw/2017/3800/0",
"title": "2017 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2015/04/mcg2015040082",
"title": "Design and Effects of Personal Visualizations",
"doi": null,
"abstractUrl": "/magazine/cg/2015/04/mcg2015040082/13rRUwh80Nt",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/03/06908006",
"title": "Personal Visualization and Personal Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2015/03/06908006/13rRUyYBlgA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/08/09020101",
"title": "Characterizing the Quality of Insight by Interactions: A Case Study",
"doi": null,
"abstractUrl": "/journal/tg/2021/08/09020101/1hS2LZ6csyQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a181",
"title": "What are Data Insights to Professional Visualization Users?",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a181/1qRO9q8X6dq",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a171",
"title": "Characterizing Automated Data Insights",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a171/1qROmjyLLmE",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552592",
"title": "An Automated Approach to Reasoning About Task-Oriented Insights in Responsive Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552592/1xic0SUdCNO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552876",
"title": "Learning Objectives, Insights, and Assessments: How Specification Formats Impact Design",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552876/1xic1wsZtLi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2015040026",
"articleId": "13rRUwwslv5",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2015040038",
"articleId": "13rRUzp02qz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1H1gfVbEsiA",
"doi": "10.1109/TVCG.2022.3209398",
"abstract": "A series of recent studies has focused on designing cross-resolution and cross-device visualizations, i.e., responsive visualization, a concept adopted from responsive web design. However, these studies mainly focused on visualizations with a single view to a small number of views, and there are still unresolved questions about how to design responsive multi-view visualizations. In this paper, we present a reusable and generalizable framework for designing responsive multi-view visualizations focused on genomics data. To gain a better understanding of existing design challenges, we review web-based genomics visualization tools in the wild. By characterizing tools based on a taxonomy of responsive designs, we find that responsiveness is rarely supported in existing tools. To distill insights from the survey results in a systematic way, we classify typical view composition patterns, such as “vertically long,” “horizontally wide,” “circular,” and “cross-shaped” compositions. We then identify their usability issues in different resolutions that stem from the composition patterns, as well as discussing approaches to address the issues and to make genomics visualizations responsive. By extending the Gosling visualization grammar to support responsive constructs, we show how these approaches can be supported. A valuable follow-up study would be taking different input modalities into account, such as mouse and touch interactions, which was not considered in our study.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A series of recent studies has focused on designing cross-resolution and cross-device visualizations, i.e., responsive visualization, a concept adopted from responsive web design. However, these studies mainly focused on visualizations with a single view to a small number of views, and there are still unresolved questions about how to design responsive multi-view visualizations. In this paper, we present a reusable and generalizable framework for designing responsive multi-view visualizations focused on genomics data. To gain a better understanding of existing design challenges, we review web-based genomics visualization tools in the wild. By characterizing tools based on a taxonomy of responsive designs, we find that responsiveness is rarely supported in existing tools. To distill insights from the survey results in a systematic way, we classify typical view composition patterns, such as “vertically long,” “horizontally wide,” “circular,” and “cross-shaped” compositions. We then identify their usability issues in different resolutions that stem from the composition patterns, as well as discussing approaches to address the issues and to make genomics visualizations responsive. By extending the Gosling visualization grammar to support responsive constructs, we show how these approaches can be supported. A valuable follow-up study would be taking different input modalities into account, such as mouse and touch interactions, which was not considered in our study.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A series of recent studies has focused on designing cross-resolution and cross-device visualizations, i.e., responsive visualization, a concept adopted from responsive web design. However, these studies mainly focused on visualizations with a single view to a small number of views, and there are still unresolved questions about how to design responsive multi-view visualizations. In this paper, we present a reusable and generalizable framework for designing responsive multi-view visualizations focused on genomics data. To gain a better understanding of existing design challenges, we review web-based genomics visualization tools in the wild. By characterizing tools based on a taxonomy of responsive designs, we find that responsiveness is rarely supported in existing tools. To distill insights from the survey results in a systematic way, we classify typical view composition patterns, such as “vertically long,” “horizontally wide,” “circular,” and “cross-shaped” compositions. We then identify their usability issues in different resolutions that stem from the composition patterns, as well as discussing approaches to address the issues and to make genomics visualizations responsive. By extending the Gosling visualization grammar to support responsive constructs, we show how these approaches can be supported. A valuable follow-up study would be taking different input modalities into account, such as mouse and touch interactions, which was not considered in our study.",
"title": "Multi-View Design Patterns and Responsive Visualization for Genomics Data",
"normalizedTitle": "Multi-View Design Patterns and Responsive Visualization for Genomics Data",
"fno": "09904451",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Biology Computing",
"Data Visualisation",
"Genetics",
"Genomics",
"Internet",
"Object Oriented Programming",
"Web Design",
"Cross Device Visualizations",
"Cross Resolution Visualizations",
"Gosling Visualization Grammar",
"Multiview Design Patterns",
"Responsive Multiview Visualizations",
"Responsive Web Design",
"View Composition Patterns",
"Web Based Genomics Visualization Tools",
"Data Visualization",
"Genomics",
"Bioinformatics",
"Usability",
"Grammar",
"Design Methodology",
"Task Analysis",
"Responsive Visualization",
"Multi View Visualization",
"Genomics",
"Visualization Grammar"
],
"authors": [
{
"givenName": "Sehi",
"surname": "L'Yi",
"fullName": "Sehi L'Yi",
"affiliation": "Harvard Medical School, Boston, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nils",
"surname": "Gehlenborg",
"fullName": "Nils Gehlenborg",
"affiliation": "Harvard Medical School, Boston, MA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "559-569",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dcc/2017/6721/0/07923729",
"title": "Optimize Genomics Data Compression with Hardware Accelerator",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2017/07923729/12OmNBghtsc",
"parentPublication": {
"id": "proceedings/dcc/2017/6721/0",
"title": "2017 Data Compression Conference (DCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/se4hpcs/2015/7082/0/7082a046",
"title": "Computation for Genomics Knowledge Discovery",
"doi": null,
"abstractUrl": "/proceedings-article/se4hpcs/2015/7082a046/12OmNqIQSiQ",
"parentPublication": {
"id": "proceedings/se4hpcs/2015/7082/0",
"title": "2015 IEEE/ACM 1st International Workshop on Software Engineering for High Performance Computing in Science (SE4HPCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2014/5666/0/07004392",
"title": "Big data in genomics: An overview",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2014/07004392/12OmNxH9XfX",
"parentPublication": {
"id": "proceedings/big-data/2014/5666/0",
"title": "2014 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/08/07999244",
"title": "An Analysis of Automated Visual Analysis Classification: Interactive Visualization Task Inference of Cancer Genomics Domain Experts",
"doi": null,
"abstractUrl": "/journal/tg/2018/08/07999244/13rRUNvgz9Z",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/06/08417929",
"title": "“Super Gene Set” Causal Relationship Discovery from Functional Genomics Data",
"doi": null,
"abstractUrl": "/journal/tb/2018/06/08417929/17D45Xh13sg",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iisa/2018/8161/0/08633685",
"title": "Smart Laboratory Information System Accelerates Genomics Research",
"doi": null,
"abstractUrl": "/proceedings-article/iisa/2018/08633685/17D45Xq6dzO",
"parentPublication": {
"id": "proceedings/iisa/2018/8161/0",
"title": "2018 9th International Conference on Information, Intelligence, Systems and Applications (IISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iisa/2018/8161/0/08633632",
"title": "Business Management System for Genomics",
"doi": null,
"abstractUrl": "/proceedings-article/iisa/2018/08633632/17D45XwUAKG",
"parentPublication": {
"id": "proceedings/iisa/2018/8161/0",
"title": "2018 9th International Conference on Information, Intelligence, Systems and Applications (IISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09908148",
"title": "GenoREC: A Recommendation System for Interactive Genomics Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09908148/1Hbaqe3xebS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10029921",
"title": "Semi-Automatic Layout Adaptation for Responsive Multiple-View Visualization Design",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10029921/1KmyX4gJuMg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557192",
"title": "Gosling: A Grammar-based Toolkit for Scalable and Interactive Genomics Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557192/1xlw1UFWxDa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09904439",
"articleId": "1H0GgY7IaCk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09908148",
"articleId": "1Hbaqe3xebS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1JilYMC4CQg",
"name": "ttg202301-09904451s1-supp2-3209398.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09904451s1-supp2-3209398.mp4",
"extension": "mp4",
"size": "50.2 MB",
"__typename": "WebExtraType"
},
{
"id": "1JilYT5J1Ty",
"name": "ttg202301-09904451s1-supp1-3209398.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09904451s1-supp1-3209398.pdf",
"extension": "pdf",
"size": "90.9 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1qL5hsvvVkc",
"title": "Feb.",
"year": "2021",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1nYrgS8Y9Py",
"doi": "10.1109/TVCG.2020.3030371",
"abstract": "Matrix visualizations are a useful tool to provide a general overview of a graph's structure. For multivariate graphs, a remaining challenge is to cope with the attributes that are associated with nodes and edges. Addressing this challenge, we propose responsive matrix cells as a focus+context approach for embedding additional interactive views into a matrix. Responsive matrix cells are local zoomable regions of interest that provide auxiliary data exploration and editing facilities for multivariate graphs. They behave responsively by adapting their visual contents to the cell location, the available display space, and the user task. Responsive matrix cells enable users to reveal details about the graph, compare node and edge attributes, and edit data values directly in a matrix without resorting to external views or tools. We report the general design considerations for responsive matrix cells covering the visual and interactive means necessary to support a seamless data exploration and editing. Responsive matrix cells have been implemented in a web-based prototype based on which we demonstrate the utility of our approach. We describe a walk-through for the use case of analyzing a graph of soccer players and report on insights from a preliminary user feedback session.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Matrix visualizations are a useful tool to provide a general overview of a graph's structure. For multivariate graphs, a remaining challenge is to cope with the attributes that are associated with nodes and edges. Addressing this challenge, we propose responsive matrix cells as a focus+context approach for embedding additional interactive views into a matrix. Responsive matrix cells are local zoomable regions of interest that provide auxiliary data exploration and editing facilities for multivariate graphs. They behave responsively by adapting their visual contents to the cell location, the available display space, and the user task. Responsive matrix cells enable users to reveal details about the graph, compare node and edge attributes, and edit data values directly in a matrix without resorting to external views or tools. We report the general design considerations for responsive matrix cells covering the visual and interactive means necessary to support a seamless data exploration and editing. Responsive matrix cells have been implemented in a web-based prototype based on which we demonstrate the utility of our approach. We describe a walk-through for the use case of analyzing a graph of soccer players and report on insights from a preliminary user feedback session.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Matrix visualizations are a useful tool to provide a general overview of a graph's structure. For multivariate graphs, a remaining challenge is to cope with the attributes that are associated with nodes and edges. Addressing this challenge, we propose responsive matrix cells as a focus+context approach for embedding additional interactive views into a matrix. Responsive matrix cells are local zoomable regions of interest that provide auxiliary data exploration and editing facilities for multivariate graphs. They behave responsively by adapting their visual contents to the cell location, the available display space, and the user task. Responsive matrix cells enable users to reveal details about the graph, compare node and edge attributes, and edit data values directly in a matrix without resorting to external views or tools. We report the general design considerations for responsive matrix cells covering the visual and interactive means necessary to support a seamless data exploration and editing. Responsive matrix cells have been implemented in a web-based prototype based on which we demonstrate the utility of our approach. We describe a walk-through for the use case of analyzing a graph of soccer players and report on insights from a preliminary user feedback session.",
"title": "Responsive Matrix Cells: A Focus+Context Approach for Exploring and Editing Multivariate Graphs",
"normalizedTitle": "Responsive Matrix Cells: A Focus+Context Approach for Exploring and Editing Multivariate Graphs",
"fno": "09226461",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Graph Theory",
"Interactive Systems",
"Internet",
"Matrix Algebra",
"Web Based Prototype",
"Interactive Views",
"Visual Contents",
"Auxiliary Data Exploration",
"Matrix Visualizations",
"Editing Multivariate Graphs",
"Focus Context Approach",
"Responsive Matrix Cells",
"Data Visualization",
"Visualization",
"Task Analysis",
"Layout",
"Lenses",
"Tools",
"Encoding",
"Multivariate Graph Visualization",
"Matrix Visualization",
"Focus Context",
"Embedded Visualizations",
"Responsive Visualization",
"Graph Editing"
],
"authors": [
{
"givenName": "Tom",
"surname": "Horak",
"fullName": "Tom Horak",
"affiliation": "Interactive Media LabTechnische Universitat Dresden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Philip",
"surname": "Berger",
"fullName": "Philip Berger",
"affiliation": "Inst. for Visual & Analytic Computing, University of Rostock",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Heidrun",
"surname": "Schumann",
"fullName": "Heidrun Schumann",
"affiliation": "Inst. for Visual & Analytic Computing, University of Rostock",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Raimund",
"surname": "Dachselt",
"fullName": "Raimund Dachselt",
"affiliation": "Interactive Media LabTechnische Universitat Dresden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christian",
"surname": "Tominski",
"fullName": "Christian Tominski",
"affiliation": "Inst. for Visual & Analytic Computing, University of Rostock",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "1644-1654",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cw/2015/9403/0/9403a298",
"title": "Responsive Type - Introducing Self-Adjusting Graphic Characters",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2015/9403a298/12OmNCbU2Xu",
"parentPublication": {
"id": "proceedings/cw/2015/9403/0",
"title": "2015 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2009/4442/0/05457520",
"title": "Single image focus editing",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2009/05457520/12OmNxwWozJ",
"parentPublication": {
"id": "proceedings/iccvw/2009/4442/0",
"title": "2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icndc/2013/3046/0/3046a126",
"title": "Responsive Design: e-Learning Site Transformation",
"doi": null,
"abstractUrl": "/proceedings-article/icndc/2013/3046a126/12OmNzd7c2e",
"parentPublication": {
"id": "proceedings/icndc/2013/3046/0",
"title": "2013 Fourth International Conference on Networking and Distributed Computing (ICNDC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017586",
"title": "EdWordle: Consistency-Preserving Word Cloud Editing",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017586/13rRUIJuxvp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/09/08047300",
"title": "Cluster-Based Visual Abstraction for Multivariate Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2018/09/08047300/13rRUILLkvy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08454344",
"title": "Juniper: A Tree+Table Approach to Multivariate Graph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08454344/17D45WLdYQV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlhcc/2018/4235/0/08506516",
"title": "Expresso: Building Responsive Interfaces with Keyframes",
"doi": null,
"abstractUrl": "/proceedings-article/vlhcc/2018/08506516/17D45WnnFZ1",
"parentPublication": {
"id": "proceedings/vlhcc/2018/4235/0",
"title": "2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a261",
"title": "Visually Exploring Relations Between Structure and Attributes in Multivariate Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a261/1cMFac4YSGs",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552592",
"title": "An Automated Approach to Reasoning About Task-Oriented Insights in Responsive Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552592/1xic0SUdCNO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557792",
"title": "Scope2Screen: Focus+Context Techniques for Pathology Tumor Assessment in Multivariate Image Data",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557792/1xquHxMLASQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222035",
"articleId": "1nTqJ14lTyM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09240072",
"articleId": "1oeZOPx1j0c",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLhmC2Xzgc",
"name": "ttg202102-09226461s1-supp1-3030371.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09226461s1-supp1-3030371.mp4",
"extension": "mp4",
"size": "89.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1qLhZwxtEmA",
"title": "March",
"year": "2021",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1pcOsFJxDYQ",
"doi": "10.1109/TVCG.2020.3041745",
"abstract": "Cartograms are map-based data visualizations in which the area of each map region is proportional to an associated numeric data value (e.g., population or gross domestic product). A cartogram is called contiguous if it conforms to this area principle while also keeping neighboring regions connected. Because of their distorted appearance, contiguous cartograms have been criticized as difficult to read. Some authors have suggested that cartograms may be more legible if they are accompanied by interactive features (e.g., animations, linked brushing, or infotips). We conducted an experiment to evaluate this claim. Participants had to perform visual analysis tasks with interactive and noninteractive contiguous cartograms. The task types covered various aspects of cartogram readability, ranging from elementary lookup tasks to synoptic tasks (i.e., tasks in which participants had to summarize high-level differences between two cartograms). Elementary tasks were carried out equally well with and without interactivity. Synoptic tasks, by contrast, were more difficult without interactive features. With access to interactivity, however, most participants answered even synoptic questions correctly. In a subsequent survey, participants rated the interactive features as “easy to use” and “helpful.” Our study suggests that interactivity has the potential to make contiguous cartograms accessible even for those readers who are unfamiliar with interactive computer graphics or do not have a prior affinity to working with maps. Among the interactive features, animations had the strongest positive effect, so we recommend them as a minimum of interactivity when contiguous cartograms are displayed on a computer screen.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Cartograms are map-based data visualizations in which the area of each map region is proportional to an associated numeric data value (e.g., population or gross domestic product). A cartogram is called contiguous if it conforms to this area principle while also keeping neighboring regions connected. Because of their distorted appearance, contiguous cartograms have been criticized as difficult to read. Some authors have suggested that cartograms may be more legible if they are accompanied by interactive features (e.g., animations, linked brushing, or infotips). We conducted an experiment to evaluate this claim. Participants had to perform visual analysis tasks with interactive and noninteractive contiguous cartograms. The task types covered various aspects of cartogram readability, ranging from elementary lookup tasks to synoptic tasks (i.e., tasks in which participants had to summarize high-level differences between two cartograms). Elementary tasks were carried out equally well with and without interactivity. Synoptic tasks, by contrast, were more difficult without interactive features. With access to interactivity, however, most participants answered even synoptic questions correctly. In a subsequent survey, participants rated the interactive features as “easy to use” and “helpful.” Our study suggests that interactivity has the potential to make contiguous cartograms accessible even for those readers who are unfamiliar with interactive computer graphics or do not have a prior affinity to working with maps. Among the interactive features, animations had the strongest positive effect, so we recommend them as a minimum of interactivity when contiguous cartograms are displayed on a computer screen.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Cartograms are map-based data visualizations in which the area of each map region is proportional to an associated numeric data value (e.g., population or gross domestic product). A cartogram is called contiguous if it conforms to this area principle while also keeping neighboring regions connected. Because of their distorted appearance, contiguous cartograms have been criticized as difficult to read. Some authors have suggested that cartograms may be more legible if they are accompanied by interactive features (e.g., animations, linked brushing, or infotips). We conducted an experiment to evaluate this claim. Participants had to perform visual analysis tasks with interactive and noninteractive contiguous cartograms. The task types covered various aspects of cartogram readability, ranging from elementary lookup tasks to synoptic tasks (i.e., tasks in which participants had to summarize high-level differences between two cartograms). Elementary tasks were carried out equally well with and without interactivity. Synoptic tasks, by contrast, were more difficult without interactive features. With access to interactivity, however, most participants answered even synoptic questions correctly. In a subsequent survey, participants rated the interactive features as “easy to use” and “helpful.” Our study suggests that interactivity has the potential to make contiguous cartograms accessible even for those readers who are unfamiliar with interactive computer graphics or do not have a prior affinity to working with maps. Among the interactive features, animations had the strongest positive effect, so we recommend them as a minimum of interactivity when contiguous cartograms are displayed on a computer screen.",
"title": "Task-Based Effectiveness of Interactive Contiguous Area Cartograms",
"normalizedTitle": "Task-Based Effectiveness of Interactive Contiguous Area Cartograms",
"fno": "09275378",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Cartography",
"Data Visualisation",
"Interactive Systems",
"Table Lookup",
"Interactive Contiguous Area Cartograms",
"Map Region",
"Interactive Features",
"Visual Analysis",
"Cartogram Readability",
"Interactive Computer Graphics",
"Lookup Tasks",
"Map Based Data Visualizations",
"Task Analysis",
"Economic Indicators",
"Data Visualization",
"Animation",
"Switches",
"Software",
"Shape",
"Cartogram",
"Geovisualization",
"Interactive Data Exploration",
"Quantitative Evaluation"
],
"authors": [
{
"givenName": "Ian K.",
"surname": "Duncan",
"fullName": "Ian K. Duncan",
"affiliation": "Yale-NUS College, Singapore, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shi",
"surname": "Tingsheng",
"fullName": "Shi Tingsheng",
"affiliation": "Yale-NUS College, Singapore, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Simon T.",
"surname": "Perrault",
"fullName": "Simon T. Perrault",
"affiliation": "Singapore University of Technology and Design, Singapore, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael T.",
"surname": "Gastner",
"fullName": "Michael T. Gastner",
"affiliation": "Yale-NUS College, Singapore, Singapore",
"__typename": "ArticleAuthorType"
}
],
"replicability": {
"isEnabled": true,
"codeDownloadUrl": "https://github.com/mgastner/effectiveness_of_interactive_cartograms.git",
"codeRepositoryUrl": "https://github.com/mgastner/effectiveness_of_interactive_cartograms",
"__typename": "ArticleReplicabilityType"
},
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "03",
"pubDate": "2021-03-01 00:00:00",
"pubType": "trans",
"pages": "2136-2152",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dac/1981/9999/0/01585397",
"title": "Interactive Graphics for Volume Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1981/01585397/12OmNwtn3pg",
"parentPublication": {
"id": "proceedings/dac/1981/9999/0",
"title": "18th Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vsmm/1997/8150/0/81500109",
"title": "Developing Simulation Techniques for an Interactive Clothing System",
"doi": null,
"abstractUrl": "/proceedings-article/vsmm/1997/81500109/12OmNyNQSJQ",
"parentPublication": {
"id": "proceedings/vsmm/1997/8150/0",
"title": "Virtual Systems and MultiMedia, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/date/2011/4208/0/05763072",
"title": "Supporting non-contiguous processor allocation in mesh-based CMPs using virtual point-to-point links",
"doi": null,
"abstractUrl": "/proceedings-article/date/2011/05763072/12OmNyo1o6M",
"parentPublication": {
"id": "proceedings/date/2011/4208/0",
"title": "Design, Automation & Test in Europe Conference & Exhibition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2012/4814/0/4814a122",
"title": "Interactive Visualization of Mathematics in 3D Web",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2012/4814a122/12OmNzwpU2O",
"parentPublication": {
"id": "proceedings/cw/2012/4814/0",
"title": "2012 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2015/05/mcg2015050076",
"title": "Contiguous Animated Edge-Based Cartograms for Traffic Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2015/05/mcg2015050076/13rRUwI5Uai",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/05/ttg2013050762",
"title": "Interactive Animation of 4D Performance Capture",
"doi": null,
"abstractUrl": "/journal/tg/2013/05/ttg2013050762/13rRUxOve9H",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/05/06687159",
"title": "GazeVis: Interactive 3D Gaze Visualization for Contiguous Cross-Sectional Medical Images",
"doi": null,
"abstractUrl": "/journal/tg/2014/05/06687159/13rRUyfbwqK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-seet/2022/9592/0/959200a158",
"title": "ITSS: Interactive Web-Based Authoring and Playback Integrated Environment for Programming Tutorials",
"doi": null,
"abstractUrl": "/proceedings-article/icse-seet/2022/959200a158/1EaOSuYTnAA",
"parentPublication": {
"id": "proceedings/icse-seet/2022/9592/0",
"title": "2022 IEEE/ACM 44th International Conference on Software Engineering: Software Engineering Education and Training (ICSE-SEET)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09914804",
"title": "Animated Vega-Lite: Unifying Animation with a Grammar of Interactive Graphics",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09914804/1Hmgc5h7Clq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222301",
"title": "The Effectiveness of Interactive Visualization Techniques for Time Navigation of Dynamic Graphs on Large Displays",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222301/1nTrDxA09TG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09149736",
"articleId": "1lNXGaE3KcU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08851280",
"articleId": "1dFoEU28ZG0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLi4AvfvmU",
"name": "ttg202103-09275378s1-tvcg-3041745-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202103-09275378s1-tvcg-3041745-mm.zip",
"extension": "zip",
"size": "32 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyQphh4",
"title": "Aug.",
"year": "2018",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgz9Z",
"doi": "10.1109/TVCG.2017.2734659",
"abstract": "We show how mouse interaction log classification can help visualization toolsmiths understand how their tools are used “in the wild” through an evaluation of MAGI - a cancer genomics visualization tool. Our primary contribution is an evaluation of twelve visual analysis task classifiers, which compares predictions to task inferences made by pairs of genomics and visualization experts. Our evaluation uses common classifiers that are accessible to most visualization evaluators: Z_$k$_Z -nearest neighbors, linear support vector machines, and random forests. By comparing classifier predictions to visual analysis task inferences made by experts, we show that simple automated task classification can have up to 73 percent accuracy and can separate meaningful logs from “junk” logs with up to 91 percent accuracy. Our second contribution is an exploration of common MAGI interaction trends using classification predictions, which expands current knowledge about ecological cancer genomics visualization tasks. Our third contribution is a discussion of how automated task classification can inform iterative tool design. These contributions suggest that mouse interaction log analysis is a viable method for (1) evaluating task requirements of client-side-focused tools, (2) allowing researchers to study experts on larger scales than is typically possible with in-lab observation, and (3) highlighting potential tool evaluation bias.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We show how mouse interaction log classification can help visualization toolsmiths understand how their tools are used “in the wild” through an evaluation of MAGI - a cancer genomics visualization tool. Our primary contribution is an evaluation of twelve visual analysis task classifiers, which compares predictions to task inferences made by pairs of genomics and visualization experts. Our evaluation uses common classifiers that are accessible to most visualization evaluators: $k$ -nearest neighbors, linear support vector machines, and random forests. By comparing classifier predictions to visual analysis task inferences made by experts, we show that simple automated task classification can have up to 73 percent accuracy and can separate meaningful logs from “junk” logs with up to 91 percent accuracy. Our second contribution is an exploration of common MAGI interaction trends using classification predictions, which expands current knowledge about ecological cancer genomics visualization tasks. Our third contribution is a discussion of how automated task classification can inform iterative tool design. These contributions suggest that mouse interaction log analysis is a viable method for (1) evaluating task requirements of client-side-focused tools, (2) allowing researchers to study experts on larger scales than is typically possible with in-lab observation, and (3) highlighting potential tool evaluation bias.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We show how mouse interaction log classification can help visualization toolsmiths understand how their tools are used “in the wild” through an evaluation of MAGI - a cancer genomics visualization tool. Our primary contribution is an evaluation of twelve visual analysis task classifiers, which compares predictions to task inferences made by pairs of genomics and visualization experts. Our evaluation uses common classifiers that are accessible to most visualization evaluators: - -nearest neighbors, linear support vector machines, and random forests. By comparing classifier predictions to visual analysis task inferences made by experts, we show that simple automated task classification can have up to 73 percent accuracy and can separate meaningful logs from “junk” logs with up to 91 percent accuracy. Our second contribution is an exploration of common MAGI interaction trends using classification predictions, which expands current knowledge about ecological cancer genomics visualization tasks. Our third contribution is a discussion of how automated task classification can inform iterative tool design. These contributions suggest that mouse interaction log analysis is a viable method for (1) evaluating task requirements of client-side-focused tools, (2) allowing researchers to study experts on larger scales than is typically possible with in-lab observation, and (3) highlighting potential tool evaluation bias.",
"title": "An Analysis of Automated Visual Analysis Classification: Interactive Visualization Task Inference of Cancer Genomics Domain Experts",
"normalizedTitle": "An Analysis of Automated Visual Analysis Classification: Interactive Visualization Task Inference of Cancer Genomics Domain Experts",
"fno": "07999244",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Mice",
"Tools",
"Cancer",
"Genomics",
"Bioinformatics",
"Classification",
"Task Analysis",
"Visual Analysis",
"Biology Visualization",
"Visualization",
"Cancer Genomics"
],
"authors": [
{
"givenName": "Connor C.",
"surname": "Gramazio",
"fullName": "Connor C. Gramazio",
"affiliation": "Department of Computer Science, Brown University, Providence, RI",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeff",
"surname": "Huang",
"fullName": "Jeff Huang",
"affiliation": "Department of Computer Science, Brown University, Providence, RI",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David H.",
"surname": "Laidlaw",
"fullName": "David H. Laidlaw",
"affiliation": "Department of Computer Science, Brown University, Providence, RI",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2018-08-01 00:00:00",
"pubType": "trans",
"pages": "2270-2283",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2013/5108/0/5108a807",
"title": "A Comparative Analysis of Ensemble Classifiers: Case Studies in Genomics",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2013/5108a807/12OmNrJ11H7",
"parentPublication": {
"id": "proceedings/icdm/2013/5108/0",
"title": "2013 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2016/3834/0/3834a387",
"title": "An Integrative Analysis for Cancer Studies",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2016/3834a387/12OmNyL0Tk7",
"parentPublication": {
"id": "proceedings/bibe/2016/3834/0",
"title": "2016 IEEE 16th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lssa/2006/0277/0/04015823",
"title": "Nanoscale Biomarkers for Cancer Genomics and Protemics",
"doi": null,
"abstractUrl": "/proceedings-article/lssa/2006/04015823/12OmNz5s0ME",
"parentPublication": {
"id": "proceedings/lssa/2006/0277/0",
"title": "2006 IEEE/NLM Life Science Systems and Applications Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2018/7744/0/774400a688",
"title": "A Mobile Tool for Interactive Visualisation of Genomics Data",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2018/774400a688/17D45XdBRSw",
"parentPublication": {
"id": "proceedings/itme/2018/7744/0",
"title": "2018 9th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2017/2588/0/08291937",
"title": "Quantifying and Mitigating Computational Inefficiency of Genomics Data Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2017/08291937/17D45XvMcbl",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2017/2588/0",
"title": "2017 IEEE 19th International Conference on High Performance Computing and Communications; IEEE 15th International Conference on Smart City; IEEE 3rd International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iisa/2018/8161/0/08633632",
"title": "Business Management System for Genomics",
"doi": null,
"abstractUrl": "/proceedings-article/iisa/2018/08633632/17D45XwUAKG",
"parentPublication": {
"id": "proceedings/iisa/2018/8161/0",
"title": "2018 9th International Conference on Information, Intelligence, Systems and Applications (IISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09908148",
"title": "GenoREC: A Recommendation System for Interactive Genomics Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09908148/1Hbaqe3xebS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2020/9574/0/957400a752",
"title": "Predicting Kinase-Substrate Interactions in Medulloblastoma Subtypes",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2020/957400a752/1pBMnu1S5eE",
"parentPublication": {
"id": "proceedings/bibe/2020/9574/0",
"title": "2020 IEEE 20th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557192",
"title": "Gosling: A Grammar-based Toolkit for Scalable and Interactive Genomics Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557192/1xlw1UFWxDa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/01/09633203",
"title": "Lung Cancer Subtype Diagnosis by Fusing Image-Genomics Data and Hybrid Deep Networks",
"doi": null,
"abstractUrl": "/journal/tb/2023/01/09633203/1z0u2hspu0M",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08400453",
"articleId": "13rRUEgarsM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07983006",
"articleId": "13rRUxYrbUO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRF1",
"name": "ttg201808-07999244s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201808-07999244s1.zip",
"extension": "zip",
"size": "328 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04Q",
"title": "Jan.",
"year": "2017",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuAy",
"doi": "10.1109/TVCG.2016.2598789",
"abstract": "Rapid advances in biology demand new tools for more active research dissemination and engaged teaching. This paper presents Synteny Explorer, an interactive visualization application designed to let college students explore genome evolution of mammalian species. The tool visualizes synteny blocks: segments of homologous DNA shared between various extant species that can be traced back or reconstructed in extinct, ancestral species. We take a karyogram-based approach to create an interactive synteny visualization, leading to a more appealing and engaging design for undergraduate-level genome evolution education. For validation, we conduct three user studies: two focused studies on color and animation design choices and a larger study that performs overall system usability testing while comparing our karyogram-based designs with two more common genome mapping representations in an educational context. While existing views communicate the same information, study participants found the interactive, karyogram-based views much easier and likable to use. We additionally discuss feedback from biology and genomics faculty, who judge Synteny Explorer's fitness for use in classrooms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Rapid advances in biology demand new tools for more active research dissemination and engaged teaching. This paper presents Synteny Explorer, an interactive visualization application designed to let college students explore genome evolution of mammalian species. The tool visualizes synteny blocks: segments of homologous DNA shared between various extant species that can be traced back or reconstructed in extinct, ancestral species. We take a karyogram-based approach to create an interactive synteny visualization, leading to a more appealing and engaging design for undergraduate-level genome evolution education. For validation, we conduct three user studies: two focused studies on color and animation design choices and a larger study that performs overall system usability testing while comparing our karyogram-based designs with two more common genome mapping representations in an educational context. While existing views communicate the same information, study participants found the interactive, karyogram-based views much easier and likable to use. We additionally discuss feedback from biology and genomics faculty, who judge Synteny Explorer's fitness for use in classrooms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Rapid advances in biology demand new tools for more active research dissemination and engaged teaching. This paper presents Synteny Explorer, an interactive visualization application designed to let college students explore genome evolution of mammalian species. The tool visualizes synteny blocks: segments of homologous DNA shared between various extant species that can be traced back or reconstructed in extinct, ancestral species. We take a karyogram-based approach to create an interactive synteny visualization, leading to a more appealing and engaging design for undergraduate-level genome evolution education. For validation, we conduct three user studies: two focused studies on color and animation design choices and a larger study that performs overall system usability testing while comparing our karyogram-based designs with two more common genome mapping representations in an educational context. While existing views communicate the same information, study participants found the interactive, karyogram-based views much easier and likable to use. We additionally discuss feedback from biology and genomics faculty, who judge Synteny Explorer's fitness for use in classrooms.",
"title": "Synteny Explorer: An Interactive Visualization Application for Teaching Genome Evolution",
"normalizedTitle": "Synteny Explorer: An Interactive Visualization Application for Teaching Genome Evolution",
"fno": "07539391",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Bioinformatics",
"Biomedical Education",
"Computer Aided Instruction",
"Computer Animation",
"Data Visualisation",
"DNA",
"Educational Institutions",
"Further Education",
"Genomics",
"Teaching",
"Synteny Explorer",
"Interactive Visualization Application",
"Genome Evolution Teaching",
"Homologous DNA",
"Karyogram Based Approach",
"Color Design",
"Animation Design",
"System Usability Testing",
"Biology Faculty",
"Genomic Facult",
"Bioinformatics Visualization",
"Undergraduate Level Genome Evolution Education",
"Genomics",
"Bioinformatics",
"Biological Cells",
"Visualization",
"Animals",
"Vegetation",
"Education",
"Bioinformatic Visualization",
"Education",
"Learning",
"Genome Evolution",
"Chromosome",
"User Study"
],
"authors": [
{
"givenName": "Chris",
"surname": "Bryan",
"fullName": "Chris Bryan",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gregory",
"surname": "Guterman",
"fullName": "Gregory Guterman",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kwan-Liu",
"surname": "Ma",
"fullName": "Kwan-Liu Ma",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Harris",
"surname": "Lewin",
"fullName": "Harris Lewin",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Denis",
"surname": "Larkin",
"fullName": "Denis Larkin",
"affiliation": "Royal Veterinary College, University of London",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jaebum",
"surname": "Kim",
"fullName": "Jaebum Kim",
"affiliation": "Konkuk University, Seoul",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jian",
"surname": "Ma",
"fullName": "Jian Ma",
"affiliation": "Carnegie Mellon University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marta",
"surname": "Farré",
"fullName": "Marta Farré",
"affiliation": "Royal Veterinary College, University of London",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "711-720",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccabs/2016/4199/0/07802791",
"title": "Genome-wide identification and evolutionary analysis of long non-coding RNAs in cereals",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2016/07802791/12OmNAolH5L",
"parentPublication": {
"id": "proceedings/iccabs/2016/4199/0",
"title": "2016 IEEE 6th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2010/8306/0/05706629",
"title": "An automatic procedure to search highly repetitive sequences in genome as fluorescence in situ hybridization probes and its application on Brachypodium distachyon",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2010/05706629/12OmNwvDQrT",
"parentPublication": {
"id": "proceedings/bibm/2010/8306/0",
"title": "2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ijcbs/2009/3739/0/3739a063",
"title": "Genome Evolution in Malaria Parasites: I. Core Genome Components",
"doi": null,
"abstractUrl": "/proceedings-article/ijcbs/2009/3739a063/12OmNxdDFHs",
"parentPublication": {
"id": "proceedings/ijcbs/2009/3739/0",
"title": "2009 International Joint Conference on Bioinformatics, Systems Biology and Intelligent Computing (IJCBS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2014/5669/0/06999377",
"title": "Assessing ancestral genome reconstruction methods by resampling",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2014/06999377/12OmNxu6paK",
"parentPublication": {
"id": "proceedings/bibm/2014/5669/0",
"title": "2014 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2007/1509/0/04375743",
"title": "GPX: A Tool for the Exploration and Visualization of Genome Evolution",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2007/04375743/12OmNy4IEVO",
"parentPublication": {
"id": "proceedings/bibe/2007/1509/0",
"title": "7th IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2017/1324/0/132401a260",
"title": "Whole Genome Phylogenetic Tree Reconstruction Using Colored de Bruijn Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2017/132401a260/12OmNyq0zMR",
"parentPublication": {
"id": "proceedings/bibe/2017/1324/0",
"title": "2017 IEEE 17th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2007/1509/0/04375728",
"title": "Graph Mining of Networks from Genome Biology",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2007/04375728/12OmNzXnNA6",
"parentPublication": {
"id": "proceedings/bibe/2007/1509/0",
"title": "7th IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009060897",
"title": "MizBee: A Multiscale Synteny Browser",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009060897/13rRUEgarsE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009060881",
"title": "ABySS-Explorer: Visualizing Genome Sequence Assemblies",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009060881/13rRUx0xPTM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/09477014",
"title": "Heuristics for Genome Rearrangement Distance With Replicated Genes",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/09477014/1v2LYKjTPgs",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07539285",
"articleId": "13rRUxASuvj",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07539296",
"articleId": "13rRUy3xY8d",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyPQ4uQ",
"title": "Dec.",
"year": "2018",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "14H4WLzSYsE",
"doi": "10.1109/TVCG.2017.2785807",
"abstract": "Unit visualizations are a family of visualizations where every data item is represented by a unique visual mark—a visual unit—during visual encoding. For certain datasets and tasks, unit visualizations can provide more information, better match the user's mental model, and enable novel interactions compared to traditional aggregated visualizations. Current visualization grammars cannot fully describe the unit visualization family. In this paper, we characterize the design space of unit visualizations to derive a grammar that can express them. The resulting grammar is called Atom, and is based on passing data through a series of layout operations that divide the output of previous operations recursively until the size and position of every data point can be determined. We evaluate the expressive power of the grammar by both using it to describe existing unit visualizations, as well as to suggest new unit visualizations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Unit visualizations are a family of visualizations where every data item is represented by a unique visual mark—a visual unit—during visual encoding. For certain datasets and tasks, unit visualizations can provide more information, better match the user's mental model, and enable novel interactions compared to traditional aggregated visualizations. Current visualization grammars cannot fully describe the unit visualization family. In this paper, we characterize the design space of unit visualizations to derive a grammar that can express them. The resulting grammar is called Atom, and is based on passing data through a series of layout operations that divide the output of previous operations recursively until the size and position of every data point can be determined. We evaluate the expressive power of the grammar by both using it to describe existing unit visualizations, as well as to suggest new unit visualizations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Unit visualizations are a family of visualizations where every data item is represented by a unique visual mark—a visual unit—during visual encoding. For certain datasets and tasks, unit visualizations can provide more information, better match the user's mental model, and enable novel interactions compared to traditional aggregated visualizations. Current visualization grammars cannot fully describe the unit visualization family. In this paper, we characterize the design space of unit visualizations to derive a grammar that can express them. The resulting grammar is called Atom, and is based on passing data through a series of layout operations that divide the output of previous operations recursively until the size and position of every data point can be determined. We evaluate the expressive power of the grammar by both using it to describe existing unit visualizations, as well as to suggest new unit visualizations.",
"title": "Atom: A Grammar for Unit Visualizations",
"normalizedTitle": "Atom: A Grammar for Unit Visualizations",
"fno": "08233127",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Visualization",
"Grammar",
"Scalability",
"Layout",
"Clutter",
"Visualization Grammar",
"Unit Visualizations",
"Declarative Specification"
],
"authors": [
{
"givenName": "Deokgun",
"surname": "Park",
"fullName": "Deokgun Park",
"affiliation": "University of Maryland, College Park, MD",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steven M.",
"surname": "Drucker",
"fullName": "Steven M. Drucker",
"affiliation": "Microsoft Research, Redmond, WA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roland",
"surname": "Fernandez",
"fullName": "Roland Fernandez",
"affiliation": "University of Maryland, College Park, MD",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Niklas",
"surname": "Elmqvist",
"fullName": "Niklas Elmqvist",
"affiliation": "Microsoft Research, Redmond, WA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2018-12-01 00:00:00",
"pubType": "trans",
"pages": "3032-3043",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2017/01/07539624",
"title": "Vega-Lite: A Grammar of Interactive Graphics",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539624/13rRUIJuxvn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440063",
"title": "A Declarative Grammar of Flexible Volume Visualization Pipelines",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440063/17D45XacGi1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09916137",
"title": "Revisiting the Design Patterns of Composite Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09916137/1HojAjSAGNq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mipr/2020/4272/0/427200a404",
"title": "Rule-Based Composition Grammar Analysis and Applications",
"doi": null,
"abstractUrl": "/proceedings-article/mipr/2020/427200a404/1mAa1rF37eE",
"parentPublication": {
"id": "proceedings/mipr/2020/4272/0",
"title": "2020 IEEE Conference on Multimedia Information Processing and Retrieval (MIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222038",
"title": "Kyrix-S: Authoring Scalable Scatterplot Visualizations of Big Data",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222038/1nTq1lYLbEY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09234027",
"title": "Gemini: A Grammar and Recommender System for Animated Transitions in Statistical Graphics",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09234027/1o531wbxsSk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09350177",
"title": "Net2Vis – A Visual Grammar for Automatically Generating Publication-Tailored CNN Architecture Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09350177/1r3l972fCk8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09417674",
"title": "Nebula: A Coordinating Grammar of Graphics",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09417674/1taANyFFcmQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557192",
"title": "Gosling: A Grammar-based Toolkit for Scalable and Interactive Genomics Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557192/1xlw1UFWxDa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2021/3335/0/333500a171",
"title": "Atlas: Grammar-based Procedural Generation of Data Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2021/333500a171/1yXulf0d488",
"parentPublication": {
"id": "proceedings/vis/2021/3335/0",
"title": "2021 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08113507",
"articleId": "14H4WNjKxTa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08219711",
"articleId": "14H4WN3R0By",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAolH1e",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tc",
"pubType": "journal",
"volume": "68",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45VsBU46",
"doi": "10.1109/TC.2018.2854880",
"abstract": "Genome sequencing is expected to be the most prolific source of big data in the next decade; millions of whole genome datasets will open new opportunities for biological research and personalized medicine. Genome sequences are abstracted in the form of interesting regions, describing abnormalities of the genome. The parallel execution on the cloud of complex operations for joining and mapping billions of genomic regions is increasingly important. Genome binning, i.e., partitioning of the genome into small-size segments, adapts classic data partitioning methods to genomics; region distributions to bins must reflect operation-specific correctness rules. As a consequence, determining the optimal bin size for such operations is a complex mathematical problem, whose solution requires careful modeling. The main result of this paper is the mathematical formulation and solution of the optimal binning problem for join and map operations in the context of GMQL, a query language over genomic regions; the model is validated by experiments showing its accuracy and sensitivity to the variation of operations' parameters. We also optimize sequences of operations by inheriting the binning between two consecutive operations and we show the deployment of GMQL and the tuning of the proposed model on different cloud computing systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Genome sequencing is expected to be the most prolific source of big data in the next decade; millions of whole genome datasets will open new opportunities for biological research and personalized medicine. Genome sequences are abstracted in the form of interesting regions, describing abnormalities of the genome. The parallel execution on the cloud of complex operations for joining and mapping billions of genomic regions is increasingly important. Genome binning, i.e., partitioning of the genome into small-size segments, adapts classic data partitioning methods to genomics; region distributions to bins must reflect operation-specific correctness rules. As a consequence, determining the optimal bin size for such operations is a complex mathematical problem, whose solution requires careful modeling. The main result of this paper is the mathematical formulation and solution of the optimal binning problem for join and map operations in the context of GMQL, a query language over genomic regions; the model is validated by experiments showing its accuracy and sensitivity to the variation of operations' parameters. We also optimize sequences of operations by inheriting the binning between two consecutive operations and we show the deployment of GMQL and the tuning of the proposed model on different cloud computing systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Genome sequencing is expected to be the most prolific source of big data in the next decade; millions of whole genome datasets will open new opportunities for biological research and personalized medicine. Genome sequences are abstracted in the form of interesting regions, describing abnormalities of the genome. The parallel execution on the cloud of complex operations for joining and mapping billions of genomic regions is increasingly important. Genome binning, i.e., partitioning of the genome into small-size segments, adapts classic data partitioning methods to genomics; region distributions to bins must reflect operation-specific correctness rules. As a consequence, determining the optimal bin size for such operations is a complex mathematical problem, whose solution requires careful modeling. The main result of this paper is the mathematical formulation and solution of the optimal binning problem for join and map operations in the context of GMQL, a query language over genomic regions; the model is validated by experiments showing its accuracy and sensitivity to the variation of operations' parameters. We also optimize sequences of operations by inheriting the binning between two consecutive operations and we show the deployment of GMQL and the tuning of the proposed model on different cloud computing systems.",
"title": "Optimal Binning for Genomics",
"normalizedTitle": "Optimal Binning for Genomics",
"fno": "08410020",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Big Data",
"Biology Computing",
"Cloud Computing",
"Genetics",
"Genomics",
"Optimisation",
"Query Languages",
"Data Partitioning Methods",
"Big Data",
"Biological Research",
"Personalized Medicine",
"GMQL",
"Query Language",
"Cloud Computing Systems",
"Join Map Operations",
"Optimal Binning Problem",
"Optimal Bin Size",
"Operation Specific Correctness Rules",
"Genomics",
"Genome Binning",
"Genomic Regions",
"Genome Sequences",
"Genome Datasets",
"Genome Sequencing",
"Bioinformatics",
"Genomics",
"Biological Cells",
"Data Models",
"DNA",
"Optimization",
"Nickel",
"Big Data Applications",
"Query Processing",
"Genomics",
"Partitioning Algorithms",
"Optimization"
],
"authors": [
{
"givenName": "Andrea",
"surname": "Gulino",
"fullName": "Andrea Gulino",
"affiliation": "Dipartimento di Elettronica ed Informazione e Bioingegneria, Politecnico di Milano, Milano, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Abdulrahman",
"surname": "Kaitoua",
"fullName": "Abdulrahman Kaitoua",
"affiliation": "DFKI Berlin, Berlin, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefano",
"surname": "Ceri",
"fullName": "Stefano Ceri",
"affiliation": "Dipartimento di Elettronica ed Informazione e Bioingegneria, Politecnico di Milano, Milano, Italy",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "125-138",
"year": "2019",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/micai/2015/0322/0/07429439",
"title": "An Algorithm for Bounding Error in Estimates of Genome Copy Number Variations Using SNP Array Technology",
"doi": null,
"abstractUrl": "/proceedings-article/micai/2015/07429439/12OmNBK5m9O",
"parentPublication": {
"id": "proceedings/micai/2015/0322/0",
"title": "2015 Fourteenth Mexican International Conference on Artificial Intelligence (MICAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccabs/2014/5786/0/06863911",
"title": "A new multi-level thresholding algorithm for finding peaks in ChIP-Seq data",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2014/06863911/12OmNvk7JJ8",
"parentPublication": {
"id": "proceedings/iccabs/2014/5786/0",
"title": "2014 IEEE 4th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2014/6227/0/07042506",
"title": "Interactive visual support for metagenomic contig binning",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042506/12OmNzBwGyV",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2017/03/07555354",
"title": "Framework for Supporting Genomic Operations",
"doi": null,
"abstractUrl": "/journal/tc/2017/03/07555354/13rRUwI5U7o",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2010/04/ttb2010040579",
"title": "Rearrangement Phylogeny of Genomes in Contig Form",
"doi": null,
"abstractUrl": "/journal/tb/2010/04/ttb2010040579/13rRUxZ0nZS",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2017/06/07484678",
"title": "Unsupervised Binning of Metagenomic Assembled Contigs Using Improved Fuzzy C-Means Method",
"doi": null,
"abstractUrl": "/journal/tb/2017/06/07484678/13rRUyY28WV",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdcat/2018/5502/0/550200a041",
"title": "ntPack: A Software Package for Big Data in Genomics",
"doi": null,
"abstractUrl": "/proceedings-article/bdcat/2018/550200a041/17D45XDIXRG",
"parentPublication": {
"id": "proceedings/bdcat/2018/5502/0",
"title": "2018 IEEE/ACM 5th International Conference on Big Data Computing Applications and Technologies (BDCAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/massw/2019/4121/0/412100a013",
"title": "Kin Genomic Data Inference Attacks Through Factor Graph",
"doi": null,
"abstractUrl": "/proceedings-article/massw/2019/412100a013/1iTvzOd0Leg",
"parentPublication": {
"id": "proceedings/massw/2019/4121/0",
"title": "2019 IEEE 16th International Conference on Mobile Ad Hoc and Sensor Systems Workshops (MASSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101183",
"title": "Array-based Data Management for Genomics",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101183/1kaMLjEVKWA",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/01/09246292",
"title": "Novel Transformer Networks for Improved Sequence Labeling in genomics",
"doi": null,
"abstractUrl": "/journal/tb/2022/01/09246292/1olDhpPfk5y",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08387485",
"articleId": "17D45VTRozo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08419336",
"articleId": "17D45Xh13tz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1Hbaqe3xebS",
"doi": "10.1109/TVCG.2022.3209407",
"abstract": "Interpretation of genomics data is critically reliant on the application of a wide range of visualization tools. A large number of visualization techniques for genomics data and different analysis tasks pose a significant challenge for analysts: which visualization technique is most likely to help them generate insights into their data? Since genomics analysts typically have limited training in data visualization, their choices are often based on trial and error or guided by technical details, such as data formats that a specific tool can load. This approach prevents them from making effective visualization choices for the many combinations of data types and analysis questions they encounter in their work. Visualization recommendation systems assist non-experts in creating data visualization by recommending appropriate visualizations based on the data and task characteristics. However, existing visualization recommendation systems are not designed to handle domain-specific problems. To address these challenges, we designed GenoREC, a novel visualization recommendation system for genomics. GenoREC enables genomics analysts to select effective visualizations based on a description of their data and analysis tasks. Here, we present the recommendation model that uses a knowledge-based method for choosing appropriate visualizations and a web application that enables analysts to input their requirements, explore recommended visualizations, and export them for their usage. Furthermore, we present the results of two user studies demonstrating that GenoREC recommends visualizations that are both accepted by domain experts and suited to address the given genomics analysis problem. All supplemental materials are available at <uri>https://osf.io/y73pt/</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Interpretation of genomics data is critically reliant on the application of a wide range of visualization tools. A large number of visualization techniques for genomics data and different analysis tasks pose a significant challenge for analysts: which visualization technique is most likely to help them generate insights into their data? Since genomics analysts typically have limited training in data visualization, their choices are often based on trial and error or guided by technical details, such as data formats that a specific tool can load. This approach prevents them from making effective visualization choices for the many combinations of data types and analysis questions they encounter in their work. Visualization recommendation systems assist non-experts in creating data visualization by recommending appropriate visualizations based on the data and task characteristics. However, existing visualization recommendation systems are not designed to handle domain-specific problems. To address these challenges, we designed GenoREC, a novel visualization recommendation system for genomics. GenoREC enables genomics analysts to select effective visualizations based on a description of their data and analysis tasks. Here, we present the recommendation model that uses a knowledge-based method for choosing appropriate visualizations and a web application that enables analysts to input their requirements, explore recommended visualizations, and export them for their usage. Furthermore, we present the results of two user studies demonstrating that GenoREC recommends visualizations that are both accepted by domain experts and suited to address the given genomics analysis problem. All supplemental materials are available at <uri>https://osf.io/y73pt/</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Interpretation of genomics data is critically reliant on the application of a wide range of visualization tools. A large number of visualization techniques for genomics data and different analysis tasks pose a significant challenge for analysts: which visualization technique is most likely to help them generate insights into their data? Since genomics analysts typically have limited training in data visualization, their choices are often based on trial and error or guided by technical details, such as data formats that a specific tool can load. This approach prevents them from making effective visualization choices for the many combinations of data types and analysis questions they encounter in their work. Visualization recommendation systems assist non-experts in creating data visualization by recommending appropriate visualizations based on the data and task characteristics. However, existing visualization recommendation systems are not designed to handle domain-specific problems. To address these challenges, we designed GenoREC, a novel visualization recommendation system for genomics. GenoREC enables genomics analysts to select effective visualizations based on a description of their data and analysis tasks. Here, we present the recommendation model that uses a knowledge-based method for choosing appropriate visualizations and a web application that enables analysts to input their requirements, explore recommended visualizations, and export them for their usage. Furthermore, we present the results of two user studies demonstrating that GenoREC recommends visualizations that are both accepted by domain experts and suited to address the given genomics analysis problem. All supplemental materials are available at https://osf.io/y73pt/.",
"title": "GenoREC: A Recommendation System for Interactive Genomics Data Visualization",
"normalizedTitle": "GenoREC: A Recommendation System for Interactive Genomics Data Visualization",
"fno": "09908148",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Genomics",
"Recommender Systems",
"Appropriate Visualizations",
"Data Formats",
"Data Types",
"Different Analysis Tasks",
"Effective Visualization Choices",
"Effective Visualizations",
"Existing Visualization Recommendation Systems",
"Genomics Analysts",
"Geno REC",
"Given Genomics Analysis Problem",
"Interactive Genomics Data Visualization",
"Recommendation Model",
"Recommended Visualizations",
"Visualization Recommendation System",
"Visualization Technique",
"Visualization Tools",
"Data Visualization",
"Genomics",
"Bioinformatics",
"Task Analysis",
"Recommender Systems",
"Visualization",
"Knowledge Based Systems",
"Genomics",
"Visualization",
"Recommendation Systems",
"Data",
"Tasks"
],
"authors": [
{
"givenName": "Aditeya",
"surname": "Pandey",
"fullName": "Aditeya Pandey",
"affiliation": "Northeastern University, MA, US",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sehi",
"surname": "L'Yi",
"fullName": "Sehi L'Yi",
"affiliation": "Harvard Medical School, MA, US",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qianwen",
"surname": "Wang",
"fullName": "Qianwen Wang",
"affiliation": "Harvard Medical School, MA, US",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michelle A.",
"surname": "Borkin",
"fullName": "Michelle A. Borkin",
"affiliation": "Northeastern University, MA, US",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nils",
"surname": "Gehlenborg",
"fullName": "Nils Gehlenborg",
"affiliation": "Harvard Medical School, MA, US",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "570-580",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dcc/2017/6721/0/07923729",
"title": "Optimize Genomics Data Compression with Hardware Accelerator",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2017/07923729/12OmNBghtsc",
"parentPublication": {
"id": "proceedings/dcc/2017/6721/0",
"title": "2017 Data Compression Conference (DCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2014/5666/0/07004392",
"title": "Big data in genomics: An overview",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2014/07004392/12OmNxH9XfX",
"parentPublication": {
"id": "proceedings/big-data/2014/5666/0",
"title": "2014 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/08/07999244",
"title": "An Analysis of Automated Visual Analysis Classification: Interactive Visualization Task Inference of Cancer Genomics Domain Experts",
"doi": null,
"abstractUrl": "/journal/tg/2018/08/07999244/13rRUNvgz9Z",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539391",
"title": "Synteny Explorer: An Interactive Visualization Application for Teaching Genome Evolution",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539391/13rRUxASuAy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2018/7744/0/774400a688",
"title": "A Mobile Tool for Interactive Visualisation of Genomics Data",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2018/774400a688/17D45XdBRSw",
"parentPublication": {
"id": "proceedings/itme/2018/7744/0",
"title": "2018 9th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904451",
"title": "Multi-View Design Patterns and Responsive Visualization for Genomics Data",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904451/1H1gfVbEsiA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trex/2022/9356/0/935600a016",
"title": "Kicking Analysts Out of the Meeting Room: Supporting Future Data-driven Decision Making with Intelligent Interactive Visualization Systems",
"doi": null,
"abstractUrl": "/proceedings-article/trex/2022/935600a016/1J9BlQvVmdq",
"parentPublication": {
"id": "proceedings/trex/2022/9356/0",
"title": "2022 IEEE Workshop on TRust and EXpertise in Visual Analytics (TREX)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a385",
"title": "InstaCircos: a Web Application for Fast and Interactive Circular Visualization of Large Genomic Data (Work in Progress)",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a385/1rSRcelsx5m",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09524484",
"title": "GEViTRec: Data Reconnaissance Through Recommendation Using a Domain-Specific Visualization Prevalence Design Space",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09524484/1wpqlzOa8G4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557192",
"title": "Gosling: A Grammar-based Toolkit for Scalable and Interactive Genomics Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557192/1xlw1UFWxDa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09904451",
"articleId": "1H1gfVbEsiA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09903280",
"articleId": "1GZojkUkomI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1JilYrMPm8M",
"name": "ttg202301-09908148s1-tvcg-3209407-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09908148s1-tvcg-3209407-mm.zip",
"extension": "zip",
"size": "37.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1Hmgc5h7Clq",
"doi": "10.1109/TVCG.2022.3209369",
"abstract": "We present Animated Vega-Lite, a set of extensions to Vega-Lite that model animated visualizations as time-varying data queries. In contrast to alternate approaches for specifying animated visualizations, which prize a highly expressive design space, Animated Vega-Lite prioritizes unifying animation with the language's existing abstractions for static and interactive visualizations to enable authors to smoothly move between or combine these modalities. Thus, to compose animation with static visualizations, we represent time as an <italic>encoding channel</italic>. Time encodings map a data field to animation keyframes, providing a lightweight specification for animations without interaction. To compose animation and interaction, we also represent time as an <italic>event stream</italic>; Vega-Lite selections, which provide dynamic data queries, are now driven not only by input events but by timer ticks as well. We evaluate the expressiveness of our approach through a gallery of diverse examples that demonstrate coverage over taxonomies of both interaction and animation. We also critically reflect on the conceptual affordances and limitations of our contribution by interviewing five expert developers of existing animation grammars. These reflections highlight the key motivating role of in-the-wild examples, and identify three central tradeoffs: the language design process, the types of animated transitions supported, and how the systems model keyframes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present Animated Vega-Lite, a set of extensions to Vega-Lite that model animated visualizations as time-varying data queries. In contrast to alternate approaches for specifying animated visualizations, which prize a highly expressive design space, Animated Vega-Lite prioritizes unifying animation with the language's existing abstractions for static and interactive visualizations to enable authors to smoothly move between or combine these modalities. Thus, to compose animation with static visualizations, we represent time as an <italic>encoding channel</italic>. Time encodings map a data field to animation keyframes, providing a lightweight specification for animations without interaction. To compose animation and interaction, we also represent time as an <italic>event stream</italic>; Vega-Lite selections, which provide dynamic data queries, are now driven not only by input events but by timer ticks as well. We evaluate the expressiveness of our approach through a gallery of diverse examples that demonstrate coverage over taxonomies of both interaction and animation. We also critically reflect on the conceptual affordances and limitations of our contribution by interviewing five expert developers of existing animation grammars. These reflections highlight the key motivating role of in-the-wild examples, and identify three central tradeoffs: the language design process, the types of animated transitions supported, and how the systems model keyframes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present Animated Vega-Lite, a set of extensions to Vega-Lite that model animated visualizations as time-varying data queries. In contrast to alternate approaches for specifying animated visualizations, which prize a highly expressive design space, Animated Vega-Lite prioritizes unifying animation with the language's existing abstractions for static and interactive visualizations to enable authors to smoothly move between or combine these modalities. Thus, to compose animation with static visualizations, we represent time as an encoding channel. Time encodings map a data field to animation keyframes, providing a lightweight specification for animations without interaction. To compose animation and interaction, we also represent time as an event stream; Vega-Lite selections, which provide dynamic data queries, are now driven not only by input events but by timer ticks as well. We evaluate the expressiveness of our approach through a gallery of diverse examples that demonstrate coverage over taxonomies of both interaction and animation. We also critically reflect on the conceptual affordances and limitations of our contribution by interviewing five expert developers of existing animation grammars. These reflections highlight the key motivating role of in-the-wild examples, and identify three central tradeoffs: the language design process, the types of animated transitions supported, and how the systems model keyframes.",
"title": "Animated Vega-Lite: Unifying Animation with a Grammar of Interactive Graphics",
"normalizedTitle": "Animated Vega-Lite: Unifying Animation with a Grammar of Interactive Graphics",
"fno": "09914804",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Animation",
"Data Visualisation",
"Graphical User Interfaces",
"Interactive Systems",
"Query Processing",
"Animated Transitions",
"Animated Vega Lite",
"Animated Visualizations",
"Animation Grammars",
"Animation Keyframes",
"Data Field Mapping",
"Dynamic Data Queries",
"Encoding Channel",
"Event Stream",
"Expressive Design Space",
"Interactive Visualizations",
"Language Design Process",
"Static Visualizations",
"Time Encodings",
"Time Varying Data Queries",
"Vega Lite Selections",
"Animation",
"Data Visualization",
"Encoding",
"Grammar",
"Taxonomy",
"Switches",
"Facial Animation",
"Information Visualization",
"Animation",
"Interaction",
"Toolkits",
"Systems",
"Declarative Specification"
],
"authors": [
{
"givenName": "Jonathan",
"surname": "Zong",
"fullName": "Jonathan Zong",
"affiliation": "MIT CSAIL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Josh",
"surname": "Pollock",
"fullName": "Josh Pollock",
"affiliation": "MIT CSAIL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dylan",
"surname": "Wootton",
"fullName": "Dylan Wootton",
"affiliation": "MIT CSAIL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arvind",
"surname": "Satyanarayan",
"fullName": "Arvind Satyanarayan",
"affiliation": "MIT CSAIL, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "149-159",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/smi/2003/1845/0/18450184",
"title": "Controlled Metamorphosis of Animated Objects",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2003/18450184/12OmNwIYZEg",
"parentPublication": {
"id": "proceedings/smi/2003/1845/0",
"title": "Shape Modeling and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2018/1424/0/142401a235",
"title": "An Evolutionary Signature for Animated Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2018/142401a235/12OmNxGAL6M",
"parentPublication": {
"id": "proceedings/pacificvis/2018/1424/0",
"title": "2018 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nicoint/2018/6909/0/690901a088",
"title": "Animated KUI",
"doi": null,
"abstractUrl": "/proceedings-article/nicoint/2018/690901a088/13bd1sx4Zt7",
"parentPublication": {
"id": "proceedings/nicoint/2018/6909/0",
"title": "2018 Nicograph International (NicoInt)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539624",
"title": "Vega-Lite: A Grammar of Interactive Graphics",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539624/13rRUIJuxvn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/03/v0562",
"title": "High Resolution Animated Scenes from Stills",
"doi": null,
"abstractUrl": "/journal/tg/2007/03/v0562/13rRUNvya9g",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192704",
"title": "Reactive Vega: A Streaming Dataflow Architecture for Declarative Interactive Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192704/13rRUx0gev9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/05/08744242",
"title": "Data2Vis: Automatic Generation of Data Visualizations Using Sequence-to-Sequence Recurrent Neural Networks",
"doi": null,
"abstractUrl": "/magazine/cg/2019/05/08744242/1cFV5domibu",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222342",
"title": "NL4DV: A Toolkit for Generating Analytic Specifications for Data Visualization from Natural Language Queries",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222342/1nTqOo5NR3G",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09234027",
"title": "Gemini: A Grammar and Recommender System for Animated Transitions in Statistical Graphics",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09234027/1o531wbxsSk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a141",
"title": "Improving Engagement of Animated Visualization with Visual Foreshadowing",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a141/1qRNNrMSIrm",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09903293",
"articleId": "1GZon61xLpK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09904438",
"articleId": "1H1goFeoVgY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Jgw9h8q7JK",
"name": "ttg202301-09914804s1-tvcg-3209369-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09914804s1-tvcg-3209369-mm.zip",
"extension": "zip",
"size": "144 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyGtjf5",
"title": "April",
"year": "2019",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "181W9pIePIs",
"doi": "10.1109/TVCG.2018.2817557",
"abstract": "We present the design and evaluation of an integrated problem solving environment for cancer therapy analysis. The environment intertwines a statistical martingale model and a K Nearest Neighbor approach with visual encodings, including novel interactive nomograms, in order to compute and explain a patient's probability of survival as a function of similar patient results. A coordinated views paradigm enables exploration of the multivariate, heterogeneous and few-valued data from a large head and neck cancer repository. A visual scaffolding approach further enables users to build from familiar representations to unfamiliar ones. Evaluation with domain experts show how this visualization approach and set of streamlined workflows enable the systematic and precise analysis of a patient prognosis in the context of cohorts of similar patients. We describe the design lessons learned from this successful, multi-site remote collaboration.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present the design and evaluation of an integrated problem solving environment for cancer therapy analysis. The environment intertwines a statistical martingale model and a K Nearest Neighbor approach with visual encodings, including novel interactive nomograms, in order to compute and explain a patient's probability of survival as a function of similar patient results. A coordinated views paradigm enables exploration of the multivariate, heterogeneous and few-valued data from a large head and neck cancer repository. A visual scaffolding approach further enables users to build from familiar representations to unfamiliar ones. Evaluation with domain experts show how this visualization approach and set of streamlined workflows enable the systematic and precise analysis of a patient prognosis in the context of cohorts of similar patients. We describe the design lessons learned from this successful, multi-site remote collaboration.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present the design and evaluation of an integrated problem solving environment for cancer therapy analysis. The environment intertwines a statistical martingale model and a K Nearest Neighbor approach with visual encodings, including novel interactive nomograms, in order to compute and explain a patient's probability of survival as a function of similar patient results. A coordinated views paradigm enables exploration of the multivariate, heterogeneous and few-valued data from a large head and neck cancer repository. A visual scaffolding approach further enables users to build from familiar representations to unfamiliar ones. Evaluation with domain experts show how this visualization approach and set of streamlined workflows enable the systematic and precise analysis of a patient prognosis in the context of cohorts of similar patients. We describe the design lessons learned from this successful, multi-site remote collaboration.",
"title": "Precision Risk Analysis of Cancer Therapy with Interactive Nomograms and Survival Plots",
"normalizedTitle": "Precision Risk Analysis of Cancer Therapy with Interactive Nomograms and Survival Plots",
"fno": "08320386",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Cancer",
"Data Visualisation",
"Groupware",
"Medical Computing",
"Probability",
"Problem Solving",
"Radiation Therapy",
"Risk Analysis",
"Statistical Analysis",
"User Interfaces",
"Precision Risk Analysis",
"Integrated Problem Solving Environment",
"Cancer Therapy Analysis",
"Statistical Martingale Model",
"K Nearest Neighbor Approach",
"Visual Encodings",
"Novel Interactive Nomograms",
"Similar Patient Results",
"Coordinated Views Paradigm",
"Multivariate Valued Data",
"Heterogeneous Valued Data",
"Few Valued Data",
"Neck Cancer Repository",
"Visual Scaffolding Approach",
"Familiar Representations",
"Unfamiliar Ones",
"Visualization Approach",
"Systematic Analysis",
"Precise Analysis",
"Patient Prognosis",
"Cancer",
"Visualization",
"Collaboration",
"Medical Treatment",
"Encoding",
"Head",
"Neck",
"Visual Analytics",
"Precision Medicine",
"Design Studies",
"Nomograms",
"Parallel Coordinate Plots",
"Activity Centered Design"
],
"authors": [
{
"givenName": "G. Elisabeta",
"surname": "Marai",
"fullName": "G. Elisabeta Marai",
"affiliation": "University of Illinois at Chicago, Chicago, IL",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chihua",
"surname": "Ma",
"fullName": "Chihua Ma",
"affiliation": "University of Illinois at Chicago, Chicago, IL",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrew Thomas",
"surname": "Burks",
"fullName": "Andrew Thomas Burks",
"affiliation": "University of Illinois at Chicago, Chicago, IL",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Filippo",
"surname": "Pellolio",
"fullName": "Filippo Pellolio",
"affiliation": "University of Illinois at Chicago, Chicago, IL",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guadalupe",
"surname": "Canahuate",
"fullName": "Guadalupe Canahuate",
"affiliation": "Department of Computer Science, University of Iowa, Iowa City, IA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David M.",
"surname": "Vock",
"fullName": "David M. Vock",
"affiliation": "Bioinformatics and Statistics Department, University of Minnesota, Minneapolis, MN",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Abdallah S. R.",
"surname": "Mohamed",
"fullName": "Abdallah S. R. Mohamed",
"affiliation": "University of Texas, Houston, TX",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Clifton David",
"surname": "Fuller",
"fullName": "Clifton David Fuller",
"affiliation": "University of Texas, Houston, TX",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "04",
"pubDate": "2019-04-01 00:00:00",
"pubType": "trans",
"pages": "1732-1745",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ichi/2016/6117/0/6117a504",
"title": "Serenity: A Low-Cost and Patient-Guided Mobile Virtual Reality Intervention for Cancer Coping",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2016/6117a504/12OmNAkWvD4",
"parentPublication": {
"id": "proceedings/ichi/2016/6117/0",
"title": "2016 IEEE International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iri/2015/6656/0/6656a229",
"title": "Building an Effective Classification Model for Breast Cancer Patient Response Data",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2015/6656a229/12OmNApLGsB",
"parentPublication": {
"id": "proceedings/iri/2015/6656/0",
"title": "2015 IEEE International Conference on Information Reuse and Integration (IRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2018/6217/0/247100a315",
"title": "Mutation Analysis of Second Primary Tumors in the Head and Neck Cancer by Next Generation Sequencing",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2018/247100a315/17D45VsBTTU",
"parentPublication": {
"id": "proceedings/bibe/2018/6217/0",
"title": "2018 IEEE 18th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2018/7744/0/774400a217",
"title": "Intensity Modulated Arc Therapy (IMAT) vs. IMRT in Glottic Cancer: A Treatment Planning Comparison on Conventional Linac",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2018/774400a217/17D45WWzW5p",
"parentPublication": {
"id": "proceedings/itme/2018/7744/0",
"title": "2018 9th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2018/5488/0/08621534",
"title": "An Efficient Survival Multifactor Dimensionality Reduction Method for Detecting Gene-Gene Interactions of Lung Cancer Onset Age",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2018/08621534/17D45WXIkB0",
"parentPublication": {
"id": "proceedings/bibm/2018/5488/0",
"title": "2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmbs/2022/6770/0/677000a422",
"title": "Subgroup Discovery Analysis of Treatment Patterns in Lung Cancer Patients",
"doi": null,
"abstractUrl": "/proceedings-article/cmbs/2022/677000a422/1GhW7eRplcY",
"parentPublication": {
"id": "proceedings/cmbs/2022/6770/0",
"title": "2022 IEEE 35th International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2019/2286/0/228600a067",
"title": "BD2Decide: Big Data and Models for Personalized Head and Neck Cancer Decision Support",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2019/228600a067/1cdO0Rb5zTW",
"parentPublication": {
"id": "proceedings/cbms/2019/2286/0",
"title": "2019 IEEE 32nd International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2019/2286/0/228600a112",
"title": "DESIREE DEMO - A Web-Based Software Ecosystem for the Personalized, Collaborative and Multidisciplinary Management of Primary Breast Cancer",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2019/228600a112/1cdO2SoKkww",
"parentPublication": {
"id": "proceedings/cbms/2019/2286/0",
"title": "2019 IEEE 32nd International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2020/6215/0/09313509",
"title": "A multi-task learning method for analyzing microbiota as cancer immunotherapy signal",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313509/1qmg4AVFi80",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555227",
"title": "THALIS: Human-Machine Analysis of Longitudinal Symptoms in Cancer Therapy",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555227/1xjR1zzHe6s",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08327516",
"articleId": "181W9moJfxQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08323196",
"articleId": "17YCN5yqdZm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "181W9pUJbrl",
"name": "ttg201904-08320386s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201904-08320386s1.zip",
"extension": "zip",
"size": "21 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvSbBJT",
"title": "Sept.-Oct.",
"year": "2016",
"issueNum": "05",
"idPrefix": "it",
"pubType": "magazine",
"volume": "18",
"label": "Sept.-Oct.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xPxC",
"doi": "10.1109/MITP.2016.78",
"abstract": "Business data in geographic maps, called data maps, can be displayed via business intelligence dashboards. An important emerging feature is the use of background maps that overlap with existing data maps. Here, the authors examine the usefulness of background maps in dashboards and investigate how much cognitive effort users put in when they use dashboards with background maps as compared to dashboards without them. To test the extent of cognitive effort, the authors conducted an eye-tracking study in which users performed a decision-making task with maps in dashboards. In a separate study, users were asked directly about the mental effort required to perform tasks with the dashboards. Both studies identified that when users use background maps, they required less cognitive effort than users who use dashboards in which the information on the background map is represented in another form, such as a bar chart.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Business data in geographic maps, called data maps, can be displayed via business intelligence dashboards. An important emerging feature is the use of background maps that overlap with existing data maps. Here, the authors examine the usefulness of background maps in dashboards and investigate how much cognitive effort users put in when they use dashboards with background maps as compared to dashboards without them. To test the extent of cognitive effort, the authors conducted an eye-tracking study in which users performed a decision-making task with maps in dashboards. In a separate study, users were asked directly about the mental effort required to perform tasks with the dashboards. Both studies identified that when users use background maps, they required less cognitive effort than users who use dashboards in which the information on the background map is represented in another form, such as a bar chart.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Business data in geographic maps, called data maps, can be displayed via business intelligence dashboards. An important emerging feature is the use of background maps that overlap with existing data maps. Here, the authors examine the usefulness of background maps in dashboards and investigate how much cognitive effort users put in when they use dashboards with background maps as compared to dashboards without them. To test the extent of cognitive effort, the authors conducted an eye-tracking study in which users performed a decision-making task with maps in dashboards. In a separate study, users were asked directly about the mental effort required to perform tasks with the dashboards. Both studies identified that when users use background maps, they required less cognitive effort than users who use dashboards in which the information on the background map is represented in another form, such as a bar chart.",
"title": "Displaying Background Maps in Business Intelligence Dashboards",
"normalizedTitle": "Displaying Background Maps in Business Intelligence Dashboards",
"fno": "mit2016050058",
"hasPdf": true,
"idPrefix": "it",
"keywords": [
"Sociology",
"Statistics",
"Business",
"Decision Making",
"Competitive Intelligence",
"Visualization",
"Data Analysis",
"Visualization",
"Dashboard",
"Eye Tracking",
"Cognitive Overload",
"Data Maps",
"Geographic Information Systems"
],
"authors": [
{
"givenName": "Palash",
"surname": "Bera",
"fullName": "Palash Bera",
"affiliation": "Saint Louis University, Missouri",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Louis-Philippe",
"surname": "Sirois",
"fullName": "Louis-Philippe Sirois",
"affiliation": "Université Laval, Quebec",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2016-09-01 00:00:00",
"pubType": "mags",
"pages": "58-65",
"year": "2016",
"issn": "1520-9202",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ares/2014/4223/0/4223a152",
"title": "Privacy Dashboards: Reconciling Data-Driven Business Models and Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/ares/2014/4223a152/12OmNAoUTnM",
"parentPublication": {
"id": "proceedings/ares/2014/4223/0",
"title": "2014 Ninth International Conference on Availability, Reliability and Security (ARES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2014/6572/0/6572a291",
"title": "Synthesis of Cognitive Maps and Applications",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2014/6572a291/12OmNBIFmsC",
"parentPublication": {
"id": "proceedings/ictai/2014/6572/0",
"title": "2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460347",
"title": "Nonparametric on-line background generation for surveillance video",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460347/12OmNxHryiC",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/skg/2015/9808/0/9808a180",
"title": "Population of Metallic Materials Background Knowledge Base Based on Yago",
"doi": null,
"abstractUrl": "/proceedings-article/skg/2015/9808a180/12OmNy2rS9r",
"parentPublication": {
"id": "proceedings/skg/2015/9808/0",
"title": "2015 11th International Conference on Semantics, Knowledge and Grids (SKG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmla/2016/6167/0/07838151",
"title": "Consensus Clustering: A Resampling-Based Method for Building Radiation Hybrid Maps",
"doi": null,
"abstractUrl": "/proceedings-article/icmla/2016/07838151/12OmNybfr2S",
"parentPublication": {
"id": "proceedings/icmla/2016/6167/0",
"title": "2016 15th IEEE International Conference on Machine Learning and Applications (ICMLA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2014/05/06827170",
"title": "Reliable Radiation Hybrid Maps: An Efficient Scalable Clustering-Based Approach",
"doi": null,
"abstractUrl": "/journal/tb/2014/05/06827170/13rRUwInvdx",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07536212",
"title": "Surprise! Bayesian Weighting for De-Biasing Thematic Maps",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07536212/13rRUxly9dY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acompa/2022/6171/0/617100a020",
"title": "Toward Code Generation for Process-oriented, Role-based Dashboards : An Example of Digital Advertising in Vietnam",
"doi": null,
"abstractUrl": "/proceedings-article/acompa/2022/617100a020/1JNqOqDO1bO",
"parentPublication": {
"id": "proceedings/acompa/2022/6171/0",
"title": "2022 International Conference on Advanced Computing and Analytics (ACOMPA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/espre/2020/8346/0/834600a001",
"title": "Requirement and Quality Models for Privacy Dashboards",
"doi": null,
"abstractUrl": "/proceedings-article/espre/2020/834600a001/1nV93smsv9m",
"parentPublication": {
"id": "proceedings/espre/2020/8346/0",
"title": "2020 IEEE 7th International Workshop on Evolving Security & Privacy Requirements Engineering (ESPRE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/conisoft/2021/4361/0/436100a034",
"title": "Information Visualization In Adaptable Dashboards For Smart Cities: A Systematic Review",
"doi": null,
"abstractUrl": "/proceedings-article/conisoft/2021/436100a034/1zHIifIcW4w",
"parentPublication": {
"id": "proceedings/conisoft/2021/4361/0",
"title": "2021 9th International Conference in Software Engineering Research and Innovation (CONISOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mit2016050057",
"articleId": "13rRUxDItdx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mit2016050066",
"articleId": "13rRUx0xPrL",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxVV627",
"title": "July-Aug.",
"year": "2013",
"issueNum": "04",
"idPrefix": "so",
"pubType": "magazine",
"volume": "30",
"label": "July-Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxAAT5z",
"doi": "10.1109/MS.2013.66",
"abstract": "Prominent technology companies including IBM, Microsoft, and Google have embraced an analytics-driven culture to help improve their decision making. Analytics aim to help practitioners answer questions critical to their projects, such as \"Are we on track to deliver the next release on schedule?\" and \"Of the recent features added, which are the most prone to defects?\" by providing fact-based views about projects. Analytic results are often quantitative in nature, presenting data as graphical dashboards with reports and charts. Although current dashboards are often geared toward project managers, they aren't well suited to help individual developers. Mozilla developer interviews show that developers face challenges maintaining a global understanding of the tasks they're working on and that they desire improved support for situational awareness, a form of qualitative analytics that's difficult to achieve with current quantitative tools. This article motivates the need for qualitative dashboards designed to improve developers' situational awareness by providing task tracking and prioritizing capabilities, presenting insights on the workloads of others, listing individual actions, and providing custom views to help manage workload while performing day-to-day development tasks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Prominent technology companies including IBM, Microsoft, and Google have embraced an analytics-driven culture to help improve their decision making. Analytics aim to help practitioners answer questions critical to their projects, such as \"Are we on track to deliver the next release on schedule?\" and \"Of the recent features added, which are the most prone to defects?\" by providing fact-based views about projects. Analytic results are often quantitative in nature, presenting data as graphical dashboards with reports and charts. Although current dashboards are often geared toward project managers, they aren't well suited to help individual developers. Mozilla developer interviews show that developers face challenges maintaining a global understanding of the tasks they're working on and that they desire improved support for situational awareness, a form of qualitative analytics that's difficult to achieve with current quantitative tools. This article motivates the need for qualitative dashboards designed to improve developers' situational awareness by providing task tracking and prioritizing capabilities, presenting insights on the workloads of others, listing individual actions, and providing custom views to help manage workload while performing day-to-day development tasks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Prominent technology companies including IBM, Microsoft, and Google have embraced an analytics-driven culture to help improve their decision making. Analytics aim to help practitioners answer questions critical to their projects, such as \"Are we on track to deliver the next release on schedule?\" and \"Of the recent features added, which are the most prone to defects?\" by providing fact-based views about projects. Analytic results are often quantitative in nature, presenting data as graphical dashboards with reports and charts. Although current dashboards are often geared toward project managers, they aren't well suited to help individual developers. Mozilla developer interviews show that developers face challenges maintaining a global understanding of the tasks they're working on and that they desire improved support for situational awareness, a form of qualitative analytics that's difficult to achieve with current quantitative tools. This article motivates the need for qualitative dashboards designed to improve developers' situational awareness by providing task tracking and prioritizing capabilities, presenting insights on the workloads of others, listing individual actions, and providing custom views to help manage workload while performing day-to-day development tasks.",
"title": "Developer Dashboards: The Need for Qualitative Analytics",
"normalizedTitle": "Developer Dashboards: The Need for Qualitative Analytics",
"fno": "mso2013040046",
"hasPdf": true,
"idPrefix": "so",
"keywords": [
"Software Quality",
"Software Development",
"Computer Bugs",
"Market Research",
"Software Metrics",
"Software Measurement",
"Software Reliability",
"Analytical Models",
"Situational Awareness",
"Developer Dashboards",
"Qualitative Analytics",
"Qualitative Dashboards"
],
"authors": [
{
"givenName": "Olga",
"surname": "Baysal",
"fullName": "Olga Baysal",
"affiliation": "University of Waterloo",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Reid",
"surname": "Holmes",
"fullName": "Reid Holmes",
"affiliation": "University of Waterloo",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael W.",
"surname": "Godfrey",
"fullName": "Michael W. Godfrey",
"affiliation": "University of Waterloo",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2013-07-01 00:00:00",
"pubType": "mags",
"pages": "46-52",
"year": "2013",
"issn": "0740-7459",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icalt/2013/5009/0/5009a412",
"title": "Towards Portable Learning Analytics Dashboards",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2013/5009a412/12OmNB9bvgh",
"parentPublication": {
"id": "proceedings/icalt/2013/5009/0",
"title": "2013 IEEE 13th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031598",
"title": "Aeonium: Visual analytics to support collaborative qualitative coding",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031598/12OmNvwTGDl",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2015/9926/0/07363887",
"title": "Developer toolchains for large-scale analytics: Two case studies",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2015/07363887/12OmNwDACr7",
"parentPublication": {
"id": "proceedings/big-data/2015/9926/0",
"title": "2015 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2016/5670/0/5670a041",
"title": "Enhancing the Professional Vision of Teachers: A Physiological Study of Teaching Analytics Dashboards of Students' Repertory Grid Exercises in Business Education",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670a041/12OmNxcdG0Y",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2013/4796/0/06781845",
"title": "KnowYourColors: Visual dashboards for blood metrics and healthcare analytics",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2013/06781845/12OmNzlly1J",
"parentPublication": {
"id": "proceedings/isspit/2013/4796/0",
"title": "2013 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2009/01/mso2009010041",
"title": "Analytics-Driven Dashboards Enable Leading Indicators for Requirements and Designs of Large-Scale Systems",
"doi": null,
"abstractUrl": "/magazine/so/2009/01/mso2009010041/13rRUILtJjK",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2013/04/mso2013040057",
"title": "Searching under the Streetlight for Useful Software Analytics",
"doi": null,
"abstractUrl": "/magazine/so/2013/04/mso2013040057/13rRUxC0SCb",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122869",
"title": "Examining the Use of a Visual Analytics System for Sensemaking Tasks: Case Studies with Domain Experts",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122869/13rRUxNmPDT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/seaa/2019/3421/0/342100a300",
"title": "Requirements for Measurement Dashboards and Their Benefits: A Study of Start-ups in an Emerging Ecosystem",
"doi": null,
"abstractUrl": "/proceedings-article/seaa/2019/342100a300/1f8MIRgVPDG",
"parentPublication": {
"id": "proceedings/seaa/2019/3421/0",
"title": "2019 45th Euromicro Conference on Software Engineering and Advanced Applications (SEAA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vizsec/2021/2085/0/208500a042",
"title": "Towards Visual Analytics Dashboards for Provenance-driven Static Application Security Testing",
"doi": null,
"abstractUrl": "/proceedings-article/vizsec/2021/208500a042/1z93LTpogzm",
"parentPublication": {
"id": "proceedings/vizsec/2021/2085/0",
"title": "2021 IEEE Symposium on Visualization for Cyber Security (VizSec)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mso2013040038",
"articleId": "13rRUILtJxl",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mso2013040053",
"articleId": "13rRUxAASRl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzUgd8p",
"title": "Mar.-Apr.",
"year": "2016",
"issueNum": "02",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "36",
"label": "Mar.-Apr.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5zP",
"doi": "10.1109/MCG.2016.33",
"abstract": "A variety of visualization guidelines, principles, and techniques are available to help create a visualization-based dashboard, but few publications discuss the experience of designing dashboards in the real world. This article discuss the lessons learned from designing applications for small start-up companies and institutions. From their experience as visualization practitioners, the authors confirm the need for tailored and customizable approaches, emphasize the need for a quicker way to create functional prototypes, point out frequent misconceptions on the scope of a functional prototype, discuss how performance can affect prototyping, and discuss the resistance of industrial partners to involve their customers in requirements gathering.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A variety of visualization guidelines, principles, and techniques are available to help create a visualization-based dashboard, but few publications discuss the experience of designing dashboards in the real world. This article discuss the lessons learned from designing applications for small start-up companies and institutions. From their experience as visualization practitioners, the authors confirm the need for tailored and customizable approaches, emphasize the need for a quicker way to create functional prototypes, point out frequent misconceptions on the scope of a functional prototype, discuss how performance can affect prototyping, and discuss the resistance of industrial partners to involve their customers in requirements gathering.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A variety of visualization guidelines, principles, and techniques are available to help create a visualization-based dashboard, but few publications discuss the experience of designing dashboards in the real world. This article discuss the lessons learned from designing applications for small start-up companies and institutions. From their experience as visualization practitioners, the authors confirm the need for tailored and customizable approaches, emphasize the need for a quicker way to create functional prototypes, point out frequent misconceptions on the scope of a functional prototype, discuss how performance can affect prototyping, and discuss the resistance of industrial partners to involve their customers in requirements gathering.",
"title": "Lessons Learned from Designing Visualization Dashboards",
"normalizedTitle": "Lessons Learned from Designing Visualization Dashboards",
"fno": "mcg2016020083",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Visualization",
"Media",
"Software Development",
"Safety",
"Image Color Analysis",
"Prototyping",
"Computer Graphics",
"Information Visualization",
"Visual Analytics",
"Dashboard Design"
],
"authors": [
{
"givenName": "Maria-Elena",
"surname": "Froese",
"fullName": "Maria-Elena Froese",
"affiliation": "University of Victoria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Melanie",
"surname": "Tory",
"fullName": "Melanie Tory",
"affiliation": "Tableau Research",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2016-03-01 00:00:00",
"pubType": "mags",
"pages": "83-89",
"year": "2016",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/csmr/2003/1902/0/19020409",
"title": "CodeCrawler - Lessons Learned in Building a Software Visualization Tool",
"doi": null,
"abstractUrl": "/proceedings-article/csmr/2003/19020409/12OmNB06l7v",
"parentPublication": {
"id": "proceedings/csmr/2003/1902/0",
"title": "Seventh European Conference onSoftware Maintenance and Reengineering, 2003. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017651",
"title": "Keeping Multiple Views Consistent: Constraints, Validations, and Exceptions in Visualization Authoring",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017651/13rRUNvyaf7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061081",
"title": "Harnessing the Web Information Ecosystem with Wiki-based Visualization Dashboards",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061081/13rRUyYSWkW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08443395",
"title": "What Do We Talk About When We Talk About Dashboards?",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08443395/17D45XDIXWb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2023/01/09708430",
"title": "Lessons Learned From Quantitatively Exploring Visualization Rubric Utilization for Peer Feedback",
"doi": null,
"abstractUrl": "/magazine/cg/2023/01/09708430/1AR0uN8gBW0",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101642",
"title": "Turbocharging Geospatial Visualization Dashboards via a Materialized Sampling Cube Approach",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101642/1kaMxWASNry",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/it/2021/03/09464119",
"title": "Rigorous Data Validation for Accurate Dashboards: Experience From a Higher Education Institution",
"doi": null,
"abstractUrl": "/magazine/it/2021/03/09464119/1uHcqgoeili",
"parentPublication": {
"id": "mags/it",
"title": "IT Professional",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2022/03/09547788",
"title": "An Empirical Study on How Well Do COVID-19 Information Dashboards Service Users’ Information Needs",
"doi": null,
"abstractUrl": "/journal/sc/2022/03/09547788/1x9Tr00kZH2",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552449",
"title": "MultiVision: Designing Analytical Dashboards with Deep Learning Based Recommendation",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552449/1xic65iQBoY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/conisoft/2021/4361/0/436100a034",
"title": "Information Visualization In Adaptable Dashboards For Smart Cities: A Systematic Review",
"doi": null,
"abstractUrl": "/proceedings-article/conisoft/2021/436100a034/1zHIifIcW4w",
"parentPublication": {
"id": "proceedings/conisoft/2021/4361/0",
"title": "2021 9th International Conference in Software Engineering Research and Innovation (CONISOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2016020074",
"articleId": "13rRUwh80Jc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2016020090",
"articleId": "13rRUyYjKcW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45XDIXWb",
"doi": "10.1109/TVCG.2018.2864903",
"abstract": "Dashboards are one of the most common use cases for data visualization, and their design and contexts of use are considerably different from exploratory visualization tools. In this paper, we look at the broad scope of how dashboards are used in practice through an analysis of dashboard examples and documentation about their use. We systematically review the literature surrounding dashboard use, construct a design space for dashboards, and identify major dashboard types. We characterize dashboards by their design goals, levels of interaction, and the practices around them. Our framework and literature review suggest a number of fruitful research directions to better support dashboard design, implementation and use.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Dashboards are one of the most common use cases for data visualization, and their design and contexts of use are considerably different from exploratory visualization tools. In this paper, we look at the broad scope of how dashboards are used in practice through an analysis of dashboard examples and documentation about their use. We systematically review the literature surrounding dashboard use, construct a design space for dashboards, and identify major dashboard types. We characterize dashboards by their design goals, levels of interaction, and the practices around them. Our framework and literature review suggest a number of fruitful research directions to better support dashboard design, implementation and use.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Dashboards are one of the most common use cases for data visualization, and their design and contexts of use are considerably different from exploratory visualization tools. In this paper, we look at the broad scope of how dashboards are used in practice through an analysis of dashboard examples and documentation about their use. We systematically review the literature surrounding dashboard use, construct a design space for dashboards, and identify major dashboard types. We characterize dashboards by their design goals, levels of interaction, and the practices around them. Our framework and literature review suggest a number of fruitful research directions to better support dashboard design, implementation and use.",
"title": "What Do We Talk About When We Talk About Dashboards?",
"normalizedTitle": "What Do We Talk About When We Talk About Dashboards?",
"fno": "08443395",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Data Visualization",
"Exploratory Visualization Tools",
"Dashboard Examples",
"Dashboard Use",
"Dashboard Types",
"Dashboard Design",
"Visualization",
"Data Visualization",
"Encoding",
"Measurement",
"Decision Making",
"Monitoring",
"Tools",
"Dashboards",
"Literature Review",
"Survey",
"Design Space",
"Open Coding"
],
"authors": [
{
"givenName": "Alper",
"surname": "Sarikaya",
"fullName": "Alper Sarikaya",
"affiliation": "Microsoft Corporation",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Correll",
"fullName": "Michael Correll",
"affiliation": "Tableau Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lyn",
"surname": "Bartram",
"fullName": "Lyn Bartram",
"affiliation": "Simon Fraser University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Melanie",
"surname": "Tory",
"fullName": "Melanie Tory",
"affiliation": "Tableau Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Danyel",
"surname": "Fisher",
"fullName": "Danyel Fisher",
"affiliation": "Honeycomb.io",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "682-692",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icalt/2013/5009/0/5009a412",
"title": "Towards Portable Learning Analytics Dashboards",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2013/5009a412/12OmNB9bvgh",
"parentPublication": {
"id": "proceedings/icalt/2013/5009/0",
"title": "2013 IEEE 13th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2016/5670/0/5670a041",
"title": "Enhancing the Professional Vision of Teachers: A Physiological Study of Teaching Analytics Dashboards of Students' Repertory Grid Exercises in Business Education",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670a041/12OmNxcdG0Y",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/it/2016/05/mit2016050058",
"title": "Displaying Background Maps in Business Intelligence Dashboards",
"doi": null,
"abstractUrl": "/magazine/it/2016/05/mit2016050058/13rRUx0xPxC",
"parentPublication": {
"id": "mags/it",
"title": "IT Professional",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/04/09721816",
"title": "A Framework for Evaluating Dashboards in Healthcare",
"doi": null,
"abstractUrl": "/journal/tg/2022/04/09721816/1BhzDSfcFu8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903550",
"title": "Dashboard Design Patterns",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903550/1GZolSVvsPu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2020/06/09198117",
"title": "What We Talk About When We Talk About Data Physicality",
"doi": null,
"abstractUrl": "/magazine/cg/2020/06/09198117/1n8WRM3WCAg",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222315",
"title": "QualDash: Adaptable Generation of Visualisation Dashboards for Healthcare Quality Improvement",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222315/1nTqJrdIExi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552200",
"title": "Propagating Visual Designs to Numerous Plots and Dashboards",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552200/1xic4fDV0di",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552449",
"title": "MultiVision: Designing Analytical Dashboards with Deep Learning Based Recommendation",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552449/1xic65iQBoY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/conisoft/2021/4361/0/436100a034",
"title": "Information Visualization In Adaptable Dashboards For Smart Cities: A Systematic Review",
"doi": null,
"abstractUrl": "/proceedings-article/conisoft/2021/436100a034/1zHIifIcW4w",
"parentPublication": {
"id": "proceedings/conisoft/2021/4361/0",
"title": "2021 9th International Conference in Software Engineering Research and Innovation (CONISOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440860",
"articleId": "17D45Vw15v5",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440844",
"articleId": "17D45Vw15vc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet4P",
"name": "ttg201901-08443395s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08443395s1.zip",
"extension": "zip",
"size": "24.2 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1H5EWMQX9ZK",
"doi": "10.1109/TVCG.2022.3209468",
"abstract": "Analytical dashboards are popular in business intelligence to facilitate insight discovery with multiple charts. However, creating an effective dashboard is highly demanding, which requires users to have adequate data analysis background and be familiar with professional tools, such as Power BI. To create a dashboard, users have to configure charts by selecting data columns and exploring different chart combinations to optimize the communication of insights, which is trial-and-error. Recent research has started to use deep learning methods for dashboard generation to lower the burden of visualization creation. However, such efforts are greatly hindered by the lack of large-scale and high-quality datasets of dashboards. In this work, we propose using deep reinforcement learning to generate analytical dashboards that can use well-established visualization knowledge and the estimation capacity of reinforcement learning. Specifically, we use visualization knowledge to construct a training environment and rewards for agents to explore and imitate human exploration behavior with a well-designed agent network. The usefulness of the deep reinforcement learning model is demonstrated through ablation studies and user studies. In conclusion, our work opens up new opportunities to develop effective ML-based visualization recommenders without beforehand training datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Analytical dashboards are popular in business intelligence to facilitate insight discovery with multiple charts. However, creating an effective dashboard is highly demanding, which requires users to have adequate data analysis background and be familiar with professional tools, such as Power BI. To create a dashboard, users have to configure charts by selecting data columns and exploring different chart combinations to optimize the communication of insights, which is trial-and-error. Recent research has started to use deep learning methods for dashboard generation to lower the burden of visualization creation. However, such efforts are greatly hindered by the lack of large-scale and high-quality datasets of dashboards. In this work, we propose using deep reinforcement learning to generate analytical dashboards that can use well-established visualization knowledge and the estimation capacity of reinforcement learning. Specifically, we use visualization knowledge to construct a training environment and rewards for agents to explore and imitate human exploration behavior with a well-designed agent network. The usefulness of the deep reinforcement learning model is demonstrated through ablation studies and user studies. In conclusion, our work opens up new opportunities to develop effective ML-based visualization recommenders without beforehand training datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Analytical dashboards are popular in business intelligence to facilitate insight discovery with multiple charts. However, creating an effective dashboard is highly demanding, which requires users to have adequate data analysis background and be familiar with professional tools, such as Power BI. To create a dashboard, users have to configure charts by selecting data columns and exploring different chart combinations to optimize the communication of insights, which is trial-and-error. Recent research has started to use deep learning methods for dashboard generation to lower the burden of visualization creation. However, such efforts are greatly hindered by the lack of large-scale and high-quality datasets of dashboards. In this work, we propose using deep reinforcement learning to generate analytical dashboards that can use well-established visualization knowledge and the estimation capacity of reinforcement learning. Specifically, we use visualization knowledge to construct a training environment and rewards for agents to explore and imitate human exploration behavior with a well-designed agent network. The usefulness of the deep reinforcement learning model is demonstrated through ablation studies and user studies. In conclusion, our work opens up new opportunities to develop effective ML-based visualization recommenders without beforehand training datasets.",
"title": "DashBot: Insight-Driven Dashboard Generation Based on Deep Reinforcement Learning",
"normalizedTitle": "DashBot: Insight-Driven Dashboard Generation Based on Deep Reinforcement Learning",
"fno": "09906971",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Competitive Intelligence",
"Data Analysis",
"Data Visualisation",
"Learning Artificial Intelligence",
"Adequate Data Analysis Background",
"Analytical Dashboards",
"Business Intelligence",
"Data Columns",
"Deep Learning Methods",
"Deep Reinforcement Learning Model",
"Effective Dashboard",
"Effective ML Based Visualization Recommenders",
"Exploring Different Chart Combinations",
"Human Exploration Behavior",
"Insight Discovery",
"Insight Driven Dashboard Generation",
"Multiple Charts",
"Power BI",
"Professional Tools",
"Visualization Creation",
"Visualization Knowledge",
"Data Visualization",
"Visualization",
"Deep Learning",
"Training",
"Neural Networks",
"Encoding",
"Q Learning",
"Reinforcement Learning",
"Visualization Recommendation",
"Multiple View Visualization"
],
"authors": [
{
"givenName": "Dazhen",
"surname": "Deng",
"fullName": "Dazhen Deng",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aoyu",
"surname": "Wu",
"fullName": "Aoyu Wu",
"affiliation": "Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Hong Kong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Hong Kong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "690-700",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2019/01/08443395",
"title": "What Do We Talk About When We Talk About Dashboards?",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08443395/17D45XDIXWb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/03/08283817",
"title": "Using Dashboard Networks to Visualize Multiple Patient Histories: A Design Study on Post-Operative Prostate Cancer",
"doi": null,
"abstractUrl": "/journal/tg/2019/03/08283817/17D45XacGi3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903550",
"title": "Dashboard Design Patterns",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903550/1GZolSVvsPu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09911200",
"title": "MEDLEY: Intent-based Recommendations to Support Dashboard Composition<sc/>",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09911200/1Hcjm0PMkgw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acompa/2022/6171/0/617100a020",
"title": "Toward Code Generation for Process-oriented, Role-based Dashboards : An Example of Digital Advertising in Vietnam",
"doi": null,
"abstractUrl": "/proceedings-article/acompa/2022/617100a020/1JNqOqDO1bO",
"parentPublication": {
"id": "proceedings/acompa/2022/6171/0",
"title": "2022 International Conference on Advanced Computing and Analytics (ACOMPA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10057994",
"title": "Dashboard Design Mining and Recommendation",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10057994/1LbFmG2HHnW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09035622",
"title": "LADV: Deep Learning Assisted Authoring of Dashboard Visualizations From Images and Sketches",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09035622/1iaeAO11H6o",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issrew/2020/7735/0/773500a215",
"title": "Declarative Dashboard Generation",
"doi": null,
"abstractUrl": "/proceedings-article/issrew/2020/773500a215/1q7jsZHI07u",
"parentPublication": {
"id": "proceedings/issrew/2020/7735/0",
"title": "2020 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552449",
"title": "MultiVision: Designing Analytical Dashboards with Deep Learning Based Recommendation",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552449/1xic65iQBoY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2023/01/09656613",
"title": "Finding Their Data Voice: Practices and Challenges of Dashboard Users",
"doi": null,
"abstractUrl": "/magazine/cg/2023/01/09656613/1zumu8nC20U",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09904483",
"articleId": "1H1gfbVcpgI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09903343",
"articleId": "1GZooOkjYzK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1J9yzxbrB3W",
"name": "ttg202301-09906971s1-supp1-3209468.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09906971s1-supp1-3209468.mp4",
"extension": "mp4",
"size": "10.5 MB",
"__typename": "WebExtraType"
},
{
"id": "1J9yyUiGnm0",
"name": "ttg202301-09906971s1-supp2-3209468.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09906971s1-supp2-3209468.pdf",
"extension": "pdf",
"size": "58.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1uHckLHBP6o",
"title": "May-June",
"year": "2021",
"issueNum": "03",
"idPrefix": "it",
"pubType": "magazine",
"volume": "23",
"label": "May-June",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1uHcqgoeili",
"doi": "10.1109/MITP.2021.3073799",
"abstract": "Data have become an indispensable aspect of our daily lives. The demand for data visualization tools such as dashboards is driven by the desire to make data-and more importantly, the power of using data to inform decision making-accessible to all. During the current pandemic, the availability of realtime data via various dashboards at the global, national, and local levels empowered many to accurately assess the situation and take appropriate actions, a testament to the value of data visualization. For the same reasons, data dashboards are increasingly popular in higher education to promote data consumption and data-driven decision making. California State University, Fullerton (CSUF) is no exception. CSUF has developed a suite of dashboards in the past few years to promote an operational culture that is rooted in evidence. Discussions about data visualization tools often gravitate towards dashboard design, accessibility, and usability, while neglecting a fundamental (and arguably more critical) issue-the importance of having appropriate and accurate underlying data. The accuracy and adaptability of a dashboard are determined by the accuracy and adaptability of the data behind it, and to ensure such requires a meticulous, streamlined development process. This article is intended to do a 'deep dive' into this process.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data have become an indispensable aspect of our daily lives. The demand for data visualization tools such as dashboards is driven by the desire to make data-and more importantly, the power of using data to inform decision making-accessible to all. During the current pandemic, the availability of realtime data via various dashboards at the global, national, and local levels empowered many to accurately assess the situation and take appropriate actions, a testament to the value of data visualization. For the same reasons, data dashboards are increasingly popular in higher education to promote data consumption and data-driven decision making. California State University, Fullerton (CSUF) is no exception. CSUF has developed a suite of dashboards in the past few years to promote an operational culture that is rooted in evidence. Discussions about data visualization tools often gravitate towards dashboard design, accessibility, and usability, while neglecting a fundamental (and arguably more critical) issue-the importance of having appropriate and accurate underlying data. The accuracy and adaptability of a dashboard are determined by the accuracy and adaptability of the data behind it, and to ensure such requires a meticulous, streamlined development process. This article is intended to do a 'deep dive' into this process.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data have become an indispensable aspect of our daily lives. The demand for data visualization tools such as dashboards is driven by the desire to make data-and more importantly, the power of using data to inform decision making-accessible to all. During the current pandemic, the availability of realtime data via various dashboards at the global, national, and local levels empowered many to accurately assess the situation and take appropriate actions, a testament to the value of data visualization. For the same reasons, data dashboards are increasingly popular in higher education to promote data consumption and data-driven decision making. California State University, Fullerton (CSUF) is no exception. CSUF has developed a suite of dashboards in the past few years to promote an operational culture that is rooted in evidence. Discussions about data visualization tools often gravitate towards dashboard design, accessibility, and usability, while neglecting a fundamental (and arguably more critical) issue-the importance of having appropriate and accurate underlying data. The accuracy and adaptability of a dashboard are determined by the accuracy and adaptability of the data behind it, and to ensure such requires a meticulous, streamlined development process. This article is intended to do a 'deep dive' into this process.",
"title": "Rigorous Data Validation for Accurate Dashboards: Experience From a Higher Education Institution",
"normalizedTitle": "Rigorous Data Validation for Accurate Dashboards: Experience From a Higher Education Institution",
"fno": "09464119",
"hasPdf": true,
"idPrefix": "it",
"keywords": [
"Computer Aided Instruction",
"Data Visualisation",
"Decision Making",
"Educational Administrative Data Processing",
"Educational Institutions",
"Further Education",
"Rigorous Data Validation",
"Dashboards",
"Higher Education Institution",
"Data Visualization Tools",
"Realtime Data",
"Global Levels",
"Local Levels",
"Data Dashboards",
"Data Consumption",
"Data Driven Decision Making",
"Dashboard Design",
"Education",
"Data Visualization",
"Collaboration",
"Data Warehouses",
"Software Testing",
"Stakeholders"
],
"authors": [
{
"givenName": "Noha",
"surname": "Abdou",
"fullName": "Noha Abdou",
"affiliation": "California State University, Fullerton, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Afshin",
"surname": "Karimi",
"fullName": "Afshin Karimi",
"affiliation": "California State University, Fullerton, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rohit",
"surname": "Murarka",
"fullName": "Rohit Murarka",
"affiliation": "California State University, Fullerton, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Su",
"surname": "Swarat",
"fullName": "Su Swarat",
"affiliation": "California State University, Fullerton, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2021-05-01 00:00:00",
"pubType": "mags",
"pages": "95-101",
"year": "2021",
"issn": "1520-9202",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icalt/2013/5009/0/5009a412",
"title": "Towards Portable Learning Analytics Dashboards",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2013/5009a412/12OmNB9bvgh",
"parentPublication": {
"id": "proceedings/icalt/2013/5009/0",
"title": "2013 IEEE 13th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2016/5670/0/5670a041",
"title": "Enhancing the Professional Vision of Teachers: A Physiological Study of Teaching Analytics Dashboards of Students' Repertory Grid Exercises in Business Education",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670a041/12OmNxcdG0Y",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2016/02/mcg2016020083",
"title": "Lessons Learned from Designing Visualization Dashboards",
"doi": null,
"abstractUrl": "/magazine/cg/2016/02/mcg2016020083/13rRUxBa5zP",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061081",
"title": "Harnessing the Web Information Ecosystem with Wiki-based Visualization Dashboards",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061081/13rRUyYSWkW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08443395",
"title": "What Do We Talk About When We Talk About Dashboards?",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08443395/17D45XDIXWb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2022/9519/0/951900a133",
"title": "Flagging in teacher-facing orchestration dashboards: factors affecting its use in Pyramid CSCL debriefing",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2022/951900a133/1FUUdG28fbW",
"parentPublication": {
"id": "proceedings/icalt/2022/9519/0",
"title": "2022 International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acompa/2022/6171/0/617100a020",
"title": "Toward Code Generation for Process-oriented, Role-based Dashboards : An Example of Digital Advertising in Vietnam",
"doi": null,
"abstractUrl": "/proceedings-article/acompa/2022/617100a020/1JNqOqDO1bO",
"parentPublication": {
"id": "proceedings/acompa/2022/6171/0",
"title": "2022 International Conference on Advanced Computing and Analytics (ACOMPA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222315",
"title": "QualDash: Adaptable Generation of Visualisation Dashboards for Healthcare Quality Improvement",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222315/1nTqJrdIExi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2022/03/09547788",
"title": "An Empirical Study on How Well Do COVID-19 Information Dashboards Service Users’ Information Needs",
"doi": null,
"abstractUrl": "/journal/sc/2022/03/09547788/1x9Tr00kZH2",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/conisoft/2021/4361/0/436100a034",
"title": "Information Visualization In Adaptable Dashboards For Smart Cities: A Systematic Review",
"doi": null,
"abstractUrl": "/proceedings-article/conisoft/2021/436100a034/1zHIifIcW4w",
"parentPublication": {
"id": "proceedings/conisoft/2021/4361/0",
"title": "2021 9th International Conference in Software Engineering Research and Innovation (CONISOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09464123",
"articleId": "1uHclMTUECY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09464109",
"articleId": "1uHcrIlEx8Y",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyRxFj0",
"title": "March",
"year": "2018",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxYINfm",
"doi": "10.1109/TVCG.2017.2659744",
"abstract": "We present a technique for converting a basic D3 chart into a reusable style template. Then, given a new data source we can apply the style template to generate a chart that depicts the new data, but in the style of the template. To construct the style template we first deconstruct the input D3 chart to recover its underlying structure: the data, the marks and the mappings that describe how the marks encode the data. We then rank the perceptual effectiveness of the deconstructed mappings. To apply the resulting style template to a new data source we first obtain importance ranks for each new data field. We then adjust the template mappings to depict the source data by matching the most important data fields to the most perceptually effective mappings. We show how the style templates can be applied to source data in the form of either a data table or another D3 chart. While our implementation focuses on generating templates for basic chart types (e.g., variants of bar charts, line charts, dot plots, scatterplots, etc.), these are the most commonly used chart types today. Users can easily find such basic D3 charts on the Web, turn them into templates, and immediately see how their own data would look in the visual style (e.g., colors, shapes, fonts, etc.) of the templates. We demonstrate the effectiveness of our approach by applying a diverse set of style templates to a variety of source datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a technique for converting a basic D3 chart into a reusable style template. Then, given a new data source we can apply the style template to generate a chart that depicts the new data, but in the style of the template. To construct the style template we first deconstruct the input D3 chart to recover its underlying structure: the data, the marks and the mappings that describe how the marks encode the data. We then rank the perceptual effectiveness of the deconstructed mappings. To apply the resulting style template to a new data source we first obtain importance ranks for each new data field. We then adjust the template mappings to depict the source data by matching the most important data fields to the most perceptually effective mappings. We show how the style templates can be applied to source data in the form of either a data table or another D3 chart. While our implementation focuses on generating templates for basic chart types (e.g., variants of bar charts, line charts, dot plots, scatterplots, etc.), these are the most commonly used chart types today. Users can easily find such basic D3 charts on the Web, turn them into templates, and immediately see how their own data would look in the visual style (e.g., colors, shapes, fonts, etc.) of the templates. We demonstrate the effectiveness of our approach by applying a diverse set of style templates to a variety of source datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a technique for converting a basic D3 chart into a reusable style template. Then, given a new data source we can apply the style template to generate a chart that depicts the new data, but in the style of the template. To construct the style template we first deconstruct the input D3 chart to recover its underlying structure: the data, the marks and the mappings that describe how the marks encode the data. We then rank the perceptual effectiveness of the deconstructed mappings. To apply the resulting style template to a new data source we first obtain importance ranks for each new data field. We then adjust the template mappings to depict the source data by matching the most important data fields to the most perceptually effective mappings. We show how the style templates can be applied to source data in the form of either a data table or another D3 chart. While our implementation focuses on generating templates for basic chart types (e.g., variants of bar charts, line charts, dot plots, scatterplots, etc.), these are the most commonly used chart types today. Users can easily find such basic D3 charts on the Web, turn them into templates, and immediately see how their own data would look in the visual style (e.g., colors, shapes, fonts, etc.) of the templates. We demonstrate the effectiveness of our approach by applying a diverse set of style templates to a variety of source datasets.",
"title": "Converting Basic D3 Charts into Reusable Style Templates",
"normalizedTitle": "Converting Basic D3 Charts into Reusable Style Templates",
"fno": "07845717",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Shape",
"Bars",
"Image Color Analysis",
"Encoding",
"Data Visualization",
"Electronic Mail",
"Chart Restyling",
"Reusable Style Templates",
"Declarative Representation",
"D 3 Deconstruction",
"Vega Lite"
],
"authors": [
{
"givenName": "Jonathan",
"surname": "Harper",
"fullName": "Jonathan Harper",
"affiliation": "University of California, Berkeley, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Maneesh",
"surname": "Agrawala",
"fullName": "Maneesh Agrawala",
"affiliation": "Stanford University, Stanford, CA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2018-03-01 00:00:00",
"pubType": "trans",
"pages": "1274-1286",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2015/1727/0/07223358",
"title": "Incorporating D3.js information visualization into immersive virtual environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2015/07223358/12OmNxFJXNv",
"parentPublication": {
"id": "proceedings/vr/2015/1727/0",
"title": "2015 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a016",
"title": "Streamlining Visualization Authoring in D3 Through User-Driven Templates",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a016/1J6heEO48bS",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807238",
"title": "A Comparison of Radial and Linear Charts for Visualizing Daily Patterns",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807238/1cG66qf6MKs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08809832",
"title": "Searching the Visual Style and Structure of D3 Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08809832/1cHEgg8WeNW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a163",
"title": "Proposal and Evaluation of Textual Description Templates for Bar Charts Vocalization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a163/1cMFc4aDtWo",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a151",
"title": "The Cost of Pie Charts",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a151/1cMFcqwGM5q",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09293003",
"title": "Chartem: Reviving Chart Images with Data Embedding",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09293003/1pyonCyir8k",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412153",
"title": "Visual Style Extraction from Chart Images for Chart Restyling",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412153/1tmiHY12xy0",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552881",
"title": "Modeling Just Noticeable Differences in Charts",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552881/1xibXzMLm9i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09585700",
"title": "A Mixed-Initiative Approach to Reusing Infographic Charts",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09585700/1y11cGSPuPC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07845705",
"articleId": "13rRUxBJhvD",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07847429",
"articleId": "13rRUygBw7h",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45Vw15wL",
"doi": "10.1109/TVCG.2018.2865231",
"abstract": "Details-on-demand is a crucial feature in the visual information-seeking process but is often only implemented in highly constrained settings. The most common solution, hover queries (i.e., tooltips), are fast and expressive but are usually limited to single mark (e.g., a bar in a bar chart). `Queries' to retrieve details for more complex sets of objects (e.g., comparisons between pairs of elements, averages across multiple items, trend lines, etc.) are difficult for end-users to invoke explicitly. Further, the output of these queries require complex annotations and overlays which need to be displayed and dismissed on demand to avoid clutter. In this work we introduce SmartCues, a library to support details-on-demand through dynamically computed overlays. For end-users, SmartCues provides multitouch interactions to construct complex queries for a variety of details. For designers, SmartCues offers an interaction library that can be used out-of-the-box, and can be extended for new charts and detail types. We demonstrate how SmartCues can be implemented across a wide array of visualization types and, through a lab study, show that end users can effectively use SmartCues.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Details-on-demand is a crucial feature in the visual information-seeking process but is often only implemented in highly constrained settings. The most common solution, hover queries (i.e., tooltips), are fast and expressive but are usually limited to single mark (e.g., a bar in a bar chart). `Queries' to retrieve details for more complex sets of objects (e.g., comparisons between pairs of elements, averages across multiple items, trend lines, etc.) are difficult for end-users to invoke explicitly. Further, the output of these queries require complex annotations and overlays which need to be displayed and dismissed on demand to avoid clutter. In this work we introduce SmartCues, a library to support details-on-demand through dynamically computed overlays. For end-users, SmartCues provides multitouch interactions to construct complex queries for a variety of details. For designers, SmartCues offers an interaction library that can be used out-of-the-box, and can be extended for new charts and detail types. We demonstrate how SmartCues can be implemented across a wide array of visualization types and, through a lab study, show that end users can effectively use SmartCues.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Details-on-demand is a crucial feature in the visual information-seeking process but is often only implemented in highly constrained settings. The most common solution, hover queries (i.e., tooltips), are fast and expressive but are usually limited to single mark (e.g., a bar in a bar chart). `Queries' to retrieve details for more complex sets of objects (e.g., comparisons between pairs of elements, averages across multiple items, trend lines, etc.) are difficult for end-users to invoke explicitly. Further, the output of these queries require complex annotations and overlays which need to be displayed and dismissed on demand to avoid clutter. In this work we introduce SmartCues, a library to support details-on-demand through dynamically computed overlays. For end-users, SmartCues provides multitouch interactions to construct complex queries for a variety of details. For designers, SmartCues offers an interaction library that can be used out-of-the-box, and can be extended for new charts and detail types. We demonstrate how SmartCues can be implemented across a wide array of visualization types and, through a lab study, show that end users can effectively use SmartCues.",
"title": "SmartCues: A Multitouch Query Approach for Details-on-Demand through Dynamically Computed Overlays",
"normalizedTitle": "SmartCues: A Multitouch Query Approach for Details-on-Demand through Dynamically Computed Overlays",
"fno": "08440833",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Interactive Systems",
"Query Processing",
"Multitouch Query Approach",
"Details On Demand",
"Dynamically Computed Overlays",
"Visual Information Seeking Process",
"Highly Constrained Settings",
"Complex Annotations",
"Multitouch Interactions",
"Complex Queries",
"End Users",
"Smartcues",
"Bars",
"US Department Of Defense",
"Task Analysis",
"Visualization",
"Data Visualization",
"Libraries",
"Color",
"Graphical Overlays",
"Details On Demand",
"Graph Comprehension"
],
"authors": [
{
"givenName": "Hariharan",
"surname": "Subramonyam",
"fullName": "Hariharan Subramonyam",
"affiliation": "School of InformationUniversity of Michigan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eytan",
"surname": "Adar",
"fullName": "Eytan Adar",
"affiliation": "School of InformationUniversity of Michigan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "597-607",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isca/2011/0472/0/06307771",
"title": "Benefits and limitations of tapping into stored energy for datacenters",
"doi": null,
"abstractUrl": "/proceedings-article/isca/2011/06307771/12OmNASILUU",
"parentPublication": {
"id": "proceedings/isca/2011/0472/0",
"title": "2011 ACM/IEEE 38th International Symposium on Computer Architecture (ISCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcmp-ugc/2010/986/0/06018044",
"title": "Enabling Interactive Analysis on Cray XT-5 Compute Nodes",
"doi": null,
"abstractUrl": "/proceedings-article/hpcmp-ugc/2010/06018044/12OmNCeK29F",
"parentPublication": {
"id": "proceedings/hpcmp-ugc/2010/986/0",
"title": "2010 DoD High Performance Computing Modernization Program Users Group Conference (HPCMP-UGC 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2018/3652/0/08390416",
"title": "Optimal Peak Shaving Using Batteries at Datacenters: Charging Risk and Degradation Model",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2018/08390416/12OmNqNG3eM",
"parentPublication": {
"id": "proceedings/icnc/2018/3652/0",
"title": "2018 International Conference on Computing, Networking and Communications (ICNC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcmp-ugc/2010/986/0/06018002",
"title": "Potential Energy Surface Mapping of Energetic Materials Using Coupled Cluster Theory",
"doi": null,
"abstractUrl": "/proceedings-article/hpcmp-ugc/2010/06018002/12OmNvDqsUa",
"parentPublication": {
"id": "proceedings/hpcmp-ugc/2010/986/0",
"title": "2010 DoD High Performance Computing Modernization Program Users Group Conference (HPCMP-UGC 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcmp-ugc/2010/986/0/06018025",
"title": "A Common Computational Science Environment for High Performance Computing Centers",
"doi": null,
"abstractUrl": "/proceedings-article/hpcmp-ugc/2010/06018025/12OmNz61dfN",
"parentPublication": {
"id": "proceedings/hpcmp-ugc/2010/986/0",
"title": "2010 DoD High Performance Computing Modernization Program Users Group Conference (HPCMP-UGC 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2017/3408/0/3408a054",
"title": "Preemptive resource management for dynamically arriving tasks in an oversubscribed heterogeneous computing system",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2017/3408a054/12OmNznkJQ8",
"parentPublication": {
"id": "proceedings/ipdpsw/2017/3408/0",
"title": "2017 IEEE International Parallel and Distributed Processing Symposium: Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122631",
"title": "Graphical Overlays: Using Layered Elements to Aid Chart Reading",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122631/13rRUyfKIHJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv-2/2019/2850/0/285000a042",
"title": "An Interactive Method for Visualising Physical Activity in Parks",
"doi": null,
"abstractUrl": "/proceedings-article/iv-2/2019/285000a042/1cMEPkhBBKw",
"parentPublication": {
"id": "proceedings/iv-2/2019/2850/0",
"title": "2019 23rd International Conference in Information Visualization – Part II",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2011/0015/0/06102482",
"title": "Pexel and heatmap visual analysis of multidimensional gun/homicide data",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2011/06102482/1gMviG5uVJm",
"parentPublication": {
"id": "proceedings/vast/2011/0015/0",
"title": "2011 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2021/06/09537650",
"title": "High Performance Computing for Science and Engineering in the Department of Defense",
"doi": null,
"abstractUrl": "/magazine/cs/2021/06/09537650/1wTinXN4sy4",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440803",
"articleId": "17D45Xq6dBX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440846",
"articleId": "17D45Wc1IM2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i3K5MkSDU4",
"name": "ttg201901-08440833s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440833s1.mp4",
"extension": "mp4",
"size": "86.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDY",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1cG6a6b0eys",
"doi": "10.1109/TVCG.2019.2934783",
"abstract": "We present a new technique to enable the creation of shape-bounded Wordles, we call ShapeWordle, in which we fit words to form a given shape. To guide word placement within a shape, we extend the traditional Archimedean spirals to be shape-aware by formulating the spirals in a differential form using the distance field of the shape. To handle non-convex shapes, we introduce a multi-centric Wordle layout method that segments the shape into parts for our shape-aware spirals to adaptively fill the space and generate word placements. In addition, we offer a set of editing interactions to facilitate the creation of semantically-meaningful Wordles. Lastly, we present three evaluations: a comprehensive comparison of our results against the state-of-the-art technique (WordArt), case studies with 14 users, and a gallery to showcase the coverage of our technique.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a new technique to enable the creation of shape-bounded Wordles, we call ShapeWordle, in which we fit words to form a given shape. To guide word placement within a shape, we extend the traditional Archimedean spirals to be shape-aware by formulating the spirals in a differential form using the distance field of the shape. To handle non-convex shapes, we introduce a multi-centric Wordle layout method that segments the shape into parts for our shape-aware spirals to adaptively fill the space and generate word placements. In addition, we offer a set of editing interactions to facilitate the creation of semantically-meaningful Wordles. Lastly, we present three evaluations: a comprehensive comparison of our results against the state-of-the-art technique (WordArt), case studies with 14 users, and a gallery to showcase the coverage of our technique.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a new technique to enable the creation of shape-bounded Wordles, we call ShapeWordle, in which we fit words to form a given shape. To guide word placement within a shape, we extend the traditional Archimedean spirals to be shape-aware by formulating the spirals in a differential form using the distance field of the shape. To handle non-convex shapes, we introduce a multi-centric Wordle layout method that segments the shape into parts for our shape-aware spirals to adaptively fill the space and generate word placements. In addition, we offer a set of editing interactions to facilitate the creation of semantically-meaningful Wordles. Lastly, we present three evaluations: a comprehensive comparison of our results against the state-of-the-art technique (WordArt), case studies with 14 users, and a gallery to showcase the coverage of our technique.",
"title": "ShapeWordle: Tailoring Wordles using Shape-aware Archimedean Spirals",
"normalizedTitle": "ShapeWordle: Tailoring Wordles using Shape-aware Archimedean Spirals",
"fno": "08807355",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Art",
"Computational Geometry",
"Data Analysis",
"Data Visualisation",
"Shape Wordle",
"Shape Aware Archimedean Spirals",
"Shape Bounded Wordles",
"Word Placement",
"Traditional Archimedean Spirals",
"Differential Form",
"Nonconvex Shapes",
"Multicentric Wordle Layout Method",
"Shape Aware Spirals",
"Semantically Meaningful Wordles",
"Shape",
"Layout",
"Spirals",
"Tag Clouds",
"Image Color Analysis",
"Tools",
"Semantics",
"Wordle",
"Archimedean Spiral",
"Shape"
],
"authors": [
{
"givenName": "Yunhai",
"surname": "Wang",
"fullName": "Yunhai Wang",
"affiliation": "Shandong University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaowei",
"surname": "Chu",
"fullName": "Xiaowei Chu",
"affiliation": "Shandong University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kaiyi",
"surname": "Zhang",
"fullName": "Kaiyi Zhang",
"affiliation": "Shandong University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chen",
"surname": "Bao",
"fullName": "Chen Bao",
"affiliation": "Shandong University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaotong",
"surname": "Li",
"fullName": "Xiaotong Li",
"affiliation": "Shandong University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jian",
"surname": "Zhang",
"fullName": "Jian Zhang",
"affiliation": "CNIC, CAS",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chi-Wing",
"surname": "Fu",
"fullName": "Chi-Wing Fu",
"affiliation": "Chinese University of Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christophe",
"surname": "Hurter",
"fullName": "Christophe Hurter",
"affiliation": "ENAC, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Oliver",
"surname": "Deussen",
"fullName": "Oliver Deussen",
"affiliation": "Konstanz University, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bongshin",
"surname": "Lee",
"fullName": "Bongshin Lee",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "991-1000",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2015/7568/0/7568a114",
"title": "Concentri Cloud: Word Cloud Visualization for Multiple Text Documents",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568a114/12OmNA0dMO6",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2014/2504/0/2504b833",
"title": "Word Cloud Explorer: Text Analytics Based on Word Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2014/2504b833/12OmNqNG3jl",
"parentPublication": {
"id": "proceedings/hicss/2014/2504/0",
"title": "2014 47th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2009/4442/0/05457637",
"title": "Intrinsic shape signatures: A shape descriptor for 3D object recognition",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2009/05457637/12OmNzvQHNi",
"parentPublication": {
"id": "proceedings/iccvw/2009/4442/0",
"title": "2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017586",
"title": "EdWordle: Consistency-Preserving Word Cloud Editing",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017586/13rRUIJuxvp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/12/07118241",
"title": "Morphable Word Clouds for Time-Varying Text Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2015/12/07118241/13rRUwfZBVn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a122",
"title": "Depth-Enhanced Tag Cloud Maps",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a122/17D45XeKgo7",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/09/08665933",
"title": "An Evaluation of Semantically Grouped Word Cloud Designs",
"doi": null,
"abstractUrl": "/journal/tg/2020/09/08665933/18l6IFPQspi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis4dh/2022/7668/0/766800a043",
"title": "Word Clouds in the Wild",
"doi": null,
"abstractUrl": "/proceedings-article/vis4dh/2022/766800a043/1J2XH4Bdug0",
"parentPublication": {
"id": "proceedings/vis4dh/2022/7668/0",
"title": "2022 IEEE 7th Workshop on Visualization for the Digital Humanities (VIS4DH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020869",
"title": "Comparison of Teenagers’ Writing Using Word Clouds and Analyzing Engines",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020869/1KfR5ALNwEE",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/12/09143452",
"title": "PyramidTags: Context-, Time- and Word Order-Aware Tag Maps to Explore Large Document Collections",
"doi": null,
"abstractUrl": "/journal/tg/2021/12/09143452/1lxmwM0AM9O",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08809920",
"articleId": "1cHEmIfGtgc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08807224",
"articleId": "1cG6twVJ2HC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1qL5hsvvVkc",
"title": "Feb.",
"year": "2021",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1nTq353vBNS",
"doi": "10.1109/TVCG.2020.3030406",
"abstract": "We present an integrated approach for creating and assigning color palettes to different visualizations such as multi-class scatterplots, line, and bar charts. While other methods separate the creation of colors from their assignment, our approach takes data characteristics into account to produce color palettes, which are then assigned in a way that fosters better visual discrimination of classes. To do so, we use a customized optimization based on simulated annealing to maximize the combination of three carefully designed color scoring functions: point distinctness, name difference, and color discrimination. We compare our approach to state-of-the-art palettes with a controlled user study for scatterplots and line charts, furthermore we performed a case study. Our results show that Palettailor, as a fully-automated approach, generates color palettes with a higher discrimination quality than existing approaches. The efficiency of our optimization allows us also to incorporate user modifications into the color selection process.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present an integrated approach for creating and assigning color palettes to different visualizations such as multi-class scatterplots, line, and bar charts. While other methods separate the creation of colors from their assignment, our approach takes data characteristics into account to produce color palettes, which are then assigned in a way that fosters better visual discrimination of classes. To do so, we use a customized optimization based on simulated annealing to maximize the combination of three carefully designed color scoring functions: point distinctness, name difference, and color discrimination. We compare our approach to state-of-the-art palettes with a controlled user study for scatterplots and line charts, furthermore we performed a case study. Our results show that Palettailor, as a fully-automated approach, generates color palettes with a higher discrimination quality than existing approaches. The efficiency of our optimization allows us also to incorporate user modifications into the color selection process.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present an integrated approach for creating and assigning color palettes to different visualizations such as multi-class scatterplots, line, and bar charts. While other methods separate the creation of colors from their assignment, our approach takes data characteristics into account to produce color palettes, which are then assigned in a way that fosters better visual discrimination of classes. To do so, we use a customized optimization based on simulated annealing to maximize the combination of three carefully designed color scoring functions: point distinctness, name difference, and color discrimination. We compare our approach to state-of-the-art palettes with a controlled user study for scatterplots and line charts, furthermore we performed a case study. Our results show that Palettailor, as a fully-automated approach, generates color palettes with a higher discrimination quality than existing approaches. The efficiency of our optimization allows us also to incorporate user modifications into the color selection process.",
"title": "Palettailor: Discriminable Colorization for Categorical Data",
"normalizedTitle": "Palettailor: Discriminable Colorization for Categorical Data",
"fno": "09222351",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Image Colour Analysis",
"Simulated Annealing",
"Multiclass Scatterplots",
"Data Characteristics",
"Color Palettes",
"Color Scoring Functions",
"Color Discrimination",
"Line Charts",
"Palettailor",
"Higher Discrimination Quality",
"Color Selection Process",
"Discriminable Colorization",
"Categorical Data",
"Visualization",
"Simulated Annealing",
"Image Color Analysis",
"Data Visualization",
"Optimization",
"Task Analysis",
"Bars",
"Visualization",
"Tools",
"Color Palette",
"Discriminability",
"Multi Class Scatterplot",
"Line Chart",
"Bar Chart"
],
"authors": [
{
"givenName": "Kecheng",
"surname": "Lu",
"fullName": "Kecheng Lu",
"affiliation": "Shandong University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mi",
"surname": "Feng",
"fullName": "Mi Feng",
"affiliation": "Twitter Inc.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xin",
"surname": "Chen",
"fullName": "Xin Chen",
"affiliation": "Shandong University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Sedlmair",
"fullName": "Michael Sedlmair",
"affiliation": "VISUS, University of Stuttgart, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Oliver",
"surname": "Deussen",
"fullName": "Oliver Deussen",
"affiliation": "Shenzhen VisuCA Key Lab, SIAT, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dani",
"surname": "Lischinski",
"fullName": "Dani Lischinski",
"affiliation": "Hebrew University, Jerusalem, Israel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhanglin",
"surname": "Cheng",
"fullName": "Zhanglin Cheng",
"affiliation": "Shenzhen VisuCA Key Lab, SIAT, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yunhai",
"surname": "Wang",
"fullName": "Yunhai Wang",
"affiliation": "Shandong University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "475-484",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2015/7082/0/07177443",
"title": "Creative design of color palettes for product packaging",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2015/07177443/12OmNqH9hqW",
"parentPublication": {
"id": "proceedings/icme/2015/7082/0",
"title": "2015 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031599",
"title": "ChartAccent: Annotation for data-driven storytelling",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031599/12OmNxEjY7F",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/10/ttg2013101746",
"title": "Perceptually Driven Visibility Optimization for Categorical Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2013/10/ttg2013101746/13rRUwI5Ug7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/06/07911336",
"title": "Color Orchestra: Ordering Color Palettes for Interpolation and Prediction",
"doi": null,
"abstractUrl": "/journal/tg/2018/06/07911336/13rRUxASu0R",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/03/07845717",
"title": "Converting Basic D3 Charts into Reusable Style Templates",
"doi": null,
"abstractUrl": "/journal/tg/2018/03/07845717/13rRUxYINfm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539386",
"title": "Colorgorical: Creating discriminable and preferable color palettes for information visualization",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539386/13rRUxlgy3M",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192709",
"title": "A Linguistic Approach to Categorical Color Assignment for Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192709/13rRUyYjKaj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09969167",
"title": "Image-Driven Harmonious Color Palette Generation for Diverse Information Visualization",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09969167/1IMicNIXex2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a125",
"title": "Color Coding of Large Value Ranges Applied to Meteorological Data",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a125/1J6hfQGSJj2",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/08/09318559",
"title": "Affective Congruence in Visualization Design: Influences on Reading Categorical Maps",
"doi": null,
"abstractUrl": "/journal/tg/2022/08/09318559/1qdT8m4QLIY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09229072",
"articleId": "1o3nzeZgQTe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09234027",
"articleId": "1o531wbxsSk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qL70Yk4BdC",
"name": "ttg202102-09222351s1-supp1-3030406.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222351s1-supp1-3030406.pdf",
"extension": "pdf",
"size": "12.8 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xibWU97C8w",
"doi": "10.1109/TVCG.2021.3114823",
"abstract": "Well-designed data visualizations can lead to more powerful and intuitive processing by a viewer. To help a viewer intuitively compare values to quickly generate key takeaways, visualization designers can manipulate how data values are arranged in a chart to afford particular comparisons. Using simple bar charts as a case study, we empirically tested the comparison affordances of four common arrangements: vertically juxtaposed, horizontally juxtaposed, overlaid, and stacked. We asked participants to type out what patterns they perceived in a chart and we coded their takeaways into types of comparisons. In a second study, we asked data visualization design experts to predict which arrangement they would use to afford each type of comparison and found both alignments and mismatches with our findings. These results provide concrete guidelines for how both human designers and automatic chart recommendation systems can make visualizations that help viewers extract the “right” takeaway.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Well-designed data visualizations can lead to more powerful and intuitive processing by a viewer. To help a viewer intuitively compare values to quickly generate key takeaways, visualization designers can manipulate how data values are arranged in a chart to afford particular comparisons. Using simple bar charts as a case study, we empirically tested the comparison affordances of four common arrangements: vertically juxtaposed, horizontally juxtaposed, overlaid, and stacked. We asked participants to type out what patterns they perceived in a chart and we coded their takeaways into types of comparisons. In a second study, we asked data visualization design experts to predict which arrangement they would use to afford each type of comparison and found both alignments and mismatches with our findings. These results provide concrete guidelines for how both human designers and automatic chart recommendation systems can make visualizations that help viewers extract the “right” takeaway.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Well-designed data visualizations can lead to more powerful and intuitive processing by a viewer. To help a viewer intuitively compare values to quickly generate key takeaways, visualization designers can manipulate how data values are arranged in a chart to afford particular comparisons. Using simple bar charts as a case study, we empirically tested the comparison affordances of four common arrangements: vertically juxtaposed, horizontally juxtaposed, overlaid, and stacked. We asked participants to type out what patterns they perceived in a chart and we coded their takeaways into types of comparisons. In a second study, we asked data visualization design experts to predict which arrangement they would use to afford each type of comparison and found both alignments and mismatches with our findings. These results provide concrete guidelines for how both human designers and automatic chart recommendation systems can make visualizations that help viewers extract the “right” takeaway.",
"title": "Visual Arrangements of Bar Charts Influence Comparisons in Viewer Takeaways",
"normalizedTitle": "Visual Arrangements of Bar Charts Influence Comparisons in Viewer Takeaways",
"fno": "09552208",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Bars",
"Data Visualization",
"Visualization",
"Tools",
"Semantics",
"Affordances",
"Task Analysis",
"Comparison",
"Perception",
"Visual Grouping",
"Bar Charts",
"Recommendation Systems",
"Natural Language Interaction"
],
"authors": [
{
"givenName": "Cindy",
"surname": "Xiong",
"fullName": "Cindy Xiong",
"affiliation": "UMass Amherst, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vidya",
"surname": "Setlur",
"fullName": "Vidya Setlur",
"affiliation": "Tableau Research, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Benjamin",
"surname": "Bach",
"fullName": "Benjamin Bach",
"affiliation": "University of Edinburgh, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eunyee",
"surname": "Koh",
"fullName": "Eunyee Koh",
"affiliation": "Adobe Research, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kylie",
"surname": "Lin",
"fullName": "Kylie Lin",
"affiliation": "Northwestern University, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steven",
"surname": "Franconeri",
"fullName": "Steven Franconeri",
"affiliation": "Northwestern University, United States",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "955-965",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/apsec/2017/3681/0/3681a612",
"title": "Characterising Sound Visualisations of Specifications Using Micro-Charts and Refinement",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2017/3681a612/12OmNx19jW6",
"parentPublication": {
"id": "proceedings/apsec/2017/3681/0",
"title": "2017 24th Asia-Pacific Software Engineering Conference (APSEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06876021",
"title": "Four Experiments on the Perception of Bar Charts",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06876021/13rRUNvgz9Q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904487",
"title": "Studying Early Decision Making with Progressive Bar Charts",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904487/1H1geE4olvG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904452",
"title": "Striking a Balance: Reader Takeaways and Preferences when Integrating Text and Charts",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904452/1H1gordOnfy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10002893",
"title": "Reasoning Affordances with Tables and Bar Charts",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10002893/1Jv6oNxHXqM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2022/9007/0/900700a067",
"title": "An Overview of the Design and Development for Dynamic and Physical Bar Charts",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2022/900700a067/1KaH61BvDWw",
"parentPublication": {
"id": "proceedings/iv/2022/9007/0",
"title": "2022 26th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807238",
"title": "A Comparison of Radial and Linear Charts for Visualizing Daily Patterns",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807238/1cG66qf6MKs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a163",
"title": "Proposal and Evaluation of Textual Description Templates for Bar Charts Vocalization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a163/1cMFc4aDtWo",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a151",
"title": "The Cost of Pie Charts",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a151/1cMFcqwGM5q",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09585700",
"title": "A Mixed-Initiative Approach to Reusing Infographic Charts",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09585700/1y11cGSPuPC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552591",
"articleId": "1xibWdHwteo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09555923",
"articleId": "1xlw0uXBKz6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBapBdnEru",
"name": "ttg202201-09552208s1-tvcg-3114823-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552208s1-tvcg-3114823-mm.zip",
"extension": "zip",
"size": "53.2 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCaLEju",
"title": "Jan.",
"year": "2018",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxAAT7J",
"doi": "10.1109/TVCG.2017.2744298",
"abstract": "We provide a reappraisal of Tal and Wansink's study “Blinded with Science”, where seemingly trivial charts were shown to increase belief in drug efficacy, presumably because charts are associated with science. Through a series of four replications conducted on two crowdsourcing platforms, we investigate an alternative explanation, namely, that the charts allowed participants to better assess the drug's efficacy. Considered together, our experiments suggest that the chart seems to have indeed promoted understanding, although the effect is likely very small. Meanwhile, we were unable to replicate the original study's findings, as text with chart appeared to be no more persuasive - and sometimes less persuasive - than text alone. This suggests that the effect may not be as robust as claimed and may need specific conditions to be reproduced. Regardless, within our experimental settings and considering our study as a whole (Z_$\\mathrm{N}=623$_Z), the chart's contribution to understanding was clearly larger than its contribution to persuasion.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We provide a reappraisal of Tal and Wansink's study “Blinded with Science”, where seemingly trivial charts were shown to increase belief in drug efficacy, presumably because charts are associated with science. Through a series of four replications conducted on two crowdsourcing platforms, we investigate an alternative explanation, namely, that the charts allowed participants to better assess the drug's efficacy. Considered together, our experiments suggest that the chart seems to have indeed promoted understanding, although the effect is likely very small. Meanwhile, we were unable to replicate the original study's findings, as text with chart appeared to be no more persuasive - and sometimes less persuasive - than text alone. This suggests that the effect may not be as robust as claimed and may need specific conditions to be reproduced. Regardless, within our experimental settings and considering our study as a whole ($\\mathrm{N}=623$), the chart's contribution to understanding was clearly larger than its contribution to persuasion.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We provide a reappraisal of Tal and Wansink's study “Blinded with Science”, where seemingly trivial charts were shown to increase belief in drug efficacy, presumably because charts are associated with science. Through a series of four replications conducted on two crowdsourcing platforms, we investigate an alternative explanation, namely, that the charts allowed participants to better assess the drug's efficacy. Considered together, our experiments suggest that the chart seems to have indeed promoted understanding, although the effect is likely very small. Meanwhile, we were unable to replicate the original study's findings, as text with chart appeared to be no more persuasive - and sometimes less persuasive - than text alone. This suggests that the effect may not be as robust as claimed and may need specific conditions to be reproduced. Regardless, within our experimental settings and considering our study as a whole (-), the chart's contribution to understanding was clearly larger than its contribution to persuasion.",
"title": "Blinded with Science or Informed by Charts? A Replication Study",
"normalizedTitle": "Blinded with Science or Informed by Charts? A Replication Study",
"fno": "08017611",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Drugs",
"Bars",
"Data Visualization",
"Sociology",
"Statistics",
"Data Mining",
"Replication Study",
"Persuasion",
"Charts",
"Data Comprehension",
"Methodology"
],
"authors": [
{
"givenName": "Pierre",
"surname": "Dragicevic",
"fullName": "Pierre Dragicevic",
"affiliation": "Inria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yvonne",
"surname": "Jansen",
"fullName": "Yvonne Jansen",
"affiliation": "Sorbonne UniversitésUPMC Univ Paris 6CNRSISIR",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "781-790",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2018/03/07845717",
"title": "Converting Basic D3 Charts into Reusable Style Templates",
"doi": null,
"abstractUrl": "/journal/tg/2018/03/07845717/13rRUxYINfm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904487",
"title": "Studying Early Decision Making with Progressive Bar Charts",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904487/1H1geE4olvG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807238",
"title": "A Comparison of Radial and Linear Charts for Visualizing Daily Patterns",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807238/1cG66qf6MKs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a163",
"title": "Proposal and Evaluation of Textual Description Templates for Bar Charts Vocalization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a163/1cMFc4aDtWo",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a151",
"title": "The Cost of Pie Charts",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a151/1cMFcqwGM5q",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/11/08989823",
"title": "CrowdChart: Crowdsourced Data Extraction From Visualization Charts",
"doi": null,
"abstractUrl": "/journal/tk/2021/11/08989823/1hlpoAzss9i",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101527",
"title": "Crowdsourcing-based Data Extraction from Visualization Charts",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101527/1kaMJ95VHQk",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciev-&-icivpr/2020/9331/0/09306660",
"title": "Dissimilarity Based Regularized Deep Learning Model for Information Charts",
"doi": null,
"abstractUrl": "/proceedings-article/iciev-&-icivpr/2020/09306660/1qcicge1wvC",
"parentPublication": {
"id": "proceedings/iciev-&-icivpr/2020/9331/0",
"title": "2020 Joint 9th International Conference on Informatics, Electronics & Vision (ICIEV) and 2020 4th International Conference on Imaging, Vision & Pattern Recognition (icIVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552881",
"title": "Modeling Just Noticeable Differences in Charts",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552881/1xibXzMLm9i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552930",
"title": "Kori: Interactive Synthesis of Text and Charts in Data Documents",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552930/1xic4JnxG2k",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08017606",
"articleId": "13rRUyYSWl5",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08017594",
"articleId": "13rRUyY28YC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvGPE8n",
"title": "Jan.",
"year": "2016",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjQyvn",
"doi": "10.1109/TVCG.2015.2467531",
"abstract": "We present TimeLineCurator, a browser-based authoring tool that automatically extracts event data from temporal references in unstructured text documents using natural language processing and encodes them along a visual timeline. Our goal is to facilitate the timeline creation process for journalists and others who tell temporal stories online. Current solutions involve manually extracting and formatting event data from source documents, a process that tends to be tedious and error prone. With TimeLineCurator, a prospective timeline author can quickly identify the extent of time encompassed by a document, as well as the distribution of events occurring along this timeline. Authors can speculatively browse possible documents to quickly determine whether they are appropriate sources of timeline material. TimeLineCurator provides controls for curating and editing events on a timeline, the ability to combine timelines from multiple source documents, and export curated timelines for online deployment. We evaluate TimeLineCurator through a benchmark comparison of entity extraction error against a manual timeline curation process, a preliminary evaluation of the user experience of timeline authoring, a brief qualitative analysis of its visual output, and a discussion of prospective use cases suggested by members of the target author communities following its deployment.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present TimeLineCurator, a browser-based authoring tool that automatically extracts event data from temporal references in unstructured text documents using natural language processing and encodes them along a visual timeline. Our goal is to facilitate the timeline creation process for journalists and others who tell temporal stories online. Current solutions involve manually extracting and formatting event data from source documents, a process that tends to be tedious and error prone. With TimeLineCurator, a prospective timeline author can quickly identify the extent of time encompassed by a document, as well as the distribution of events occurring along this timeline. Authors can speculatively browse possible documents to quickly determine whether they are appropriate sources of timeline material. TimeLineCurator provides controls for curating and editing events on a timeline, the ability to combine timelines from multiple source documents, and export curated timelines for online deployment. We evaluate TimeLineCurator through a benchmark comparison of entity extraction error against a manual timeline curation process, a preliminary evaluation of the user experience of timeline authoring, a brief qualitative analysis of its visual output, and a discussion of prospective use cases suggested by members of the target author communities following its deployment.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present TimeLineCurator, a browser-based authoring tool that automatically extracts event data from temporal references in unstructured text documents using natural language processing and encodes them along a visual timeline. Our goal is to facilitate the timeline creation process for journalists and others who tell temporal stories online. Current solutions involve manually extracting and formatting event data from source documents, a process that tends to be tedious and error prone. With TimeLineCurator, a prospective timeline author can quickly identify the extent of time encompassed by a document, as well as the distribution of events occurring along this timeline. Authors can speculatively browse possible documents to quickly determine whether they are appropriate sources of timeline material. TimeLineCurator provides controls for curating and editing events on a timeline, the ability to combine timelines from multiple source documents, and export curated timelines for online deployment. We evaluate TimeLineCurator through a benchmark comparison of entity extraction error against a manual timeline curation process, a preliminary evaluation of the user experience of timeline authoring, a brief qualitative analysis of its visual output, and a discussion of prospective use cases suggested by members of the target author communities following its deployment.",
"title": "TimeLineCurator: Interactive Authoring of Visual Timelines from Unstructured Text",
"normalizedTitle": "TimeLineCurator: Interactive Authoring of Visual Timelines from Unstructured Text",
"fno": "07192669",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Authoring Systems",
"Data Visualisation",
"Interactive Systems",
"Natural Language Processing",
"Text Analysis",
"Time Line Curator",
"Interactive Authoring",
"Visual Timelines",
"Browser Based Authoring Tool",
"Event Data Extraction",
"Temporal References",
"Unstructured Text Documents",
"Natural Language Processing",
"Timeline Creation Process",
"Temporal Stories",
"Event Data Formatting",
"Events Distribution",
"Timeline Material",
"Events Curating",
"Events Editing",
"Entity Extraction Error",
"Timeline Curation Process",
"User Experience",
"Timeline Authoring",
"Journalism",
"Visualization",
"Data Visualization",
"Data Mining",
"Manuals",
"Natural Language Processing",
"Pipelines",
"Context",
"System",
"Timelines",
"Authoring Environment",
"Time Oriented Data",
"Journalism",
"System",
"Timelines",
"Authoring Environment",
"Time Oriented Data",
"Journalism"
],
"authors": [
{
"givenName": "Johanna",
"surname": "Fulda",
"fullName": "Johanna Fulda",
"affiliation": ", University of Munich (LMU)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthew",
"surname": "Brehmel",
"fullName": "Matthew Brehmel",
"affiliation": ", University of British Columbia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tamara",
"surname": "Munzner",
"fullName": "Tamara Munzner",
"affiliation": ", University of British Columbia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2016-01-01 00:00:00",
"pubType": "trans",
"pages": "300-309",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sibgrapi/2015/7962/0/7962a234",
"title": "Linea: Building Timelines from Unstructured Text",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2015/7962a234/12OmNxHryln",
"parentPublication": {
"id": "proceedings/sibgrapi/2015/7962/0",
"title": "2015 28th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/jcdl/2005/876/0/04118551",
"title": "A focus-context browser for multiple timelines",
"doi": null,
"abstractUrl": "/proceedings-article/jcdl/2005/04118551/12OmNxwENyH",
"parentPublication": {
"id": "proceedings/jcdl/2005/876/0",
"title": "Proceedings of the 5th ACM/IEEE Joint Conference on Digital Libraries",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1996/7508/0/75080276",
"title": "Interactive Authoring of Multimedia Documents",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1996/75080276/12OmNy3iFh5",
"parentPublication": {
"id": "proceedings/vl/1996/7508/0",
"title": "Visual Languages, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2004/8603/2/01394447",
"title": "Dividable dynamic timeline-based authoring for SMI 2.0 presentations",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2004/01394447/12OmNy6qfQB",
"parentPublication": {
"id": "proceedings/icme/2004/8603/2",
"title": "2004 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2004/8603/2/01394445",
"title": "Reuse of SMI 2.0 scripts in dividable dynamic timeline-based authoring",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2004/01394445/12OmNyuy9Vu",
"parentPublication": {
"id": "proceedings/icme/2004/8603/2",
"title": "2004 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/09/07581076",
"title": "Timelines Revisited: A Design Space and Considerations for Expressive Storytelling",
"doi": null,
"abstractUrl": "/journal/tg/2017/09/07581076/13rRUxYrbUN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09912366",
"title": "Towards Natural Language-Based Visualization Authoring",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09912366/1HeiWkRN3tC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400c111",
"title": "Location Inference for Non-Geotagged Tweets in User Timelines [Extended Abstract]",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400c111/1aDSTXST9fO",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807266",
"title": "Towards Automated Infographic Design: Deep Learning-based Auto-Extraction of Extensible Timeline",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807266/1cG6bYWFt3W",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl-hcc/2019/0810/0/08818871",
"title": "Editable AI: Mixed Human-AI Authoring of Code Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/vl-hcc/2019/08818871/1dsfSMAJmwg",
"parentPublication": {
"id": "proceedings/vl-hcc/2019/0810/0",
"title": "2019 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07192703",
"articleId": "13rRUxjQyvo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07192715",
"articleId": "13rRUNvgz9T",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRRO",
"name": "ttg201601-07192669s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201601-07192669s1.zip",
"extension": "zip",
"size": "15.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1H1gordOnfy",
"doi": "10.1109/TVCG.2022.3209383",
"abstract": "While visualizations are an effective way to represent insights about information, they rarely stand alone. When designing a visualization, text is often added to provide additional context and guidance for the reader. However, there is little experimental evidence to guide designers as to what is the right amount of text to show within a chart, what its qualitative properties should be, and where it should be placed. Prior work also shows variation in personal preferences for charts versus textual representations. In this paper, we explore several research questions about the relative value of textual components of visualizations. 302 participants ranked univariate line charts containing varying amounts of text, ranging from no text (except for the axes) to a written paragraph with no visuals. Participants also described what information they could take away from line charts containing text with varying semantic content. We find that heavily annotated charts were not penalized. In fact, participants preferred the charts with the largest number of textual annotations over charts with fewer annotations or text alone. We also find effects of semantic content. For instance, the text that describes statistical or relational components of a chart leads to more takeaways referring to statistics or relational comparisons than text describing elemental or encoded components. Finally, we find different effects for the semantic levels based on the placement of the text on the chart; some kinds of information are best placed in the title, while others should be placed closer to the data. We compile these results into four chart design guidelines and discuss future implications for the combination of text and charts.",
"abstracts": [
{
"abstractType": "Regular",
"content": "While visualizations are an effective way to represent insights about information, they rarely stand alone. When designing a visualization, text is often added to provide additional context and guidance for the reader. However, there is little experimental evidence to guide designers as to what is the right amount of text to show within a chart, what its qualitative properties should be, and where it should be placed. Prior work also shows variation in personal preferences for charts versus textual representations. In this paper, we explore several research questions about the relative value of textual components of visualizations. 302 participants ranked univariate line charts containing varying amounts of text, ranging from no text (except for the axes) to a written paragraph with no visuals. Participants also described what information they could take away from line charts containing text with varying semantic content. We find that heavily annotated charts were not penalized. In fact, participants preferred the charts with the largest number of textual annotations over charts with fewer annotations or text alone. We also find effects of semantic content. For instance, the text that describes statistical or relational components of a chart leads to more takeaways referring to statistics or relational comparisons than text describing elemental or encoded components. Finally, we find different effects for the semantic levels based on the placement of the text on the chart; some kinds of information are best placed in the title, while others should be placed closer to the data. We compile these results into four chart design guidelines and discuss future implications for the combination of text and charts.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "While visualizations are an effective way to represent insights about information, they rarely stand alone. When designing a visualization, text is often added to provide additional context and guidance for the reader. However, there is little experimental evidence to guide designers as to what is the right amount of text to show within a chart, what its qualitative properties should be, and where it should be placed. Prior work also shows variation in personal preferences for charts versus textual representations. In this paper, we explore several research questions about the relative value of textual components of visualizations. 302 participants ranked univariate line charts containing varying amounts of text, ranging from no text (except for the axes) to a written paragraph with no visuals. Participants also described what information they could take away from line charts containing text with varying semantic content. We find that heavily annotated charts were not penalized. In fact, participants preferred the charts with the largest number of textual annotations over charts with fewer annotations or text alone. We also find effects of semantic content. For instance, the text that describes statistical or relational components of a chart leads to more takeaways referring to statistics or relational comparisons than text describing elemental or encoded components. Finally, we find different effects for the semantic levels based on the placement of the text on the chart; some kinds of information are best placed in the title, while others should be placed closer to the data. We compile these results into four chart design guidelines and discuss future implications for the combination of text and charts.",
"title": "Striking a Balance: Reader Takeaways and Preferences when Integrating Text and Charts",
"normalizedTitle": "Striking a Balance: Reader Takeaways and Preferences when Integrating Text and Charts",
"fno": "09904452",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Human Computer Interaction",
"Information Retrieval",
"Statistical Analysis",
"Text Analysis",
"Web Sites",
"Chart Design Guidelines",
"Heavily Annotated Charts",
"Integrating Text",
"Univariate Line Charts",
"Visuals",
"Visualization",
"Semantics",
"Data Visualization",
"Annotations",
"Electronic Mail",
"Market Research",
"Guidelines",
"Visualization",
"Text",
"Annotation",
"User Preference",
"Takeaways",
"Design",
"Line Charts"
],
"authors": [
{
"givenName": "Chase",
"surname": "Stokes",
"fullName": "Chase Stokes",
"affiliation": "UC Berkeley, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vidya",
"surname": "Setlur",
"fullName": "Vidya Setlur",
"affiliation": "Tableau Research, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bridget",
"surname": "Cogley",
"fullName": "Bridget Cogley",
"affiliation": "Versalytix, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arvind",
"surname": "Satyanarayan",
"fullName": "Arvind Satyanarayan",
"affiliation": "MIT CSAIL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marti A.",
"surname": "Hearst",
"fullName": "Marti A. Hearst",
"affiliation": "UC Berkeley, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "1233-1243",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2017/0831/0/0831a096",
"title": "Microtext Line Charts",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2017/0831a096/12OmNAqkSCW",
"parentPublication": {
"id": "proceedings/iv/2017/0831/0",
"title": "2017 21st International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdew/2013/5303/0/06547474",
"title": "Stock prediction by searching similar candlestick charts",
"doi": null,
"abstractUrl": "/proceedings-article/icdew/2013/06547474/12OmNyoiZcJ",
"parentPublication": {
"id": "proceedings/icdew/2013/5303/0",
"title": "2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2011/0868/0/06004025",
"title": "Design Considerations for Drill-down Charts",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2011/06004025/12OmNzSQdqN",
"parentPublication": {
"id": "proceedings/iv/2011/0868/0",
"title": "2011 15th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017611",
"title": "Blinded with Science or Informed by Charts? A Replication Study",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017611/13rRUxAAT7J",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/paap/2018/9403/0/940300a219",
"title": "Deep Candlestick Predictor: A Framework toward Forecasting the Price Movement from Candlestick Charts",
"doi": null,
"abstractUrl": "/proceedings-article/paap/2018/940300a219/19JE9bDyF4A",
"parentPublication": {
"id": "proceedings/paap/2018/9403/0",
"title": "2018 9th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aciiw/2022/5490/0/10086019",
"title": "Music Charts for Approximating Everyday Emotions: A Dataset of Daily Charts with Music Features from 106 Cities",
"doi": null,
"abstractUrl": "/proceedings-article/aciiw/2022/10086019/1M668FTwk5G",
"parentPublication": {
"id": "proceedings/aciiw/2022/5490/0",
"title": "2022 10th International Conference on Affective Computing and Intelligent Interaction Workshops and Demos (ACIIW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a163",
"title": "Proposal and Evaluation of Textual Description Templates for Bar Charts Vocalization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a163/1cMFc4aDtWo",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a151",
"title": "The Cost of Pie Charts",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a151/1cMFcqwGM5q",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/02/09472937",
"title": "ChartNavigator: An Interactive Pattern Identification and Annotation Framework for Charts",
"doi": null,
"abstractUrl": "/journal/tk/2023/02/09472937/1uUtsAHpq2Q",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552930",
"title": "Kori: Interactive Synthesis of Text and Charts in Data Documents",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552930/1xic4JnxG2k",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09912366",
"articleId": "1HeiWkRN3tC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09904479",
"articleId": "1H0GeYv7qog",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1J9yWNKkCAg",
"name": "ttg202301-09904452s1-tvcg-3209383-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09904452s1-tvcg-3209383-mm.zip",
"extension": "zip",
"size": "67.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45Wc1ILJ",
"doi": "10.1109/TVCG.2018.2865024",
"abstract": "Storing analytical provenance generates a knowledge base with a large potential for recalling previous results and guiding users in future analyses. However, without extensive manual creation of meta information and annotations by the users, search and retrieval of analysis states can become tedious. We present KnowledgePearls, a solution for efficient retrieval of analysis states that are structured as provenance graphs containing automatically recorded user interactions and visualizations. As a core component, we describe a visual interface for querying and exploring analysis states based on their similarity to a partial definition of a requested analysis state. Depending on the use case, this definition may be provided explicitly by the user by formulating a search query or inferred from given reference states. We explain our approach using the example of efficient retrieval of demographic analyses by Hans Rosling and discuss our implementation for a fast look-up of previous states. Our approach is independent of the underlying visualization framework. We discuss the applicability for visualizations which are based on the declarative grammar Vega and we use a Vega-based implementation of Gapminder as guiding example. We additionally present a biomedical case study to illustrate how KnowledgePearls facilitates the exploration process by recalling states from earlier analyses.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Storing analytical provenance generates a knowledge base with a large potential for recalling previous results and guiding users in future analyses. However, without extensive manual creation of meta information and annotations by the users, search and retrieval of analysis states can become tedious. We present KnowledgePearls, a solution for efficient retrieval of analysis states that are structured as provenance graphs containing automatically recorded user interactions and visualizations. As a core component, we describe a visual interface for querying and exploring analysis states based on their similarity to a partial definition of a requested analysis state. Depending on the use case, this definition may be provided explicitly by the user by formulating a search query or inferred from given reference states. We explain our approach using the example of efficient retrieval of demographic analyses by Hans Rosling and discuss our implementation for a fast look-up of previous states. Our approach is independent of the underlying visualization framework. We discuss the applicability for visualizations which are based on the declarative grammar Vega and we use a Vega-based implementation of Gapminder as guiding example. We additionally present a biomedical case study to illustrate how KnowledgePearls facilitates the exploration process by recalling states from earlier analyses.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Storing analytical provenance generates a knowledge base with a large potential for recalling previous results and guiding users in future analyses. However, without extensive manual creation of meta information and annotations by the users, search and retrieval of analysis states can become tedious. We present KnowledgePearls, a solution for efficient retrieval of analysis states that are structured as provenance graphs containing automatically recorded user interactions and visualizations. As a core component, we describe a visual interface for querying and exploring analysis states based on their similarity to a partial definition of a requested analysis state. Depending on the use case, this definition may be provided explicitly by the user by formulating a search query or inferred from given reference states. We explain our approach using the example of efficient retrieval of demographic analyses by Hans Rosling and discuss our implementation for a fast look-up of previous states. Our approach is independent of the underlying visualization framework. We discuss the applicability for visualizations which are based on the declarative grammar Vega and we use a Vega-based implementation of Gapminder as guiding example. We additionally present a biomedical case study to illustrate how KnowledgePearls facilitates the exploration process by recalling states from earlier analyses.",
"title": "<italic>KnowledgePearls</italic>: Provenance-Based Visualization Retrieval",
"normalizedTitle": "KnowledgePearls: Provenance-Based Visualization Retrieval",
"fno": "08440831",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Grammars",
"Graph Theory",
"Knowledge Based Systems",
"Query Processing",
"Meta Information",
"Knowledge Pearls",
"Provenance Graphs",
"Automatically Recorded User Interactions",
"Core Component",
"Visual Interface",
"Search Query",
"Demographic Analyses",
"Vega Based Implementation",
"Provenance Based Visualization Retrieval",
"Analytical Provenance",
"Knowledge Base",
"Analysis State",
"Reference States",
"Visualization Framework",
"Manual Creation",
"Meta Annotations",
"Declarative Grammar Vega",
"Data Visualization",
"Visualization",
"Indexes",
"History",
"Database Languages",
"Knowledge Based Systems",
"Grammar",
"Visualization Provenance",
"Interaction Provenance",
"Retrieval"
],
"authors": [
{
"givenName": "Holger",
"surname": "Stitz",
"fullName": "Holger Stitz",
"affiliation": "Johannes Kepler University, Linz, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Samuel",
"surname": "Gratzl",
"fullName": "Samuel Gratzl",
"affiliation": "Johannes Kepler University, Linz, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Harald",
"surname": "Piringer",
"fullName": "Harald Piringer",
"affiliation": "VRVis Research Center, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Zichner",
"fullName": "Thomas Zichner",
"affiliation": "Boehringer Ingelheim RCV GmbH & Co KG, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marc",
"surname": "Streit",
"fullName": "Marc Streit",
"affiliation": "Johannes Kepler University, Linz, Austria",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "120-130",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icws/2017/0752/0/0752a097",
"title": "Linking Design-Time and Run-Time: A Graph-Based Uniform Workflow Provenance Model",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2017/0752a097/12OmNAJ4ph8",
"parentPublication": {
"id": "proceedings/icws/2017/0752/0",
"title": "2017 IEEE International Conference on Web Services (ICWS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccgrid/2015/8006/0/8006a797",
"title": "Big Data Provenance Analysis and Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ccgrid/2015/8006a797/12OmNCm7BK6",
"parentPublication": {
"id": "proceedings/ccgrid/2015/8006/0",
"title": "2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pst/2012/2323/0/20943000S07",
"title": "A provenance-based access control model",
"doi": null,
"abstractUrl": "/proceedings-article/pst/2012/20943000S07/12OmNqGiu9w",
"parentPublication": {
"id": "proceedings/pst/2012/2323/0",
"title": "2012 Tenth Annual International Conference on Privacy, Security and Trust",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2010/5445/0/05447741",
"title": "Provenance browser: Displaying and querying scientific workflow provenance graphs",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2010/05447741/12OmNzaQos7",
"parentPublication": {
"id": "proceedings/icde/2010/5445/0",
"title": "2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192714",
"title": "Characterizing Provenance in Visualization and Data Analysis: An Organizational Framework of Provenance Types and Purposes",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192714/13rRUxOdD2F",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09768153",
"title": "Understanding How In-Visualization Provenance Can Support Trade-off Analysis",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09768153/1D6qPjvIP16",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/06/08788592",
"title": "Analytic Provenance in Practice: The Role of Provenance in Real-World Visualization and Data Analysis Environments",
"doi": null,
"abstractUrl": "/magazine/cg/2019/06/08788592/1cfqCMPtgRy",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/06/08864010",
"title": "A Provenance Task Abstraction Framework",
"doi": null,
"abstractUrl": "/magazine/cg/2019/06/08864010/1e0YpvcVR7y",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a116",
"title": "Trrack: A Library for Provenance-Tracking in Web-Based Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a116/1qRO3wCZWAE",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09652041",
"title": "Provectories: Embedding-based Analysis of Interaction Provenance Data",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09652041/1zmuReh8VZ6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440102",
"articleId": "17D45VsBU48",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08500765",
"articleId": "17D45WYQJ6B",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgI9",
"name": "ttg201901-08440831s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440831s1.zip",
"extension": "zip",
"size": "60 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45WnnFX7",
"doi": "10.1109/TVCG.2018.2865232",
"abstract": "Visual designs can be complex in modern data visualization systems, which poses special challenges for explaining them to the non-experts. However, few if any presentation tools are tailored for this purpose. In this study, we present Narvis, a slideshow authoring tool designed for introducing data visualizations to non-experts. Narvis targets two types of end users: teachers, experts in data visualization who produce tutorials for explaining a data visualization, and students, non-experts who try to understand visualization designs through tutorials. We present an analysis of requirements through close discussions with the two types of end users. The resulting considerations guide the design and implementation of Narvis. Additionally, to help teachers better organize their introduction slideshows, we specify a data visualization as a hierarchical combination of components, which are automatically detected and extracted by Narvis. The teachers craft an introduction slideshow through first organizing these components, and then explaining them sequentially. A series of templates are provided for adding annotations and animations to improve efficiency during the authoring process. We evaluate Narvis through a qualitative analysis of the authoring experience, and a preliminary evaluation of the generated slideshows.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visual designs can be complex in modern data visualization systems, which poses special challenges for explaining them to the non-experts. However, few if any presentation tools are tailored for this purpose. In this study, we present Narvis, a slideshow authoring tool designed for introducing data visualizations to non-experts. Narvis targets two types of end users: teachers, experts in data visualization who produce tutorials for explaining a data visualization, and students, non-experts who try to understand visualization designs through tutorials. We present an analysis of requirements through close discussions with the two types of end users. The resulting considerations guide the design and implementation of Narvis. Additionally, to help teachers better organize their introduction slideshows, we specify a data visualization as a hierarchical combination of components, which are automatically detected and extracted by Narvis. The teachers craft an introduction slideshow through first organizing these components, and then explaining them sequentially. A series of templates are provided for adding annotations and animations to improve efficiency during the authoring process. We evaluate Narvis through a qualitative analysis of the authoring experience, and a preliminary evaluation of the generated slideshows.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visual designs can be complex in modern data visualization systems, which poses special challenges for explaining them to the non-experts. However, few if any presentation tools are tailored for this purpose. In this study, we present Narvis, a slideshow authoring tool designed for introducing data visualizations to non-experts. Narvis targets two types of end users: teachers, experts in data visualization who produce tutorials for explaining a data visualization, and students, non-experts who try to understand visualization designs through tutorials. We present an analysis of requirements through close discussions with the two types of end users. The resulting considerations guide the design and implementation of Narvis. Additionally, to help teachers better organize their introduction slideshows, we specify a data visualization as a hierarchical combination of components, which are automatically detected and extracted by Narvis. The teachers craft an introduction slideshow through first organizing these components, and then explaining them sequentially. A series of templates are provided for adding annotations and animations to improve efficiency during the authoring process. We evaluate Narvis through a qualitative analysis of the authoring experience, and a preliminary evaluation of the generated slideshows.",
"title": "Narvis: Authoring Narrative Slideshows for Introducing Data Visualization Designs",
"normalizedTitle": "Narvis: Authoring Narrative Slideshows for Introducing Data Visualization Designs",
"fno": "08444072",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Authoring Systems",
"Data Visualisation",
"Authoring Narrative Slideshows",
"Visual Designs",
"Modern Data Visualization Systems",
"Narvis",
"Slideshow Authoring Tool",
"End Users",
"Introduction Slideshow",
"Data Visualization Designs",
"Animations",
"Authoring Process",
"Authoring Experience",
"Data Visualization",
"Tools",
"Visualization",
"Tutorials",
"Encoding",
"Videos",
"Interviews",
"Education",
"Narrative Visualization",
"Authoring Tools"
],
"authors": [
{
"givenName": "Qianwen",
"surname": "Wang",
"fullName": "Qianwen Wang",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhen",
"surname": "Li",
"fullName": "Zhen Li",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Siwei",
"surname": "Fu",
"fullName": "Siwei Fu",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weiwei",
"surname": "Cui",
"fullName": "Weiwei Cui",
"affiliation": "Microsoft Research Asia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "779-788",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2018/01/08017651",
"title": "Keeping Multiple Views Consistent: Constraints, Validations, and Exceptions in Visualization Authoring",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017651/13rRUNvyaf7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122406",
"title": "A Deeper Understanding of Sequence in Narrative Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122406/13rRUwIF6l7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539370",
"title": "Authoring Data-Driven Videos with DataClips",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539370/13rRUwvT9gw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122411",
"title": "Different Strokes for Different Folks: Visual Presentation Design between Disciplines",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122411/13rRUxNW1Zm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/beliv/2018/6884/0/08634297",
"title": "Reflecting on the Evaluation of Visualization Authoring Systems : Position Paper",
"doi": null,
"abstractUrl": "/proceedings-article/beliv/2018/08634297/17D45VTRozT",
"parentPublication": {
"id": "proceedings/beliv/2018/6884/0",
"title": "2018 IEEE Evaluation and Beyond - Methodological Approaches for Visualization (BELIV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/08/08611113",
"title": "MARVisT: Authoring Glyph-Based Visualization in Mobile Augmented Reality",
"doi": null,
"abstractUrl": "/journal/tg/2020/08/08611113/17D45Wuc367",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09912366",
"title": "Towards Natural Language-Based Visualization Authoring",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09912366/1HeiWkRN3tC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10081398",
"title": "How Does Automation Shape the Process of Narrative Visualization: A Survey of Tools",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10081398/1LRbRjcZeLK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807226",
"title": "Critical Reflections on Visualization Authoring Systems",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807226/1cG65OkeVu8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2019/9226/0/922600a237",
"title": "Designing Narrative Slideshows for Learning Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2019/922600a237/1cMF6FsJ8zK",
"parentPublication": {
"id": "proceedings/pacificvis/2019/9226/0",
"title": "2019 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440828",
"articleId": "17D45XfSESS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440827",
"articleId": "17D45WYQJ6A",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i41x9fMV8s",
"name": "ttg201901-08444072s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08444072s1.mp4",
"extension": "mp4",
"size": "9.42 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqG0SSe",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1LINrNziL28",
"doi": "10.1109/MCG.2023.3248289",
"abstract": "Existing dynamic weighted graph visualization approaches rely on users' mental comparison to perceive temporal evolution of dynamic weighted graphs, hindering users from effectively analyzing changes across multiple timeslices. We propose <italic>DiffSeer</italic>, a novel approach for dynamic weighted graph visualization by explicitly visualizing the <italic>differences</italic> of graph structures (e.g., edge weight differences) between adjacent timeslices. Specifically, we present a novel nested matrix design that overviews the graph structure differences over a time period as well as shows graph structure details in the timeslices of user interest. By collectively considering the overall temporal evolution and structure details in each timeslice, an optimization-based node reordering strategy is developed to group nodes with similar evolution patterns and highlight interesting graph structure details in each timeslice. We conducted two case studies on real-world graph datasets and in-depth interviews with 12 target users to evaluate <italic>DiffSeer</italic>. The results demonstrate its effectiveness in visualizing dynamic weighted graphs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Existing dynamic weighted graph visualization approaches rely on users' mental comparison to perceive temporal evolution of dynamic weighted graphs, hindering users from effectively analyzing changes across multiple timeslices. We propose <italic>DiffSeer</italic>, a novel approach for dynamic weighted graph visualization by explicitly visualizing the <italic>differences</italic> of graph structures (e.g., edge weight differences) between adjacent timeslices. Specifically, we present a novel nested matrix design that overviews the graph structure differences over a time period as well as shows graph structure details in the timeslices of user interest. By collectively considering the overall temporal evolution and structure details in each timeslice, an optimization-based node reordering strategy is developed to group nodes with similar evolution patterns and highlight interesting graph structure details in each timeslice. We conducted two case studies on real-world graph datasets and in-depth interviews with 12 target users to evaluate <italic>DiffSeer</italic>. The results demonstrate its effectiveness in visualizing dynamic weighted graphs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Existing dynamic weighted graph visualization approaches rely on users' mental comparison to perceive temporal evolution of dynamic weighted graphs, hindering users from effectively analyzing changes across multiple timeslices. We propose DiffSeer, a novel approach for dynamic weighted graph visualization by explicitly visualizing the differences of graph structures (e.g., edge weight differences) between adjacent timeslices. Specifically, we present a novel nested matrix design that overviews the graph structure differences over a time period as well as shows graph structure details in the timeslices of user interest. By collectively considering the overall temporal evolution and structure details in each timeslice, an optimization-based node reordering strategy is developed to group nodes with similar evolution patterns and highlight interesting graph structure details in each timeslice. We conducted two case studies on real-world graph datasets and in-depth interviews with 12 target users to evaluate DiffSeer. The results demonstrate its effectiveness in visualizing dynamic weighted graphs.",
"title": "<italic>DiffSeer</italic>: Difference-Based Dynamic Weighted Graph Visualization",
"normalizedTitle": "DiffSeer: Difference-Based Dynamic Weighted Graph Visualization",
"fno": "10078374",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Visualization",
"Color",
"Bars",
"Periodic Structures",
"Interviews",
"Inspection",
"Usability"
],
"authors": [
{
"givenName": "Xiaolin",
"surname": "Wen",
"fullName": "Xiaolin Wen",
"affiliation": "Sichuan University, Chengdu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yong",
"surname": "Wang",
"fullName": "Yong Wang",
"affiliation": "Singapore Management University, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Meixuan",
"surname": "Wu",
"fullName": "Meixuan Wu",
"affiliation": "Sichuan University, Chengdu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fengjie",
"surname": "Wang",
"fullName": "Fengjie Wang",
"affiliation": "Sichuan University, Chengdu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xuanwu",
"surname": "Yue",
"fullName": "Xuanwu Yue",
"affiliation": "Sinovation Ventures AI Institute, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qiaomu",
"surname": "Shen",
"fullName": "Qiaomu Shen",
"affiliation": "Southern University of Science and Technology, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuxin",
"surname": "Ma",
"fullName": "Yuxin Ma",
"affiliation": "Southern University of Science and Technology, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Min",
"surname": "Zhu",
"fullName": "Min Zhu",
"affiliation": "Sichuan University, Chengdu, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-03-01 00:00:00",
"pubType": "mags",
"pages": "1-13",
"year": "5555",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdmw/2009/3902/0/3902a058",
"title": "Weighted Frequent Subgraph Mining in Weighted Graph Databases",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2009/3902a058/12OmNAi6vUo",
"parentPublication": {
"id": "proceedings/icdmw/2009/3902/0",
"title": "2009 IEEE International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2009/4420/0/05459449",
"title": "Weighted graph characteristics from oriented line graph polynomials",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459449/12OmNwMFMls",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isda/2006/2528/1/252800486",
"title": "Weighted Rough Graph and Its Application",
"doi": null,
"abstractUrl": "/proceedings-article/isda/2006/252800486/12OmNzwHvcB",
"parentPublication": {
"id": "proceedings/isda/2006/2528/3",
"title": "Intelligent Systems Design and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/06/09705076",
"title": "<italic>GNNLens</italic>: A Visual Analytics Approach for Prediction Error Diagnosis of Graph Neural Networks",
"doi": null,
"abstractUrl": "/journal/tg/2023/06/09705076/1AIIbJW1goU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/06/09779964",
"title": "Mining Statistically Significant Communities From Weighted Networks",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09779964/1DBTtZMioNO",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10026343",
"title": "High-Quality Temporal Link Prediction for Weighted Dynamic Graphs Via Inductive Embedding Aggregation",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10026343/1KkXbTHLzoc",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msn/2022/6457/0/645700a803",
"title": "Publishing Weighted Graph with Node Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2022/645700a803/1LUtXKiR5oA",
"parentPublication": {
"id": "proceedings/msn/2022/6457/0",
"title": "2022 18th International Conference on Mobility, Sensing and Networking (MSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/04/09119147",
"title": "GFocus: User Focus-Based Graph Query Autocompletion",
"doi": null,
"abstractUrl": "/journal/tk/2022/04/09119147/1kHUE5yPqvK",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2022/06/09506836",
"title": "On the Merge of <italic>k</italic>-NN Graph",
"doi": null,
"abstractUrl": "/journal/bd/2022/06/09506836/1vNfkchrt1m",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552844",
"title": "<italic>KG4Vis:</italic> A Knowledge Graph-Based Approach for Visualization Recommendation",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552844/1xic3q426Os",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10061164",
"articleId": "1LiKRLrUKB2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10091124",
"articleId": "1M2ILm8imYM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xic0oVyd5m",
"doi": "10.1109/TVCG.2021.3114804",
"abstract": "Despite the rising popularity of automated visualization tools, existing systems tend to provide direct results which do not always fit the input data or meet visualization requirements. Therefore, additional specification adjustments are still required in real-world use cases. However, manual adjustments are difficult since most users do not necessarily possess adequate skills or visualization knowledge. Even experienced users might create imperfect visualizations that involve chart construction errors. We present a framework, VizLinter, to help users detect flaws and rectify already-built but defective visualizations. The framework consists of two components, (1) a visualization linter, which applies well-recognized principles to inspect the legitimacy of rendered visualizations, and (2) a visualization fixer, which automatically corrects the detected violations according to the linter. We implement the framework into an online editor prototype based on Vega-Lite specifications. To further evaluate the system, we conduct an in-lab user study. The results prove its effectiveness and efficiency in identifying and fixing errors for data visualizations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Despite the rising popularity of automated visualization tools, existing systems tend to provide direct results which do not always fit the input data or meet visualization requirements. Therefore, additional specification adjustments are still required in real-world use cases. However, manual adjustments are difficult since most users do not necessarily possess adequate skills or visualization knowledge. Even experienced users might create imperfect visualizations that involve chart construction errors. We present a framework, VizLinter, to help users detect flaws and rectify already-built but defective visualizations. The framework consists of two components, (1) a visualization linter, which applies well-recognized principles to inspect the legitimacy of rendered visualizations, and (2) a visualization fixer, which automatically corrects the detected violations according to the linter. We implement the framework into an online editor prototype based on Vega-Lite specifications. To further evaluate the system, we conduct an in-lab user study. The results prove its effectiveness and efficiency in identifying and fixing errors for data visualizations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Despite the rising popularity of automated visualization tools, existing systems tend to provide direct results which do not always fit the input data or meet visualization requirements. Therefore, additional specification adjustments are still required in real-world use cases. However, manual adjustments are difficult since most users do not necessarily possess adequate skills or visualization knowledge. Even experienced users might create imperfect visualizations that involve chart construction errors. We present a framework, VizLinter, to help users detect flaws and rectify already-built but defective visualizations. The framework consists of two components, (1) a visualization linter, which applies well-recognized principles to inspect the legitimacy of rendered visualizations, and (2) a visualization fixer, which automatically corrects the detected violations according to the linter. We implement the framework into an online editor prototype based on Vega-Lite specifications. To further evaluate the system, we conduct an in-lab user study. The results prove its effectiveness and efficiency in identifying and fixing errors for data visualizations.",
"title": "VizLinter: A Linter and Fixer Framework for Data Visualization",
"normalizedTitle": "VizLinter: A Linter and Fixer Framework for Data Visualization",
"fno": "09552878",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Rendering Computer Graphics",
"Visualization Linter",
"Rendering",
"Visualization Fixer",
"Data Visualization",
"Viz Linter",
"Fixer Framework",
"Chart Construction Errors",
"Linter Framework",
"Online Editor Prototype",
"Vega Lite Specifications",
"Data Visualization",
"Encoding",
"Visualization",
"Optimization",
"Tools",
"Programming",
"Codes",
"Visualization Linting",
"Automated Visualization Design",
"Visualization Optimization"
],
"authors": [
{
"givenName": "Qing",
"surname": "Chen",
"fullName": "Qing Chen",
"affiliation": "Intelligent Big Data Visualization Lab at Tongji University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fuling",
"surname": "Sun",
"fullName": "Fuling Sun",
"affiliation": "Intelligent Big Data Visualization Lab at Tongji University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xinyue",
"surname": "Xu",
"fullName": "Xinyue Xu",
"affiliation": "Intelligent Big Data Visualization Lab at Tongji University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zui",
"surname": "Chen",
"fullName": "Zui Chen",
"affiliation": "Intelligent Big Data Visualization Lab at Tongji University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiazhe",
"surname": "Wang",
"fullName": "Jiazhe Wang",
"affiliation": "Ant Group, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nan",
"surname": "Cao",
"fullName": "Nan Cao",
"affiliation": "Intelligent Big Data Visualization Lab at Tongji University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "206-216",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2010/06/ttg2010061164",
"title": "behaviorism: a framework for dynamic data visualization",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061164/13rRUEgs2to",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539624",
"title": "Vega-Lite: A Grammar of Interactive Graphics",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539624/13rRUIJuxvn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122406",
"title": "A Deeper Understanding of Sequence in Narrative Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122406/13rRUwIF6l7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192704",
"title": "Reactive Vega: A Streaming Dataflow Architecture for Declarative Interactive Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192704/13rRUx0gev9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08444072",
"title": "Narvis: Authoring Narrative Slideshows for Introducing Data Visualization Designs",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08444072/17D45WnnFX7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440858",
"title": "DXR: A Toolkit for Building Immersive Data Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440858/17D45XeKgxQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440080",
"title": "Design Exposition with Literate Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440080/17D45XoXP4o",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/05/08744242",
"title": "Data2Vis: Automatic Generation of Data Visualizations Using Sequence-to-Sequence Recurrent Neural Networks",
"doi": null,
"abstractUrl": "/magazine/cg/2019/05/08744242/1cFV5domibu",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222091",
"title": "StructGraphics: Flexible Visualization Design through Data-Agnostic and Reusable Graphical Structures",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222091/1nTroDgoFeo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557192",
"title": "Gosling: A Grammar-based Toolkit for Scalable and Interactive Genomics Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557192/1xlw1UFWxDa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552844",
"articleId": "1xic3q426Os",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09617561",
"articleId": "1yA76vDzhhC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zHDF1eMR4Q",
"name": "ttg202201-09552878s1-supp1-3114804.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552878s1-supp1-3114804.mp4",
"extension": "mp4",
"size": "7.69 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzFdtc6",
"title": "November/December",
"year": "2010",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2to",
"doi": "10.1109/TVCG.2010.126",
"abstract": "While a number of information visualization software frameworks exist, creating new visualizations, especially those that involve novel visualization metaphors, interaction techniques, data analysis strategies, and specialized rendering algorithms, is still often a difficult process. To facilitate the creation of novel visualizations we present a new software framework, behaviorism, which provides a wide range of flexibility when working with dynamic information on visual, temporal, and ontological levels, but at the same time providing appropriate abstractions which allow developers to create prototypes quickly which can then easily be turned into robust systems. The core of the framework is a set of three interconnected graphs, each with associated operators: a scene graph for high-performance 3D rendering, a data graph for different layers of semantically-linked heterogeneous data, and a timing graph for sophisticated control of scheduling, interaction, and animation. In particular, the timing graph provides a unified system to add behaviors to both data and visual elements, as well as to the behaviors themselves. To evaluate the framework we look briefly at three different projects all of which required novel visualizations in different domains, and all of which worked with dynamic data in different ways: an interactive ecological simulation, an information art installation, and an information visualization technique.",
"abstracts": [
{
"abstractType": "Regular",
"content": "While a number of information visualization software frameworks exist, creating new visualizations, especially those that involve novel visualization metaphors, interaction techniques, data analysis strategies, and specialized rendering algorithms, is still often a difficult process. To facilitate the creation of novel visualizations we present a new software framework, behaviorism, which provides a wide range of flexibility when working with dynamic information on visual, temporal, and ontological levels, but at the same time providing appropriate abstractions which allow developers to create prototypes quickly which can then easily be turned into robust systems. The core of the framework is a set of three interconnected graphs, each with associated operators: a scene graph for high-performance 3D rendering, a data graph for different layers of semantically-linked heterogeneous data, and a timing graph for sophisticated control of scheduling, interaction, and animation. In particular, the timing graph provides a unified system to add behaviors to both data and visual elements, as well as to the behaviors themselves. To evaluate the framework we look briefly at three different projects all of which required novel visualizations in different domains, and all of which worked with dynamic data in different ways: an interactive ecological simulation, an information art installation, and an information visualization technique.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "While a number of information visualization software frameworks exist, creating new visualizations, especially those that involve novel visualization metaphors, interaction techniques, data analysis strategies, and specialized rendering algorithms, is still often a difficult process. To facilitate the creation of novel visualizations we present a new software framework, behaviorism, which provides a wide range of flexibility when working with dynamic information on visual, temporal, and ontological levels, but at the same time providing appropriate abstractions which allow developers to create prototypes quickly which can then easily be turned into robust systems. The core of the framework is a set of three interconnected graphs, each with associated operators: a scene graph for high-performance 3D rendering, a data graph for different layers of semantically-linked heterogeneous data, and a timing graph for sophisticated control of scheduling, interaction, and animation. In particular, the timing graph provides a unified system to add behaviors to both data and visual elements, as well as to the behaviors themselves. To evaluate the framework we look briefly at three different projects all of which required novel visualizations in different domains, and all of which worked with dynamic data in different ways: an interactive ecological simulation, an information art installation, and an information visualization technique.",
"title": "behaviorism: a framework for dynamic data visualization",
"normalizedTitle": "behaviorism: a framework for dynamic data visualization",
"fno": "ttg2010061164",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Visualization",
"Rendering Computer Graphics",
"Timing",
"Data Models",
"Animation",
"Programming",
"Visual Design",
"Visualization System And Toolkit Design Primary Keyword",
"Time Varying Data",
"Streaming Data",
"Animation"
],
"authors": [
{
"givenName": "Angus Graeme",
"surname": "Forbes",
"fullName": "Angus Graeme Forbes",
"affiliation": "Media Arts & Technol. Dept., Univ. of California, Santa Barbara, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tobias",
"surname": "Höllerer",
"fullName": "Tobias Höllerer",
"affiliation": "Dept. of Comput. Sci., Univ. of California, Santa Barbara, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "George",
"surname": "Legrady",
"fullName": "George Legrady",
"affiliation": "Media Arts & Technol. Dept., Univ. of California, Santa Barbara, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2010-11-01 00:00:00",
"pubType": "trans",
"pages": "1164-1171",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pg/2002/1784/0/17840394",
"title": "Visualization of Multidimensional, Multivariate Volume Data Using Hardware-Accelerated Non-Photorealistic Rendering Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2002/17840394/12OmNB9KHwC",
"parentPublication": {
"id": "proceedings/pg/2002/1784/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200pekar",
"title": "Fast Detection of Meaningful Isosurfaces for Volume Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200pekar/12OmNCbU3bR",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156357",
"title": "Spherical layout and rendering methods for immersive graph visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156357/12OmNrFTr4v",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2012/4752/0/06400552",
"title": "Watch this: A taxonomy for dynamic data visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400552/12OmNxYtu2A",
"parentPublication": {
"id": "proceedings/vast/2012/4752/0",
"title": "2012 IEEE Conference on Visual Analytics Science and Technology (VAST 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498lum",
"title": "Kinetic Visualization - A Technique for Illustrating 3D Shape and Structure",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498lum/12OmNyNQSCD",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660074",
"title": "Visualization in the Einstein Year 2005: A Case Study on Explanatory and Illustrative Visualization of Relativity and Astrophysics",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660074/12OmNzTH0TG",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07536189",
"title": "VisFlow - Web-based Visualization Framework for Tabular Data with a Subset Flow Model",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07536189/13rRUwIF6dV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2007/06/mcg2007060080",
"title": "Visualization of Complex Automotive Data: A Tutorial",
"doi": null,
"abstractUrl": "/magazine/cg/2007/06/mcg2007060080/13rRUxBrGjl",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/04/08523628",
"title": "Scientific Visualization as a Microservice",
"doi": null,
"abstractUrl": "/journal/tg/2020/04/08523628/17D45WaTkiH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552878",
"title": "VizLinter: A Linter and Fixer Framework for Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552878/1xic0oVyd5m",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010061172",
"articleId": "13rRUEgs2BR",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010061182",
"articleId": "13rRUxjyX3T",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCbCrUN",
"title": "Dec.",
"year": "2013",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwIF6l7",
"doi": "10.1109/TVCG.2013.119",
"abstract": "Conveying a narrative with visualizations often requires choosing an order in which to present visualizations. While evidence exists that narrative sequencing in traditional stories can affect comprehension and memory, little is known about how sequencing choices affect narrative visualization. We consider the forms and reactions to sequencing in narrative visualization presentations to provide a deeper understanding with a focus on linear, 'slideshow-style' presentations. We conduct a qualitative analysis of 42 professional narrative visualizations to gain empirical knowledge on the forms that structure and sequence take. Based on the results of this study we propose a graph-driven approach for automatically identifying effective sequences in a set of visualizations to be presented linearly. Our approach identifies possible transitions in a visualization set and prioritizes local (visualization-to-visualization) transitions based on an objective function that minimizes the cost of transitions from the audience perspective. We conduct two studies to validate this function. We also expand the approach with additional knowledge of user preferences for different types of local transitions and the effects of global sequencing strategies on memory, preference, and comprehension. Our results include a relative ranking of types of visualization transitions by the audience perspective and support for memory and subjective rating benefits of visualization sequences that use parallelism as a structural device. We discuss how these insights can guide the design of narrative visualization and systems that support optimization of visualization sequence.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Conveying a narrative with visualizations often requires choosing an order in which to present visualizations. While evidence exists that narrative sequencing in traditional stories can affect comprehension and memory, little is known about how sequencing choices affect narrative visualization. We consider the forms and reactions to sequencing in narrative visualization presentations to provide a deeper understanding with a focus on linear, 'slideshow-style' presentations. We conduct a qualitative analysis of 42 professional narrative visualizations to gain empirical knowledge on the forms that structure and sequence take. Based on the results of this study we propose a graph-driven approach for automatically identifying effective sequences in a set of visualizations to be presented linearly. Our approach identifies possible transitions in a visualization set and prioritizes local (visualization-to-visualization) transitions based on an objective function that minimizes the cost of transitions from the audience perspective. We conduct two studies to validate this function. We also expand the approach with additional knowledge of user preferences for different types of local transitions and the effects of global sequencing strategies on memory, preference, and comprehension. Our results include a relative ranking of types of visualization transitions by the audience perspective and support for memory and subjective rating benefits of visualization sequences that use parallelism as a structural device. We discuss how these insights can guide the design of narrative visualization and systems that support optimization of visualization sequence.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Conveying a narrative with visualizations often requires choosing an order in which to present visualizations. While evidence exists that narrative sequencing in traditional stories can affect comprehension and memory, little is known about how sequencing choices affect narrative visualization. We consider the forms and reactions to sequencing in narrative visualization presentations to provide a deeper understanding with a focus on linear, 'slideshow-style' presentations. We conduct a qualitative analysis of 42 professional narrative visualizations to gain empirical knowledge on the forms that structure and sequence take. Based on the results of this study we propose a graph-driven approach for automatically identifying effective sequences in a set of visualizations to be presented linearly. Our approach identifies possible transitions in a visualization set and prioritizes local (visualization-to-visualization) transitions based on an objective function that minimizes the cost of transitions from the audience perspective. We conduct two studies to validate this function. We also expand the approach with additional knowledge of user preferences for different types of local transitions and the effects of global sequencing strategies on memory, preference, and comprehension. Our results include a relative ranking of types of visualization transitions by the audience perspective and support for memory and subjective rating benefits of visualization sequences that use parallelism as a structural device. We discuss how these insights can guide the design of narrative visualization and systems that support optimization of visualization sequence.",
"title": "A Deeper Understanding of Sequence in Narrative Visualization",
"normalizedTitle": "A Deeper Understanding of Sequence in Narrative Visualization",
"fno": "ttg2013122406",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Sequential Analysis",
"Parallel Processing",
"Encoding",
"Linear Programming",
"Narrative Visualization",
"Data Visualization",
"Sequential Analysis",
"Parallel Processing",
"Encoding",
"Linear Programming",
"Narrative Structure",
"Data Storytelling"
],
"authors": [
{
"givenName": "Jessica",
"surname": "Hullman",
"fullName": "Jessica Hullman",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steven",
"surname": "Drucker",
"fullName": "Steven Drucker",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nathalie Henry",
"surname": "Riche",
"fullName": "Nathalie Henry Riche",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Bongshin Lee",
"fullName": "Bongshin Lee",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Danyel",
"surname": "Fisher",
"fullName": "Danyel Fisher",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eytan",
"surname": "Adar",
"fullName": "Eytan Adar",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2013-12-01 00:00:00",
"pubType": "trans",
"pages": "2406-2415",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2014/4103/0/4103a046",
"title": "Narrative Visualization: A Case Study of How to Incorporate Narrative Elements in Existing Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2014/4103a046/12OmNvjQ8Pa",
"parentPublication": {
"id": "proceedings/iv/2014/4103/0",
"title": "2014 18th International Conference on Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061139",
"title": "Narrative Visualization: Telling Stories with Data",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061139/13rRUxAAST1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122231",
"title": "Visualization Rhetoric: Framing Effects in Narrative Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122231/13rRUxBJhFs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/beliv/2018/6884/0/08634072",
"title": "A Micro-Phenomenological Lens for Evaluating Narrative Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/beliv/2018/08634072/17D45VsBTXI",
"parentPublication": {
"id": "proceedings/beliv/2018/6884/0",
"title": "2018 IEEE Evaluation and Beyond - Methodological Approaches for Visualization (BELIV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440080",
"title": "Design Exposition with Literate Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440080/17D45XoXP4o",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10081398",
"title": "How Does Automation Shape the Process of Narrative Visualization: A Survey of Tools",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10081398/1LRbRjcZeLK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a044",
"title": "Once Upon a Time in a Land Far Away: Guidelines for Spatio-Temporal Narrative Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a044/1cMF8rgW5na",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222357",
"title": "Once Upon A Time In Visualization: Understanding the Use of Textual Narratives for Causality",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222357/1nTqwapYWYw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222251",
"title": "Designing Narrative-Focused Role-Playing Games for Visualization Literacy in Young Children",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222251/1nTr15tWhvq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a151",
"title": "Narrative Transitions in Data Videos",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a151/1qRNOUZefuw",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013122396",
"articleId": "13rRUxBa5nm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013122416",
"articleId": "13rRUwIF69k",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgJN",
"name": "ttg2013122406s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013122406s.pdf",
"extension": "pdf",
"size": "165 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1qL5hsvvVkc",
"title": "Feb.",
"year": "2021",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1nTroDgoFeo",
"doi": "10.1109/TVCG.2020.3030476",
"abstract": "Information visualization research has developed powerful systems that enable users to author custom data visualizations without textual programming. These systems can support graphics-driven practices by bridging lazy data-binding mechanisms with vector-graphics editing tools. Yet, despite their expressive power, visualization authoring systems often assume that users want to generate visual representations that they already have in mind rather than explore designs. They also impose a data-to-graphics workflow, where binding data dimensions to graphical properties is a necessary step for generating visualization layouts. In this paper, we introduce StructGraphics, an approach for creating data-agnostic and fully reusable visualization designs. StructGraphics enables designers to construct visualization designs by drawing graphics on a canvas and then structuring their visual properties without relying on a concrete dataset or data schema. In StructGraphics, tabular data structures are derived directly from the structure of the graphics. Later, designers can link these structures with real datasets through a spreadsheet user interface. StructGraphics supports the design and reuse of complex data visualizations by combining graphical property sharing, by-example design specification, and persistent layout constraints. We demonstrate the power of the approach through a gallery of visualization examples and reflect on its strengths and limitations in interaction with graphic designers and data visualization experts.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Information visualization research has developed powerful systems that enable users to author custom data visualizations without textual programming. These systems can support graphics-driven practices by bridging lazy data-binding mechanisms with vector-graphics editing tools. Yet, despite their expressive power, visualization authoring systems often assume that users want to generate visual representations that they already have in mind rather than explore designs. They also impose a data-to-graphics workflow, where binding data dimensions to graphical properties is a necessary step for generating visualization layouts. In this paper, we introduce StructGraphics, an approach for creating data-agnostic and fully reusable visualization designs. StructGraphics enables designers to construct visualization designs by drawing graphics on a canvas and then structuring their visual properties without relying on a concrete dataset or data schema. In StructGraphics, tabular data structures are derived directly from the structure of the graphics. Later, designers can link these structures with real datasets through a spreadsheet user interface. StructGraphics supports the design and reuse of complex data visualizations by combining graphical property sharing, by-example design specification, and persistent layout constraints. We demonstrate the power of the approach through a gallery of visualization examples and reflect on its strengths and limitations in interaction with graphic designers and data visualization experts.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Information visualization research has developed powerful systems that enable users to author custom data visualizations without textual programming. These systems can support graphics-driven practices by bridging lazy data-binding mechanisms with vector-graphics editing tools. Yet, despite their expressive power, visualization authoring systems often assume that users want to generate visual representations that they already have in mind rather than explore designs. They also impose a data-to-graphics workflow, where binding data dimensions to graphical properties is a necessary step for generating visualization layouts. In this paper, we introduce StructGraphics, an approach for creating data-agnostic and fully reusable visualization designs. StructGraphics enables designers to construct visualization designs by drawing graphics on a canvas and then structuring their visual properties without relying on a concrete dataset or data schema. In StructGraphics, tabular data structures are derived directly from the structure of the graphics. Later, designers can link these structures with real datasets through a spreadsheet user interface. StructGraphics supports the design and reuse of complex data visualizations by combining graphical property sharing, by-example design specification, and persistent layout constraints. We demonstrate the power of the approach through a gallery of visualization examples and reflect on its strengths and limitations in interaction with graphic designers and data visualization experts.",
"title": "StructGraphics: Flexible Visualization Design through Data-Agnostic and Reusable Graphical Structures",
"normalizedTitle": "StructGraphics: Flexible Visualization Design through Data-Agnostic and Reusable Graphical Structures",
"fno": "09222091",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Authoring Systems",
"Computer Graphics",
"Data Structures",
"Data Visualisation",
"Interactive Systems",
"Spreadsheet Programs",
"User Interfaces",
"Fully Reusable Visualization Designs",
"Struct Graphics",
"Visual Properties",
"Concrete Dataset",
"Tabular Data Structures",
"Spreadsheet User Interface",
"Complex Data Visualizations",
"Graphical Property Sharing",
"By Example Design Specification",
"Visualization Examples",
"Graphic Designers",
"Data Visualization Experts",
"Flexible Visualization Design",
"Reusable Graphical Structures",
"Information Visualization Research",
"Powerful Systems",
"Author Custom Data Visualizations",
"Textual Programming",
"Graphics Driven Practices",
"Lazy Data Binding Mechanisms",
"Vector Graphics Editing Tools",
"Expressive Power",
"Visualization Authoring Systems",
"Visual Representations",
"Explore Designs",
"Data To Graphics Workflow",
"Binding Data Dimensions",
"Visualization Layouts",
"Data Agnostic Structures",
"Data Visualization",
"Layout",
"Visualization",
"Tools",
"Programming",
"Task Analysis",
"Visualization Design",
"Graphical Structures",
"Visualization Grammars",
"Layout Constraints",
"Infographics",
"Flexible Data Binding"
],
"authors": [
{
"givenName": "Theophanis",
"surname": "Tsandilas",
"fullName": "Theophanis Tsandilas",
"affiliation": "Inria & CNRS, Université Paris-Saclay, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "315-325",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ozchi/1996/7525/0/75250213",
"title": "Interactive Design Metric Visualisation: Visual Metric Support for User Interface Design",
"doi": null,
"abstractUrl": "/proceedings-article/ozchi/1996/75250213/12OmNxHJ9vO",
"parentPublication": {
"id": "proceedings/ozchi/1996/7525/0",
"title": "Proceedings Sixth Australian Conference on Computer-Human Interaction",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/10/07593375",
"title": "An Exploratory Study of Word-Scale Graphics in Data-Rich Text Documents",
"doi": null,
"abstractUrl": "/journal/tg/2017/10/07593375/13rRUIJuxvo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061121",
"title": "Protovis: A Graphical Toolkit for Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061121/13rRUxAAST0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440847",
"title": "Formalizing Visualization Design Knowledge as Constraints: Actionable and Extensible Models in Draco",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440847/17D45VtKix5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440858",
"title": "DXR: A Toolkit for Building Immersive Data Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440858/17D45XeKgxQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09765327",
"title": "Graphical Enhancements for Effective Exemplar Identification in Contextual Data Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09765327/1CWoKyrHUze",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08816695",
"title": "Data Changes Everything: Challenges and Opportunities in Data Visualization Design Handoff",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08816695/1cPXqoConx6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/04/08889698",
"title": "Expressive Authoring of Node-Link Diagrams With Graphies",
"doi": null,
"abstractUrl": "/journal/tg/2021/04/08889698/1eBufwF6gne",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089446",
"title": "Graphical Perception for Immersive Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089446/1jIxfA3tlUk",
"parentPublication": {
"id": "proceedings/vr/2020/5608/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/09/09354592",
"title": "Scalable Scalable Vector Graphics: Automatic Translation of Interactive SVGs to a Multithread VDOM for Fast Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2022/09/09354592/1reXwRinuhy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222289",
"articleId": "1nTqMd2ZViE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09222358",
"articleId": "1nTqkoBRxsc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLfBJkV0qs",
"name": "ttg202102-09222091s1-tvcg-3030476-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222091s1-tvcg-3030476-mm.zip",
"extension": "zip",
"size": "18.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1smCYMGo6gE",
"title": "March-April",
"year": "2021",
"issueNum": "02",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "23",
"label": "March-April",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1sq7sW0pjWM",
"doi": "10.1109/MCSE.2021.3052619",
"abstract": "Interactive visualizations are at the core of the exploratory data analysis process, enabling users to directly manipulate and gain insights from data. In this article, we present three different ways in which interactive visualizations can be included in Jupyter Notebooks: 1) matplotlib callbacks; 2) visualization toolkits; and 3) embedding HTML visualizations. We hope that this article will help developers to select the best tools to build their interactive charts in Jupyter Notebooks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Interactive visualizations are at the core of the exploratory data analysis process, enabling users to directly manipulate and gain insights from data. In this article, we present three different ways in which interactive visualizations can be included in Jupyter Notebooks: 1) matplotlib callbacks; 2) visualization toolkits; and 3) embedding HTML visualizations. We hope that this article will help developers to select the best tools to build their interactive charts in Jupyter Notebooks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Interactive visualizations are at the core of the exploratory data analysis process, enabling users to directly manipulate and gain insights from data. In this article, we present three different ways in which interactive visualizations can be included in Jupyter Notebooks: 1) matplotlib callbacks; 2) visualization toolkits; and 3) embedding HTML visualizations. We hope that this article will help developers to select the best tools to build their interactive charts in Jupyter Notebooks.",
"title": "Interactive Data Visualization in Jupyter Notebooks",
"normalizedTitle": "Interactive Data Visualization in Jupyter Notebooks",
"fno": "09391750",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Human Computer Interaction",
"Hypermedia Markup Languages",
"Matplotlib Callbacks",
"Visualization Toolkits",
"Interactive Charts",
"HTML Visualizations",
"Exploratory Data Analysis Process",
"Jupyter Notebooks",
"Interactive Data Visualization",
"Data Analysis",
"Data Visualization",
"Tools"
],
"authors": [
{
"givenName": "Jorge",
"surname": "Piazentin Ono",
"fullName": "Jorge Piazentin Ono",
"affiliation": "New York University, Brooklyn, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Juliana",
"surname": "Freire",
"fullName": "Juliana Freire",
"affiliation": "New York University, Brooklyn, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Claudio T.",
"surname": "Silva",
"fullName": "Claudio T. Silva",
"affiliation": "New York University, Brooklyn, NY, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-03-01 00:00:00",
"pubType": "mags",
"pages": "99-106",
"year": "2021",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/msr/2022/9303/0/930300a353",
"title": "A Large-Scale Comparison of Python Code in Jupyter Notebooks and Scripts",
"doi": null,
"abstractUrl": "/proceedings-article/msr/2022/930300a353/1Eo5TqModr2",
"parentPublication": {
"id": "proceedings/msr/2022/9303/0",
"title": "2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpc/2022/9298/0/929800a253",
"title": "Error Identification Strategies for Python Jupyter Notebooks",
"doi": null,
"abstractUrl": "/proceedings-article/icpc/2022/929800a253/1EpKDu1Oj96",
"parentPublication": {
"id": "proceedings/icpc/2022/9298/0",
"title": "2022 IEEE/ACM 30th International Conference on Program Comprehension (ICPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2022/5537/0/553700a462",
"title": "Why Visualize Data When Coding? Preliminary Categories for Coding in Jupyter Notebooks",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2022/553700a462/1KOv8gA605W",
"parentPublication": {
"id": "proceedings/apsec/2022/5537/0",
"title": "2022 29th Asia-Pacific Software Engineering Conference (APSEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ucc/2022/6087/0/608700a327",
"title": "Provenance-enhanced Root Cause Analysis for Jupyter Notebooks",
"doi": null,
"abstractUrl": "/proceedings-article/ucc/2022/608700a327/1LvAd5lFkt2",
"parentPublication": {
"id": "proceedings/ucc/2022/6087/0",
"title": "2022 IEEE/ACM 15th International Conference on Utility and Cloud Computing (UCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msr/2019/3412/0/341200a507",
"title": "A Large-Scale Study About Quality and Reproducibility of Jupyter Notebooks",
"doi": null,
"abstractUrl": "/proceedings-article/msr/2019/341200a507/1dx9B2iw0yA",
"parentPublication": {
"id": "proceedings/msr/2019/3412/0",
"title": "2019 IEEE/ACM 16th International Conference on Mining Software Repositories (MSR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl-hcc/2020/6901/0/09127202",
"title": "Code Duplication and Reuse in Jupyter Notebooks",
"doi": null,
"abstractUrl": "/proceedings-article/vl-hcc/2020/09127202/1lvPYgKXJUQ",
"parentPublication": {
"id": "proceedings/vl-hcc/2020/6901/0",
"title": "2020 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2020/6768/0/676800a138",
"title": "Assessing and Restoring Reproducibility of Jupyter Notebooks",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2020/676800a138/1pP3NxIN8gE",
"parentPublication": {
"id": "proceedings/ase/2020/6768/0",
"title": "2020 35th IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-companion/2020/7122/0/712200a288",
"title": "Restoring Reproducibility of Jupyter Notebooks",
"doi": null,
"abstractUrl": "/proceedings-article/icse-companion/2020/712200a288/1pcSJA1tV0Q",
"parentPublication": {
"id": "proceedings/icse-companion/2020/7122/0",
"title": "2020 IEEE/ACM 42nd International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msr/2021/8710/0/871000a550",
"title": "KGTorrent: A Dataset of Python Jupyter Notebooks from Kaggle",
"doi": null,
"abstractUrl": "/proceedings-article/msr/2021/871000a550/1tB7kckbXBS",
"parentPublication": {
"id": "proceedings/msr/2021/8710/0/",
"title": "2021 IEEE/ACM 18th International Conference on Mining Software Repositories (MSR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/escience/2021/0361/0/036100a030",
"title": "Context-aware Execution Migration Tool for Data Science Jupyter Notebooks on Hybrid Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/escience/2021/036100a030/1y14EwiYJgI",
"parentPublication": {
"id": "proceedings/escience/2021/0361/0",
"title": "2021 IEEE 17th International Conference on eScience (eScience)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09387494",
"articleId": "1smD2RIVLos",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09387480",
"articleId": "1smD0lkNTeE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xic3q426Os",
"doi": "10.1109/TVCG.2021.3114863",
"abstract": "Visualization recommendation or automatic visualization generation can significantly lower the barriers for general users to rapidly create effective data visualizations, especially for those users without a background in data visualizations. However, existing rule-based approaches require tedious manual specifications of visualization rules by visualization experts. Other machine learning-based approaches often work like black-box and are difficult to understand why a specific visualization is recommended, limiting the wider adoption of these approaches. This paper fills the gap by presenting KG4Vis, a knowledge graph (KG)-based approach for visualization recommendation. It does not require manual specifications of visualization rules and can also guarantee good explainability. Specifically, we propose a framework for building knowledge graphs, consisting of three types of entities (i.e., data features, data columns and visualization design choices) and the relations between them, to model the mapping rules between data and effective visualizations. A TransE-based embedding technique is employed to learn the embeddings of both entities and relations of the knowledge graph from existing dataset-visualization pairs. Such embeddings intrinsically model the desirable visualization rules. Then, given a new dataset, effective visualizations can be inferred from the knowledge graph with semantically meaningful rules. We conducted extensive evaluations to assess the proposed approach, including quantitative comparisons, case studies and expert interviews. The results demonstrate the effectiveness of our approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visualization recommendation or automatic visualization generation can significantly lower the barriers for general users to rapidly create effective data visualizations, especially for those users without a background in data visualizations. However, existing rule-based approaches require tedious manual specifications of visualization rules by visualization experts. Other machine learning-based approaches often work like black-box and are difficult to understand why a specific visualization is recommended, limiting the wider adoption of these approaches. This paper fills the gap by presenting KG4Vis, a knowledge graph (KG)-based approach for visualization recommendation. It does not require manual specifications of visualization rules and can also guarantee good explainability. Specifically, we propose a framework for building knowledge graphs, consisting of three types of entities (i.e., data features, data columns and visualization design choices) and the relations between them, to model the mapping rules between data and effective visualizations. A TransE-based embedding technique is employed to learn the embeddings of both entities and relations of the knowledge graph from existing dataset-visualization pairs. Such embeddings intrinsically model the desirable visualization rules. Then, given a new dataset, effective visualizations can be inferred from the knowledge graph with semantically meaningful rules. We conducted extensive evaluations to assess the proposed approach, including quantitative comparisons, case studies and expert interviews. The results demonstrate the effectiveness of our approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visualization recommendation or automatic visualization generation can significantly lower the barriers for general users to rapidly create effective data visualizations, especially for those users without a background in data visualizations. However, existing rule-based approaches require tedious manual specifications of visualization rules by visualization experts. Other machine learning-based approaches often work like black-box and are difficult to understand why a specific visualization is recommended, limiting the wider adoption of these approaches. This paper fills the gap by presenting KG4Vis, a knowledge graph (KG)-based approach for visualization recommendation. It does not require manual specifications of visualization rules and can also guarantee good explainability. Specifically, we propose a framework for building knowledge graphs, consisting of three types of entities (i.e., data features, data columns and visualization design choices) and the relations between them, to model the mapping rules between data and effective visualizations. A TransE-based embedding technique is employed to learn the embeddings of both entities and relations of the knowledge graph from existing dataset-visualization pairs. Such embeddings intrinsically model the desirable visualization rules. Then, given a new dataset, effective visualizations can be inferred from the knowledge graph with semantically meaningful rules. We conducted extensive evaluations to assess the proposed approach, including quantitative comparisons, case studies and expert interviews. The results demonstrate the effectiveness of our approach.",
"title": "<italic>KG4Vis:</italic> A Knowledge Graph-Based Approach for Visualization Recommendation",
"normalizedTitle": "KG4Vis: A Knowledge Graph-Based Approach for Visualization Recommendation",
"fno": "09552844",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Graph Theory",
"Learning Artificial Intelligence",
"Automatic Visualization Generation",
"Effective Data Visualizations",
"Existing Rule Based Approaches",
"Tedious Manual Specifications",
"Visualization Experts",
"Machine Learning Based Approaches",
"Specific Visualization",
"Knowledge Graph Based Approach",
"Visualization Recommendation",
"Visualization Design Choices",
"Effective Visualizations",
"Trans E Based",
"Dataset Visualization Pairs",
"Desirable Visualization Rules",
"Data Visualization",
"Feature Extraction",
"Tools",
"Manuals",
"Data Models",
"Visualization",
"Interviews",
"Data Visualization",
"Visualization Recommendation",
"Knowledge Graph"
],
"authors": [
{
"givenName": "Haotian",
"surname": "Li",
"fullName": "Haotian Li",
"affiliation": "Hong Kong University of Science and Technology and Singapore Management University, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yong",
"surname": "Wang",
"fullName": "Yong Wang",
"affiliation": "Singapore Management University, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Songheng",
"surname": "Zhang",
"fullName": "Songheng Zhang",
"affiliation": "Singapore Management University, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yangqiu",
"surname": "Song",
"fullName": "Yangqiu Song",
"affiliation": "Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "195-205",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/2012/4525/0/4525e001",
"title": "Dynamic Knowledge Mapping: A Visualization Approach for Knowledge Management Systems",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2012/4525e001/12OmNASraz1",
"parentPublication": {
"id": "proceedings/hicss/2012/4525/0",
"title": "2012 45th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2004/2177/0/21770519",
"title": "Learning from Architects: The Difference between Knowledge Visualization and Information Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2004/21770519/12OmNx9nGLN",
"parentPublication": {
"id": "proceedings/iv/2004/2177/0",
"title": "Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2008/3357/2/3357c767",
"title": "The Application of Visualization Technology on Knowledge Management",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2008/3357c767/12OmNzFv4hI",
"parentPublication": {
"id": "icicta/2008/3357/2",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2018/5520/0/552000a101",
"title": "DeepEye: Towards Automatic Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2018/552000a101/14Fq0VI6tcV",
"parentPublication": {
"id": "proceedings/icde/2018/5520/0",
"title": "2018 IEEE 34th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440831",
"title": "<italic>KnowledgePearls</italic>: Provenance-Based Visualization Retrieval",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440831/17D45Wc1ILJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08444072",
"title": "Narvis: Authoring Narrative Slideshows for Introducing Data Visualization Designs",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08444072/17D45WnnFX7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903511",
"title": "Supporting Expressive and Faithful Pictorial Visualization Design with Visual Style Transfer",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903511/1GZokWw73mo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09908148",
"title": "GenoREC: A Recommendation System for Interactive Genomics Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09908148/1Hbaqe3xebS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/5555/01/10078374",
"title": "<italic>DiffSeer</italic>: Difference-Based Dynamic Weighted Graph Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/5555/01/10078374/1LINrNziL28",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552878",
"title": "VizLinter: A Linter and Fixer Framework for Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552878/1xic0oVyd5m",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552930",
"articleId": "1xic4JnxG2k",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552878",
"articleId": "1xic0oVyd5m",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xlw1UFWxDa",
"doi": "10.1109/TVCG.2021.3114876",
"abstract": "The combination of diverse data types and analysis tasks in genomics has resulted in the development of a wide range of visualization techniques and tools. However, most existing tools are tailored to a specific problem or data type and offer limited customization, making it challenging to optimize visualizations for new analysis tasks or datasets. To address this challenge, we designed Gosling-a grammar for interactive and scalable genomics data visualization. Gosling balances expressiveness for comprehensive multi-scale genomics data visualizations with accessibility for domain scientists. Our accompanying JavaScript toolkit called Gosling.js provides scalable and interactive rendering. Gosling.js is built on top of an existing platform for web-based genomics data visualization to further simplify the visualization of common genomics data formats. We demonstrate the expressiveness of the grammar through a variety of real-world examples. Furthermore, we show how Gosling supports the design of novel genomics visualizations. An online editor and examples of Gosling.js, its source code, and documentation are available at <uri>https://gosling.js.org</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The combination of diverse data types and analysis tasks in genomics has resulted in the development of a wide range of visualization techniques and tools. However, most existing tools are tailored to a specific problem or data type and offer limited customization, making it challenging to optimize visualizations for new analysis tasks or datasets. To address this challenge, we designed Gosling-a grammar for interactive and scalable genomics data visualization. Gosling balances expressiveness for comprehensive multi-scale genomics data visualizations with accessibility for domain scientists. Our accompanying JavaScript toolkit called Gosling.js provides scalable and interactive rendering. Gosling.js is built on top of an existing platform for web-based genomics data visualization to further simplify the visualization of common genomics data formats. We demonstrate the expressiveness of the grammar through a variety of real-world examples. Furthermore, we show how Gosling supports the design of novel genomics visualizations. An online editor and examples of Gosling.js, its source code, and documentation are available at <uri>https://gosling.js.org</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The combination of diverse data types and analysis tasks in genomics has resulted in the development of a wide range of visualization techniques and tools. However, most existing tools are tailored to a specific problem or data type and offer limited customization, making it challenging to optimize visualizations for new analysis tasks or datasets. To address this challenge, we designed Gosling-a grammar for interactive and scalable genomics data visualization. Gosling balances expressiveness for comprehensive multi-scale genomics data visualizations with accessibility for domain scientists. Our accompanying JavaScript toolkit called Gosling.js provides scalable and interactive rendering. Gosling.js is built on top of an existing platform for web-based genomics data visualization to further simplify the visualization of common genomics data formats. We demonstrate the expressiveness of the grammar through a variety of real-world examples. Furthermore, we show how Gosling supports the design of novel genomics visualizations. An online editor and examples of Gosling.js, its source code, and documentation are available at https://gosling.js.org.",
"title": "Gosling: A Grammar-based Toolkit for Scalable and Interactive Genomics Data Visualization",
"normalizedTitle": "Gosling: A Grammar-based Toolkit for Scalable and Interactive Genomics Data Visualization",
"fno": "09557192",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Genomics",
"Bioinformatics",
"Data Visualization",
"Tools",
"Grammar",
"Biological Cells",
"Visualization",
"Genomics",
"Declarative Specification",
"Visualization Grammar"
],
"authors": [
{
"givenName": "Sehi",
"surname": "LYi",
"fullName": "Sehi LYi",
"affiliation": "Harvard Medical School, Boston, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qianwen",
"surname": "Wang",
"fullName": "Qianwen Wang",
"affiliation": "Harvard Medical School, Boston, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fritz",
"surname": "Lekschas",
"fullName": "Fritz Lekschas",
"affiliation": "Harvard School of Engineering and Applied Sciences, Boston, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nils",
"surname": "Gehlenborg",
"fullName": "Nils Gehlenborg",
"affiliation": "Harvard Medical School, Boston, MA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "140-150",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/se4hpcs/2015/7082/0/7082a046",
"title": "Computation for Genomics Knowledge Discovery",
"doi": null,
"abstractUrl": "/proceedings-article/se4hpcs/2015/7082a046/12OmNqIQSiQ",
"parentPublication": {
"id": "proceedings/se4hpcs/2015/7082/0",
"title": "2015 IEEE/ACM 1st International Workshop on Software Engineering for High Performance Computing in Science (SE4HPCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/08/07999244",
"title": "An Analysis of Automated Visual Analysis Classification: Interactive Visualization Task Inference of Cancer Genomics Domain Experts",
"doi": null,
"abstractUrl": "/journal/tg/2018/08/07999244/13rRUNvgz9Z",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539391",
"title": "Synteny Explorer: An Interactive Visualization Application for Teaching Genome Evolution",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539391/13rRUxASuAy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/12/08233127",
"title": "Atom: A Grammar for Unit Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2018/12/08233127/14H4WLzSYsE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2019/01/08410020",
"title": "Optimal Binning for Genomics",
"doi": null,
"abstractUrl": "/journal/tc/2019/01/08410020/17D45VsBU46",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2018/7744/0/774400a688",
"title": "A Mobile Tool for Interactive Visualisation of Genomics Data",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2018/774400a688/17D45XdBRSw",
"parentPublication": {
"id": "proceedings/itme/2018/7744/0",
"title": "2018 9th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iisa/2018/8161/0/08633632",
"title": "Business Management System for Genomics",
"doi": null,
"abstractUrl": "/proceedings-article/iisa/2018/08633632/17D45XwUAKG",
"parentPublication": {
"id": "proceedings/iisa/2018/8161/0",
"title": "2018 9th International Conference on Information, Intelligence, Systems and Applications (IISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904451",
"title": "Multi-View Design Patterns and Responsive Visualization for Genomics Data",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904451/1H1gfVbEsiA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09908148",
"title": "GenoREC: A Recommendation System for Interactive Genomics Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09908148/1Hbaqe3xebS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a385",
"title": "InstaCircos: a Web Application for Fast and Interactive Circular Visualization of Large Genomic Data (Work in Progress)",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a385/1rSRcelsx5m",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552592",
"articleId": "1xic0SUdCNO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09555227",
"articleId": "1xjR1zzHe6s",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zKXpiDhzJC",
"name": "ttg202201-09557192s1-supp1-3114876.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09557192s1-supp1-3114876.mp4",
"extension": "mp4",
"size": "172 MB",
"__typename": "WebExtraType"
},
{
"id": "1zKXoKFF8R2",
"name": "ttg202201-09557192s1-supp2-3114876.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09557192s1-supp2-3114876.pdf",
"extension": "pdf",
"size": "646 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAZx8Ow",
"title": "June",
"year": "2015",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "21",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy0HYRr",
"doi": "10.1109/TVCG.2015.2396062",
"abstract": "Richly interactive visualization tools are increasingly popular for data exploration and analysis in a wide variety of domains. Existing systems and techniques for recording provenance of interaction focus either on comprehensive automated recording of low-level interaction events or on idiosyncratic manual transcription of high-level analysis activities. In this paper, we present the architecture and translation design of a query-to-question (Q2Q) system that automatically records user interactions and presents them semantically using natural language (written English). Q2Q takes advantage of domain knowledge and uses natural language generation (NLG) techniques to translate and transcribe a progression of interactive visualization states into a visual log of styled text that complements and effectively extends the functionality of visualization tools. We present Q2Q as a means to support a cross-examination process in which questions rather than interactions are the focus of analytic reasoning and action. We describe the architecture and implementation of the Q2Q system, discuss key design factors and variations that effect question generation, and present several visualizations that incorporate Q2Q for analysis in a variety of knowledge domains.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Richly interactive visualization tools are increasingly popular for data exploration and analysis in a wide variety of domains. Existing systems and techniques for recording provenance of interaction focus either on comprehensive automated recording of low-level interaction events or on idiosyncratic manual transcription of high-level analysis activities. In this paper, we present the architecture and translation design of a query-to-question (Q2Q) system that automatically records user interactions and presents them semantically using natural language (written English). Q2Q takes advantage of domain knowledge and uses natural language generation (NLG) techniques to translate and transcribe a progression of interactive visualization states into a visual log of styled text that complements and effectively extends the functionality of visualization tools. We present Q2Q as a means to support a cross-examination process in which questions rather than interactions are the focus of analytic reasoning and action. We describe the architecture and implementation of the Q2Q system, discuss key design factors and variations that effect question generation, and present several visualizations that incorporate Q2Q for analysis in a variety of knowledge domains.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Richly interactive visualization tools are increasingly popular for data exploration and analysis in a wide variety of domains. Existing systems and techniques for recording provenance of interaction focus either on comprehensive automated recording of low-level interaction events or on idiosyncratic manual transcription of high-level analysis activities. In this paper, we present the architecture and translation design of a query-to-question (Q2Q) system that automatically records user interactions and presents them semantically using natural language (written English). Q2Q takes advantage of domain knowledge and uses natural language generation (NLG) techniques to translate and transcribe a progression of interactive visualization states into a visual log of styled text that complements and effectively extends the functionality of visualization tools. We present Q2Q as a means to support a cross-examination process in which questions rather than interactions are the focus of analytic reasoning and action. We describe the architecture and implementation of the Q2Q system, discuss key design factors and variations that effect question generation, and present several visualizations that incorporate Q2Q for analysis in a variety of knowledge domains.",
"title": "Query2Question: Translating Visualization Interaction into Natural Language",
"normalizedTitle": "Query2Question: Translating Visualization Interaction into Natural Language",
"fno": "07018997",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Visualization",
"Games",
"Manuals",
"Cognition",
"History",
"Natural Languages",
"Visualization Provenance",
"Coordinated Multiple Views",
"Interaction Translation",
"Natural Language Generation",
"Visualization Provenance",
"Coordinated Multiple Views",
"Interaction Translation",
"Natural Language Generation"
],
"authors": [
{
"givenName": "Maryam",
"surname": "Nafari",
"fullName": "Maryam Nafari",
"affiliation": "School of Computer Science, University of Oklahoma, Norman, OK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chris",
"surname": "Weaver",
"fullName": "Chris Weaver",
"affiliation": "School of Computer Science, University of Oklahoma, Norman, OK",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2015-06-01 00:00:00",
"pubType": "trans",
"pages": "756-769",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2001/1195/0/11950413",
"title": "Interaction and Visualization Supporting Web Browsing Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2001/11950413/12OmNARiM12",
"parentPublication": {
"id": "proceedings/iv/2001/1195/0",
"title": "Proceedings Fifth International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122719",
"title": "Interaction Support for Visual Comparison Inspired by Natural Behavior",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122719/13rRUxZRbo0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440860",
"title": "Augmenting Visualizations with Interactive Data Facts to Facilitate Interpretation and Communication",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440860/17D45Vw15v5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09912366",
"title": "Towards Natural Language-Based Visualization Authoring",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09912366/1HeiWkRN3tC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/1973/05/06536715",
"title": "Research in natural language",
"doi": null,
"abstractUrl": "/magazine/co/1973/05/06536715/1hN4zrPn20w",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis4dh/2020/9153/0/915300a036",
"title": "Externalizing Transformations of Historical Documents: Opportunities for Provenance-Driven Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vis4dh/2020/915300a036/1pZ0XRm40vu",
"parentPublication": {
"id": "proceedings/vis4dh/2020/9153/0",
"title": "2020 IEEE 5th Workshop on Visualization for the Digital Humanities (VIS4DH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a620",
"title": "Immaterial Architecture: Understanding Visualization Through the Lifecycle of a Building",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a620/1rSRamQHMJO",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2020/0445/0/044500a086",
"title": "The errors analysis of natural language generation — A case study of Topic-to-Essay generation",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2020/044500a086/1t90oTnQYBG",
"parentPublication": {
"id": "proceedings/cis/2020/0445/0",
"title": "2020 16th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2021/3827/0/382700a278",
"title": "Automated Insights on Visualizations with Natural Language Generation",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2021/382700a278/1y4oJmkVrvq",
"parentPublication": {
"id": "proceedings/iv/2021/3827/0",
"title": "2021 25th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09617561",
"title": "Natural Language to Visualization by Neural Machine Translation",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09617561/1yA76vDzhhC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07018984",
"articleId": "13rRUxAASTe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07014246",
"articleId": "13rRUwhHcJk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgN5",
"name": "ttg201506-07018997s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201506-07018997s1.zip",
"extension": "zip",
"size": "1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1KsRWKKVV7i",
"title": "March",
"year": "2023",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "45",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1E5LC566SiY",
"doi": "10.1109/TPAMI.2022.3181116",
"abstract": "The main challenge in the field of unsupervised machine translation (UMT) is to associate source-target sentences in the latent space. As people who speak different languages share biologically similar visual systems, various unsupervised multi-modal machine translation (UMMT) models have been proposed to improve the performances of UMT by employing visual contents in natural images to facilitate alignment. Commonly, relation information is the important semantic in a sentence. Compared with images, videos can better present the interactions between objects and the ways in which an object transforms over time. However, current state-of-the-art methods only explore scene-level or object-level information from images without explicitly modeling objects relation; thus, they are sensitive to spurious correlations, which poses a new challenge for UMMT models. In this paper, we employ a spatial-temporal graph obtained from videos to exploit object interactions in space and time for disambiguation purposes and to promote latent space alignment in UMMT. Our model employs multi-modal back-translation and features pseudo-visual pivoting, in which we learn a shared multilingual visual-semantic embedding space and incorporate visually pivoted captioning as additional weak supervision. Experimental results on the VATEX Translation 2020 and HowToWorld datasets validate the translation capabilities of our model on both sentence-level and word-level and generalizes well when videos are not available during the testing phase.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The main challenge in the field of unsupervised machine translation (UMT) is to associate source-target sentences in the latent space. As people who speak different languages share biologically similar visual systems, various unsupervised multi-modal machine translation (UMMT) models have been proposed to improve the performances of UMT by employing visual contents in natural images to facilitate alignment. Commonly, relation information is the important semantic in a sentence. Compared with images, videos can better present the interactions between objects and the ways in which an object transforms over time. However, current state-of-the-art methods only explore scene-level or object-level information from images without explicitly modeling objects relation; thus, they are sensitive to spurious correlations, which poses a new challenge for UMMT models. In this paper, we employ a spatial-temporal graph obtained from videos to exploit object interactions in space and time for disambiguation purposes and to promote latent space alignment in UMMT. Our model employs multi-modal back-translation and features pseudo-visual pivoting, in which we learn a shared multilingual visual-semantic embedding space and incorporate visually pivoted captioning as additional weak supervision. Experimental results on the VATEX Translation 2020 and HowToWorld datasets validate the translation capabilities of our model on both sentence-level and word-level and generalizes well when videos are not available during the testing phase.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The main challenge in the field of unsupervised machine translation (UMT) is to associate source-target sentences in the latent space. As people who speak different languages share biologically similar visual systems, various unsupervised multi-modal machine translation (UMMT) models have been proposed to improve the performances of UMT by employing visual contents in natural images to facilitate alignment. Commonly, relation information is the important semantic in a sentence. Compared with images, videos can better present the interactions between objects and the ways in which an object transforms over time. However, current state-of-the-art methods only explore scene-level or object-level information from images without explicitly modeling objects relation; thus, they are sensitive to spurious correlations, which poses a new challenge for UMMT models. In this paper, we employ a spatial-temporal graph obtained from videos to exploit object interactions in space and time for disambiguation purposes and to promote latent space alignment in UMMT. Our model employs multi-modal back-translation and features pseudo-visual pivoting, in which we learn a shared multilingual visual-semantic embedding space and incorporate visually pivoted captioning as additional weak supervision. Experimental results on the VATEX Translation 2020 and HowToWorld datasets validate the translation capabilities of our model on both sentence-level and word-level and generalizes well when videos are not available during the testing phase.",
"title": "Video Pivoting Unsupervised Multi-Modal Machine Translation",
"normalizedTitle": "Video Pivoting Unsupervised Multi-Modal Machine Translation",
"fno": "09792411",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Graph Theory",
"Language Translation",
"Learning Artificial Intelligence",
"Natural Language Processing",
"Unsupervised Learning",
"Back Translation",
"Different Languages Share Biologically Similar Visual Systems",
"Explicitly Modeling Objects Relation",
"Incorporate Visually Pivoted Captioning",
"Latent Space Alignment",
"Natural Images",
"Object Interactions",
"Object Level Information",
"Relation Information",
"Scene Level",
"Sentence Level",
"Source Target Sentences",
"Translation Capabilities",
"UMMT Models",
"UMT",
"Unsupervised Machine Translation",
"VATEX Translation 2020",
"Video Pivoting Unsupervised Multimodal Machine Translation",
"Visual Contents",
"Visual Semantic Embedding Space",
"Visualization",
"3 G Mobile Communication",
"Machine Translation",
"Task Analysis",
"Transformers",
"Training",
"Feature Extraction",
"Multi Modal Machine Translation",
"Unsupervised Learning",
"Visual Semantic Embedding Space",
"Spatial Temporal Graph"
],
"authors": [
{
"givenName": "Mingjie",
"surname": "Li",
"fullName": "Mingjie Li",
"affiliation": "Faculty of Engineering and Information Technology, Australian Artificial Intelligence Institute, University of Technology Sydney, Ultimo, NSW, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Po-Yao",
"surname": "Huang",
"fullName": "Po-Yao Huang",
"affiliation": "Facebook AI Research, Menlo Park, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaojun",
"surname": "Chang",
"fullName": "Xiaojun Chang",
"affiliation": "Faculty of Engineering and Information Technology, Australian Artificial Intelligence Institute, University of Technology Sydney, Ultimo, NSW, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Junjie",
"surname": "Hu",
"fullName": "Junjie Hu",
"affiliation": "University of Wisconsin-Madison, Madison, WI, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yi",
"surname": "Yang",
"fullName": "Yi Yang",
"affiliation": "College of Computer Science and Technology, Zhejiang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alex",
"surname": "Hauptmann",
"fullName": "Alex Hauptmann",
"affiliation": "School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2023-03-01 00:00:00",
"pubType": "trans",
"pages": "3918-3932",
"year": "2023",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icalt/2009/3711/0/3711a403",
"title": "Integrating Translation Feature Using Machine Translation in Open Source LMS",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2009/3711a403/12OmNAIdBUk",
"parentPublication": {
"id": "proceedings/icalt/2009/3711/0",
"title": "Advanced Learning Technologies, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ialp/2009/3904/0/3904a328",
"title": "Three Algorithms for Word-to-Phrase Machine Translation",
"doi": null,
"abstractUrl": "/proceedings-article/ialp/2009/3904a328/12OmNCbU2Z5",
"parentPublication": {
"id": "proceedings/ialp/2009/3904/0",
"title": "Asian Language Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ialp/2009/3904/0/3904a162",
"title": "Automatic Machine Translation Evaluation Based on Sentence Structure Information",
"doi": null,
"abstractUrl": "/proceedings-article/ialp/2009/3904a162/12OmNx5GU0z",
"parentPublication": {
"id": "proceedings/ialp/2009/3904/0",
"title": "Asian Language Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2022/9221/0/922100b181",
"title": "Improving Machine Translation Systems via Isotopic Replacement",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2022/922100b181/1Ems2aJG1pK",
"parentPublication": {
"id": "proceedings/icse/2022/9221/0",
"title": "2022 IEEE/ACM 44th International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnlp/2022/9544/0/954400a350",
"title": "Reranking by Voting Mechanism in Neural Machine Translation",
"doi": null,
"abstractUrl": "/proceedings-article/icnlp/2022/954400a350/1GNtkbbnnva",
"parentPublication": {
"id": "proceedings/icnlp/2022/9544/0",
"title": "2022 4th International Conference on Natural Language Processing (ICNLP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600f206",
"title": "VALHALLA: Visual Hallucination for Machine Translation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600f206/1H0MY8bjU8o",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600d032",
"title": "UMT: Unified Multi-modal Transformers for Joint Video Moment Retrieval and Highlight Detection",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600d032/1H0OgNkrthC",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/10005816",
"title": "Universal Multimodal Representation for Language Understanding",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10005816/1JF3SmbCxbi",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/2022/04/09612034",
"title": "Ignorance is Bliss: Exploring Defenses Against Invariance-Based Attacks on Neural Machine Translation Systems",
"doi": null,
"abstractUrl": "/journal/ai/2022/04/09612034/1yrDaVPCDew",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccia/2021/3933/0/393300a248",
"title": "Neural Machine Translation Based on Gumbel Tree Model optimization",
"doi": null,
"abstractUrl": "/proceedings-article/iccia/2021/393300a248/1zpzPJ0vu3C",
"parentPublication": {
"id": "proceedings/iccia/2021/3933/0",
"title": "2021 6th International Conference on Computational Intelligence and Applications (ICCIA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09808180",
"articleId": "1Ey4gqp7GWQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09788000",
"articleId": "1DU9TDSFGVi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1HeiWkRN3tC",
"doi": "10.1109/TVCG.2022.3209357",
"abstract": "A key challenge to visualization authoring is the process of getting familiar with the complex user interfaces of authoring tools. Natural Language Interface (NLI) presents promising benefits due to its learnability and usability. However, supporting NLIs for authoring tools requires expertise in natural language processing, while existing NLIs are mostly designed for visual analytic workflow. In this paper, we propose an authoring-oriented NLI pipeline by introducing a structured representation of users' visualization editing intents, called <italic>editing actions</italic>, based on a formative study and an extensive survey on visualization construction tools. The editing actions are executable, and thus decouple natural language interpretation and visualization applications as an intermediate layer. We implement a deep learning-based NL interpreter to translate NL utterances into editing actions. The interpreter is reusable and extensible across authoring tools. The authoring tools only need to map the editing actions into tool-specific operations. To illustrate the usages of the NL interpreter, we implement an Excel chart editor and a proof-of-concept authoring tool, VisTalk. We conduct a user study with VisTalk to understand the usage patterns of NL-based authoring systems. Finally, we discuss observations on how users author charts with natural language, as well as implications for future research.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A key challenge to visualization authoring is the process of getting familiar with the complex user interfaces of authoring tools. Natural Language Interface (NLI) presents promising benefits due to its learnability and usability. However, supporting NLIs for authoring tools requires expertise in natural language processing, while existing NLIs are mostly designed for visual analytic workflow. In this paper, we propose an authoring-oriented NLI pipeline by introducing a structured representation of users' visualization editing intents, called <italic>editing actions</italic>, based on a formative study and an extensive survey on visualization construction tools. The editing actions are executable, and thus decouple natural language interpretation and visualization applications as an intermediate layer. We implement a deep learning-based NL interpreter to translate NL utterances into editing actions. The interpreter is reusable and extensible across authoring tools. The authoring tools only need to map the editing actions into tool-specific operations. To illustrate the usages of the NL interpreter, we implement an Excel chart editor and a proof-of-concept authoring tool, VisTalk. We conduct a user study with VisTalk to understand the usage patterns of NL-based authoring systems. Finally, we discuss observations on how users author charts with natural language, as well as implications for future research.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A key challenge to visualization authoring is the process of getting familiar with the complex user interfaces of authoring tools. Natural Language Interface (NLI) presents promising benefits due to its learnability and usability. However, supporting NLIs for authoring tools requires expertise in natural language processing, while existing NLIs are mostly designed for visual analytic workflow. In this paper, we propose an authoring-oriented NLI pipeline by introducing a structured representation of users' visualization editing intents, called editing actions, based on a formative study and an extensive survey on visualization construction tools. The editing actions are executable, and thus decouple natural language interpretation and visualization applications as an intermediate layer. We implement a deep learning-based NL interpreter to translate NL utterances into editing actions. The interpreter is reusable and extensible across authoring tools. The authoring tools only need to map the editing actions into tool-specific operations. To illustrate the usages of the NL interpreter, we implement an Excel chart editor and a proof-of-concept authoring tool, VisTalk. We conduct a user study with VisTalk to understand the usage patterns of NL-based authoring systems. Finally, we discuss observations on how users author charts with natural language, as well as implications for future research.",
"title": "Towards Natural Language-Based Visualization Authoring",
"normalizedTitle": "Towards Natural Language-Based Visualization Authoring",
"fno": "09912366",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Authoring Systems",
"Authorisation",
"Data Analysis",
"Data Visualisation",
"Learning Artificial Intelligence",
"Natural Language Interfaces",
"Natural Language Processing",
"Natural Languages",
"Text Editing",
"User Interfaces",
"Authoring Tools",
"Authoring Oriented NLI Pipeline",
"Complex User Interfaces",
"Decouple Natural Language Interpretation",
"Deep Learning Based NL Interpreter",
"Editing Actions",
"Natural Language Interface",
"Natural Language Processing",
"Proof Of Concept Authoring Tool",
"Tool Specific Operations",
"Towards Natural Language Based Visualization",
"Users Author Charts",
"Visual Analytic Workflow",
"Visualization Applications",
"Visualization Authoring",
"Visualization Construction Tools",
"Data Visualization",
"Natural Languages",
"Authoring Systems",
"Pipelines",
"Task Analysis",
"Metadata",
"Visual Analytics",
"Visualization Authoring",
"Natural Language Interface",
"Natural Language Understanding"
],
"authors": [
{
"givenName": "Yun",
"surname": "Wang",
"fullName": "Yun Wang",
"affiliation": "Microsoft Research Asia (MSRA), China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhitao",
"surname": "Hou",
"fullName": "Zhitao Hou",
"affiliation": "Microsoft Research Asia (MSRA), China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Leixian",
"surname": "Shen",
"fullName": "Leixian Shen",
"affiliation": "Tsinghua University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tongshuang",
"surname": "Wu",
"fullName": "Tongshuang Wu",
"affiliation": "Carnegie Mellon University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiaqi",
"surname": "Wang",
"fullName": "Jiaqi Wang",
"affiliation": "Oxford University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "He",
"surname": "Huang",
"fullName": "He Huang",
"affiliation": "Microsoft Research Asia (MSRA), China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haidong",
"surname": "Zhang",
"fullName": "Haidong Zhang",
"affiliation": "Microsoft Research Asia (MSRA), China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dongmei",
"surname": "Zhang",
"fullName": "Dongmei Zhang",
"affiliation": "Microsoft Research Asia (MSRA), China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "1222-1232",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icmcs/1996/7436/0/74360291",
"title": "Refining the MATILDA multimedia authoring framework with a visual formalism",
"doi": null,
"abstractUrl": "/proceedings-article/icmcs/1996/74360291/12OmNBhpRYL",
"parentPublication": {
"id": "proceedings/icmcs/1996/7436/0",
"title": "Multimedia Computing and Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2007/2905/0/29050645",
"title": "A Web-Based Authoring System Supporting Metadata",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2007/29050645/12OmNqJHFqJ",
"parentPublication": {
"id": "proceedings/cbms/2007/2905/0",
"title": "Twentieth IEEE International Symposium on Computer-Based Medical Systems (CBMS'07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aswec/2009/3599/0/3599a081",
"title": "Critic Authoring Templates for Specifying Domain-Specific Visual Language Tool Critics",
"doi": null,
"abstractUrl": "/proceedings-article/aswec/2009/3599a081/12OmNyqRncf",
"parentPublication": {
"id": "proceedings/aswec/2009/3599/0",
"title": "2009 Australian Software Engineering Conference (ASWEC 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2009/3763/0/3763a469",
"title": "Ontology Knowledge Authoring by Natural Language Empowerment",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2009/3763a469/12OmNz4SOzn",
"parentPublication": {
"id": "proceedings/dexa/2009/3763/0",
"title": "2009 20th International Workshop on Database and Expert Systems Application. DEXA 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2011/06/mcg2011060016",
"title": "Digital-Content Authoring",
"doi": null,
"abstractUrl": "/magazine/cg/2011/06/mcg2011060016/13rRUwjoNCe",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/06/09699035",
"title": "Towards Natural Language Interfaces for Data Visualization: A Survey",
"doi": null,
"abstractUrl": "/journal/tg/2023/06/09699035/1ADJfMYBSCs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a006",
"title": "Facilitating Conversational Interaction in Natural Language Interfaces for Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a006/1J6hcTVtKNy",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2016/3900/0/3900a345",
"title": "Program Synthesis Using Natural Language",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2016/3900a345/1grOYgkQ05G",
"parentPublication": {
"id": "proceedings/icse/2016/3900/0",
"title": "2016 IEEE/ACM 38th International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2020/04/09118800",
"title": "How to Ask What to Say?: Strategies for Evaluating Natural Language Interfaces for Data Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2020/04/09118800/1kHUNLgZhSM",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101534",
"title": "A Natural Language Interface for Database: Achieving Transfer-learnability Using Adversarial Method for Question Understanding",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101534/1kaMKArBilq",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09903602",
"articleId": "1GZokBOfm2A",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09904452",
"articleId": "1H1gordOnfy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1z985rMTIxG",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": "34",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1igS2v9G6cw",
"doi": "10.1109/TKDE.2020.2981464",
"abstract": "In this work, we present a self-driving data visualization system, called <sc>DeepEye</sc>, that automatically generates and recommends visualizations based on the idea of <italic>visualization by examples.</italic> We propose effective visualization recognition techniques to decide which visualizations are meaningful and visualization ranking techniques to rank the good visualizations. Furthermore, a main challenge of automatic visualization system is that the users may be misled by blindly suggesting visualizations without knowing the user's intent. To this end, we extend <sc>DeepEye</sc> to be easily steerable by allowing the user to use <italic>keyword search</italic> and providing click-based <italic>faceted navigation</italic>. Empirical results, using real-life data and use cases, verify the power of our proposed system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this work, we present a self-driving data visualization system, called <sc>DeepEye</sc>, that automatically generates and recommends visualizations based on the idea of <italic>visualization by examples.</italic> We propose effective visualization recognition techniques to decide which visualizations are meaningful and visualization ranking techniques to rank the good visualizations. Furthermore, a main challenge of automatic visualization system is that the users may be misled by blindly suggesting visualizations without knowing the user's intent. To this end, we extend <sc>DeepEye</sc> to be easily steerable by allowing the user to use <italic>keyword search</italic> and providing click-based <italic>faceted navigation</italic>. Empirical results, using real-life data and use cases, verify the power of our proposed system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this work, we present a self-driving data visualization system, called DeepEye, that automatically generates and recommends visualizations based on the idea of visualization by examples. We propose effective visualization recognition techniques to decide which visualizations are meaningful and visualization ranking techniques to rank the good visualizations. Furthermore, a main challenge of automatic visualization system is that the users may be misled by blindly suggesting visualizations without knowing the user's intent. To this end, we extend DeepEye to be easily steerable by allowing the user to use keyword search and providing click-based faceted navigation. Empirical results, using real-life data and use cases, verify the power of our proposed system.",
"title": "Steerable Self-Driving Data Visualization",
"normalizedTitle": "Steerable Self-Driving Data Visualization",
"fno": "09039632",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Data Visualisation",
"Information Retrieval",
"Recommender Systems",
"Steerable Self Driving Data Visualization",
"Deep Eye",
"Visualization Recognition",
"Keyword Search",
"Click Based Faceted Navigation",
"Visualization By Examples",
"Visualization Recommendation",
"Data Visualization",
"Delays",
"Visualization",
"Navigation",
"Bars",
"Transforms",
"Keyword Search",
"Data Visualization",
"Visualization Recommendation",
"Data Exploration",
"Keyword Search",
"Faceted Navigation"
],
"authors": [
{
"givenName": "Yuyu",
"surname": "Luo",
"fullName": "Yuyu Luo",
"affiliation": "Department of Computer Science, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xuedi",
"surname": "Qin",
"fullName": "Xuedi Qin",
"affiliation": "Department of Computer Science, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chengliang",
"surname": "Chai",
"fullName": "Chengliang Chai",
"affiliation": "Department of Computer Science, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nan",
"surname": "Tang",
"fullName": "Nan Tang",
"affiliation": "Qatar Computing Research Institute, Hamad Bin Khalifa University, Doha, Qatar",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guoliang",
"surname": "Li",
"fullName": "Guoliang Li",
"affiliation": "Department of Computer Science, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenbo",
"surname": "Li",
"fullName": "Wenbo Li",
"affiliation": "Department of Computer Science, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "475-490",
"year": "2022",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2018/5520/0/552000a101",
"title": "DeepEye: Towards Automatic Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2018/552000a101/14Fq0VI6tcV",
"parentPublication": {
"id": "proceedings/icde/2018/5520/0",
"title": "2018 IEEE 34th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904490",
"title": "A Scanner Deeply: Predicting Gaze Heatmaps on Visualizations Using Crowdsourced Eye Movement Data",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904490/1H1gj9xTTG0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09984953",
"title": "VISAtlas: An Image-based Exploration and Query System for Large Visualization Collections via Neural Image Embedding",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09984953/1J6d2SwfUT6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/02/09165928",
"title": "Hybrid Graph Visualizations With ChordLink: Algorithms, Experiments, and Applications",
"doi": null,
"abstractUrl": "/journal/tg/2022/02/09165928/1mevWoz3hM4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/02/09238399",
"title": "<sc>Cartolabe</sc>: A Web-Based Scalable Visualization of Large Document Collections",
"doi": null,
"abstractUrl": "/magazine/cg/2021/02/09238399/1oa1KJAPKOA",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/10/09385921",
"title": "Declutter and Focus: Empirically Evaluating Design Guidelines for Effective Data Communication",
"doi": null,
"abstractUrl": "/journal/tg/2022/10/09385921/1seipuzsKis",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09523770",
"title": "A Survey on ML4VIS: Applying Machine Learning Advances to Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09523770/1wnLgd43B5K",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09572234",
"title": "Professional Differences: A Comparative Study of Visualization Task Performance and Spatial Ability Across Disciplines",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09572234/1xH5FXdMnoA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09556579",
"title": "STRATISFIMAL LAYOUT: A modular optimization model for laying out layered node-link network visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09556579/1xlw0LJ4OTm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09617561",
"title": "Natural Language to Visualization by Neural Machine Translation",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09617561/1yA76vDzhhC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09050875",
"articleId": "1iCrMbYeQrS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09035407",
"articleId": "1iaerGC3MuQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1FbOFYlrXEI",
"title": "Aug.",
"year": "2022",
"issueNum": "04",
"idPrefix": "ai",
"pubType": "journal",
"volume": "3",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1yrDaVPCDew",
"doi": "10.1109/TAI.2021.3123931",
"abstract": "This article addresses an invariance-based attack on the transformer, a state-of-the-art neural machine translation (NMT) system. Such attacks make multiple changes to the source sentence with the goal of keeping the predicted translation unchanged. Since the <italic>gold translation</italic> is not available for the adversarial sentences, tackling invariance-based attacks is a challenging task. We propose two contrasting defense strategies for the same, <italic>learn to deal</italic> and <italic>learn to ignore</italic>. In <italic>learn to deal</italic>, NMT system is trained not to predict the same translation for a clean text and its noisy counterpart, whereas in <italic>learn to ignore</italic>, NMT system is trained to output a <italic>dummy sentence</italic> in the target language whenever it encounters a noisy text. The experiments on two language pairs, English–German (en–de) and English–French (en–fr), show that <italic>learn to deal</italic> strategy reduces the attack success rate from 84.0% to 62.2% for en–de and from 84.6% to 73.8% for en–fr, whereas <italic>learn to ignore</italic> strategy reduces the attack success rate from 84.0% to 27.2% for en–de and from 84.6% to 37.0% for en–fr.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article addresses an invariance-based attack on the transformer, a state-of-the-art neural machine translation (NMT) system. Such attacks make multiple changes to the source sentence with the goal of keeping the predicted translation unchanged. Since the <italic>gold translation</italic> is not available for the adversarial sentences, tackling invariance-based attacks is a challenging task. We propose two contrasting defense strategies for the same, <italic>learn to deal</italic> and <italic>learn to ignore</italic>. In <italic>learn to deal</italic>, NMT system is trained not to predict the same translation for a clean text and its noisy counterpart, whereas in <italic>learn to ignore</italic>, NMT system is trained to output a <italic>dummy sentence</italic> in the target language whenever it encounters a noisy text. The experiments on two language pairs, English–German (en–de) and English–French (en–fr), show that <italic>learn to deal</italic> strategy reduces the attack success rate from 84.0% to 62.2% for en–de and from 84.6% to 73.8% for en–fr, whereas <italic>learn to ignore</italic> strategy reduces the attack success rate from 84.0% to 27.2% for en–de and from 84.6% to 37.0% for en–fr.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article addresses an invariance-based attack on the transformer, a state-of-the-art neural machine translation (NMT) system. Such attacks make multiple changes to the source sentence with the goal of keeping the predicted translation unchanged. Since the gold translation is not available for the adversarial sentences, tackling invariance-based attacks is a challenging task. We propose two contrasting defense strategies for the same, learn to deal and learn to ignore. In learn to deal, NMT system is trained not to predict the same translation for a clean text and its noisy counterpart, whereas in learn to ignore, NMT system is trained to output a dummy sentence in the target language whenever it encounters a noisy text. The experiments on two language pairs, English–German (en–de) and English–French (en–fr), show that learn to deal strategy reduces the attack success rate from 84.0% to 62.2% for en–de and from 84.6% to 73.8% for en–fr, whereas learn to ignore strategy reduces the attack success rate from 84.0% to 27.2% for en–de and from 84.6% to 37.0% for en–fr.",
"title": "Ignorance is Bliss: Exploring Defenses Against Invariance-Based Attacks on Neural Machine Translation Systems",
"normalizedTitle": "Ignorance is Bliss: Exploring Defenses Against Invariance-Based Attacks on Neural Machine Translation Systems",
"fno": "09612034",
"hasPdf": true,
"idPrefix": "ai",
"keywords": [
"Language Translation",
"Learning Artificial Intelligence",
"Natural Language Processing",
"NMT System",
"Attack Success Rate",
"Invariance Based Attack",
"Neural Machine Translation Systems",
"State Of The Art Neural Machine Translation System",
"Predicted Translation Unchanged",
"Gold Translation",
"Contrasting Defense Strategies",
"Noise Measurement",
"Gold",
"Transformers",
"Task Analysis",
"Machine Translation",
"Training",
"Standards",
"Adversarial Robustness",
"Deep Learning",
"Neural Machine Translation NMT"
],
"authors": [
{
"givenName": "Akshay",
"surname": "Chaturvedi",
"fullName": "Akshay Chaturvedi",
"affiliation": "Indian Statistical Institute, Kolkata, India",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Abhisek",
"surname": "Chakrabarty",
"fullName": "Abhisek Chakrabarty",
"affiliation": "Advanced Speech Translation Research and Development Promotion Center, National Institute of Information and Communications Technology, Kyoto, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Masao",
"surname": "Utiyama",
"fullName": "Masao Utiyama",
"affiliation": "Advanced Speech Translation Research and Development Promotion Center, National Institute of Information and Communications Technology, Kyoto, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eiichiro",
"surname": "Sumita",
"fullName": "Eiichiro Sumita",
"affiliation": "Advanced Speech Translation Research and Development Promotion Center, National Institute of Information and Communications Technology, Kyoto, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Utpal",
"surname": "Garain",
"fullName": "Utpal Garain",
"affiliation": "Indian Statistical Institute, Kolkata, India",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2022-08-01 00:00:00",
"pubType": "trans",
"pages": "518-525",
"year": "2022",
"issn": "2691-4581",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wacv/2022/0915/0/091500c131",
"title": "Sign Language Translation with Hierarchical Spatio-Temporal Graph Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2022/091500c131/1B13WIxSHTy",
"parentPublication": {
"id": "proceedings/wacv/2022/0915/0",
"title": "2022 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnlp/2022/9544/0/954400a350",
"title": "Reranking by Voting Mechanism in Neural Machine Translation",
"doi": null,
"abstractUrl": "/proceedings-article/icnlp/2022/954400a350/1GNtkbbnnva",
"parentPublication": {
"id": "proceedings/icnlp/2022/9544/0",
"title": "2022 4th International Conference on Natural Language Processing (ICNLP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10021032",
"title": "EntityRank: Unsupervised Mining of Bilingual Named Entity Pairs from Parallel Corpora for Neural Machine Translation",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10021032/1KfRqE4MmAM",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2022/9744/0/974400a228",
"title": "Blur the Linguistic Boundary: Interpreting Chinese Buddhist Sutra in English via Neural Machine Translation",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2022/974400a228/1MrG2Nfuc5W",
"parentPublication": {
"id": "proceedings/ictai/2022/9744/0",
"title": "2022 IEEE 34th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800m2723",
"title": "Exemplar Normalization for Learning Deep Representation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800m2723/1m3nbJNd46Q",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2021/0296/0/029600b161",
"title": "CURE: Code-Aware Neural Machine Translation for Automatic Program Repair",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2021/029600b161/1sEXp5pyHMk",
"parentPublication": {
"id": "proceedings/icse/2021/0296/0/",
"title": "2021 IEEE/ACM 43rd International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iisa/2021/0032/0/09555556",
"title": "Exploring the Effectiveness of Employing Limited Resources for Deep Neural Pairwise Evaluation of Machine Translation",
"doi": null,
"abstractUrl": "/proceedings-article/iisa/2021/09555556/1xxcrh0H4Yw",
"parentPublication": {
"id": "proceedings/iisa/2021/0032/0",
"title": "2021 12th International Conference on Information, Intelligence, Systems & Applications (IISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09617561",
"title": "Natural Language to Visualization by Neural Machine Translation",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09617561/1yA76vDzhhC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/2022/03/09612606",
"title": "Quick Learning Mechanism With Cross-Domain Adaptation for Intelligent Fault Diagnosis",
"doi": null,
"abstractUrl": "/journal/ai/2022/03/09612606/1yti3SKs1kA",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/seed/2021/2025/0/202500a076",
"title": "Seeds of SEED: NMT-Stroke: Diverting Neural Machine Translation through Hardware-based Faults",
"doi": null,
"abstractUrl": "/proceedings-article/seed/2021/202500a076/1yylEAvME80",
"parentPublication": {
"id": "proceedings/seed/2021/2025/0",
"title": "2021 International Symposium on Secure and Private Execution Environment Design (SEED)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09695289",
"articleId": "1AvqPw2HetW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09618852",
"articleId": "1yDfyGJuloY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1pERRCpDoGs",
"title": "Aug.",
"year": "5555",
"issueNum": "01",
"idPrefix": "ai",
"pubType": "journal",
"volume": "1",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1IHMSiEzkt2",
"doi": "10.1109/TAI.2022.3225372",
"abstract": "Automatic diagnosis of COVID-19 using chest CT images is of great significance for preventing its spread. However, it is difficult to precisely identify COVID-19 due to the following problems: 1) the location and size of lesions can vary greatly in CT images; 2) its unique characteristics are often imperceptible in imaging findings. To solve these problems, a Deep Dual Attention Network (<inline-formula><tex-math notation=\"LaTeX\">Z_$\\textrm {D}^{\\textrm {2}}\\textrm {ANet}$_Z</tex-math></inline-formula>) is proposed for accurate diagnosis of COVID-19 by integrating dual attention modules (DAMs) with different scales of the feature extractor, where DAM can adaptively detect relevant lesion regions to extract discriminative imaging features of COVID-19. Specifically, DAM is implemented by two parallel blocks: global attention block (GAB) and local attention block (LAB), in which GAB is designed to roughly locate the infected regions from the entire image by modeling global contexts, while LAB is developed to explicitly highlight subtle differences of COVID-19 from other viral pneumonia in the infected regions by learning detailed lesion information. Experimental results on several public datasets show that <inline-formula><tex-math notation=\"LaTeX\">Z_$\\textrm {D}^{\\textrm {2}}\\textrm {ANet}$_Z</tex-math></inline-formula> outperforms the state-of-the-art approaches in various performance metrics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Automatic diagnosis of COVID-19 using chest CT images is of great significance for preventing its spread. However, it is difficult to precisely identify COVID-19 due to the following problems: 1) the location and size of lesions can vary greatly in CT images; 2) its unique characteristics are often imperceptible in imaging findings. To solve these problems, a Deep Dual Attention Network (<inline-formula><tex-math notation=\"LaTeX\">$\\textrm {D}^{\\textrm {2}}\\textrm {ANet}$</tex-math></inline-formula>) is proposed for accurate diagnosis of COVID-19 by integrating dual attention modules (DAMs) with different scales of the feature extractor, where DAM can adaptively detect relevant lesion regions to extract discriminative imaging features of COVID-19. Specifically, DAM is implemented by two parallel blocks: global attention block (GAB) and local attention block (LAB), in which GAB is designed to roughly locate the infected regions from the entire image by modeling global contexts, while LAB is developed to explicitly highlight subtle differences of COVID-19 from other viral pneumonia in the infected regions by learning detailed lesion information. Experimental results on several public datasets show that <inline-formula><tex-math notation=\"LaTeX\">$\\textrm {D}^{\\textrm {2}}\\textrm {ANet}$</tex-math></inline-formula> outperforms the state-of-the-art approaches in various performance metrics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Automatic diagnosis of COVID-19 using chest CT images is of great significance for preventing its spread. However, it is difficult to precisely identify COVID-19 due to the following problems: 1) the location and size of lesions can vary greatly in CT images; 2) its unique characteristics are often imperceptible in imaging findings. To solve these problems, a Deep Dual Attention Network (-) is proposed for accurate diagnosis of COVID-19 by integrating dual attention modules (DAMs) with different scales of the feature extractor, where DAM can adaptively detect relevant lesion regions to extract discriminative imaging features of COVID-19. Specifically, DAM is implemented by two parallel blocks: global attention block (GAB) and local attention block (LAB), in which GAB is designed to roughly locate the infected regions from the entire image by modeling global contexts, while LAB is developed to explicitly highlight subtle differences of COVID-19 from other viral pneumonia in the infected regions by learning detailed lesion information. Experimental results on several public datasets show that - outperforms the state-of-the-art approaches in various performance metrics.",
"title": "Deep Dual Attention Network for Precise Diagnosis of COVID-19 From Chest CT Images",
"normalizedTitle": "Deep Dual Attention Network for Precise Diagnosis of COVID-19 From Chest CT Images",
"fno": "09965606",
"hasPdf": true,
"idPrefix": "ai",
"keywords": [
"Dams",
"COVID 19",
"Computed Tomography",
"Feature Extraction",
"Lesions",
"Imaging",
"Pulmonary Diseases",
"COVID 19",
"Chest CT",
"Computer Aided Diagnosis CAD",
"Dual Attention Network",
"Transformer"
],
"authors": [
{
"givenName": "Zhijie",
"surname": "Lin",
"fullName": "Zhijie Lin",
"affiliation": "School of Automation, Guangdong University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhaoshui",
"surname": "He",
"fullName": "Zhaoshui He",
"affiliation": "School of Automation, Guangdong University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ruoyu",
"surname": "Yao",
"fullName": "Ruoyu Yao",
"affiliation": "School of Automation, Guangdong University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xu",
"surname": "Wang",
"fullName": "Xu Wang",
"affiliation": "School of Automation, Guangdong University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Taiheng",
"surname": "Liu",
"fullName": "Taiheng Liu",
"affiliation": "School of Automation, Guangdong University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yamei",
"surname": "Deng",
"fullName": "Yamei Deng",
"affiliation": "Department of Radiology, The Third Affiliated Hospital of Guangzhou Medical University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shengli",
"surname": "Xie",
"fullName": "Shengli Xie",
"affiliation": "School of Automation, Guangdong University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-11-01 00:00:00",
"pubType": "trans",
"pages": "1-11",
"year": "5555",
"issn": "2691-4581",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icaml/2021/2125/0/212500a067",
"title": "COVID-19 CT Image Classification and Pneumonia Lesions Segmentation Using Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icaml/2021/212500a067/1B60Wu9gVSU",
"parentPublication": {
"id": "proceedings/icaml/2021/2125/0",
"title": "2021 3rd International Conference on Applied Machine Learning (ICAML)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icaice/2021/2186/0/218600a077",
"title": "COVID-19 Image Diagnosis on CT Images Using Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icaice/2021/218600a077/1Et4xKu1IRy",
"parentPublication": {
"id": "proceedings/icaice/2021/2186/0",
"title": "2021 2nd International Conference on Artificial Intelligence and Computer Engineering (ICAICE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/5555/01/09927395",
"title": "A Hybrid Deep Transfer Learning Model With Kernel Metric for COVID-19 Pneumonia Classification Using Chest CT Images",
"doi": null,
"abstractUrl": "/journal/tb/5555/01/09927395/1HJuqbLC6RO",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2021/01/09248607",
"title": "COVID-19-CT-CXR: A Freely Accessible and Weakly Labeled Chest X-Ray and CT Image Collection on COVID-19 From Biomedical Literature",
"doi": null,
"abstractUrl": "/journal/bd/2021/01/09248607/1otZZzqPLMY",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2021/01/09345435",
"title": "COVID-19 Chest CT Image Segmentation Network by Multi-Scale Fusion and Enhancement Operations",
"doi": null,
"abstractUrl": "/journal/bd/2021/01/09345435/1qTYEs9wmYg",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/2021/03/09378789",
"title": "CovSegNet: A Multi Encoder–Decoder Architecture for Improved Lesion Segmentation of COVID-19 Chest CT Scans",
"doi": null,
"abstractUrl": "/journal/ai/2021/03/09378789/1rZmvrW1Lu8",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/05/09508150",
"title": "Automated Diagnosis of COVID-19 Using Deep Supervised Autoencoder With Multi-View Features From CT Images",
"doi": null,
"abstractUrl": "/journal/tb/2022/05/09508150/1vOUcgJh4DS",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552241",
"title": "<italic>COVID</italic>-view: Diagnosis of COVID-19 using Chest CT",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552241/1xic6RdmNC8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2021/0191/0/019100a519",
"title": "A Hierarchical Classification System for the Detection of Covid-19 from Chest X-Ray Images",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2021/019100a519/1yNioxL77Co",
"parentPublication": {
"id": "proceedings/iccvw/2021/0191/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2021/0191/0/019100a537",
"title": "MIA-COV19D: COVID-19 Detection through 3-D Chest CT Image Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2021/019100a537/1yNitrTJNug",
"parentPublication": {
"id": "proceedings/iccvw/2021/0191/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09964348",
"articleId": "1IFENJBJt4c",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09965621",
"articleId": "1IHMStUyXjG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1ISVUw6kypG",
"name": "tai555501-09965606s1-supp1-3225372.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/tai555501-09965606s1-supp1-3225372.pdf",
"extension": "pdf",
"size": "786 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1rCbPpaC8GA",
"title": "March",
"year": "2021",
"issueNum": "01",
"idPrefix": "bd",
"pubType": "journal",
"volume": "7",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1otZZzqPLMY",
"doi": "10.1109/TBDATA.2020.3035935",
"abstract": "The latest threat to global health is the COVID-19 outbreak. Although there exist large datasets of chest X-rays (CXR) and computed tomography (CT) scans, few COVID-19 image collections are currently available due to patient privacy. At the same time, there is a rapid growth of COVID-19-relevant articles in the biomedical literature, including those that report findings on radiographs. Here, we present COVID-19-CT-CXR, a public database of COVID-19 CXR and CT images, which are automatically extracted from COVID-19-relevant articles from the PubMed Central Open Access (PMC-OA) Subset. We extracted figures, associated captions, and relevant figure descriptions in the article and separated compound figures into subfigures. Because a large portion of figures in COVID-19 articles are not CXR or CT, we designed a deep-learning model to distinguish them from other figure types and to classify them accordingly. The final database includes 1,327 CT and 263 CXR images (as of May 9, 2020) with their relevant text. To demonstrate the utility of COVID-19-CT-CXR, we conducted four case studies. (1) We show that COVID-19-CT-CXR, when used as additional training data, is able to contribute to improved deep-learning (DL) performance for the classification of COVID-19 and non-COVID-19 CT. (2) We collected CT images of influenza, another common infectious respiratory illness that may present similarly to COVID-19, and fine-tuned a baseline deep neural network to distinguish a diagnosis of COVID-19, influenza, or normal or other types of diseases on CT. (3) We fine-tuned an unsupervised one-class classifier from non-COVID-19 CXR and performed anomaly detection to detect COVID-19 CXR. (4) From text-mined captions and figure descriptions, we compared 15 clinical symptoms and 20 clinical findings of COVID-19 versus those of influenza to demonstrate the disease differences in the scientific publications. Our database is unique, as the figures are retrieved along with relevant text with fine-grained descriptions, and it can be extended easily in the future. We believe that our work is complementary to existing resources and hope that it will contribute to medical image analysis of the COVID-19 pandemic. The dataset, code, and DL models are publicly available at https://github.com/ncbi-nlp/COVID-19-CT-CXR.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The latest threat to global health is the COVID-19 outbreak. Although there exist large datasets of chest X-rays (CXR) and computed tomography (CT) scans, few COVID-19 image collections are currently available due to patient privacy. At the same time, there is a rapid growth of COVID-19-relevant articles in the biomedical literature, including those that report findings on radiographs. Here, we present COVID-19-CT-CXR, a public database of COVID-19 CXR and CT images, which are automatically extracted from COVID-19-relevant articles from the PubMed Central Open Access (PMC-OA) Subset. We extracted figures, associated captions, and relevant figure descriptions in the article and separated compound figures into subfigures. Because a large portion of figures in COVID-19 articles are not CXR or CT, we designed a deep-learning model to distinguish them from other figure types and to classify them accordingly. The final database includes 1,327 CT and 263 CXR images (as of May 9, 2020) with their relevant text. To demonstrate the utility of COVID-19-CT-CXR, we conducted four case studies. (1) We show that COVID-19-CT-CXR, when used as additional training data, is able to contribute to improved deep-learning (DL) performance for the classification of COVID-19 and non-COVID-19 CT. (2) We collected CT images of influenza, another common infectious respiratory illness that may present similarly to COVID-19, and fine-tuned a baseline deep neural network to distinguish a diagnosis of COVID-19, influenza, or normal or other types of diseases on CT. (3) We fine-tuned an unsupervised one-class classifier from non-COVID-19 CXR and performed anomaly detection to detect COVID-19 CXR. (4) From text-mined captions and figure descriptions, we compared 15 clinical symptoms and 20 clinical findings of COVID-19 versus those of influenza to demonstrate the disease differences in the scientific publications. Our database is unique, as the figures are retrieved along with relevant text with fine-grained descriptions, and it can be extended easily in the future. We believe that our work is complementary to existing resources and hope that it will contribute to medical image analysis of the COVID-19 pandemic. The dataset, code, and DL models are publicly available at https://github.com/ncbi-nlp/COVID-19-CT-CXR.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The latest threat to global health is the COVID-19 outbreak. Although there exist large datasets of chest X-rays (CXR) and computed tomography (CT) scans, few COVID-19 image collections are currently available due to patient privacy. At the same time, there is a rapid growth of COVID-19-relevant articles in the biomedical literature, including those that report findings on radiographs. Here, we present COVID-19-CT-CXR, a public database of COVID-19 CXR and CT images, which are automatically extracted from COVID-19-relevant articles from the PubMed Central Open Access (PMC-OA) Subset. We extracted figures, associated captions, and relevant figure descriptions in the article and separated compound figures into subfigures. Because a large portion of figures in COVID-19 articles are not CXR or CT, we designed a deep-learning model to distinguish them from other figure types and to classify them accordingly. The final database includes 1,327 CT and 263 CXR images (as of May 9, 2020) with their relevant text. To demonstrate the utility of COVID-19-CT-CXR, we conducted four case studies. (1) We show that COVID-19-CT-CXR, when used as additional training data, is able to contribute to improved deep-learning (DL) performance for the classification of COVID-19 and non-COVID-19 CT. (2) We collected CT images of influenza, another common infectious respiratory illness that may present similarly to COVID-19, and fine-tuned a baseline deep neural network to distinguish a diagnosis of COVID-19, influenza, or normal or other types of diseases on CT. (3) We fine-tuned an unsupervised one-class classifier from non-COVID-19 CXR and performed anomaly detection to detect COVID-19 CXR. (4) From text-mined captions and figure descriptions, we compared 15 clinical symptoms and 20 clinical findings of COVID-19 versus those of influenza to demonstrate the disease differences in the scientific publications. Our database is unique, as the figures are retrieved along with relevant text with fine-grained descriptions, and it can be extended easily in the future. We believe that our work is complementary to existing resources and hope that it will contribute to medical image analysis of the COVID-19 pandemic. The dataset, code, and DL models are publicly available at https://github.com/ncbi-nlp/COVID-19-CT-CXR.",
"title": "COVID-19-CT-CXR: A Freely Accessible and Weakly Labeled Chest X-Ray and CT Image Collection on COVID-19 From Biomedical Literature",
"normalizedTitle": "COVID-19-CT-CXR: A Freely Accessible and Weakly Labeled Chest X-Ray and CT Image Collection on COVID-19 From Biomedical Literature",
"fno": "09248607",
"hasPdf": true,
"idPrefix": "bd",
"keywords": [
"Computerised Tomography",
"Data Mining",
"Diagnostic Radiography",
"Diseases",
"Feature Extraction",
"Image Classification",
"Image Segmentation",
"Learning Artificial Intelligence",
"Medical Image Processing",
"Medical Information Systems",
"Neural Nets",
"Statistical Analysis",
"Text Analysis",
"CT Images",
"Non COVID 19 CXR",
"COVID 19 Pandemic",
"Non COVID 19 CT",
"COVID 19 Image",
"Chest X Ray Image",
"Biomedical Literature",
"Deep Learning",
"Infectious Respiratory Illness",
"Baseline Deep Neural Network",
"Influenza",
"COVID 19 Diagnosis",
"Disease",
"COVID 19",
"Computed Tomography",
"Databases",
"Biomedical Imaging",
"X Ray Imaging",
"Compounds",
"COVID 19",
"Chest X Ray",
"CT"
],
"authors": [
{
"givenName": "Yifan",
"surname": "Peng",
"fullName": "Yifan Peng",
"affiliation": "NCBI/NLM/NIH and Department of Population Health Sciences, Weill Cornell Medicine, New York, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuxing",
"surname": "Tang",
"fullName": "Yuxing Tang",
"affiliation": "Radiology and Imaging Sciences Department, Imaging Biomarkers and Computer-Aided Diagnosis Laboratory, National Institutes of Health (NIH) Clinical Center, Bethesda, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sungwon",
"surname": "Lee",
"fullName": "Sungwon Lee",
"affiliation": "Radiology and Imaging Sciences Department, Imaging Biomarkers and Computer-Aided Diagnosis Laboratory, National Institutes of Health (NIH) Clinical Center, Bethesda, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingying",
"surname": "Zhu",
"fullName": "Yingying Zhu",
"affiliation": "Radiology and Imaging Sciences Department, Imaging Biomarkers and Computer-Aided Diagnosis Laboratory, National Institutes of Health (NIH) Clinical Center, Bethesda, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ronald M.",
"surname": "Summers",
"fullName": "Ronald M. Summers",
"affiliation": "Radiology and Imaging Sciences Department, Imaging Biomarkers and Computer-Aided Diagnosis Laboratory, National Institutes of Health (NIH) Clinical Center, Bethesda, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhiyong",
"surname": "Lu",
"fullName": "Zhiyong Lu",
"affiliation": "National Library of Medicine (NLM), National Center for Biotechnology Information (NCBI), National Institutes of Health (NIH), Bethesda, MD, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2021-01-01 00:00:00",
"pubType": "trans",
"pages": "3-12",
"year": "2021",
"issn": "2332-7790",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/sc/2022/03/09681206",
"title": "DisCOV: Distributed COVID-19 Detection on X-Ray Images With Edge-Cloud Collaboration",
"doi": null,
"abstractUrl": "/journal/sc/2022/03/09681206/1A8c5cxkiY0",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/5555/01/09965606",
"title": "Deep Dual Attention Network for Precise Diagnosis of COVID-19 From Chest CT Images",
"doi": null,
"abstractUrl": "/journal/ai/5555/01/09965606/1IHMSiEzkt2",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2022/8487/0/848700a158",
"title": "Attention-based Automated Chest CT Image Segmentation Method of COVID-19 Lung Infection",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2022/848700a158/1J6hFthOYLe",
"parentPublication": {
"id": "proceedings/bibe/2022/8487/0",
"title": "2022 IEEE 22nd International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2022/4609/0/460900a349",
"title": "VGG-FusionNet: A Feature Fusion Framework from CT scan and Chest X-ray Images based Deep Learning for COVID-19 Detection",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2022/460900a349/1KBr1wq6x5m",
"parentPublication": {
"id": "proceedings/icdmw/2022/4609/0",
"title": "2022 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iri/2020/1054/0/09191543",
"title": "A Distribution-based Regression for Real-time COVID-19 Cases Detection from Chest X-ray and CT Images",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2020/09191543/1n0IytAEmfC",
"parentPublication": {
"id": "proceedings/iri/2020/1054/0",
"title": "2020 IEEE 21st International Conference on Information Reuse and Integration for Data Science (IRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2021/01/09345435",
"title": "COVID-19 Chest CT Image Segmentation Network by Multi-Scale Fusion and Enhancement Operations",
"doi": null,
"abstractUrl": "/journal/bd/2021/01/09345435/1qTYEs9wmYg",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2020/6215/0/09313304",
"title": "DeepCOVIDExplainer: Explainable COVID-19 Diagnosis from Chest X-ray Images",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313304/1qmfNIN1pm0",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552241",
"title": "<italic>COVID</italic>-view: Diagnosis of COVID-19 using Chest CT",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552241/1xic6RdmNC8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2021/0191/0/019100a519",
"title": "A Hierarchical Classification System for the Detection of Covid-19 from Chest X-Ray Images",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2021/019100a519/1yNioxL77Co",
"parentPublication": {
"id": "proceedings/iccvw/2021/0191/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2021/0191/0/019100a537",
"title": "MIA-COV19D: COVID-19 Detection through 3-D Chest CT Image Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2021/019100a537/1yNitrTJNug",
"parentPublication": {
"id": "proceedings/iccvw/2021/0191/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09366628",
"articleId": "1rCbQFmxhcs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09345435",
"articleId": "1qTYEs9wmYg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1rCbPpaC8GA",
"title": "March",
"year": "2021",
"issueNum": "01",
"idPrefix": "bd",
"pubType": "journal",
"volume": "7",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1qTYEs9wmYg",
"doi": "10.1109/TBDATA.2021.3056564",
"abstract": "A novel coronavirus disease 2019 (COVID-19) was detected and has spread rapidly across various countries around the world since the end of the year 2019. Computed Tomography (CT) images have been used as a crucial alternative to the time-consuming RT-PCR test. However, pure manual segmentation of CT images faces a serious challenge with the increase of suspected cases, resulting in urgent requirements for accurate and automatic segmentation of COVID-19 infections. Unfortunately, since the imaging characteristics of the COVID-19 infection are diverse and similar to the backgrounds, existing medical image segmentation methods cannot achieve satisfactory performance. In this article, we try to establish a new deep convolutional neural network tailored for segmenting the chest CT images with COVID-19 infections. We first maintain a large and new chest CT image dataset consisting of 165,667 annotated chest CT images from 861 patients with confirmed COVID-19. Inspired by the observation that the boundary of the infected lung can be enhanced by adjusting the global intensity, in the proposed deep CNN, we introduce a feature variation block which adaptively adjusts the global properties of the features for segmenting COVID-19 infection. The proposed FV block can enhance the capability of feature representation effectively and adaptively for diverse cases. We fuse features at different scales by proposing Progressive Atrous Spatial Pyramid Pooling to handle the sophisticated infection areas with diverse appearance and shapes. The proposed method achieves state-of-the-art performance. Dice similarity coefficients are 0.987 and 0.726 for lung and COVID-19 segmentation, respectively. We conducted experiments on the data collected in China and Germany and show that the proposed deep CNN can produce impressive performance effectively. The proposed network enhances the segmentation ability of the COVID-19 infection, makes the connection with other techniques and contributes to the development of remedying COVID-19 infection.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A novel coronavirus disease 2019 (COVID-19) was detected and has spread rapidly across various countries around the world since the end of the year 2019. Computed Tomography (CT) images have been used as a crucial alternative to the time-consuming RT-PCR test. However, pure manual segmentation of CT images faces a serious challenge with the increase of suspected cases, resulting in urgent requirements for accurate and automatic segmentation of COVID-19 infections. Unfortunately, since the imaging characteristics of the COVID-19 infection are diverse and similar to the backgrounds, existing medical image segmentation methods cannot achieve satisfactory performance. In this article, we try to establish a new deep convolutional neural network tailored for segmenting the chest CT images with COVID-19 infections. We first maintain a large and new chest CT image dataset consisting of 165,667 annotated chest CT images from 861 patients with confirmed COVID-19. Inspired by the observation that the boundary of the infected lung can be enhanced by adjusting the global intensity, in the proposed deep CNN, we introduce a feature variation block which adaptively adjusts the global properties of the features for segmenting COVID-19 infection. The proposed FV block can enhance the capability of feature representation effectively and adaptively for diverse cases. We fuse features at different scales by proposing Progressive Atrous Spatial Pyramid Pooling to handle the sophisticated infection areas with diverse appearance and shapes. The proposed method achieves state-of-the-art performance. Dice similarity coefficients are 0.987 and 0.726 for lung and COVID-19 segmentation, respectively. We conducted experiments on the data collected in China and Germany and show that the proposed deep CNN can produce impressive performance effectively. The proposed network enhances the segmentation ability of the COVID-19 infection, makes the connection with other techniques and contributes to the development of remedying COVID-19 infection.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A novel coronavirus disease 2019 (COVID-19) was detected and has spread rapidly across various countries around the world since the end of the year 2019. Computed Tomography (CT) images have been used as a crucial alternative to the time-consuming RT-PCR test. However, pure manual segmentation of CT images faces a serious challenge with the increase of suspected cases, resulting in urgent requirements for accurate and automatic segmentation of COVID-19 infections. Unfortunately, since the imaging characteristics of the COVID-19 infection are diverse and similar to the backgrounds, existing medical image segmentation methods cannot achieve satisfactory performance. In this article, we try to establish a new deep convolutional neural network tailored for segmenting the chest CT images with COVID-19 infections. We first maintain a large and new chest CT image dataset consisting of 165,667 annotated chest CT images from 861 patients with confirmed COVID-19. Inspired by the observation that the boundary of the infected lung can be enhanced by adjusting the global intensity, in the proposed deep CNN, we introduce a feature variation block which adaptively adjusts the global properties of the features for segmenting COVID-19 infection. The proposed FV block can enhance the capability of feature representation effectively and adaptively for diverse cases. We fuse features at different scales by proposing Progressive Atrous Spatial Pyramid Pooling to handle the sophisticated infection areas with diverse appearance and shapes. The proposed method achieves state-of-the-art performance. Dice similarity coefficients are 0.987 and 0.726 for lung and COVID-19 segmentation, respectively. We conducted experiments on the data collected in China and Germany and show that the proposed deep CNN can produce impressive performance effectively. The proposed network enhances the segmentation ability of the COVID-19 infection, makes the connection with other techniques and contributes to the development of remedying COVID-19 infection.",
"title": "COVID-19 Chest CT Image Segmentation Network by Multi-Scale Fusion and Enhancement Operations",
"normalizedTitle": "COVID-19 Chest CT Image Segmentation Network by Multi-Scale Fusion and Enhancement Operations",
"fno": "09345435",
"hasPdf": true,
"idPrefix": "bd",
"keywords": [
"Computerised Tomography",
"Diseases",
"Feature Extraction",
"Image Classification",
"Image Representation",
"Image Segmentation",
"Lung",
"Medical Image Processing",
"Neural Nets",
"Object Detection",
"COVID 19 Chest CT Image Segmentation Network",
"Computed Tomography Images",
"COVID 19 Infection",
"Medical Image Segmentation Methods",
"Chest CT Image Dataset",
"Chest CT Images",
"Confirmed COVID 19",
"COVID 19 Segmentation",
"COVID 19",
"Computed Tomography",
"Lung",
"Image Segmentation",
"Feature Extraction",
"Hospitals",
"Deep Learning",
"Coronavirus Disease 2019 Pneumonia",
"COVID 19",
"Deep Learning",
"Segmentation",
"Multi Scale Feature"
],
"authors": [
{
"givenName": "Qingsen",
"surname": "Yan",
"fullName": "Qingsen Yan",
"affiliation": "Australian Institute for Machine Learning, University of Adelaide, Adelaide, SA, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bo",
"surname": "Wang",
"fullName": "Bo Wang",
"affiliation": "State Key Laboratory of Precision Measurement Technology and Instruments, Department of Precision Instrument, Innovation Center for Future Chips, Tsinghua University (THU), Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dong",
"surname": "Gong",
"fullName": "Dong Gong",
"affiliation": "Australian Institute for Machine Learning, University of Adelaide, Adelaide, SA, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chuan",
"surname": "Luo",
"fullName": "Chuan Luo",
"affiliation": "State Key Laboratory of Precision Measurement Technology and Instruments, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Zhao",
"fullName": "Wei Zhao",
"affiliation": "Beijing Jingzhen Medical Technology Ltd., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jianhu",
"surname": "Shen",
"fullName": "Jianhu Shen",
"affiliation": "Beijing Jingzhen Medical Technology Ltd., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jingyang",
"surname": "Ai",
"fullName": "Jingyang Ai",
"affiliation": "Beijing Jingzhen Medical Technology Ltd., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qinfeng",
"surname": "Shi",
"fullName": "Qinfeng Shi",
"affiliation": "Australian Institute for Machine Learning, University of Adelaide, Adelaide, SA, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yanning",
"surname": "Zhang",
"fullName": "Yanning Zhang",
"affiliation": "School of Computer Science, Northwestern Polytechnical University, Xi'an, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shuo",
"surname": "Jin",
"fullName": "Shuo Jin",
"affiliation": "Beijing Tsinghua Changgung Hospital, School of Clinical Medicine, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Liang",
"surname": "Zhang",
"fullName": "Liang Zhang",
"affiliation": "School of Computer Science and Technology, Xidian University, Xi'an, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zheng",
"surname": "You",
"fullName": "Zheng You",
"affiliation": "State Key Laboratory of Precision Measurement Technology and Instruments, Department of Precision Instrument, Innovation Center for Future Chips, Tsinghua University (THU), Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2021-01-01 00:00:00",
"pubType": "trans",
"pages": "13-24",
"year": "2021",
"issn": "2332-7790",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/big-data/2021/3902/0/09671656",
"title": "Classification of COVID-19 using Deep Learning and Radiomic Texture Features extracted from CT scans of Patients Lungs",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2021/09671656/1A8hnGyzxa8",
"parentPublication": {
"id": "proceedings/big-data/2021/3902/0",
"title": "2021 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dasc-picom-cbdcom-cyberscitech/2021/2174/0/217400a256",
"title": "A Traditional Machine Learning Approach for COVID-19 Detection from CT Images",
"doi": null,
"abstractUrl": "/proceedings-article/dasc-picom-cbdcom-cyberscitech/2021/217400a256/1BLnCksu7vi",
"parentPublication": {
"id": "proceedings/dasc-picom-cbdcom-cyberscitech/2021/2174/0",
"title": "2021 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/5555/01/09965606",
"title": "Deep Dual Attention Network for Precise Diagnosis of COVID-19 From Chest CT Images",
"doi": null,
"abstractUrl": "/journal/ai/5555/01/09965606/1IHMSiEzkt2",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09994991",
"title": "TLU-Net: Transfer Learning Framework using U-Net Convolutional Neural Networks for CT-based Lungs and COVID-19 Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09994991/1JC2jmqhBug",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscc/2020/8086/0/09219726",
"title": "Diagnosis of COVID-19 in CT image using CNN and XGBoost",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2020/09219726/1nRPkI4IKCQ",
"parentPublication": {
"id": "proceedings/iscc/2020/8086/0",
"title": "2020 IEEE Symposium on Computers and Communications (ISCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2021/01/09248607",
"title": "COVID-19-CT-CXR: A Freely Accessible and Weakly Labeled Chest X-Ray and CT Image Collection on COVID-19 From Biomedical Literature",
"doi": null,
"abstractUrl": "/journal/bd/2021/01/09248607/1otZZzqPLMY",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/09376253",
"title": "Deep Learning Enables Accurate Diagnosis of Novel Coronavirus (COVID-19) With CT Images",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/09376253/1rSMNzJFMIM",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itca/2020/0378/0/037800a672",
"title": "Diagnosis Model of COVID-19 with Feature Loss",
"doi": null,
"abstractUrl": "/proceedings-article/itca/2020/037800a672/1tpBdLKCzkc",
"parentPublication": {
"id": "proceedings/itca/2020/0378/0",
"title": "2020 2nd International Conference on Information Technology and Computer Application (ITCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552241",
"title": "<italic>COVID</italic>-view: Diagnosis of COVID-19 using Chest CT",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552241/1xic6RdmNC8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2021/0191/0/019100a537",
"title": "MIA-COV19D: COVID-19 Detection through 3-D Chest CT Image Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2021/019100a537/1yNitrTJNug",
"parentPublication": {
"id": "proceedings/iccvw/2021/0191/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09248607",
"articleId": "1otZZzqPLMY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09328353",
"articleId": "1qutMwWfODu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zarv24nAkg",
"title": "Nov.-Dec.",
"year": "2021",
"issueNum": "06",
"idPrefix": "tb",
"pubType": "journal",
"volume": "18",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1rSMNzJFMIM",
"doi": "10.1109/TCBB.2021.3065361",
"abstract": "A novel coronavirus (COVID-19) recently emerged as an acute respiratory syndrome, and has caused a pneumonia outbreak world-widely. As the COVID-19 continues to spread rapidly across the world, computed tomography (CT) has become essentially important for fast diagnoses. Thus, it is urgent to develop an accurate computer-aided method to assist clinicians to identify COVID-19-infected patients by CT images. Here, we have collected chest CT scans of 88 patients diagnosed with COVID-19 from hospitals of two provinces in China, 100 patients infected with bacteria pneumonia, and 86 healthy persons for comparison and modeling. Based on the data, a deep learning-based CT diagnosis system was developed to identify patients with COVID-19. The experimental results showed that our model could accurately discriminate the COVID-19 patients from the bacteria pneumonia patients with an AUC of 0.95, recall (sensitivity) of 0.96, and precision of 0.79. When integrating three types of CT images, our model achieved a recall of 0.93 with precision of 0.86 for discriminating COVID-19 patients from others. Moreover, our model could extract main lesion features, especially the ground-glass opacity (GGO), which are visually helpful for assisted diagnoses by doctors. An online server is available for online diagnoses with CT images by our server (<uri>http://biomed.nscc-gz.cn/model.php</uri>). Source codes and datasets are available at our GitHub (<uri>https://github.com/SY575/COVID19-CT</uri>).",
"abstracts": [
{
"abstractType": "Regular",
"content": "A novel coronavirus (COVID-19) recently emerged as an acute respiratory syndrome, and has caused a pneumonia outbreak world-widely. As the COVID-19 continues to spread rapidly across the world, computed tomography (CT) has become essentially important for fast diagnoses. Thus, it is urgent to develop an accurate computer-aided method to assist clinicians to identify COVID-19-infected patients by CT images. Here, we have collected chest CT scans of 88 patients diagnosed with COVID-19 from hospitals of two provinces in China, 100 patients infected with bacteria pneumonia, and 86 healthy persons for comparison and modeling. Based on the data, a deep learning-based CT diagnosis system was developed to identify patients with COVID-19. The experimental results showed that our model could accurately discriminate the COVID-19 patients from the bacteria pneumonia patients with an AUC of 0.95, recall (sensitivity) of 0.96, and precision of 0.79. When integrating three types of CT images, our model achieved a recall of 0.93 with precision of 0.86 for discriminating COVID-19 patients from others. Moreover, our model could extract main lesion features, especially the ground-glass opacity (GGO), which are visually helpful for assisted diagnoses by doctors. An online server is available for online diagnoses with CT images by our server (<uri>http://biomed.nscc-gz.cn/model.php</uri>). Source codes and datasets are available at our GitHub (<uri>https://github.com/SY575/COVID19-CT</uri>).",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A novel coronavirus (COVID-19) recently emerged as an acute respiratory syndrome, and has caused a pneumonia outbreak world-widely. As the COVID-19 continues to spread rapidly across the world, computed tomography (CT) has become essentially important for fast diagnoses. Thus, it is urgent to develop an accurate computer-aided method to assist clinicians to identify COVID-19-infected patients by CT images. Here, we have collected chest CT scans of 88 patients diagnosed with COVID-19 from hospitals of two provinces in China, 100 patients infected with bacteria pneumonia, and 86 healthy persons for comparison and modeling. Based on the data, a deep learning-based CT diagnosis system was developed to identify patients with COVID-19. The experimental results showed that our model could accurately discriminate the COVID-19 patients from the bacteria pneumonia patients with an AUC of 0.95, recall (sensitivity) of 0.96, and precision of 0.79. When integrating three types of CT images, our model achieved a recall of 0.93 with precision of 0.86 for discriminating COVID-19 patients from others. Moreover, our model could extract main lesion features, especially the ground-glass opacity (GGO), which are visually helpful for assisted diagnoses by doctors. An online server is available for online diagnoses with CT images by our server (http://biomed.nscc-gz.cn/model.php). Source codes and datasets are available at our GitHub (https://github.com/SY575/COVID19-CT).",
"title": "Deep Learning Enables Accurate Diagnosis of Novel Coronavirus (COVID-19) With CT Images",
"normalizedTitle": "Deep Learning Enables Accurate Diagnosis of Novel Coronavirus (COVID-19) With CT Images",
"fno": "09376253",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Cancer",
"Computerised Tomography",
"Diseases",
"Learning Artificial Intelligence",
"Lung",
"Medical Image Processing",
"Microorganisms",
"Patient Diagnosis",
"Pneumodynamics",
"Accurate Computer Aided Method",
"CT Images",
"Chest CT Scans",
"Deep Learning Based CT Diagnosis System",
"COVID 19 Patients",
"Bacteria Pneumonia Patients",
"Enables Accurate Diagnosis",
"Pneumonia Outbreak World Widely",
"Feature Extraction",
"Computed Tomography",
"Lung",
"COVID 19",
"Hospitals",
"Lesions",
"Deep Learning",
"Medical Diagnosis",
"COVID 19",
"Deep Learning",
"Pneumonia Diagnosis",
"Weakly Supervised Learning"
],
"authors": [
{
"givenName": "Ying",
"surname": "Song",
"fullName": "Ying Song",
"affiliation": "National Supercomputer Center in Guangzhou, Sun Yat-sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shuangjia",
"surname": "Zheng",
"fullName": "Shuangjia Zheng",
"affiliation": "National Supercomputer Center in Guangzhou, Sun Yat-sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Liang",
"surname": "Li",
"fullName": "Liang Li",
"affiliation": "Department of Radiology, Renmin Hospital of Wuhan University, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiang",
"surname": "Zhang",
"fullName": "Xiang Zhang",
"affiliation": "Department of Radiology, Sun Yat-Sen Memorial Hospital, Sun Yat-Sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaodong",
"surname": "Zhang",
"fullName": "Xiaodong Zhang",
"affiliation": "Department of Radiology, The Third Affiliated Hospital of Sun Yat-Sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ziwang",
"surname": "Huang",
"fullName": "Ziwang Huang",
"affiliation": "School of Data and Computer Science, Sun Yat-sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jianwen",
"surname": "Chen",
"fullName": "Jianwen Chen",
"affiliation": "National Supercomputer Center in Guangzhou, Sun Yat-sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ruixuan",
"surname": "Wang",
"fullName": "Ruixuan Wang",
"affiliation": "School of Data and Computer Science, Sun Yat-sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huiying",
"surname": "Zhao",
"fullName": "Huiying Zhao",
"affiliation": "Department of Radiology, Sun Yat-Sen Memorial Hospital, Sun Yat-Sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yutian",
"surname": "Chong",
"fullName": "Yutian Chong",
"affiliation": "Department of Radiology, The Third Affiliated Hospital of Sun Yat-Sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jun",
"surname": "Shen",
"fullName": "Jun Shen",
"affiliation": "Department of Radiology, Sun Yat-Sen Memorial Hospital, Sun Yat-Sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yunfei",
"surname": "Zha",
"fullName": "Yunfei Zha",
"affiliation": "Department of Radiology, Renmin Hospital of Wuhan University, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuedong",
"surname": "Yang",
"fullName": "Yuedong Yang",
"affiliation": "National Supercomputer Center in Guangzhou, Sun Yat-sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "06",
"pubDate": "2021-11-01 00:00:00",
"pubType": "trans",
"pages": "2775-2780",
"year": "2021",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dasc-picom-cbdcom-cyberscitech/2021/2174/0/217400a256",
"title": "A Traditional Machine Learning Approach for COVID-19 Detection from CT Images",
"doi": null,
"abstractUrl": "/proceedings-article/dasc-picom-cbdcom-cyberscitech/2021/217400a256/1BLnCksu7vi",
"parentPublication": {
"id": "proceedings/dasc-picom-cbdcom-cyberscitech/2021/2174/0",
"title": "2021 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicas/2021/2810/0/281000a286",
"title": "COVID-19 Classification using CT Scan Images with Resize-MobileNet",
"doi": null,
"abstractUrl": "/proceedings-article/icicas/2021/281000a286/1ByfbcMlNBK",
"parentPublication": {
"id": "proceedings/icicas/2021/2810/0",
"title": "2021 International Conference on Intelligent Computing, Automation and Systems (ICICAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icaice/2021/2186/0/218600a740",
"title": "Diagnose COVID-19 Based on CT Images Using Transfer Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icaice/2021/218600a740/1Et4yH2viuI",
"parentPublication": {
"id": "proceedings/icaice/2021/2186/0",
"title": "2021 2nd International Conference on Artificial Intelligence and Computer Engineering (ICAICE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/10032636",
"title": "SS-TBN: A Semi-Supervised Tri-Branch Network for COVID-19 Screening and Lesion Segmentation",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10032636/1KnSl7hePKg",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/5555/01/10071538",
"title": "CMM: A CNN-MLP Model for COVID-19 Lesion Segmentation and Severity Grading",
"doi": null,
"abstractUrl": "/journal/tb/5555/01/10071538/1LxaQGeQkrC",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2021/01/09345435",
"title": "COVID-19 Chest CT Image Segmentation Network by Multi-Scale Fusion and Enhancement Operations",
"doi": null,
"abstractUrl": "/journal/bd/2021/01/09345435/1qTYEs9wmYg",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412228",
"title": "Unsupervised Detection of Pulmonary Opacities for Computer-Aided Diagnosis of COVID-19 on CT Images",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412228/1tmj6XzzcS4",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/05/09508150",
"title": "Automated Diagnosis of COVID-19 Using Deep Supervised Autoencoder With Multi-View Features From CT Images",
"doi": null,
"abstractUrl": "/journal/tb/2022/05/09508150/1vOUcgJh4DS",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552241",
"title": "<italic>COVID</italic>-view: Diagnosis of COVID-19 using Chest CT",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552241/1xic6RdmNC8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2021/0191/0/019100a446",
"title": "Intelligent Radiomic Analysis of Q-SPECT/CT images to optimize pulmonary embolism diagnosis in COVID-19 patients",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2021/019100a446/1yNipyBheZW",
"parentPublication": {
"id": "proceedings/iccvw/2021/0191/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09333662",
"articleId": "1qB7q9aoxUI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09531398",
"articleId": "1wJkUO51laU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1wTiG92JyP6",
"title": "June",
"year": "2021",
"issueNum": "03",
"idPrefix": "ai",
"pubType": "journal",
"volume": "2",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1rZmvrW1Lu8",
"doi": "10.1109/TAI.2021.3064913",
"abstract": "Automatic lung lesion segmentation of chest computer tomography (CT) scans is considered a pivotal stage toward accurate diagnosis and severity measurement of COVID-19. Traditional U-shaped encoder–decoder architecture and its variants suffer from diminutions of contextual information in pooling/upsampling operations with increased semantic gaps among encoded and decoded feature maps as well as instigate vanishing gradient problems for its sequential gradient propagation that result in suboptimal performance. Moreover, operating with 3-D CT volume poses further limitations due to the exponential increase of computational complexity making the optimization difficult. In this article, an automated COVID-19 lesion segmentation scheme is proposed utilizing a highly efficient neural network architecture, namely CovSegNet, to overcome these limitations. Additionally, a two-phase training scheme is introduced where a deeper 2-D network is employed for generating region-of-interest (ROI)-enhanced CT volume followed by a shallower 3-D network for further enhancement with more contextual information without increasing computational burden. Along with the traditional vertical expansion of Unet, we have introduced horizontal expansion with multistage encoder–decoder modules for achieving optimum performance. Additionally, multiscale feature maps are integrated into the scale transition process to overcome the loss of contextual information. Moreover, a multiscale fusion module is introduced with a pyramid fusion scheme to reduce the semantic gaps between subsequent encoder/decoder modules while facilitating the parallel optimization for efficient gradient propagation. Outstanding performances have been achieved in three publicly available datasets that largely outperform other state-of-the-art approaches. The proposed scheme can be easily extended for achieving optimum segmentation performances in a wide variety of applications.</p> <p><italic><bold>Impact Statement</bold></italic>—With lower sensitivity (60–70%), elongated testing time, and a dire shortage of testing kits, traditional RTPCR based COVID-19 diagnostic scheme heavily relies on postCT based manual inspection for further investigation. Hence, automating the process of infected lesions extraction from chestCT volumes will be major progress for faster accurate diagnosis of COVID-19. However, in challenging conditions with diffused, blurred, and varying shaped edges of COVID-19 lesions, conventional approaches fail to provide precise segmentation of lesions that can be deleterious for false estimation and loss of information. The proposed scheme incorporating an efficient neural network architecture (CovSegNet) overcomes the limitations of traditional approaches that provide significant improvement of performance (8.4% in averaged dice measurement scale) over two datasets. Therefore, this scheme can be an effective, economical tool for the physicians for faster infection analysis to greatly reduce the spread and massive death toll of this deadly virus through mass-screening.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Automatic lung lesion segmentation of chest computer tomography (CT) scans is considered a pivotal stage toward accurate diagnosis and severity measurement of COVID-19. Traditional U-shaped encoder–decoder architecture and its variants suffer from diminutions of contextual information in pooling/upsampling operations with increased semantic gaps among encoded and decoded feature maps as well as instigate vanishing gradient problems for its sequential gradient propagation that result in suboptimal performance. Moreover, operating with 3-D CT volume poses further limitations due to the exponential increase of computational complexity making the optimization difficult. In this article, an automated COVID-19 lesion segmentation scheme is proposed utilizing a highly efficient neural network architecture, namely CovSegNet, to overcome these limitations. Additionally, a two-phase training scheme is introduced where a deeper 2-D network is employed for generating region-of-interest (ROI)-enhanced CT volume followed by a shallower 3-D network for further enhancement with more contextual information without increasing computational burden. Along with the traditional vertical expansion of Unet, we have introduced horizontal expansion with multistage encoder–decoder modules for achieving optimum performance. Additionally, multiscale feature maps are integrated into the scale transition process to overcome the loss of contextual information. Moreover, a multiscale fusion module is introduced with a pyramid fusion scheme to reduce the semantic gaps between subsequent encoder/decoder modules while facilitating the parallel optimization for efficient gradient propagation. Outstanding performances have been achieved in three publicly available datasets that largely outperform other state-of-the-art approaches. The proposed scheme can be easily extended for achieving optimum segmentation performances in a wide variety of applications.</p> <p><italic><bold>Impact Statement</bold></italic>—With lower sensitivity (60–70%), elongated testing time, and a dire shortage of testing kits, traditional RTPCR based COVID-19 diagnostic scheme heavily relies on postCT based manual inspection for further investigation. Hence, automating the process of infected lesions extraction from chestCT volumes will be major progress for faster accurate diagnosis of COVID-19. However, in challenging conditions with diffused, blurred, and varying shaped edges of COVID-19 lesions, conventional approaches fail to provide precise segmentation of lesions that can be deleterious for false estimation and loss of information. The proposed scheme incorporating an efficient neural network architecture (CovSegNet) overcomes the limitations of traditional approaches that provide significant improvement of performance (8.4% in averaged dice measurement scale) over two datasets. Therefore, this scheme can be an effective, economical tool for the physicians for faster infection analysis to greatly reduce the spread and massive death toll of this deadly virus through mass-screening.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Automatic lung lesion segmentation of chest computer tomography (CT) scans is considered a pivotal stage toward accurate diagnosis and severity measurement of COVID-19. Traditional U-shaped encoder–decoder architecture and its variants suffer from diminutions of contextual information in pooling/upsampling operations with increased semantic gaps among encoded and decoded feature maps as well as instigate vanishing gradient problems for its sequential gradient propagation that result in suboptimal performance. Moreover, operating with 3-D CT volume poses further limitations due to the exponential increase of computational complexity making the optimization difficult. In this article, an automated COVID-19 lesion segmentation scheme is proposed utilizing a highly efficient neural network architecture, namely CovSegNet, to overcome these limitations. Additionally, a two-phase training scheme is introduced where a deeper 2-D network is employed for generating region-of-interest (ROI)-enhanced CT volume followed by a shallower 3-D network for further enhancement with more contextual information without increasing computational burden. Along with the traditional vertical expansion of Unet, we have introduced horizontal expansion with multistage encoder–decoder modules for achieving optimum performance. Additionally, multiscale feature maps are integrated into the scale transition process to overcome the loss of contextual information. Moreover, a multiscale fusion module is introduced with a pyramid fusion scheme to reduce the semantic gaps between subsequent encoder/decoder modules while facilitating the parallel optimization for efficient gradient propagation. Outstanding performances have been achieved in three publicly available datasets that largely outperform other state-of-the-art approaches. The proposed scheme can be easily extended for achieving optimum segmentation performances in a wide variety of applications. Impact Statement—With lower sensitivity (60–70%), elongated testing time, and a dire shortage of testing kits, traditional RTPCR based COVID-19 diagnostic scheme heavily relies on postCT based manual inspection for further investigation. Hence, automating the process of infected lesions extraction from chestCT volumes will be major progress for faster accurate diagnosis of COVID-19. However, in challenging conditions with diffused, blurred, and varying shaped edges of COVID-19 lesions, conventional approaches fail to provide precise segmentation of lesions that can be deleterious for false estimation and loss of information. The proposed scheme incorporating an efficient neural network architecture (CovSegNet) overcomes the limitations of traditional approaches that provide significant improvement of performance (8.4% in averaged dice measurement scale) over two datasets. Therefore, this scheme can be an effective, economical tool for the physicians for faster infection analysis to greatly reduce the spread and massive death toll of this deadly virus through mass-screening.",
"title": "CovSegNet: A Multi Encoder–Decoder Architecture for Improved Lesion Segmentation of COVID-19 Chest CT Scans",
"normalizedTitle": "CovSegNet: A Multi Encoder–Decoder Architecture for Improved Lesion Segmentation of COVID-19 Chest CT Scans",
"fno": "09378789",
"hasPdf": true,
"idPrefix": "ai",
"keywords": [
"Computational Complexity",
"Computerised Tomography",
"Decoding",
"Feature Extraction",
"Gradient Methods",
"Image Fusion",
"Image Segmentation",
"Lung",
"Medical Image Processing",
"Neural Nets",
"Cov Seg Net",
"Multiencoder Decoder Architecture",
"Improved Lesion Segmentation",
"COVID 19 Chest CT Scans",
"Automatic Lung Lesion Segmentation",
"Chest Computer Tomography Scans",
"Pivotal Stage",
"Severity Measurement",
"Traditional U Shaped Encoder Decoder Architecture",
"Contextual Information",
"Increased Semantic Gaps",
"Encoded Decoded Feature Maps",
"Gradient Problems",
"Sequential Gradient Propagation",
"Suboptimal Performance",
"3 D CT Volume",
"Computational Complexity",
"Optimization Difficult",
"Automated COVID 19 Lesion Segmentation Scheme",
"Highly Efficient Neural Network Architecture",
"Two Phase Training Scheme",
"Region Of Interest Enhanced CT Volume",
"3 D Network",
"Computational Burden",
"Horizontal Expansion",
"Multistage Encoder Decoder Modules",
"Multiscale Feature Maps",
"Scale Transition Process",
"Multiscale Fusion Module",
"Pyramid Fusion Scheme",
"Efficient Gradient Propagation",
"Outstanding Performances",
"Optimum Segmentation Performances",
"Impact Statement",
"Traditional RTPCR",
"COVID 19 Diagnostic Scheme",
"Infected Lesions Extraction",
"Chest CT Volumes",
"Faster Accurate Diagnosis",
"COVID 19 Lesions",
"Averaged Dice Measurement Scale",
"COVID 19",
"Computed Tomography",
"Optimization",
"Computer Architecture",
"Semantics",
"Lesions",
"Three Dimensional Displays",
"Artificial Intelligence AI",
"Biomedical Imaging",
"Computer Aided Analysis",
"Image Segmentation",
"Neural Networks"
],
"authors": [
{
"givenName": "Tanvir",
"surname": "Mahmud",
"fullName": "Tanvir Mahmud",
"affiliation": "Department of Electrical and Electronic Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Md Awsafur",
"surname": "Rahman",
"fullName": "Md Awsafur Rahman",
"affiliation": "Department of Electrical and Electronic Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shaikh Anowarul",
"surname": "Fattah",
"fullName": "Shaikh Anowarul Fattah",
"affiliation": "Department of Electrical and Electronic Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sun-Yuan",
"surname": "Kung",
"fullName": "Sun-Yuan Kung",
"affiliation": "Department of Electrical Engineering, Princeton University, Princeton, NJ, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "03",
"pubDate": "2021-07-01 00:00:00",
"pubType": "trans",
"pages": "283-297",
"year": "2021",
"issn": "2691-4581",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/ai/2023/02/09699409",
"title": "Annotation-Efficient COVID-19 Pneumonia Lesion Segmentation Using Error-Aware Unified Semisupervised and Active Learning",
"doi": null,
"abstractUrl": "/journal/ai/2023/02/09699409/1ADJimXQt0Y",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icaml/2021/2125/0/212500a067",
"title": "COVID-19 CT Image Classification and Pneumonia Lesions Segmentation Using Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icaml/2021/212500a067/1B60Wu9gVSU",
"parentPublication": {
"id": "proceedings/icaml/2021/2125/0",
"title": "2021 3rd International Conference on Applied Machine Learning (ICAML)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/5555/01/09965606",
"title": "Deep Dual Attention Network for Precise Diagnosis of COVID-19 From Chest CT Images",
"doi": null,
"abstractUrl": "/journal/ai/5555/01/09965606/1IHMSiEzkt2",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995590",
"title": "CVD19-Net: An Automated Deep Learning Model for COVID-19 Screening using Chest CT Images",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995590/1JC1Y85du4E",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/10032636",
"title": "SS-TBN: A Semi-Supervised Tri-Branch Network for COVID-19 Screening and Lesion Segmentation",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10032636/1KnSl7hePKg",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/5555/01/10071538",
"title": "CMM: A CNN-MLP Model for COVID-19 Lesion Segmentation and Severity Grading",
"doi": null,
"abstractUrl": "/journal/tb/5555/01/10071538/1LxaQGeQkrC",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2021/01/09248607",
"title": "COVID-19-CT-CXR: A Freely Accessible and Weakly Labeled Chest X-Ray and CT Image Collection on COVID-19 From Biomedical Literature",
"doi": null,
"abstractUrl": "/journal/bd/2021/01/09248607/1otZZzqPLMY",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/09376253",
"title": "Deep Learning Enables Accurate Diagnosis of Novel Coronavirus (COVID-19) With CT Images",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/09376253/1rSMNzJFMIM",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itca/2020/0378/0/037800a672",
"title": "Diagnosis Model of COVID-19 with Feature Loss",
"doi": null,
"abstractUrl": "/proceedings-article/itca/2020/037800a672/1tpBdLKCzkc",
"parentPublication": {
"id": "proceedings/itca/2020/0378/0",
"title": "2020 2nd International Conference on Information Technology and Computer Application (ITCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552241",
"title": "<italic>COVID</italic>-view: Diagnosis of COVID-19 using Chest CT",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552241/1xic6RdmNC8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09476903",
"articleId": "1v2Mevw0igU",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1HmfNuaEwJW",
"title": "Sept.-Oct.",
"year": "2022",
"issueNum": "05",
"idPrefix": "tb",
"pubType": "journal",
"volume": "19",
"label": "Sept.-Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1vOUcgJh4DS",
"doi": "10.1109/TCBB.2021.3102584",
"abstract": "Accurate and rapid diagnosis of coronavirus disease 2019 (COVID-19) from chest CT scans is of great importance and urgency during the worldwide outbreak. However, radiologists have to distinguish COVID-19 pneumonia from other pneumonia in a large number of CT scans, which is tedious and inefficient. Thus, it is urgently and clinically needed to develop an efficient and accurate diagnostic tool to help radiologists to fulfill the difficult task. In this study, we proposed a deep supervised autoencoder (DSAE) framework to automatically identify COVID-19 using multi-view features extracted from CT images. To fully explore features characterizing CT images from different frequency domains, DSAE was proposed to learn the latent representation by multi-task learning. The proposal was designed to both encode valuable information from different frequency features and construct a compact class structure for separability. To achieve this, we designed a multi-task loss function, which consists of a supervised loss and a reconstruction loss. Our proposed method was evaluated on a newly collected dataset of 787 subjects including COVID-19 pneumonia patients, other pneumonia patients, and normal subjects without abnormal CT findings. Extensive experimental results demonstrated that our proposed method achieved encouraging diagnostic performance and may have potential clinical application for the diagnosis of COVID-19.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Accurate and rapid diagnosis of coronavirus disease 2019 (COVID-19) from chest CT scans is of great importance and urgency during the worldwide outbreak. However, radiologists have to distinguish COVID-19 pneumonia from other pneumonia in a large number of CT scans, which is tedious and inefficient. Thus, it is urgently and clinically needed to develop an efficient and accurate diagnostic tool to help radiologists to fulfill the difficult task. In this study, we proposed a deep supervised autoencoder (DSAE) framework to automatically identify COVID-19 using multi-view features extracted from CT images. To fully explore features characterizing CT images from different frequency domains, DSAE was proposed to learn the latent representation by multi-task learning. The proposal was designed to both encode valuable information from different frequency features and construct a compact class structure for separability. To achieve this, we designed a multi-task loss function, which consists of a supervised loss and a reconstruction loss. Our proposed method was evaluated on a newly collected dataset of 787 subjects including COVID-19 pneumonia patients, other pneumonia patients, and normal subjects without abnormal CT findings. Extensive experimental results demonstrated that our proposed method achieved encouraging diagnostic performance and may have potential clinical application for the diagnosis of COVID-19.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Accurate and rapid diagnosis of coronavirus disease 2019 (COVID-19) from chest CT scans is of great importance and urgency during the worldwide outbreak. However, radiologists have to distinguish COVID-19 pneumonia from other pneumonia in a large number of CT scans, which is tedious and inefficient. Thus, it is urgently and clinically needed to develop an efficient and accurate diagnostic tool to help radiologists to fulfill the difficult task. In this study, we proposed a deep supervised autoencoder (DSAE) framework to automatically identify COVID-19 using multi-view features extracted from CT images. To fully explore features characterizing CT images from different frequency domains, DSAE was proposed to learn the latent representation by multi-task learning. The proposal was designed to both encode valuable information from different frequency features and construct a compact class structure for separability. To achieve this, we designed a multi-task loss function, which consists of a supervised loss and a reconstruction loss. Our proposed method was evaluated on a newly collected dataset of 787 subjects including COVID-19 pneumonia patients, other pneumonia patients, and normal subjects without abnormal CT findings. Extensive experimental results demonstrated that our proposed method achieved encouraging diagnostic performance and may have potential clinical application for the diagnosis of COVID-19.",
"title": "Automated Diagnosis of COVID-19 Using Deep Supervised Autoencoder With Multi-View Features From CT Images",
"normalizedTitle": "Automated Diagnosis of COVID-19 Using Deep Supervised Autoencoder With Multi-View Features From CT Images",
"fno": "09508150",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Computerised Tomography",
"Diseases",
"Feature Extraction",
"Image Classification",
"Image Reconstruction",
"Image Representation",
"Learning Artificial Intelligence",
"Medical Computing",
"Medical Disorders",
"Medical Image Processing",
"Patient Diagnosis",
"Multiview Features",
"CT Images",
"Rapid Diagnosis",
"Coronavirus Disease 2019",
"Chest CT Scans",
"Radiologists",
"Deep Supervised Autoencoder Framework",
"DSAE",
"Different Frequency Domains",
"Multitask Learning",
"Different Frequency Features",
"Multitask Loss Function",
"Supervised Loss",
"COVID 19 Pneumonia Patients",
"Abnormal CT Findings",
"COVID 19",
"Computed Tomography",
"Pulmonary Diseases",
"Feature Extraction",
"Three Dimensional Displays",
"Hospitals",
"Lesions",
"COVID 19",
"Deep Supervised Autoencoder",
"Multi View Features",
"Multi Task Learning"
],
"authors": [
{
"givenName": "Jianhong",
"surname": "Cheng",
"fullName": "Jianhong Cheng",
"affiliation": "Hunan Provincial Key Lab on Bioinformatics, School of Computer Science and Engineering, Central South University, Changsha, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Zhao",
"fullName": "Wei Zhao",
"affiliation": "Department of Radiology, The Second Xiangya Hospital, Central South University, Changsha, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jin",
"surname": "Liu",
"fullName": "Jin Liu",
"affiliation": "Hunan Provincial Key Lab on Bioinformatics, School of Computer Science and Engineering, Central South University, Changsha, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xingzhi",
"surname": "Xie",
"fullName": "Xingzhi Xie",
"affiliation": "Department of Radiology, The Second Xiangya Hospital, Central South University, Changsha, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shangjie",
"surname": "Wu",
"fullName": "Shangjie Wu",
"affiliation": "Department of Pulmonary and Critical Care Medicine, The Second Xiangya Hospital, Central South University, Changsha, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Liangliang",
"surname": "Liu",
"fullName": "Liangliang Liu",
"affiliation": "College of Information and Management Science, Henan Agricultural University, Zhengzhou, Henan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hailin",
"surname": "Yue",
"fullName": "Hailin Yue",
"affiliation": "Hunan Provincial Key Lab on Bioinformatics, School of Computer Science and Engineering, Central South University, Changsha, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Junjian",
"surname": "Li",
"fullName": "Junjian Li",
"affiliation": "Hunan Provincial Key Lab on Bioinformatics, School of Computer Science and Engineering, Central South University, Changsha, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jianxin",
"surname": "Wang",
"fullName": "Jianxin Wang",
"affiliation": "Hunan Provincial Key Lab on Bioinformatics, School of Computer Science and Engineering, Central South University, Changsha, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jun",
"surname": "Liu",
"fullName": "Jun Liu",
"affiliation": "Department of Radiology, The Second Xiangya Hospital, Central South University, Changsha, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "05",
"pubDate": "2022-09-01 00:00:00",
"pubType": "trans",
"pages": "2723-2736",
"year": "2022",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2021/0126/0/09669805",
"title": "DARNet: Dual-Attention Residual Network for Automatic Diagnosis of COVID-19 via CT Images",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2021/09669805/1A9VoC8EPC0",
"parentPublication": {
"id": "proceedings/bibm/2021/0126/0",
"title": "2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/2023/02/09699409",
"title": "Annotation-Efficient COVID-19 Pneumonia Lesion Segmentation Using Error-Aware Unified Semisupervised and Active Learning",
"doi": null,
"abstractUrl": "/journal/ai/2023/02/09699409/1ADJimXQt0Y",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icaml/2021/2125/0/212500a067",
"title": "COVID-19 CT Image Classification and Pneumonia Lesions Segmentation Using Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icaml/2021/212500a067/1B60Wu9gVSU",
"parentPublication": {
"id": "proceedings/icaml/2021/2125/0",
"title": "2021 3rd International Conference on Applied Machine Learning (ICAML)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2021/0679/0/067900a420",
"title": "CT image segmentation of COVID-19 based on UNet++ and ResNeXt",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2021/067900a420/1CATxennIYg",
"parentPublication": {
"id": "proceedings/itme/2021/0679/0",
"title": "2021 11th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/5555/01/09965606",
"title": "Deep Dual Attention Network for Precise Diagnosis of COVID-19 From Chest CT Images",
"doi": null,
"abstractUrl": "/journal/ai/5555/01/09965606/1IHMSiEzkt2",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09994860",
"title": "Multi-MedVit: a deep learning approach for the diagnosis of COVID-19 with the CT images",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09994860/1JC2AfJ1BiE",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/09376253",
"title": "Deep Learning Enables Accurate Diagnosis of Novel Coronavirus (COVID-19) With CT Images",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/09376253/1rSMNzJFMIM",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412228",
"title": "Unsupervised Detection of Pulmonary Opacities for Computer-Aided Diagnosis of COVID-19 on CT Images",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412228/1tmj6XzzcS4",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552241",
"title": "<italic>COVID</italic>-view: Diagnosis of COVID-19 using Chest CT",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552241/1xic6RdmNC8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis-fall/2021/7679/0/09627375",
"title": "Multi-DeepNet: A Novel Weakly-Supervised Multi-Task and Multi-View-Oriented Convolution Neural Network for COVID-19 Diagnosis from CT Images",
"doi": null,
"abstractUrl": "/proceedings-article/icis-fall/2021/09627375/1z7dOB3dwqc",
"parentPublication": {
"id": "proceedings/icis-fall/2021/7679/0",
"title": "2021 IEEE/ACIS 20th International Fall Conference on Computer and Information Science (ICIS Fall)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09457124",
"articleId": "1utV09Jnb1u",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09460821",
"articleId": "1uxeNeOFUnS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1C0jiNVmIU0",
"title": "April",
"year": "2022",
"issueNum": "02",
"idPrefix": "ai",
"pubType": "journal",
"volume": "3",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xx8eiJfTr2",
"doi": "10.1109/TAI.2021.3115093",
"abstract": "Amidst the ongoing pandemic, the assessment of computed tomography (CT) images for COVID-19 presence can exceed the workload capacity of radiologists. Several studies addressed this issue by automating COVID-19 classification and grading from CT images with convolutional neural networks (CNNs). Many of these studies reported initial results of algorithms that were assembled from commonly used components. However, the choice of the components of these algorithms was often pragmatic rather than systematic and systems were not compared to each other across papers in a fair manner. We systematically investigated the effectiveness of using 3-D CNNs instead of 2-D CNNs for seven commonly used architectures, including DenseNet, Inception, and ResNet variants. For the architecture that performed best, we furthermore investigated the effect of initializing the network with pretrained weights, providing automatically computed lesion maps as additional network input, and predicting a continuous instead of a categorical output. A 3-D DenseNet-201 with these components achieved an area under the receiver operating characteristic curve of 0.930 on our test set of 105 CT scans and an AUC of 0.919 on a publicly available set of 742 CT scans, a substantial improvement in comparison with a previously published 2-D CNN. This article provides insights into the performance benefits of various components for COVID-19 classification and grading systems. We have created a challenge on grand-challenge.org to allow for a fair comparison between the results of this and future research.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Amidst the ongoing pandemic, the assessment of computed tomography (CT) images for COVID-19 presence can exceed the workload capacity of radiologists. Several studies addressed this issue by automating COVID-19 classification and grading from CT images with convolutional neural networks (CNNs). Many of these studies reported initial results of algorithms that were assembled from commonly used components. However, the choice of the components of these algorithms was often pragmatic rather than systematic and systems were not compared to each other across papers in a fair manner. We systematically investigated the effectiveness of using 3-D CNNs instead of 2-D CNNs for seven commonly used architectures, including DenseNet, Inception, and ResNet variants. For the architecture that performed best, we furthermore investigated the effect of initializing the network with pretrained weights, providing automatically computed lesion maps as additional network input, and predicting a continuous instead of a categorical output. A 3-D DenseNet-201 with these components achieved an area under the receiver operating characteristic curve of 0.930 on our test set of 105 CT scans and an AUC of 0.919 on a publicly available set of 742 CT scans, a substantial improvement in comparison with a previously published 2-D CNN. This article provides insights into the performance benefits of various components for COVID-19 classification and grading systems. We have created a challenge on grand-challenge.org to allow for a fair comparison between the results of this and future research.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Amidst the ongoing pandemic, the assessment of computed tomography (CT) images for COVID-19 presence can exceed the workload capacity of radiologists. Several studies addressed this issue by automating COVID-19 classification and grading from CT images with convolutional neural networks (CNNs). Many of these studies reported initial results of algorithms that were assembled from commonly used components. However, the choice of the components of these algorithms was often pragmatic rather than systematic and systems were not compared to each other across papers in a fair manner. We systematically investigated the effectiveness of using 3-D CNNs instead of 2-D CNNs for seven commonly used architectures, including DenseNet, Inception, and ResNet variants. For the architecture that performed best, we furthermore investigated the effect of initializing the network with pretrained weights, providing automatically computed lesion maps as additional network input, and predicting a continuous instead of a categorical output. A 3-D DenseNet-201 with these components achieved an area under the receiver operating characteristic curve of 0.930 on our test set of 105 CT scans and an AUC of 0.919 on a publicly available set of 742 CT scans, a substantial improvement in comparison with a previously published 2-D CNN. This article provides insights into the performance benefits of various components for COVID-19 classification and grading systems. We have created a challenge on grand-challenge.org to allow for a fair comparison between the results of this and future research.",
"title": "Automated COVID-19 Grading With Convolutional Neural Networks in Computed Tomography Scans: A Systematic Comparison",
"normalizedTitle": "Automated COVID-19 Grading With Convolutional Neural Networks in Computed Tomography Scans: A Systematic Comparison",
"fno": "09565356",
"hasPdf": true,
"idPrefix": "ai",
"keywords": [
"Computerised Tomography",
"Image Classification",
"Image Segmentation",
"Medical Diagnostic Computing",
"Medical Image Processing",
"Neural Nets",
"Sensitivity Analysis",
"Dense Net",
"Automatically Computed Lesion Maps",
"Additional Network Input",
"105 CT Scans",
"742 CT Scans",
"Grading Systems",
"Automated COVID 19 Grading",
"Convolutional Neural Networks",
"Computed Tomography Scans",
"Computed Tomography Images",
"COVID 19 Presence",
"CT Images",
"CN Ns",
"Systematic Systems",
"Fair Manner",
"Seven Commonly Used Architectures",
"COVID 19",
"Computed Tomography",
"Three Dimensional Displays",
"Artificial Intelligence",
"Lesions",
"Training",
"Lung",
"3 D Convolutional Neural Network CNN",
"CO RADS",
"COVID 19",
"Deep Learning",
"Medical Imaging"
],
"authors": [
{
"givenName": "Coen de",
"surname": "Vente",
"fullName": "Coen de Vente",
"affiliation": "Department of Medical Imaging, Radboud University Medical Center, Donders Institute for Brain, Cognition and Behaviour, Nijmegen, GA, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luuk H.",
"surname": "Boulogne",
"fullName": "Luuk H. Boulogne",
"affiliation": "Department of Medical Imaging, Radboud University Medical Center, Radboud Institute for Health Sciences, Nijmegen, GA, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kiran Vaidhya",
"surname": "Venkadesh",
"fullName": "Kiran Vaidhya Venkadesh",
"affiliation": "Department of Medical Imaging, Radboud University Medical Center, Radboud Institute for Health Sciences, Nijmegen, GA, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cheryl",
"surname": "Sital",
"fullName": "Cheryl Sital",
"affiliation": "Department of Medical Imaging, Radboud University Medical Center, Radboud Institute for Health Sciences, Nijmegen, GA, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nikolas",
"surname": "Lessmann",
"fullName": "Nikolas Lessmann",
"affiliation": "Department of Medical Imaging, Radboud University Medical Center, Radboud Institute for Health Sciences, Nijmegen, GA, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Colin",
"surname": "Jacobs",
"fullName": "Colin Jacobs",
"affiliation": "Department of Medical Imaging, Radboud University Medical Center, Radboud Institute for Health Sciences, Nijmegen, GA, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Clara I.",
"surname": "Sánchez",
"fullName": "Clara I. Sánchez",
"affiliation": "Informatics Institute, Faculty of Science, University of Amsterdam, Amsterdam, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bram van",
"surname": "Ginneken",
"fullName": "Bram van Ginneken",
"affiliation": "Department of Medical Imaging, Radboud University Medical Center, Radboud Institute for Health Sciences, Nijmegen, GA, The Netherlands",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "02",
"pubDate": "2022-04-01 00:00:00",
"pubType": "trans",
"pages": "129-138",
"year": "2022",
"issn": "2691-4581",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/big-data/2021/3902/0/09671656",
"title": "Classification of COVID-19 using Deep Learning and Radiomic Texture Features extracted from CT scans of Patients Lungs",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2021/09671656/1A8hnGyzxa8",
"parentPublication": {
"id": "proceedings/big-data/2021/3902/0",
"title": "2021 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dasc-picom-cbdcom-cyberscitech/2021/2174/0/217400a256",
"title": "A Traditional Machine Learning Approach for COVID-19 Detection from CT Images",
"doi": null,
"abstractUrl": "/proceedings-article/dasc-picom-cbdcom-cyberscitech/2021/217400a256/1BLnCksu7vi",
"parentPublication": {
"id": "proceedings/dasc-picom-cbdcom-cyberscitech/2021/2174/0",
"title": "2021 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/5555/01/09965606",
"title": "Deep Dual Attention Network for Precise Diagnosis of COVID-19 From Chest CT Images",
"doi": null,
"abstractUrl": "/journal/ai/5555/01/09965606/1IHMSiEzkt2",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/10032636",
"title": "SS-TBN: A Semi-Supervised Tri-Branch Network for COVID-19 Screening and Lesion Segmentation",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10032636/1KnSl7hePKg",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/5555/01/10071538",
"title": "CMM: A CNN-MLP Model for COVID-19 Lesion Segmentation and Severity Grading",
"doi": null,
"abstractUrl": "/journal/tb/5555/01/10071538/1LxaQGeQkrC",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2021/01/09345435",
"title": "COVID-19 Chest CT Image Segmentation Network by Multi-Scale Fusion and Enhancement Operations",
"doi": null,
"abstractUrl": "/journal/bd/2021/01/09345435/1qTYEs9wmYg",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/09376253",
"title": "Deep Learning Enables Accurate Diagnosis of Novel Coronavirus (COVID-19) With CT Images",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/09376253/1rSMNzJFMIM",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/2021/03/09378789",
"title": "CovSegNet: A Multi Encoder–Decoder Architecture for Improved Lesion Segmentation of COVID-19 Chest CT Scans",
"doi": null,
"abstractUrl": "/journal/ai/2021/03/09378789/1rZmvrW1Lu8",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552241",
"title": "<italic>COVID</italic>-view: Diagnosis of COVID-19 using Chest CT",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552241/1xic6RdmNC8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscc/2021/2744/0/09631534",
"title": "An automated method for segmentation of COVID-19 lesions based on Computed Tomography using deep learning methods",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2021/09631534/1zmvTZff2Vi",
"parentPublication": {
"id": "proceedings/iscc/2021/2744/0",
"title": "2021 IEEE Symposium on Computers and Communications (ISCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09546626",
"articleId": "1x6zLNkJxDi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09536409",
"articleId": "1wREit2GV5S",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1vDhWHXEYZW",
"title": "Sept.",
"year": "2021",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1iPJ0xyXzjO",
"doi": "10.1109/TVCG.2020.2985689",
"abstract": "Clinical researchers use disease progression models to understand patient status and characterize progression patterns from longitudinal health records. One approach for disease progression modeling is to describe patient status using a small number of states that represent distinctive distributions over a set of observed measures. Hidden Markov models (HMMs) and its variants are a class of models that both discover these states and make inferences of health states for patients. Despite the advantages of using the algorithms for discovering interesting patterns, it still remains challenging for medical experts to interpret model outputs, understand complex modeling parameters, and clinically make sense of the patterns. To tackle these problems, we conducted a design study with clinical scientists, statisticians, and visualization experts, with the goal to investigate disease progression pathways of chronic diseases, namely type 1 diabetes (T1D), Huntington's disease, Parkinson's disease, and chronic obstructive pulmonary disease (COPD). As a result, we introduce DPVis which seamlessly integrates model parameters and outcomes of HMMs into interpretable and interactive visualizations. In this article, we demonstrate that DPVis is successful in evaluating disease progression models, visually summarizing disease states, interactively exploring disease progression patterns, and building, analyzing, and comparing clinically relevant patient subgroups.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Clinical researchers use disease progression models to understand patient status and characterize progression patterns from longitudinal health records. One approach for disease progression modeling is to describe patient status using a small number of states that represent distinctive distributions over a set of observed measures. Hidden Markov models (HMMs) and its variants are a class of models that both discover these states and make inferences of health states for patients. Despite the advantages of using the algorithms for discovering interesting patterns, it still remains challenging for medical experts to interpret model outputs, understand complex modeling parameters, and clinically make sense of the patterns. To tackle these problems, we conducted a design study with clinical scientists, statisticians, and visualization experts, with the goal to investigate disease progression pathways of chronic diseases, namely type 1 diabetes (T1D), Huntington's disease, Parkinson's disease, and chronic obstructive pulmonary disease (COPD). As a result, we introduce DPVis which seamlessly integrates model parameters and outcomes of HMMs into interpretable and interactive visualizations. In this article, we demonstrate that DPVis is successful in evaluating disease progression models, visually summarizing disease states, interactively exploring disease progression patterns, and building, analyzing, and comparing clinically relevant patient subgroups.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Clinical researchers use disease progression models to understand patient status and characterize progression patterns from longitudinal health records. One approach for disease progression modeling is to describe patient status using a small number of states that represent distinctive distributions over a set of observed measures. Hidden Markov models (HMMs) and its variants are a class of models that both discover these states and make inferences of health states for patients. Despite the advantages of using the algorithms for discovering interesting patterns, it still remains challenging for medical experts to interpret model outputs, understand complex modeling parameters, and clinically make sense of the patterns. To tackle these problems, we conducted a design study with clinical scientists, statisticians, and visualization experts, with the goal to investigate disease progression pathways of chronic diseases, namely type 1 diabetes (T1D), Huntington's disease, Parkinson's disease, and chronic obstructive pulmonary disease (COPD). As a result, we introduce DPVis which seamlessly integrates model parameters and outcomes of HMMs into interpretable and interactive visualizations. In this article, we demonstrate that DPVis is successful in evaluating disease progression models, visually summarizing disease states, interactively exploring disease progression patterns, and building, analyzing, and comparing clinically relevant patient subgroups.",
"title": "DPVis: Visual Analytics With Hidden Markov Models for Disease Progression Pathways",
"normalizedTitle": "DPVis: Visual Analytics With Hidden Markov Models for Disease Progression Pathways",
"fno": "09058722",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Mining",
"Data Visualisation",
"Diseases",
"Hidden Markov Models",
"Medical Computing",
"Medical Information Systems",
"Patient Diagnosis",
"Patient Monitoring",
"Patient Treatment",
"Hidden Markov Models",
"Disease Progression Pathways",
"Disease Progression Models",
"Patient Status",
"Disease Progression Modeling",
"Hidden Markov Models",
"Model Outputs",
"Complex Modeling Parameters",
"Chronic Diseases",
"Huntingtons Disease",
"Parkinsons Disease",
"Chronic Obstructive Pulmonary Disease",
"Model Parameters",
"Disease States",
"Disease Progression Patterns",
"Hidden Markov Models",
"Diseases",
"Analytical Models",
"Diabetes",
"Data Visualization",
"Task Analysis",
"Data Models",
"Disease Progression",
"Hidden Markov Model",
"State Space Model",
"Diabetes",
"Huntingtons",
"Parkinsons",
"Interpretability"
],
"authors": [
{
"givenName": "Bum Chul",
"surname": "Kwon",
"fullName": "Bum Chul Kwon",
"affiliation": "IBM Research, Cambridge, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vibha",
"surname": "Anand",
"fullName": "Vibha Anand",
"affiliation": "IBM Research, Cambridge, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kristen A.",
"surname": "Severson",
"fullName": "Kristen A. Severson",
"affiliation": "IBM Research, Cambridge, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Soumya",
"surname": "Ghosh",
"fullName": "Soumya Ghosh",
"affiliation": "IBM Research, Cambridge, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhaonan",
"surname": "Sun",
"fullName": "Zhaonan Sun",
"affiliation": "IBM Research, Cambridge, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brigitte I.",
"surname": "Frohnert",
"fullName": "Brigitte I. Frohnert",
"affiliation": "University of Colorado Denver, Denver, CO, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Markus",
"surname": "Lundgren",
"fullName": "Markus Lundgren",
"affiliation": "Department of Clinical Sciences Malmö, Lund University, Lund, Sweden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kenney",
"surname": "Ng",
"fullName": "Kenney Ng",
"affiliation": "IBM Research, Cambridge, NY, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2021-09-01 00:00:00",
"pubType": "trans",
"pages": "3685-3700",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cbms/2012/2049/0/06266408",
"title": "Using phase type distributions for modelling HIV disease progression",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2012/06266408/12OmNAZx8RS",
"parentPublication": {
"id": "proceedings/cbms/2012/2049/0",
"title": "2012 25th IEEE International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2015/9504/0/9504a721",
"title": "Constructing Disease Network and Temporal Progression Model via Context-Sensitive Hawkes Process",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2015/9504a721/12OmNx7XH5Q",
"parentPublication": {
"id": "proceedings/icdm/2015/9504/0",
"title": "2015 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichi/2017/4881/0/4881a374",
"title": "Estimating Disease Onset Time by Modeling Lab Result Trajectories via Bayes Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2017/4881a374/12OmNyeWdOK",
"parentPublication": {
"id": "proceedings/ichi/2017/4881/0",
"title": "2017 IEEE International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2018/9288/0/928800a748",
"title": "Predicting Non-invasive Ventilation in ALS Patients Using Stratified Disease Progression Groups",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2018/928800a748/18jXFTMCTD2",
"parentPublication": {
"id": "proceedings/icdmw/2018/9288/0",
"title": "2018 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2021/2398/0/239800a956",
"title": "Temporal Clustering with External Memory Network for Disease Progression Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2021/239800a956/1Aqxkz7yBkk",
"parentPublication": {
"id": "proceedings/icdm/2021/2398/0",
"title": "2021 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2020/6215/0/09313376",
"title": "A Predictive Model for Parkinson’s Disease Reveals Candidate Gene Sets for Progression Subtype",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313376/1qmfTxgaBDG",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09377829",
"title": "MuLan: Multilevel Language-based Representation Learning for Disease Progression Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09377829/1s64GRgtGGQ",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/05/09426397",
"title": "Learning Prognostic Models Using Disease Progression Patterns: Predicting the Need for Non-Invasive Ventilation in Amyotrophic Lateral Sclerosis",
"doi": null,
"abstractUrl": "/journal/tb/2022/05/09426397/1tpwPnLMVnW",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552435",
"title": "ThreadStates: State-based Visual Analysis of Disease Progression",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552435/1xic7UZLov6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2021/4261/0/09635256",
"title": "Hidden Markov models as recurrent neural networks: An application to Alzheimer's disease",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2021/09635256/1zmvm6tGYdG",
"parentPublication": {
"id": "proceedings/bibe/2021/4261/0",
"title": "2021 IEEE 21st International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09079657",
"articleId": "1jmVbp8XqZa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09444198",
"articleId": "1tYnZDWXIvC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1vDhYSYLjYA",
"name": "ttg202109-09058722s1-supp1-2985689.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202109-09058722s1-supp1-2985689.mp4",
"extension": "mp4",
"size": "43.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1HmfNuaEwJW",
"title": "Sept.-Oct.",
"year": "2022",
"issueNum": "05",
"idPrefix": "tb",
"pubType": "journal",
"volume": "19",
"label": "Sept.-Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1tpwPnLMVnW",
"doi": "10.1109/TCBB.2021.3078362",
"abstract": "Amyotrophic Lateral Sclerosis is a devastating neurodegenerative disease causing rapid degeneration of motor neurons and usually leading to death by respiratory failure. Since there is no cure, treatment’s goal is to improve symptoms and prolong survival. Non-invasive Ventilation (NIV) is an effective treatment, leading to extended life expectancy and improved quality of life. In this scenario, it is paramount to predict its need in order to allow preventive or timely administration. In this work, we propose to use itemset mining together with sequential pattern mining to unravel disease presentation patterns together with disease progression patterns by analysing, respectively, static data collected at diagnosis and longitudinal data from patient follow-up. The goal is to use these static and temporal patterns as features in prognostic models, enabling to take disease progression into account in predictions and promoting model interpretability. As case study, we predict the need for NIV within 90, 180 and 365 days (short, mid and long-term predictions). The learnt prognostic models are promising. Pattern evaluation through growth rate suggests bulbar function and phrenic nerve response amplitude, additionally to respiratory function, are significant features towards determining patient evolution. This confirms clinical knowledge regarding relevant biomarkers of disease progression towards respiratory insufficiency.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Amyotrophic Lateral Sclerosis is a devastating neurodegenerative disease causing rapid degeneration of motor neurons and usually leading to death by respiratory failure. Since there is no cure, treatment’s goal is to improve symptoms and prolong survival. Non-invasive Ventilation (NIV) is an effective treatment, leading to extended life expectancy and improved quality of life. In this scenario, it is paramount to predict its need in order to allow preventive or timely administration. In this work, we propose to use itemset mining together with sequential pattern mining to unravel disease presentation patterns together with disease progression patterns by analysing, respectively, static data collected at diagnosis and longitudinal data from patient follow-up. The goal is to use these static and temporal patterns as features in prognostic models, enabling to take disease progression into account in predictions and promoting model interpretability. As case study, we predict the need for NIV within 90, 180 and 365 days (short, mid and long-term predictions). The learnt prognostic models are promising. Pattern evaluation through growth rate suggests bulbar function and phrenic nerve response amplitude, additionally to respiratory function, are significant features towards determining patient evolution. This confirms clinical knowledge regarding relevant biomarkers of disease progression towards respiratory insufficiency.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Amyotrophic Lateral Sclerosis is a devastating neurodegenerative disease causing rapid degeneration of motor neurons and usually leading to death by respiratory failure. Since there is no cure, treatment’s goal is to improve symptoms and prolong survival. Non-invasive Ventilation (NIV) is an effective treatment, leading to extended life expectancy and improved quality of life. In this scenario, it is paramount to predict its need in order to allow preventive or timely administration. In this work, we propose to use itemset mining together with sequential pattern mining to unravel disease presentation patterns together with disease progression patterns by analysing, respectively, static data collected at diagnosis and longitudinal data from patient follow-up. The goal is to use these static and temporal patterns as features in prognostic models, enabling to take disease progression into account in predictions and promoting model interpretability. As case study, we predict the need for NIV within 90, 180 and 365 days (short, mid and long-term predictions). The learnt prognostic models are promising. Pattern evaluation through growth rate suggests bulbar function and phrenic nerve response amplitude, additionally to respiratory function, are significant features towards determining patient evolution. This confirms clinical knowledge regarding relevant biomarkers of disease progression towards respiratory insufficiency.",
"title": "Learning Prognostic Models Using Disease Progression Patterns: Predicting the Need for Non-Invasive Ventilation in Amyotrophic Lateral Sclerosis",
"normalizedTitle": "Learning Prognostic Models Using Disease Progression Patterns: Predicting the Need for Non-Invasive Ventilation in Amyotrophic Lateral Sclerosis",
"fno": "09426397",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Data Analysis",
"Data Mining",
"Diseases",
"Learning Artificial Intelligence",
"Medical Diagnostic Computing",
"Neurophysiology",
"Patient Diagnosis",
"Patient Treatment",
"Biomarkers",
"Respiratory Function",
"Phrenic Nerve Response Amplitude",
"Bulbar Function",
"Model Interpretability",
"Pattern Evaluation",
"Learnt Prognostic Models",
"Long Term Predictions",
"Temporal Patterns",
"Static Patterns",
"Static Data",
"Disease Presentation Patterns",
"Sequential Pattern Mining",
"Itemset Mining",
"Timely Administration",
"Preventive Administration",
"Extended Life Expectancy",
"NIV",
"Respiratory Failure",
"Motor Neurons",
"Rapid Degeneration",
"Neurodegenerative Disease",
"Noninvasive Ventilation",
"Amyotrophic Lateral Sclerosis",
"Disease Progression Patterns",
"Time 90 0 D",
"Time 180 0 D",
"Time 365 0 D",
"Diseases",
"Itemsets",
"Predictive Models",
"Feature Extraction",
"Data Mining",
"Ventilation",
"Data Models",
"Amyotrophic Lateral Sclerosis",
"Pattern Mining",
"Disease Progression Patterns",
"Non Invasive Ventilation",
"Prognostic Models"
],
"authors": [
{
"givenName": "Andreia S.",
"surname": "Martins",
"fullName": "Andreia S. Martins",
"affiliation": "LASIGE and the Departamento de Informática, Faculdade de Ciências, Universidade de Lisboa in Lisbon, Lisboa, Portugal",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marta",
"surname": "Gromicho",
"fullName": "Marta Gromicho",
"affiliation": "Instituto de Medicina Molecular and Instituto de Fisiologia, Faculdade de Medicina, Universidade de Lisboa in Lisbon, Lisboa, Portugal",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Susana",
"surname": "Pinto",
"fullName": "Susana Pinto",
"affiliation": "Instituto de Medicina Molecular and Instituto de Fisiologia, Faculdade de Medicina, Universidade de Lisboa in Lisbon, Lisboa, Portugal",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mamede",
"surname": "de Carvalho",
"fullName": "Mamede de Carvalho",
"affiliation": "Instituto de Medicina Molecular and Instituto de Fisiologia, Faculdade de Medicina, Universidade de Lisboa in Lisbon, Lisboa, Portugal",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sara C.",
"surname": "Madeira",
"fullName": "Sara C. Madeira",
"affiliation": "LASIGE and the Departamento de Informática, Faculdade de Ciências, Universidade de Lisboa in Lisbon, Lisboa, Portugal",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2022-09-01 00:00:00",
"pubType": "trans",
"pages": "2572-2583",
"year": "2022",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2015/9504/0/9504b129",
"title": "Domain Induced Dirichlet Mixture of Gaussian Processes: An Application to Predicting Disease Progression in Multiple Sclerosis Patients",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2015/9504b129/12OmNwlqhR1",
"parentPublication": {
"id": "proceedings/icdm/2015/9504/0",
"title": "2015 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2015/9504/0/9504a721",
"title": "Constructing Disease Network and Temporal Progression Model via Context-Sensitive Hawkes Process",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2015/9504a721/12OmNx7XH5Q",
"parentPublication": {
"id": "proceedings/icdm/2015/9504/0",
"title": "2015 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/micai/2011/4605/0/06118992",
"title": "Microarray Gene Subset Selection in Amyotrophic Lateral Sclerosis Classification",
"doi": null,
"abstractUrl": "/proceedings-article/micai/2011/06118992/12OmNy49sPr",
"parentPublication": {
"id": "proceedings/micai/2011/4605/0",
"title": "2011 10th Mexican International Conference on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichi/2013/5089/0/5089a175",
"title": "Risk Prediction of a Multiple Sclerosis Diagnosis",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2013/5089a175/12OmNywfKw4",
"parentPublication": {
"id": "proceedings/ichi/2013/5089/0",
"title": "2013 IEEE International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2018/9288/0/928800a748",
"title": "Predicting Non-invasive Ventilation in ALS Patients Using Stratified Disease Progression Groups",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2018/928800a748/18jXFTMCTD2",
"parentPublication": {
"id": "proceedings/icdmw/2018/9288/0",
"title": "2018 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2021/0126/0/09669665",
"title": "Predicting upper limb disability progression in primary progressive multiple sclerosis using machine learning and statistical methods",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2021/09669665/1A9Wwj05ZeM",
"parentPublication": {
"id": "proceedings/bibm/2021/0126/0",
"title": "2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09058722",
"title": "DPVis: Visual Analytics With Hidden Markov Models for Disease Progression Pathways",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09058722/1iPJ0xyXzjO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichi/2020/5382/0/09374298",
"title": "Identifying Features That Are Predictive of Quality of Life in People With Amyotrophic Lateral Sclerosis",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2020/09374298/1rUJ1D0xzDG",
"parentPublication": {
"id": "proceedings/ichi/2020/5382/0",
"title": "2020 IEEE International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09377829",
"title": "MuLan: Multilevel Language-based Representation Learning for Disease Progression Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09377829/1s64GRgtGGQ",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552435",
"title": "ThreadStates: State-based Visual Analysis of Disease Progression",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552435/1xic7UZLov6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09548848",
"articleId": "1xeS6ugbPnW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09772374",
"articleId": "1DgjtUussEw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwCJOG5",
"title": "May-June",
"year": "2015",
"issueNum": "03",
"idPrefix": "tb",
"pubType": "journal",
"volume": "12",
"label": "May-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwIF6jt",
"doi": "10.1109/TCBB.2014.2372783",
"abstract": "A crucial step in understanding the architecture of cells and tissues from microscopy images, and consequently explain important biological events such as wound healing and cancer metastases, is the complete extraction and enumeration of individual filaments from the cellular cytoskeletal network. Current efforts at quantitative estimation of filament length distribution, architecture and orientation from microscopy images are predominantly limited to visual estimation and indirect experimental inference. Here we demonstrate the application of a new algorithm to reliably estimate centerlines of biological filament bundles and extract individual filaments from the centerlines by systematically disambiguating filament intersections. We utilize a filament enhancement step followed by reverse diffusion based filament localization and an integer programming based set combination to systematically extract accurate filaments automatically from microscopy images. Experiments on simulated and real confocal microscope images of flat cells (2D images) show efficacy of the new method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A crucial step in understanding the architecture of cells and tissues from microscopy images, and consequently explain important biological events such as wound healing and cancer metastases, is the complete extraction and enumeration of individual filaments from the cellular cytoskeletal network. Current efforts at quantitative estimation of filament length distribution, architecture and orientation from microscopy images are predominantly limited to visual estimation and indirect experimental inference. Here we demonstrate the application of a new algorithm to reliably estimate centerlines of biological filament bundles and extract individual filaments from the centerlines by systematically disambiguating filament intersections. We utilize a filament enhancement step followed by reverse diffusion based filament localization and an integer programming based set combination to systematically extract accurate filaments automatically from microscopy images. Experiments on simulated and real confocal microscope images of flat cells (2D images) show efficacy of the new method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A crucial step in understanding the architecture of cells and tissues from microscopy images, and consequently explain important biological events such as wound healing and cancer metastases, is the complete extraction and enumeration of individual filaments from the cellular cytoskeletal network. Current efforts at quantitative estimation of filament length distribution, architecture and orientation from microscopy images are predominantly limited to visual estimation and indirect experimental inference. Here we demonstrate the application of a new algorithm to reliably estimate centerlines of biological filament bundles and extract individual filaments from the centerlines by systematically disambiguating filament intersections. We utilize a filament enhancement step followed by reverse diffusion based filament localization and an integer programming based set combination to systematically extract accurate filaments automatically from microscopy images. Experiments on simulated and real confocal microscope images of flat cells (2D images) show efficacy of the new method.",
"title": "Extraction of Individual Filaments from 2D Confocal Microscopy Images of Flat Cells",
"normalizedTitle": "Extraction of Individual Filaments from 2D Confocal Microscopy Images of Flat Cells",
"fno": "06963495",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Biomedical Optical Imaging",
"Cancer",
"Cellular Biophysics",
"Feature Extraction",
"Image Enhancement",
"Integer Programming",
"Medical Image Processing",
"Optical Microscopy",
"Tumours",
"Wounds",
"Biological Tissues",
"Integer Programming Based Set Combination",
"Reverse Diffusion Based Filament Localization",
"Filament Enhancement Step",
"Filament Length Distribution",
"Cellular Cytoskeletal Network",
"Cancer Metastases",
"Wound Healing",
"Flat Cells",
"2 D Confocal Microscopy Images",
"Individual Filament Extraction",
"Microscopy",
"Image Resolution",
"Bifurcation",
"Image Segmentation",
"Biology",
"Three Dimensional Displays",
"Estimation",
"Biological Filament Networks",
"Local Network Topology",
"Centerline Localization",
"Filament Extraction",
"Biological Filament Networks",
"Local Network Topology",
"Centerline Localization",
"Filament Extraction"
],
"authors": [
{
"givenName": "Saurav",
"surname": "Basu",
"fullName": "Saurav Basu",
"affiliation": "Center for Bioimage Informatics, Carnegie Mellon University, Pittsburgh, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chi",
"surname": "Liu",
"fullName": "Chi Liu",
"affiliation": "Department of Biomedical Engineering, Carnegie Mellon University, Pittsburgh, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gustavo Kunde",
"surname": "Rohde",
"fullName": "Gustavo Kunde Rohde",
"affiliation": "Center for Bioimage Informatics and Department of Biomedical Engineering, Carnegie Mellon University, Pittsburgh, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2015-05-01 00:00:00",
"pubType": "trans",
"pages": "632-643",
"year": "2015",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2017/0733/0/0733a851",
"title": "Transferring Microscopy Image Modalities with Conditional Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2017/0733a851/12OmNwGIcza",
"parentPublication": {
"id": "proceedings/cvprw/2017/0733/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2015/9721/0/9721a023",
"title": "Wrinkle Image Registration for Serial Microscopy Sections",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2015/9721a023/12OmNzTYCaI",
"parentPublication": {
"id": "proceedings/sitis/2015/9721/0",
"title": "2015 11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2012/03/06095508",
"title": "Quantitative Analysis of the Self-Assembly Strategies of Intermediate Filaments from Tetrameric Vimentin",
"doi": null,
"abstractUrl": "/journal/tb/2012/03/06095508/13rRUx0xPtQ",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/04/ttg2009040670",
"title": "Hardware Accelerated Segmentation of Complex Volumetric Filament Networks",
"doi": null,
"abstractUrl": "/journal/tg/2009/04/ttg2009040670/13rRUxjQyp9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlhpc/2018/0180/0/08638633",
"title": "Automated Labeling of Electron Microscopy Images Using Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/mlhpc/2018/08638633/18jXU8u0DVS",
"parentPublication": {
"id": "proceedings/mlhpc/2018/0180/0",
"title": "2018 IEEE/ACM Machine Learning in HPC Environments (MLHPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aipr/2021/2471/0/09762193",
"title": "Ensemble of Deep Learning Cascades for Segmentation of Blood Vessels in Confocal Microscopy Images",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2021/09762193/1CT96leIeRi",
"parentPublication": {
"id": "proceedings/aipr/2021/2471/0",
"title": "2021 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2022/9062/0/09956210",
"title": "Extraction and Quantification of Actin Cytoskeleton in Microscopic Images Using a Deep Learning Based Framework and a Curve Clustering Model",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09956210/1IHpiGy6NHy",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2019/2286/0/228600a405",
"title": "Visualizing Structures in Confocal Microscopy Datasets Through Clusterization: A Case Study on Bile Ducts",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2019/228600a405/1cdNXlTIHM4",
"parentPublication": {
"id": "proceedings/cbms/2019/2286/0",
"title": "2019 IEEE 32nd International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2019/2506/0/250600a125",
"title": "Intersection to Overpass: Instance Segmentation on Filamentous Structures With an Orientation-Aware Neural Network and Terminus Pairing Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600a125/1iTvrwbIZqM",
"parentPublication": {
"id": "proceedings/cvprw/2019/2506/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2020/9574/0/957400a569",
"title": "Video-rate acquisition fluorescence microscopy via generative adversarial networks",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2020/957400a569/1pBMo7sHayk",
"parentPublication": {
"id": "proceedings/bibe/2020/9574/0",
"title": "2020 IEEE 20th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06945358",
"articleId": "13rRUx0xPH2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06963458",
"articleId": "13rRUxjyX2z",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45WnnFUX",
"doi": "10.1109/TVCG.2018.2864852",
"abstract": "Wide-field microscopes are commonly used in neurobiology for experimental studies of brain samples. Available visualization tools are limited to electron, two-photon, and confocal microscopy datasets, and current volume rendering techniques do not yield effective results when used with wide-field data. We present a workflow for the visualization of neuronal structures in wide-field microscopy images of brain samples. We introduce a novel gradient-based distance transform that overcomes the out-of-focus blur caused by the inherent design of wide-field microscopes. This is followed by the extraction of the 3D structure of neurites using a multi-scale curvilinear filter and cell-bodies using a Hessian-based enhancement filter. The response from these filters is then applied as an opacity map to the raw data. Based on the visualization challenges faced by domain experts, our workflow provides multiple rendering modes to enable qualitative analysis of neuronal structures, which includes separation of cell-bodies from neurites and an intensity-based classification of the structures. Additionally, we evaluate our visualization results against both a standard image processing deconvolution technique and a confocal microscopy image of the same specimen. We show that our method is significantly faster and requires less computational resources, while producing high quality visualizations. We deploy our workflow in an immersive gigapixel facility as a paradigm for the processing and visualization of large, high-resolution, wide-field microscopy brain datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Wide-field microscopes are commonly used in neurobiology for experimental studies of brain samples. Available visualization tools are limited to electron, two-photon, and confocal microscopy datasets, and current volume rendering techniques do not yield effective results when used with wide-field data. We present a workflow for the visualization of neuronal structures in wide-field microscopy images of brain samples. We introduce a novel gradient-based distance transform that overcomes the out-of-focus blur caused by the inherent design of wide-field microscopes. This is followed by the extraction of the 3D structure of neurites using a multi-scale curvilinear filter and cell-bodies using a Hessian-based enhancement filter. The response from these filters is then applied as an opacity map to the raw data. Based on the visualization challenges faced by domain experts, our workflow provides multiple rendering modes to enable qualitative analysis of neuronal structures, which includes separation of cell-bodies from neurites and an intensity-based classification of the structures. Additionally, we evaluate our visualization results against both a standard image processing deconvolution technique and a confocal microscopy image of the same specimen. We show that our method is significantly faster and requires less computational resources, while producing high quality visualizations. We deploy our workflow in an immersive gigapixel facility as a paradigm for the processing and visualization of large, high-resolution, wide-field microscopy brain datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Wide-field microscopes are commonly used in neurobiology for experimental studies of brain samples. Available visualization tools are limited to electron, two-photon, and confocal microscopy datasets, and current volume rendering techniques do not yield effective results when used with wide-field data. We present a workflow for the visualization of neuronal structures in wide-field microscopy images of brain samples. We introduce a novel gradient-based distance transform that overcomes the out-of-focus blur caused by the inherent design of wide-field microscopes. This is followed by the extraction of the 3D structure of neurites using a multi-scale curvilinear filter and cell-bodies using a Hessian-based enhancement filter. The response from these filters is then applied as an opacity map to the raw data. Based on the visualization challenges faced by domain experts, our workflow provides multiple rendering modes to enable qualitative analysis of neuronal structures, which includes separation of cell-bodies from neurites and an intensity-based classification of the structures. Additionally, we evaluate our visualization results against both a standard image processing deconvolution technique and a confocal microscopy image of the same specimen. We show that our method is significantly faster and requires less computational resources, while producing high quality visualizations. We deploy our workflow in an immersive gigapixel facility as a paradigm for the processing and visualization of large, high-resolution, wide-field microscopy brain datasets.",
"title": "Visualization of Neuronal Structures in Wide-Field Microscopy Brain Images",
"normalizedTitle": "Visualization of Neuronal Structures in Wide-Field Microscopy Brain Images",
"fno": "08440805",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Biomedical Optical Imaging",
"Brain",
"Cellular Biophysics",
"Data Visualisation",
"Deconvolution",
"Image Classification",
"Image Enhancement",
"Image Filtering",
"Medical Image Processing",
"Neurophysiology",
"Rendering Computer Graphics",
"Hessian Based Enhancement Filter",
"Cell Bodies",
"Intensity Based Classification",
"Confocal Microscopy Image",
"Wide Field Microscopy Brain Datasets",
"Wide Field Microscopy Images",
"Multiscale Curvilinear Filter",
"Volume Rendering Techniques",
"Neuronal Structures Visualization",
"Image Processing Deconvolution Technique",
"Gradient Based Distance Transform",
"Out Of Focus Blur",
"3 D Structure Extraction",
"Neurites",
"Opacity Map",
"Data Visualization",
"Optical Microscopy",
"Neurons",
"Electron Microscopy",
"Three Dimensional Displays",
"Deconvolution",
"Wide Field Microscopy",
"Volume Visualization",
"Neuron Visualization",
"Neuroscience"
],
"authors": [
{
"givenName": "Saeed",
"surname": "Boorboor",
"fullName": "Saeed Boorboor",
"affiliation": "Department of Computer ScienceStony Brook University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shreeraj",
"surname": "Jadhav",
"fullName": "Shreeraj Jadhav",
"affiliation": "Department of Computer ScienceStony Brook University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mala",
"surname": "Ananth",
"fullName": "Mala Ananth",
"affiliation": "Department of Neurobiology & behaviorStony Brook University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Talmage",
"fullName": "David Talmage",
"affiliation": "Department of Neurobiology & behaviorStony Brook University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lorna",
"surname": "Role",
"fullName": "Lorna Role",
"affiliation": "Department of Neurobiology & behaviorStony Brook University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arie",
"surname": "Kaufman",
"fullName": "Arie Kaufman",
"affiliation": "Department of Computer ScienceStony Brook University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "1018-1028",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dv/2015/8332/0/8332a335",
"title": "Light-Field Microscopy with a Consumer Light-Field Camera",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2015/8332a335/12OmNBCqbDc",
"parentPublication": {
"id": "proceedings/3dv/2015/8332/0",
"title": "2015 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2012/1611/0/06239195",
"title": "Single lens off-chip cellphone microscopy",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2012/06239195/12OmNBsue51",
"parentPublication": {
"id": "proceedings/cvprw/2012/1611/0",
"title": "2012 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2017/1034/0/1034a042",
"title": "Spatially-Variant Kernel for Optical Flow Under Low Signal-to-Noise Ratios Application to Microscopy",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034a042/12OmNqG0SQd",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2014/4261/0/4261a222",
"title": "Application of Atomic Force Microscopy to Assess a Copper Molten Mark Formed by Short Circuit",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2014/4261a222/12OmNs0TKNQ",
"parentPublication": {
"id": "proceedings/isdea/2014/4261/0",
"title": "2014 Fifth International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209a865",
"title": "Three-Dimensional Deconvolution of Wide Field Microscopy with Sparse Priors: Application to Zebrafish Imagery",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209a865/12OmNweBUMk",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122285",
"title": "Interactive Volume Exploration of Petascale Microscopy Data Streams Using a Visualization-Driven Virtual Memory Approach",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122285/13rRUEgs2BV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1999/1966/0/01592708",
"title": "DeepView: A Channel for Distributed Microscopy and Informatics",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1999/01592708/1D85Td0VrnG",
"parentPublication": {
"id": "proceedings/sc/1999/1966/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2022/6124/0/612400a267",
"title": "Enabling Autonomous Electron Microscopy for Networked Computation and Steering",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2022/612400a267/1J6horEKDlu",
"parentPublication": {
"id": "proceedings/e-science/2022/6124/0",
"title": "2022 IEEE 18th International Conference on e-Science (e-Science)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2019/4752/0/09212912",
"title": "Robust Microscope Image Stitching Using Multiple Zooming Levels",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2019/09212912/1nHRQKQeDfO",
"parentPublication": {
"id": "proceedings/icvrv/2019/4752/0",
"title": "2019 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/escience/2021/0361/0/036100a237",
"title": "Ultrafast Focus Detection for Automated Microscopy",
"doi": null,
"abstractUrl": "/proceedings-article/escience/2021/036100a237/1y14FZqMGeQ",
"parentPublication": {
"id": "proceedings/escience/2021/0361/0",
"title": "2021 IEEE 17th International Conference on eScience (eScience)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440070",
"articleId": "17D45WaTknJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08467383",
"articleId": "17D45WnnFYV",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz5apxc",
"title": "July",
"year": "2017",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILc8ff",
"doi": "10.1109/TVCG.2016.2559483",
"abstract": "We present a new approach to rendering a geometrically-correct user-perspective view for a magic lens interface, based on leveraging the gradients in the real world scene. Our approach couples a recent gradient-domain image-based rendering method with a novel semi-dense stereo matching algorithm. Our stereo algorithm borrows ideas from PatchMatch, and adapts them to semi-dense stereo. This approach is implemented in a prototype device build from off-the-shelf hardware, with no active depth sensing. Despite the limited depth data, we achieve high-quality rendering for the user-perspective magic lens.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a new approach to rendering a geometrically-correct user-perspective view for a magic lens interface, based on leveraging the gradients in the real world scene. Our approach couples a recent gradient-domain image-based rendering method with a novel semi-dense stereo matching algorithm. Our stereo algorithm borrows ideas from PatchMatch, and adapts them to semi-dense stereo. This approach is implemented in a prototype device build from off-the-shelf hardware, with no active depth sensing. Despite the limited depth data, we achieve high-quality rendering for the user-perspective magic lens.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a new approach to rendering a geometrically-correct user-perspective view for a magic lens interface, based on leveraging the gradients in the real world scene. Our approach couples a recent gradient-domain image-based rendering method with a novel semi-dense stereo matching algorithm. Our stereo algorithm borrows ideas from PatchMatch, and adapts them to semi-dense stereo. This approach is implemented in a prototype device build from off-the-shelf hardware, with no active depth sensing. Despite the limited depth data, we achieve high-quality rendering for the user-perspective magic lens.",
"title": "User-Perspective AR Magic Lens from Gradient-Based IBR and Semi-Dense Stereo",
"normalizedTitle": "User-Perspective AR Magic Lens from Gradient-Based IBR and Semi-Dense Stereo",
"fno": "07460953",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Lenses",
"Rendering Computer Graphics",
"Image Reconstruction",
"Cameras",
"Real Time Systems",
"Sensors",
"Augmented Reality",
"Magic Lens",
"User Perspective",
"Image Based Rendering",
"Gradient Domain",
"Semi Dense Stereo"
],
"authors": [
{
"givenName": "Domagoj",
"surname": "Baričević",
"fullName": "Domagoj Baričević",
"affiliation": "Department of Computer Science, University of California, Santa Barbara, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tobias",
"surname": "Höllerer",
"fullName": "Tobias Höllerer",
"affiliation": "Department of Computer Science, University of California, Santa Barbara, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pradeep",
"surname": "Sen",
"fullName": "Pradeep Sen",
"affiliation": "Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthew",
"surname": "Turk",
"fullName": "Matthew Turk",
"affiliation": "Department of Computer Science, University of California, Santa Barbara, CA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2017-07-01 00:00:00",
"pubType": "trans",
"pages": "1838-1851",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2008/1971/0/04480772",
"title": "New Rendering Approach for Composable Volumetric Lenses",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2008/04480772/12OmNBAqZId",
"parentPublication": {
"id": "proceedings/vr/2008/1971/0",
"title": "IEEE Virtual Reality 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2010/6237/0/05444782",
"title": "Single-pass 3D lens rendering and spatiotemporal \"Time Warp\" example",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2010/05444782/12OmNBO3JYm",
"parentPublication": {
"id": "proceedings/vr/2010/6237/0",
"title": "2010 IEEE Virtual Reality Conference (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2007/1749/0/04538832",
"title": "Evaluating Display Types for AR Selection and Annotation",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2007/04538832/12OmNrIaef4",
"parentPublication": {
"id": "proceedings/ismar/2007/1749/0",
"title": "2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2007/1749/0/04538825",
"title": "A 3D Flexible and Tangible Magic Lens in Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2007/04538825/12OmNwNwzHD",
"parentPublication": {
"id": "proceedings/ismar/2007/1749/0",
"title": "2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2010/6237/0/05444818",
"title": "An evaluation of physical affordances in augmented virtual environments: Dataset grounding and Magic Lens",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2010/05444818/12OmNwwd2PF",
"parentPublication": {
"id": "proceedings/vr/2010/6237/0",
"title": "2010 IEEE Virtual Reality Conference (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2016/0836/0/07504757",
"title": "Combining eye tracking with optimizations for lens astigmatism in modern wide-angle HMDs",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2016/07504757/12OmNySG3Vp",
"parentPublication": {
"id": "proceedings/vr/2016/0836/0",
"title": "2016 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532818",
"title": "The magic volume lens: an interactive focus+context technique for volume rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532818/12OmNyuyade",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2012/4660/0/06402557",
"title": "A hand-held AR magic lens with user-perspective rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2012/06402557/12OmNz5s0SW",
"parentPublication": {
"id": "proceedings/ismar/2012/4660/0",
"title": "2012 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1997/06/mcg1997060062",
"title": "Enhanced Illustration Using Magic Lens Filters",
"doi": null,
"abstractUrl": "/magazine/cg/1997/06/mcg1997060062/13rRUIJuxxP",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2006/04/mcg2006040064",
"title": "Magic Lenses for Augmented Virtual Environments",
"doi": null,
"abstractUrl": "/magazine/cg/2006/04/mcg2006040064/13rRUyZaxsW",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07439844",
"articleId": "13rRUy2YLYD",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07452668",
"articleId": "13rRUwbJD4Q",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet1Q",
"name": "ttg201707-07460953s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201707-07460953s1.zip",
"extension": "zip",
"size": "9.95 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrAMF5S",
"title": "Aug.",
"year": "2019",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyeCkap",
"doi": "10.1109/TVCG.2018.2850781",
"abstract": "We present decal-lenses, a new interaction technique that extends the concept of magic lenses to augment and manage multivariate visualizations on arbitrary surfaces. Our object-space lenses follow the surface geometry and allow the user to change the point of view during data exploration while maintaining a spatial reference to positions where one or more lenses were placed. Each lens delimits specific regions of the surface where one or more attributes can be selected or combined. Similar to 2D lenses, the user interacts with our lenses in real-time, switching between different attributes within the lens context. The user can also visualize the surface data representations from the point of view of each lens by using local cameras. To place lenses on surfaces of intricate geometry, such as the human brain, we introduce the concept of support surfaces for designing interaction techniques. Support surfaces provide a way to place and interact with the lenses while avoiding holes and occluded regions during data exploration. We further extend decal-lenses to arbitrary regions using brushing and lassoing operations. We discuss the applicability of our technique and present several examples where our lenses can be useful to create a customized exploration of multivariate data on surfaces.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present decal-lenses, a new interaction technique that extends the concept of magic lenses to augment and manage multivariate visualizations on arbitrary surfaces. Our object-space lenses follow the surface geometry and allow the user to change the point of view during data exploration while maintaining a spatial reference to positions where one or more lenses were placed. Each lens delimits specific regions of the surface where one or more attributes can be selected or combined. Similar to 2D lenses, the user interacts with our lenses in real-time, switching between different attributes within the lens context. The user can also visualize the surface data representations from the point of view of each lens by using local cameras. To place lenses on surfaces of intricate geometry, such as the human brain, we introduce the concept of support surfaces for designing interaction techniques. Support surfaces provide a way to place and interact with the lenses while avoiding holes and occluded regions during data exploration. We further extend decal-lenses to arbitrary regions using brushing and lassoing operations. We discuss the applicability of our technique and present several examples where our lenses can be useful to create a customized exploration of multivariate data on surfaces.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present decal-lenses, a new interaction technique that extends the concept of magic lenses to augment and manage multivariate visualizations on arbitrary surfaces. Our object-space lenses follow the surface geometry and allow the user to change the point of view during data exploration while maintaining a spatial reference to positions where one or more lenses were placed. Each lens delimits specific regions of the surface where one or more attributes can be selected or combined. Similar to 2D lenses, the user interacts with our lenses in real-time, switching between different attributes within the lens context. The user can also visualize the surface data representations from the point of view of each lens by using local cameras. To place lenses on surfaces of intricate geometry, such as the human brain, we introduce the concept of support surfaces for designing interaction techniques. Support surfaces provide a way to place and interact with the lenses while avoiding holes and occluded regions during data exploration. We further extend decal-lenses to arbitrary regions using brushing and lassoing operations. We discuss the applicability of our technique and present several examples where our lenses can be useful to create a customized exploration of multivariate data on surfaces.",
"title": "Decal-Lenses: Interactive Lenses on Surfaces for Multivariate Visualization",
"normalizedTitle": "Decal-Lenses: Interactive Lenses on Surfaces for Multivariate Visualization",
"fno": "08396300",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Cameras",
"Data Structures",
"Data Visualisation",
"Interactive Systems",
"Lenses",
"Arbitrary Surfaces",
"Object Space Lenses",
"Surface Geometry",
"Data Exploration",
"Surface Data Representations",
"Support Surfaces",
"Interaction Technique",
"Decal Lenses",
"Interactive Lenses",
"Multivariate Visualization",
"Magic Lenses",
"Local Cameras",
"Lenses",
"Data Visualization",
"Three Dimensional Displays",
"Two Dimensional Displays",
"Geometry",
"Correlation",
"Cameras",
"Focus Context",
"Lenses",
"Interaction",
"Design",
"Multivariate",
"Visualization",
"Surfaces",
"Decal"
],
"authors": [
{
"givenName": "Allan",
"surname": "Rocha",
"fullName": "Allan Rocha",
"affiliation": "Department of Computer Science, University of Calgary, Calgary, AB, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julio Daniel",
"surname": "Silva",
"fullName": "Julio Daniel Silva",
"affiliation": "Department of Computer Science, University of Calgary, Calgary, AB, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Usman R.",
"surname": "Alim",
"fullName": "Usman R. Alim",
"affiliation": "Department of Computer Science, University of Calgary, Calgary, AB, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sheelagh",
"surname": "Carpendale",
"fullName": "Sheelagh Carpendale",
"affiliation": "Department of Computer Science, University of Calgary, Calgary, AB, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mario Costa",
"surname": "Sousa",
"fullName": "Mario Costa Sousa",
"affiliation": "Department of Computer Science, University of Calgary, Calgary, AB, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2019-08-01 00:00:00",
"pubType": "trans",
"pages": "2568-2582",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2008/1971/0/04480772",
"title": "New Rendering Approach for Composable Volumetric Lenses",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2008/04480772/12OmNBAqZId",
"parentPublication": {
"id": "proceedings/vr/2008/1971/0",
"title": "IEEE Virtual Reality 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1994/6952/2/00413669",
"title": "Depth estimation using stereo fish-eye lenses",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1994/00413669/12OmNBfqG59",
"parentPublication": {
"id": "proceedings/icip/1994/6952/2",
"title": "Proceedings of 1st International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391a612",
"title": "Self-Calibration of Optical Lenses",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391a612/12OmNyQ7FPm",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2006/2602/0/26020017",
"title": "Fisheye Tree Views and Lenses for Graph Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2006/26020017/12OmNz4SOxE",
"parentPublication": {
"id": "proceedings/iv/2006/2602/0",
"title": "Tenth International Conference on Information Visualisation (IV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2013/6097/0/06550218",
"title": "Poster: Portable integral photography input/ output system using tablet PC and fly's eye lenses",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2013/06550218/12OmNzEVRZL",
"parentPublication": {
"id": "proceedings/3dui/2013/6097/0",
"title": "2013 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2008/3268/0/3268a356",
"title": "3D Generalization Lenses for Interactive Focus + Context Visualization of Virtual City Models",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2008/3268a356/12OmNzaQoEB",
"parentPublication": {
"id": "proceedings/iv/2008/3268/0",
"title": "2008 12th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539320",
"title": "Decal-Maps: Real-Time Layering of Decals on Surfaces for Multivariate Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539320/13rRUx0gezV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440089",
"title": "Recirculation Surfaces for Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440089/17D45Vw15xs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scivis/2018/6882/0/08823618",
"title": "3De Interactive Lenses for Visualization in Virtual Environments",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2018/08823618/1d5kwZvgfNm",
"parentPublication": {
"id": "proceedings/scivis/2018/6882/0",
"title": "2018 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lics/2021/4895/0/09470613",
"title": "Higher Lenses",
"doi": null,
"abstractUrl": "/proceedings-article/lics/2021/09470613/1v2QoffQ5eo",
"parentPublication": {
"id": "proceedings/lics/2021/4895/0",
"title": "2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08400404",
"articleId": "13rRUB7a1g3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08388294",
"articleId": "13rRUEgarnQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDY",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1ddbk50fzNK",
"doi": "10.1109/TVCG.2019.2934547",
"abstract": "Facetto is a scalable visual analytics application that is used to discover single-cell phenotypes in high-dimensional multi-channel microscopy images of human tumors and tissues. Such images represent the cutting edge of digital histology and promise to revolutionize how diseases such as cancer are studied, diagnosed, and treated. Highly multiplexed tissue images are complex, comprising 109 or more pixels, 60-plus channels, and millions of individual cells. This makes manual analysis challenging and error-prone. Existing automated approaches are also inadequate, in large part, because they are unable to effectively exploit the deep knowledge of human tissue biology available to anatomic pathologists. To overcome these challenges, Facetto enables a semi-automated analysis of cell types and states. It integrates unsupervised and supervised learning into the image and feature exploration process and offers tools for analytical provenance. Experts can cluster the data to discover new types of cancer and immune cells and use clustering results to train a convolutional neural network that classifies new cells accordingly. Likewise, the output of classifiers can be clustered to discover aggregate patterns and phenotype subsets. We also introduce a new hierarchical approach to keep track of analysis steps and data subsets created by users; this assists in the identification of cell types. Users can build phenotype trees and interact with the resulting hierarchical structures of both high-dimensional feature and image spaces. We report on use-cases in which domain scientists explore various large-scale fluorescence imaging datasets. We demonstrate how Facetto assists users in steering the clustering and classification process, inspecting analysis results, and gaining new scientific insights into cancer biology.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Facetto is a scalable visual analytics application that is used to discover single-cell phenotypes in high-dimensional multi-channel microscopy images of human tumors and tissues. Such images represent the cutting edge of digital histology and promise to revolutionize how diseases such as cancer are studied, diagnosed, and treated. Highly multiplexed tissue images are complex, comprising 109 or more pixels, 60-plus channels, and millions of individual cells. This makes manual analysis challenging and error-prone. Existing automated approaches are also inadequate, in large part, because they are unable to effectively exploit the deep knowledge of human tissue biology available to anatomic pathologists. To overcome these challenges, Facetto enables a semi-automated analysis of cell types and states. It integrates unsupervised and supervised learning into the image and feature exploration process and offers tools for analytical provenance. Experts can cluster the data to discover new types of cancer and immune cells and use clustering results to train a convolutional neural network that classifies new cells accordingly. Likewise, the output of classifiers can be clustered to discover aggregate patterns and phenotype subsets. We also introduce a new hierarchical approach to keep track of analysis steps and data subsets created by users; this assists in the identification of cell types. Users can build phenotype trees and interact with the resulting hierarchical structures of both high-dimensional feature and image spaces. We report on use-cases in which domain scientists explore various large-scale fluorescence imaging datasets. We demonstrate how Facetto assists users in steering the clustering and classification process, inspecting analysis results, and gaining new scientific insights into cancer biology.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Facetto is a scalable visual analytics application that is used to discover single-cell phenotypes in high-dimensional multi-channel microscopy images of human tumors and tissues. Such images represent the cutting edge of digital histology and promise to revolutionize how diseases such as cancer are studied, diagnosed, and treated. Highly multiplexed tissue images are complex, comprising 109 or more pixels, 60-plus channels, and millions of individual cells. This makes manual analysis challenging and error-prone. Existing automated approaches are also inadequate, in large part, because they are unable to effectively exploit the deep knowledge of human tissue biology available to anatomic pathologists. To overcome these challenges, Facetto enables a semi-automated analysis of cell types and states. It integrates unsupervised and supervised learning into the image and feature exploration process and offers tools for analytical provenance. Experts can cluster the data to discover new types of cancer and immune cells and use clustering results to train a convolutional neural network that classifies new cells accordingly. Likewise, the output of classifiers can be clustered to discover aggregate patterns and phenotype subsets. We also introduce a new hierarchical approach to keep track of analysis steps and data subsets created by users; this assists in the identification of cell types. Users can build phenotype trees and interact with the resulting hierarchical structures of both high-dimensional feature and image spaces. We report on use-cases in which domain scientists explore various large-scale fluorescence imaging datasets. We demonstrate how Facetto assists users in steering the clustering and classification process, inspecting analysis results, and gaining new scientific insights into cancer biology.",
"title": "Facetto: Combining Unsupervised and Supervised Learning for Hierarchical Phenotype Analysis in Multi-Channel Image Data",
"normalizedTitle": "Facetto: Combining Unsupervised and Supervised Learning for Hierarchical Phenotype Analysis in Multi-Channel Image Data",
"fno": "08827951",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Biomedical Optical Imaging",
"Cancer",
"Cellular Biophysics",
"Data Analysis",
"Data Visualisation",
"Diseases",
"Feature Extraction",
"Fluorescence",
"Genetics",
"Image Classification",
"Image Segmentation",
"Learning Artificial Intelligence",
"Medical Image Processing",
"Neural Nets",
"Pattern Clustering",
"Tumours",
"Unsupervised Learning",
"Supervised Learning",
"Hierarchical Phenotype Analysis",
"Multichannel Image Data",
"Scalable Visual Analytics Application",
"Single Cell Phenotypes",
"High Dimensional Multichannel Microscopy Images",
"Human Tumors",
"Cutting Edge",
"Digital Histology",
"Highly Multiplexed Tissue Images",
"Comprising 109 Pixels",
"More Pixels",
"Individual Cells",
"Manual Analysis",
"Automated Approaches",
"Human Tissue Biology",
"Cell Types",
"Analytical Provenance",
"Immune Cells",
"Aggregate Patterns",
"Phenotype Subsets",
"Hierarchical Approach",
"Analysis Steps",
"Phenotype Trees",
"Resulting Hierarchical Structures",
"High Dimensional Feature",
"Facetto Assists",
"Classification Process",
"Cancer Biology",
"Cancer",
"Tools",
"Visualization",
"Rendering Computer Graphics",
"Biomedical Imaging",
"Multiplexing",
"Clustering",
"Classification",
"Visual Analysis",
"Multiplex Tissue Imaging",
"Digital Pathology",
"Cancer Systems Biology"
],
"authors": [
{
"givenName": "Robert",
"surname": "Krueger",
"fullName": "Robert Krueger",
"affiliation": "School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Johanna",
"surname": "Beyer",
"fullName": "Johanna Beyer",
"affiliation": "School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Won-Dong",
"surname": "Jang",
"fullName": "Won-Dong Jang",
"affiliation": "School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nam Wook",
"surname": "Kim",
"fullName": "Nam Wook Kim",
"affiliation": "School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Artem",
"surname": "Sokolov",
"fullName": "Artem Sokolov",
"affiliation": "Laboratory of Systems Pharmacology, Harvard Medical School, Boston, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter K.",
"surname": "Sorger",
"fullName": "Peter K. Sorger",
"affiliation": "Laboratory of Systems Pharmacology, Harvard Medical School, Boston, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanspeter",
"surname": "Pfister",
"fullName": "Hanspeter Pfister",
"affiliation": "School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "227-237",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iscsic/2017/2941/0/2941a088",
"title": "Small-Cell Lung Cancer Detection Using a Supervised Machine Learning Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/iscsic/2017/2941a088/12OmNC0guyu",
"parentPublication": {
"id": "proceedings/iscsic/2017/2941/0",
"title": "2017 International Symposium on Computer Science and Intelligent Controls (ISCSIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2010/8306/0/05706572",
"title": "Discovering functional gene pathways associated with cancer heterogeneity via sparse supervised learning",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2010/05706572/12OmNCbU34F",
"parentPublication": {
"id": "proceedings/bibm/2010/8306/0",
"title": "2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2016/3834/0/3834a121",
"title": "Detecting Cell Growth and Drug Response in Heterogeneous Populations: A Dynamic Imaging Approach",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2016/3834a121/12OmNvKePI1",
"parentPublication": {
"id": "proceedings/bibe/2016/3834/0",
"title": "2016 IEEE 16th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csbw/2005/2442/0/24420374",
"title": "Cell Phenotype Classification Based on 3D Cell Image Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/csbw/2005/24420374/12OmNxisQZg",
"parentPublication": {
"id": "proceedings/csbw/2005/2442/0",
"title": "2005 IEEE Computational Systems Bioinformatics Conference Workshops and Poster Abstracts",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2010/4083/0/4083a302",
"title": "Identifying Prostate Cancer-Related Networks from Microarray Data Based on Genotype-Phenotype Networks Using Markov Blanket Search",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2010/4083a302/12OmNylsZKa",
"parentPublication": {
"id": "proceedings/bibe/2010/4083/0",
"title": "2010 IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lssa/2006/0277/0/04015823",
"title": "Nanoscale Biomarkers for Cancer Genomics and Protemics",
"doi": null,
"abstractUrl": "/proceedings-article/lssa/2006/04015823/12OmNz5s0ME",
"parentPublication": {
"id": "proceedings/lssa/2006/0277/0",
"title": "2006 IEEE/NLM Life Science Systems and Applications Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2007/1509/0/04375701",
"title": "The GPU on biomedical image processing for color and phenotype analysis",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2007/04375701/12OmNzTH0XG",
"parentPublication": {
"id": "proceedings/bibe/2007/1509/0",
"title": "7th IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2011/05/ttb2011051170",
"title": "A Novel Knowledge-Driven Systems Biology Approach for Phenotype Prediction upon Genetic Intervention",
"doi": null,
"abstractUrl": "/journal/tb/2011/05/ttb2011051170/13rRUxly94f",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2018/6614/0/661400b578",
"title": "Automated Counting of Cells in Breast Cytology Images Using Level Set Method",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2018/661400b578/183rAfb8rTO",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2018/6614/0",
"title": "2018 IEEE 20th International Conference on High Performance Computing and Communications; IEEE 16th International Conference on Smart City; IEEE 4th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2020/6215/0/09313176",
"title": "Image Based Fractal Analysis for Detection of Cancer Cells",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313176/1qmg3CpHoPe",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08807296",
"articleId": "1cG6usdi8aQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08827944",
"articleId": "1ddbirUMtNe",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1lxvi8jC3F6",
"name": "ttg202001-08827951s1-supp1-2934547.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202001-08827951s1-supp1-2934547.mp4",
"extension": "mp4",
"size": "64.3 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1tWJ8EdItri",
"title": "July",
"year": "2021",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1g1FWXBrTxe",
"doi": "10.1109/TVCG.2019.2961893",
"abstract": "We present a machine learning-based approach for detecting and visualizing complex behavior in spatiotemporal volumes. For this, we train models to predict future data values at a given position based on the past values in its neighborhood, capturing common temporal behavior in the data. We then evaluate the model's prediction on the same data. High prediction error means that the local behavior was too complex, unique or uncertain to be accurately captured during training, indicating spatiotemporal regions with interesting behavior. By training several models of varying capacity, we are able to detect spatiotemporal regions of various complexities. We aggregate the obtained prediction errors into a time series or spatial volumes and visualize them together to highlight regions of unpredictable behavior and how they differ between the models. We demonstrate two further volumetric applications: adaptive timestep selection and analysis of ensemble dissimilarity. We apply our technique to datasets from multiple application domains and demonstrate that we are able to produce meaningful results while making minimal assumptions about the underlying data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a machine learning-based approach for detecting and visualizing complex behavior in spatiotemporal volumes. For this, we train models to predict future data values at a given position based on the past values in its neighborhood, capturing common temporal behavior in the data. We then evaluate the model's prediction on the same data. High prediction error means that the local behavior was too complex, unique or uncertain to be accurately captured during training, indicating spatiotemporal regions with interesting behavior. By training several models of varying capacity, we are able to detect spatiotemporal regions of various complexities. We aggregate the obtained prediction errors into a time series or spatial volumes and visualize them together to highlight regions of unpredictable behavior and how they differ between the models. We demonstrate two further volumetric applications: adaptive timestep selection and analysis of ensemble dissimilarity. We apply our technique to datasets from multiple application domains and demonstrate that we are able to produce meaningful results while making minimal assumptions about the underlying data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a machine learning-based approach for detecting and visualizing complex behavior in spatiotemporal volumes. For this, we train models to predict future data values at a given position based on the past values in its neighborhood, capturing common temporal behavior in the data. We then evaluate the model's prediction on the same data. High prediction error means that the local behavior was too complex, unique or uncertain to be accurately captured during training, indicating spatiotemporal regions with interesting behavior. By training several models of varying capacity, we are able to detect spatiotemporal regions of various complexities. We aggregate the obtained prediction errors into a time series or spatial volumes and visualize them together to highlight regions of unpredictable behavior and how they differ between the models. We demonstrate two further volumetric applications: adaptive timestep selection and analysis of ensemble dissimilarity. We apply our technique to datasets from multiple application domains and demonstrate that we are able to produce meaningful results while making minimal assumptions about the underlying data.",
"title": "Local Prediction Models for Spatiotemporal Volume Visualization",
"normalizedTitle": "Local Prediction Models for Spatiotemporal Volume Visualization",
"fno": "08941308",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Learning Artificial Intelligence",
"Spatiotemporal Phenomena",
"Time Series",
"Local Prediction Models",
"Spatiotemporal Volume Visualization",
"Machine Learning Based Approach",
"Temporal Behavior",
"Prediction Error",
"Local Behavior",
"Prediction Errors",
"Time Series",
"Spatial Volumes",
"Unpredictable Behavior",
"Complex Behavior Detection",
"Complex Behavior Visualization",
"Future Data Values Prediction",
"Spatiotemporal Region Detection",
"Adaptive Timestep Selection",
"Ensemble Dissimilarity Analysis",
"Data Visualization",
"Predictive Models",
"Spatiotemporal Phenomena",
"Analytical Models",
"Data Models",
"Neural Networks",
"Training",
"Volume Visualization",
"Machine Learning",
"Neural Nets",
"Ensemble Visualization"
],
"authors": [
{
"givenName": "Gleb",
"surname": "Tkachev",
"fullName": "Gleb Tkachev",
"affiliation": "Visualization Research Center, University of Stuttgart, Stuttgart, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steffen",
"surname": "Frey",
"fullName": "Steffen Frey",
"affiliation": "Visualization Research Center, University of Stuttgart, Stuttgart, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Ertl",
"fullName": "Thomas Ertl",
"affiliation": "Visualization Research Center, University of Stuttgart, Stuttgart, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2021-07-01 00:00:00",
"pubType": "trans",
"pages": "3091-3108",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdmw/2013/3142/0/3143a994",
"title": "Severe Hail Prediction within a Spatiotemporal Relational Data Mining Framework",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2013/3143a994/12OmNzZWbJ9",
"parentPublication": {
"id": "proceedings/icdmw/2013/3142/0",
"title": "2013 IEEE 13th International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600n3926",
"title": "STRPM: A Spatiotemporal Residual Predictive Model for High-Resolution Video Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600n3926/1H1mJyi5Fmg",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09944966",
"title": "Traffic Flow Prediction Based on Spatiotemporal Potential Energy Fields",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09944966/1IbM9Dh1cuA",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mdm/2019/3363/0/336300a298",
"title": "Traffic Congestion Prediction by Spatiotemporal Propagation Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/mdm/2019/336300a298/1ckrQodp6qk",
"parentPublication": {
"id": "proceedings/mdm/2019/3363/0",
"title": "2019 20th IEEE International Conference on Mobile Data Management (MDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/06/09321130",
"title": "Spatiotemporal Co-Attention Recurrent Neural Networks for Human-Skeleton Motion Prediction",
"doi": null,
"abstractUrl": "/journal/tp/2022/06/09321130/1qkwzzV7Zug",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2020/8316/0/831600b442",
"title": "FreqST: Exploiting Frequency Information in Spatiotemporal Modeling for Traffic Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2020/831600b442/1r54Bbu9Tji",
"parentPublication": {
"id": "proceedings/icdm/2020/8316/0",
"title": "2020 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2020/8316/0/831600b034",
"title": "A Heterogeneous Spatiotemporal Network for Lightning Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2020/831600b034/1r54DwDI8gM",
"parentPublication": {
"id": "proceedings/icdm/2020/8316/0",
"title": "2020 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2020/8316/0/831600b076",
"title": "Interpretable Spatiotemporal Deep Learning Model for Traffic Flow Prediction Based on Potential Energy Fields",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2020/831600b076/1r54HZaHBNC",
"parentPublication": {
"id": "proceedings/icdm/2020/8316/0",
"title": "2020 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2020/8316/0/831600a392",
"title": "Context-Aware Deep Representation Learning for Geo-Spatiotemporal Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2020/831600a392/1r54zzSEPrG",
"parentPublication": {
"id": "proceedings/icdm/2020/8316/0",
"title": "2020 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2021/3864/0/09428231",
"title": "STAE: A Spatiotemporal Auto-Encoder for High-Resolution Video Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2021/09428231/1uilMLOlmaA",
"parentPublication": {
"id": "proceedings/icme/2021/3864/0",
"title": "2021 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "08943144",
"articleId": "1g3bi26D34k",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1tWJd6H1ahi",
"name": "ttg202107-08941308s1-tvcg-2961893-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202107-08941308s1-tvcg-2961893-mm.zip",
"extension": "zip",
"size": "33.3 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45X2fUEW",
"doi": "10.1109/TVCG.2018.2864839",
"abstract": "Flow fields are usually visualized relative to a global observer, i.e., a single frame of reference. However, often no global frame can depict all flow features equally well. Likewise, objective criteria for detecting features such as vortices often use either a global reference frame, or compute a separate frame for each point in space and time. We propose the first general framework that enables choosing a smooth trade-off between these two extremes. Using global optimization to minimize specific differential geometric properties, we compute a time-dependent observer velocity field that describes the motion of a continuous field of observers adapted to the input flow. This requires developing the novel notion of an observed time derivative. While individual observers are restricted to rigid motions, overall we compute an approximate Killing field, corresponding to almost-rigid motion. This enables continuous transitions between different observers. Instead of focusing only on flow features, we furthermore develop a novel general notion of visualizing how all observers jointly perceive the input field. This in fact requires introducing the concept of an observation time, with respect to which a visualization is computed. We develop the corresponding notions of observed stream, path, streak, and time lines. For efficiency, these characteristic curves can be computed using standard approaches, by first transforming the input field accordingly. Finally, we prove that the input flow perceived by the observer field is objective. This makes derived flow features, such as vortices, objective as well.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Flow fields are usually visualized relative to a global observer, i.e., a single frame of reference. However, often no global frame can depict all flow features equally well. Likewise, objective criteria for detecting features such as vortices often use either a global reference frame, or compute a separate frame for each point in space and time. We propose the first general framework that enables choosing a smooth trade-off between these two extremes. Using global optimization to minimize specific differential geometric properties, we compute a time-dependent observer velocity field that describes the motion of a continuous field of observers adapted to the input flow. This requires developing the novel notion of an observed time derivative. While individual observers are restricted to rigid motions, overall we compute an approximate Killing field, corresponding to almost-rigid motion. This enables continuous transitions between different observers. Instead of focusing only on flow features, we furthermore develop a novel general notion of visualizing how all observers jointly perceive the input field. This in fact requires introducing the concept of an observation time, with respect to which a visualization is computed. We develop the corresponding notions of observed stream, path, streak, and time lines. For efficiency, these characteristic curves can be computed using standard approaches, by first transforming the input field accordingly. Finally, we prove that the input flow perceived by the observer field is objective. This makes derived flow features, such as vortices, objective as well.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Flow fields are usually visualized relative to a global observer, i.e., a single frame of reference. However, often no global frame can depict all flow features equally well. Likewise, objective criteria for detecting features such as vortices often use either a global reference frame, or compute a separate frame for each point in space and time. We propose the first general framework that enables choosing a smooth trade-off between these two extremes. Using global optimization to minimize specific differential geometric properties, we compute a time-dependent observer velocity field that describes the motion of a continuous field of observers adapted to the input flow. This requires developing the novel notion of an observed time derivative. While individual observers are restricted to rigid motions, overall we compute an approximate Killing field, corresponding to almost-rigid motion. This enables continuous transitions between different observers. Instead of focusing only on flow features, we furthermore develop a novel general notion of visualizing how all observers jointly perceive the input field. This in fact requires introducing the concept of an observation time, with respect to which a visualization is computed. We develop the corresponding notions of observed stream, path, streak, and time lines. For efficiency, these characteristic curves can be computed using standard approaches, by first transforming the input field accordingly. Finally, we prove that the input flow perceived by the observer field is objective. This makes derived flow features, such as vortices, objective as well.",
"title": "Time-Dependent Flow seen through Approximate Observer Killing Fields",
"normalizedTitle": "Time-Dependent Flow seen through Approximate Observer Killing Fields",
"fno": "08440037",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Fluid Dynamics",
"Vortices",
"Differential Geometric Properties",
"Killing Field",
"Continuous Field",
"Time Dependent Observer Velocity Field",
"Global Optimization",
"Global Reference Frame",
"Global Observer",
"Time Dependent Flow",
"Observers",
"Visualization",
"Optimization",
"Standards",
"Geometry",
"Feature Extraction",
"Two Dimensional Displays",
"Flow Visualization",
"Observer Frames Of Reference",
"Killing Vector Fields",
"Infinitesimal Isometries",
"Lie Derivatives",
"Objectivity"
],
"authors": [
{
"givenName": "Markus",
"surname": "Hadwiger",
"fullName": "Markus Hadwiger",
"affiliation": "King Abdullah University of Science and Technology (KAUST), Visual Computing Center, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matej",
"surname": "Mlejnek",
"fullName": "Matej Mlejnek",
"affiliation": "King Abdullah University of Science and Technology (KAUST), Visual Computing Center, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Theußl",
"fullName": "Thomas Theußl",
"affiliation": "King Abdullah University of Science and Technology (KAUST), Core Labs, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Rautek",
"fullName": "Peter Rautek",
"affiliation": "King Abdullah University of Science and Technology (KAUST), Visual Computing Center, Saudi Arabia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "1257-1266",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dui/2015/6886/0/07131729",
"title": "Dealing with frame cancellation for stereoscopic displays in 3D user interfaces",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2015/07131729/12OmNAZfxIF",
"parentPublication": {
"id": "proceedings/3dui/2015/6886/0",
"title": "2015 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2017/0733/0/0733b287",
"title": "Generating 5D Light Fields in Scattering Media for Representing 3D Images",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2017/0733b287/12OmNAndigF",
"parentPublication": {
"id": "proceedings/cvprw/2017/0733/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icccnt/2013/3926/0/06726544",
"title": "Finite time consensus for leader following multiagent system with distributed observer design",
"doi": null,
"abstractUrl": "/proceedings-article/icccnt/2013/06726544/12OmNAndijN",
"parentPublication": {
"id": "proceedings/icccnt/2013/3926/0",
"title": "2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aqtr/2018/2205/0/08402771",
"title": "Model-based observer design evaluation for x-y positioning systems",
"doi": null,
"abstractUrl": "/proceedings-article/aqtr/2018/08402771/12OmNrJiCLH",
"parentPublication": {
"id": "proceedings/aqtr/2018/2205/0",
"title": "2018 IEEE International Conference on Automation, Quality and Testing, Robotics (AQTR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imccc/2016/1195/0/07774790",
"title": "Observer-Based Output Feedback Containment Control for Multiple Euler-Lagrange Systems",
"doi": null,
"abstractUrl": "/proceedings-article/imccc/2016/07774790/12OmNyoSbdn",
"parentPublication": {
"id": "proceedings/imccc/2016/1195/0",
"title": "2016 Sixth International Conference on Instrumentation & Measurement, Computer, Communication and Control (IMCCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2011/348/0/06012090",
"title": "A handy calibrator for color vision of a human observer",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2011/06012090/12OmNzwHvq1",
"parentPublication": {
"id": "proceedings/icme/2011/348/0",
"title": "2011 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2016/02/07160695",
"title": "On the Influence of an Iterative Affect Annotation Approach on Inter-Observer and Self-Observer Reliability",
"doi": null,
"abstractUrl": "/journal/ta/2016/02/07160695/13rRUx0geol",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmeae/2019/6037/0/09140161",
"title": "Sensorless Field Oriented Control of BLDC motor based on Sliding Mode Observer",
"doi": null,
"abstractUrl": "/proceedings-article/icmeae/2019/09140161/1lu6UKgNJiU",
"parentPublication": {
"id": "proceedings/icmeae/2019/6037/0",
"title": "2019 International Conference on Mechatronics, Electronics and Automotive Engineering (ICMEAE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222512",
"title": "Objective Observer-Relative Flow Visualization in Curved Spaces for Unsteady 2D Geophysical Flows",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222512/1nTq2foekVO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09556604",
"title": "Interactive Exploration of Physically-Observable Objective Vortices in Unsteady 2D Flow",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09556604/1xlvXSp8cco",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440118",
"articleId": "17D45W2WyxV",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRXv",
"name": "ttg201901-08440037s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440037s1.zip",
"extension": "zip",
"size": "95.8 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1qL5hsvvVkc",
"title": "Feb.",
"year": "2021",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1nTq2foekVO",
"doi": "10.1109/TVCG.2020.3030454",
"abstract": "Computing and visualizing features in fluid flow often depends on the observer, or reference frame, relative to which the input velocity field is given. A desired property of feature detectors is therefore that they are objective, meaning independent of the input reference frame. However, the standard definition of objectivity is only given for Euclidean domains and cannot be applied in curved spaces. We build on methods from mathematical physics and Riemannian geometry to generalize objectivity to curved spaces, using the powerful notion of symmetry groups as the basis for definition. From this, we develop a general mathematical framework for the objective computation of observer fields for curved spaces, relative to which other computed measures become objective. An important property of our framework is that it works intrinsically in 2D, instead of in the 3D ambient space. This enables a direct generalization of the 2D computation via optimization of observer fields in flat space to curved domains, without having to perform optimization in 3D. We specifically develop the case of unsteady 2D geophysical flows given on spheres, such as the Earth. Our observer fields in curved spaces then enable objective feature computation as well as the visualization of the time evolution of scalar and vector fields, such that the automatically computed reference frames follow moving structures like vortices in a way that makes them appear to be steady.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Computing and visualizing features in fluid flow often depends on the observer, or reference frame, relative to which the input velocity field is given. A desired property of feature detectors is therefore that they are objective, meaning independent of the input reference frame. However, the standard definition of objectivity is only given for Euclidean domains and cannot be applied in curved spaces. We build on methods from mathematical physics and Riemannian geometry to generalize objectivity to curved spaces, using the powerful notion of symmetry groups as the basis for definition. From this, we develop a general mathematical framework for the objective computation of observer fields for curved spaces, relative to which other computed measures become objective. An important property of our framework is that it works intrinsically in 2D, instead of in the 3D ambient space. This enables a direct generalization of the 2D computation via optimization of observer fields in flat space to curved domains, without having to perform optimization in 3D. We specifically develop the case of unsteady 2D geophysical flows given on spheres, such as the Earth. Our observer fields in curved spaces then enable objective feature computation as well as the visualization of the time evolution of scalar and vector fields, such that the automatically computed reference frames follow moving structures like vortices in a way that makes them appear to be steady.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Computing and visualizing features in fluid flow often depends on the observer, or reference frame, relative to which the input velocity field is given. A desired property of feature detectors is therefore that they are objective, meaning independent of the input reference frame. However, the standard definition of objectivity is only given for Euclidean domains and cannot be applied in curved spaces. We build on methods from mathematical physics and Riemannian geometry to generalize objectivity to curved spaces, using the powerful notion of symmetry groups as the basis for definition. From this, we develop a general mathematical framework for the objective computation of observer fields for curved spaces, relative to which other computed measures become objective. An important property of our framework is that it works intrinsically in 2D, instead of in the 3D ambient space. This enables a direct generalization of the 2D computation via optimization of observer fields in flat space to curved domains, without having to perform optimization in 3D. We specifically develop the case of unsteady 2D geophysical flows given on spheres, such as the Earth. Our observer fields in curved spaces then enable objective feature computation as well as the visualization of the time evolution of scalar and vector fields, such that the automatically computed reference frames follow moving structures like vortices in a way that makes them appear to be steady.",
"title": "Objective Observer-Relative Flow Visualization in Curved Spaces for Unsteady 2D Geophysical Flows",
"normalizedTitle": "Objective Observer-Relative Flow Visualization in Curved Spaces for Unsteady 2D Geophysical Flows",
"fno": "09222512",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Fluid Dynamics",
"Computational Geometry",
"Differential Geometry",
"Feature Extraction",
"Flow Visualisation",
"Geophysical Fluid Dynamics",
"Geophysics Computing",
"Optimisation",
"Vectors",
"Vortices",
"Objective Observer Relative Flow Visualization",
"Curved Spaces",
"Unsteady 2 D Geophysical Flows",
"Fluid Flow",
"Input Velocity Field",
"Input Reference Frame",
"Objectivity",
"General Mathematical Framework",
"Observer Fields",
"Flat Space",
"Curved Domains",
"Objective Feature Computation",
"Automatically Computed Reference Frames",
"Feature Visualization",
"Feature Detectors",
"Euclidean Domains",
"Mathematical Physics",
"Riemannian Geometry",
"Symmetry Groups",
"Optimization",
"Scalar Fields",
"Vector Fields",
"Vortices",
"Observers",
"Visualization",
"Two Dimensional Displays",
"Three Dimensional Displays",
"Manifolds",
"Hurricanes",
"Earth",
"Flow Visualization",
"Observer Fields",
"Frames Of Reference",
"Objectivity",
"Symmetry Groups",
"Intrinsic Covariant Derivatives"
],
"authors": [
{
"givenName": "Peter",
"surname": "Rautek",
"fullName": "Peter Rautek",
"affiliation": "Visual Computing Center, King Abdullah University of Science and Technology (KAUST), Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matej",
"surname": "Mlejnek",
"fullName": "Matej Mlejnek",
"affiliation": "Visual Computing Center, King Abdullah University of Science and Technology (KAUST), Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Johanna",
"surname": "Beyer",
"fullName": "Johanna Beyer",
"affiliation": "Harvard University, Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jakob",
"surname": "Troidl",
"fullName": "Jakob Troidl",
"affiliation": "Visual Computing Center, King Abdullah University of Science and Technology (KAUST), Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanspeter",
"surname": "Pfister",
"fullName": "Hanspeter Pfister",
"affiliation": "Harvard University, Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Theußl",
"fullName": "Thomas Theußl",
"affiliation": "Core Labs, King Abdullah University of Science and Technology (KAUST), Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Markus",
"surname": "Hadwiger",
"fullName": "Markus Hadwiger",
"affiliation": "Visual Computing Center, King Abdullah University of Science and Technology (KAUST), Saudi Arabia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "283-293",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2017/0831/0/0831a268",
"title": "Streamline Selection for Comparative Visualization of 3D Fluid Simulation Result",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2017/0831a268/12OmNviZlA5",
"parentPublication": {
"id": "proceedings/iv/2017/0831/0",
"title": "2017 21st International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ca/2015/0397/0/9857a038",
"title": "A Novel Dynamic Surface Control Based on State Observer",
"doi": null,
"abstractUrl": "/proceedings-article/ca/2015/9857a038/12OmNx4yvFA",
"parentPublication": {
"id": "proceedings/ca/2015/0397/0",
"title": "2015 8th International Conference on Control and Automation (CA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446222",
"title": "A Method of View-Dependent Stereoscopic Projection on Curved Screen",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446222/13bd1gCd7Sx",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122858",
"title": "Vessel Visualization using Curved Surface Reformation",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122858/13rRUwIF6dS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/03/08454764",
"title": "Hyper-Objective Vortices",
"doi": null,
"abstractUrl": "/journal/tg/2020/03/08454764/13rRUyeTVia",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440037",
"title": "Time-Dependent Flow seen through Approximate Observer Killing Fields",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440037/17D45X2fUEW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cost/2022/6248/0/624800a140",
"title": "Implementation of the Interaction Effect Among Virtual Large Curved Screens on Multiple Buildings Based on Mixed Reality",
"doi": null,
"abstractUrl": "/proceedings-article/cost/2022/624800a140/1H2psc5a9EI",
"parentPublication": {
"id": "proceedings/cost/2022/6248/0",
"title": "2022 International Conference on Culture-Oriented Science and Technology (CoST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2021/4057/0/405700a534",
"title": "Evaluation of Curved Raycasting-based Interactive Surfaces in Virtual Environments",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2021/405700a534/1tnY4fj5Ykg",
"parentPublication": {
"id": "proceedings/vrw/2021/4057/0",
"title": "2021 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2020/6406/0/640600b173",
"title": "Research on Laser Measurement of 3D curved Glass Contour based on computer Vision",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2020/640600b173/1x3kCJdq8ZW",
"parentPublication": {
"id": "proceedings/icisce/2020/6406/0",
"title": "2020 7th International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09556604",
"title": "Interactive Exploration of Physically-Observable Objective Vortices in Unsteady 2D Flow",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09556604/1xlvXSp8cco",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222364",
"articleId": "1nTrxuPw4UM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09222335",
"articleId": "1nTqzC75UfS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qL6sortWCs",
"name": "ttg202102-09222512s1-supp1-3030454.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222512s1-supp1-3030454.pdf",
"extension": "pdf",
"size": "5.2 MB",
"__typename": "WebExtraType"
},
{
"id": "1qL5yOm4T8Q",
"name": "ttg202102-09222512s1-supp2-3030454.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222512s1-supp2-3030454.mp4",
"extension": "mp4",
"size": "238 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBCZnUs",
"title": "March",
"year": "2020",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "146z4GS1UPK",
"doi": "10.1109/TVCG.2018.2873612",
"abstract": "Topological structures such as the merge tree provide an abstract and succinct representation of scalar fields. They facilitate effective visualization and interactive exploration of feature-rich data. A merge tree captures the topology of sub-level and super-level sets in a scalar field. Estimating the similarity between merge trees is an important problem with applications to feature-directed visualization of time-varying data. We present an approach based on tree edit distance to compare merge trees. The comparison measure satisfies metric properties, it can be computed efficiently, and the cost model for the edit operations is both intuitive and captures well-known properties of merge trees. Experimental results on time-varying scalar fields, 3D cryo electron microscopy data, shape data, and various synthetic datasets show the utility of the edit distance towards a feature-driven analysis of scalar fields.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Topological structures such as the merge tree provide an abstract and succinct representation of scalar fields. They facilitate effective visualization and interactive exploration of feature-rich data. A merge tree captures the topology of sub-level and super-level sets in a scalar field. Estimating the similarity between merge trees is an important problem with applications to feature-directed visualization of time-varying data. We present an approach based on tree edit distance to compare merge trees. The comparison measure satisfies metric properties, it can be computed efficiently, and the cost model for the edit operations is both intuitive and captures well-known properties of merge trees. Experimental results on time-varying scalar fields, 3D cryo electron microscopy data, shape data, and various synthetic datasets show the utility of the edit distance towards a feature-driven analysis of scalar fields.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Topological structures such as the merge tree provide an abstract and succinct representation of scalar fields. They facilitate effective visualization and interactive exploration of feature-rich data. A merge tree captures the topology of sub-level and super-level sets in a scalar field. Estimating the similarity between merge trees is an important problem with applications to feature-directed visualization of time-varying data. We present an approach based on tree edit distance to compare merge trees. The comparison measure satisfies metric properties, it can be computed efficiently, and the cost model for the edit operations is both intuitive and captures well-known properties of merge trees. Experimental results on time-varying scalar fields, 3D cryo electron microscopy data, shape data, and various synthetic datasets show the utility of the edit distance towards a feature-driven analysis of scalar fields.",
"title": "Edit Distance between Merge Trees",
"normalizedTitle": "Edit Distance between Merge Trees",
"fno": "08481543",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Electron Microscopy",
"Molecular Biophysics",
"Topology",
"Tree Data Structures",
"Trees Mathematics",
"Scalar Field",
"Feature Rich Data",
"Merge Trees",
"Tree Edit Distance",
"Time Varying Scalar Fields",
"Topological Structures",
"Feature Directed Visualization",
"3 D Cryo Electron Microscopy Data",
"Shape Data",
"Feature Driven Analysis",
"Computational Modeling",
"Measurement",
"Shape",
"Asymptotic Stability",
"Data Visualization",
"Stability Analysis",
"Two Dimensional Displays",
"Merge Tree",
"Scalar Field",
"Distance Measure",
"Persistence",
"Edit Distance"
],
"authors": [
{
"givenName": "Raghavendra",
"surname": "Sridharamurthy",
"fullName": "Raghavendra Sridharamurthy",
"affiliation": "Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Talha Bin",
"surname": "Masood",
"fullName": "Talha Bin Masood",
"affiliation": "Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Adhitya",
"surname": "Kamakshidasan",
"fullName": "Adhitya Kamakshidasan",
"affiliation": "Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vijay",
"surname": "Natarajan",
"fullName": "Vijay Natarajan",
"affiliation": "Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2020-03-01 00:00:00",
"pubType": "trans",
"pages": "1518-1531",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cisis/2011/4373/0/4373a536",
"title": "An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2011/4373a536/12OmNxzuMQH",
"parentPublication": {
"id": "proceedings/cisis/2011/4373/0",
"title": "2011 International Conference on Complex, Intelligent, and Software Intensive Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2017/0617/0/08231846",
"title": "Task-based augmented merge trees with Fibonacci heaps",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2017/08231846/12OmNzBwGrc",
"parentPublication": {
"id": "proceedings/ldav/2017/0617/0",
"title": "2017 IEEE 7th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08443124",
"title": "Temporal Treemaps: Static Visualization of Evolving Trees",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08443124/17D45Wda7eb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545613",
"title": "Segmentation Edit Distance",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545613/17D45X0yjTI",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09744472",
"title": "Geometry Aware Merge Tree Comparisons for Time-Varying Data with Interleaving Distances",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09744472/1C8BFCieD2U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09912347",
"title": "Computing a Stable Distance on Merge Trees",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09912347/1HeiTQ2soFO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/topoinvis/2022/9354/0/935400a029",
"title": "A Deformation-based Edit Distance for Merge Trees",
"doi": null,
"abstractUrl": "/proceedings-article/topoinvis/2022/935400a029/1J2XJrPDCgM",
"parentPublication": {
"id": "proceedings/topoinvis/2022/9354/0",
"title": "2022 Topological Data Analysis and Visualization (TopoInVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08794553",
"title": "A Structural Average of Labeled Merge Trees for Uncertainty Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08794553/1fe7uYD8R68",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555911",
"title": "Wasserstein Distances, Geodesics and Barycenters of Merge Trees",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555911/1xlvYjicn7i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09585392",
"title": "Comparative Analysis of Merge Trees Using Local Tree Edit Distance",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09585392/1y11d1nDEas",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08481548",
"articleId": "146z4FKubY3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08454764",
"articleId": "13rRUyeTVia",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i57wgmITHW",
"name": "ttg202003-08481543s1.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202003-08481543s1.pdf",
"extension": "pdf",
"size": "2.51 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1C8BFCieD2U",
"doi": "10.1109/TVCG.2022.3163349",
"abstract": "Merge trees, a type of topological descriptors, serve to identify and summarize the topological characteristics associated with scalar fields. They present a great potential for the analysis and visualization of time-varying data. First, they give compressed and topology-preserving representations of data instances. Second, their comparisons provide a basis for studying the relations among data instances, such as their distributions, clusters, outliers, and periodicities. A number of comparative measures have been developed for merge trees. However, these measures are often computationally expensive since they implicitly consider all possible correspondences between critical points of the merge trees. In this paper, we perform geometry aware comparisons of merge trees. The main idea is to decouple the computation of a comparative measure into two steps: a labeling step that generates a correspondence between the critical points of two merge trees, and a comparision step that computes distances between a pair of labeled merge trees by encoding them as matrices. We show that our approach is general, computationally efficient, and practically useful. Our general framework makes it possible to integrate geometric information of the data domain in the labeling process. At the same time, it reduces the computational complexity since not all possible correspondences have to be considered. We demonstrate via experiments that such geometry aware merge tree comparisons help to detect transitions, clusters, and periodicities of a time-varying dataset, as well as to diagnose and highlight the topological changes between adjacent data instances.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Merge trees, a type of topological descriptors, serve to identify and summarize the topological characteristics associated with scalar fields. They present a great potential for the analysis and visualization of time-varying data. First, they give compressed and topology-preserving representations of data instances. Second, their comparisons provide a basis for studying the relations among data instances, such as their distributions, clusters, outliers, and periodicities. A number of comparative measures have been developed for merge trees. However, these measures are often computationally expensive since they implicitly consider all possible correspondences between critical points of the merge trees. In this paper, we perform geometry aware comparisons of merge trees. The main idea is to decouple the computation of a comparative measure into two steps: a labeling step that generates a correspondence between the critical points of two merge trees, and a comparision step that computes distances between a pair of labeled merge trees by encoding them as matrices. We show that our approach is general, computationally efficient, and practically useful. Our general framework makes it possible to integrate geometric information of the data domain in the labeling process. At the same time, it reduces the computational complexity since not all possible correspondences have to be considered. We demonstrate via experiments that such geometry aware merge tree comparisons help to detect transitions, clusters, and periodicities of a time-varying dataset, as well as to diagnose and highlight the topological changes between adjacent data instances.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Merge trees, a type of topological descriptors, serve to identify and summarize the topological characteristics associated with scalar fields. They present a great potential for the analysis and visualization of time-varying data. First, they give compressed and topology-preserving representations of data instances. Second, their comparisons provide a basis for studying the relations among data instances, such as their distributions, clusters, outliers, and periodicities. A number of comparative measures have been developed for merge trees. However, these measures are often computationally expensive since they implicitly consider all possible correspondences between critical points of the merge trees. In this paper, we perform geometry aware comparisons of merge trees. The main idea is to decouple the computation of a comparative measure into two steps: a labeling step that generates a correspondence between the critical points of two merge trees, and a comparision step that computes distances between a pair of labeled merge trees by encoding them as matrices. We show that our approach is general, computationally efficient, and practically useful. Our general framework makes it possible to integrate geometric information of the data domain in the labeling process. At the same time, it reduces the computational complexity since not all possible correspondences have to be considered. We demonstrate via experiments that such geometry aware merge tree comparisons help to detect transitions, clusters, and periodicities of a time-varying dataset, as well as to diagnose and highlight the topological changes between adjacent data instances.",
"title": "Geometry Aware Merge Tree Comparisons for Time-Varying Data with Interleaving Distances",
"normalizedTitle": "Geometry Aware Merge Tree Comparisons for Time-Varying Data with Interleaving Distances",
"fno": "09744472",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Labeling",
"Measurement",
"Data Visualization",
"Geometry",
"Encoding",
"Data Analysis",
"Visualization",
"Merge Trees",
"Merge Tree Metrics",
"Topological Data Analysis",
"Topology In Visualization"
],
"authors": [
{
"givenName": "Lin",
"surname": "Yan",
"fullName": "Lin Yan",
"affiliation": "School of Computing, University of Utah, 7060 Salt Lake City, Utah, United States, 84112-9057",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Talha",
"surname": "Bin Masood",
"fullName": "Talha Bin Masood",
"affiliation": "Department of Science and Technology, Linköping University, Norrköping, Sweden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Farhan",
"surname": "Rasheed",
"fullName": "Farhan Rasheed",
"affiliation": "Department of Science and Technology, Linköping University, Norrköping, Sweden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ingrid",
"surname": "Hotz",
"fullName": "Ingrid Hotz",
"affiliation": "Department of Science and Technology, Linköping University, Norrköping, Sweden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bei",
"surname": "Wang",
"fullName": "Bei Wang",
"affiliation": "Scientific Computing and Imaging Institute, University of Utah, SALT LAKE CITY, Utah, United States, 84112",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-03-01 00:00:00",
"pubType": "trans",
"pages": "1-1",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ldav/2017/0617/0/08231846",
"title": "Task-based augmented merge trees with Fibonacci heaps",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2017/08231846/12OmNzBwGrc",
"parentPublication": {
"id": "proceedings/ldav/2017/0617/0",
"title": "2017 IEEE 7th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/03/08481543",
"title": "Edit Distance between Merge Trees",
"doi": null,
"abstractUrl": "/journal/tg/2020/03/08481543/146z4GS1UPK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09912347",
"title": "Computing a Stable Distance on Merge Trees",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09912347/1HeiTQ2soFO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09920234",
"title": "Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams)",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09920234/1HxSnktOqgU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/topoinvis/2022/9354/0/935400a029",
"title": "A Deformation-based Edit Distance for Merge Trees",
"doi": null,
"abstractUrl": "/proceedings-article/topoinvis/2022/935400a029/1J2XJrPDCgM",
"parentPublication": {
"id": "proceedings/topoinvis/2022/9354/0",
"title": "2022 Topological Data Analysis and Visualization (TopoInVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/topoinvis/2022/9354/0/935400a001",
"title": "Fast Merge Tree Computation via SYCL",
"doi": null,
"abstractUrl": "/proceedings-article/topoinvis/2022/935400a001/1J2XKMu23tu",
"parentPublication": {
"id": "proceedings/topoinvis/2022/9354/0",
"title": "2022 Topological Data Analysis and Visualization (TopoInVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/topoinvis/2022/9354/0/935400a113",
"title": "Subject-Specific Brain Activity Analysis in fMRI Data Using Merge Trees",
"doi": null,
"abstractUrl": "/proceedings-article/topoinvis/2022/935400a113/1J2XLcCgpVK",
"parentPublication": {
"id": "proceedings/topoinvis/2022/9354/0",
"title": "2022 Topological Data Analysis and Visualization (TopoInVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08794553",
"title": "A Structural Average of Labeled Merge Trees for Uncertainty Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08794553/1fe7uYD8R68",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/08/09420248",
"title": "Unordered Task-Parallel Augmented Merge Tree Construction",
"doi": null,
"abstractUrl": "/journal/tg/2021/08/09420248/1tdUMuQErm0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555911",
"title": "Wasserstein Distances, Geodesics and Barycenters of Merge Trees",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555911/1xlvYjicn7i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09741325",
"articleId": "1C0jdavrcC4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09744001",
"articleId": "1C8BFV420lq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1HeiTQ2soFO",
"doi": "10.1109/TVCG.2022.3209395",
"abstract": "Distances on merge trees facilitate visual comparison of collections of scalar fields. Two desirable properties for these distances to exhibit are 1) the ability to discern between scalar fields which other, less complex topological summaries cannot and 2) to still be robust to perturbations in the dataset. The combination of these two properties, known respectively as stability and discriminativity, has led to theoretical distances which are either thought to be or shown to be computationally complex and thus their implementations have been scarce. In order to design similarity measures on merge trees which are computationally feasible for more complex merge trees, many researchers have elected to loosen the restrictions on at least one of these two properties. The question still remains, however, if there are practical situations where trading these desirable properties is necessary. Here we construct a distance between merge trees which is designed to retain both discriminativity and stability. While our approach can be expensive for large merge trees, we illustrate its use in a setting where the number of nodes is small. This setting can be made more practical since we also provide a proof that persistence simplification increases the outputted distance by at most half of the simplified value. We demonstrate our distance measure on applications in shape comparison and on detection of periodicity in the von Kármán vortex street.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Distances on merge trees facilitate visual comparison of collections of scalar fields. Two desirable properties for these distances to exhibit are 1) the ability to discern between scalar fields which other, less complex topological summaries cannot and 2) to still be robust to perturbations in the dataset. The combination of these two properties, known respectively as stability and discriminativity, has led to theoretical distances which are either thought to be or shown to be computationally complex and thus their implementations have been scarce. In order to design similarity measures on merge trees which are computationally feasible for more complex merge trees, many researchers have elected to loosen the restrictions on at least one of these two properties. The question still remains, however, if there are practical situations where trading these desirable properties is necessary. Here we construct a distance between merge trees which is designed to retain both discriminativity and stability. While our approach can be expensive for large merge trees, we illustrate its use in a setting where the number of nodes is small. This setting can be made more practical since we also provide a proof that persistence simplification increases the outputted distance by at most half of the simplified value. We demonstrate our distance measure on applications in shape comparison and on detection of periodicity in the von Kármán vortex street.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Distances on merge trees facilitate visual comparison of collections of scalar fields. Two desirable properties for these distances to exhibit are 1) the ability to discern between scalar fields which other, less complex topological summaries cannot and 2) to still be robust to perturbations in the dataset. The combination of these two properties, known respectively as stability and discriminativity, has led to theoretical distances which are either thought to be or shown to be computationally complex and thus their implementations have been scarce. In order to design similarity measures on merge trees which are computationally feasible for more complex merge trees, many researchers have elected to loosen the restrictions on at least one of these two properties. The question still remains, however, if there are practical situations where trading these desirable properties is necessary. Here we construct a distance between merge trees which is designed to retain both discriminativity and stability. While our approach can be expensive for large merge trees, we illustrate its use in a setting where the number of nodes is small. This setting can be made more practical since we also provide a proof that persistence simplification increases the outputted distance by at most half of the simplified value. We demonstrate our distance measure on applications in shape comparison and on detection of periodicity in the von Kármán vortex street.",
"title": "Computing a Stable Distance on Merge Trees",
"normalizedTitle": "Computing a Stable Distance on Merge Trees",
"fno": "09912347",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Complexity",
"Data Visualisation",
"Pattern Clustering",
"Topology",
"Trees Mathematics",
"Vortices",
"Distance Measure",
"Merge Trees",
"Scalar Fields",
"Stable Distance",
"Theoretical Distances",
"Topology",
"Distortion",
"Stability Criteria",
"Perturbation Methods",
"Thermal Stability",
"Shape Measurement",
"Shape",
"Merge Trees",
"Scalar Fields",
"Distance Measure",
"Stability",
"Edit Distance",
"Persistence"
],
"authors": [
{
"givenName": "Brian",
"surname": "Bollen",
"fullName": "Brian Bollen",
"affiliation": "Department of Mathematics, The University of Arizona, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pasindu",
"surname": "Tennakoon",
"fullName": "Pasindu Tennakoon",
"affiliation": "Department of Computer Science, The University of Arizona, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Joshua A.",
"surname": "Levine",
"fullName": "Joshua A. Levine",
"affiliation": "Department of Computer Science, The University of Arizona, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "1168-1177",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ldav/2017/0617/0/08231846",
"title": "Task-based augmented merge trees with Fibonacci heaps",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2017/08231846/12OmNzBwGrc",
"parentPublication": {
"id": "proceedings/ldav/2017/0617/0",
"title": "2017 IEEE 7th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/5555/01/ttb2011990020",
"title": "Matching Split Distance for Unrooted Binary Phylogenetic Trees",
"doi": null,
"abstractUrl": "/journal/tb/5555/01/ttb2011990020/13rRUxYIMTx",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2012/01/ttb2012010150",
"title": "Matching Split Distance for Unrooted Binary Phylogenetic Trees",
"doi": null,
"abstractUrl": "/journal/tb/2012/01/ttb2012010150/13rRUytF47T",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/03/08481543",
"title": "Edit Distance between Merge Trees",
"doi": null,
"abstractUrl": "/journal/tg/2020/03/08481543/146z4GS1UPK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09744472",
"title": "Geometry Aware Merge Tree Comparisons for Time-Varying Data with Interleaving Distances",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09744472/1C8BFCieD2U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09920234",
"title": "Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams)",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09920234/1HxSnktOqgU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/topoinvis/2022/9354/0/935400a029",
"title": "A Deformation-based Edit Distance for Merge Trees",
"doi": null,
"abstractUrl": "/proceedings-article/topoinvis/2022/935400a029/1J2XJrPDCgM",
"parentPublication": {
"id": "proceedings/topoinvis/2022/9354/0",
"title": "2022 Topological Data Analysis and Visualization (TopoInVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08794553",
"title": "A Structural Average of Labeled Merge Trees for Uncertainty Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08794553/1fe7uYD8R68",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555911",
"title": "Wasserstein Distances, Geodesics and Barycenters of Merge Trees",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555911/1xlvYjicn7i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09585392",
"title": "Comparative Analysis of Merge Trees Using Local Tree Edit Distance",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09585392/1y11d1nDEas",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09903344",
"articleId": "1GZooFK65GM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09904461",
"articleId": "1H1gkbJeuas",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Jgw6IfARGM",
"name": "ttg202301-09912347s1-supp1-3209395.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09912347s1-supp1-3209395.pdf",
"extension": "pdf",
"size": "338 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1Jv6pC6iiPe",
"title": "Feb.",
"year": "2023",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1HxSnktOqgU",
"doi": "10.1109/TVCG.2022.3215001",
"abstract": "This article presents a computational framework for the Principal Geodesic Analysis of merge trees (MT-PGA), a novel adaptation of the celebrated Principal Component Analysis (PCA) framework (K. Pearson 1901) to the Wasserstein metric space of merge trees (Pont et al. 2022). We formulate MT-PGA computation as a constrained optimization problem, aiming at adjusting a basis of orthogonal geodesic axes, while minimizing a fitting energy. We introduce an efficient, iterative algorithm which exploits shared-memory parallelism, as well as an analytic expression of the fitting energy gradient, to ensure fast iterations. Our approach also trivially extends to extremum persistence diagrams. Extensive experiments on public ensembles demonstrate the efficiency of our approach – with MT-PGA computations in the orders of minutes for the largest examples. We show the utility of our contributions by extending to merge trees two typical PCA applications. First, we apply MT-PGA to <italic>data reduction</italic> and reliably compress merge trees by concisely representing them by their first coordinates in the MT-PGA basis. Second, we present a <italic>dimensionality reduction</italic> framework exploiting the first two directions of the MT-PGA basis to generate two-dimensional layouts of the ensemble. We augment these layouts with persistence correlation views, enabling global and local visual inspections of the feature variability in the ensemble. In both applications, quantitative experiments assess the relevance of our framework. Finally, we provide a C++ implementation that can be used to reproduce our results.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article presents a computational framework for the Principal Geodesic Analysis of merge trees (MT-PGA), a novel adaptation of the celebrated Principal Component Analysis (PCA) framework (K. Pearson 1901) to the Wasserstein metric space of merge trees (Pont et al. 2022). We formulate MT-PGA computation as a constrained optimization problem, aiming at adjusting a basis of orthogonal geodesic axes, while minimizing a fitting energy. We introduce an efficient, iterative algorithm which exploits shared-memory parallelism, as well as an analytic expression of the fitting energy gradient, to ensure fast iterations. Our approach also trivially extends to extremum persistence diagrams. Extensive experiments on public ensembles demonstrate the efficiency of our approach – with MT-PGA computations in the orders of minutes for the largest examples. We show the utility of our contributions by extending to merge trees two typical PCA applications. First, we apply MT-PGA to <italic>data reduction</italic> and reliably compress merge trees by concisely representing them by their first coordinates in the MT-PGA basis. Second, we present a <italic>dimensionality reduction</italic> framework exploiting the first two directions of the MT-PGA basis to generate two-dimensional layouts of the ensemble. We augment these layouts with persistence correlation views, enabling global and local visual inspections of the feature variability in the ensemble. In both applications, quantitative experiments assess the relevance of our framework. Finally, we provide a C++ implementation that can be used to reproduce our results.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article presents a computational framework for the Principal Geodesic Analysis of merge trees (MT-PGA), a novel adaptation of the celebrated Principal Component Analysis (PCA) framework (K. Pearson 1901) to the Wasserstein metric space of merge trees (Pont et al. 2022). We formulate MT-PGA computation as a constrained optimization problem, aiming at adjusting a basis of orthogonal geodesic axes, while minimizing a fitting energy. We introduce an efficient, iterative algorithm which exploits shared-memory parallelism, as well as an analytic expression of the fitting energy gradient, to ensure fast iterations. Our approach also trivially extends to extremum persistence diagrams. Extensive experiments on public ensembles demonstrate the efficiency of our approach – with MT-PGA computations in the orders of minutes for the largest examples. We show the utility of our contributions by extending to merge trees two typical PCA applications. First, we apply MT-PGA to data reduction and reliably compress merge trees by concisely representing them by their first coordinates in the MT-PGA basis. Second, we present a dimensionality reduction framework exploiting the first two directions of the MT-PGA basis to generate two-dimensional layouts of the ensemble. We augment these layouts with persistence correlation views, enabling global and local visual inspections of the feature variability in the ensemble. In both applications, quantitative experiments assess the relevance of our framework. Finally, we provide a C++ implementation that can be used to reproduce our results.",
"title": "Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams)",
"normalizedTitle": "Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams)",
"fno": "09920234",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Data Preparation",
"Data Reduction",
"Iterative Methods",
"Optimisation",
"Principal Component Analysis",
"Trees Mathematics",
"Constrained Optimization Problem",
"Data Reduction",
"Dimensionality Reduction Framework",
"Fast Iterations",
"Fitting Energy Gradient",
"Geometrical Complexity",
"Iterative Algorithm",
"Merge Trees",
"MT PGA Computation",
"Orthogonal Geodesic Axes",
"Persistence Correlation Views",
"Persistence Diagrams",
"Principal Component Analysis",
"Principal Geodesic Analysis",
"Shared Memory Parallelism",
"Wasserstein Metric Space",
"Data Visualization",
"Measurement",
"Principal Component Analysis",
"Probability Density Function",
"Optimization",
"Uncertainty",
"Layout",
"Topological Data Analysis",
"Ensemble Data",
"Merge Trees",
"Persistence Diagrams"
],
"authors": [
{
"givenName": "Mathieu",
"surname": "Pont",
"fullName": "Mathieu Pont",
"affiliation": "CNRS and Sorbonne Université, Paris, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jules",
"surname": "Vidal",
"fullName": "Jules Vidal",
"affiliation": "CNRS and Sorbonne Université, Paris, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julien",
"surname": "Tierny",
"fullName": "Julien Tierny",
"affiliation": "CNRS and Sorbonne Université, Paris, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "1573-1589",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2016/1437/0/1437b023",
"title": "A Riemannian Framework for Statistical Analysis of Topological Persistence Diagrams",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2016/1437b023/12OmNqBtiHM",
"parentPublication": {
"id": "proceedings/cvprw/2016/1437/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iita/2008/3497/1/3497a070",
"title": "Association Rules Mining and Their Principal Analysis Component Based on Probability and Statistics Estimate Model",
"doi": null,
"abstractUrl": "/proceedings-article/iita/2008/3497a070/12OmNqFJhRw",
"parentPublication": {
"id": "proceedings/iita/2008/3497/3",
"title": "2008 Second International Symposium on Intelligent Information Technology Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iceet/2009/3819/2/3819b745",
"title": "Simultaneous Spectrophotometric Determination of Copper, Zinc, Nickel and Cobalt in Water Using Principal Component Regression Coupled with Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/iceet/2009/3819b745/12OmNwE9OwR",
"parentPublication": {
"id": "proceedings/iceet/2009/3819/2",
"title": "Energy and Environment Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2014/02/06755452",
"title": "An Algorithm for Constructing Principal Geodesics in Phylogenetic Treespace",
"doi": null,
"abstractUrl": "/journal/tb/2014/02/06755452/13rRUB7a1eh",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2018/04/07917251",
"title": "Mixture of Probabilistic Principal Component Analyzers for Shapes from Point Sets",
"doi": null,
"abstractUrl": "/journal/tp/2018/04/07917251/13rRUxASuBI",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08457259",
"title": "Persistence Atlas for Critical Point Variability in Ensembles",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08457259/17D45We0UET",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08863966",
"title": "Uncertainty-Aware Principal Component Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08863966/1e0YnnNN1LO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08794553",
"title": "A Structural Average of Labeled Merge Trees for Uncertainty Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08794553/1fe7uYD8R68",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2020/9012/0/901200a101",
"title": "Synthetic Data by Principal Component Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2020/901200a101/1rgGmp6DNQs",
"parentPublication": {
"id": "proceedings/icdmw/2020/9012/0",
"title": "2020 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555911",
"title": "Wasserstein Distances, Geodesics and Barycenters of Merge Trees",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555911/1xlvYjicn7i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09606529",
"articleId": "1ymF2Tydh3G",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09560081",
"articleId": "1xtOqCv3vNe",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Jv6wu3oaxG",
"name": "ttg202302-09920234s1-supp1-3215001.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202302-09920234s1-supp1-3215001.pdf",
"extension": "pdf",
"size": "9.92 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDY",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1cr2YZjGkPm",
"doi": "10.1109/TVCG.2019.2934256",
"abstract": "This paper presents an efficient algorithm for the progressive approximation of Wasserstein barycenters of persistence diagrams, with applications to the visual analysis of ensemble data. Given a set of scalar fields, our approach enables the computation of a persistence diagram which is representative of the set, and which visually conveys the number, data ranges and saliences of the main features of interest found in the set. Such representative diagrams are obtained by computing explicitly the discrete Wasserstein barycenter of the set of persistence diagrams, a notoriously computationally intensive task. In particular, we revisit efficient algorithms for Wasserstein distance approximation [12,51] to extend previous work on barycenter estimation [94]. We present a new fast algorithm, which progressively approximates the barycenter by iteratively increasing the computation accuracy as well as the number of persistent features in the output diagram. Such a progressivity drastically improves convergence in practice and allows to design an interruptible algorithm, capable of respecting computation time constraints. This enables the approximation of Wasserstein barycenters within interactive times. We present an application to ensemble clustering where we revisit the k-means algorithm to exploit our barycenters and compute, within execution time constraints, meaningful clusters of ensemble data along with their barycenter diagram. Extensive experiments on synthetic and real-life data sets report that our algorithm converges to barycenters that are qualitatively meaningful with regard to the applications, and quantitatively comparable to previous techniques, while offering an order of magnitude speedup when run until convergence (without time constraint). Our algorithm can be trivially parallelized to provide additional speedups in practice on standard workstations. We provide a lightweight C++ implementation of our approach that can be used to reproduce our results.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents an efficient algorithm for the progressive approximation of Wasserstein barycenters of persistence diagrams, with applications to the visual analysis of ensemble data. Given a set of scalar fields, our approach enables the computation of a persistence diagram which is representative of the set, and which visually conveys the number, data ranges and saliences of the main features of interest found in the set. Such representative diagrams are obtained by computing explicitly the discrete Wasserstein barycenter of the set of persistence diagrams, a notoriously computationally intensive task. In particular, we revisit efficient algorithms for Wasserstein distance approximation [12,51] to extend previous work on barycenter estimation [94]. We present a new fast algorithm, which progressively approximates the barycenter by iteratively increasing the computation accuracy as well as the number of persistent features in the output diagram. Such a progressivity drastically improves convergence in practice and allows to design an interruptible algorithm, capable of respecting computation time constraints. This enables the approximation of Wasserstein barycenters within interactive times. We present an application to ensemble clustering where we revisit the k-means algorithm to exploit our barycenters and compute, within execution time constraints, meaningful clusters of ensemble data along with their barycenter diagram. Extensive experiments on synthetic and real-life data sets report that our algorithm converges to barycenters that are qualitatively meaningful with regard to the applications, and quantitatively comparable to previous techniques, while offering an order of magnitude speedup when run until convergence (without time constraint). Our algorithm can be trivially parallelized to provide additional speedups in practice on standard workstations. We provide a lightweight C++ implementation of our approach that can be used to reproduce our results.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents an efficient algorithm for the progressive approximation of Wasserstein barycenters of persistence diagrams, with applications to the visual analysis of ensemble data. Given a set of scalar fields, our approach enables the computation of a persistence diagram which is representative of the set, and which visually conveys the number, data ranges and saliences of the main features of interest found in the set. Such representative diagrams are obtained by computing explicitly the discrete Wasserstein barycenter of the set of persistence diagrams, a notoriously computationally intensive task. In particular, we revisit efficient algorithms for Wasserstein distance approximation [12,51] to extend previous work on barycenter estimation [94]. We present a new fast algorithm, which progressively approximates the barycenter by iteratively increasing the computation accuracy as well as the number of persistent features in the output diagram. Such a progressivity drastically improves convergence in practice and allows to design an interruptible algorithm, capable of respecting computation time constraints. This enables the approximation of Wasserstein barycenters within interactive times. We present an application to ensemble clustering where we revisit the k-means algorithm to exploit our barycenters and compute, within execution time constraints, meaningful clusters of ensemble data along with their barycenter diagram. Extensive experiments on synthetic and real-life data sets report that our algorithm converges to barycenters that are qualitatively meaningful with regard to the applications, and quantitatively comparable to previous techniques, while offering an order of magnitude speedup when run until convergence (without time constraint). Our algorithm can be trivially parallelized to provide additional speedups in practice on standard workstations. We provide a lightweight C++ implementation of our approach that can be used to reproduce our results.",
"title": "Progressive Wasserstein Barycenters of Persistence Diagrams",
"normalizedTitle": "Progressive Wasserstein Barycenters of Persistence Diagrams",
"fno": "08794517",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Pattern Clustering",
"Scalar Fields",
"K Means Algorithm",
"Ensemble Clustering",
"Visual Analysis",
"Progressive Approximation",
"Progressive Wasserstein Barycenters",
"Real Life Data Sets Report",
"Barycenter Diagram",
"Computation Time Constraints",
"Output Diagram",
"Barycenter Estimation",
"Wasserstein Distance Approximation",
"Discrete Wasserstein Barycenter",
"Ensemble Data",
"Persistence Diagram",
"Data Visualization",
"Market Research",
"Approximation Algorithms",
"Clustering Algorithms",
"Measurement",
"Time Factors",
"Uncertainty",
"Topological Data Analysis",
"Scalar Data",
"Ensemble Data"
],
"authors": [
{
"givenName": "Jules",
"surname": "Vidal",
"fullName": "Jules Vidal",
"affiliation": "Sorbonne Université, CNRS (LIP6)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Joseph",
"surname": "Budin",
"fullName": "Joseph Budin",
"affiliation": "Sorbonne Université, CNRS (LIP6)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julien",
"surname": "Tierny",
"fullName": "Julien Tierny",
"affiliation": "Sorbonne Université, CNRS (LIP6)",
"__typename": "ArticleAuthorType"
}
],
"replicability": {
"isEnabled": true,
"codeDownloadUrl": "https://github.com/julesvidal/wasserstein-pd-barycenter.git",
"codeRepositoryUrl": "https://github.com/julesvidal/wasserstein-pd-barycenter",
"__typename": "ArticleReplicabilityType"
},
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "151-161",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2016/1437/0/1437b023",
"title": "A Riemannian Framework for Statistical Analysis of Topological Persistence Diagrams",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2016/1437b023/12OmNqBtiHM",
"parentPublication": {
"id": "proceedings/cvprw/2016/1437/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wvl/1988/0876/0/00018023",
"title": "Using the expert's diagrams as a specification of expertise",
"doi": null,
"abstractUrl": "/proceedings-article/wvl/1988/00018023/12OmNrY3Lst",
"parentPublication": {
"id": "proceedings/wvl/1988/0876/0",
"title": "1988 IEEE Workshop on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08457259",
"title": "Persistence Atlas for Critical Point Variability in Ensembles",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08457259/17D45We0UET",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09920234",
"title": "Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams)",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09920234/1HxSnktOqgU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300j884",
"title": "Order-Preserving Wasserstein Discriminant Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300j884/1hVlrVbrijC",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2020/9360/0/09150874",
"title": "Smooth Summaries of Persistence Diagrams and Texture Classification",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09150874/1lPH0I4ZRQY",
"parentPublication": {
"id": "proceedings/cvprw/2020/9360/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800h907",
"title": "Barycenters of Natural Images - Constrained Wasserstein Barycenters for Image Morphing",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800h907/1m3o6YLlYAg",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/06/09321151",
"title": "Linear and Deep Order-Preserving Wasserstein Discriminant Analysis",
"doi": null,
"abstractUrl": "/journal/tp/2022/06/09321151/1qkwyNyvvoI",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555911",
"title": "Wasserstein Distances, Geodesics and Barycenters of Merge Trees",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555911/1xlvYjicn7i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2021/3283/0/328300a001",
"title": "Fast Approximation of Persistence Diagrams with Guarantees",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2021/328300a001/1zdPDL9D2hy",
"parentPublication": {
"id": "proceedings/ldav/2021/3283/0",
"title": "2021 IEEE 11th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08807223",
"articleId": "1cG6ljKbGgg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08805451",
"articleId": "1cG4q4sh1bq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1fe9NVFb2Wk",
"name": "ttg202001-08794517s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202001-08794517s1.zip",
"extension": "zip",
"size": "20.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDY",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1fe7uYD8R68",
"doi": "10.1109/TVCG.2019.2934242",
"abstract": "Physical phenomena in science and engineering are frequently modeled using scalar fields. In scalar field topology, graph-based topological descriptors such as merge trees, contour trees, and Reeb graphs are commonly used to characterize topological changes in the (sub)level sets of scalar fields. One of the biggest challenges and opportunities to advance topology-based visualization is to understand and incorporate uncertainty into such topological descriptors to effectively reason about their underlying data. In this paper, we study a structural average of a set of labeled merge trees and use it to encode uncertainty in data. Specifically, we compute a 1-center tree that minimizes its maximum distance to any other tree in the set under a well-defined metric called the interleaving distance. We provide heuristic strategies that compute structural averages of merge trees whose labels do not fully agree. We further provide an interactive visualization system that resembles a numerical calculator that takes as input a set of merge trees and outputs a tree as their structural average. We also highlight structural similarities between the input and the average and incorporate uncertainty information for visual exploration. We develop a novel measure of uncertainty, referred to as consistency, via a metric-space view of the input trees. Finally, we demonstrate an application of our framework through merge trees that arise from ensembles of scalar fields. Our work is the first to employ interleaving distances and consistency to study a global, mathematically rigorous, structural average of merge trees in the context of uncertainty visualization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Physical phenomena in science and engineering are frequently modeled using scalar fields. In scalar field topology, graph-based topological descriptors such as merge trees, contour trees, and Reeb graphs are commonly used to characterize topological changes in the (sub)level sets of scalar fields. One of the biggest challenges and opportunities to advance topology-based visualization is to understand and incorporate uncertainty into such topological descriptors to effectively reason about their underlying data. In this paper, we study a structural average of a set of labeled merge trees and use it to encode uncertainty in data. Specifically, we compute a 1-center tree that minimizes its maximum distance to any other tree in the set under a well-defined metric called the interleaving distance. We provide heuristic strategies that compute structural averages of merge trees whose labels do not fully agree. We further provide an interactive visualization system that resembles a numerical calculator that takes as input a set of merge trees and outputs a tree as their structural average. We also highlight structural similarities between the input and the average and incorporate uncertainty information for visual exploration. We develop a novel measure of uncertainty, referred to as consistency, via a metric-space view of the input trees. Finally, we demonstrate an application of our framework through merge trees that arise from ensembles of scalar fields. Our work is the first to employ interleaving distances and consistency to study a global, mathematically rigorous, structural average of merge trees in the context of uncertainty visualization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Physical phenomena in science and engineering are frequently modeled using scalar fields. In scalar field topology, graph-based topological descriptors such as merge trees, contour trees, and Reeb graphs are commonly used to characterize topological changes in the (sub)level sets of scalar fields. One of the biggest challenges and opportunities to advance topology-based visualization is to understand and incorporate uncertainty into such topological descriptors to effectively reason about their underlying data. In this paper, we study a structural average of a set of labeled merge trees and use it to encode uncertainty in data. Specifically, we compute a 1-center tree that minimizes its maximum distance to any other tree in the set under a well-defined metric called the interleaving distance. We provide heuristic strategies that compute structural averages of merge trees whose labels do not fully agree. We further provide an interactive visualization system that resembles a numerical calculator that takes as input a set of merge trees and outputs a tree as their structural average. We also highlight structural similarities between the input and the average and incorporate uncertainty information for visual exploration. We develop a novel measure of uncertainty, referred to as consistency, via a metric-space view of the input trees. Finally, we demonstrate an application of our framework through merge trees that arise from ensembles of scalar fields. Our work is the first to employ interleaving distances and consistency to study a global, mathematically rigorous, structural average of merge trees in the context of uncertainty visualization.",
"title": "A Structural Average of Labeled Merge Trees for Uncertainty Visualization",
"normalizedTitle": "A Structural Average of Labeled Merge Trees for Uncertainty Visualization",
"fno": "08794553",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Data Analysis",
"Data Visualisation",
"Interactive Systems",
"Trees Mathematics",
"Structural Average",
"Labeled Merge Trees",
"Uncertainty Visualization",
"Scalar Field Topology",
"Graph Based Topological Descriptors",
"Topology Based Visualization",
"1 Center Tree",
"Interleaving Distance",
"Interactive Visualization System",
"Topological Data Analysis",
"Topological Data Visualization",
"Uncertainty",
"Data Visualization",
"Vegetation",
"Topology",
"Visualization",
"Measurement Uncertainty",
"Topological Data Analysis",
"Uncertainty Visualization",
"Merge Trees"
],
"authors": [
{
"givenName": "Lin",
"surname": "Yan",
"fullName": "Lin Yan",
"affiliation": "University of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yusu",
"surname": "Wang",
"fullName": "Yusu Wang",
"affiliation": "Ohio State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Elizabeth",
"surname": "Munch",
"fullName": "Elizabeth Munch",
"affiliation": "Michigan State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ellen",
"surname": "Gasparovic",
"fullName": "Ellen Gasparovic",
"affiliation": "Union College",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bei",
"surname": "Wang",
"fullName": "Bei Wang",
"affiliation": "University of Utah",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "832-842",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ldav/2017/0617/0/08231846",
"title": "Task-based augmented merge trees with Fibonacci heaps",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2017/08231846/12OmNzBwGrc",
"parentPublication": {
"id": "proceedings/ldav/2017/0617/0",
"title": "2017 IEEE 7th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122526",
"title": "Visualizing Flow of Uncertainty through Analytical Processes",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122526/13rRUyY28Yv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/03/08481543",
"title": "Edit Distance between Merge Trees",
"doi": null,
"abstractUrl": "/journal/tg/2020/03/08481543/146z4GS1UPK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09744472",
"title": "Geometry Aware Merge Tree Comparisons for Time-Varying Data with Interleaving Distances",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09744472/1C8BFCieD2U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09912347",
"title": "Computing a Stable Distance on Merge Trees",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09912347/1HeiTQ2soFO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09920234",
"title": "Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams)",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09920234/1HxSnktOqgU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/topoinvis/2022/9354/0/935400a029",
"title": "A Deformation-based Edit Distance for Merge Trees",
"doi": null,
"abstractUrl": "/proceedings-article/topoinvis/2022/935400a029/1J2XJrPDCgM",
"parentPublication": {
"id": "proceedings/topoinvis/2022/9354/0",
"title": "2022 Topological Data Analysis and Visualization (TopoInVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/04/09187994",
"title": "Uncertainty Visualization of 2D Morse Complex Ensembles Using Statistical Summary Maps",
"doi": null,
"abstractUrl": "/journal/tg/2022/04/09187994/1mXkiNpxvvq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555911",
"title": "Wasserstein Distances, Geodesics and Barycenters of Merge Trees",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555911/1xlvYjicn7i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09585392",
"title": "Comparative Analysis of Merge Trees Using Local Tree Edit Distance",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09585392/1y11d1nDEas",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08863966",
"articleId": "1e0YnnNN1LO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08805432",
"articleId": "1cG4MgXJw0U",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i4p7lVnDNe",
"name": "ttg202001-08794553s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202001-08794553s1.mp4",
"extension": "mp4",
"size": "18.2 MB",
"__typename": "WebExtraType"
},
{
"id": "1i4oYCJIa8U",
"name": "ttg202001-08794553s2.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202001-08794553s2.pdf",
"extension": "pdf",
"size": "2.32 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1uR9KQn3cNq",
"title": "Aug.",
"year": "2021",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1tdUMuQErm0",
"doi": "10.1109/TVCG.2021.3076875",
"abstract": "Contemporary scientific data sets require fast and scalable topological analysis to enable visualization, simplification and interaction. Within this field, parallel merge tree construction has seen abundant recent contributions, with a trend of decentralized, task-parallel or SMP-oriented algorithms dominating in terms of total runtime. However, none of these recent approaches computed complete merge trees on distributed systems, leaving this field to traditional divide & conquer approaches. This article introduces a scalable, parallel and distributed algorithm for merge tree construction outperforming the previously fastest distributed solution by a factor of around three. This is achieved by a task-parallel identification of individual merge tree arcs by growing regions around critical points in the data, without any need for ordered progression or global data structures, based on a novel insight introducing a sufficient local boundary for region growth.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Contemporary scientific data sets require fast and scalable topological analysis to enable visualization, simplification and interaction. Within this field, parallel merge tree construction has seen abundant recent contributions, with a trend of decentralized, task-parallel or SMP-oriented algorithms dominating in terms of total runtime. However, none of these recent approaches computed complete merge trees on distributed systems, leaving this field to traditional divide & conquer approaches. This article introduces a scalable, parallel and distributed algorithm for merge tree construction outperforming the previously fastest distributed solution by a factor of around three. This is achieved by a task-parallel identification of individual merge tree arcs by growing regions around critical points in the data, without any need for ordered progression or global data structures, based on a novel insight introducing a sufficient local boundary for region growth.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Contemporary scientific data sets require fast and scalable topological analysis to enable visualization, simplification and interaction. Within this field, parallel merge tree construction has seen abundant recent contributions, with a trend of decentralized, task-parallel or SMP-oriented algorithms dominating in terms of total runtime. However, none of these recent approaches computed complete merge trees on distributed systems, leaving this field to traditional divide & conquer approaches. This article introduces a scalable, parallel and distributed algorithm for merge tree construction outperforming the previously fastest distributed solution by a factor of around three. This is achieved by a task-parallel identification of individual merge tree arcs by growing regions around critical points in the data, without any need for ordered progression or global data structures, based on a novel insight introducing a sufficient local boundary for region growth.",
"title": "Unordered Task-Parallel Augmented Merge Tree Construction",
"normalizedTitle": "Unordered Task-Parallel Augmented Merge Tree Construction",
"fno": "09420248",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Structures",
"Data Visualisation",
"Distributed Algorithms",
"Divide And Conquer Methods",
"Interactive Systems",
"Scientific Information Systems",
"Trees Mathematics",
"Task Parallel Augmented Merge Tree Construction",
"Contemporary Scientific Data",
"Scalable Topological Analysis",
"Abundant Recent Contributions",
"Distributed Systems",
"Traditional Divide Amp Conquer Approaches",
"Fastest Distributed Solution",
"Task Parallel Identification",
"Tree Arcs",
"Ordered Progression",
"SMP Oriented Algorithms",
"Global Data Structures",
"Vegetation",
"Task Analysis",
"Data Visualization",
"Distributed Databases",
"Runtime",
"Data Structures",
"Market Research",
"Scientific Visualization",
"Topological Data Analysis",
"Task Parallelism",
"Distributed Architecture"
],
"authors": [
{
"givenName": "Kilian",
"surname": "Werner",
"fullName": "Kilian Werner",
"affiliation": "Scientific Visualization Lab, University of Kaiserslautern, Kaiserslautern, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christoph",
"surname": "Garth",
"fullName": "Christoph Garth",
"affiliation": "Scientific Visualization Lab, University of Kaiserslautern, Kaiserslautern, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": {
"isEnabled": true,
"codeDownloadUrl": "https://github.com/KilianWernerVisualize/TaskMergeTrees.git",
"codeRepositoryUrl": "https://github.com/KilianWernerVisualize/TaskMergeTrees",
"__typename": "ArticleReplicabilityType"
},
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "08",
"pubDate": "2021-08-01 00:00:00",
"pubType": "trans",
"pages": "3585-3596",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/candar/2016/2655/0/2655a047",
"title": "A Cost-Effective and Scalable Merge Sorter Tree on FPGAs",
"doi": null,
"abstractUrl": "/proceedings-article/candar/2016/2655a047/12OmNAqCtL7",
"parentPublication": {
"id": "proceedings/candar/2016/2655/0",
"title": "2016 Fourth International Symposium on Computing and Networking (CANDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse/2013/5096/0/5096a288",
"title": "A Key Tree Merge Algorithm in Multi-privileged Groups",
"doi": null,
"abstractUrl": "/proceedings-article/cse/2013/5096a288/12OmNBp52Cb",
"parentPublication": {
"id": "proceedings/cse/2013/5096/0",
"title": "2013 IEEE 16th International Conference on Computational Science and Engineering (CSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460090",
"title": "Watershed merge tree classification for electron microscopy image segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460090/12OmNyYm2wU",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2017/0617/0/08231846",
"title": "Task-based augmented merge trees with Fibonacci heaps",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2017/08231846/12OmNzBwGrc",
"parentPublication": {
"id": "proceedings/ldav/2017/0617/0",
"title": "2017 IEEE 7th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cloud/2018/7235/0/723501a652",
"title": "Efficient Key-Value Stores with Ranged Log-Structured Merge Trees",
"doi": null,
"abstractUrl": "/proceedings-article/cloud/2018/723501a652/13xI8B2zWrJ",
"parentPublication": {
"id": "proceedings/cloud/2018/7235/0",
"title": "2018 IEEE 11th International Conference on Cloud Computing (CLOUD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/topoinvis/2022/9354/0/935400a001",
"title": "Fast Merge Tree Computation via SYCL",
"doi": null,
"abstractUrl": "/proceedings-article/topoinvis/2022/935400a001/1J2XKMu23tu",
"parentPublication": {
"id": "proceedings/topoinvis/2022/9354/0",
"title": "2022 Topological Data Analysis and Visualization (TopoInVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-companion/2019/1764/0/176400a286",
"title": "Enhancing Precision of Structured Merge by Proper Tree Matching",
"doi": null,
"abstractUrl": "/proceedings-article/icse-companion/2019/176400a286/1cJ7l3MeFmo",
"parentPublication": {
"id": "proceedings/icse-companion/2019/1764/0",
"title": "2019 IEEE/ACM 41st International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/04/08889727",
"title": "Scalable Contour Tree Computation by Data Parallel Peak Pruning",
"doi": null,
"abstractUrl": "/journal/tg/2021/04/08889727/1eBufO7qLle",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08794560",
"title": "Toward Localized Topological Data Structures: Querying the Forest for the Tree",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08794560/1eX8ARELiX6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08794553",
"title": "A Structural Average of Labeled Merge Trees for Uncertainty Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08794553/1fe7uYD8R68",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08998355",
"articleId": "1hpPDOGZKzm",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04Q",
"title": "Jan.",
"year": "2017",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwcS1CZ",
"doi": "10.1109/TVCG.2016.2598958",
"abstract": "In this paper, we investigate Confluent Drawings (CD), a technique for bundling edges in node-link diagrams based on network connectivity. Edge-bundling techniques are designed to reduce edge clutter in node-link diagrams by coalescing lines into common paths or bundles. Unfortunately, traditional bundling techniques introduce ambiguity since edges are only bundled by spatial proximity, rather than network connectivity; following an edge from its source to its target can lead to the perception of incorrect connectivity if edges are not clearly separated within the bundles. Contrary, CDs bundle edges based on common sources or targets. Thus, a smooth path along a confluent bundle indicates precise connectivity. While CDs have been described in theory, practical investigation and application to real-world networks (i.e., networks beyond those with certain planarity restrictions) is currently lacking. Here, we provide the first algorithm for constructing CDs from arbitrary directed and undirected networks and present a simple layout method, embedded in a sand box environment providing techniques for interactive exploration. We then investigate patterns and artifacts in CDs, which we compare to other common edge-bundling techniques. Finally, we present the first user study that compares edge-compression techniques, including CD, power graphs, metro-style, and common edge bundling. We found that users without particular expertise in visualization or network analysis are able to read small CDs without difficulty. Compared to existing bundling techniques, CDs are more likely to allow people to correctly perceive connectivity.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we investigate Confluent Drawings (CD), a technique for bundling edges in node-link diagrams based on network connectivity. Edge-bundling techniques are designed to reduce edge clutter in node-link diagrams by coalescing lines into common paths or bundles. Unfortunately, traditional bundling techniques introduce ambiguity since edges are only bundled by spatial proximity, rather than network connectivity; following an edge from its source to its target can lead to the perception of incorrect connectivity if edges are not clearly separated within the bundles. Contrary, CDs bundle edges based on common sources or targets. Thus, a smooth path along a confluent bundle indicates precise connectivity. While CDs have been described in theory, practical investigation and application to real-world networks (i.e., networks beyond those with certain planarity restrictions) is currently lacking. Here, we provide the first algorithm for constructing CDs from arbitrary directed and undirected networks and present a simple layout method, embedded in a sand box environment providing techniques for interactive exploration. We then investigate patterns and artifacts in CDs, which we compare to other common edge-bundling techniques. Finally, we present the first user study that compares edge-compression techniques, including CD, power graphs, metro-style, and common edge bundling. We found that users without particular expertise in visualization or network analysis are able to read small CDs without difficulty. Compared to existing bundling techniques, CDs are more likely to allow people to correctly perceive connectivity.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we investigate Confluent Drawings (CD), a technique for bundling edges in node-link diagrams based on network connectivity. Edge-bundling techniques are designed to reduce edge clutter in node-link diagrams by coalescing lines into common paths or bundles. Unfortunately, traditional bundling techniques introduce ambiguity since edges are only bundled by spatial proximity, rather than network connectivity; following an edge from its source to its target can lead to the perception of incorrect connectivity if edges are not clearly separated within the bundles. Contrary, CDs bundle edges based on common sources or targets. Thus, a smooth path along a confluent bundle indicates precise connectivity. While CDs have been described in theory, practical investigation and application to real-world networks (i.e., networks beyond those with certain planarity restrictions) is currently lacking. Here, we provide the first algorithm for constructing CDs from arbitrary directed and undirected networks and present a simple layout method, embedded in a sand box environment providing techniques for interactive exploration. We then investigate patterns and artifacts in CDs, which we compare to other common edge-bundling techniques. Finally, we present the first user study that compares edge-compression techniques, including CD, power graphs, metro-style, and common edge bundling. We found that users without particular expertise in visualization or network analysis are able to read small CDs without difficulty. Compared to existing bundling techniques, CDs are more likely to allow people to correctly perceive connectivity.",
"title": "Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization",
"normalizedTitle": "Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization",
"fno": "07539373",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Clutter",
"Layout",
"Australia",
"Topology",
"Systematics",
"Complex Networks",
"Bundling",
"Network Visualization",
"Edge Compression",
"Confluent",
"Power Graph"
],
"authors": [
{
"givenName": "Benjamin",
"surname": "Bach",
"fullName": "Benjamin Bach",
"affiliation": "Microsoft Research-Inria Joint Centre, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nathalie Henry",
"surname": "Riche",
"fullName": "Nathalie Henry Riche",
"affiliation": "Microsoft Research, WA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christophe",
"surname": "Hurter",
"fullName": "Christophe Hurter",
"affiliation": "ENAC, Toulouse, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kim",
"surname": "Marriott",
"fullName": "Kim Marriott",
"affiliation": "Monash University, Melbourne, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tim",
"surname": "Dwyer",
"fullName": "Tim Dwyer",
"affiliation": "Monash University, Melbourne, Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "541-550",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2010/7846/0/05571226",
"title": "An Application of Edge Bundling Techniques to the Visualization of Media Analysis Results",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2010/05571226/12OmNAThXUv",
"parentPublication": {
"id": "proceedings/iv/2010/7846/0",
"title": "2010 14th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156354",
"title": "Attribute-driven edge bundling for general graphs with applications in trail analysis",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156354/12OmNCaLEnG",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2016/1451/0/07465267",
"title": "Multilayer graph edge bundling",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2016/07465267/12OmNCbCrKh",
"parentPublication": {
"id": "proceedings/pacificvis/2016/1451/0",
"title": "2016 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2010/7846/0/05571244",
"title": "3D Edge Bundling for Geographical Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2010/05571244/12OmNqzu6LL",
"parentPublication": {
"id": "proceedings/iv/2010/7846/0",
"title": "2010 14th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742389",
"title": "Multilevel agglomerative edge bundling for visualizing large graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742389/12OmNxj233Y",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2016/1192/0/1192a466",
"title": "Research on Network Simplification by Edge Bundling",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2016/1192a466/12OmNyQpgKZ",
"parentPublication": {
"id": "proceedings/dsc/2016/1192/0",
"title": "2016 IEEE First International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/05/ttg2012050810",
"title": "Ambiguity-Free Edge-Bundling for Interactive Graph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2012/05/ttg2012050810/13rRUxASuby",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122354",
"title": "Divided Edge Bundling for Directional Network Data",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122354/13rRUzpzeB1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2022/9007/0/900700a021",
"title": "Clustering Ensemble-based Edge Bundling to Improve the Readability of Graph Drawings",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2022/900700a021/1KaH6ONvwzK",
"parentPublication": {
"id": "proceedings/iv/2022/9007/0",
"title": "2022 26th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552919",
"title": "Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552919/1xibXgJW32U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07539319",
"articleId": "13rRUwh80Hi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07539634",
"articleId": "13rRUxASuhE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwJPMX5",
"title": "Dec.",
"year": "2011",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUzpzeB1",
"doi": "10.1109/TVCG.2011.190",
"abstract": "The node-link diagram is an intuitive and venerable way to depict a graph. To reduce clutter and improve the readability of node-link views, Holten & van Wijk's force-directed edge bundling employs a physical simulation to spatially group graph edges. While both useful and aesthetic, this technique has shortcomings: it bundles spatially proximal edges regardless of direction, weight, or graph connectivity. As a result, high-level directional edge patterns are obscured. We present divided edge bundling to tackle these shortcomings. By modifying the forces in the physical simulation, directional lanes appear as an emergent property of edge direction. By considering graph topology, we only bundle edges related by graph structure. Finally, we aggregate edge weights in bundles to enable more accurate visualization of total bundle weights. We compare visualizations created using our technique to standard force-directed edge bundling, matrix diagrams, and clustered graphs; we find that divided edge bundling leads to visualizations that are easier to interpret and reveal both familiar and previously obscured patterns.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The node-link diagram is an intuitive and venerable way to depict a graph. To reduce clutter and improve the readability of node-link views, Holten & van Wijk's force-directed edge bundling employs a physical simulation to spatially group graph edges. While both useful and aesthetic, this technique has shortcomings: it bundles spatially proximal edges regardless of direction, weight, or graph connectivity. As a result, high-level directional edge patterns are obscured. We present divided edge bundling to tackle these shortcomings. By modifying the forces in the physical simulation, directional lanes appear as an emergent property of edge direction. By considering graph topology, we only bundle edges related by graph structure. Finally, we aggregate edge weights in bundles to enable more accurate visualization of total bundle weights. We compare visualizations created using our technique to standard force-directed edge bundling, matrix diagrams, and clustered graphs; we find that divided edge bundling leads to visualizations that are easier to interpret and reveal both familiar and previously obscured patterns.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The node-link diagram is an intuitive and venerable way to depict a graph. To reduce clutter and improve the readability of node-link views, Holten & van Wijk's force-directed edge bundling employs a physical simulation to spatially group graph edges. While both useful and aesthetic, this technique has shortcomings: it bundles spatially proximal edges regardless of direction, weight, or graph connectivity. As a result, high-level directional edge patterns are obscured. We present divided edge bundling to tackle these shortcomings. By modifying the forces in the physical simulation, directional lanes appear as an emergent property of edge direction. By considering graph topology, we only bundle edges related by graph structure. Finally, we aggregate edge weights in bundles to enable more accurate visualization of total bundle weights. We compare visualizations created using our technique to standard force-directed edge bundling, matrix diagrams, and clustered graphs; we find that divided edge bundling leads to visualizations that are easier to interpret and reveal both familiar and previously obscured patterns.",
"title": "Divided Edge Bundling for Directional Network Data",
"normalizedTitle": "Divided Edge Bundling for Directional Network Data",
"fno": "ttg2011122354",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Graph Visualization",
"Aggregation",
"Node Link Diagrams",
"Edge Bundling",
"Physical Simulation"
],
"authors": [
{
"givenName": "David",
"surname": "Selassie",
"fullName": "David Selassie",
"affiliation": "Stanford University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brandon",
"surname": "Heller",
"fullName": "Brandon Heller",
"affiliation": "Stanford University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeffrey",
"surname": "Heer",
"fullName": "Jeffrey Heer",
"affiliation": "Stanford University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "2354-2363",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2016/1451/0/07465267",
"title": "Multilayer graph edge bundling",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2016/07465267/12OmNCbCrKh",
"parentPublication": {
"id": "proceedings/pacificvis/2016/1451/0",
"title": "2016 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2013/4797/0/06596126",
"title": "Smooth bundling of large streaming and sequence graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596126/12OmNscfI0r",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742389",
"title": "Multilevel agglomerative edge bundling for visualizing large graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742389/12OmNxj233Y",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2013/5049/0/5049a028",
"title": "Edge Bundling by Rapidly-Exploring Random Trees",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2013/5049a028/12OmNz5s0F9",
"parentPublication": {
"id": "proceedings/iv/2013/5049/0",
"title": "2013 17th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2016/8942/0/8942a094",
"title": "On Edge Bundling and Node Layout for Mutually Connected Directed Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a094/12OmNzwZ6qg",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539373",
"title": "Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539373/13rRUwcS1CZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/12/07374742",
"title": "CUBu: Universal Real-Time Bundling for Large Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2016/12/07374742/13rRUwgQpDx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/05/ttg2012050810",
"title": "Ambiguity-Free Edge-Bundling for Interactive Graph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2012/05/ttg2012050810/13rRUxASuby",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2020/8468/0/846800a053",
"title": "A Distributed Algorithm for Force Directed Edge Bundling",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2020/846800a053/1pZ0Ti8Eb4s",
"parentPublication": {
"id": "proceedings/ldav/2020/8468/0",
"title": "2020 IEEE 10th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552919",
"title": "Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552919/1xibXgJW32U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011122344",
"articleId": "13rRUwIF6dM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011122364",
"articleId": "13rRUxjyX3W",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1H1gj9xTTG0",
"doi": "10.1109/TVCG.2022.3209472",
"abstract": "Visual perception is a key component of data visualization. Much prior empirical work uses eye movement as a <italic>proxy</italic> to understand human visual perception. Diverse apparatus and techniques have been proposed to collect eye movements, but there is still no optimal approach. In this paper, we review 30 prior works for collecting eye movements based on three axes: (1) the <italic>tracker</italic> technology used to measure eye movements; (2) the <italic>image stimulus</italic> shown to participants; and (3) the <italic>collection methodology</italic> used to gather the data. Based on this taxonomy, we employ a webcam-based eyetracking approach using task-specific visualizations as the stimulus. The low technology requirement means that virtually anyone can participate, thus enabling us to collect data at large scale using crowdsourcing: approximately 12,000 samples in total. Choosing visualization images as stimulus means that the eye movements will be specific to perceptual tasks associated with visualization. We use these data to propose a S<sc>canner</sc> D<sc>eeply</sc>, a virtual eyetracker model that, given an image of a visualization, generates a gaze heatmap for that image. We employ a computationally efficient, yet powerful convolutional neural network for our model. We compare the results of our work with results from the DVS model and a neural network trained on the Salicon dataset. The analysis of our gaze patterns enables us to understand how users grasp the <italic>structure</italic> of visualized data. We also make our stimulus dataset of visualization images available as part of this paper's contribution.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visual perception is a key component of data visualization. Much prior empirical work uses eye movement as a <italic>proxy</italic> to understand human visual perception. Diverse apparatus and techniques have been proposed to collect eye movements, but there is still no optimal approach. In this paper, we review 30 prior works for collecting eye movements based on three axes: (1) the <italic>tracker</italic> technology used to measure eye movements; (2) the <italic>image stimulus</italic> shown to participants; and (3) the <italic>collection methodology</italic> used to gather the data. Based on this taxonomy, we employ a webcam-based eyetracking approach using task-specific visualizations as the stimulus. The low technology requirement means that virtually anyone can participate, thus enabling us to collect data at large scale using crowdsourcing: approximately 12,000 samples in total. Choosing visualization images as stimulus means that the eye movements will be specific to perceptual tasks associated with visualization. We use these data to propose a S<sc>canner</sc> D<sc>eeply</sc>, a virtual eyetracker model that, given an image of a visualization, generates a gaze heatmap for that image. We employ a computationally efficient, yet powerful convolutional neural network for our model. We compare the results of our work with results from the DVS model and a neural network trained on the Salicon dataset. The analysis of our gaze patterns enables us to understand how users grasp the <italic>structure</italic> of visualized data. We also make our stimulus dataset of visualization images available as part of this paper's contribution.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visual perception is a key component of data visualization. Much prior empirical work uses eye movement as a proxy to understand human visual perception. Diverse apparatus and techniques have been proposed to collect eye movements, but there is still no optimal approach. In this paper, we review 30 prior works for collecting eye movements based on three axes: (1) the tracker technology used to measure eye movements; (2) the image stimulus shown to participants; and (3) the collection methodology used to gather the data. Based on this taxonomy, we employ a webcam-based eyetracking approach using task-specific visualizations as the stimulus. The low technology requirement means that virtually anyone can participate, thus enabling us to collect data at large scale using crowdsourcing: approximately 12,000 samples in total. Choosing visualization images as stimulus means that the eye movements will be specific to perceptual tasks associated with visualization. We use these data to propose a Scanner Deeply, a virtual eyetracker model that, given an image of a visualization, generates a gaze heatmap for that image. We employ a computationally efficient, yet powerful convolutional neural network for our model. We compare the results of our work with results from the DVS model and a neural network trained on the Salicon dataset. The analysis of our gaze patterns enables us to understand how users grasp the structure of visualized data. We also make our stimulus dataset of visualization images available as part of this paper's contribution.",
"title": "A Scanner Deeply: Predicting Gaze Heatmaps on Visualizations Using Crowdsourced Eye Movement Data",
"normalizedTitle": "A Scanner Deeply: Predicting Gaze Heatmaps on Visualizations Using Crowdsourced Eye Movement Data",
"fno": "09904490",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Vision",
"Data Analysis",
"Data Visualisation",
"Eye",
"Feature Extraction",
"Image Resolution",
"Learning Artificial Intelligence",
"Neural Nets",
"Visual Perception",
"Choosing Visualization Images",
"Crowdsourced Eye Movement Data",
"Data Visualization",
"Human Visual Perception",
"Task Specific Visualizations",
"Thestructureof Visualized Data",
"Data Visualization",
"Predictive Models",
"Crowdsourcing",
"Webcams",
"Visualization",
"Data Models",
"Task Analysis",
"Gaze Prediction",
"Visualization",
"Webcam Based Eye Tracking",
"Crowdsourcing",
"Deep Learning"
],
"authors": [
{
"givenName": "Sungbok",
"surname": "Shin",
"fullName": "Sungbok Shin",
"affiliation": "University of Maryland, College Park, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sunghyo",
"surname": "Chung",
"fullName": "Sunghyo Chung",
"affiliation": "Kakao Corp., South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sanghyun",
"surname": "Hong",
"fullName": "Sanghyun Hong",
"affiliation": "Oregon State University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Niklas",
"surname": "Elmqvist",
"fullName": "Niklas Elmqvist",
"affiliation": "University of Maryland, College Park, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "396-406",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgiv/2012/4778/0/4778a061",
"title": "Window to the Soul: Tracking Eyes to Inform the Design of Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2012/4778a061/12OmNzXWZIO",
"parentPublication": {
"id": "proceedings/cgiv/2012/4778/0",
"title": "2012 Ninth International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122421",
"title": "Does an Eye Tracker Tell the Truth about Visualizations?: Findings while Investigating Visualizations for Decision Making",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122421/13rRUILLkDN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/02/07414495",
"title": "Fauxvea: Crowdsourcing Gaze Location Estimates for Visualization Analysis Tasks",
"doi": null,
"abstractUrl": "/journal/tg/2017/02/07414495/13rRUwInvyE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/contie/2021/0821/0/082100a001",
"title": "Visual Preferences in children diagnosed with ASD by generating heatmaps with Eye Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/contie/2021/082100a001/1B12m9b1Qli",
"parentPublication": {
"id": "proceedings/contie/2021/0821/0",
"title": "2021 4th International Conference on Inclusive Technology and Education (CONTIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/09864267",
"title": "Few-Shot Class-Incremental Learning by Sampling Multi-Phase Tasks",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/09864267/1G2VUxCmmYg",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/01/09039632",
"title": "Steerable Self-Driving Data Visualization",
"doi": null,
"abstractUrl": "/journal/tk/2022/01/09039632/1igS2v9G6cw",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/11/09093972",
"title": "Heterogeneous Few-Shot Model Rectification With Semantic Mapping",
"doi": null,
"abstractUrl": "/journal/tp/2021/11/09093972/1jP8wDap5VC",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/02/09165928",
"title": "Hybrid Graph Visualizations With ChordLink: Algorithms, Experiments, and Applications",
"doi": null,
"abstractUrl": "/journal/tg/2022/02/09165928/1mevWoz3hM4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09556579",
"title": "STRATISFIMAL LAYOUT: A modular optimization model for laying out layered node-link network visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09556579/1xlw0LJ4OTm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/04/09664291",
"title": "EHTask: Recognizing User Tasks From Eye and Head Movements in Immersive Virtual Reality",
"doi": null,
"abstractUrl": "/journal/tg/2023/04/09664291/1zHDIPIlNBe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09905997",
"articleId": "1H3ZWHY73by",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09904487",
"articleId": "1H1geE4olvG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1HojAjSAGNq",
"doi": "10.1109/TVCG.2022.3213565",
"abstract": "Composite visualization is a popular design strategy that represents complex datasets by integrating multiple visualizations in a meaningful and aesthetic layout, such as juxtaposition, overlay, and nesting. With this strategy, numerous novel designs have been proposed in visualization publications to accomplish various visual analytic tasks. However, there is a lack of understanding of design patterns of composite visualization, thus failing to provide holistic design space and concrete examples for practical use. In this paper, we opted to revisit the composite visualizations in IEEE VIS publications and answered what and how visualizations of different types are composed together. To achieve this, we first constructed a corpus of composite visualizations from the publications and analyzed common practices, such as the pattern distributions and co-occurrence of visualization types. From the analysis, we obtained insights into different design patterns on the utilities and their potential pros and cons. Furthermore, we discussed usage scenarios of our taxonomy and corpus and how future research on visualization composition can be conducted on the basis of this study.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Composite visualization is a popular design strategy that represents complex datasets by integrating multiple visualizations in a meaningful and aesthetic layout, such as juxtaposition, overlay, and nesting. With this strategy, numerous novel designs have been proposed in visualization publications to accomplish various visual analytic tasks. However, there is a lack of understanding of design patterns of composite visualization, thus failing to provide holistic design space and concrete examples for practical use. In this paper, we opted to revisit the composite visualizations in IEEE VIS publications and answered what and how visualizations of different types are composed together. To achieve this, we first constructed a corpus of composite visualizations from the publications and analyzed common practices, such as the pattern distributions and co-occurrence of visualization types. From the analysis, we obtained insights into different design patterns on the utilities and their potential pros and cons. Furthermore, we discussed usage scenarios of our taxonomy and corpus and how future research on visualization composition can be conducted on the basis of this study.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Composite visualization is a popular design strategy that represents complex datasets by integrating multiple visualizations in a meaningful and aesthetic layout, such as juxtaposition, overlay, and nesting. With this strategy, numerous novel designs have been proposed in visualization publications to accomplish various visual analytic tasks. However, there is a lack of understanding of design patterns of composite visualization, thus failing to provide holistic design space and concrete examples for practical use. In this paper, we opted to revisit the composite visualizations in IEEE VIS publications and answered what and how visualizations of different types are composed together. To achieve this, we first constructed a corpus of composite visualizations from the publications and analyzed common practices, such as the pattern distributions and co-occurrence of visualization types. From the analysis, we obtained insights into different design patterns on the utilities and their potential pros and cons. Furthermore, we discussed usage scenarios of our taxonomy and corpus and how future research on visualization composition can be conducted on the basis of this study.",
"title": "Revisiting the Design Patterns of Composite Visualizations",
"normalizedTitle": "Revisiting the Design Patterns of Composite Visualizations",
"fno": "09916137",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Visualization",
"Taxonomy",
"Task Analysis",
"Layout",
"Grammar",
"Bars",
"Datasets",
"Visual Analytics",
"Visualization Specification",
"Visualization Design"
],
"authors": [
{
"givenName": "Dazhen",
"surname": "Deng",
"fullName": "Dazhen Deng",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weiwei",
"surname": "Cui",
"fullName": "Weiwei Cui",
"affiliation": "Microsoft Research Asia, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiyu",
"surname": "Meng",
"fullName": "Xiyu Meng",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mengye",
"surname": "Xu",
"fullName": "Mengye Xu",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yu",
"surname": "Liao",
"fullName": "Yu Liao",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haidong",
"surname": "Zhang",
"fullName": "Haidong Zhang",
"affiliation": "Microsoft Research Asia, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-10-01 00:00:00",
"pubType": "trans",
"pages": "1-16",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2017/5738/0/08031580",
"title": "Interaction+: Interaction enhancement for web-based visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031580/12OmNyQ7FJe",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/07/08354901",
"title": "Task-Based Effectiveness of Basic Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2019/07/08354901/13rRUwd9CLU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122679",
"title": "Design Considerations for Optimizing Storyline Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122679/13rRUwhHcQR",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/12/08233127",
"title": "Atom: A Grammar for Unit Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2018/12/08233127/14H4WLzSYsE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440836",
"title": "Dynamic Composite Data Physicalization Using Wheeled Micro-Robots",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440836/17D45WWzW3c",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlhcc/2018/4235/0/08506578",
"title": "Comparative Visualizations through Parameterization and Variability",
"doi": null,
"abstractUrl": "/proceedings-article/vlhcc/2018/08506578/17D45WaTki5",
"parentPublication": {
"id": "proceedings/vlhcc/2018/4235/0",
"title": "2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09984953",
"title": "VISAtlas: An Image-based Exploration and Query System for Large Visualization Collections via Neural Image Embedding",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09984953/1J6d2SwfUT6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/05/08744242",
"title": "Data2Vis: Automatic Generation of Data Visualizations Using Sequence-to-Sequence Recurrent Neural Networks",
"doi": null,
"abstractUrl": "/magazine/cg/2019/05/08744242/1cFV5domibu",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2019/5227/0/522700a084",
"title": "Comparing the Effectiveness of Visualizations of Different Data Distributions",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2019/522700a084/1fHloum4ISY",
"parentPublication": {
"id": "proceedings/sibgrapi/2019/5227/0",
"title": "2019 32nd SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09350177",
"title": "Net2Vis – A Visual Grammar for Automatically Generating Publication-Tailored CNN Architecture Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09350177/1r3l972fCk8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09916138",
"articleId": "1HojA9hKTO8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09919390",
"articleId": "1HsTAyyKsne",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1J6d2SwfUT6",
"doi": "10.1109/TVCG.2022.3229023",
"abstract": "High-quality visualization collections are beneficial for a variety of applications including visualization reference and data-driven visualization design. The visualization community has created many visualization collections, and developed interactive exploration systems for the collections. However, the systems are mainly based on extrinsic attributes like authors and publication years, whilst neglect intrinsic property (<italic>i.e</italic>., visual appearance) of visualizations, hindering visual comparison and query of visualization designs. This paper presents <italic>VISAtlas</italic>, an image-based approach empowered by neural image embedding, to facilitate exploration and query for visualization collections. To improve embedding accuracy, we create a comprehensive collection of synthetic and real-world visualizations, and use it to train a convolutional neural network (CNN) model with a triplet loss for taxonomical classification of visualizations. Next, we design a coordinated multiple view (CMV) system that enables multi-perspective exploration and design retrieval based on visualization embeddings. Specifically, we design a novel embedding overview that leverages contextual layout framework to preserve the context of the embedding vectors with the associated visualization taxonomies, and density plot and sampling techniques to address the overdrawing problem. We demonstrate in three case studies and one user study the effectiveness of <italic>VISAtlas</italic> in supporting comparative analysis of visualization collections, exploration of composite visualizations, and image-based retrieval of visualization designs. The studies reveal that real-world visualization collections (<italic>e.g</italic>., Beagle and VIS30K) better accord with the richness and diversity of visualization designs than synthetic collections (<italic>e.g</italic>., Data2Vis), inspiring composite visualizations are identified in real-world collections, and distinct design patterns exist in visualizations from different sources.",
"abstracts": [
{
"abstractType": "Regular",
"content": "High-quality visualization collections are beneficial for a variety of applications including visualization reference and data-driven visualization design. The visualization community has created many visualization collections, and developed interactive exploration systems for the collections. However, the systems are mainly based on extrinsic attributes like authors and publication years, whilst neglect intrinsic property (<italic>i.e</italic>., visual appearance) of visualizations, hindering visual comparison and query of visualization designs. This paper presents <italic>VISAtlas</italic>, an image-based approach empowered by neural image embedding, to facilitate exploration and query for visualization collections. To improve embedding accuracy, we create a comprehensive collection of synthetic and real-world visualizations, and use it to train a convolutional neural network (CNN) model with a triplet loss for taxonomical classification of visualizations. Next, we design a coordinated multiple view (CMV) system that enables multi-perspective exploration and design retrieval based on visualization embeddings. Specifically, we design a novel embedding overview that leverages contextual layout framework to preserve the context of the embedding vectors with the associated visualization taxonomies, and density plot and sampling techniques to address the overdrawing problem. We demonstrate in three case studies and one user study the effectiveness of <italic>VISAtlas</italic> in supporting comparative analysis of visualization collections, exploration of composite visualizations, and image-based retrieval of visualization designs. The studies reveal that real-world visualization collections (<italic>e.g</italic>., Beagle and VIS30K) better accord with the richness and diversity of visualization designs than synthetic collections (<italic>e.g</italic>., Data2Vis), inspiring composite visualizations are identified in real-world collections, and distinct design patterns exist in visualizations from different sources.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "High-quality visualization collections are beneficial for a variety of applications including visualization reference and data-driven visualization design. The visualization community has created many visualization collections, and developed interactive exploration systems for the collections. However, the systems are mainly based on extrinsic attributes like authors and publication years, whilst neglect intrinsic property (i.e., visual appearance) of visualizations, hindering visual comparison and query of visualization designs. This paper presents VISAtlas, an image-based approach empowered by neural image embedding, to facilitate exploration and query for visualization collections. To improve embedding accuracy, we create a comprehensive collection of synthetic and real-world visualizations, and use it to train a convolutional neural network (CNN) model with a triplet loss for taxonomical classification of visualizations. Next, we design a coordinated multiple view (CMV) system that enables multi-perspective exploration and design retrieval based on visualization embeddings. Specifically, we design a novel embedding overview that leverages contextual layout framework to preserve the context of the embedding vectors with the associated visualization taxonomies, and density plot and sampling techniques to address the overdrawing problem. We demonstrate in three case studies and one user study the effectiveness of VISAtlas in supporting comparative analysis of visualization collections, exploration of composite visualizations, and image-based retrieval of visualization designs. The studies reveal that real-world visualization collections (e.g., Beagle and VIS30K) better accord with the richness and diversity of visualization designs than synthetic collections (e.g., Data2Vis), inspiring composite visualizations are identified in real-world collections, and distinct design patterns exist in visualizations from different sources.",
"title": "VISAtlas: An Image-based Exploration and Query System for Large Visualization Collections via Neural Image Embedding",
"normalizedTitle": "VISAtlas: An Image-based Exploration and Query System for Large Visualization Collections via Neural Image Embedding",
"fno": "09984953",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Visualization",
"Feature Extraction",
"Task Analysis",
"Layout",
"Taxonomy",
"Semantics",
"Visualization Collection",
"Image Embedding",
"Visual Query",
"Image Visualization",
"Design Pattern"
],
"authors": [
{
"givenName": "Yilin",
"surname": "Ye",
"fullName": "Yilin Ye",
"affiliation": "Hong Kong University of Science and Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rong",
"surname": "Huang",
"fullName": "Rong Huang",
"affiliation": "Hong Kong University of Science and Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Zeng",
"fullName": "Wei Zeng",
"affiliation": "Hong Kong University of Science and Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "1-15",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2008/3268/0/3268a246",
"title": "Coordinated and Multiple Views for Visualizing Text Collections",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2008/3268a246/12OmNzBwGtI",
"parentPublication": {
"id": "proceedings/iv/2008/3268/0",
"title": "2008 12th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2010/05/mcg2010050032",
"title": "Newdle: Interactive Visual Exploration of Large Online News Collections",
"doi": null,
"abstractUrl": "/magazine/cg/2010/05/mcg2010050032/13rRUEgariC",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/07/08358974",
"title": "A Semantic-Based Method for Visualizing Large Image Collections",
"doi": null,
"abstractUrl": "/journal/tg/2019/07/08358974/13rRUxC0SP1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904442",
"title": "Communicating Uncertainty in Digital Humanities Visualization Research",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904442/1H1gpt871W8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09916137",
"title": "Revisiting the Design Patterns of Composite Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09916137/1HojAjSAGNq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/11/08713940",
"title": "Embedding Meta Information into Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2020/11/08713940/1a31n7yR8kM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/04/08880504",
"title": "Content-Based Visual Summarization for Image Collections",
"doi": null,
"abstractUrl": "/journal/tg/2021/04/08880504/1emyadTwt0Y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/01/09039632",
"title": "Steerable Self-Driving Data Visualization",
"doi": null,
"abstractUrl": "/journal/tk/2022/01/09039632/1igS2v9G6cw",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/11/09085893",
"title": "Contextual Translation Embedding for Visual Relationship Detection and Scene Graph Generation",
"doi": null,
"abstractUrl": "/journal/tp/2021/11/09085893/1jE1GK6vdWo",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552846",
"title": "A Critical Reflection on Visualization Research: Where Do Decision Making Tasks Hide?",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552846/1xibYOLsNc4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09984928",
"articleId": "1J6d2C45zpe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09987696",
"articleId": "1J7ROVH0hpu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1J7RPhWfcqY",
"name": "ttg555501-09984953s1-supp1-3229023.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09984953s1-supp1-3229023.mp4",
"extension": "mp4",
"size": "14.1 MB",
"__typename": "WebExtraType"
},
{
"id": "1J7RP9MHBM4",
"name": "ttg555501-09984953s1-supp2-3229023.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09984953s1-supp2-3229023.pdf",
"extension": "pdf",
"size": "1.22 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1zKXryr0JDG",
"title": "Feb.",
"year": "2022",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1mevWoz3hM4",
"doi": "10.1109/TVCG.2020.3016055",
"abstract": "Many real-world networks are globally sparse but locally dense. Typical examples are social networks, biological networks, and information networks. This double structural nature makes it difficult to adopt a homogeneous visualization model that clearly conveys both an overview of the network and the internal structure of its communities at the same time. As a consequence, the use of hybrid visualizations has been proposed. For instance, <sc>NodeTrix</sc> combines node-link and matrix-based representations (Henry <italic>et al.</italic>, 2007). In this article we describe <sc>ChordLink</sc>, a hybrid visualization model that embeds chord diagrams, used to represent dense subgraphs, into a node-link diagram, which shows the global network structure. The visualization makes it possible to interactively highlight the structure of a community while keeping the rest of the layout stable. We discuss the intriguing algorithmic challenges behind the <sc>ChordLink</sc> model, present a prototype system that implements it, and illustrate case studies on real-world networks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Many real-world networks are globally sparse but locally dense. Typical examples are social networks, biological networks, and information networks. This double structural nature makes it difficult to adopt a homogeneous visualization model that clearly conveys both an overview of the network and the internal structure of its communities at the same time. As a consequence, the use of hybrid visualizations has been proposed. For instance, <sc>NodeTrix</sc> combines node-link and matrix-based representations (Henry <italic>et al.</italic>, 2007). In this article we describe <sc>ChordLink</sc>, a hybrid visualization model that embeds chord diagrams, used to represent dense subgraphs, into a node-link diagram, which shows the global network structure. The visualization makes it possible to interactively highlight the structure of a community while keeping the rest of the layout stable. We discuss the intriguing algorithmic challenges behind the <sc>ChordLink</sc> model, present a prototype system that implements it, and illustrate case studies on real-world networks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Many real-world networks are globally sparse but locally dense. Typical examples are social networks, biological networks, and information networks. This double structural nature makes it difficult to adopt a homogeneous visualization model that clearly conveys both an overview of the network and the internal structure of its communities at the same time. As a consequence, the use of hybrid visualizations has been proposed. For instance, NodeTrix combines node-link and matrix-based representations (Henry et al., 2007). In this article we describe ChordLink, a hybrid visualization model that embeds chord diagrams, used to represent dense subgraphs, into a node-link diagram, which shows the global network structure. The visualization makes it possible to interactively highlight the structure of a community while keeping the rest of the layout stable. We discuss the intriguing algorithmic challenges behind the ChordLink model, present a prototype system that implements it, and illustrate case studies on real-world networks.",
"title": "Hybrid Graph Visualizations With ChordLink: Algorithms, Experiments, and Applications",
"normalizedTitle": "Hybrid Graph Visualizations With ChordLink: Algorithms, Experiments, and Applications",
"fno": "09165928",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Graph Theory",
"Social Networking Online",
"Real World Networks",
"Typical Examples",
"Social Networks",
"Biological Networks",
"Information Networks",
"Double Structural Nature",
"Homogeneous Visualization Model",
"Internal Structure",
"Hybrid Visualizations",
"Matrix Based Representations",
"Hybrid Visualization Model",
"Chord Diagrams",
"Dense Subgraphs",
"Node Link Diagram",
"Global Network Structure",
"Intriguing Algorithmic Challenges",
"Chord Link Model",
"Hybrid Graph Visualizations",
"Visualization",
"Layout",
"Task Analysis",
"Semiconductor Device Modeling",
"Prototypes",
"Sparse Matrices",
"Stability Analysis",
"Network Visualization",
"Graph Drawing",
"Hybrid Visualization",
"Chord Diagrams",
"Optimization Algorithms",
"Systems"
],
"authors": [
{
"givenName": "Lorenzo",
"surname": "Angori",
"fullName": "Lorenzo Angori",
"affiliation": "Dipartimento di Ingegneria, Università degli Studi di Perugia, Perugia, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Walter",
"surname": "Didimo",
"fullName": "Walter Didimo",
"affiliation": "Dipartimento di Ingegneria, Università degli Studi di Perugia, Perugia, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fabrizio",
"surname": "Montecchiani",
"fullName": "Fabrizio Montecchiani",
"affiliation": "Dipartimento di Ingegneria, Università degli Studi di Perugia, Perugia, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniele",
"surname": "Pagliuca",
"fullName": "Daniele Pagliuca",
"affiliation": "Agenzia delle Entrate, Arezzo, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alessandra",
"surname": "Tappini",
"fullName": "Alessandra Tappini",
"affiliation": "Dipartimento di Ingegneria, Università degli Studi di Perugia, Perugia, Italy",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2022-02-01 00:00:00",
"pubType": "trans",
"pages": "1288-1300",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tp/2019/05/08344546",
"title": "What Makes Objects Similar: A Unified Multi-Metric Learning Approach",
"doi": null,
"abstractUrl": "/journal/tp/2019/05/08344546/13rRUNvgyXK",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1302",
"title": "NodeTrix: a Hybrid Visualization of Social Networks",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1302/13rRUyYjKa7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904490",
"title": "A Scanner Deeply: Predicting Gaze Heatmaps on Visualizations Using Crowdsourced Eye Movement Data",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904490/1H1gj9xTTG0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10004748",
"title": "Comparative Study and Evaluation of Hybrid Visualizations of Graphs",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10004748/1JC5xZN3afu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10056277",
"title": "Knowledge Graph Augmented Network Towards Multiview Representation Learning for Aspect-based Sentiment Analysis",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10056277/1L8lMjK738Y",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/06/09115859",
"title": "Structured Knowledge Distillation for Dense Prediction",
"doi": null,
"abstractUrl": "/journal/tp/2023/06/09115859/1kBgINgUI92",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/02/09238399",
"title": "<sc>Cartolabe</sc>: A Web-Based Scalable Visualization of Large Document Collections",
"doi": null,
"abstractUrl": "/magazine/cg/2021/02/09238399/1oa1KJAPKOA",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/09/09394783",
"title": "GeCNs: Graph Elastic Convolutional Networks for Data Representation",
"doi": null,
"abstractUrl": "/journal/tp/2022/09/09394783/1strfOg4pIk",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2023/02/09446637",
"title": "Ambassy: A Runtime Framework to Delegate Trusted Applications in an ARM/FPGA Hybrid System",
"doi": null,
"abstractUrl": "/journal/tm/2023/02/09446637/1u8ly4Dd5qo",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09556579",
"title": "STRATISFIMAL LAYOUT: A modular optimization model for laying out layered node-link network visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09556579/1xlw0LJ4OTm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09157962",
"articleId": "1m1eKuAoOoE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09145640",
"articleId": "1lE0csLCf6g",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zKXrGXgeHK",
"name": "ttg202202-09165928s1-supp1-3016055.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202202-09165928s1-supp1-3016055.pdf",
"extension": "pdf",
"size": "1.95 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNB8Cj4K",
"title": "August",
"year": "2010",
"issueNum": "08",
"idPrefix": "tk",
"pubType": "journal",
"volume": "22",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxly9el",
"doi": "10.1109/TKDE.2010.67",
"abstract": "Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network traffic data, and pattern matching over users' visiting logs. However, most of the existing works focus on search over static graph databases, while in many real applications, graphs are changing over time. In this paper, we investigate a new problem on continuous subgraph pattern search under the situation where multiple target graphs are constantly changing in a stream style, namely, the subgraph pattern search over graph streams. Obviously, the proposed problem is a continuous join between query patterns and graph streams where the join predicate is the existence of subgraph isomorphism. Due to the NP-completeness of subgraph isomorphism checking, to achieve the real-time monitoring of the existence of certain subgraph patterns, we would like to avoid using subgraph isomorphism verification to find the exact query-stream subgraph isomorphic pairs but to offer an approximate answer that could report all probable pairs without missing any actual answer pairs. Therefore, we propose a lightweight yet effective feature structure called Node-Neighbor Tree to filter out false candidate query-stream pairs. To reduce the computational cost, we propose a novel idea, projecting the feature structures into a numerical vector space and conducting dominant relationship checking in the projected space. We design two methods to efficiently verify dominant relationships, and thus, answer the subgraph search over graph streams efficiently. In addition to answering queries over certain graph streams, we propose a novel problem, detecting the appearance of subgraph patterns over uncertain graph streams with high probability (i.e., larger than the probability threshold specified by users). To address this problem, we not only extend the proposed solutions for certain graphs streams, but also propose a new pruning technique by utilizing the probability threshold. We substantiate our methods with extensive experiments on both certain and uncertain graph streams.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network traffic data, and pattern matching over users' visiting logs. However, most of the existing works focus on search over static graph databases, while in many real applications, graphs are changing over time. In this paper, we investigate a new problem on continuous subgraph pattern search under the situation where multiple target graphs are constantly changing in a stream style, namely, the subgraph pattern search over graph streams. Obviously, the proposed problem is a continuous join between query patterns and graph streams where the join predicate is the existence of subgraph isomorphism. Due to the NP-completeness of subgraph isomorphism checking, to achieve the real-time monitoring of the existence of certain subgraph patterns, we would like to avoid using subgraph isomorphism verification to find the exact query-stream subgraph isomorphic pairs but to offer an approximate answer that could report all probable pairs without missing any actual answer pairs. Therefore, we propose a lightweight yet effective feature structure called Node-Neighbor Tree to filter out false candidate query-stream pairs. To reduce the computational cost, we propose a novel idea, projecting the feature structures into a numerical vector space and conducting dominant relationship checking in the projected space. We design two methods to efficiently verify dominant relationships, and thus, answer the subgraph search over graph streams efficiently. In addition to answering queries over certain graph streams, we propose a novel problem, detecting the appearance of subgraph patterns over uncertain graph streams with high probability (i.e., larger than the probability threshold specified by users). To address this problem, we not only extend the proposed solutions for certain graphs streams, but also propose a new pruning technique by utilizing the probability threshold. We substantiate our methods with extensive experiments on both certain and uncertain graph streams.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network traffic data, and pattern matching over users' visiting logs. However, most of the existing works focus on search over static graph databases, while in many real applications, graphs are changing over time. In this paper, we investigate a new problem on continuous subgraph pattern search under the situation where multiple target graphs are constantly changing in a stream style, namely, the subgraph pattern search over graph streams. Obviously, the proposed problem is a continuous join between query patterns and graph streams where the join predicate is the existence of subgraph isomorphism. Due to the NP-completeness of subgraph isomorphism checking, to achieve the real-time monitoring of the existence of certain subgraph patterns, we would like to avoid using subgraph isomorphism verification to find the exact query-stream subgraph isomorphic pairs but to offer an approximate answer that could report all probable pairs without missing any actual answer pairs. Therefore, we propose a lightweight yet effective feature structure called Node-Neighbor Tree to filter out false candidate query-stream pairs. To reduce the computational cost, we propose a novel idea, projecting the feature structures into a numerical vector space and conducting dominant relationship checking in the projected space. We design two methods to efficiently verify dominant relationships, and thus, answer the subgraph search over graph streams efficiently. In addition to answering queries over certain graph streams, we propose a novel problem, detecting the appearance of subgraph patterns over uncertain graph streams with high probability (i.e., larger than the probability threshold specified by users). To address this problem, we not only extend the proposed solutions for certain graphs streams, but also propose a new pruning technique by utilizing the probability threshold. We substantiate our methods with extensive experiments on both certain and uncertain graph streams.",
"title": "Continuous Subgraph Pattern Search over Certain and Uncertain Graph Streams",
"normalizedTitle": "Continuous Subgraph Pattern Search over Certain and Uncertain Graph Streams",
"fno": "ttk2010081093",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Subgraph Search",
"Node Neighbor Tree",
"Graph Streams",
"Uncertain Graph Streams"
],
"authors": [
{
"givenName": "Lei",
"surname": "Chen",
"fullName": "Lei Chen",
"affiliation": "Hong Kong University of Science and Technology , Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Changliang",
"surname": "Wang",
"fullName": "Changliang Wang",
"affiliation": "EMC, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2010-08-01 00:00:00",
"pubType": "trans",
"pages": "1093-1109",
"year": "2010",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2008/3502/0/3502a283",
"title": "Metropolis Algorithms for Representative Subgraph Sampling",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2008/3502a283/12OmNBOUxjB",
"parentPublication": {
"id": "proceedings/icdm/2008/3502/0",
"title": "2008 Eighth IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408b272",
"title": "A Study of Laplacian Spectra of Graph for Subgraph Queries",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408b272/12OmNweBUPv",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2009/3545/0/3545a393",
"title": "Continuous Subgraph Pattern Search over Graph Streams",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2009/3545a393/12OmNyPQ4yV",
"parentPublication": {
"id": "proceedings/icde/2009/3545/0",
"title": "2009 IEEE 25th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2016/9005/0/07840996",
"title": "Distributed exact subgraph matching in small diameter dynamic graphs",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2016/07840996/12OmNyYm2pz",
"parentPublication": {
"id": "proceedings/big-data/2016/9005/0",
"title": "2016 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2011/11/ttk2011111718",
"title": "Similarity Join Processing on Uncertain Data Streams",
"doi": null,
"abstractUrl": "/journal/tk/2011/11/ttk2011111718/13rRUNvgzaf",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2000/02/k0307",
"title": "Efficient Subgraph Isomorphism Detection: A Decomposition Approach",
"doi": null,
"abstractUrl": "/journal/tk/2000/02/k0307/13rRUwdIOV4",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1999/09/i0917",
"title": "Error Correcting Graph Matching: On the Influence of the Underlying Cost Function",
"doi": null,
"abstractUrl": "/journal/tp/1999/09/i0917/13rRUxNEqR1",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1998/05/i0493",
"title": "A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection",
"doi": null,
"abstractUrl": "/journal/tp/1998/05/i0493/13rRUygT7gb",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2010/09/ttk2010091203",
"title": "Mining Frequent Subgraph Patterns from Uncertain Graph Data",
"doi": null,
"abstractUrl": "/journal/tk/2010/09/ttk2010091203/13rRUyoPSPr",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400a220",
"title": "Scaling Up Subgraph Query Processing with Efficient Subgraph Matching",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400a220/1aDSWRCnFEA",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2010081077",
"articleId": "13rRUxcsYMm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2010081110",
"articleId": "13rRUxZ0o1U",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxdm4Ew",
"title": "March",
"year": "2016",
"issueNum": "03",
"idPrefix": "tk",
"pubType": "journal",
"volume": "28",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIM2VHt",
"doi": "10.1109/TKDE.2015.2496344",
"abstract": "Recently, location-based social networks (LBSNs) gave the opportunity to users to share geo-tagged information along with photos, videos, and SMSs. Recommender systems can exploit this geographic information to provide much more accurate and reliable recommendations to users. In this paper, we present and compare 16 real life LBSNs, bringing into surface their advantages/disadvantages, their special functionalities, and their impact in the mobile social Web. Moreover, we describe and compare extensively 43 state-of-the-art recommendation algorithms for LBSNs. We categorize these algorithms according to: personalization type, recommendation type, data factors/features, problem modeling methodology, and data representation. In addition to the above categorizations which cannot cover all algorithms in an integrated way, we also propose a hybrid <inline-formula><tex-math>$k$_Z</tex-math></inline-formula>-partite graph taxonomy to categorize them based on the number of the involved <inline-formula><tex-math>$k$_Z</tex-math></inline-formula>-partite graphs. Finally, we compare the recommendation algorithms with respect to their evaluation methodology (i.e., datasets and metrics) and we highlight new perspectives for future work in LBSNs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recently, location-based social networks (LBSNs) gave the opportunity to users to share geo-tagged information along with photos, videos, and SMSs. Recommender systems can exploit this geographic information to provide much more accurate and reliable recommendations to users. In this paper, we present and compare 16 real life LBSNs, bringing into surface their advantages/disadvantages, their special functionalities, and their impact in the mobile social Web. Moreover, we describe and compare extensively 43 state-of-the-art recommendation algorithms for LBSNs. We categorize these algorithms according to: personalization type, recommendation type, data factors/features, problem modeling methodology, and data representation. In addition to the above categorizations which cannot cover all algorithms in an integrated way, we also propose a hybrid <inline-formula><tex-math>$k$</tex-math><alternatives> <inline-graphic xlink:type=\"simple\" xlink:href=\"kefalas-ieq1-2496344.gif\"/></alternatives></inline-formula>-partite graph taxonomy to categorize them based on the number of the involved <inline-formula><tex-math>$k$</tex-math><alternatives> <inline-graphic xlink:type=\"simple\" xlink:href=\"kefalas-ieq2-2496344.gif\"/></alternatives></inline-formula>-partite graphs. Finally, we compare the recommendation algorithms with respect to their evaluation methodology (i.e., datasets and metrics) and we highlight new perspectives for future work in LBSNs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recently, location-based social networks (LBSNs) gave the opportunity to users to share geo-tagged information along with photos, videos, and SMSs. Recommender systems can exploit this geographic information to provide much more accurate and reliable recommendations to users. In this paper, we present and compare 16 real life LBSNs, bringing into surface their advantages/disadvantages, their special functionalities, and their impact in the mobile social Web. Moreover, we describe and compare extensively 43 state-of-the-art recommendation algorithms for LBSNs. We categorize these algorithms according to: personalization type, recommendation type, data factors/features, problem modeling methodology, and data representation. In addition to the above categorizations which cannot cover all algorithms in an integrated way, we also propose a hybrid --partite graph taxonomy to categorize them based on the number of the involved --partite graphs. Finally, we compare the recommendation algorithms with respect to their evaluation methodology (i.e., datasets and metrics) and we highlight new perspectives for future work in LBSNs.",
"title": "A Graph-Based Taxonomy of Recommendation Algorithms and Systems in LBSNs",
"normalizedTitle": "A Graph-Based Taxonomy of Recommendation Algorithms and Systems in LBSNs",
"fno": "07312976",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Graph Theory",
"Internet",
"Mobile Computing",
"Recommender Systems",
"Social Networking Online",
"Mobile Social Web",
"LBSN",
"Location Based Social Network",
"Recommender System",
"Recommendation Algorithm",
"Hybrid K Partite Graph Taxonomy",
"Taxonomy",
"Data Models",
"Facebook",
"Recommender Systems",
"Trajectory",
"Clustering Algorithms",
"Recommender Systems",
"Location Based Recommendations",
"Recommender Systems",
"Location Based Recommendations"
],
"authors": [
{
"givenName": "Pavlos",
"surname": "Kefalas",
"fullName": "Pavlos Kefalas",
"affiliation": "Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Panagiotis",
"surname": "Symeonidis",
"fullName": "Panagiotis Symeonidis",
"affiliation": "Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yannis",
"surname": "Manolopoulos",
"fullName": "Yannis Manolopoulos",
"affiliation": "Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2016-03-01 00:00:00",
"pubType": "trans",
"pages": "604-622",
"year": "2016",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tk/2018/04/08118111",
"title": "Reverse Z_$k$_Z Nearest Neighbor Search over Trajectories",
"doi": null,
"abstractUrl": "/journal/tk/2018/04/08118111/13rRUwInvtg",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2018/04/08118127",
"title": "Community Deception or: How to Stop Fearing Community Detection Algorithms",
"doi": null,
"abstractUrl": "/journal/tk/2018/04/08118127/13rRUxYINfQ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09712412",
"title": "Centerless Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09712412/1AZKZVM8b84",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/05/09720081",
"title": "Accelerating Graph Similarity Search via Efficient GED Computation",
"doi": null,
"abstractUrl": "/journal/tk/2023/05/09720081/1Bef4rodeLK",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2022/01/09128029",
"title": "Queuing Over Ever-Changing Communication Scenarios in Tactical Networks",
"doi": null,
"abstractUrl": "/journal/tm/2022/01/09128029/1l3uixrN1eg",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/07/09189818",
"title": "Fully Dynamic <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Center Clustering With Improved Memory Efficiency",
"doi": null,
"abstractUrl": "/journal/tk/2022/07/09189818/1mYZ9fnEFq0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/08/09210070",
"title": "Periodic Communities Mining in Temporal Networks: Concepts and Algorithms",
"doi": null,
"abstractUrl": "/journal/tk/2022/08/09210070/1nxQ8MeuyY0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/08/09210126",
"title": "Truss-Based Structural Diversity Search in Large Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2022/08/09210126/1nxQ8gROGQ0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/06/09309172",
"title": "Detecting Meaningful Clusters From High-Dimensional Data: A Strongly Consistent Sparse Center-Based Clustering Approach",
"doi": null,
"abstractUrl": "/journal/tp/2022/06/09309172/1pQEdzozLwY",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09463735",
"title": "Signed Graph Metric Learning via Gershgorin Disc Perfect Alignment",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09463735/1uFxm1okYhO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07296664",
"articleId": "13rRUyYjKaT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07300428",
"articleId": "13rRUxBJhvW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1qLhZwxtEmA",
"title": "March",
"year": "2021",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1dgv8seoz5u",
"doi": "10.1109/TVCG.2019.2940935",
"abstract": "Unsupervised clustering techniques have been widely applied to flow simulation data to alleviate clutter and occlusion in the resulting visualization. However, there is an absence of systematic guidelines for users to evaluate (both quantitatively and visually) the appropriate clustering technique and similarity measures for streamline and pathline curves. In this work, we provide an overview of a number of prevailing curve clustering techniques. We then perform a comprehensive experimental study to qualitatively and quantitatively compare these clustering techniques coupled with popular similarity measures used in the flow visualization literature. Based on our experimental results, we derive empirical guidelines for selecting the appropriate clustering technique and similarity measure given the requirements of the visualization task. We believe our work will inform the task of generating meaningful reduced representations for large-scale flow data and inspire the continuous investigation of a more refined guidance on clustering technique selection.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Unsupervised clustering techniques have been widely applied to flow simulation data to alleviate clutter and occlusion in the resulting visualization. However, there is an absence of systematic guidelines for users to evaluate (both quantitatively and visually) the appropriate clustering technique and similarity measures for streamline and pathline curves. In this work, we provide an overview of a number of prevailing curve clustering techniques. We then perform a comprehensive experimental study to qualitatively and quantitatively compare these clustering techniques coupled with popular similarity measures used in the flow visualization literature. Based on our experimental results, we derive empirical guidelines for selecting the appropriate clustering technique and similarity measure given the requirements of the visualization task. We believe our work will inform the task of generating meaningful reduced representations for large-scale flow data and inspire the continuous investigation of a more refined guidance on clustering technique selection.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Unsupervised clustering techniques have been widely applied to flow simulation data to alleviate clutter and occlusion in the resulting visualization. However, there is an absence of systematic guidelines for users to evaluate (both quantitatively and visually) the appropriate clustering technique and similarity measures for streamline and pathline curves. In this work, we provide an overview of a number of prevailing curve clustering techniques. We then perform a comprehensive experimental study to qualitatively and quantitatively compare these clustering techniques coupled with popular similarity measures used in the flow visualization literature. Based on our experimental results, we derive empirical guidelines for selecting the appropriate clustering technique and similarity measure given the requirements of the visualization task. We believe our work will inform the task of generating meaningful reduced representations for large-scale flow data and inspire the continuous investigation of a more refined guidance on clustering technique selection.",
"title": "Integral Curve Clustering and Simplification for Flow Visualization: A Comparative Evaluation",
"normalizedTitle": "Integral Curve Clustering and Simplification for Flow Visualization: A Comparative Evaluation",
"fno": "08834822",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Fluid Dynamics",
"Curve Fitting",
"Data Visualisation",
"Flow Simulation",
"Flow Visualisation",
"Pattern Clustering",
"Unsupervised Learning",
"Visualization Task",
"Large Scale Flow Data",
"Clustering Technique Selection",
"Integral Curve Clustering",
"Comparative Evaluation",
"Unsupervised Clustering Techniques",
"Prevailing Curve Clustering Techniques",
"Similarity Measures",
"Flow Visualization",
"Streamline Curves",
"Pathline Curves",
"Flow Simulation Data",
"Occlusion",
"Data Visualization",
"Shape",
"Clustering Algorithms",
"Guidelines",
"Complexity Theory",
"Clustering Methods",
"Data Models",
"Clustering Technique",
"Similarity Measures",
"Flow Visualization",
"Experimental Study",
"Empirical Guidelines",
"Quantitative Comparisons"
],
"authors": [
{
"givenName": "Lieyu",
"surname": "Shi",
"fullName": "Lieyu Shi",
"affiliation": "Department of Computer Science, University of Houston, Houston, TX, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert S.",
"surname": "Laramee",
"fullName": "Robert S. Laramee",
"affiliation": "Department of Computer Science, Swansea University, Wales, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guoning",
"surname": "Chen",
"fullName": "Guoning Chen",
"affiliation": "Department of Computer Science, University of Houston, Houston, TX, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2021-03-01 00:00:00",
"pubType": "trans",
"pages": "1967-1985",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icicta/2008/3357/2/3357c243",
"title": "Data Analysis of Vessel Traffic Flow Using Clustering Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2008/3357c243/12OmNrF2DJU",
"parentPublication": {
"id": "icicta/2008/3357/2",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a009",
"title": "FlowString: Partial Streamline Matching Using Shape Invariant Similarity Measure for Exploratory Flow Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a009/12OmNvjQ8PN",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicse/2015/0454/0/0454a117",
"title": "Hull Section Cluster Analysis Based on Principle of Similitude",
"doi": null,
"abstractUrl": "/proceedings-article/icicse/2015/0454a117/12OmNwO5LTs",
"parentPublication": {
"id": "proceedings/icicse/2015/0454/0",
"title": "2015 Eighth International Conference on Internet Computing for Science and Engineering (ICICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichi/2015/9548/0/9548a180",
"title": "Flow-SNE: A New Approach for Flow Cytometry Clustering and Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2015/9548a180/12OmNzC5T3e",
"parentPublication": {
"id": "proceedings/ichi/2015/9548/0",
"title": "2015 International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/05/07117453",
"title": "A Vocabulary Approach to Partial Streamline Matching and Exploratory Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2016/05/07117453/13rRUEgs2C0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061587",
"title": "Visualizing Flow Trajectories Using Locality-based Rendering and Warped Curve Plots",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061587/13rRUNvgz9E",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017616",
"title": "Clustering Trajectories by Relevant Parts for Air Traffic Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017616/13rRUyY294H",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aivr/2018/9269/0/926900a274",
"title": "Planar Simplification of Indoor Point-Cloud Environments",
"doi": null,
"abstractUrl": "/proceedings-article/aivr/2018/926900a274/17D45VtKisU",
"parentPublication": {
"id": "proceedings/aivr/2018/9269/0",
"title": "2018 IEEE International Conference on Artificial Intelligence and Virtual Reality (AIVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/12/09139395",
"title": "A Discrete Probabilistic Approach to Dense Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2021/12/09139395/1ls93653hoQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/secdev/2020/8388/0/838800a074",
"title": "Network Attack Surface Simplification for Red and Blue Teams",
"doi": null,
"abstractUrl": "/proceedings-article/secdev/2020/838800a074/1o6LpdDagPC",
"parentPublication": {
"id": "proceedings/secdev/2020/8388/0",
"title": "2020 IEEE Secure Development (SecDev)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08865441",
"articleId": "1e2DgJkkm0E",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08836104",
"articleId": "1dia07zRywg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLialAUJEY",
"name": "ttg202103-08834822s1-tvcg-shi-2940935-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202103-08834822s1-tvcg-shi-2940935-mm.zip",
"extension": "zip",
"size": "50.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1HMOit1lSk8",
"title": "Dec.",
"year": "2022",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1u51xYbTfmU",
"doi": "10.1109/TVCG.2021.3085751",
"abstract": "Visualization recommendation (VisRec) systems provide users with suggestions for potentially interesting and useful next steps during exploratory data analysis. These recommendations are typically organized into categories based on their analytical actions, i.e., operations employed to transition from the current exploration state to a recommended visualization. However, despite the emergence of a plethora of VisRec systems in recent work, the utility of the categories employed by these systems in analytical workflows has not been systematically investigated. Our article explores the efficacy of recommendation categories by formalizing a taxonomy of common categories and developing a system, <italic>Frontier</italic>, that implements these categories. Using <italic>Frontier</italic>, we evaluate workflow strategies adopted by users and how categories influence those strategies. Participants found recommendations that add attributes to enhance the current visualization and recommendations that filter to sub-populations to be comparatively most useful during data exploration. Our findings pave the way for next-generation VisRec systems that are adaptive and personalized via carefully chosen, effective recommendation categories.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visualization recommendation (VisRec) systems provide users with suggestions for potentially interesting and useful next steps during exploratory data analysis. These recommendations are typically organized into categories based on their analytical actions, i.e., operations employed to transition from the current exploration state to a recommended visualization. However, despite the emergence of a plethora of VisRec systems in recent work, the utility of the categories employed by these systems in analytical workflows has not been systematically investigated. Our article explores the efficacy of recommendation categories by formalizing a taxonomy of common categories and developing a system, <italic>Frontier</italic>, that implements these categories. Using <italic>Frontier</italic>, we evaluate workflow strategies adopted by users and how categories influence those strategies. Participants found recommendations that add attributes to enhance the current visualization and recommendations that filter to sub-populations to be comparatively most useful during data exploration. Our findings pave the way for next-generation VisRec systems that are adaptive and personalized via carefully chosen, effective recommendation categories.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visualization recommendation (VisRec) systems provide users with suggestions for potentially interesting and useful next steps during exploratory data analysis. These recommendations are typically organized into categories based on their analytical actions, i.e., operations employed to transition from the current exploration state to a recommended visualization. However, despite the emergence of a plethora of VisRec systems in recent work, the utility of the categories employed by these systems in analytical workflows has not been systematically investigated. Our article explores the efficacy of recommendation categories by formalizing a taxonomy of common categories and developing a system, Frontier, that implements these categories. Using Frontier, we evaluate workflow strategies adopted by users and how categories influence those strategies. Participants found recommendations that add attributes to enhance the current visualization and recommendations that filter to sub-populations to be comparatively most useful during data exploration. Our findings pave the way for next-generation VisRec systems that are adaptive and personalized via carefully chosen, effective recommendation categories.",
"title": "Deconstructing Categorization in Visualization Recommendation: A Taxonomy and Comparative Study",
"normalizedTitle": "Deconstructing Categorization in Visualization Recommendation: A Taxonomy and Comparative Study",
"fno": "09444894",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Recommender Systems",
"Analytical Workflows",
"Data Exploration",
"Effective Recommendation Categories",
"Exploratory Data Analysis",
"Frontier",
"Next Generation Vis Rec Systems",
"Taxonomy",
"Visualization Recommendation Systems",
"Workflow Strategies",
"Data Visualization",
"Visualization",
"Knowledge Discovery",
"Encoding",
"Recommender Systems",
"Task Analysis",
"Visual Analytics",
"Visual Analysis",
"Analytical Workflow",
"Discovery Driven Analysis",
"Visualization Recommendations"
],
"authors": [
{
"givenName": "Doris Jung-Lin",
"surname": "Lee",
"fullName": "Doris Jung-Lin Lee",
"affiliation": "University of California, Berkeley, Berkeley, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vidya",
"surname": "Setlur",
"fullName": "Vidya Setlur",
"affiliation": "Tableau Research, Palo Alto, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Melanie",
"surname": "Tory",
"fullName": "Melanie Tory",
"affiliation": "Northeastern University, Boston, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Karrie",
"surname": "Karahalios",
"fullName": "Karrie Karahalios",
"affiliation": "Urbana-Champaign, University of Illinois, Champaign, IL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aditya",
"surname": "Parameswaran",
"fullName": "Aditya Parameswaran",
"affiliation": "University of California, Berkeley, Berkeley, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "4225-4239",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2016/5661/0/07883512",
"title": "EventAction: Visual analytics for temporal event sequence recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2016/07883512/12OmNBDQbnR",
"parentPublication": {
"id": "proceedings/vast/2016/5661/0",
"title": "2016 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2008/3440/2/3440b113",
"title": "Exploiting Item Taxonomy for Solving Cold-Start Problem in Recommendation Making",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2008/3440b113/12OmNylsZAM",
"parentPublication": {
"id": "proceedings/ictai/2008/3440/2",
"title": "2008 20th IEEE International Conference on Tools with Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2016/03/07312976",
"title": "A Graph-Based Taxonomy of Recommendation Algorithms and Systems in LBSNs",
"doi": null,
"abstractUrl": "/journal/tk/2016/03/07312976/13rRUIM2VHt",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2020/08/08669792",
"title": "Explainable Outfit Recommendation with Joint Outfit Matching and Comment Generation",
"doi": null,
"abstractUrl": "/journal/tk/2020/08/08669792/18wJ1EmMMrm",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09950351",
"title": "Latent Structure Mining With Contrastive Modality Fusion for Multimedia Recommendation",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09950351/1IiLdId5MdO",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10015846",
"title": "Dual-View Preference Learning for Adaptive Recommendation",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10015846/1JSl2YaejFm",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aivr/2022/5725/0/572500a157",
"title": "Touching the Explanations: Explaining Movie Recommendation Scores in Mobile Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/aivr/2022/572500a157/1KmFaCkhwPK",
"parentPublication": {
"id": "proceedings/aivr/2022/5725/0",
"title": "2022 IEEE International Conference on Artificial Intelligence and Virtual Reality (AIVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2021/04/08731725",
"title": "Distributing Tourists among POIs with an Adaptive Trip Recommendation System",
"doi": null,
"abstractUrl": "/journal/ec/2021/04/08731725/1aCbIvm1djW",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2020/07/08453850",
"title": "Does Reviewer Recommendation Help Developers?",
"doi": null,
"abstractUrl": "/journal/ts/2020/07/08453850/1lu2QK4YlNK",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09508898",
"title": "Towards Systematic Design Considerations for Visualizing Cross-View Data Relationships",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09508898/1vQzkzRdSWk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09444657",
"articleId": "1u3mEKfpEwU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09444887",
"articleId": "1u51yNn52s8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1HMOkpES9K8",
"name": "ttg202212-09444894s1-supp1-3085751.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202212-09444894s1-supp1-3085751.mp4",
"extension": "mp4",
"size": "65.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1HMOit1lSk8",
"title": "Dec.",
"year": "2022",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1wpqlzOa8G4",
"doi": "10.1109/TVCG.2021.3107749",
"abstract": "Genomic Epidemiology (genEpi) is a branch of public health that uses many different data types including tabular, network, genomic, and geographic, to identify and contain outbreaks of deadly diseases. Due to the volume and variety of data, it is challenging for genEpi domain experts to conduct data reconnaissance; that is, have an overview of the data they have and make assessments toward its quality, completeness, and suitability. We present an algorithm for data reconnaissance through automatic visualization recommendation, GEViTRec. Our approach handles a broad variety of dataset types and automatically generates visually coherent combinations of charts, in contrast to existing systems that primarily focus on singleton visual encodings of tabular datasets. We automatically detect linkages across multiple input datasets by analyzing non-numeric attribute fields, creating a data source graph within which we analyze and rank paths. For each high-ranking path, we specify chart combinations with positional and color alignments between shared fields, using a gradual binding approach to transform initial partial specifications of singleton charts to complete specifications that are aligned and oriented consistently. A novel aspect of our approach is its combination of domain-agnostic elements with domain-specific information that is captured through a domain-specific visualization prevalence design space. Our implementation is applied to both synthetic data and real Ebola outbreak data. We compare GEViTRec's output to what previous visualization recommendation systems would generate, and to manually crafted visualizations used by practitioners. We conducted formative evaluations with ten genEpi experts to assess the relevance and interpretability of our results. <italic>Code, Data, and Study Materials Availability:</italic> <uri>https://github.com/amcrisan/GEVitRec</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Genomic Epidemiology (genEpi) is a branch of public health that uses many different data types including tabular, network, genomic, and geographic, to identify and contain outbreaks of deadly diseases. Due to the volume and variety of data, it is challenging for genEpi domain experts to conduct data reconnaissance; that is, have an overview of the data they have and make assessments toward its quality, completeness, and suitability. We present an algorithm for data reconnaissance through automatic visualization recommendation, GEViTRec. Our approach handles a broad variety of dataset types and automatically generates visually coherent combinations of charts, in contrast to existing systems that primarily focus on singleton visual encodings of tabular datasets. We automatically detect linkages across multiple input datasets by analyzing non-numeric attribute fields, creating a data source graph within which we analyze and rank paths. For each high-ranking path, we specify chart combinations with positional and color alignments between shared fields, using a gradual binding approach to transform initial partial specifications of singleton charts to complete specifications that are aligned and oriented consistently. A novel aspect of our approach is its combination of domain-agnostic elements with domain-specific information that is captured through a domain-specific visualization prevalence design space. Our implementation is applied to both synthetic data and real Ebola outbreak data. We compare GEViTRec's output to what previous visualization recommendation systems would generate, and to manually crafted visualizations used by practitioners. We conducted formative evaluations with ten genEpi experts to assess the relevance and interpretability of our results. <italic>Code, Data, and Study Materials Availability:</italic> <uri>https://github.com/amcrisan/GEVitRec</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Genomic Epidemiology (genEpi) is a branch of public health that uses many different data types including tabular, network, genomic, and geographic, to identify and contain outbreaks of deadly diseases. Due to the volume and variety of data, it is challenging for genEpi domain experts to conduct data reconnaissance; that is, have an overview of the data they have and make assessments toward its quality, completeness, and suitability. We present an algorithm for data reconnaissance through automatic visualization recommendation, GEViTRec. Our approach handles a broad variety of dataset types and automatically generates visually coherent combinations of charts, in contrast to existing systems that primarily focus on singleton visual encodings of tabular datasets. We automatically detect linkages across multiple input datasets by analyzing non-numeric attribute fields, creating a data source graph within which we analyze and rank paths. For each high-ranking path, we specify chart combinations with positional and color alignments between shared fields, using a gradual binding approach to transform initial partial specifications of singleton charts to complete specifications that are aligned and oriented consistently. A novel aspect of our approach is its combination of domain-agnostic elements with domain-specific information that is captured through a domain-specific visualization prevalence design space. Our implementation is applied to both synthetic data and real Ebola outbreak data. We compare GEViTRec's output to what previous visualization recommendation systems would generate, and to manually crafted visualizations used by practitioners. We conducted formative evaluations with ten genEpi experts to assess the relevance and interpretability of our results. Code, Data, and Study Materials Availability: https://github.com/amcrisan/GEVitRec.",
"title": "GEViTRec: Data Reconnaissance Through Recommendation Using a Domain-Specific Visualization Prevalence Design Space",
"normalizedTitle": "GEViTRec: Data Reconnaissance Through Recommendation Using a Domain-Specific Visualization Prevalence Design Space",
"fno": "09524484",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Mining",
"Data Visualisation",
"Diseases",
"Genomics",
"Graph Theory",
"Medical Computing",
"Recommender Systems",
"Automatic Visualization Recommendation",
"Chart Combinations",
"Complete Specifications",
"Data Reconnaissance",
"Data Source Graph",
"Dataset Types",
"Different Data Types Including Tabular",
"Domain Agnostic Elements",
"Domain Specific Information",
"Domain Specific Visualization Prevalence Design Space",
"Ebola Outbreak Data",
"Gen Epi Domain Experts",
"Gen Epi Experts",
"Genomic Epidemiology",
"GE Vi T Rec",
"Initial Partial Specifications",
"Manually Crafted Visualizations",
"Multiple Input Datasets",
"Previous Visualization Recommendation Systems",
"Singleton Visual Encodings",
"Synthetic Data",
"Tabular Datasets",
"Data Visualization",
"Visualization",
"Encoding",
"Bioinformatics",
"Genomics",
"Image Color Analysis",
"Epidemiology",
"Heterogeneous Data",
"Multiple Coordinated Views",
"Data Reconnaissance",
"Bioinformatics"
],
"authors": [
{
"givenName": "Anamaria",
"surname": "Crisan",
"fullName": "Anamaria Crisan",
"affiliation": "Tableau Research, Seattle, WA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shannah E.",
"surname": "Fisher",
"fullName": "Shannah E. Fisher",
"affiliation": "University of British Columbia, Vancouver, BC, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jennifer L.",
"surname": "Gardy",
"fullName": "Jennifer L. Gardy",
"affiliation": "Gates Foundation, Seattle, WA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tamara",
"surname": "Munzner",
"fullName": "Tamara Munzner",
"affiliation": "University of British Columbia, Vancouver, BC, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "4855-4872",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibe/2007/1509/0/04375564",
"title": "SNPMiner: A Domain-Specific Deep Web Mining Tool",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2007/04375564/12OmNAoUTdk",
"parentPublication": {
"id": "proceedings/bibe/2007/1509/0",
"title": "7th IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgc/2013/5114/0/5114a313",
"title": "Collact.Me: Conceptual Framework for Extracting Domain-Specific Content from Twitter",
"doi": null,
"abstractUrl": "/proceedings-article/cgc/2013/5114a313/12OmNxdm4D2",
"parentPublication": {
"id": "proceedings/cgc/2013/5114/0",
"title": "2013 International Conference on Cloud and Green Computing (CGC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2015/6598/0/6598a332",
"title": "RE-PAGE: Domain-Specific REplication and PArallel Processing of GEnomic Data",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2015/6598a332/12OmNxymo5R",
"parentPublication": {
"id": "proceedings/cluster/2015/6598/0",
"title": "2015 IEEE International Conference on Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2018/9156/0/915600a384",
"title": "How to Bring Value of Domain Specific Big Data in an Interdisciplinary Way? A Software Landscape",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2018/915600a384/17D45VObpP9",
"parentPublication": {
"id": "proceedings/e-science/2018/9156/0",
"title": "2018 IEEE 14th International Conference on e-Science (e-Science)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2021/3902/0/09671972",
"title": "TableNN: Deep Learning Framework for Learning Domain Specific Tabular Data",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2021/09671972/1A8hn0Qod4k",
"parentPublication": {
"id": "proceedings/big-data/2021/3902/0",
"title": "2021 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2023/01/09735153",
"title": "An Energy-Efficient Domain-Specific Architecture for Regular Expressions",
"doi": null,
"abstractUrl": "/journal/ec/2023/01/09735153/1BLngdsv49q",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09908148",
"title": "GenoREC: A Recommendation System for Interactive Genomics Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09908148/1Hbaqe3xebS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ickg/2022/5101/0/510100a188",
"title": "Progressive Feature Upgrade in Semi-supervised Learning on Tabular Domain",
"doi": null,
"abstractUrl": "/proceedings-article/ickg/2022/510100a188/1KxU3LuDs8o",
"parentPublication": {
"id": "proceedings/ickg/2022/5101/0",
"title": "2022 IEEE International Conference on Knowledge Graph (ICKG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933542",
"title": "Uncovering Data Landscapes through Data Reconnaissance and Task Wrangling",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933542/1fTgGbNyvi8",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2020/7445/0/09150425",
"title": "SALSA: A Domain Specific Architecture for Sequence Alignment",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2020/09150425/1lPGDExXewg",
"parentPublication": {
"id": "proceedings/ipdpsw/2020/7445/0",
"title": "2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09523761",
"articleId": "1wnLgUKA2fm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09524465",
"articleId": "1wpqCsqBU6Q",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1HMOiY9PNWU",
"name": "ttg202212-09524484s1-supp1-3107749.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202212-09524484s1-supp1-3107749.pdf",
"extension": "pdf",
"size": "6.87 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxbW4OH",
"title": "Dec.",
"year": "2014",
"issueNum": "12",
"idPrefix": "ts",
"pubType": "journal",
"volume": "40",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xQ1f",
"doi": "10.1109/TSE.2014.2357442",
"abstract": "Counter-example guided abstraction refinement (CEGAR) is widely used in software model checking. With an abstract model, the state space is largely reduced, however, a counterexample found in such a model that does not satisfy the desired property may not exist in the concrete model. Therefore, how to check whether a reported counterexample is spurious is a key problem in the abstraction-refinement loop. Next, in the case that a spurious counterexample is found, the abstract model needs to be further refined where an NP-hard state separation problem is often involved. Thus, how to refine the abstract model efficiently has attracted a great attention in the past years. In this paper, by re-analyzing spurious counterexamples, a new formal definition of spurious paths is given. Based on it, efficient algorithms for detecting spurious counterexamples are presented. By the new algorithms, when dealing with infinite counterexamples, the finite prefix to be analyzed will be polynomially shorter than the one dealt with by the existing algorithms. Moreover, in practical terms, the new algorithms can naturally be parallelized that enables multi-core processors contributes more in spurious counterexample checking. In addition, a novel refining approach by adding extra Boolean variables to the abstract model is presented. With this approach, not only the NP-hard state separation problem can be avoided, but also a smaller refined abstract model can be obtained. Experimental results show that the new algorithms perform well in practice.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Counter-example guided abstraction refinement (CEGAR) is widely used in software model checking. With an abstract model, the state space is largely reduced, however, a counterexample found in such a model that does not satisfy the desired property may not exist in the concrete model. Therefore, how to check whether a reported counterexample is spurious is a key problem in the abstraction-refinement loop. Next, in the case that a spurious counterexample is found, the abstract model needs to be further refined where an NP-hard state separation problem is often involved. Thus, how to refine the abstract model efficiently has attracted a great attention in the past years. In this paper, by re-analyzing spurious counterexamples, a new formal definition of spurious paths is given. Based on it, efficient algorithms for detecting spurious counterexamples are presented. By the new algorithms, when dealing with infinite counterexamples, the finite prefix to be analyzed will be polynomially shorter than the one dealt with by the existing algorithms. Moreover, in practical terms, the new algorithms can naturally be parallelized that enables multi-core processors contributes more in spurious counterexample checking. In addition, a novel refining approach by adding extra Boolean variables to the abstract model is presented. With this approach, not only the NP-hard state separation problem can be avoided, but also a smaller refined abstract model can be obtained. Experimental results show that the new algorithms perform well in practice.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Counter-example guided abstraction refinement (CEGAR) is widely used in software model checking. With an abstract model, the state space is largely reduced, however, a counterexample found in such a model that does not satisfy the desired property may not exist in the concrete model. Therefore, how to check whether a reported counterexample is spurious is a key problem in the abstraction-refinement loop. Next, in the case that a spurious counterexample is found, the abstract model needs to be further refined where an NP-hard state separation problem is often involved. Thus, how to refine the abstract model efficiently has attracted a great attention in the past years. In this paper, by re-analyzing spurious counterexamples, a new formal definition of spurious paths is given. Based on it, efficient algorithms for detecting spurious counterexamples are presented. By the new algorithms, when dealing with infinite counterexamples, the finite prefix to be analyzed will be polynomially shorter than the one dealt with by the existing algorithms. Moreover, in practical terms, the new algorithms can naturally be parallelized that enables multi-core processors contributes more in spurious counterexample checking. In addition, a novel refining approach by adding extra Boolean variables to the abstract model is presented. With this approach, not only the NP-hard state separation problem can be avoided, but also a smaller refined abstract model can be obtained. Experimental results show that the new algorithms perform well in practice.",
"title": "Making CEGAR More Efficient in Software Model Checking",
"normalizedTitle": "Making CEGAR More Efficient in Software Model Checking",
"fno": "06895263",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Abstracts",
"Concrete",
"Model Checking",
"Software",
"Color",
"Computational Modeling",
"Benchmark Testing",
"CEGAR",
"Model Checking",
"Formal Verification",
"Abstraction",
"Refinement"
],
"authors": [
{
"givenName": "Cong",
"surname": "Tian",
"fullName": "Cong Tian",
"affiliation": "ICTT and ISN Laboratory, Xidian University, Xi’an, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhenhua",
"surname": "Duan",
"fullName": "Zhenhua Duan",
"affiliation": "ICTT and ISN Laboratory, Xidian University, Xi’an, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhao",
"surname": "Duan",
"fullName": "Zhao Duan",
"affiliation": "ICTT and ISN Laboratory, Xidian University, Xi’an, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "1206-1223",
"year": "2014",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ats/2015/9739/0/9739a205",
"title": "A New Approach for Minimal Environment Construction for Modular Property Verification",
"doi": null,
"abstractUrl": "/proceedings-article/ats/2015/9739a205/12OmNC0guzm",
"parentPublication": {
"id": "proceedings/ats/2015/9739/0",
"title": "2015 IEEE 24th Asian Test Symposium (ATS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2003/7983/0/01227515",
"title": "Abstract model checking infinite state systems",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2003/01227515/12OmNvTBB6l",
"parentPublication": {
"id": "proceedings/aiccsa/2003/7983/0",
"title": "ACS/IEEE International Conference on Computer Systems and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fmcad/2007/3023/0/30230077",
"title": "Induction in CEGAR for Detecting Counterexamples",
"doi": null,
"abstractUrl": "/proceedings-article/fmcad/2007/30230077/12OmNwoxSdh",
"parentPublication": {
"id": "proceedings/fmcad/2007/3023/0",
"title": "Formal Methods in Computer Aided Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2009/3641/0/3641a927",
"title": "Automatic Construction of Complete Abstraction by Abstract Interpretation",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2009/3641a927/12OmNyQYtri",
"parentPublication": {
"id": "proceedings/icis/2009/3641/0",
"title": "Computer and Information Science, ACIS International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qest/2009/3808/0/3808a197",
"title": "Generation of Counterexamples for Model Checking of Markov Decision Processes",
"doi": null,
"abstractUrl": "/proceedings-article/qest/2009/3808a197/12OmNyaGeLJ",
"parentPublication": {
"id": "proceedings/qest/2009/3808/0",
"title": "Quantitative Evaluation of Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2013/3073/0/06606566",
"title": "Detecting spurious counterexamples efficiently in abstract model checking",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2013/06606566/12OmNzsrwpc",
"parentPublication": {
"id": "proceedings/icse/2013/3073/0",
"title": "2013 35th International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2009/02/tts2009020241",
"title": "Counterexample Generation in Probabilistic Model Checking",
"doi": null,
"abstractUrl": "/journal/ts/2009/02/tts2009020241/13rRUyeCkbZ",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mise/2019/2231/0/223100a047",
"title": "Extracting Counterexamples from Transitive-Closure-Based Model Checking",
"doi": null,
"abstractUrl": "/proceedings-article/mise/2019/223100a047/1ehBurPhGkU",
"parentPublication": {
"id": "proceedings/mise/2019/2231/0",
"title": "2019 IEEE/ACM 11th International Workshop on Modelling in Software Engineering (MiSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2019/2508/0/250800a565",
"title": "Model Checking Embedded Control Software using OS-in-the-Loop CEGAR",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2019/250800a565/1gysWnvE26Q",
"parentPublication": {
"id": "proceedings/ase/2019/2508/0",
"title": "2019 34th IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552899",
"title": "Visual Analysis of Hyperproperties for Understanding Model Checking Results",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552899/1xicaOuuM8w",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06858059",
"articleId": "13rRUIJuxrq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06891324",
"articleId": "13rRUyYjK6F",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAoDihf",
"title": "May",
"year": "2011",
"issueNum": "05",
"idPrefix": "tc",
"pubType": "journal",
"volume": "60",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxC0SVs",
"doi": "10.1109/TC.2010.94",
"abstract": "Assume-guarantee reasoning (AGR) is a promising compositional verification technique that can address the state space explosion problem associated with model checking. Since the construction of assumptions usually requires nontrivial human efforts, a framework was already proposed for generating assumptions automatically using the {\\rm L}^{\\ast} algorithm [2], [31]. However, if the framework shows that a system model does not satisfy a given specification, the designer has to manually refine the system model. To automate this refinement process, we propose a framework that can automatically eliminate all counterexamples from a system model such that the synthesized model satisfies a given safety specification. Further, the framework for synthesis is not only automatic, but is also an iterative {\\rm L}^{\\ast}-based compositional process, i.e., the global state space of the system is never generated in the synthesis process. When a model checker shows that a system model does not satisfy a specification by giving a counterexample, the proposed framework eliminates a class of equivalent counterexamples, that is, the set of counterexamples that transit to the error state through the same final transition. Then, AGR is applied again to check if there is another counterexample. The action of eliminating counterexamples continues until all classes of counterexamples are eliminated from the system model. We prove that the synthesized model satisfies the specification and the synthesis flow terminates after a finite number of iterations. Due to compositional synthesis, our target model for synthesis, namely the component models, is much smaller than the global system state graph.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Assume-guarantee reasoning (AGR) is a promising compositional verification technique that can address the state space explosion problem associated with model checking. Since the construction of assumptions usually requires nontrivial human efforts, a framework was already proposed for generating assumptions automatically using the {\\rm L}^{\\ast} algorithm [2], [31]. However, if the framework shows that a system model does not satisfy a given specification, the designer has to manually refine the system model. To automate this refinement process, we propose a framework that can automatically eliminate all counterexamples from a system model such that the synthesized model satisfies a given safety specification. Further, the framework for synthesis is not only automatic, but is also an iterative {\\rm L}^{\\ast}-based compositional process, i.e., the global state space of the system is never generated in the synthesis process. When a model checker shows that a system model does not satisfy a specification by giving a counterexample, the proposed framework eliminates a class of equivalent counterexamples, that is, the set of counterexamples that transit to the error state through the same final transition. Then, AGR is applied again to check if there is another counterexample. The action of eliminating counterexamples continues until all classes of counterexamples are eliminated from the system model. We prove that the synthesized model satisfies the specification and the synthesis flow terminates after a finite number of iterations. Due to compositional synthesis, our target model for synthesis, namely the component models, is much smaller than the global system state graph.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Assume-guarantee reasoning (AGR) is a promising compositional verification technique that can address the state space explosion problem associated with model checking. Since the construction of assumptions usually requires nontrivial human efforts, a framework was already proposed for generating assumptions automatically using the {\\rm L}^{\\ast} algorithm [2], [31]. However, if the framework shows that a system model does not satisfy a given specification, the designer has to manually refine the system model. To automate this refinement process, we propose a framework that can automatically eliminate all counterexamples from a system model such that the synthesized model satisfies a given safety specification. Further, the framework for synthesis is not only automatic, but is also an iterative {\\rm L}^{\\ast}-based compositional process, i.e., the global state space of the system is never generated in the synthesis process. When a model checker shows that a system model does not satisfy a specification by giving a counterexample, the proposed framework eliminates a class of equivalent counterexamples, that is, the set of counterexamples that transit to the error state through the same final transition. Then, AGR is applied again to check if there is another counterexample. The action of eliminating counterexamples continues until all classes of counterexamples are eliminated from the system model. We prove that the synthesized model satisfies the specification and the synthesis flow terminates after a finite number of iterations. Due to compositional synthesis, our target model for synthesis, namely the component models, is much smaller than the global system state graph.",
"title": "Counterexample-Guided Assume-Guarantee Synthesis through Learning",
"normalizedTitle": "Counterexample-Guided Assume-Guarantee Synthesis through Learning",
"fno": "ttc2011050734",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Model Checking",
"Assume Guarantee Reasoning",
"Rm L Ast Algorithm",
"Compositional Synthesis"
],
"authors": [
{
"givenName": "Shang-Wei",
"surname": "Lin",
"fullName": "Shang-Wei Lin",
"affiliation": "National Chung Cheng University, Chiayi, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pao-Ann",
"surname": "Hsiung",
"fullName": "Pao-Ann Hsiung",
"affiliation": "National Chung Cheng University, Chiayi, Taiwan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2011-05-01 00:00:00",
"pubType": "trans",
"pages": "734-750",
"year": "2011",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/kse/2010/4213/0/4213a172",
"title": "Assume-Guarantee Tools for Component-Based Software Verification",
"doi": null,
"abstractUrl": "/proceedings-article/kse/2010/4213a172/12OmNAYGluA",
"parentPublication": {
"id": "proceedings/kse/2010/4213/0",
"title": "Knowledge and Systems Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ctrq/2010/4070/0/4070a079",
"title": "Reachability Assume-Guarantee",
"doi": null,
"abstractUrl": "/proceedings-article/ctrq/2010/4070a079/12OmNBSBk0w",
"parentPublication": {
"id": "proceedings/ctrq/2010/4070/0",
"title": "2010 Third International Conference on Communication Theory, Reliability, and Quality of Service",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2008/3446/0/3446a479",
"title": "Modular Conformance Testing and Assume-Guarantee Verification for Evolving Component-Based Software",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2008/3446a479/12OmNvDqsPF",
"parentPublication": {
"id": "proceedings/apsec/2008/3446/0",
"title": "2008 15th Asia-Pacific Software Engineering Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2001/0990/3/099030151b",
"title": "Assume-Guarantee Supervisor for Concurrent Systems",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2001/099030151b/12OmNvmG7WV",
"parentPublication": {
"id": "proceedings/ipdps/2001/0990/3",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2014/3575/0/3575a201",
"title": "Counterexample-Guided Abstraction Refinement for Component-Based Systems",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2014/3575a201/12OmNwHz04k",
"parentPublication": {
"id": "proceedings/compsac/2014/3575/0",
"title": "2014 IEEE 38th Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/formalise/2016/4159/0/4159a036",
"title": "Towards Synthesis from Assume-Guarantee Contracts involving Infinite Theories: A Preliminary Report",
"doi": null,
"abstractUrl": "/proceedings-article/formalise/2016/4159a036/12OmNxFaLAO",
"parentPublication": {
"id": "proceedings/formalise/2016/4159/0",
"title": "2016 IEEE/ACM 4th FME Workshop on Formal Methods in Software Engineering (FormaliSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2021/06/08708934",
"title": "Debugging of Behavioural Models using Counterexample Analysis",
"doi": null,
"abstractUrl": "/journal/ts/2021/06/08708934/19Q3oSkS2je",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issre/2022/5132/0/513200a263",
"title": "A Novel Counterexample-Guided Inductive Synthesis Framework for Barrier Certificate Generation",
"doi": null,
"abstractUrl": "/proceedings-article/issre/2022/513200a263/1JhTCyeKxGw",
"parentPublication": {
"id": "proceedings/issre/2022/5132/0",
"title": "2022 IEEE 33rd International Symposium on Software Reliability Engineering (ISSRE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sera/2019/0798/0/08886798",
"title": "Genetic Algorithm-Based Assume-Guarantee Reasoning for Stochastic Model Checking",
"doi": null,
"abstractUrl": "/proceedings-article/sera/2019/08886798/1ezRy2JyAc8",
"parentPublication": {
"id": "proceedings/sera/2019/0798/0",
"title": "2019 IEEE 17th International Conference on Software Engineering Research, Management and Applications (SERA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sera/2019/0798/0/08886808",
"title": "Compositional Stochastic Model Checking Probabilistic Automata via Symmetric Assume-Guarantee Rule",
"doi": null,
"abstractUrl": "/proceedings-article/sera/2019/08886808/1ezRyqCpTMI",
"parentPublication": {
"id": "proceedings/sera/2019/0798/0",
"title": "2019 IEEE 17th International Conference on Software Engineering Research, Management and Applications (SERA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttc2011050707",
"articleId": "13rRUNvyajR",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWROD",
"name": "ttc2011050734s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttc2011050734s.pdf",
"extension": "pdf",
"size": "462 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzZEAye",
"title": "March/April",
"year": "2009",
"issueNum": "02",
"idPrefix": "ts",
"pubType": "journal",
"volume": "35",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyeCkbZ",
"doi": "10.1109/TSE.2009.5",
"abstract": "Providing evidence for the refutation of a property is an essential, if not the most important, feature of model checking. This paper considers algorithms for counterexample generation for probabilistic CTL formulae in discrete-time Markov chains. Finding the strongest evidence (i.e., the most probable path) violating a (bounded) until-formula is shown to be reducible to a single-source (hop-constrained) shortest path problem. Counterexamples of smallest size that deviate most from the required probability bound can be obtained by applying (small amendments to) k-shortest (hop-constrained) paths algorithms. These results can be extended to Markov chains with rewards, to LTL model checking, and are useful for Markov decision processes. Experimental results show that typically the size of a counterexample is excessive. To obtain much more compact representations, we present a simple algorithm to generate (minimal) regular expressions that can act as counterexamples. The feasibility of our approach is illustrated by means of two communication protocols: leader election in an anonymous ring network and the Crowds protocol.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Providing evidence for the refutation of a property is an essential, if not the most important, feature of model checking. This paper considers algorithms for counterexample generation for probabilistic CTL formulae in discrete-time Markov chains. Finding the strongest evidence (i.e., the most probable path) violating a (bounded) until-formula is shown to be reducible to a single-source (hop-constrained) shortest path problem. Counterexamples of smallest size that deviate most from the required probability bound can be obtained by applying (small amendments to) k-shortest (hop-constrained) paths algorithms. These results can be extended to Markov chains with rewards, to LTL model checking, and are useful for Markov decision processes. Experimental results show that typically the size of a counterexample is excessive. To obtain much more compact representations, we present a simple algorithm to generate (minimal) regular expressions that can act as counterexamples. The feasibility of our approach is illustrated by means of two communication protocols: leader election in an anonymous ring network and the Crowds protocol.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Providing evidence for the refutation of a property is an essential, if not the most important, feature of model checking. This paper considers algorithms for counterexample generation for probabilistic CTL formulae in discrete-time Markov chains. Finding the strongest evidence (i.e., the most probable path) violating a (bounded) until-formula is shown to be reducible to a single-source (hop-constrained) shortest path problem. Counterexamples of smallest size that deviate most from the required probability bound can be obtained by applying (small amendments to) k-shortest (hop-constrained) paths algorithms. These results can be extended to Markov chains with rewards, to LTL model checking, and are useful for Markov decision processes. Experimental results show that typically the size of a counterexample is excessive. To obtain much more compact representations, we present a simple algorithm to generate (minimal) regular expressions that can act as counterexamples. The feasibility of our approach is illustrated by means of two communication protocols: leader election in an anonymous ring network and the Crowds protocol.",
"title": "Counterexample Generation in Probabilistic Model Checking",
"normalizedTitle": "Counterexample Generation in Probabilistic Model Checking",
"fno": "tts2009020241",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Model Checking",
"Diagnostics"
],
"authors": [
{
"givenName": "Tingting",
"surname": "Han",
"fullName": "Tingting Han",
"affiliation": "RWTH Aachen University, Aachen and University of Twente, Enschede",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Joost-Pieter",
"surname": "Katoen",
"fullName": "Joost-Pieter Katoen",
"affiliation": "RWTH Aachen University, Aachen and University of Twente, Enschede",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Damman",
"surname": "Berteun",
"fullName": "Damman Berteun",
"affiliation": "RWTH Aachen University, Aachen and University of Twente, Enschede",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2009-03-01 00:00:00",
"pubType": "trans",
"pages": "241-257",
"year": "2009",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ewdts/2013/2096/0/06673083",
"title": "A probabilistic approach for counterexample generation to aid design debugging",
"doi": null,
"abstractUrl": "/proceedings-article/ewdts/2013/06673083/12OmNwHQB2w",
"parentPublication": {
"id": "proceedings/ewdts/2013/2096/0",
"title": "2013 11th East-West Design and Test Symposium (EWDTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qest/2009/3808/0/3808a197",
"title": "Generation of Counterexamples for Model Checking of Markov Decision Processes",
"doi": null,
"abstractUrl": "/proceedings-article/qest/2009/3808a197/12OmNyaGeLJ",
"parentPublication": {
"id": "proceedings/qest/2009/3808/0",
"title": "Quantitative Evaluation of Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qest/2010/4188/0/4188a037",
"title": "DTMC Model Checking by SCC Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/qest/2010/4188a037/12OmNyjccCy",
"parentPublication": {
"id": "proceedings/qest/2010/4188/0",
"title": "Quantitative Evaluation of Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/2/3336c210",
"title": "Counterexample Generation for Probabilistic Timed Automata Model Checking",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336c210/12OmNzd7bam",
"parentPublication": {
"id": "proceedings/csse/2008/3336/6",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2013/3073/0/06606566",
"title": "Detecting spurious counterexamples efficiently in abstract model checking",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2013/06606566/12OmNzsrwpc",
"parentPublication": {
"id": "proceedings/icse/2013/3073/0",
"title": "2013 35th International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sefm/2008/3437/0/3437a053",
"title": "Cheap and Small Counterexamples",
"doi": null,
"abstractUrl": "/proceedings-article/sefm/2008/3437a053/12OmNzwHvbj",
"parentPublication": {
"id": "proceedings/sefm/2008/3437/0",
"title": "2008 Sixth IEEE International Conference on Software Engineering and Formal Methods",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2014/12/06895263",
"title": "Making CEGAR More Efficient in Software Model Checking",
"doi": null,
"abstractUrl": "/journal/ts/2014/12/06895263/13rRUx0xQ1f",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2010/01/tts2010010037",
"title": "Directed Explicit State-Space Search in the Generation of Counterexamples for Stochastic Model Checking",
"doi": null,
"abstractUrl": "/journal/ts/2010/01/tts2010010037/13rRUxASuOT",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2011/05/ttc2011050734",
"title": "Counterexample-Guided Assume-Guarantee Synthesis through Learning",
"doi": null,
"abstractUrl": "/journal/tc/2011/05/ttc2011050734/13rRUxC0SVs",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2021/06/08708934",
"title": "Debugging of Behavioural Models using Counterexample Analysis",
"doi": null,
"abstractUrl": "/journal/ts/2021/06/08708934/19Q3oSkS2je",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "tts2009020224",
"articleId": "13rRUyv53Hc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "tts2009020274",
"articleId": "13rRUIJcWfe",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1ulCBmlWM5a",
"title": "June",
"year": "2021",
"issueNum": "06",
"idPrefix": "ts",
"pubType": "journal",
"volume": "47",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "19Q3oSkS2je",
"doi": "10.1109/TSE.2019.2915303",
"abstract": "Model checking is an established technique for automatically verifying that a model satisfies a given temporal property. When the model violates the property, the model checker returns a counterexample, which is a sequence of actions leading to a state where the property is not satisfied. Understanding this counterexample for debugging the specification is a complicated task for several reasons: (i) the counterexample can contain a large number of actions, (ii) the debugging task is mostly achieved manually, and (iii) the counterexample does not explicitly highlight the source of the bug that is hidden in the model. This article presents a new approach that improves the usability of model checking by simplifying the comprehension of counterexamples. To do so, we first extract in the model all the counterexamples. Second, we define an analysis algorithm that identifies actions that make the model skip from incorrect to correct behaviours, making these actions relevant from a debugging perspective. Third, we develop a set of abstraction techniques to extract these actions from counterexamples. Our approach is fully automated by a tool we implemented and was applied on real-world case studies from various application areas for evaluation purposes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Model checking is an established technique for automatically verifying that a model satisfies a given temporal property. When the model violates the property, the model checker returns a counterexample, which is a sequence of actions leading to a state where the property is not satisfied. Understanding this counterexample for debugging the specification is a complicated task for several reasons: (i) the counterexample can contain a large number of actions, (ii) the debugging task is mostly achieved manually, and (iii) the counterexample does not explicitly highlight the source of the bug that is hidden in the model. This article presents a new approach that improves the usability of model checking by simplifying the comprehension of counterexamples. To do so, we first extract in the model all the counterexamples. Second, we define an analysis algorithm that identifies actions that make the model skip from incorrect to correct behaviours, making these actions relevant from a debugging perspective. Third, we develop a set of abstraction techniques to extract these actions from counterexamples. Our approach is fully automated by a tool we implemented and was applied on real-world case studies from various application areas for evaluation purposes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Model checking is an established technique for automatically verifying that a model satisfies a given temporal property. When the model violates the property, the model checker returns a counterexample, which is a sequence of actions leading to a state where the property is not satisfied. Understanding this counterexample for debugging the specification is a complicated task for several reasons: (i) the counterexample can contain a large number of actions, (ii) the debugging task is mostly achieved manually, and (iii) the counterexample does not explicitly highlight the source of the bug that is hidden in the model. This article presents a new approach that improves the usability of model checking by simplifying the comprehension of counterexamples. To do so, we first extract in the model all the counterexamples. Second, we define an analysis algorithm that identifies actions that make the model skip from incorrect to correct behaviours, making these actions relevant from a debugging perspective. Third, we develop a set of abstraction techniques to extract these actions from counterexamples. Our approach is fully automated by a tool we implemented and was applied on real-world case studies from various application areas for evaluation purposes.",
"title": "Debugging of Behavioural Models using Counterexample Analysis",
"normalizedTitle": "Debugging of Behavioural Models using Counterexample Analysis",
"fno": "08708934",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Ergonomics",
"Formal Specification",
"Formal Verification",
"Program Debugging",
"Program Diagnostics",
"Temporal Logic",
"Behavioural Models",
"Counterexample Analysis",
"Model Checking",
"Temporal Property",
"Debugging Task",
"Usability",
"Abstraction Techniques",
"Computer Bugs",
"Debugging",
"Safety",
"Model Checking",
"Task Analysis",
"Tools",
"Analytical Models",
"Behavioural Models",
"Model Checking",
"Counterexample",
"Abstraction"
],
"authors": [
{
"givenName": "Gianluca",
"surname": "Barbon",
"fullName": "Gianluca Barbon",
"affiliation": "CNRS, Inria, Grenoble INP, LIG, Université Grenoble Alpes, Grenoble, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vincent",
"surname": "Leroy",
"fullName": "Vincent Leroy",
"affiliation": "CNRS, Grenoble INP, LIG, Université Grenoble Alpes, Grenoble, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gwen",
"surname": "Salaün",
"fullName": "Gwen Salaün",
"affiliation": "CNRS, Inria, Grenoble INP, LIG, Université Grenoble Alpes, Grenoble, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2021-06-01 00:00:00",
"pubType": "trans",
"pages": "1184-1197",
"year": "2021",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/qest/2008/3360/0/3360a189",
"title": "Debugging of Dependability Models Using Interactive Visualization of Counterexamples",
"doi": null,
"abstractUrl": "/proceedings-article/qest/2008/3360a189/12OmNAkWvJb",
"parentPublication": {
"id": "proceedings/qest/2008/3360/0",
"title": "Quantitative Evaluation of Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ewdts/2013/2096/0/06673083",
"title": "A probabilistic approach for counterexample generation to aid design debugging",
"doi": null,
"abstractUrl": "/proceedings-article/ewdts/2013/06673083/12OmNwHQB2w",
"parentPublication": {
"id": "proceedings/ewdts/2013/2096/0",
"title": "2013 11th East-West Design and Test Symposium (EWDTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2013/2144/2/2144b134",
"title": "A Practical Study of Debugging Using Model Checking",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2013/2144b134/12OmNxA3Z6a",
"parentPublication": {
"id": "apsec/2013/2144/2",
"title": "2013 20th Asia-Pacific Software Engineering Conference (APSEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccad/2007/1381/0/04397277",
"title": "Computation of minimal counterexamples by using black box techniques and symbolic methods",
"doi": null,
"abstractUrl": "/proceedings-article/iccad/2007/04397277/12OmNyY4rmj",
"parentPublication": {
"id": "proceedings/iccad/2007/1381/0",
"title": "2007 IEEE/ACM International Conference on Computer Aided Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2011/05/ttc2011050734",
"title": "Counterexample-Guided Assume-Guarantee Synthesis through Learning",
"doi": null,
"abstractUrl": "/journal/tc/2011/05/ttc2011050734/13rRUxC0SVs",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2009/02/tts2009020241",
"title": "Counterexample Generation in Probabilistic Model Checking",
"doi": null,
"abstractUrl": "/journal/ts/2009/02/tts2009020241/13rRUyeCkbZ",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/formalise/2022/9287/0/928700a012",
"title": "Counting Bugs in Behavioural Models using Counterexample Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/formalise/2022/928700a012/1EmsMh8BsdO",
"parentPublication": {
"id": "proceedings/formalise/2022/9287/0",
"title": "2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issrew/2022/7679/0/767900a268",
"title": "Improving Counterexample Quality from Failed Program Verification",
"doi": null,
"abstractUrl": "/proceedings-article/issrew/2022/767900a268/1JqDUOsG05q",
"parentPublication": {
"id": "proceedings/issrew/2022/7679/0",
"title": "2022 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-companion/2019/1764/0/176400a107",
"title": "Visual Debugging of Behavioural Models",
"doi": null,
"abstractUrl": "/proceedings-article/icse-companion/2019/176400a107/1cJ7lALXJNm",
"parentPublication": {
"id": "proceedings/icse-companion/2019/1764/0",
"title": "2019 IEEE/ACM 41st International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2020/9553/0/955300a091",
"title": "Clusters of Faulty States for Debugging Behavioural Models",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2020/955300a091/1rCgCVn1w2Y",
"parentPublication": {
"id": "proceedings/apsec/2020/9553/0",
"title": "2020 27th Asia-Pacific Software Engineering Conference (APSEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08708940",
"articleId": "19Q3oGEc7ew",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08716294",
"articleId": "1aeWSaT9mGk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyr8Ysk",
"title": "May/June",
"year": "2018",
"issueNum": "03",
"idPrefix": "sp",
"pubType": "magazine",
"volume": "16",
"label": "May/June",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwI5TW0",
"doi": "10.1109/MSP.2018.2701149",
"abstract": "In this article, we recognize the profound effects that algorithmic decision making can have on people’s lives and propose a harm-reduction framework for algorithmic fairness. We argue that any evaluation of algorithmic fairness must take into account the foreseeable effects that algorithmic design, implementation, and use have on the well-being of individuals. We further demonstrate how counterfactual frameworks for causal inference developed in statistics and computer science can be used as the basis for defining and estimating the foreseeable effects of algorithmic decisions. Finally, we argue that certain patterns of foreseeable harms are unfair. An algorithmic decision is unfair if it imposes predictable harms on sets of individuals that are unconscionably disproportionate to the benefits these same decisions produce elsewhere. Also, an algorithmic decision is unfair when it is regressive, that is, when members of disadvantaged groups pay a higher cost for the social benefits of that decision.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this article, we recognize the profound effects that algorithmic decision making can have on people’s lives and propose a harm-reduction framework for algorithmic fairness. We argue that any evaluation of algorithmic fairness must take into account the foreseeable effects that algorithmic design, implementation, and use have on the well-being of individuals. We further demonstrate how counterfactual frameworks for causal inference developed in statistics and computer science can be used as the basis for defining and estimating the foreseeable effects of algorithmic decisions. Finally, we argue that certain patterns of foreseeable harms are unfair. An algorithmic decision is unfair if it imposes predictable harms on sets of individuals that are unconscionably disproportionate to the benefits these same decisions produce elsewhere. Also, an algorithmic decision is unfair when it is regressive, that is, when members of disadvantaged groups pay a higher cost for the social benefits of that decision.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this article, we recognize the profound effects that algorithmic decision making can have on people’s lives and propose a harm-reduction framework for algorithmic fairness. We argue that any evaluation of algorithmic fairness must take into account the foreseeable effects that algorithmic design, implementation, and use have on the well-being of individuals. We further demonstrate how counterfactual frameworks for causal inference developed in statistics and computer science can be used as the basis for defining and estimating the foreseeable effects of algorithmic decisions. Finally, we argue that certain patterns of foreseeable harms are unfair. An algorithmic decision is unfair if it imposes predictable harms on sets of individuals that are unconscionably disproportionate to the benefits these same decisions produce elsewhere. Also, an algorithmic decision is unfair when it is regressive, that is, when members of disadvantaged groups pay a higher cost for the social benefits of that decision.",
"title": "A Harm-Reduction Framework for Algorithmic Fairness",
"normalizedTitle": "A Harm-Reduction Framework for Algorithmic Fairness",
"fno": "msp2018030034",
"hasPdf": true,
"idPrefix": "sp",
"keywords": [
"Decision Making",
"Decision Support Systems",
"Ethical Aspects",
"Harm Reduction Framework",
"Algorithm Fairness",
"Algorithm Decision Making",
"Individual Well Being",
"Classification Algorithms",
"Prediction Algorithms",
"Decision Making",
"Risk Management",
"Law",
"Machine Learning Algorithms",
"Inference Algorithms",
"Ethics",
"Artificial Intelligence",
"Algorithm Design And Analysis",
"Data Privacy",
"Informational Harm",
"Fairness",
"Accountability",
"Privacy",
"AI Ethics"
],
"authors": [
{
"givenName": "Micah",
"surname": "Altman",
"fullName": "Micah Altman",
"affiliation": "MIT",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexandra",
"surname": "Wood",
"fullName": "Alexandra Wood",
"affiliation": "Harvard University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Effy",
"surname": "Vayena",
"fullName": "Effy Vayena",
"affiliation": "ETH Zurich",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2018-05-01 00:00:00",
"pubType": "mags",
"pages": "34-45",
"year": "2018",
"issn": "1540-7993",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/fairware/2018/5746/0/574601a001",
"title": "Fairness Definitions Explained",
"doi": null,
"abstractUrl": "/proceedings-article/fairware/2018/574601a001/13l5NXBGH85",
"parentPublication": {
"id": "proceedings/fairware/2018/5746/0",
"title": "2018 IEEE/ACM International Workshop on Software Fairness (FairWare)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/sp/2018/03/msp2018030073",
"title": "What Can Political Philosophy Teach Us about Algorithmic Fairness?",
"doi": null,
"abstractUrl": "/magazine/sp/2018/03/msp2018030073/13rRUyYSWr5",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2018/9288/0/928800b062",
"title": "Hubness as a Case of Technical Algorithmic Bias in Music Recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2018/928800b062/18jXA8K5fLG",
"parentPublication": {
"id": "proceedings/icdmw/2018/9288/0",
"title": "2018 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacvw/2022/5824/0/582400a410",
"title": "Algorithmic Fairness in Face Morphing Attack Detection",
"doi": null,
"abstractUrl": "/proceedings-article/wacvw/2022/582400a410/1B12r8N8LMk",
"parentPublication": {
"id": "proceedings/wacvw/2022/5824/0",
"title": "2022 IEEE/CVF Winter Conference on Applications of Computer Vision Workshops (WACVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/transai/2022/7184/0/718400a001",
"title": "Towards a Taxonomy of AI Risks in the Health Domain",
"doi": null,
"abstractUrl": "/proceedings-article/transai/2022/718400a001/1Ip7Pyg1kUE",
"parentPublication": {
"id": "proceedings/transai/2022/7184/0",
"title": "2022 Fourth International Conference on Transdisciplinary AI (TransAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trex/2022/9356/0/935600a001",
"title": "How Do Algorithmic Fairness Metrics Align with Human Judgement? A Mixed-Initiative System for Contextualized Fairness Assessment",
"doi": null,
"abstractUrl": "/proceedings-article/trex/2022/935600a001/1J9BkYzzrHi",
"parentPublication": {
"id": "proceedings/trex/2022/9356/0",
"title": "2022 IEEE Workshop on TRust and EXpertise in Visual Analytics (TREX)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10021078",
"title": "Identifying Imbalance Thresholds in Input Data to Achieve Desired Levels of Algorithmic Fairness",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10021078/1KfSnef5YKA",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "letters/lc/2020/02/09134722",
"title": "Contrastive Fairness in Machine Learning",
"doi": null,
"abstractUrl": "/journal/lc/2020/02/09134722/1lE0lZ5SpP2",
"parentPublication": {
"id": "letters/lc",
"title": "IEEE Letters of the Computer Society",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icstw/2021/4456/0/445600a110",
"title": "Assuring Fairness of Algorithmic Decision Making",
"doi": null,
"abstractUrl": "/proceedings-article/icstw/2021/445600a110/1tYs5u4t1Sg",
"parentPublication": {
"id": "proceedings/icstw/2021/4456/0",
"title": "2021 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552229",
"title": "FairRankVis: A Visual Analytics Framework for Exploring Algorithmic Fairness in Graph Mining Models",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552229/1xic387kwVy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "msp2018030026",
"articleId": "13rRUwjGoJX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "msp2018030046",
"articleId": "13rRUNvgz8c",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwCsdFw",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1M9lHGqR5oA",
"doi": "10.1109/TKDE.2023.3265598",
"abstract": "Graph mining algorithms have been playing a significant role in myriad fields over the years. However, despite their promising performance on various graph analytical tasks, most of these algorithms lack fairness considerations. As a consequence, they could lead to discrimination towards certain populations when exploited in human-centered applications. Recently, algorithmic fairness has been extensively studied in graph-based applications. In contrast to algorithmic fairness on independent and identically distributed (i.i.d.) data, fairness in graph mining has exclusive backgrounds, taxonomies, and fulfilling techniques. In this survey, we provide a comprehensive and up-to-date introduction of existing literature under the context of fair graph mining. Specifically, we propose a novel taxonomy of fairness notions on graphs, which sheds light on their connections and differences. We further present an organized summary of existing techniques that promote fairness in graph mining. Finally, we discuss current research challenges and open questions, aiming at encouraging cross-breeding ideas and further advances.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Graph mining algorithms have been playing a significant role in myriad fields over the years. However, despite their promising performance on various graph analytical tasks, most of these algorithms lack fairness considerations. As a consequence, they could lead to discrimination towards certain populations when exploited in human-centered applications. Recently, algorithmic fairness has been extensively studied in graph-based applications. In contrast to algorithmic fairness on independent and identically distributed (i.i.d.) data, fairness in graph mining has exclusive backgrounds, taxonomies, and fulfilling techniques. In this survey, we provide a comprehensive and up-to-date introduction of existing literature under the context of fair graph mining. Specifically, we propose a novel taxonomy of fairness notions on graphs, which sheds light on their connections and differences. We further present an organized summary of existing techniques that promote fairness in graph mining. Finally, we discuss current research challenges and open questions, aiming at encouraging cross-breeding ideas and further advances.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Graph mining algorithms have been playing a significant role in myriad fields over the years. However, despite their promising performance on various graph analytical tasks, most of these algorithms lack fairness considerations. As a consequence, they could lead to discrimination towards certain populations when exploited in human-centered applications. Recently, algorithmic fairness has been extensively studied in graph-based applications. In contrast to algorithmic fairness on independent and identically distributed (i.i.d.) data, fairness in graph mining has exclusive backgrounds, taxonomies, and fulfilling techniques. In this survey, we provide a comprehensive and up-to-date introduction of existing literature under the context of fair graph mining. Specifically, we propose a novel taxonomy of fairness notions on graphs, which sheds light on their connections and differences. We further present an organized summary of existing techniques that promote fairness in graph mining. Finally, we discuss current research challenges and open questions, aiming at encouraging cross-breeding ideas and further advances.",
"title": "Fairness in Graph Mining: A Survey",
"normalizedTitle": "Fairness in Graph Mining: A Survey",
"fno": "10097603",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Data Mining",
"Topology",
"Taxonomy",
"Prediction Algorithms",
"Task Analysis",
"Statistics",
"Sociology",
"Algorithmic Fairness",
"Graph Mining",
"Debiasing"
],
"authors": [
{
"givenName": "Yushun",
"surname": "Dong",
"fullName": "Yushun Dong",
"affiliation": "Department of Electrical and Computer Engineering, University of Virginia, Charlottesville, VA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jing",
"surname": "Ma",
"fullName": "Jing Ma",
"affiliation": "Department of Computer Science, University of Virginia, Charlottesville, VA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Song",
"surname": "Wang",
"fullName": "Song Wang",
"affiliation": "Department of Electrical and Computer Engineering, University of Virginia, Charlottesville, VA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chen",
"surname": "Chen",
"fullName": "Chen Chen",
"affiliation": "Biocomplexity Institute, University of Virginia, Charlottesville, VA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jundong",
"surname": "Li",
"fullName": "Jundong Li",
"affiliation": "Department of Electrical and Computer Engineering, Department of Computer Science, and School of Data Science, University of Virginia, Charlottesville, VA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "1-22",
"year": "5555",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdmw/2012/4925/0/4925a378",
"title": "Considerations on Fairness-Aware Data Mining",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2012/4925a378/12OmNyQYt1r",
"parentPublication": {
"id": "proceedings/icdmw/2012/4925/0",
"title": "2012 IEEE 12th International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09706306",
"title": "Fair Representation: Guaranteeing Approximate Multiple Group Fairness for Unknown Tasks",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09706306/1AO2aMkUIGA",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2022/6814/0/681400a251",
"title": "Biases, Fairness, and Implications of Using AI in Social Media Data Mining",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2022/681400a251/1I6RS5gq2L6",
"parentPublication": {
"id": "proceedings/cw/2022/6814/0",
"title": "2022 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trex/2022/9356/0/935600a001",
"title": "How Do Algorithmic Fairness Metrics Align with Human Judgement? A Mixed-Initiative System for Contextualized Fairness Assessment",
"doi": null,
"abstractUrl": "/proceedings-article/trex/2022/935600a001/1J9BkYzzrHi",
"parentPublication": {
"id": "proceedings/trex/2022/9356/0",
"title": "2022 IEEE Workshop on TRust and EXpertise in Visual Analytics (TREX)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vds/2022/5721/0/572100a027",
"title": "BiaScope: Visual Unfairness Diagnosis for Graph Embeddings",
"doi": null,
"abstractUrl": "/proceedings-article/vds/2022/572100a027/1JezJPxSJHy",
"parentPublication": {
"id": "proceedings/vds/2022/5721/0",
"title": "2022 IEEE Visualization in Data Science (VDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "letters/lc/2020/02/09134722",
"title": "Contrastive Fairness in Machine Learning",
"doi": null,
"abstractUrl": "/journal/lc/2020/02/09134722/1lE0lZ5SpP2",
"parentPublication": {
"id": "letters/lc",
"title": "IEEE Letters of the Computer Society",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09378025",
"title": "Fairness Metrics: A Comparative Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09378025/1s64Cs28ZWw",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09576603",
"title": "On the Fairness of Time-Critical Influence Maximization in Social Networks",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09576603/1xIKnJDjXO0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552229",
"title": "FairRankVis: A Visual Analytics Framework for Exploring Algorithmic Fairness in Graph Mining Models",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552229/1xic387kwVy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/2022/03/09645324",
"title": "FairDrop: Biased Edge Dropout for Enhancing Fairness in Graph Representation Learning",
"doi": null,
"abstractUrl": "/journal/ai/2022/03/09645324/1zc6IyRAgfK",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10094005",
"articleId": "1M80Et4Nums",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10097536",
"articleId": "1M9lHOxQhSU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Mg6aI85XQA",
"name": "ttk555501-010097603s1-supp1-3265598.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk555501-010097603s1-supp1-3265598.pdf",
"extension": "pdf",
"size": "115 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrMZprc",
"title": "March",
"year": "2019",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45WaTkk5",
"doi": "10.1109/TVCG.2017.2785271",
"abstract": "In 2014, more than 10 million people in the US were affected by an ambulatory disability. Thus, gait rehabilitation is a crucial part of health care systems. The quantification of human locomotion enables clinicians to describe and analyze a patient's gait performance in detail and allows them to base clinical decisions on objective data. These assessments generate a vast amount of complex data which need to be interpreted in a short time period. We conducted a design study in cooperation with gait analysis experts to develop a novel Knowledge-Assisted Visual Analytics solution for clinical Gait analysis (KAVAGait). KAVAGait allows the clinician to store and inspect complex data derived during clinical gait analysis. The system incorporates innovative and interactive visual interface concepts, which were developed based on the needs of clinicians. Additionally, an explicit knowledge store (EKS) allows externalization and storage of implicit knowledge from clinicians. It makes this information available for others, supporting the process of data inspection and clinical decision making. We validated our system by conducting expert reviews, a user study, and a case study. Results suggest that KAVAGait is able to support a clinician during clinical practice by visualizing complex gait data and providing knowledge of other clinicians.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In 2014, more than 10 million people in the US were affected by an ambulatory disability. Thus, gait rehabilitation is a crucial part of health care systems. The quantification of human locomotion enables clinicians to describe and analyze a patient's gait performance in detail and allows them to base clinical decisions on objective data. These assessments generate a vast amount of complex data which need to be interpreted in a short time period. We conducted a design study in cooperation with gait analysis experts to develop a novel Knowledge-Assisted Visual Analytics solution for clinical Gait analysis (KAVAGait). KAVAGait allows the clinician to store and inspect complex data derived during clinical gait analysis. The system incorporates innovative and interactive visual interface concepts, which were developed based on the needs of clinicians. Additionally, an explicit knowledge store (EKS) allows externalization and storage of implicit knowledge from clinicians. It makes this information available for others, supporting the process of data inspection and clinical decision making. We validated our system by conducting expert reviews, a user study, and a case study. Results suggest that KAVAGait is able to support a clinician during clinical practice by visualizing complex gait data and providing knowledge of other clinicians.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In 2014, more than 10 million people in the US were affected by an ambulatory disability. Thus, gait rehabilitation is a crucial part of health care systems. The quantification of human locomotion enables clinicians to describe and analyze a patient's gait performance in detail and allows them to base clinical decisions on objective data. These assessments generate a vast amount of complex data which need to be interpreted in a short time period. We conducted a design study in cooperation with gait analysis experts to develop a novel Knowledge-Assisted Visual Analytics solution for clinical Gait analysis (KAVAGait). KAVAGait allows the clinician to store and inspect complex data derived during clinical gait analysis. The system incorporates innovative and interactive visual interface concepts, which were developed based on the needs of clinicians. Additionally, an explicit knowledge store (EKS) allows externalization and storage of implicit knowledge from clinicians. It makes this information available for others, supporting the process of data inspection and clinical decision making. We validated our system by conducting expert reviews, a user study, and a case study. Results suggest that KAVAGait is able to support a clinician during clinical practice by visualizing complex gait data and providing knowledge of other clinicians.",
"title": "KAVAGait: Knowledge-Assisted Visual Analytics for Clinical Gait Analysis",
"normalizedTitle": "KAVAGait: Knowledge-Assisted Visual Analytics for Clinical Gait Analysis",
"fno": "08304678",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Decision Making",
"Gait Analysis",
"Health Care",
"Patient Rehabilitation",
"Clinical Gait Analysis",
"KAVA Gait",
"Explicit Knowledge Store",
"Data Inspection",
"Clinical Decision Making",
"Complex Gait Data",
"Gait Rehabilitation",
"Health Care Systems",
"Patient Rehabilitation",
"Knowledge Assisted Visual Analytics",
"Ambulatory Disability",
"Human Locomotion",
"Data Visualization",
"Visual Analytics",
"Time Series Analysis",
"Decision Making",
"Tools",
"Task Analysis",
"Design Study",
"Interface Design",
"Knowledge Generation",
"Knowledge Assisted",
"Visualization",
"Visual Analytics",
"Gait Analysis"
],
"authors": [
{
"givenName": "Markus",
"surname": "Wagner",
"fullName": "Markus Wagner",
"affiliation": "St. Pölten University of Applied Sciences, St. Pölten, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Djordje",
"surname": "Slijepcevic",
"fullName": "Djordje Slijepcevic",
"affiliation": "St. Pölten University of Applied Sciences, St. Pölten, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brian",
"surname": "Horsak",
"fullName": "Brian Horsak",
"affiliation": "St. Pölten University of Applied Sciences, St. Pölten, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexander",
"surname": "Rind",
"fullName": "Alexander Rind",
"affiliation": "St. Pölten University of Applied Sciences, St. Pölten, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthias",
"surname": "Zeppelzauer",
"fullName": "Matthias Zeppelzauer",
"affiliation": "St. Pölten University of Applied Sciences, St. Pölten, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wolfgang",
"surname": "Aigner",
"fullName": "Wolfgang Aigner",
"affiliation": "St. Pölten University of Applied Sciences, St. Pölten, Austria",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "03",
"pubDate": "2019-03-01 00:00:00",
"pubType": "trans",
"pages": "1528-1542",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ichi/2014/5701/0/5701a202",
"title": "Clinical Pathway Support System",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2014/5701a202/12OmNA0vnXS",
"parentPublication": {
"id": "proceedings/ichi/2014/5701/0",
"title": "2014 IEEE International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vahc/2017/3187/0/08387499",
"title": "Visual analytics for evaluating clinical pathways",
"doi": null,
"abstractUrl": "/proceedings-article/vahc/2017/08387499/12OmNAle6wG",
"parentPublication": {
"id": "proceedings/vahc/2017/3187/0",
"title": "2017 IEEE Workshop on Visual Analytics in Healthcare (VAHC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2015/8302/0/8302a018",
"title": "A Knowledge Base Driven Clinical Pharmacist Information System",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2015/8302a018/12OmNqBbI03",
"parentPublication": {
"id": "proceedings/itme/2015/8302/0",
"title": "2015 7th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2012/4771/0/4771a291",
"title": "Visualizing Clinical Trial Data Using Pluggable Components",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2012/4771a291/12OmNqJ8tmY",
"parentPublication": {
"id": "proceedings/iv/2012/4771/0",
"title": "2012 16th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2013/4892/0/4892c416",
"title": "Visual Analytics for Public Health: Supporting Knowledge Construction and Decision-Making",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2013/4892c416/12OmNrJiCNq",
"parentPublication": {
"id": "proceedings/hicss/2013/4892/0",
"title": "2013 46th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09939115",
"title": "DocFlow: A Visual Analytics System for Question-based Document Retrieval and Categorization",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09939115/1I1KuH1xVF6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trex/2022/9356/0/935600a008",
"title": "Trustworthy Visual Analytics in Clinical Gait Analysis: A Case Study for Patients with Cerebral Palsy",
"doi": null,
"abstractUrl": "/proceedings-article/trex/2022/935600a008/1J9BkDHcAz6",
"parentPublication": {
"id": "proceedings/trex/2022/9356/0",
"title": "2022 IEEE Workshop on TRust and EXpertise in Visual Analytics (TREX)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichi/2020/5382/0/09374365",
"title": "Machine Learning Based Clinical Decision Support and Clinician Trust",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2020/09374365/1rUIXSTum4M",
"parentPublication": {
"id": "proceedings/ichi/2020/5382/0",
"title": "2020 IEEE International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09413226",
"title": "Video Analytics Gait Trend Measurement for Fall Prevention and Health Monitoring",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09413226/1tmiei3JpHG",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555810",
"title": "VBridge: Connecting the Dots Between Features and Data to Explain Healthcare Models",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555810/1xlw2uJhEXe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08283576",
"articleId": "17D45XcttjZ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08307265",
"articleId": "17D45Xbl4Qj",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgFC",
"name": "ttg201903-08304678s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201903-08304678s1.zip",
"extension": "zip",
"size": "14.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1pERRCpDoGs",
"title": "Aug.",
"year": "5555",
"issueNum": "01",
"idPrefix": "ai",
"pubType": "journal",
"volume": "1",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1ISVU8Rd528",
"doi": "10.1109/TAI.2022.3227225",
"abstract": "Explaining increasingly complex machine learning will remain crucial to cope with risks, regulations, responsibilities, and human support in healthcare. However, extant explainable systems mostly provide explanations that mismatch clinical users' conceptions and fail their expectations to leverage validated and clinically relevant information. A key to more user-centric and satisfying explanations can be seen in combining data-driven and knowledge-based systems, i.e., to utilize prior knowledge jointly with the patterns learned from data. We conduct a structured review of knowledge-informed machine learning in healthcare. In this conceptual study, we build on a framework to characterize user knowledge and prior knowledge embodied in explanations. Specifically, we explicate the types and contexts of knowledge to examine the fit between knowledge-informed approaches and users. Our results highlight that knowledge-informed machine learning is a promising paradigm to enrich former data-driven systems, yielding explanations that can increase formal understanding, convey useful medical knowledge, and are more intuitive. Although complying with medical conception, it still needs to be investigated whether knowledge-informed explanations increase medical user acceptance and trust in clinical machine learning-based information systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Explaining increasingly complex machine learning will remain crucial to cope with risks, regulations, responsibilities, and human support in healthcare. However, extant explainable systems mostly provide explanations that mismatch clinical users' conceptions and fail their expectations to leverage validated and clinically relevant information. A key to more user-centric and satisfying explanations can be seen in combining data-driven and knowledge-based systems, i.e., to utilize prior knowledge jointly with the patterns learned from data. We conduct a structured review of knowledge-informed machine learning in healthcare. In this conceptual study, we build on a framework to characterize user knowledge and prior knowledge embodied in explanations. Specifically, we explicate the types and contexts of knowledge to examine the fit between knowledge-informed approaches and users. Our results highlight that knowledge-informed machine learning is a promising paradigm to enrich former data-driven systems, yielding explanations that can increase formal understanding, convey useful medical knowledge, and are more intuitive. Although complying with medical conception, it still needs to be investigated whether knowledge-informed explanations increase medical user acceptance and trust in clinical machine learning-based information systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Explaining increasingly complex machine learning will remain crucial to cope with risks, regulations, responsibilities, and human support in healthcare. However, extant explainable systems mostly provide explanations that mismatch clinical users' conceptions and fail their expectations to leverage validated and clinically relevant information. A key to more user-centric and satisfying explanations can be seen in combining data-driven and knowledge-based systems, i.e., to utilize prior knowledge jointly with the patterns learned from data. We conduct a structured review of knowledge-informed machine learning in healthcare. In this conceptual study, we build on a framework to characterize user knowledge and prior knowledge embodied in explanations. Specifically, we explicate the types and contexts of knowledge to examine the fit between knowledge-informed approaches and users. Our results highlight that knowledge-informed machine learning is a promising paradigm to enrich former data-driven systems, yielding explanations that can increase formal understanding, convey useful medical knowledge, and are more intuitive. Although complying with medical conception, it still needs to be investigated whether knowledge-informed explanations increase medical user acceptance and trust in clinical machine learning-based information systems.",
"title": "User-Centric Explainability in Healthcare: A Knowledge-Level Perspective of Informed Machine Learning",
"normalizedTitle": "User-Centric Explainability in Healthcare: A Knowledge-Level Perspective of Informed Machine Learning",
"fno": "09971460",
"hasPdf": true,
"idPrefix": "ai",
"keywords": [
"Artificial Intelligence",
"Medical Diagnostic Imaging",
"Medical Services",
"Machine Learning",
"Diseases",
"Data Models",
"Predictive Models",
"Artificial Intelligence In Medicine",
"Explainable Artificial Intelligence",
"Human Centered Artificial Intelligence",
"Interpretable Artificial Intelligence",
"Knowledge Based Systems",
"Machine Learning"
],
"authors": [
{
"givenName": "Luis",
"surname": "Oberste",
"fullName": "Luis Oberste",
"affiliation": "University of Mannheim, Mannheim, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Armin",
"surname": "Heinzl",
"fullName": "Armin Heinzl",
"affiliation": "University of Mannheim, Mannheim, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "1-18",
"year": "5555",
"issn": "2691-4581",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/asonam/2015/3854/0/07403683",
"title": "Inside chronic autoimmune disease communities: A social networks perspective to Crohn's patient behavior and medical information",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2015/07403683/12OmNAOKnYD",
"parentPublication": {
"id": "proceedings/asonam/2015/3854/0",
"title": "2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aqtr/2016/8692/0/07501301",
"title": "Integrated innovative solutions to improve healthcare scheduling",
"doi": null,
"abstractUrl": "/proceedings-article/aqtr/2016/07501301/12OmNscfI0a",
"parentPublication": {
"id": "proceedings/aqtr/2016/8692/0",
"title": "2016 IEEE International Conference on Automation, Quality and Testing, Robotics (AQTR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2017/0367/2/0367b107",
"title": "Standardizing the Crowdsourcing of Healthcare Data Using Modular Ontologies",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2017/0367b107/12OmNvAAtmB",
"parentPublication": {
"id": "compsac/2017/0367/2",
"title": "2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciev-iscmht/2017/1023/0/08338606",
"title": "IHEMHA: Interactive healthcare system design with emotion computing and medical history analysis",
"doi": null,
"abstractUrl": "/proceedings-article/iciev-iscmht/2017/08338606/12OmNxFaLof",
"parentPublication": {
"id": "proceedings/iciev-iscmht/2017/1023/0",
"title": "2017 6th International Conference on Informatics, Electronics and Vision & 2017 7th International Symposium in Computational Medical and Health Technology (ICIEV-ISCMHT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2015/6564/3/6564c288",
"title": "Towards an Applied Oral Health Ontology: A Round Trip between Clinical Data and Experiential Medical Knowledge",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2015/6564c288/12OmNyv7m6M",
"parentPublication": {
"id": "proceedings/compsac/2015/6564/3",
"title": "2015 IEEE 39th Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icebe/2014/6563/0/6563a013",
"title": "A Human-centric User Model for Intelligent Healthcare",
"doi": null,
"abstractUrl": "/proceedings-article/icebe/2014/6563a013/12OmNzTH0G4",
"parentPublication": {
"id": "proceedings/icebe/2014/6563/0",
"title": "2014 IEEE 11th International Conference on e-Business Engineering (ICEBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/i-span/2018/8534/0/853400a318",
"title": "Intelligent Healthcare Knowledge Resources in Chinese: A Survey",
"doi": null,
"abstractUrl": "/proceedings-article/i-span/2018/853400a318/17D45XtvpeZ",
"parentPublication": {
"id": "proceedings/i-span/2018/8534/0",
"title": "2018 15th International Symposium on Pervasive Systems, Algorithms and Networks (I-SPAN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/5555/01/09857572",
"title": "Knowledge Guided Feature Aggregation for the Prediction of Chronic Obstructive Pulmonary Disease With Chinese EMRs",
"doi": null,
"abstractUrl": "/journal/tb/5555/01/09857572/1FSY3C6YIIE",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/5555/01/10059324",
"title": "Deep Learning-Empowered Clinical Big Data Analytics in Healthcare Digital Twins",
"doi": null,
"abstractUrl": "/journal/tb/5555/01/10059324/1LiKHJlqO2s",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acomp/2019/4723/0/472300a023",
"title": "Blueprinting the Workflow of Medical Diagnosis through the Lens of Machine Learning Perspective",
"doi": null,
"abstractUrl": "/proceedings-article/acomp/2019/472300a023/1ivu5D8lHcQ",
"parentPublication": {
"id": "proceedings/acomp/2019/4723/0",
"title": "2019 International Conference on Advanced Computing and Applications (ACOMP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09971466",
"articleId": "1ISVU02vEvS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09971462",
"articleId": "1ISVUhOqtsk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz5apxc",
"title": "July",
"year": "2017",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgz4m",
"doi": "10.1109/TVCG.2016.2549018",
"abstract": "We systematically reviewed 64 user-study papers on data glyphs to help researchers and practitioners gain an informed understanding of tradeoffs in the glyph design space. The glyphs we consider are individual representations of multi-dimensional data points, often meant to be shown in small-multiple settings. Over the past 60 years many different glyph designs were proposed and many of these designs have been subjected to perceptual or comparative evaluations. Yet, a systematic overview of the types of glyphs and design variations tested, the tasks under which they were analyzed, or even the study goals and results does not yet exist. In this paper we provide such an overview by systematically sampling and tabulating the literature on data glyph studies, listing their designs, questions, data, and tasks. In addition we present a concise overview of the types of glyphs and their design characteristics analyzed by researchers in the past, and a synthesis of the study results. Based on our meta analysis of all results we further contribute a set of design implications and a discussion on open research directions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We systematically reviewed 64 user-study papers on data glyphs to help researchers and practitioners gain an informed understanding of tradeoffs in the glyph design space. The glyphs we consider are individual representations of multi-dimensional data points, often meant to be shown in small-multiple settings. Over the past 60 years many different glyph designs were proposed and many of these designs have been subjected to perceptual or comparative evaluations. Yet, a systematic overview of the types of glyphs and design variations tested, the tasks under which they were analyzed, or even the study goals and results does not yet exist. In this paper we provide such an overview by systematically sampling and tabulating the literature on data glyph studies, listing their designs, questions, data, and tasks. In addition we present a concise overview of the types of glyphs and their design characteristics analyzed by researchers in the past, and a synthesis of the study results. Based on our meta analysis of all results we further contribute a set of design implications and a discussion on open research directions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We systematically reviewed 64 user-study papers on data glyphs to help researchers and practitioners gain an informed understanding of tradeoffs in the glyph design space. The glyphs we consider are individual representations of multi-dimensional data points, often meant to be shown in small-multiple settings. Over the past 60 years many different glyph designs were proposed and many of these designs have been subjected to perceptual or comparative evaluations. Yet, a systematic overview of the types of glyphs and design variations tested, the tasks under which they were analyzed, or even the study goals and results does not yet exist. In this paper we provide such an overview by systematically sampling and tabulating the literature on data glyph studies, listing their designs, questions, data, and tasks. In addition we present a concise overview of the types of glyphs and their design characteristics analyzed by researchers in the past, and a synthesis of the study results. Based on our meta analysis of all results we further contribute a set of design implications and a discussion on open research directions.",
"title": "A Systematic Review of Experimental Studies on Data Glyphs",
"normalizedTitle": "A Systematic Review of Experimental Studies on Data Glyphs",
"fno": "07445239",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Data Visualization",
"Systematics",
"Layout",
"Encoding",
"Guidelines",
"Survey",
"Glyphs",
"Quantitative Evaluation",
"Glyph Design"
],
"authors": [
{
"givenName": "Johannes",
"surname": "Fuchs",
"fullName": "Johannes Fuchs",
"affiliation": "University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Petra",
"surname": "Isenberg",
"fullName": "Petra Isenberg",
"affiliation": "Inria, Paris, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anastasia",
"surname": "Bezerianos",
"fullName": "Anastasia Bezerianos",
"affiliation": "Univ Paris Sud, CNRS & Inria, Paris, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Keim",
"fullName": "Daniel Keim",
"affiliation": "University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2017-07-01 00:00:00",
"pubType": "trans",
"pages": "1863-1879",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2014/12/06875973",
"title": "The Influence of Contour on Similarity Perception of Star Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875973/13rRUwhHcQV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1996/03/v0266",
"title": "Glyphs for Visualizing Uncertainty in Vector Fields",
"doi": null,
"abstractUrl": "/journal/tg/1996/03/v0266/13rRUxly8SN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/08/ttg2013081331",
"title": "Representing Flow Patterns by Using Streamlines with Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2013/08/ttg2013081331/13rRUxly9dT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a058",
"title": "Visualizing Multidimensional Data in Treemaps with Adaptive Glyphs",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a058/17D45XeKgvR",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09930144",
"title": "Out of the Plane: Flower Vs. Star Glyphs to Support High-Dimensional Exploration in Two-Dimensional Embeddings",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09930144/1HMOX2J2VMY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a157",
"title": "Evaluation of Effectiveness of Glyphs to Enhance ChronoView",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a157/1cMF9mvWMFO",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09067088",
"title": "AgentVis: Visual Analysis of Agent Behavior With Hierarchical Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09067088/1j1lyTz50k0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a242",
"title": "A summarization glyph for sets of unreadable visual items in treemaps",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a242/1rSRaQV3b3y",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552906",
"title": "Generative Design Inspiration for Glyphs with Diatoms",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552906/1xic46x3fmU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557223",
"title": "GlyphCreator: Towards Example-based Automatic Generation of Circular Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557223/1xlvZajdjmo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07452668",
"articleId": "13rRUwbJD4Q",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgK8",
"title": "Dec.",
"year": "2014",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwhHcQV",
"doi": "10.1109/TVCG.2014.2346426",
"abstract": "We conducted three experiments to investigate the effects of contours on the detection of data similarity with star glyph variations. A star glyph is a small, compact, data graphic that represents a multi-dimensional data point. Star glyphs are often used in small-multiple settings, to represent data points in tables, on maps, or as overlays on other types of data graphics. In these settings, an important task is the visual comparison of the data points encoded in the star glyph, for example to find other similar data points or outliers. We hypothesized that for data comparisons, the overall shape of a star glyph-enhanced through contour lines-would aid the viewer in making accurate similarity judgments. To test this hypothesis, we conducted three experiments. In our first experiment, we explored how the use of contours influenced how visualization experts and trained novices chose glyphs with similar data values. Our results showed that glyphs without contours make the detection of data similarity easier. Given these results, we conducted a second study to understand intuitive notions of similarity. Star glyphs without contours most intuitively supported the detection of data similarity. In a third experiment, we tested the effect of star glyph reference structures (i.e., tickmarks and gridlines) on the detection of similarity. Surprisingly, our results show that adding reference structures does improve the correctness of similarity judgments for star glyphs with contours, but not for the standard star glyph. As a result of these experiments, we conclude that the simple star glyph without contours performs best under several criteria, reinforcing its practice and popularity in the literature. Contours seem to enhance the detection of other types of similarity, e. g., shape similarity and are distracting when data similarity has to be judged. Based on these findings we provide design considerations regarding the use of contours and reference structures on star glyphs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We conducted three experiments to investigate the effects of contours on the detection of data similarity with star glyph variations. A star glyph is a small, compact, data graphic that represents a multi-dimensional data point. Star glyphs are often used in small-multiple settings, to represent data points in tables, on maps, or as overlays on other types of data graphics. In these settings, an important task is the visual comparison of the data points encoded in the star glyph, for example to find other similar data points or outliers. We hypothesized that for data comparisons, the overall shape of a star glyph-enhanced through contour lines-would aid the viewer in making accurate similarity judgments. To test this hypothesis, we conducted three experiments. In our first experiment, we explored how the use of contours influenced how visualization experts and trained novices chose glyphs with similar data values. Our results showed that glyphs without contours make the detection of data similarity easier. Given these results, we conducted a second study to understand intuitive notions of similarity. Star glyphs without contours most intuitively supported the detection of data similarity. In a third experiment, we tested the effect of star glyph reference structures (i.e., tickmarks and gridlines) on the detection of similarity. Surprisingly, our results show that adding reference structures does improve the correctness of similarity judgments for star glyphs with contours, but not for the standard star glyph. As a result of these experiments, we conclude that the simple star glyph without contours performs best under several criteria, reinforcing its practice and popularity in the literature. Contours seem to enhance the detection of other types of similarity, e. g., shape similarity and are distracting when data similarity has to be judged. Based on these findings we provide design considerations regarding the use of contours and reference structures on star glyphs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We conducted three experiments to investigate the effects of contours on the detection of data similarity with star glyph variations. A star glyph is a small, compact, data graphic that represents a multi-dimensional data point. Star glyphs are often used in small-multiple settings, to represent data points in tables, on maps, or as overlays on other types of data graphics. In these settings, an important task is the visual comparison of the data points encoded in the star glyph, for example to find other similar data points or outliers. We hypothesized that for data comparisons, the overall shape of a star glyph-enhanced through contour lines-would aid the viewer in making accurate similarity judgments. To test this hypothesis, we conducted three experiments. In our first experiment, we explored how the use of contours influenced how visualization experts and trained novices chose glyphs with similar data values. Our results showed that glyphs without contours make the detection of data similarity easier. Given these results, we conducted a second study to understand intuitive notions of similarity. Star glyphs without contours most intuitively supported the detection of data similarity. In a third experiment, we tested the effect of star glyph reference structures (i.e., tickmarks and gridlines) on the detection of similarity. Surprisingly, our results show that adding reference structures does improve the correctness of similarity judgments for star glyphs with contours, but not for the standard star glyph. As a result of these experiments, we conclude that the simple star glyph without contours performs best under several criteria, reinforcing its practice and popularity in the literature. Contours seem to enhance the detection of other types of similarity, e. g., shape similarity and are distracting when data similarity has to be judged. Based on these findings we provide design considerations regarding the use of contours and reference structures on star glyphs.",
"title": "The Influence of Contour on Similarity Perception of Star Glyphs",
"normalizedTitle": "The Influence of Contour on Similarity Perception of Star Glyphs",
"fno": "06875973",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Shape Analysis",
"Data Visualization",
"Data Analysis",
"Active Contours"
],
"authors": [
{
"givenName": "Johannes",
"surname": "Fuchs",
"fullName": "Johannes Fuchs",
"affiliation": "University of Konstanz",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Petra",
"surname": "Isenberg",
"fullName": "Petra Isenberg",
"affiliation": "Inria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anastasia",
"surname": "Bezerianos",
"fullName": "Anastasia Bezerianos",
"affiliation": "CNRS & Inria, Université Paris-Sud",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fabian",
"surname": "Fischer",
"fullName": "Fabian Fischer",
"affiliation": "University of Konstanz",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Enrico",
"surname": "Bertini",
"fullName": "Enrico Bertini",
"affiliation": "NYU Poly",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2251-2260",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/scivis/2015/9785/0/07429504",
"title": "3D superquadric glyphs for visualizing myocardial motion",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2015/07429504/12OmNrIaemh",
"parentPublication": {
"id": "proceedings/scivis/2015/9785/0",
"title": "2015 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/infvis/2005/9464/0/01532141",
"title": "An interactive 3D integration of parallel coordinates and star glyphs",
"doi": null,
"abstractUrl": "/proceedings-article/infvis/2005/01532141/12OmNyuPLlh",
"parentPublication": {
"id": "proceedings/infvis/2005/9464/0",
"title": "IEEE Symposium on Information Visualization (InfoVis 05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/01532141",
"title": "An interactive 3D integration of parallel coordinates and star glyphs",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/01532141/12OmNzZEAtN",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900020",
"title": "An Interactive 3D Integration of Parallel Coordinates and Star Glyphs",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900020/12OmNzkMlUx",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a058",
"title": "Visualizing Multidimensional Data in Treemaps with Adaptive Glyphs",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a058/17D45XeKgvR",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09930144",
"title": "Out of the Plane: Flower Vs. Star Glyphs to Support High-Dimensional Exploration in Two-Dimensional Embeddings",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09930144/1HMOX2J2VMY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a157",
"title": "Evaluation of Effectiveness of Glyphs to Enhance ChronoView",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a157/1cMF9mvWMFO",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933656",
"title": "Evaluating Ordering Strategies of Star Glyph Axes",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933656/1fTgJ3IVtjq",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09067088",
"title": "AgentVis: Visual Analysis of Agent Behavior With Hierarchical Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09067088/1j1lyTz50k0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557223",
"title": "GlyphCreator: Towards Example-based Automatic Generation of Circular Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557223/1xlvZajdjmo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06876010",
"articleId": "13rRUxD9gXK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06875940",
"articleId": "13rRUIIVlki",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwJPMX5",
"title": "Dec.",
"year": "2011",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxC0SOU",
"doi": "10.1109/TVCG.2011.203",
"abstract": "A new type of glyph is introduced to visualize unsteady flow with static images, allowing easier analysis of time-dependent phenomena compared to animated visualization. Adopting the visual metaphor of radar displays, this glyph represents flow directions by angles and time by radius in spherical coordinates. Dense seeding of flow radar glyphs on the flow domain naturally lends itself to multi-scale visualization: zoomed-out views show aggregated overviews, zooming-in enables detailed analysis of spatial and temporal characteristics. Uncertainty visualization is supported by extending the glyph to display possible ranges of flow directions. The paper focuses on 2D flow, but includes a discussion of 3D flow as well. Examples from CFD and the field of stochastic hydrogeology show that it is easy to discriminate regions of different spatiotemporal flow behavior and regions of different uncertainty variations in space and time. The examples also demonstrate that parameter studies can be analyzed because the glyph design facilitates comparative visualization. Finally, different variants of interactive GPU-accelerated implementations are discussed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A new type of glyph is introduced to visualize unsteady flow with static images, allowing easier analysis of time-dependent phenomena compared to animated visualization. Adopting the visual metaphor of radar displays, this glyph represents flow directions by angles and time by radius in spherical coordinates. Dense seeding of flow radar glyphs on the flow domain naturally lends itself to multi-scale visualization: zoomed-out views show aggregated overviews, zooming-in enables detailed analysis of spatial and temporal characteristics. Uncertainty visualization is supported by extending the glyph to display possible ranges of flow directions. The paper focuses on 2D flow, but includes a discussion of 3D flow as well. Examples from CFD and the field of stochastic hydrogeology show that it is easy to discriminate regions of different spatiotemporal flow behavior and regions of different uncertainty variations in space and time. The examples also demonstrate that parameter studies can be analyzed because the glyph design facilitates comparative visualization. Finally, different variants of interactive GPU-accelerated implementations are discussed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A new type of glyph is introduced to visualize unsteady flow with static images, allowing easier analysis of time-dependent phenomena compared to animated visualization. Adopting the visual metaphor of radar displays, this glyph represents flow directions by angles and time by radius in spherical coordinates. Dense seeding of flow radar glyphs on the flow domain naturally lends itself to multi-scale visualization: zoomed-out views show aggregated overviews, zooming-in enables detailed analysis of spatial and temporal characteristics. Uncertainty visualization is supported by extending the glyph to display possible ranges of flow directions. The paper focuses on 2D flow, but includes a discussion of 3D flow as well. Examples from CFD and the field of stochastic hydrogeology show that it is easy to discriminate regions of different spatiotemporal flow behavior and regions of different uncertainty variations in space and time. The examples also demonstrate that parameter studies can be analyzed because the glyph design facilitates comparative visualization. Finally, different variants of interactive GPU-accelerated implementations are discussed.",
"title": "Flow Radar Glyphs—Static Visualization of Unsteady Flow with Uncertainty",
"normalizedTitle": "Flow Radar Glyphs—Static Visualization of Unsteady Flow with Uncertainty",
"fno": "ttg2011121949",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Glyph",
"Uncertainty",
"Unsteady Flow"
],
"authors": [
{
"givenName": "Marcel",
"surname": "Hlawatsch",
"fullName": "Marcel Hlawatsch",
"affiliation": "Visualization Research Center, University of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Philipp",
"surname": "Leube",
"fullName": "Philipp Leube",
"affiliation": "Institute of Hydraulic Engineering (LH2), University of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wolfgang",
"surname": "Nowak",
"fullName": "Wolfgang Nowak",
"affiliation": "Institute of Hydraulic Engineering (LH2), University of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Weiskopf",
"fullName": "Daniel Weiskopf",
"affiliation": "Visualization Research Center, University of Stuttgart",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "1949-1958",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/27660082",
"title": "Texture-Based Visualization of Uncertainty in Flow Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660082/12OmNB9KHue",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1995/7187/0/71870329",
"title": "Unsteady Flow Volumes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870329/12OmNqI04HL",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1996/3673/0/36730249",
"title": "UFLOW: Visualizing Uncertainty in Fluid Flow",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1996/36730249/12OmNs59JIG",
"parentPublication": {
"id": "proceedings/ieee-vis/1996/3673/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300018",
"title": "Image Space Based Visualization of Unsteady Flow on Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300018/12OmNxH9Xhw",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1996/3673/0/36730389",
"title": "Directional Flow Visualization of Vector Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1996/36730389/12OmNyrIas8",
"parentPublication": {
"id": "proceedings/ieee-vis/1996/3673/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/03/ttg2008030615",
"title": "Parallel Vectors Criteria for Unsteady Flow Vortices",
"doi": null,
"abstractUrl": "/journal/tg/2008/03/ttg2008030615/13rRUxAASSW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2002/03/v0211",
"title": "Lagrangian-Eulerian Advection of Noise and Dye Textures for Unsteady Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2002/03/v0211/13rRUxD9h4X",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1996/03/v0266",
"title": "Glyphs for Visualizing Uncertainty in Vector Fields",
"doi": null,
"abstractUrl": "/journal/tg/1996/03/v0266/13rRUxly8SN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/08/ttg2013081331",
"title": "Representing Flow Patterns by Using Streamlines with Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2013/08/ttg2013081331/13rRUxly9dT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/02/v0113",
"title": "Accelerated Unsteady Flow Line Integral Convolution",
"doi": null,
"abstractUrl": "/journal/tg/2005/02/v0113/13rRUyuegh2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011121942",
"articleId": "13rRUxjQyhq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011121959",
"articleId": "13rRUEgarBs",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNC36tSf",
"title": "Aug.",
"year": "2013",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxly9dT",
"doi": "10.1109/TVCG.2013.10",
"abstract": "Most professional wind visualizations show wind speed and direction using a glyph called a wind barb in a grid pattern. Research into flow visualization has suggested that streamlines better represent flow patterns but these methods lack a key property - unlike the wind barb, they do not accurately convey the wind speed. With the goal of improving the perception of wind patterns, and at least equaling the quantitative quality of wind barbs, we designed two variations on the wind barb and designed a new quantitative glyph. All of our new designs space glyph elements along equally spaced streamlines. To evaluate these designs, we used a North American mesoscale forecast model. We tested the ability of subjects to determine direction and speed using two different densities each of three new designs as well as the classic wind barb. A second experiment evaluated how effectively each of the designs represented wind patterns. The results showed that the new design is superior to the classic, but they also showed that the classic barb can be redesigned and substantially improved. We suggest that flow patterns with integrated glyphs may have widespread application in flow visualization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Most professional wind visualizations show wind speed and direction using a glyph called a wind barb in a grid pattern. Research into flow visualization has suggested that streamlines better represent flow patterns but these methods lack a key property - unlike the wind barb, they do not accurately convey the wind speed. With the goal of improving the perception of wind patterns, and at least equaling the quantitative quality of wind barbs, we designed two variations on the wind barb and designed a new quantitative glyph. All of our new designs space glyph elements along equally spaced streamlines. To evaluate these designs, we used a North American mesoscale forecast model. We tested the ability of subjects to determine direction and speed using two different densities each of three new designs as well as the classic wind barb. A second experiment evaluated how effectively each of the designs represented wind patterns. The results showed that the new design is superior to the classic, but they also showed that the classic barb can be redesigned and substantially improved. We suggest that flow patterns with integrated glyphs may have widespread application in flow visualization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Most professional wind visualizations show wind speed and direction using a glyph called a wind barb in a grid pattern. Research into flow visualization has suggested that streamlines better represent flow patterns but these methods lack a key property - unlike the wind barb, they do not accurately convey the wind speed. With the goal of improving the perception of wind patterns, and at least equaling the quantitative quality of wind barbs, we designed two variations on the wind barb and designed a new quantitative glyph. All of our new designs space glyph elements along equally spaced streamlines. To evaluate these designs, we used a North American mesoscale forecast model. We tested the ability of subjects to determine direction and speed using two different densities each of three new designs as well as the classic wind barb. A second experiment evaluated how effectively each of the designs represented wind patterns. The results showed that the new design is superior to the classic, but they also showed that the classic barb can be redesigned and substantially improved. We suggest that flow patterns with integrated glyphs may have widespread application in flow visualization.",
"title": "Representing Flow Patterns by Using Streamlines with Glyphs",
"normalizedTitle": "Representing Flow Patterns by Using Streamlines with Glyphs",
"fno": "ttg2013081331",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Wind Speed",
"Visualization",
"Wind Forecasting",
"Shafts",
"Encoding",
"Bars",
"Multivariate Visualization",
"Streamline Placement",
"Wind Barb",
"Glyph",
"Flow Visualization",
"Weather Maps"
],
"authors": [
{
"givenName": "D. H. F.",
"surname": "Pilar",
"fullName": "D. H. F. Pilar",
"affiliation": "Center for Coastal & Ocean Mapping, Univ. of New Hampshire, Durham, NH, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "C.",
"surname": "Ware",
"fullName": "C. Ware",
"affiliation": "Center for Coastal & Ocean Mapping, Univ. of New Hampshire, Durham, NH, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2013-08-01 00:00:00",
"pubType": "trans",
"pages": "1331-1341",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cis/2011/4584/0/4584b174",
"title": "Multiresolution Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584b174/12OmNz6iOml",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/07/07445239",
"title": "A Systematic Review of Experimental Studies on Data Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2017/07/07445239/13rRUNvgz4m",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/06/v0609",
"title": "Comparative Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2004/06/v0609/13rRUwgQpqB",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011121949",
"title": "Flow Radar Glyphs—Static Visualization of Unsteady Flow with Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011121949/13rRUxC0SOU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122603",
"title": "Taxonomy-Based Glyph Design—with a Case Study on Visualizing Workflows of Biological Experiments",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122603/13rRUxD9h57",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061216",
"title": "An Information-Theoretic Framework for Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061216/13rRUxDIthc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1996/03/v0266",
"title": "Glyphs for Visualizing Uncertainty in Vector Fields",
"doi": null,
"abstractUrl": "/journal/tg/1996/03/v0266/13rRUxly8SN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/07/ttg2013071185",
"title": "Parallel Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/journal/tg/2013/07/ttg2013071185/13rRUyfbwqG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2018/5500/0/550000a030",
"title": "A Feasible Method of Virtual Flow Field Simulation - Part II: Simulation and Visualization in RTT System",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2018/550000a030/17D45WZZ7Hr",
"parentPublication": {
"id": "proceedings/icisce/2018/5500/0",
"title": "2018 5th International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/07/08967163",
"title": "Visualization of 3D Stress Tensor Fields Using Superquadric Glyphs on Displacement Streamlines",
"doi": null,
"abstractUrl": "/journal/tg/2021/07/08967163/1gPjyn904OA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013081317",
"articleId": "13rRUynHuja",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013081342",
"articleId": "13rRUwInvB3",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1H5EXDBdLz2",
"doi": "10.1109/TVCG.2022.3209447",
"abstract": "Glyph-based visualization achieves an impressive graphic design when associated with comprehensive visual metaphors, which help audiences effectively grasp the conveyed information through revealing data semantics. However, creating such metaphoric glyph-based visualization (MGV) is not an easy task, as it requires not only a deep understanding of data but also professional design skills. This paper proposes MetaGlyph, an automatic system for generating MGVs from a spreadsheet. To develop MetaGlyph, we first conduct a qualitative analysis to understand the design of current MGVs from the perspectives of metaphor embodiment and glyph design. Based on the results, we introduce a novel framework for generating MGVs by metaphoric image selection and an MGV construction. Specifically, MetaGlyph automatically selects metaphors with corresponding images from online resources based on the input data semantics. We then integrate a Monte Carlo tree search algorithm that explores the design of an MGV by associating visual elements with data dimensions given the data importance, semantic relevance, and glyph non-overlap. The system also provides editing feedback that allows users to customize the MGVs according to their design preferences. We demonstrate the use of MetaGlyph through a set of examples, one usage scenario, and validate its effectiveness through a series of expert interviews.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Glyph-based visualization achieves an impressive graphic design when associated with comprehensive visual metaphors, which help audiences effectively grasp the conveyed information through revealing data semantics. However, creating such metaphoric glyph-based visualization (MGV) is not an easy task, as it requires not only a deep understanding of data but also professional design skills. This paper proposes MetaGlyph, an automatic system for generating MGVs from a spreadsheet. To develop MetaGlyph, we first conduct a qualitative analysis to understand the design of current MGVs from the perspectives of metaphor embodiment and glyph design. Based on the results, we introduce a novel framework for generating MGVs by metaphoric image selection and an MGV construction. Specifically, MetaGlyph automatically selects metaphors with corresponding images from online resources based on the input data semantics. We then integrate a Monte Carlo tree search algorithm that explores the design of an MGV by associating visual elements with data dimensions given the data importance, semantic relevance, and glyph non-overlap. The system also provides editing feedback that allows users to customize the MGVs according to their design preferences. We demonstrate the use of MetaGlyph through a set of examples, one usage scenario, and validate its effectiveness through a series of expert interviews.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Glyph-based visualization achieves an impressive graphic design when associated with comprehensive visual metaphors, which help audiences effectively grasp the conveyed information through revealing data semantics. However, creating such metaphoric glyph-based visualization (MGV) is not an easy task, as it requires not only a deep understanding of data but also professional design skills. This paper proposes MetaGlyph, an automatic system for generating MGVs from a spreadsheet. To develop MetaGlyph, we first conduct a qualitative analysis to understand the design of current MGVs from the perspectives of metaphor embodiment and glyph design. Based on the results, we introduce a novel framework for generating MGVs by metaphoric image selection and an MGV construction. Specifically, MetaGlyph automatically selects metaphors with corresponding images from online resources based on the input data semantics. We then integrate a Monte Carlo tree search algorithm that explores the design of an MGV by associating visual elements with data dimensions given the data importance, semantic relevance, and glyph non-overlap. The system also provides editing feedback that allows users to customize the MGVs according to their design preferences. We demonstrate the use of MetaGlyph through a set of examples, one usage scenario, and validate its effectiveness through a series of expert interviews.",
"title": "MetaGlyph: Automatic Generation of Metaphoric Glyph-based Visualization",
"normalizedTitle": "MetaGlyph: Automatic Generation of Metaphoric Glyph-based Visualization",
"fno": "09906974",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Graphics",
"Data Visualisation",
"Monte Carlo Methods",
"Tree Searching",
"Automatic Generation",
"Comprehensive Visual Metaphors",
"Design Preferences",
"Glyph Design",
"Glyph Nonoverlap",
"Impressive Graphic Design",
"Input Data Semantics",
"Meta Glyph",
"Metaphor Embodiment",
"Metaphoric Glyph Based Visualization",
"Metaphoric Image Selection",
"MG Vs",
"Professional Design Skills",
"Visual Elements",
"Data Visualization",
"Visualization",
"Semantics",
"Layout",
"Authoring Systems",
"Task Analysis",
"Shape",
"Glyph Based Visualization",
"Metaphor",
"Machine Learning",
"Automatic Visualization"
],
"authors": [
{
"givenName": "Lu",
"surname": "Ying",
"fullName": "Lu Ying",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xinhuan",
"surname": "Shu",
"fullName": "Xinhuan Shu",
"affiliation": "Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dazhen",
"surname": "Deng",
"fullName": "Dazhen Deng",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuchen",
"surname": "Yang",
"fullName": "Yuchen Yang",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tan",
"surname": "Tang",
"fullName": "Tan Tang",
"affiliation": "School of Art and Archaeology, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lingyun",
"surname": "Yu",
"fullName": "Lingyun Yu",
"affiliation": "Department of Computing, Xi'an Jiaotong-Liverpool University, Suzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "331-341",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2015/08/06684146",
"title": "Glyph-Based Video Visualization for Semen Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2015/08/06684146/13rRUILLkvv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539643",
"title": "GlyphLens: View-Dependent Occlusion Management in the Interactive Glyph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539643/13rRUwInvJk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192722",
"title": "Glyph-Based Comparative Visualization for Diffusion Tensor Fields",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192722/13rRUx0gefn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122603",
"title": "Taxonomy-Based Glyph Design—with a Case Study on Visualizing Workflows of Biological Experiments",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122603/13rRUxD9h57",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/08/08611113",
"title": "MARVisT: Authoring Glyph-Based Visualization in Mobile Augmented Reality",
"doi": null,
"abstractUrl": "/journal/tg/2020/08/08611113/17D45Wuc367",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a071",
"title": "The Many-Faced Plot: Strategy for Automatic Glyph Generation",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a071/17D45XDIXSv",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2019/3888/0/08925435",
"title": "Multiple metaphors in metaphoric gesturing",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2019/08925435/1fHGB11ke52",
"parentPublication": {
"id": "proceedings/acii/2019/3888/0",
"title": "2019 8th International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a242",
"title": "A summarization glyph for sets of unreadable visual items in treemaps",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a242/1rSRaQV3b3y",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552906",
"title": "Generative Design Inspiration for Glyphs with Diatoms",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552906/1xic46x3fmU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557223",
"title": "GlyphCreator: Towards Example-based Automatic Generation of Circular Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557223/1xlvZajdjmo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09904448",
"articleId": "1H1gmbVShUI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09903550",
"articleId": "1GZolSVvsPu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1J9yL0HzvWw",
"name": "ttg202301-09906974s1-supp1-3209447.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09906974s1-supp1-3209447.mp4",
"extension": "mp4",
"size": "125 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqJZgIB",
"title": "April",
"year": "2020",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1gPjxXgWQM0",
"doi": "10.1109/TVCG.2020.2969060",
"abstract": "Rigorous data science is interdisciplinary at its core. In order to make sense of high-dimensional data, data scientists need to enter into a dialogue with domain experts. We present Glyphboard, a visualization tool that aims to support this dialogue. Glyphboard is a zoomable user interface that combines well-known methods such as dimensionality reduction and glyph-based visualizations in a novel, seamless, and integrated tool. While the dimensionality reduction affords a quick overview over the data, glyph-based visualizations are able to show the most relevant dimensions in the data set at one glance. We contribute an open-source prototype of Glyphboard, a general exchange format for high-dimensional data, and a case study with nine data scientists and domain experts from four exemplary domains in order to evaluate how the different visualization and interaction features of Glyphboard are used.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Rigorous data science is interdisciplinary at its core. In order to make sense of high-dimensional data, data scientists need to enter into a dialogue with domain experts. We present Glyphboard, a visualization tool that aims to support this dialogue. Glyphboard is a zoomable user interface that combines well-known methods such as dimensionality reduction and glyph-based visualizations in a novel, seamless, and integrated tool. While the dimensionality reduction affords a quick overview over the data, glyph-based visualizations are able to show the most relevant dimensions in the data set at one glance. We contribute an open-source prototype of Glyphboard, a general exchange format for high-dimensional data, and a case study with nine data scientists and domain experts from four exemplary domains in order to evaluate how the different visualization and interaction features of Glyphboard are used.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Rigorous data science is interdisciplinary at its core. In order to make sense of high-dimensional data, data scientists need to enter into a dialogue with domain experts. We present Glyphboard, a visualization tool that aims to support this dialogue. Glyphboard is a zoomable user interface that combines well-known methods such as dimensionality reduction and glyph-based visualizations in a novel, seamless, and integrated tool. While the dimensionality reduction affords a quick overview over the data, glyph-based visualizations are able to show the most relevant dimensions in the data set at one glance. We contribute an open-source prototype of Glyphboard, a general exchange format for high-dimensional data, and a case study with nine data scientists and domain experts from four exemplary domains in order to evaluate how the different visualization and interaction features of Glyphboard are used.",
"title": "Glyphboard: Visual Exploration of High-Dimensional Data Combining Glyphs with Dimensionality Reduction",
"normalizedTitle": "Glyphboard: Visual Exploration of High-Dimensional Data Combining Glyphs with Dimensionality Reduction",
"fno": "08967136",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Reduction",
"Data Visualisation",
"Human Computer Interaction",
"Public Domain Software",
"User Interfaces",
"Glyphboard",
"Visualization Tool",
"Glyph Based Visualizations",
"Dimensionality Reduction",
"Interaction Features",
"High Dimensional Data",
"Data Science",
"Zoomable User Interface",
"Open Source Prototype",
"Data Visualization",
"Task Analysis",
"Visualization",
"Tools",
"Image Color Analysis",
"Dimensionality Reduction",
"Shape",
"Human Centered Computing",
"Visualization Systems And Tools",
"Empirical Studies In Interaction Design",
"Data Analytics"
],
"authors": [
{
"givenName": "Dietrich",
"surname": "Kammer",
"fullName": "Dietrich Kammer",
"affiliation": "University of Applied Sciences Dresden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mandy",
"surname": "Keck",
"fullName": "Mandy Keck",
"affiliation": "Technische Universität Dresden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Gründer",
"fullName": "Thomas Gründer",
"affiliation": "Technische Universität Dresden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexander",
"surname": "Maasch",
"fullName": "Alexander Maasch",
"affiliation": "chemmedia AG",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Thom",
"fullName": "Thomas Thom",
"affiliation": "deecoob Technology GmbH",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Martin",
"surname": "Kleinsteuber",
"fullName": "Martin Kleinsteuber",
"affiliation": "Mercateo Services GmbH & Co. KG",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rainer",
"surname": "Groh",
"fullName": "Rainer Groh",
"affiliation": "Technische Universität Dresden",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2020-04-01 00:00:00",
"pubType": "trans",
"pages": "1661-1671",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2004/04/v0459",
"title": "Robust Linear Dimensionality Reduction",
"doi": null,
"abstractUrl": "/journal/tg/2004/04/v0459/13rRUxBJhFl",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a058",
"title": "Visualizing Multidimensional Data in Treemaps with Adaptive Glyphs",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a058/17D45XeKgvR",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/2022/06/09878189",
"title": "Integrating Constraints Into Dimensionality Reduction for Visualization: A Survey",
"doi": null,
"abstractUrl": "/journal/ai/2022/06/09878189/1GrP8bfHhFm",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904480",
"title": "Interactive Visual Cluster Analysis by Contrastive Dimensionality Reduction",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904480/1H0GkV5P1qo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600a336",
"title": "Hierarchical Nearest Neighbor Graph Embedding for Efficient Dimensionality Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600a336/1H1lqnl2JAQ",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09930144",
"title": "Out of the Plane: Flower Vs. Star Glyphs to Support High-Dimensional Exploration in Two-Dimensional Embeddings",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09930144/1HMOX2J2VMY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a228",
"title": "User-guided Dimensionality Reduction Ensembles",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a228/1cMF9VUpFgA",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933568",
"title": "Interpreting Distortions in Dimensionality Reduction by Superimposing Neighbourhood Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933568/1fTgHgjW7fy",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/07/08967163",
"title": "Visualization of 3D Stress Tensor Fields Using Superquadric Glyphs on Displacement Streamlines",
"doi": null,
"abstractUrl": "/journal/tg/2021/07/08967163/1gPjyn904OA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555244",
"title": "Interactive Dimensionality Reduction for Comparative Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555244/1xjR1QZtkTS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08984335",
"articleId": "1haTxOaV8eA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08511066",
"articleId": "14H4WOKjoti",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1vDhWHXEYZW",
"title": "Sept.",
"year": "2021",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1j1lyTz50k0",
"doi": "10.1109/TVCG.2020.2985923",
"abstract": "Glyphs representing complex behavior provide a useful and common means of visualizing multivariate data. However, due to their complex shape, overlapping, and occlusion of glyphs is a common and prominent limitation. This limits the number of discreet data tuples that can be displayed in a given image. Using a real-world application, glyphs are used to depict agent behavior in a call center. However, many call centers feature thousands of agents. A standard approach representing thousands of agents with glyphs does not scale. To accommodate the visualization incorporating thousands of glyphs we develop clustering of overlapping glyphs into a single parent glyph. This hierarchical glyph represents the mean value of all child agent glyphs, removing overlap and reduTcing visual clutter. Multi-variate clustering techniques are explored and developed in collaboration with domain experts in the call center industry. We implement dynamic control of glyph clusters according to zoom level and customized distance metrics, to utilize image space with reduced overplotting and cluttering. We demonstrate our technique with examples and a usage scenario using real-world call-center data to visualize thousands of call center agents, revealing insight into their behavior and reporting feedback from expert call-center analysts.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Glyphs representing complex behavior provide a useful and common means of visualizing multivariate data. However, due to their complex shape, overlapping, and occlusion of glyphs is a common and prominent limitation. This limits the number of discreet data tuples that can be displayed in a given image. Using a real-world application, glyphs are used to depict agent behavior in a call center. However, many call centers feature thousands of agents. A standard approach representing thousands of agents with glyphs does not scale. To accommodate the visualization incorporating thousands of glyphs we develop clustering of overlapping glyphs into a single parent glyph. This hierarchical glyph represents the mean value of all child agent glyphs, removing overlap and reduTcing visual clutter. Multi-variate clustering techniques are explored and developed in collaboration with domain experts in the call center industry. We implement dynamic control of glyph clusters according to zoom level and customized distance metrics, to utilize image space with reduced overplotting and cluttering. We demonstrate our technique with examples and a usage scenario using real-world call-center data to visualize thousands of call center agents, revealing insight into their behavior and reporting feedback from expert call-center analysts.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Glyphs representing complex behavior provide a useful and common means of visualizing multivariate data. However, due to their complex shape, overlapping, and occlusion of glyphs is a common and prominent limitation. This limits the number of discreet data tuples that can be displayed in a given image. Using a real-world application, glyphs are used to depict agent behavior in a call center. However, many call centers feature thousands of agents. A standard approach representing thousands of agents with glyphs does not scale. To accommodate the visualization incorporating thousands of glyphs we develop clustering of overlapping glyphs into a single parent glyph. This hierarchical glyph represents the mean value of all child agent glyphs, removing overlap and reduTcing visual clutter. Multi-variate clustering techniques are explored and developed in collaboration with domain experts in the call center industry. We implement dynamic control of glyph clusters according to zoom level and customized distance metrics, to utilize image space with reduced overplotting and cluttering. We demonstrate our technique with examples and a usage scenario using real-world call-center data to visualize thousands of call center agents, revealing insight into their behavior and reporting feedback from expert call-center analysts.",
"title": "AgentVis: Visual Analysis of Agent Behavior With Hierarchical Glyphs",
"normalizedTitle": "AgentVis: Visual Analysis of Agent Behavior With Hierarchical Glyphs",
"fno": "09067088",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Behavioural Sciences Computing",
"Call Centres",
"Data Visualisation",
"Pattern Clustering",
"Hierarchical Glyph",
"Child Agent Glyphs",
"Glyph Clusters",
"Real World Call Center Data",
"Call Center Agents",
"Agent Behavior",
"Complex Behavior",
"Single Parent Glyph",
"Multivariate Visualization",
"Discreet Data Tuples",
"Overlapping Glyphs",
"Multivariate Clustering",
"Data Visualization",
"Industries",
"Visualization",
"Clutter",
"Collaboration",
"Measurement",
"Shape",
"Glyph",
"Clustering",
"Multivariate Visualization"
],
"authors": [
{
"givenName": "Dylan",
"surname": "Rees",
"fullName": "Dylan Rees",
"affiliation": "Swansea University, Swansea, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert S.",
"surname": "Laramee",
"fullName": "Robert S. Laramee",
"affiliation": "University of Nottingham, Nottingham, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Paul",
"surname": "Brookes",
"fullName": "Paul Brookes",
"affiliation": "QPC Ltd, Mold, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tony",
"surname": "D'Cruze",
"fullName": "Tony D'Cruze",
"affiliation": "QPC Ltd, Mold, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gary A.",
"surname": "Smith",
"fullName": "Gary A. Smith",
"affiliation": "Aria Solutions, Calgary, AB, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aslam",
"surname": "Miah",
"fullName": "Aslam Miah",
"affiliation": "Llansamlet, Admiral Group plc, Swansea, United Kingdom",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2021-09-01 00:00:00",
"pubType": "trans",
"pages": "3626-3643",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/scivis/2015/9785/0/07429504",
"title": "3D superquadric glyphs for visualizing myocardial motion",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2015/07429504/12OmNrIaemh",
"parentPublication": {
"id": "proceedings/scivis/2015/9785/0",
"title": "2015 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a017",
"title": "Non-overlapping Aggregated Multivariate Glyphs for Moving Objects",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a017/12OmNy2agTd",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/07/07445239",
"title": "A Systematic Review of Experimental Studies on Data Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2017/07/07445239/13rRUNvgz4m",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875973",
"title": "The Influence of Contour on Similarity Perception of Star Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875973/13rRUwhHcQV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1996/03/v0266",
"title": "Glyphs for Visualizing Uncertainty in Vector Fields",
"doi": null,
"abstractUrl": "/journal/tg/1996/03/v0266/13rRUxly8SN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a058",
"title": "Visualizing Multidimensional Data in Treemaps with Adaptive Glyphs",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a058/17D45XeKgvR",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a157",
"title": "Evaluation of Effectiveness of Glyphs to Enhance ChronoView",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a157/1cMF9mvWMFO",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/07/08967163",
"title": "Visualization of 3D Stress Tensor Fields Using Superquadric Glyphs on Displacement Streamlines",
"doi": null,
"abstractUrl": "/journal/tg/2021/07/08967163/1gPjyn904OA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552906",
"title": "Generative Design Inspiration for Glyphs with Diatoms",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552906/1xic46x3fmU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557223",
"title": "GlyphCreator: Towards Example-based Automatic Generation of Circular Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557223/1xlvZajdjmo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09035608",
"articleId": "1iaeyXM32ow",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09039699",
"articleId": "1igS4Rezjr2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1vEWTijoPSM",
"name": "ttg202109-09067088s1-supp1-2985923.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202109-09067088s1-supp1-2985923.mp4",
"extension": "mp4",
"size": "67.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xlvZajdjmo",
"doi": "10.1109/TVCG.2021.3114877",
"abstract": "Circular glyphs are used across disparate fields to represent multidimensional data. However, although these glyphs are extremely effective, creating them is often laborious, even for those with professional design skills. This paper presents GlyphCreator, an interactive tool for the example-based generation of circular glyphs. Given an example circular glyph and multidimensional input data, GlyphCreator promptly generates a list of design candidates, any of which can be edited to satisfy the requirements of a particular representation. To develop GlyphCreator, we first derive a design space of circular glyphs by summarizing relationships between different visual elements. With this design space, we build a circular glyph dataset and develop a deep learning model for glyph parsing. The model can deconstruct a circular glyph bitmap into a series of visual elements. Next, we introduce an interface that helps users bind the input data attributes to visual elements and customize visual styles. We evaluate the parsing model through a quantitative experiment, demonstrate the use of GlyphCreator through two use scenarios, and validate its effectiveness through user interviews.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Circular glyphs are used across disparate fields to represent multidimensional data. However, although these glyphs are extremely effective, creating them is often laborious, even for those with professional design skills. This paper presents GlyphCreator, an interactive tool for the example-based generation of circular glyphs. Given an example circular glyph and multidimensional input data, GlyphCreator promptly generates a list of design candidates, any of which can be edited to satisfy the requirements of a particular representation. To develop GlyphCreator, we first derive a design space of circular glyphs by summarizing relationships between different visual elements. With this design space, we build a circular glyph dataset and develop a deep learning model for glyph parsing. The model can deconstruct a circular glyph bitmap into a series of visual elements. Next, we introduce an interface that helps users bind the input data attributes to visual elements and customize visual styles. We evaluate the parsing model through a quantitative experiment, demonstrate the use of GlyphCreator through two use scenarios, and validate its effectiveness through user interviews.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Circular glyphs are used across disparate fields to represent multidimensional data. However, although these glyphs are extremely effective, creating them is often laborious, even for those with professional design skills. This paper presents GlyphCreator, an interactive tool for the example-based generation of circular glyphs. Given an example circular glyph and multidimensional input data, GlyphCreator promptly generates a list of design candidates, any of which can be edited to satisfy the requirements of a particular representation. To develop GlyphCreator, we first derive a design space of circular glyphs by summarizing relationships between different visual elements. With this design space, we build a circular glyph dataset and develop a deep learning model for glyph parsing. The model can deconstruct a circular glyph bitmap into a series of visual elements. Next, we introduce an interface that helps users bind the input data attributes to visual elements and customize visual styles. We evaluate the parsing model through a quantitative experiment, demonstrate the use of GlyphCreator through two use scenarios, and validate its effectiveness through user interviews.",
"title": "GlyphCreator: Towards Example-based Automatic Generation of Circular Glyphs",
"normalizedTitle": "GlyphCreator: Towards Example-based Automatic Generation of Circular Glyphs",
"fno": "09557223",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Visualization",
"Layout",
"Deep Learning",
"Data Mining",
"Tools",
"Task Analysis",
"Glyph Based Visualization",
"Machine Learning",
"Automatic Visualization"
],
"authors": [
{
"givenName": "Lu",
"surname": "Ying",
"fullName": "Lu Ying",
"affiliation": "State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tan",
"surname": "Tangl",
"fullName": "Tan Tangl",
"affiliation": "State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuzhe",
"surname": "Luo",
"fullName": "Yuzhe Luo",
"affiliation": "State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lvkeshen",
"surname": "Shen",
"fullName": "Lvkeshen Shen",
"affiliation": "State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiao",
"surname": "Xie",
"fullName": "Xiao Xie",
"affiliation": "Department of Sport Science, Zhejiang University, Hangrhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lingyun",
"surname": "Yu",
"fullName": "Lingyun Yu",
"affiliation": "Department of Computing, Xi'an Jiaotong-Liverpool University, Suzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": "State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "400-410",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/scivis/2015/9785/0/07429504",
"title": "3D superquadric glyphs for visualizing myocardial motion",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2015/07429504/12OmNrIaemh",
"parentPublication": {
"id": "proceedings/scivis/2015/9785/0",
"title": "2015 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a017",
"title": "Non-overlapping Aggregated Multivariate Glyphs for Moving Objects",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a017/12OmNy2agTd",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2002/1656/0/16560010",
"title": "Sound Glyphs Representing Inheritance Relationships",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2002/16560010/12OmNykTNmv",
"parentPublication": {
"id": "proceedings/iv/2002/1656/0",
"title": "Proceedings Sixth International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/07/07445239",
"title": "A Systematic Review of Experimental Studies on Data Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2017/07/07445239/13rRUNvgz4m",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875973",
"title": "The Influence of Contour on Similarity Perception of Star Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875973/13rRUwhHcQV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a071",
"title": "The Many-Faced Plot: Strategy for Automatic Glyph Generation",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a071/17D45XDIXSv",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a058",
"title": "Visualizing Multidimensional Data in Treemaps with Adaptive Glyphs",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a058/17D45XeKgvR",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a157",
"title": "Evaluation of Effectiveness of Glyphs to Enhance ChronoView",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a157/1cMF9mvWMFO",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09067088",
"title": "AgentVis: Visual Analysis of Agent Behavior With Hierarchical Glyphs",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09067088/1j1lyTz50k0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a242",
"title": "A summarization glyph for sets of unreadable visual items in treemaps",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a242/1rSRaQV3b3y",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552906",
"articleId": "1xic46x3fmU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552887",
"articleId": "1xibWySUs4U",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBaA5Jsces",
"name": "ttg202201-09557223s1-supp1-3114877.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09557223s1-supp1-3114877.mp4",
"extension": "mp4",
"size": "54.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvGPE8n",
"title": "Jan.",
"year": "2016",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjGoLH",
"doi": "10.1109/TVCG.2015.2467752",
"abstract": "A number of studies have investigated different ways of visualizing uncertainty. However, in the temporal dimension, it is still an open question how to best represent uncertainty, since the special characteristics of time require special visual encodings and may provoke different interpretations. Thus, we have conducted a comprehensive study comparing alternative visual encodings of intervals with uncertain start and end times: gradient plots, violin plots, accumulated probability plots, error bars, centered error bars, and ambiguation. Our results reveal significant differences in error rates and completion time for these different visualization types and different tasks. We recommend using ambiguation – using a lighter color value to represent uncertain regions – or error bars for judging durations and temporal bounds, and gradient plots – using fading color or transparency – for judging probability values.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A number of studies have investigated different ways of visualizing uncertainty. However, in the temporal dimension, it is still an open question how to best represent uncertainty, since the special characteristics of time require special visual encodings and may provoke different interpretations. Thus, we have conducted a comprehensive study comparing alternative visual encodings of intervals with uncertain start and end times: gradient plots, violin plots, accumulated probability plots, error bars, centered error bars, and ambiguation. Our results reveal significant differences in error rates and completion time for these different visualization types and different tasks. We recommend using ambiguation – using a lighter color value to represent uncertain regions – or error bars for judging durations and temporal bounds, and gradient plots – using fading color or transparency – for judging probability values.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A number of studies have investigated different ways of visualizing uncertainty. However, in the temporal dimension, it is still an open question how to best represent uncertainty, since the special characteristics of time require special visual encodings and may provoke different interpretations. Thus, we have conducted a comprehensive study comparing alternative visual encodings of intervals with uncertain start and end times: gradient plots, violin plots, accumulated probability plots, error bars, centered error bars, and ambiguation. Our results reveal significant differences in error rates and completion time for these different visualization types and different tasks. We recommend using ambiguation – using a lighter color value to represent uncertain regions – or error bars for judging durations and temporal bounds, and gradient plots – using fading color or transparency – for judging probability values.",
"title": "Visual Encodings of Temporal Uncertainty: A Comparative User Study",
"normalizedTitle": "Visual Encodings of Temporal Uncertainty: A Comparative User Study",
"fno": "07192667",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Uncertainty",
"Visualization",
"Bars",
"Encoding",
"Image Color Analysis",
"Data Visualization",
"Visualization",
"Uncertainty",
"Temporal Intervals",
"Visualization",
"Uncertainty",
"Temporal Intervals"
],
"authors": [
{
"givenName": "Theresia",
"surname": "Gschwandtnei",
"fullName": "Theresia Gschwandtnei",
"affiliation": ", Vienna University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Markus",
"surname": "Bögl",
"fullName": "Markus Bögl",
"affiliation": ", Vienna University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Paolo",
"surname": "Federico",
"fullName": "Paolo Federico",
"affiliation": ", Vienna University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Silvia",
"surname": "Miksch",
"fullName": "Silvia Miksch",
"affiliation": ", Vienna University of Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2016-01-01 00:00:00",
"pubType": "trans",
"pages": "539-548",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2014/12/06875915",
"title": "Error Bars Considered Harmful: Exploring Alternate Encodings for Mean and Error",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875915/13rRUxZ0o1B",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/03/07875127",
"title": "Evaluating Interactive Graphical Encodings for Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2018/03/07875127/13rRUxly9e0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2018/9264/0/926400a142",
"title": "Extracting Visual Encodings from Map Chart Images with Color-Encoded Scalar Values",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2018/926400a142/17D45WaTkiB",
"parentPublication": {
"id": "proceedings/sibgrapi/2018/9264/0",
"title": "2018 31st SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440816",
"title": "Hypothetical Outcome Plots Help Untrained Observers Judge Trends in Ambiguous Data",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440816/17D45Xh13so",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2022/02/09756627",
"title": "More Than Meets the Eye: A Closer Look at Encodings in Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2022/02/09756627/1CxvjdlL3TG",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805427",
"title": "Biased Average Position Estimates in Line and Bar Graphs: Underestimation, Overestimation, and Perceptual Pull",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805427/1cG4xtnomys",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08809678",
"title": "Investigating Direct Manipulation of Graphical Encodings as a Method for User Interaction",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08809678/1cHEi01VEYg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08836120",
"title": "Measures of the Benefit of Direct Encoding of Data Deltas for Data Pair Relation Perception",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08836120/1dia2KVa7g4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222047",
"title": "Truth or Square: Aspect Ratio Biases Recall of Position Encodings",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222047/1nTqj3fbFXq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2021/3931/0/393100a131",
"title": "Exploratory User Study on Graph Temporal Encodings",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2021/393100a131/1tTtqpZY94k",
"parentPublication": {
"id": "proceedings/pacificvis/2021/3931/0",
"title": "2021 IEEE 14th Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07192720",
"articleId": "13rRUxBa5np",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07192735",
"articleId": "13rRUxYIMV2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45Xh13so",
"doi": "10.1109/TVCG.2018.2864909",
"abstract": "Animated representations of outcomes drawn from distributions (hypothetical outcome plots, or HOPs) are used in the media and other public venues to communicate uncertainty. HOPs greatly improve multivariate probability estimation over conventional static uncertainty visualizations and leverage the ability of the visual system to quickly, accurately, and automatically process the summary statistical properties of ensembles. However, it is unclear how well HOPs support applied tasks resembling real world judgments posed in uncertainty communication. We identify and motivate an appropriate task to investigate realistic judgments of uncertainty in the public domain through a qualitative analysis of uncertainty visualizations in the news. We contribute two crowdsourced experiments comparing the effectiveness of HOPs, error bars, and line ensembles for supporting perceptual decision-making from visualized uncertainty. Participants infer which of two possible underlying trends is more likely to have produced a sample of time series data by referencing uncertainty visualizations which depict the two trends with variability due to sampling error. By modeling each participant's accuracy as a function of the level of evidence presented over many repeated judgments, we find that observers are able to correctly infer the underlying trend in samples conveying a lower level of evidence when using HOPs rather than static aggregate uncertainty visualizations as a decision aid. Modeling approaches like ours contribute theoretically grounded and richly descriptive accounts of user perceptions to visualization evaluation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Animated representations of outcomes drawn from distributions (hypothetical outcome plots, or HOPs) are used in the media and other public venues to communicate uncertainty. HOPs greatly improve multivariate probability estimation over conventional static uncertainty visualizations and leverage the ability of the visual system to quickly, accurately, and automatically process the summary statistical properties of ensembles. However, it is unclear how well HOPs support applied tasks resembling real world judgments posed in uncertainty communication. We identify and motivate an appropriate task to investigate realistic judgments of uncertainty in the public domain through a qualitative analysis of uncertainty visualizations in the news. We contribute two crowdsourced experiments comparing the effectiveness of HOPs, error bars, and line ensembles for supporting perceptual decision-making from visualized uncertainty. Participants infer which of two possible underlying trends is more likely to have produced a sample of time series data by referencing uncertainty visualizations which depict the two trends with variability due to sampling error. By modeling each participant's accuracy as a function of the level of evidence presented over many repeated judgments, we find that observers are able to correctly infer the underlying trend in samples conveying a lower level of evidence when using HOPs rather than static aggregate uncertainty visualizations as a decision aid. Modeling approaches like ours contribute theoretically grounded and richly descriptive accounts of user perceptions to visualization evaluation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Animated representations of outcomes drawn from distributions (hypothetical outcome plots, or HOPs) are used in the media and other public venues to communicate uncertainty. HOPs greatly improve multivariate probability estimation over conventional static uncertainty visualizations and leverage the ability of the visual system to quickly, accurately, and automatically process the summary statistical properties of ensembles. However, it is unclear how well HOPs support applied tasks resembling real world judgments posed in uncertainty communication. We identify and motivate an appropriate task to investigate realistic judgments of uncertainty in the public domain through a qualitative analysis of uncertainty visualizations in the news. We contribute two crowdsourced experiments comparing the effectiveness of HOPs, error bars, and line ensembles for supporting perceptual decision-making from visualized uncertainty. Participants infer which of two possible underlying trends is more likely to have produced a sample of time series data by referencing uncertainty visualizations which depict the two trends with variability due to sampling error. By modeling each participant's accuracy as a function of the level of evidence presented over many repeated judgments, we find that observers are able to correctly infer the underlying trend in samples conveying a lower level of evidence when using HOPs rather than static aggregate uncertainty visualizations as a decision aid. Modeling approaches like ours contribute theoretically grounded and richly descriptive accounts of user perceptions to visualization evaluation.",
"title": "Hypothetical Outcome Plots Help Untrained Observers Judge Trends in Ambiguous Data",
"normalizedTitle": "Hypothetical Outcome Plots Help Untrained Observers Judge Trends in Ambiguous Data",
"fno": "08440816",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Probability",
"Time Series",
"Hypothetical Outcome Plots",
"Multivariate Probability Estimation",
"Time Series Data",
"Static Aggregate Uncertainty Visualizations",
"Ambiguous Data Trends",
"HO Ps",
"Qualitative Analysis",
"Uncertainty",
"Data Visualization",
"Visualization",
"Bars",
"Task Analysis",
"Observers",
"Encoding",
"Uncertainty Visualization",
"Hypothetical Outcome Plots",
"Psychometric Functions"
],
"authors": [
{
"givenName": "Alex",
"surname": "Kale",
"fullName": "Alex Kale",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Francis",
"surname": "Nguyen",
"fullName": "Francis Nguyen",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthew",
"surname": "Kay",
"fullName": "Matthew Kay",
"affiliation": "University of Michigan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jessica",
"surname": "Hullman",
"fullName": "Jessica Hullman",
"affiliation": "Northwestern University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "892-902",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgiv/2017/0852/0/0852a099",
"title": "Stem & Leaf Plots Extended for Text Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2017/0852a099/12OmNy5zspa",
"parentPublication": {
"id": "proceedings/cgiv/2017/0852/0",
"title": "2017 14th International Conference on Computer Graphics, Imaging and Visualization (CGiV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/06/06654171",
"title": "The Perception of Visual UncertaintyRepresentation by Non-Experts",
"doi": null,
"abstractUrl": "/journal/tg/2014/06/06654171/13rRUwInvl3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192667",
"title": "Visual Encodings of Temporal Uncertainty: A Comparative User Study",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192667/13rRUwjGoLH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010060980",
"title": "Matching Visual Saliency to Confidence in Plots of Uncertain Data",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010060980/13rRUxZRbnY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/lt/2015/03/07058341",
"title": "Uncertainty Representation in Visualizations of Learning Analytics for Learners: Current Approaches and Opportunities",
"doi": null,
"abstractUrl": "/journal/lt/2015/03/07058341/13rRUygT7pf",
"parentPublication": {
"id": "trans/lt",
"title": "IEEE Transactions on Learning Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08457476",
"title": "In Pursuit of Error: A Survey of Uncertainty Visualization Evaluation",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08457476/17D45WaTkcP",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440052",
"title": "An Interactive Framework for Visualization of Weather Forecast Ensembles",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440052/17D45XDIXW9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09548797",
"title": "Effect of uncertainty visualizations on myopic loss aversion and the equity premium puzzle in retirement investment decisions",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09548797/1xeSlZqOf8A",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552887",
"title": "Examining Effort in 1D Uncertainty Communication Using Individual Differences in Working Memory and NASA-TLX",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552887/1xibWySUs4U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552465",
"title": "Visualizing Uncertainty in Probabilistic Graphs with Network Hypothetical Outcome Plots (NetHOPs)",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552465/1xic9toQQrC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440837",
"articleId": "17D45XeKgnt",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08457476",
"articleId": "17D45WaTkcP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesUH",
"name": "ttg201901-08440816s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440816s1.zip",
"extension": "zip",
"size": "13.3 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1MQvcIkoAko",
"title": "June",
"year": "2023",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1AvqJHyHeO4",
"doi": "10.1109/TVCG.2022.3146508",
"abstract": "The development of digitized humanity information provides a new perspective on data-oriented studies of history. Many previous studies have ignored uncertainty in the exploration of historical figures and events, which has limited the capability of researchers to capture complex processes associated with historical phenomena. We propose a visual reasoning system to support visual reasoning of uncertainty associated with spatio-temporal events of historical figures based on data from the China Biographical Database Project. We build a knowledge graph of entities extracted from a historical database to capture uncertainty generated by missing data and error. The proposed system uses an overview of chronology, a map view, and an interpersonal relation matrix to describe and analyse heterogeneous information of events. The system also includes uncertainty visualization to identify uncertain events with missing or imprecise spatio-temporal information. Results from case studies and expert evaluations suggest that the visual reasoning system is able to quantify and reduce uncertainty generated by the data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The development of digitized humanity information provides a new perspective on data-oriented studies of history. Many previous studies have ignored uncertainty in the exploration of historical figures and events, which has limited the capability of researchers to capture complex processes associated with historical phenomena. We propose a visual reasoning system to support visual reasoning of uncertainty associated with spatio-temporal events of historical figures based on data from the China Biographical Database Project. We build a knowledge graph of entities extracted from a historical database to capture uncertainty generated by missing data and error. The proposed system uses an overview of chronology, a map view, and an interpersonal relation matrix to describe and analyse heterogeneous information of events. The system also includes uncertainty visualization to identify uncertain events with missing or imprecise spatio-temporal information. Results from case studies and expert evaluations suggest that the visual reasoning system is able to quantify and reduce uncertainty generated by the data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The development of digitized humanity information provides a new perspective on data-oriented studies of history. Many previous studies have ignored uncertainty in the exploration of historical figures and events, which has limited the capability of researchers to capture complex processes associated with historical phenomena. We propose a visual reasoning system to support visual reasoning of uncertainty associated with spatio-temporal events of historical figures based on data from the China Biographical Database Project. We build a knowledge graph of entities extracted from a historical database to capture uncertainty generated by missing data and error. The proposed system uses an overview of chronology, a map view, and an interpersonal relation matrix to describe and analyse heterogeneous information of events. The system also includes uncertainty visualization to identify uncertain events with missing or imprecise spatio-temporal information. Results from case studies and expert evaluations suggest that the visual reasoning system is able to quantify and reduce uncertainty generated by the data.",
"title": "Visual Reasoning for Uncertainty in Spatio-Temporal Events of Historical Figures",
"normalizedTitle": "Visual Reasoning for Uncertainty in Spatio-Temporal Events of Historical Figures",
"fno": "09695348",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Uncertainty",
"Visualization",
"Cognition",
"Data Visualization",
"Biographies",
"Task Analysis",
"Data Mining",
"History",
"Uncertainty",
"Spatio Temporal Events",
"Visual Reasoning"
],
"authors": [
{
"givenName": "Wei",
"surname": "Zhang",
"fullName": "Wei Zhang",
"affiliation": "State Key Lab of Cad&CG, Zhejiang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Siwei",
"surname": "Tan",
"fullName": "Siwei Tan",
"affiliation": "School of Computer Science, Zhejiang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Siming",
"surname": "Chen",
"fullName": "Siming Chen",
"affiliation": "School of Data Science, Fudan University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Linghao",
"surname": "Meng",
"fullName": "Linghao Meng",
"affiliation": "School of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, AZ, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tianye",
"surname": "Zhang",
"fullName": "Tianye Zhang",
"affiliation": "State Key Lab of Cad&CG, Zhejiang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rongchen",
"surname": "Zhu",
"fullName": "Rongchen Zhu",
"affiliation": "State Key Lab of Cad&CG, Zhejiang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Chen",
"fullName": "Wei Chen",
"affiliation": "State Key Lab of Cad&CG, Zhejiang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2023-06-01 00:00:00",
"pubType": "trans",
"pages": "3009-3023",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wi-iat/2014/4143/2/4143b487",
"title": "Uncertainty Reasoning Based Formal Framework for Big Video Data Understanding",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2014/4143b487/12OmNvq5jv8",
"parentPublication": {
"id": "wi-iat/2014/4143/2",
"title": "2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2012/4771/0/4771a283",
"title": "Visualization for Changes in Relationships between Historical Figures in Chronicles",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2012/4771a283/12OmNy7yEcR",
"parentPublication": {
"id": "proceedings/iv/2012/4771/0",
"title": "2012 16th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017624",
"title": "Imagining Replications: Graphical Prediction & Discrete Visualizations Improve Recall & Estimation of Effect Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017624/13rRUIM2VH5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09772276",
"title": "Practice improves performance of a 2D uncertainty integration task within and across visualizations",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09772276/1DgjDz35pfi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904442",
"title": "Communicating Uncertainty in Digital Humanities Visualization Research",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904442/1H1gpt871W8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2019/0801/0/08940309",
"title": "Visualization Analysis of Social Networks of Chinese Historical Figures : Take the Study of Literati of Song Dynasty as an Example",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2019/08940309/1gjRQLb3Tkk",
"parentPublication": {
"id": "proceedings/icis/2019/0801/0",
"title": "2019 IEEE/ACIS 18th International Conference on Computer and Information Science (ICIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2020/5697/0/09086235",
"title": "Uncertainty Treemaps",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2020/09086235/1kuHly3FEwU",
"parentPublication": {
"id": "proceedings/pacificvis/2020/5697/0",
"title": "2020 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cogmi/2020/4144/0/414400a109",
"title": "Causality and Uncertainty of Information for Content Understanding",
"doi": null,
"abstractUrl": "/proceedings-article/cogmi/2020/414400a109/1qyxR7c0BEs",
"parentPublication": {
"id": "proceedings/cogmi/2020/4144/0",
"title": "2020 IEEE Second International Conference on Cognitive Machine Intelligence (CogMI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552887",
"title": "Examining Effort in 1D Uncertainty Communication Using Individual Differences in Working Memory and NASA-TLX",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552887/1xibWySUs4U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2021/3335/0/333500a156",
"title": "Visually Connecting Historical Figures Through Event Knowledge Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2021/333500a156/1yXudtjcVMc",
"parentPublication": {
"id": "proceedings/vis/2021/3335/0",
"title": "2021 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09695246",
"articleId": "1AvqJVgygfe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09705076",
"articleId": "1AIIbJW1goU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1MQvgVvlrAQ",
"name": "ttg202306-09695348s1-supp1-3146508.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202306-09695348s1-supp1-3146508.mp4",
"extension": "mp4",
"size": "33.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1H1gkkbe0hy",
"doi": "10.1109/TVCG.2022.3209348",
"abstract": "Most real-world datasets contain missing values yet most exploratory data analysis (EDA) systems only support visualising data points with complete cases. This omission may potentially lead the user to biased analyses and insights. Imputation techniques can help estimate the value of a missing data point, but introduces additional uncertainty. In this work, we investigate the effects of visualising imputed values in charts using different ways of representing data imputations and imputation uncertainty—<italic>no imputation, mean, 95% confidence intervals, probability density plots, gradient intervals</italic>, and <italic>hypothetical outcome plots</italic>. We focus on scatterplots, which is a commonly used chart type, and conduct a crowdsourced study with 202 participants. We measure users' bias and precision in performing two tasks—estimating average and detecting trend—and their self-reported confidence in performing these tasks. Our results suggest that, when estimating averages, uncertainty representations may reduce bias but at the cost of decreasing precision. When estimating trend, only hypothetical outcome plots may lead to a small probability of reducing bias while increasing precision. Participants in every uncertainty representation were less certain about their response when compared to the baseline. The findings point towards potential trade-offs in using uncertainty encodings for datasets with a large number of missing values. This paper and the associated analysis materials are available at: <uri>https://osf.io/q4y5r/</uri>",
"abstracts": [
{
"abstractType": "Regular",
"content": "Most real-world datasets contain missing values yet most exploratory data analysis (EDA) systems only support visualising data points with complete cases. This omission may potentially lead the user to biased analyses and insights. Imputation techniques can help estimate the value of a missing data point, but introduces additional uncertainty. In this work, we investigate the effects of visualising imputed values in charts using different ways of representing data imputations and imputation uncertainty—<italic>no imputation, mean, 95% confidence intervals, probability density plots, gradient intervals</italic>, and <italic>hypothetical outcome plots</italic>. We focus on scatterplots, which is a commonly used chart type, and conduct a crowdsourced study with 202 participants. We measure users' bias and precision in performing two tasks—estimating average and detecting trend—and their self-reported confidence in performing these tasks. Our results suggest that, when estimating averages, uncertainty representations may reduce bias but at the cost of decreasing precision. When estimating trend, only hypothetical outcome plots may lead to a small probability of reducing bias while increasing precision. Participants in every uncertainty representation were less certain about their response when compared to the baseline. The findings point towards potential trade-offs in using uncertainty encodings for datasets with a large number of missing values. This paper and the associated analysis materials are available at: <uri>https://osf.io/q4y5r/</uri>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Most real-world datasets contain missing values yet most exploratory data analysis (EDA) systems only support visualising data points with complete cases. This omission may potentially lead the user to biased analyses and insights. Imputation techniques can help estimate the value of a missing data point, but introduces additional uncertainty. In this work, we investigate the effects of visualising imputed values in charts using different ways of representing data imputations and imputation uncertainty—no imputation, mean, 95% confidence intervals, probability density plots, gradient intervals, and hypothetical outcome plots. We focus on scatterplots, which is a commonly used chart type, and conduct a crowdsourced study with 202 participants. We measure users' bias and precision in performing two tasks—estimating average and detecting trend—and their self-reported confidence in performing these tasks. Our results suggest that, when estimating averages, uncertainty representations may reduce bias but at the cost of decreasing precision. When estimating trend, only hypothetical outcome plots may lead to a small probability of reducing bias while increasing precision. Participants in every uncertainty representation were less certain about their response when compared to the baseline. The findings point towards potential trade-offs in using uncertainty encodings for datasets with a large number of missing values. This paper and the associated analysis materials are available at: https://osf.io/q4y5r/",
"title": "Evaluating the Use of Uncertainty Visualisations for Imputations of Data Missing At Random in Scatterplots",
"normalizedTitle": "Evaluating the Use of Uncertainty Visualisations for Imputations of Data Missing At Random in Scatterplots",
"fno": "09904433",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Mining",
"Data Visualisation",
"Probability",
"Statistical Analysis",
"Biased Analyses",
"Charts",
"Confidence Intervals",
"Data Imputations",
"Data Point Visualization",
"EDA System",
"Exploratory Data Analysis Systems",
"Gradient Intervals",
"Hypothetical Outcome Plots",
"Imputation Uncertainty",
"Missing Data Point",
"Probability Density Plots",
"Scatterplots",
"Uncertainty Encodings",
"Uncertainty Representation",
"Uncertainty Visualisations",
"Uncertainty",
"Data Visualization",
"Task Analysis",
"Bars",
"Market Research",
"Visual Analytics",
"Mobile Ad Hoc Networks",
"Uncertainty Visualisations",
"Missing Values",
"Data Imputation",
"Multivariate Data"
],
"authors": [
{
"givenName": "Abhraneel",
"surname": "Sarma",
"fullName": "Abhraneel Sarma",
"affiliation": "Northwestern University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shunan",
"surname": "Guo",
"fullName": "Shunan Guo",
"affiliation": "Adobe Research, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jane",
"surname": "Hoffswell",
"fullName": "Jane Hoffswell",
"affiliation": "Adobe Research, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ryan",
"surname": "Rossi",
"fullName": "Ryan Rossi",
"affiliation": "Adobe Research, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fan",
"surname": "Du",
"fullName": "Fan Du",
"affiliation": "Adobe Research, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eunyee",
"surname": "Koh",
"fullName": "Eunyee Koh",
"affiliation": "Adobe Research, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthew",
"surname": "Kay",
"fullName": "Matthew Kay",
"affiliation": "Northwestern University, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "602-612",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iri/2014/5880/0/07051973",
"title": "Bayesian updating for time series missing data discovery and uncertainty estimation (TSMDDUE)",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2014/07051973/12OmNAm4TL2",
"parentPublication": {
"id": "proceedings/iri/2014/5880/0",
"title": "2014 IEEE International Conference on Information Reuse and Integration (IRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122496",
"title": "Visual Semiotics & Uncertainty Visualization: An Empirical Study",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122496/13rRUNvyaeZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2010/07/ttm2010071035",
"title": "Uncertainty Modeling and Reduction in MANETs",
"doi": null,
"abstractUrl": "/journal/tm/2010/07/ttm2010071035/13rRUwInvJY",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192667",
"title": "Visual Encodings of Temporal Uncertainty: A Comparative User Study",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192667/13rRUwjGoLH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192694",
"title": "An Uncertainty-Aware Approach for Exploratory Microblog Retrieval",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192694/13rRUy2YLYy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/08/08611178",
"title": "Exploring the Sensitivity of Choropleths under Attribute Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2020/08/08611178/17D45XvMccD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcomp/2020/6034/0/603400a303",
"title": "Visual Imputation Analytics for Missing Time-Series Data in Bayesian Network",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2020/603400a303/1jdDwCsHB16",
"parentPublication": {
"id": "proceedings/bigcomp/2020/6034/0",
"title": "2020 IEEE International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09451614",
"title": "Implicit Error, Uncertainty and Confidence in Visualization: An Archaeological Case Study",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09451614/1ujXLzVvMs0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09488285",
"title": "DeHumor: Visual Analytics for Decomposing Humor",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09488285/1vhIcg5WCZy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09548797",
"title": "Effect of uncertainty visualizations on myopic loss aversion and the equity premium puzzle in retirement investment decisions",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09548797/1xeSlZqOf8A",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09903604",
"articleId": "1GZomAOeEzS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09903471",
"articleId": "1GZolxWTqPS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1qL5hsvvVkc",
"title": "Feb.",
"year": "2021",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1nTrxuPw4UM",
"doi": "10.1109/TVCG.2020.3030335",
"abstract": "Uncertainty visualizations often emphasize point estimates to support magnitude estimates or decisions through visual comparison. However, when design choices emphasize means, users may overlook uncertainty information and misinterpret visual distance as a proxy for effect size. We present findings from a mixed design experiment on Mechanical Turk which tests eight uncertainty visualization designs: 95% containment intervals, hypothetical outcome plots, densities, and quantile dotplots, each with and without means added. We find that adding means to uncertainty visualizations has small biasing effects on both magnitude estimation and decision-making, consistent with discounting uncertainty. We also see that visualization designs that support the least biased effect size estimation do not support the best decision-making, suggesting that a chart user's sense of effect size may not necessarily be identical when they use the same information for different tasks. In a qualitative analysis of users' strategy descriptions, we find that many users switch strategies and do not employ an optimal strategy when one exists. Uncertainty visualizations which are optimally designed in theory may not be the most effective in practice because of the ways that users satisfice with heuristics, suggesting opportunities to better understand visualization effectiveness by modeling sets of potential strategies.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Uncertainty visualizations often emphasize point estimates to support magnitude estimates or decisions through visual comparison. However, when design choices emphasize means, users may overlook uncertainty information and misinterpret visual distance as a proxy for effect size. We present findings from a mixed design experiment on Mechanical Turk which tests eight uncertainty visualization designs: 95% containment intervals, hypothetical outcome plots, densities, and quantile dotplots, each with and without means added. We find that adding means to uncertainty visualizations has small biasing effects on both magnitude estimation and decision-making, consistent with discounting uncertainty. We also see that visualization designs that support the least biased effect size estimation do not support the best decision-making, suggesting that a chart user's sense of effect size may not necessarily be identical when they use the same information for different tasks. In a qualitative analysis of users' strategy descriptions, we find that many users switch strategies and do not employ an optimal strategy when one exists. Uncertainty visualizations which are optimally designed in theory may not be the most effective in practice because of the ways that users satisfice with heuristics, suggesting opportunities to better understand visualization effectiveness by modeling sets of potential strategies.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Uncertainty visualizations often emphasize point estimates to support magnitude estimates or decisions through visual comparison. However, when design choices emphasize means, users may overlook uncertainty information and misinterpret visual distance as a proxy for effect size. We present findings from a mixed design experiment on Mechanical Turk which tests eight uncertainty visualization designs: 95% containment intervals, hypothetical outcome plots, densities, and quantile dotplots, each with and without means added. We find that adding means to uncertainty visualizations has small biasing effects on both magnitude estimation and decision-making, consistent with discounting uncertainty. We also see that visualization designs that support the least biased effect size estimation do not support the best decision-making, suggesting that a chart user's sense of effect size may not necessarily be identical when they use the same information for different tasks. In a qualitative analysis of users' strategy descriptions, we find that many users switch strategies and do not employ an optimal strategy when one exists. Uncertainty visualizations which are optimally designed in theory may not be the most effective in practice because of the ways that users satisfice with heuristics, suggesting opportunities to better understand visualization effectiveness by modeling sets of potential strategies.",
"title": "Visual Reasoning Strategies for Effect Size Judgments and Decisions",
"normalizedTitle": "Visual Reasoning Strategies for Effect Size Judgments and Decisions",
"fno": "09222364",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Decision Making",
"Inference Mechanisms",
"Optimisation",
"Visualization Effectiveness",
"Biased Effect Size Estimation",
"Decision Making",
"Magnitude Estimation",
"Biasing Effects",
"Uncertainty Visualization Designs",
"Mixed Design Experiment",
"Visual Distance",
"Uncertainty Information",
"Magnitude Estimates",
"Uncertainty Visualizations",
"Effect Size Judgments",
"Visual Reasoning Strategies",
"Uncertainty",
"Visualization",
"Data Visualization",
"Task Analysis",
"Decision Making",
"Estimation",
"Uncertainty Visualization",
"Graphical Perception",
"Data Cognition"
],
"authors": [
{
"givenName": "Alex",
"surname": "Kale",
"fullName": "Alex Kale",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthew",
"surname": "Kay",
"fullName": "Matthew Kay",
"affiliation": "University of Michigan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jessica",
"surname": "Hullman",
"fullName": "Jessica Hullman",
"affiliation": "Northwestern University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "272-282",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2002/1751/0/17510037",
"title": "Visualizing Data with Bounded Uncertainty",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2002/17510037/12OmNrFkeWk",
"parentPublication": {
"id": "proceedings/ieee-infovis/2002/1751/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2013/01/mcg2013010075",
"title": "Visualization of Uncertainty without a Mean",
"doi": null,
"abstractUrl": "/magazine/cg/2013/01/mcg2013010075/13rRUwcAquB",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/lt/2015/03/07058341",
"title": "Uncertainty Representation in Visualizations of Learning Analytics for Learners: Current Approaches and Opportunities",
"doi": null,
"abstractUrl": "/journal/lt/2015/03/07058341/13rRUygT7pf",
"parentPublication": {
"id": "trans/lt",
"title": "IEEE Transactions on Learning Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08457476",
"title": "In Pursuit of Error: A Survey of Uncertainty Visualization Evaluation",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08457476/17D45WaTkcP",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904442",
"title": "Communicating Uncertainty in Digital Humanities Visualization Research",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904442/1H1gpt871W8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2022/4609/0/460900a626",
"title": "Unsupervised DeepView: Global Uncertainty Visualization for High Dimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2022/460900a626/1KBr5pVl2qA",
"parentPublication": {
"id": "proceedings/icdmw/2022/4609/0",
"title": "2022 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aivr/2022/5725/0/572500a109",
"title": "Visualization of Machine Learning Uncertainty in AR-Based See-Through Applications",
"doi": null,
"abstractUrl": "/proceedings-article/aivr/2022/572500a109/1KmFcUFPF3G",
"parentPublication": {
"id": "proceedings/aivr/2022/5725/0",
"title": "2022 IEEE International Conference on Artificial Intelligence and Virtual Reality (AIVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ickg/2022/5101/0/510100a196",
"title": "Unsupervised DeepView: Global Explainability of Uncertainties for High Dimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/ickg/2022/510100a196/1KxU0VArAty",
"parentPublication": {
"id": "proceedings/ickg/2022/5101/0",
"title": "2022 IEEE International Conference on Knowledge Graph (ICKG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805422",
"title": "Why Authors Don't Visualize Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805422/1cG4ylx5qbC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09451614",
"title": "Implicit Error, Uncertainty and Confidence in Visualization: An Archaeological Case Study",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09451614/1ujXLzVvMs0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09233993",
"articleId": "1o53W7V42CQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09222512",
"articleId": "1nTq2foekVO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLgnmPKBYA",
"name": "ttg202102-09222364s1-tvcg-3030335-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222364s1-tvcg-3030335-mm.zip",
"extension": "zip",
"size": "81 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwGqBqg",
"title": "November/December",
"year": "2009",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "15",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwfZC0b",
"doi": "10.1109/TVCG.2009.122",
"abstract": "While many data sets contain multiple relationships, depicting more than one data relationship within a single visualization is challenging. We introduce Bubble Sets as a visualization technique for data that has both a primary data relation with a semantically significant spatial organization and a significant set membership relation in which members of the same set are not necessarily adjacent in the primary layout. In order to maintain the spatial rights of the primary data relation, we avoid layout adjustment techniques that improve set cluster continuity and density. Instead, we use a continuous, possibly concave, isocontour to delineate set membership, without disrupting the primary layout. Optimizations minimize cluster overlap and provide for calculation of the isocontours at interactive speeds. Case studies show how this technique can be used to indicate multiple sets on a variety of common visualizations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "While many data sets contain multiple relationships, depicting more than one data relationship within a single visualization is challenging. We introduce Bubble Sets as a visualization technique for data that has both a primary data relation with a semantically significant spatial organization and a significant set membership relation in which members of the same set are not necessarily adjacent in the primary layout. In order to maintain the spatial rights of the primary data relation, we avoid layout adjustment techniques that improve set cluster continuity and density. Instead, we use a continuous, possibly concave, isocontour to delineate set membership, without disrupting the primary layout. Optimizations minimize cluster overlap and provide for calculation of the isocontours at interactive speeds. Case studies show how this technique can be used to indicate multiple sets on a variety of common visualizations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "While many data sets contain multiple relationships, depicting more than one data relationship within a single visualization is challenging. We introduce Bubble Sets as a visualization technique for data that has both a primary data relation with a semantically significant spatial organization and a significant set membership relation in which members of the same set are not necessarily adjacent in the primary layout. In order to maintain the spatial rights of the primary data relation, we avoid layout adjustment techniques that improve set cluster continuity and density. Instead, we use a continuous, possibly concave, isocontour to delineate set membership, without disrupting the primary layout. Optimizations minimize cluster overlap and provide for calculation of the isocontours at interactive speeds. Case studies show how this technique can be used to indicate multiple sets on a variety of common visualizations.",
"title": "Bubble Sets: Revealing Set Relations with Isocontours over Existing Visualizations",
"normalizedTitle": "Bubble Sets: Revealing Set Relations with Isocontours over Existing Visualizations",
"fno": "ttg2009061009",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Clustering",
"Spatial Layout",
"Graph Visualization",
"Tree Visualization"
],
"authors": [
{
"givenName": "Christopher",
"surname": "Collins",
"fullName": "Christopher Collins",
"affiliation": "University of Toronto",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gerald",
"surname": "Penn",
"fullName": "Gerald Penn",
"affiliation": "University of Toronto",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sheelagh",
"surname": "Carpendale",
"fullName": "Sheelagh Carpendale",
"affiliation": "University of Calgary",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "1009-1016",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/grc/2007/3032/0/30320110",
"title": "On Consistency of Fuzzy Clustering Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2007/30320110/12OmNAoDhRq",
"parentPublication": {
"id": "proceedings/grc/2007/3032/0",
"title": "2007 IEEE International Conference on Granular Computing (GRC 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2012/2310/0/06468653",
"title": "Group decision making based on vague preference relations",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2012/06468653/12OmNvT2pf7",
"parentPublication": {
"id": "proceedings/grc/2012/2310/0",
"title": "2012 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2013/4797/0/06596146",
"title": "Visualizing edge-edge relations in graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596146/12OmNzsJ7ya",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122449",
"title": "TreeNetViz: Revealing Patterns of Networks over Tree Structures",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122449/13rRUwIF69h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061333",
"title": "Perceptual Organization in User-Generated Graph Layouts",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061333/13rRUyeCkac",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1192",
"title": "VisLink: Revealing Relationships Amongst Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1192/13rRUyogGA6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2022/9007/0/900700a432",
"title": "Composition of Geospatial Visualizations for Scale-aware Views of Multiple Outcome Variables in Population Surveys",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2022/900700a432/1KaFOtIedpe",
"parentPublication": {
"id": "proceedings/iv/2022/9007/0",
"title": "2022 26th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2020/1056/0/09381332",
"title": "Proximity, Communities, and Attributes in Social Network Visualisation",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2020/09381332/1semDRI9JzW",
"parentPublication": {
"id": "proceedings/asonam/2020/1056/0",
"title": "2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900d731",
"title": "LayoutTransformer: Scene Layout Generation with Conceptual and Spatial Diversity",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900d731/1yeKJqXSUh2",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009061001",
"articleId": "13rRUxNW1TQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009061017",
"articleId": "13rRUwIF6l2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesNk",
"name": "ttg2009061009s.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2009061009s.mp4",
"extension": "mp4",
"size": "58.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45Wuc36G",
"doi": "10.1109/TVCG.2018.2864506",
"abstract": "We present a visualization approach for the analysis of CO<sub>2</sub> bubble-induced attenuation in porous rock formations. As a basis for this, we introduce customized techniques to extract CO<sub>2</sub> bubbles and their surrounding porous structure from X-ray computed tomography data (XCT) measurements. To understand how the structure of porous media influences the occurrence and the shape of formed bubbles, we automatically classify and relate them in terms of morphology and geometric features, and further directly support searching for promising porous structures. To allow for the meaningful direct visual comparison of bubbles and their structures, we propose a customized registration technique considering the bubble shape as well as its points of contact with the porous media surface. With our quantitative extraction of geometric bubble features, we further support the analysis as well as the creation of a physical model. We demonstrate that our approach was successfully used to answer several research questions in the domain, and discuss its high practical relevance to identify critical seismic characteristics of fluid-saturated rock that govern its capability to store CO<sub>2</sub>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a visualization approach for the analysis of CO<sub>2</sub> bubble-induced attenuation in porous rock formations. As a basis for this, we introduce customized techniques to extract CO<sub>2</sub> bubbles and their surrounding porous structure from X-ray computed tomography data (XCT) measurements. To understand how the structure of porous media influences the occurrence and the shape of formed bubbles, we automatically classify and relate them in terms of morphology and geometric features, and further directly support searching for promising porous structures. To allow for the meaningful direct visual comparison of bubbles and their structures, we propose a customized registration technique considering the bubble shape as well as its points of contact with the porous media surface. With our quantitative extraction of geometric bubble features, we further support the analysis as well as the creation of a physical model. We demonstrate that our approach was successfully used to answer several research questions in the domain, and discuss its high practical relevance to identify critical seismic characteristics of fluid-saturated rock that govern its capability to store CO<sub>2</sub>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a visualization approach for the analysis of CO2 bubble-induced attenuation in porous rock formations. As a basis for this, we introduce customized techniques to extract CO2 bubbles and their surrounding porous structure from X-ray computed tomography data (XCT) measurements. To understand how the structure of porous media influences the occurrence and the shape of formed bubbles, we automatically classify and relate them in terms of morphology and geometric features, and further directly support searching for promising porous structures. To allow for the meaningful direct visual comparison of bubbles and their structures, we propose a customized registration technique considering the bubble shape as well as its points of contact with the porous media surface. With our quantitative extraction of geometric bubble features, we further support the analysis as well as the creation of a physical model. We demonstrate that our approach was successfully used to answer several research questions in the domain, and discuss its high practical relevance to identify critical seismic characteristics of fluid-saturated rock that govern its capability to store CO2.",
"title": "Visualization of Bubble Formation in Porous Media",
"normalizedTitle": "Visualization of Bubble Formation in Porous Media",
"fno": "08445644",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Bubbles",
"Computerised Tomography",
"Flow Through Porous Media",
"Geophysical Fluid Dynamics",
"Geophysical Techniques",
"Porous Materials",
"Rocks",
"Seismic Waves",
"Bubble Formation",
"Visualization Approach",
"Porous Rock Formations",
"X Ray Computed Tomography Data Measurements",
"Bubble Induced Attenuation",
"Porous Structures",
"Geometric Bubble Features",
"Porous Media Surface",
"Bubble Shape",
"Customized Registration Technique",
"Data Visualization",
"Media",
"Shape",
"Visualization",
"Morphology",
"Feature Extraction",
"Data Mining",
"3 D Volume Rendering",
"Bubble Visualization",
"Porous Media"
],
"authors": [
{
"givenName": "Hui",
"surname": "Zhang",
"fullName": "Hui Zhang",
"affiliation": "Department of Computer ScienceThe University of Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steffen",
"surname": "Frey",
"fullName": "Steffen Frey",
"affiliation": "Visualization Research CenterUniversity of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Holger",
"surname": "Steeb",
"fullName": "Holger Steeb",
"affiliation": "Institute of Applied MechanicsUniversity of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Uribe",
"fullName": "David Uribe",
"affiliation": "Institute of Applied MechanicsUniversity of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Ertl",
"fullName": "Thomas Ertl",
"affiliation": "Visualization Research CenterUniversity of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenping",
"surname": "Wang",
"fullName": "Wenping Wang",
"affiliation": "Department of Computer ScienceThe University of Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "1060-1069",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/eh/2002/1718/0/17180210",
"title": "Evolving Cellular Automata to Model Fluid Flow in Porous Media",
"doi": null,
"abstractUrl": "/proceedings-article/eh/2002/17180210/12OmNCvLXXM",
"parentPublication": {
"id": "proceedings/eh/2002/1718/0",
"title": "2002 NASA/DoD Conference on Evolvable Hardware",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmens/2005/2398/0/23980017",
"title": "Influence of Solid-Liquid-Liquid Interactions on Multiphase Transport Behavior in Porous Media",
"doi": null,
"abstractUrl": "/proceedings-article/icmens/2005/23980017/12OmNvlPkx5",
"parentPublication": {
"id": "proceedings/icmens/2005/2398/0",
"title": "Proceedings. 2005 International Conference on MEMS, NANO and Smart Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2012/4789/0/4789a223",
"title": "Single Component, Multiphase Fluids Flow Simulation in Porous Media with Lattice Boltzmann Method",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2012/4789a223/12OmNy5R3yS",
"parentPublication": {
"id": "proceedings/iccis/2012/4789/0",
"title": "2012 Fourth International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2011/4541/0/4541a877",
"title": "Porous Media Precise Reconstruction and Porosity Fluid Animated Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2011/4541a877/12OmNzGDsMs",
"parentPublication": {
"id": "proceedings/icig/2011/4541/0",
"title": "Image and Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nicoint/2016/2305/0/2305a128",
"title": "MIB: A Bubble Maker Type Media Recorder",
"doi": null,
"abstractUrl": "/proceedings-article/nicoint/2016/2305a128/12OmNzcPAaI",
"parentPublication": {
"id": "proceedings/nicoint/2016/2305/0",
"title": "2016 Nicograph International (NicoInt)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cso/2011/4335/0/4335a236",
"title": "A Multiscale Hybrid Finite-Element Solver for Flow in Porous Media",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2011/4335a236/12OmNzwpUau",
"parentPublication": {
"id": "proceedings/cso/2011/4335/0",
"title": "2011 Fourth International Joint Conference on Computational Sciences and Optimization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446271",
"title": "Pop the Feed Filter Bubble: Making Reddit Social Media a VR Cityscape",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446271/13bd1gJ1v0l",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017613",
"title": "Bubble Treemaps for Uncertainty Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017613/13rRUyuvRoQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2019/1975/0/197500b543",
"title": "CNN Based Dense Underwater 3D Scene Reconstruction by Transfer Learning Using Bubble Database",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2019/197500b543/18j8I8z1mLu",
"parentPublication": {
"id": "proceedings/wacv/2019/1975/0",
"title": "2019 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412345",
"title": "Stochastic 3D rock reconstruction using GANs",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412345/1tmic9E8PJK",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440063",
"articleId": "17D45XacGi1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440086",
"articleId": "17D45WHONqg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i4QPJrDdG8",
"name": "ttg201901-08445644s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08445644s1.mp4",
"extension": "mp4",
"size": "15 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1BhzoNy6wWA",
"doi": "10.1109/TVCG.2022.3153895",
"abstract": "We study hypergraph visualization via its topological simplification. We explore both vertex simplification and hyperedge simplification of hypergraphs using tools from topological data analysis. In particular, we transform a hypergraph into its graph representations known as the line graph and clique expansion. A topological simplification of such a graph representation induces a simplification of the hypergraph. In simplifying a hypergraph, we allow vertices to be combined if they belong to almost the same set of hyperedges, and hyperedges to be merged if they share almost the same set of vertices. Our proposed approaches are general, mathematically justifiable, and put vertex simplification and hyperedge simplification in a unifying framework.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We study hypergraph visualization via its topological simplification. We explore both vertex simplification and hyperedge simplification of hypergraphs using tools from topological data analysis. In particular, we transform a hypergraph into its graph representations known as the line graph and clique expansion. A topological simplification of such a graph representation induces a simplification of the hypergraph. In simplifying a hypergraph, we allow vertices to be combined if they belong to almost the same set of hyperedges, and hyperedges to be merged if they share almost the same set of vertices. Our proposed approaches are general, mathematically justifiable, and put vertex simplification and hyperedge simplification in a unifying framework.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We study hypergraph visualization via its topological simplification. We explore both vertex simplification and hyperedge simplification of hypergraphs using tools from topological data analysis. In particular, we transform a hypergraph into its graph representations known as the line graph and clique expansion. A topological simplification of such a graph representation induces a simplification of the hypergraph. In simplifying a hypergraph, we allow vertices to be combined if they belong to almost the same set of hyperedges, and hyperedges to be merged if they share almost the same set of vertices. Our proposed approaches are general, mathematically justifiable, and put vertex simplification and hyperedge simplification in a unifying framework.",
"title": "Topological Simplifications of Hypergraphs",
"normalizedTitle": "Topological Simplifications of Hypergraphs",
"fno": "09721603",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Data Visualization",
"Encoding",
"Bipartite Graph",
"Data Analysis",
"Clutter",
"Pipelines",
"Hypergraph Simplification",
"Hypergraph Visualization",
"Graph Simplification",
"Topological Data Analysis"
],
"authors": [
{
"givenName": "Youjia",
"surname": "Zhou",
"fullName": "Youjia Zhou",
"affiliation": "Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, Utah, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Archit",
"surname": "Rathore",
"fullName": "Archit Rathore",
"affiliation": "Computer Science, The University of Utah School of Computing, 415825 Salt Lake City, Utah, United States, 84108",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Emilie",
"surname": "Purvine",
"fullName": "Emilie Purvine",
"affiliation": "Information Modeling & Analysis, Pacific Northwest National Laboratory, Seattle, Washington, United States, 98109",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bei",
"surname": "Wang",
"fullName": "Bei Wang",
"affiliation": "Scientific Computing and Imaging Institute, University of Utah, SALT LAKE CITY, Utah, United States, 84112",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-02-01 00:00:00",
"pubType": "trans",
"pages": "1-1",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tp/2017/09/07582510",
"title": "Clustering with Hypergraphs: The Case for Large Hyperedges",
"doi": null,
"abstractUrl": "/journal/tp/2017/09/07582510/13rRUwghdau",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/09/07064739",
"title": "Visual Classification by Z_$\\ell _1$_Z -Hypergraph Modeling",
"doi": null,
"abstractUrl": "/journal/tk/2015/09/07064739/13rRUxZzAhZ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/06/09739081",
"title": "Efficient Subhypergraph Matching Based on Hyperedge Features",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09739081/1BVBKFEH4sw",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09875064",
"title": "HyperISO: Efficiently Searching Subgraph Containment in Hypergraphs",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09875064/1GlbTSkl9Is",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2023/03/10016680",
"title": "Revisiting Core Maintenance for Dynamic Hypergraphs",
"doi": null,
"abstractUrl": "/journal/td/2023/03/10016680/1JU072eQJmU",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2022/4609/0/460900b197",
"title": "Influence Maximization on Hypergraphs via Similarity-based Diffusion",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2022/460900b197/1KBr2hkaYGk",
"parentPublication": {
"id": "proceedings/icdmw/2022/4609/0",
"title": "2022 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2019/6868/0/09073582",
"title": "Random Preferential Attachment Hypergraph",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2019/09073582/1jjAhNUEqWI",
"parentPublication": {
"id": "proceedings/asonam/2019/6868/0",
"title": "2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/07/09187569",
"title": "Distributed Hypergraph Processing Using Intersection Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2022/07/09187569/1mVFlr5j4Aw",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2020/4380/0/438000b560",
"title": "Hypergraph Attention Networks",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2020/438000b560/1r54ktrpwly",
"parentPublication": {
"id": "proceedings/trustcom/2020/4380/0",
"title": "2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2021/9184/0/918400c051",
"title": "Hypercore Maintenance in Dynamic Hypergraphs",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2021/918400c051/1uGXh6kpZ2o",
"parentPublication": {
"id": "proceedings/icde/2021/9184/0",
"title": "2021 IEEE 37th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09721695",
"articleId": "1Bhzo1K76IU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09727090",
"articleId": "1Brwons3Oa4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1BmTkjphPcA",
"name": "ttg555501-09721603s1-supp1-3153895.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09721603s1-supp1-3153895.mp4",
"extension": "mp4",
"size": "24.2 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.