data
dict |
|---|
{
"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": "13rRUxBrGh7",
"doi": "10.1109/TVCG.2017.2744818",
"abstract": "Labeling data instances is an important task in machine learning and visual analytics. Both fields provide a broad set of labeling strategies, whereby machine learning (and in particular active learning) follows a rather model-centered approach and visual analytics employs rather user-centered approaches (visual-interactive labeling). Both approaches have individual strengths and weaknesses. In this work, we conduct an experiment with three parts to assess and compare the performance of these different labeling strategies. In our study, we (1) identify different visual labeling strategies for user-centered labeling, (2) investigate strengths and weaknesses of labeling strategies for different labeling tasks and task complexities, and (3) shed light on the effect of using different visual encodings to guide the visual-interactive labeling process. We further compare labeling of single versus multiple instances at a time, and quantify the impact on efficiency. We systematically compare the performance of visual interactive labeling with that of active learning. Our main findings are that visual-interactive labeling can outperform active learning, given the condition that dimension reduction separates well the class distributions. Moreover, using dimension reduction in combination with additional visual encodings that expose the internal state of the learning model turns out to improve the performance of visual-interactive labeling.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Labeling data instances is an important task in machine learning and visual analytics. Both fields provide a broad set of labeling strategies, whereby machine learning (and in particular active learning) follows a rather model-centered approach and visual analytics employs rather user-centered approaches (visual-interactive labeling). Both approaches have individual strengths and weaknesses. In this work, we conduct an experiment with three parts to assess and compare the performance of these different labeling strategies. In our study, we (1) identify different visual labeling strategies for user-centered labeling, (2) investigate strengths and weaknesses of labeling strategies for different labeling tasks and task complexities, and (3) shed light on the effect of using different visual encodings to guide the visual-interactive labeling process. We further compare labeling of single versus multiple instances at a time, and quantify the impact on efficiency. We systematically compare the performance of visual interactive labeling with that of active learning. Our main findings are that visual-interactive labeling can outperform active learning, given the condition that dimension reduction separates well the class distributions. Moreover, using dimension reduction in combination with additional visual encodings that expose the internal state of the learning model turns out to improve the performance of visual-interactive labeling.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Labeling data instances is an important task in machine learning and visual analytics. Both fields provide a broad set of labeling strategies, whereby machine learning (and in particular active learning) follows a rather model-centered approach and visual analytics employs rather user-centered approaches (visual-interactive labeling). Both approaches have individual strengths and weaknesses. In this work, we conduct an experiment with three parts to assess and compare the performance of these different labeling strategies. In our study, we (1) identify different visual labeling strategies for user-centered labeling, (2) investigate strengths and weaknesses of labeling strategies for different labeling tasks and task complexities, and (3) shed light on the effect of using different visual encodings to guide the visual-interactive labeling process. We further compare labeling of single versus multiple instances at a time, and quantify the impact on efficiency. We systematically compare the performance of visual interactive labeling with that of active learning. Our main findings are that visual-interactive labeling can outperform active learning, given the condition that dimension reduction separates well the class distributions. Moreover, using dimension reduction in combination with additional visual encodings that expose the internal state of the learning model turns out to improve the performance of visual-interactive labeling.",
"title": "Comparing Visual-Interactive Labeling with Active Learning: An Experimental Study",
"normalizedTitle": "Comparing Visual-Interactive Labeling with Active Learning: An Experimental Study",
"fno": "08019851",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Labeling",
"Visual Analytics",
"Data Models",
"Uncertainty",
"Data Visualization",
"Labeling",
"Visual Interactive Labeling",
"Information Visualization",
"Visual Analytics",
"Active Learning",
"Machine Learning",
"Classification",
"Evaluation",
"Experiment",
"Dimensionality Reduction"
],
"authors": [
{
"givenName": "Jürgen",
"surname": "Bernard",
"fullName": "Jürgen Bernard",
"affiliation": "Technische Universität Darmstadt, Darmstadt, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marco",
"surname": "Hutter",
"fullName": "Marco Hutter",
"affiliation": "Technische Universität Darmstadt, Darmstadt, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthias",
"surname": "Zeppelzauer",
"fullName": "Matthias Zeppelzauer",
"affiliation": "St. Pölten University of Applied Sciences, St. Pölten, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dieter",
"surname": "Fellner",
"fullName": "Dieter Fellner",
"affiliation": "Fraunhofer IGD, Darmstadt, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Sedlmair",
"fullName": "Michael Sedlmair",
"affiliation": "University of Vienna, Vienna, Austria",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "298-308",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2008/2174/0/04761187",
"title": "Interactive labeling of facial action units",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761187/12OmNBhZ4li",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118a208",
"title": "Beyond Comparing Image Pairs: Setwise Active Learning for Relative Attributes",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118a208/12OmNxT56C7",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2015/9926/0/07363766",
"title": "Hybrid active learning for non-stationary streaming data with asynchronous labeling",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2015/07363766/12OmNyoSb9g",
"parentPublication": {
"id": "proceedings/big-data/2015/9926/0",
"title": "2015 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061237",
"title": "Particle-based labeling: Fast point-feature labeling without obscuring other visual features",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061237/13rRUwbaqUM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539297",
"title": "Visual Analytics for Mobile Eye Tracking",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539297/13rRUyv53Fx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904017",
"title": "Visual Concept Programming: A Visual Analytics Approach to Injecting Human Intelligence at Scale",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904017/1H0GlgwfKak",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805463",
"title": "VASSL: A Visual Analytics Toolkit for Social Spambot Labeling",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805463/1cG4JtVNK2A",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006224",
"title": "Active Learning Strategies for Hierarchical Labeling Microtasks",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006224/1hJsmY3hhte",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2021/3827/0/382700a211",
"title": "Visual Analytics and Similarity Search - Interest-based Similarity Search in Scientific Data",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2021/382700a211/1y4oJ30dpcY",
"parentPublication": {
"id": "proceedings/iv/2021/3827/0",
"title": "2021 25th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2021/3574/0/357400a019",
"title": "SLAMVis: An Interactive Visualization Approach for Smart Labeling on Multidimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-bdcloud-socialcom-sustaincom/2021/357400a019/1zxKYRTw9Fu",
"parentPublication": {
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2021/3574/0",
"title": "2021 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08019863",
"articleId": "13rRUwwaKtd",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08019833",
"articleId": "13rRUNvgz9X",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRMI",
"name": "ttg201801-08019851s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201801-08019851s1.zip",
"extension": "zip",
"size": "8.74 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": "1GgcTinkSbK",
"doi": "10.1109/TVCG.2022.3201101",
"abstract": "Arguably the most representative application of artificial intelligence, autonomous driving systems usually rely on computer vision techniques to detect the situations of the external environment. Object detection underpins the ability of scene understanding in such systems. However, existing object detection algorithms often behave as a black box, so when a model fails, no information is available on <italic>When, Where</italic> and <italic>How</italic> the failure happened. In this paper, we propose a visual analytics approach to help model developers interpret the model failures. The system includes the <italic>micro-</italic> and <italic>macro-</italic>interpreting modules to address the interpretability problem of object detection in autonomous driving. The <italic>micro-</italic>interpreting module extracts and visualizes the features of a convolutional neural network (CNN) algorithm with density maps, while the <italic>macro-</italic>interpreting module provides spatial-temporal information of an autonomous driving vehicle and its environment. With the situation awareness of the spatial, temporal and neural network information, our system facilitates the understanding of the results of object detection algorithms, and helps the model developers better understand, tune and develop the models. We use real-world autonomous driving data to perform case studies by involving domain experts in computer vision and autonomous driving to evaluate our system. The results from our interviews with them show the effectiveness of our approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Arguably the most representative application of artificial intelligence, autonomous driving systems usually rely on computer vision techniques to detect the situations of the external environment. Object detection underpins the ability of scene understanding in such systems. However, existing object detection algorithms often behave as a black box, so when a model fails, no information is available on <italic>When, Where</italic> and <italic>How</italic> the failure happened. In this paper, we propose a visual analytics approach to help model developers interpret the model failures. The system includes the <italic>micro-</italic> and <italic>macro-</italic>interpreting modules to address the interpretability problem of object detection in autonomous driving. The <italic>micro-</italic>interpreting module extracts and visualizes the features of a convolutional neural network (CNN) algorithm with density maps, while the <italic>macro-</italic>interpreting module provides spatial-temporal information of an autonomous driving vehicle and its environment. With the situation awareness of the spatial, temporal and neural network information, our system facilitates the understanding of the results of object detection algorithms, and helps the model developers better understand, tune and develop the models. We use real-world autonomous driving data to perform case studies by involving domain experts in computer vision and autonomous driving to evaluate our system. The results from our interviews with them show the effectiveness of our approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Arguably the most representative application of artificial intelligence, autonomous driving systems usually rely on computer vision techniques to detect the situations of the external environment. Object detection underpins the ability of scene understanding in such systems. However, existing object detection algorithms often behave as a black box, so when a model fails, no information is available on When, Where and How the failure happened. In this paper, we propose a visual analytics approach to help model developers interpret the model failures. The system includes the micro- and macro-interpreting modules to address the interpretability problem of object detection in autonomous driving. The micro-interpreting module extracts and visualizes the features of a convolutional neural network (CNN) algorithm with density maps, while the macro-interpreting module provides spatial-temporal information of an autonomous driving vehicle and its environment. With the situation awareness of the spatial, temporal and neural network information, our system facilitates the understanding of the results of object detection algorithms, and helps the model developers better understand, tune and develop the models. We use real-world autonomous driving data to perform case studies by involving domain experts in computer vision and autonomous driving to evaluate our system. The results from our interviews with them show the effectiveness of our approach.",
"title": "When, Where and How does it fail? A Spatial-temporal Visual Analytics Approach for Interpretable Object Detection in Autonomous Driving",
"normalizedTitle": "When, Where and How does it fail? A Spatial-temporal Visual Analytics Approach for Interpretable Object Detection in Autonomous Driving",
"fno": "09870679",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Autonomous Vehicles",
"Analytical Models",
"Object Detection",
"Visual Analytics",
"Artificial Intelligence",
"Three Dimensional Displays",
"Data Visualization",
"Autonomous Driving",
"Spatial Temporal Visual Analytics",
"Interpretability"
],
"authors": [
{
"givenName": "Junhong",
"surname": "Wang",
"fullName": "Junhong Wang",
"affiliation": "School of Data Science, Fudan University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yun",
"surname": "Li",
"fullName": "Yun Li",
"affiliation": "School of Data Science, Fudan University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhaoyu",
"surname": "Zhou",
"fullName": "Zhaoyu Zhou",
"affiliation": "School of Data Science, Fudan University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chengshun",
"surname": "Wang",
"fullName": "Chengshun Wang",
"affiliation": "School of Data Science, Fudan University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yijie",
"surname": "Hou",
"fullName": "Yijie Hou",
"affiliation": "School of Data Science, Fudan University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Li",
"surname": "Zhang",
"fullName": "Li Zhang",
"affiliation": "School of Data Science, Fudan University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiangyang",
"surname": "Xue",
"fullName": "Xiangyang Xue",
"affiliation": "School of Data Science, Fudan University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Kamp",
"fullName": "Michael Kamp",
"affiliation": "Institute for AI in Medicine (IKIM), UK Essen, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaolong",
"surname": "Zhang",
"fullName": "Xiaolong Zhang",
"affiliation": "Pennsylvania State University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Siming",
"surname": "Chen",
"fullName": "Siming Chen",
"affiliation": "School of Data Science, Fudan University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-08-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/isorc/2018/5847/0/584701a107",
"title": "Cost-Effective Redundancy Approach for Fail-Operational Autonomous Driving System",
"doi": null,
"abstractUrl": "/proceedings-article/isorc/2018/584701a107/12OmNC8uRnN",
"parentPublication": {
"id": "proceedings/isorc/2018/5847/0",
"title": "2018 IEEE 21st International Symposium on Real-Time Distributed Computing (ISORC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904017",
"title": "Visual Concept Programming: A Visual Analytics Approach to Injecting Human Intelligence at Scale",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904017/1H0GlgwfKak",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2023/02/10042093",
"title": "Trustworthy Artificial Intelligence Requirements in the Autonomous Driving Domain",
"doi": null,
"abstractUrl": "/magazine/co/2023/02/10042093/1KEti7i59w4",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mu/2019/03/08817317",
"title": "Multimedia for Autonomous Driving",
"doi": null,
"abstractUrl": "/magazine/mu/2019/03/08817317/1cPWP7sFJsI",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ica/2019/4026/0/08929214",
"title": "Comfortable Driving by using Deep Inverse Reinforcement Learning",
"doi": null,
"abstractUrl": "/proceedings-article/ica/2019/08929214/1fJRQOpS23u",
"parentPublication": {
"id": "proceedings/ica/2019/4026/0",
"title": "2019 IEEE International Conference on Agents (ICA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoin/2020/4199/0/09016591",
"title": "Fast and Reliable Offloading via Deep Reinforcement Learning for Mobile Edge Video Computing",
"doi": null,
"abstractUrl": "/proceedings-article/icoin/2020/09016591/1hQqW49dsmk",
"parentPublication": {
"id": "proceedings/icoin/2020/4199/0",
"title": "2020 International Conference on Information Networking (ICOIN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09233993",
"title": "<italic>VATLD</italic>: A <italic>V</italic>isual <italic>A</italic>nalytics System to Assess, Understand and Improve <italic>T</italic>raffic <italic>L</italic>ight <italic>D</italic>etection",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09233993/1o53W7V42CQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aitest/2021/3481/0/348100a081",
"title": "An Industrial Workbench for Test Scenario Identification for Autonomous Driving Software",
"doi": null,
"abstractUrl": "/proceedings-article/aitest/2021/348100a081/1xH9KOJDORa",
"parentPublication": {
"id": "proceedings/aitest/2021/3481/0",
"title": "2021 IEEE International Conference On Artificial Intelligence Testing (AITest)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552909",
"title": "<italic>Where Can We Help</italic>? A Visual Analytics Approach to Diagnosing and Improving Semantic Segmentation of Movable Objects",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552909/1xibW2zLd9C",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09597616",
"title": "Visual Evaluation for Autonomous Driving",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09597616/1yezimL3oTS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09870173",
"articleId": "1GgcSqKQSM8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09875213",
"articleId": "1Glcx4nqUEg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1GhRZ0BQwkU",
"name": "ttg555501-09870679s1-supp1-3201101.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09870679s1-supp1-3201101.mp4",
"extension": "mp4",
"size": "35.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx7ouKt",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tm",
"pubType": "journal",
"volume": "18",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45XzbnJc",
"doi": "10.1109/TMC.2018.2831690",
"abstract": "Caching decisions typically seek to cache content that satisfies the maximum possible demand aggregated over all users. Recommendation systems, on the contrary, focus on individual users and recommend to them appealing content in order to elicit further content consumption. In our paper, we explore how these, phenomenally conflicting, objectives can be jointly addressed. First, we formulate an optimization problem for the joint caching and recommendation decisions, aiming to maximize the cache hit ratio under minimal controllable distortion of the inherent user content preferences by the issued recommendations. Then, we prove that the problem is NP-complete and that its objective function lacks those monotonicity and submodularity properties that would guarantee its approximability. Hence, we proceed to introduce a simpler heuristic algorithm that essentially serves as a form of lightweight control over recommendations so that they are both appealing to end-users and friendly to network resources. Finally, we draw on both analysis and simulations with real and synthetic datasets to evaluate the performance of the algorithm. We point out its fundamental properties, provide bounds for the achieved cache hit ratio, and study its sensitivity to its own as well as system-level parameters.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Caching decisions typically seek to cache content that satisfies the maximum possible demand aggregated over all users. Recommendation systems, on the contrary, focus on individual users and recommend to them appealing content in order to elicit further content consumption. In our paper, we explore how these, phenomenally conflicting, objectives can be jointly addressed. First, we formulate an optimization problem for the joint caching and recommendation decisions, aiming to maximize the cache hit ratio under minimal controllable distortion of the inherent user content preferences by the issued recommendations. Then, we prove that the problem is NP-complete and that its objective function lacks those monotonicity and submodularity properties that would guarantee its approximability. Hence, we proceed to introduce a simpler heuristic algorithm that essentially serves as a form of lightweight control over recommendations so that they are both appealing to end-users and friendly to network resources. Finally, we draw on both analysis and simulations with real and synthetic datasets to evaluate the performance of the algorithm. We point out its fundamental properties, provide bounds for the achieved cache hit ratio, and study its sensitivity to its own as well as system-level parameters.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Caching decisions typically seek to cache content that satisfies the maximum possible demand aggregated over all users. Recommendation systems, on the contrary, focus on individual users and recommend to them appealing content in order to elicit further content consumption. In our paper, we explore how these, phenomenally conflicting, objectives can be jointly addressed. First, we formulate an optimization problem for the joint caching and recommendation decisions, aiming to maximize the cache hit ratio under minimal controllable distortion of the inherent user content preferences by the issued recommendations. Then, we prove that the problem is NP-complete and that its objective function lacks those monotonicity and submodularity properties that would guarantee its approximability. Hence, we proceed to introduce a simpler heuristic algorithm that essentially serves as a form of lightweight control over recommendations so that they are both appealing to end-users and friendly to network resources. Finally, we draw on both analysis and simulations with real and synthetic datasets to evaluate the performance of the algorithm. We point out its fundamental properties, provide bounds for the achieved cache hit ratio, and study its sensitivity to its own as well as system-level parameters.",
"title": "Jointly Optimizing Content Caching and Recommendations in Small Cell Networks",
"normalizedTitle": "Jointly Optimizing Content Caching and Recommendations in Small Cell Networks",
"fno": "08352848",
"hasPdf": true,
"idPrefix": "tm",
"keywords": [
"Recommender Systems",
"Wireless Networks",
"Quality Of Experience",
"Servers",
"Mobile Computing",
"Distortion",
"Probability Distribution",
"Content Caching",
"Recommender Systems",
"Small Cells",
"Algorithmic Design",
"Wireless Networks"
],
"authors": [
{
"givenName": "Livia Elena",
"surname": "Chatzieleftheriou",
"fullName": "Livia Elena Chatzieleftheriou",
"affiliation": "Department of Informatics, Athens University of Economics and Business, Athens, Greece",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Merkouris",
"surname": "Karaliopoulos",
"fullName": "Merkouris Karaliopoulos",
"affiliation": "Department of Informatics, Athens University of Economics and Business, Athens, Greece",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Iordanis",
"surname": "Koutsopoulos",
"fullName": "Iordanis Koutsopoulos",
"affiliation": "Department of Informatics, Athens University of Economics and Business, Athens, Greece",
"__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": "1536-1233",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icmla/2016/6167/0/07838200",
"title": "Efficient Content Replacement in Wireless Content Delivery Network with Cooperative Caching",
"doi": null,
"abstractUrl": "/proceedings-article/icmla/2016/07838200/12OmNAYXWJj",
"parentPublication": {
"id": "proceedings/icmla/2016/6167/0",
"title": "2016 15th IEEE International Conference on Machine Learning and Applications (ICMLA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nca/2015/1849/0/1849a267",
"title": "Optimizing Negative Caching for DNSSEC-Oblivious Resolvers",
"doi": null,
"abstractUrl": "/proceedings-article/nca/2015/1849a267/12OmNx7ov1x",
"parentPublication": {
"id": "proceedings/nca/2015/1849/0",
"title": "2015 IEEE 14th International Symposium on Network Computing and Applications (NCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wowmom/2018/4725/0/08449731",
"title": "Show me the Cache: Optimizing Cache-Friendly Recommendations for Sequential Content Access",
"doi": null,
"abstractUrl": "/proceedings-article/wowmom/2018/08449731/13bd1ftOBD1",
"parentPublication": {
"id": "proceedings/wowmom/2018/4725/0",
"title": "2018 IEEE 19th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2018/05/08030120",
"title": "Fast Content Delivery via Distributed Caching and Small Cell Cooperation",
"doi": null,
"abstractUrl": "/journal/tm/2018/05/08030120/13rRUwkxc66",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/services/2018/7374/0/737400a067",
"title": "Predict-then-Prefetch Caching Strategy to Enhance QoE in 5G Networks",
"doi": null,
"abstractUrl": "/proceedings-article/services/2018/737400a067/14Fq0VGY4GA",
"parentPublication": {
"id": "proceedings/services/2018/7374/0",
"title": "2018 IEEE World Congress on Services (SERVICES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-iucc-bdcloud-socialcom-sustaincom/2018/1141/0/114100a438",
"title": "Heuristic Prefetching Caching Strategy to Enhance QoE in Edge Computing",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-iucc-bdcloud-socialcom-sustaincom/2018/114100a438/18AuPXj0S6A",
"parentPublication": {
"id": "proceedings/ispa-iucc-bdcloud-socialcom-sustaincom/2018/1141/0",
"title": "2018 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/5555/01/09882371",
"title": "Combining Resource-Aware Recommendation and Caching in the Era of MEC for Improving the Experience of Video Streaming Users",
"doi": null,
"abstractUrl": "/journal/sc/5555/01/09882371/1GwNMBQOGZ2",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2021/06/09007521",
"title": "A Personalized Preference Learning Framework for Caching in Mobile Networks",
"doi": null,
"abstractUrl": "/journal/tm/2021/06/09007521/1hJKjAoIFNu",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icws/2021/1681/0/168100a648",
"title": "Video Quality and Popularity-aware Video Caching in Content Delivery Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2021/168100a648/1yrHAQMHhp6",
"parentPublication": {
"id": "proceedings/icws/2021/1681/0",
"title": "2021 IEEE International Conference on Web Services (ICWS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscipt/2021/4137/0/413700a651",
"title": "A Fine-grained Hierarchical Edge Caching Scheme Based on Content Popularity",
"doi": null,
"abstractUrl": "/proceedings-article/iscipt/2021/413700a651/1zzpwKCiwAU",
"parentPublication": {
"id": "proceedings/iscipt/2021/4137/0",
"title": "2021 6th International Symposium on Computer and Information Processing Technology (ISCIPT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08344489",
"articleId": "17D45WaTkk6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08344494",
"articleId": "17D45WK5Amy",
"__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": "1nTqVJBaroA",
"doi": "10.1109/TVCG.2020.3030387",
"abstract": "Cloud-based visualization services have made visual analytics accessible to a much wider audience than ever before. Systems such as Tableau have started to amass increasingly large repositories of analytical knowledge in the form of interactive visualization workbooks. When shared, these collections can form a visual analytic knowledge base. However, as the size of a collection increases, so does the difficulty in finding relevant information. Content-based recommendation (CBR) systems could help analysts in finding and managing workbooks relevant to their interests. Toward this goal, we focus on text-based content that is representative of the subject matter of visualizations rather than the visual encodings and style. We discuss the challenges associated with creating a CBR based on visualization specifications and explore more concretely how to implement the relevance measures required using Tableau workbook specifications as the source of content data. We also demonstrate what information can be extracted from these visualization specifications and how various natural language processing techniques can be used to compute similarity between workbooks as one way to measure relevance. We report on a crowd-sourced user study to determine if our similarity measure mimics human judgement. Finally, we choose latent Dirichl et al.ocation (LDA) as a specific model and instantiate it in a proof-of-concept recommender tool to demonstrate the basic function of our similarity measure.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Cloud-based visualization services have made visual analytics accessible to a much wider audience than ever before. Systems such as Tableau have started to amass increasingly large repositories of analytical knowledge in the form of interactive visualization workbooks. When shared, these collections can form a visual analytic knowledge base. However, as the size of a collection increases, so does the difficulty in finding relevant information. Content-based recommendation (CBR) systems could help analysts in finding and managing workbooks relevant to their interests. Toward this goal, we focus on text-based content that is representative of the subject matter of visualizations rather than the visual encodings and style. We discuss the challenges associated with creating a CBR based on visualization specifications and explore more concretely how to implement the relevance measures required using Tableau workbook specifications as the source of content data. We also demonstrate what information can be extracted from these visualization specifications and how various natural language processing techniques can be used to compute similarity between workbooks as one way to measure relevance. We report on a crowd-sourced user study to determine if our similarity measure mimics human judgement. Finally, we choose latent Dirichl et al.ocation (LDA) as a specific model and instantiate it in a proof-of-concept recommender tool to demonstrate the basic function of our similarity measure.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Cloud-based visualization services have made visual analytics accessible to a much wider audience than ever before. Systems such as Tableau have started to amass increasingly large repositories of analytical knowledge in the form of interactive visualization workbooks. When shared, these collections can form a visual analytic knowledge base. However, as the size of a collection increases, so does the difficulty in finding relevant information. Content-based recommendation (CBR) systems could help analysts in finding and managing workbooks relevant to their interests. Toward this goal, we focus on text-based content that is representative of the subject matter of visualizations rather than the visual encodings and style. We discuss the challenges associated with creating a CBR based on visualization specifications and explore more concretely how to implement the relevance measures required using Tableau workbook specifications as the source of content data. We also demonstrate what information can be extracted from these visualization specifications and how various natural language processing techniques can be used to compute similarity between workbooks as one way to measure relevance. We report on a crowd-sourced user study to determine if our similarity measure mimics human judgement. Finally, we choose latent Dirichl et al.ocation (LDA) as a specific model and instantiate it in a proof-of-concept recommender tool to demonstrate the basic function of our similarity measure.",
"title": "VizCommender: Computing Text-Based Similarity in Visualization Repositories for Content-Based Recommendations",
"normalizedTitle": "VizCommender: Computing Text-Based Similarity in Visualization Repositories for Content-Based Recommendations",
"fno": "09222280",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Mining",
"Data Visualisation",
"Information Retrieval",
"Natural Language Processing",
"Recommender Systems",
"Text Analysis",
"Text Based Similarity",
"Visualization Repositories",
"Content Based Recommendations",
"Cloud Based Visualization Services",
"Interactive Visualization Workbooks",
"Visual Analytic Knowledge Base",
"CBR",
"Text Based Content",
"Visual Encodings",
"Visualization Specifications",
"Relevance Measures",
"Tableau Workbook Specifications",
"Content Data",
"Similarity Measure",
"Proof Of Concept Recommender Tool",
"Large Repositories",
"Data Visualization",
"Visualization",
"Task Analysis",
"Feature Extraction",
"Encoding",
"Recommender Systems",
"Natural Language Processing",
"Visualization Recommendation",
"Content Based Filtering",
"Recommender Systems",
"Visualization Workbook Repositories"
],
"authors": [
{
"givenName": "Michael",
"surname": "Oppermann",
"fullName": "Michael Oppermann",
"affiliation": "Tableau Research and the University of British Columbia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert",
"surname": "Kincaid",
"fullName": "Robert Kincaid",
"affiliation": "Tableau Research (retired)",
"__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": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "495-505",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/issrew/2017/2387/0/2387a077",
"title": "Visualization of Specification Coverage: A Case Study of a Web Application Development in Industry",
"doi": null,
"abstractUrl": "/proceedings-article/issrew/2017/2387a077/12OmNBbaH7Z",
"parentPublication": {
"id": "proceedings/issrew/2017/2387/0",
"title": "2017 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2004/8603/2/01394311",
"title": "Optimizing similarity based visualization in content based image retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2004/01394311/12OmNCh0Pc8",
"parentPublication": {
"id": "proceedings/icme/2004/8603/2",
"title": "2004 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/enic/2016/3455/0/07838040",
"title": "A Comparative Analysis of Network-Based Similarity Measures for Scientific Paper Recommendations",
"doi": null,
"abstractUrl": "/proceedings-article/enic/2016/07838040/12OmNy5R3Gm",
"parentPublication": {
"id": "proceedings/enic/2016/3455/0",
"title": "2016 Third European Network Intelligence Conference (ENIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2017/3870/0/3870a230",
"title": "A Method for Thematic and Structural Visualization of Academic Content",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2017/3870a230/12OmNyvoXiY",
"parentPublication": {
"id": "proceedings/icalt/2017/3870/0",
"title": "2017 IEEE 17th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2005/2397/0/23970883",
"title": "Visualizing the Meaning of Texts",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2005/23970883/12OmNz6iOQp",
"parentPublication": {
"id": "proceedings/iv/2005/2397/0",
"title": "Ninth International Conference on Information Visualisation (IV'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192728",
"title": "Voyager: Exploratory Analysis via Faceted Browsing of Visualization Recommendations",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192728/13rRUILLkDU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2019/1975/0/197500c029",
"title": "Visualizing Deep Similarity Networks",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2019/197500c029/18j8PJ2Agrm",
"parentPublication": {
"id": "proceedings/wacv/2019/1975/0",
"title": "2019 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09909985",
"title": "A Design Space for Surfacing Content Recommendations in Visual Analytic Platforms",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09909985/1Hcj6r8qCS4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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": "proceedings/icaa/2021/3730/0/373000a279",
"title": "Text Similarity Based on Post-training BERT",
"doi": null,
"abstractUrl": "/proceedings-article/icaa/2021/373000a279/1zL1LxhbFqU",
"parentPublication": {
"id": "proceedings/icaa/2021/3730/0",
"title": "2021 International Conference on Intelligent Computing, Automation and Applications (ICAA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09234027",
"articleId": "1o531wbxsSk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09216532",
"articleId": "1nJsFIg64us",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLeL5k3uOA",
"name": "ttg202102-09222280s1-supp1-3030387.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222280s1-supp1-3030387.pdf",
"extension": "pdf",
"size": "30.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1Lk2bbwqInK",
"title": "April",
"year": "2023",
"issueNum": "04",
"idPrefix": "tk",
"pubType": "journal",
"volume": "35",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zUUMW9BNcI",
"doi": "10.1109/TKDE.2022.3140387",
"abstract": "Recommendation systems have become more important since the widespread use of the Internet. The large amount of information means that it is difficult for users to discover what they really need. However, users’ preferences can change over time because of the age and the impact of social networks. Recommendation systems must capture users’ preferences and recommend suitable items, which is a difficult challenge. This study proposes a novel recommendation system that adapts to the changing preferences of users. By learning and adapting to users’ changing preferences better recommendations are provided. This study uses context factors as additional information to model users’ preferences more accurately. For the proposed recommendation system, the context is based on users’ most recent interaction items. This study proposes two novel attention mechanisms for the recommendation system. The contextual item attention module captures contextual information, changing pattern in users’ preference and the importance of items. The multi-head attention module extends the diversity of users’ preferences and adapts to changing preferences. The recommendation performance is improved using additional item's temporal information to model the contextual item's representation. Experiments compare the proposed algorithm with several state-of-the-art recommendation methods using three real-world datasets. The experimental results demonstrate that the proposed context-aware recommendation model outperforms traditional methods and demonstrate the effectiveness with which contextual information is captured by the attention mechanism.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recommendation systems have become more important since the widespread use of the Internet. The large amount of information means that it is difficult for users to discover what they really need. However, users’ preferences can change over time because of the age and the impact of social networks. Recommendation systems must capture users’ preferences and recommend suitable items, which is a difficult challenge. This study proposes a novel recommendation system that adapts to the changing preferences of users. By learning and adapting to users’ changing preferences better recommendations are provided. This study uses context factors as additional information to model users’ preferences more accurately. For the proposed recommendation system, the context is based on users’ most recent interaction items. This study proposes two novel attention mechanisms for the recommendation system. The contextual item attention module captures contextual information, changing pattern in users’ preference and the importance of items. The multi-head attention module extends the diversity of users’ preferences and adapts to changing preferences. The recommendation performance is improved using additional item's temporal information to model the contextual item's representation. Experiments compare the proposed algorithm with several state-of-the-art recommendation methods using three real-world datasets. The experimental results demonstrate that the proposed context-aware recommendation model outperforms traditional methods and demonstrate the effectiveness with which contextual information is captured by the attention mechanism.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recommendation systems have become more important since the widespread use of the Internet. The large amount of information means that it is difficult for users to discover what they really need. However, users’ preferences can change over time because of the age and the impact of social networks. Recommendation systems must capture users’ preferences and recommend suitable items, which is a difficult challenge. This study proposes a novel recommendation system that adapts to the changing preferences of users. By learning and adapting to users’ changing preferences better recommendations are provided. This study uses context factors as additional information to model users’ preferences more accurately. For the proposed recommendation system, the context is based on users’ most recent interaction items. This study proposes two novel attention mechanisms for the recommendation system. The contextual item attention module captures contextual information, changing pattern in users’ preference and the importance of items. The multi-head attention module extends the diversity of users’ preferences and adapts to changing preferences. The recommendation performance is improved using additional item's temporal information to model the contextual item's representation. Experiments compare the proposed algorithm with several state-of-the-art recommendation methods using three real-world datasets. The experimental results demonstrate that the proposed context-aware recommendation model outperforms traditional methods and demonstrate the effectiveness with which contextual information is captured by the attention mechanism.",
"title": "An Adaptive, Context-Aware, and Stacked Attention Network-Based Recommendation System to Capture Users’ Temporal Preference",
"normalizedTitle": "An Adaptive, Context-Aware, and Stacked Attention Network-Based Recommendation System to Capture Users’ Temporal Preference",
"fno": "09670723",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Learning Artificial Intelligence",
"Recommender Systems",
"Social Networking Online",
"Additional Item",
"Attention Mechanism",
"Capture Users",
"Changing Preferences",
"Context Aware Recommendation Model",
"Contextual Item Attention Module Captures Contextual Information",
"Model Users",
"Stacked Attention Network Based Recommendation System",
"State Of The Art Recommendation Methods",
"Context Modeling",
"Adaptation Models",
"Hidden Markov Models",
"Deep Learning",
"Automobiles",
"Neural Networks",
"Recurrent Neural Networks",
"Recommendation System",
"Temporal Preference",
"Attention Networks",
"Deep Learning"
],
"authors": [
{
"givenName": "Jung-Hsien",
"surname": "Chiang",
"fullName": "Jung-Hsien Chiang",
"affiliation": "Institute of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chung-Yao",
"surname": "Ma",
"fullName": "Chung-Yao Ma",
"affiliation": "Institute of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chi-Shiang",
"surname": "Wang",
"fullName": "Chi-Shiang Wang",
"affiliation": "Institute of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pei-Yi",
"surname": "Hao",
"fullName": "Pei-Yi Hao",
"affiliation": "Department of Intelligent Commerce, National Kaohsiung University of Science and Technology, Kaohsiung, Taiwan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "3404-3418",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ictai/2017/3876/0/387601a796",
"title": "Madrid live: a context-aware recommender systems of leisure plans",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2017/387601a796/12OmNvzJFVp",
"parentPublication": {
"id": "proceedings/ictai/2017/3876/0",
"title": "2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icws/2022/8143/0/814300a182",
"title": "Capturing Users’ Fresh Interests via Evolving Session-Based Social Recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2022/814300a182/1GIuFffzhXW",
"parentPublication": {
"id": "proceedings/icws/2022/8143/0",
"title": "2022 IEEE International Conference on Web Services (ICWS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icws/2022/8143/0/814300a017",
"title": "Spatio-Temporal Mogrifier LSTM and Attention Network for Next POI Recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2022/814300a017/1GIuwPNS9bO",
"parentPublication": {
"id": "proceedings/icws/2022/8143/0",
"title": "2022 IEEE International Conference on Web Services (ICWS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2022/9062/0/09956681",
"title": "KSRG:Knowledge-Aware Sequential Recommendation with Graph Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09956681/1IHpcsTcBKU",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/05/09133505",
"title": "Where to Go Next: A Spatio-Temporal Gated Network for Next POI Recommendation",
"doi": null,
"abstractUrl": "/journal/tk/2022/05/09133505/1lf6zzg6hva",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/01/09439972",
"title": "Contextualized Graph Attention Network for Recommendation With Item Knowledge Graph",
"doi": null,
"abstractUrl": "/journal/tk/2023/01/09439972/1tRKpZEPcu4",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2020/1485/0/148500a593",
"title": "A Hybrid Recommendation Algorithm with Short-term Preference and Knowledge Preference",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-bdcloud-socialcom-sustaincom/2020/148500a593/1ua4zeZDTva",
"parentPublication": {
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2020/1485/0",
"title": "2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2021/2463/0/246300a290",
"title": "CASR: A Collaborative Attention Model for Session-based Recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2021/246300a290/1wLczA1EfYI",
"parentPublication": {
"id": "proceedings/compsac/2021/2463/0",
"title": "2021 IEEE 45th Annual Computers, Software, and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icaa/2021/3730/0/373000a190",
"title": "Multi-preference Social Recommendation of Users Based on Graph Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/icaa/2021/373000a190/1zL1FcjfFTi",
"parentPublication": {
"id": "proceedings/icaa/2021/3730/0",
"title": "2021 International Conference on Intelligent Computing, Automation and Applications (ICAA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2021/06/08723186",
"title": "An Attention-Based Spatiotemporal LSTM Network for Next POI Recommendation",
"doi": null,
"abstractUrl": "/journal/sc/2021/06/08723186/1zarN1rJdbW",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09650594",
"articleId": "1zkoTD2fyF2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09664331",
"articleId": "1zHDyIKpQU8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzVoBCD",
"title": "Sept.-Oct.",
"year": "2015",
"issueNum": "05",
"idPrefix": "tb",
"pubType": "journal",
"volume": "12",
"label": "Sept.-Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwghd7M",
"doi": "10.1109/TCBB.2015.2418994",
"abstract": "The complexity of biological tissue morphogenesis makes in silico simulations of such system very interesting in order to gain a better understanding of the underlying mechanisms ruling the development of multicellular tissues. This complexity is mainly due to two elements: firstly, biological tissues comprise a large amount of cells; secondly, these cells exhibit complex interactions and behaviors. To address these two issues, we propose two tools: the first one is a virtual cell model that comprise two main elements: firstly, a mechanical structure (membrane, cytoskeleton, and cortex) and secondly, the main behaviors exhibited by biological cells, i.e., mitosis, growth, differentiation, molecule consumption, and production as well as the consideration of the physical constraints issued from the environment. An artificial chemistry is also included in the model. This virtual cell model is coupled to an agent-based formalism. The second tool is a simulator that relies on the OpenCL framework. It allows efficient parallel simulations on heterogenous devices such as micro-processors or graphics processors. We present two case studies validating the implementation of our model in our simulator: cellular proliferation controlled by cell signalling and limb growth in a virtual organism.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The complexity of biological tissue morphogenesis makes in silico simulations of such system very interesting in order to gain a better understanding of the underlying mechanisms ruling the development of multicellular tissues. This complexity is mainly due to two elements: firstly, biological tissues comprise a large amount of cells; secondly, these cells exhibit complex interactions and behaviors. To address these two issues, we propose two tools: the first one is a virtual cell model that comprise two main elements: firstly, a mechanical structure (membrane, cytoskeleton, and cortex) and secondly, the main behaviors exhibited by biological cells, i.e., mitosis, growth, differentiation, molecule consumption, and production as well as the consideration of the physical constraints issued from the environment. An artificial chemistry is also included in the model. This virtual cell model is coupled to an agent-based formalism. The second tool is a simulator that relies on the OpenCL framework. It allows efficient parallel simulations on heterogenous devices such as micro-processors or graphics processors. We present two case studies validating the implementation of our model in our simulator: cellular proliferation controlled by cell signalling and limb growth in a virtual organism.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The complexity of biological tissue morphogenesis makes in silico simulations of such system very interesting in order to gain a better understanding of the underlying mechanisms ruling the development of multicellular tissues. This complexity is mainly due to two elements: firstly, biological tissues comprise a large amount of cells; secondly, these cells exhibit complex interactions and behaviors. To address these two issues, we propose two tools: the first one is a virtual cell model that comprise two main elements: firstly, a mechanical structure (membrane, cytoskeleton, and cortex) and secondly, the main behaviors exhibited by biological cells, i.e., mitosis, growth, differentiation, molecule consumption, and production as well as the consideration of the physical constraints issued from the environment. An artificial chemistry is also included in the model. This virtual cell model is coupled to an agent-based formalism. The second tool is a simulator that relies on the OpenCL framework. It allows efficient parallel simulations on heterogenous devices such as micro-processors or graphics processors. We present two case studies validating the implementation of our model in our simulator: cellular proliferation controlled by cell signalling and limb growth in a virtual organism.",
"title": "Large Scale Tissue Morphogenesis Simulation on Heterogenous Systems Based on a Flexible Biomechanical Cell Model",
"normalizedTitle": "Large Scale Tissue Morphogenesis Simulation on Heterogenous Systems Based on a Flexible Biomechanical Cell Model",
"fno": "07078857",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Biological System Modeling",
"Computational Modeling",
"Force",
"Springs",
"Biological Tissues",
"Mathematical Model",
"Parallel Simulation",
"Computational Biology",
"Virtual Cell",
"Virtual Tissue Morphogenesis",
"Multi Agent Systems",
"Parallel Programing"
],
"authors": [
{
"givenName": "Anne",
"surname": "Jeannin-Girardon",
"fullName": "Anne Jeannin-Girardon",
"affiliation": "Department of Computer Science, University of Western Brittany, UMR 6285, Lab-STICC, Brest, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pascal",
"surname": "Ballet",
"fullName": "Pascal Ballet",
"affiliation": "Department of Computer Science, University of Western Brittany, UMR 6285, Lab-STICC, Brest, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vincent",
"surname": "Rodin",
"fullName": "Vincent Rodin",
"affiliation": "Department of Computer Science, University of Western Brittany, UMR 6285, Lab-STICC, Brest, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2015-09-01 00:00:00",
"pubType": "trans",
"pages": "1021-1033",
"year": "2015",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cbms/1991/2164/0/00128958",
"title": "Automatic cell count in digital images of liver tissue sections",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/1991/00128958/12OmNwpGgQ3",
"parentPublication": {
"id": "proceedings/cbms/1991/2164/0",
"title": "Computer-Based Medical Systems - Proceedings of the Fourth Annual IEEE Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/biovis/2012/4729/0/06378596",
"title": "Epithelial cell reconstruction and visualization of the developing Drosophila wing imaginal disc",
"doi": null,
"abstractUrl": "/proceedings-article/biovis/2012/06378596/12OmNxwWoIf",
"parentPublication": {
"id": "proceedings/biovis/2012/4729/0",
"title": "2012 IEEE Symposium on Biological Data Visualization (BioVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vbc/1990/2039/0/00109300",
"title": "Modeling and simulation of morphogenesis by cell rearrangement",
"doi": null,
"abstractUrl": "/proceedings-article/vbc/1990/00109300/12OmNy7QfpE",
"parentPublication": {
"id": "proceedings/vbc/1990/2039/0",
"title": "[1990] Proceedings of the First Conference on Visualization in Biomedical Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2010/6821/0/05444621",
"title": "New experimental method based biological soft tissue modeling",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2010/05444621/12OmNyRPgOa",
"parentPublication": {
"id": "proceedings/haptics/2010/6821/0",
"title": "2010 IEEE Haptics Symposium (Formerly known as Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2019/06/08338404",
"title": "Dynamical Detection of Boundaries and Cavities in Biophysical Cell-Based Simulations of Growing Tumor Tissues",
"doi": null,
"abstractUrl": "/journal/tb/2019/06/08338404/13rRUIJuxoa",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2019/05/08634877",
"title": "Tissue-Specific Subcellular Localization Prediction Using Multi-Label Markov Random Fields",
"doi": null,
"abstractUrl": "/journal/tb/2019/05/08634877/17D45VsBU6Z",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904770",
"title": "Visinity: Visual Spatial Neighborhood Analysis for Multiplexed Tissue Imaging Data",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904770/1H2loP2yJpe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2022/6124/0/612400a074",
"title": "Multi-Tissue Analysis Using Synchrotron Radiation Micro-CT Images",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2022/612400a074/1J6hxoZwCVa",
"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/bibm/2022/6819/0/09995116",
"title": "Effect of cell coupling between pacemaker cells on the biological pacemaker in cardiac tissue model",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995116/1JC1Glh2Lg4",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmcce/2020/2314/0/231400a418",
"title": "The Research of Nonlinear Characteristics of High Intensity Focused Ultrasound in Biological Tissue",
"doi": null,
"abstractUrl": "/proceedings-article/icmcce/2020/231400a418/1tzz3ZHI9c4",
"parentPublication": {
"id": "proceedings/icmcce/2020/2314/0",
"title": "2020 5th International Conference on Mechanical, Control and Computer Engineering (ICMCCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07065307",
"articleId": "13rRUwgyOhz",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07117392",
"articleId": "13rRUzphDwk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx1qV7L",
"title": "Sept.-Oct.",
"year": "2019",
"issueNum": "05",
"idPrefix": "tb",
"pubType": "journal",
"volume": "16",
"label": "Sept.-Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45VsBU6Z",
"doi": "10.1109/TCBB.2019.2897683",
"abstract": "The understanding of subcellular localization (SCL) of proteins and proteome variation in the different tissues and organs of the human body are two crucial aspects for increasing our knowledge of the dynamic rules of proteins, the cell biology, and the mechanism of diseases. Although there have been tremendous contributions to these two fields independently, the lack of knowledge of the variation of spatial distribution of proteins in the different tissues still exists. Here, we proposed an approach that allows predicting protein SCL on tissue specificity through the use of tissue-specific functional associations and physical protein-protein interactions (PPIs). We applied our previously developed Bayesian collective Markov random fields (BCMRFs) on tissue-specific protein-protein interaction network (PPI network) for nine types of tissues focusing on eight high-level SCL. The evaluated results demonstrate the strength of our approach in predicting tissue-specific SCL. We identified 1,314 proteins that their SCL were previously proven cell line dependent. We predicted 549 novel tissue-specific localized candidate proteins while some of them were validated via text-mining.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The understanding of subcellular localization (SCL) of proteins and proteome variation in the different tissues and organs of the human body are two crucial aspects for increasing our knowledge of the dynamic rules of proteins, the cell biology, and the mechanism of diseases. Although there have been tremendous contributions to these two fields independently, the lack of knowledge of the variation of spatial distribution of proteins in the different tissues still exists. Here, we proposed an approach that allows predicting protein SCL on tissue specificity through the use of tissue-specific functional associations and physical protein-protein interactions (PPIs). We applied our previously developed Bayesian collective Markov random fields (BCMRFs) on tissue-specific protein-protein interaction network (PPI network) for nine types of tissues focusing on eight high-level SCL. The evaluated results demonstrate the strength of our approach in predicting tissue-specific SCL. We identified 1,314 proteins that their SCL were previously proven cell line dependent. We predicted 549 novel tissue-specific localized candidate proteins while some of them were validated via text-mining.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The understanding of subcellular localization (SCL) of proteins and proteome variation in the different tissues and organs of the human body are two crucial aspects for increasing our knowledge of the dynamic rules of proteins, the cell biology, and the mechanism of diseases. Although there have been tremendous contributions to these two fields independently, the lack of knowledge of the variation of spatial distribution of proteins in the different tissues still exists. Here, we proposed an approach that allows predicting protein SCL on tissue specificity through the use of tissue-specific functional associations and physical protein-protein interactions (PPIs). We applied our previously developed Bayesian collective Markov random fields (BCMRFs) on tissue-specific protein-protein interaction network (PPI network) for nine types of tissues focusing on eight high-level SCL. The evaluated results demonstrate the strength of our approach in predicting tissue-specific SCL. We identified 1,314 proteins that their SCL were previously proven cell line dependent. We predicted 549 novel tissue-specific localized candidate proteins while some of them were validated via text-mining.",
"title": "Tissue-Specific Subcellular Localization Prediction Using Multi-Label Markov Random Fields",
"normalizedTitle": "Tissue-Specific Subcellular Localization Prediction Using Multi-Label Markov Random Fields",
"fno": "08634877",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Bioinformatics",
"Biological Tissues",
"Cellular Biophysics",
"Diseases",
"Markov Processes",
"Molecular Biophysics",
"Physiological Models",
"Proteins",
"Proteomics",
"Text Analysis",
"Bayesian Collective Markov Random Fields",
"Tissue Specific SCL",
"High Level SCL",
"Tissue Specific Protein Protein Interaction Network",
"Physical Protein Protein Interactions",
"Tissue Specific Functional Associations",
"Tissue Specificity",
"Protein SCL",
"Proteome Variation",
"Multilabel Markov Random Fields",
"Tissue Specific Subcellular Localization Prediction",
"Proteins",
"Markov Processes",
"Predictive Models",
"Labeling",
"Biological Tissues",
"Diseases",
"Graphical Models",
"Human Protein Subcellular Localization",
"Protein Protein Interaction",
"Tissue Specific Analysis",
"Multi Label Markov Random Field",
"Imbalanced Multi Label Classification"
],
"authors": [
{
"givenName": "Lu",
"surname": "Zhu",
"fullName": "Lu Zhu",
"affiliation": "the Bioinformatics/Medical Informatics Departement, Faculty of Technology and Center for Biotechnology, International Research Training Group Computational Methods for the Analysis of the Diversity and Dynamics of Genomes and Genome Informatics, Bielefeld University, Bielefeld, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ralf",
"surname": "Hofestadt",
"fullName": "Ralf Hofestadt",
"affiliation": "Bioinformatics/Medical Informatics Departement, Bielefeld University, Bielefeld, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Martin",
"surname": "Ester",
"fullName": "Martin Ester",
"affiliation": "School of Computing Science, Simon Fraser University, Burnaby, BC, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2019-09-01 00:00:00",
"pubType": "trans",
"pages": "1471-1482",
"year": "2019",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2014/5209/0/5209a512",
"title": "Dual Fuzzy Hypergraph Regularized Multi-label Learning for Protein Subcellular Location Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209a512/12OmNAgGwf5",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2015/9325/0/9325a411",
"title": "Identification of Biomarkers and Signatures in Protein Data",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2015/9325a411/12OmNAolGMk",
"parentPublication": {
"id": "proceedings/e-science/2015/9325/0",
"title": "2015 IEEE 11th International Conference on e-Science (e-Science)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2017/3050/0/08218045",
"title": "SoyTSN: A web-based prediction tool for soybean tissue specific network within SoyKB",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2017/08218045/12OmNqOwQKx",
"parentPublication": {
"id": "proceedings/bibm/2017/3050/0",
"title": "2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2011/1799/0/06120452",
"title": "Multi-label Learning for Protein Subcellular Location Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2011/06120452/12OmNs0kyt4",
"parentPublication": {
"id": "proceedings/bibm/2011/1799/0",
"title": "2011 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbeb/2012/4706/0/4706a801",
"title": "Expressions of CD151, Integrin alpha3 beta1 and MMP7 in Breast Cancer Tissue Microarray and their Clinicopathological Significance",
"doi": null,
"abstractUrl": "/proceedings-article/icbeb/2012/4706a801/12OmNxtOO04",
"parentPublication": {
"id": "proceedings/icbeb/2012/4706/0",
"title": "Biomedical Engineering and Biotechnology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2015/6799/0/07359696",
"title": "Joint inference of tissue-specific networks with a scale free topology",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2015/07359696/12OmNyQ7FL3",
"parentPublication": {
"id": "proceedings/bibm/2015/6799/0",
"title": "2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2017/3050/0/08217626",
"title": "Co-expression networks between protein encoding mitochondrial genes and all the remaining genes in human tissues",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2017/08217626/12OmNyp9Mii",
"parentPublication": {
"id": "proceedings/bibm/2017/3050/0",
"title": "2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2013/02/ttb2013020436",
"title": "Multilabel Learning via Random Label Selection for Protein Subcellular Multilocations Prediction",
"doi": null,
"abstractUrl": "/journal/tb/2013/02/ttb2013020436/13rRUILtJkg",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2022/6124/0/612400a074",
"title": "Multi-Tissue Analysis Using Synchrotron Radiation Micro-CT Images",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2022/612400a074/1J6hxoZwCVa",
"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/icdacai/2022/5470/0/547000a085",
"title": "Random Forest Algorithm in Prediction of Protein Subcellular Localization",
"doi": null,
"abstractUrl": "/proceedings-article/icdacai/2022/547000a085/1J7WSG9pLtS",
"parentPublication": {
"id": "proceedings/icdacai/2022/5470/0",
"title": "2022 International Conference on Data Analytics, Computing and Artificial Intelligence (ICDACAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08464248",
"articleId": "13xI8AEJDwf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07513439",
"articleId": "13rRUyeTVgA",
"__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": "19fxlYsck0g",
"doi": "10.1109/TBDATA.2019.2907588",
"abstract": "The process of preparing potentially large and complex data sets for further analysis or manual examination is often called data wrangling. In classical warehousing environments, the steps in such a process are carried out using Extract-Transform-Load platforms, with significant manual involvement in specifying, configuring or tuning many of them. In typical big data applications, we need to ensure that all wrangling steps, including web extraction, selection, integration and cleaning, benefit from automation wherever possible. Towards this goal, in the paper we: (i) introduce a notion of data context, which associates portions of a target schema with extensional data of types that are commonly available; (ii) define a scalable methodology to bootstrap an end-to-end data wrangling process based on data profiling; (iii) describe how data context is used to inform automation in several steps within wrangling, specifically, matching, value format transformation, data repair, and mapping generation and selection to optimise the accuracy, consistency and relevance of the result; and (iv) we evaluate the approach with real estate data and financial data, showing substantial improvements in the results of automated wrangling.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The process of preparing potentially large and complex data sets for further analysis or manual examination is often called data wrangling. In classical warehousing environments, the steps in such a process are carried out using Extract-Transform-Load platforms, with significant manual involvement in specifying, configuring or tuning many of them. In typical big data applications, we need to ensure that all wrangling steps, including web extraction, selection, integration and cleaning, benefit from automation wherever possible. Towards this goal, in the paper we: (i) introduce a notion of data context, which associates portions of a target schema with extensional data of types that are commonly available; (ii) define a scalable methodology to bootstrap an end-to-end data wrangling process based on data profiling; (iii) describe how data context is used to inform automation in several steps within wrangling, specifically, matching, value format transformation, data repair, and mapping generation and selection to optimise the accuracy, consistency and relevance of the result; and (iv) we evaluate the approach with real estate data and financial data, showing substantial improvements in the results of automated wrangling.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The process of preparing potentially large and complex data sets for further analysis or manual examination is often called data wrangling. In classical warehousing environments, the steps in such a process are carried out using Extract-Transform-Load platforms, with significant manual involvement in specifying, configuring or tuning many of them. In typical big data applications, we need to ensure that all wrangling steps, including web extraction, selection, integration and cleaning, benefit from automation wherever possible. Towards this goal, in the paper we: (i) introduce a notion of data context, which associates portions of a target schema with extensional data of types that are commonly available; (ii) define a scalable methodology to bootstrap an end-to-end data wrangling process based on data profiling; (iii) describe how data context is used to inform automation in several steps within wrangling, specifically, matching, value format transformation, data repair, and mapping generation and selection to optimise the accuracy, consistency and relevance of the result; and (iv) we evaluate the approach with real estate data and financial data, showing substantial improvements in the results of automated wrangling.",
"title": "Incorporating Data Context to Cost-Effectively Automate End-to-End Data Wrangling",
"normalizedTitle": "Incorporating Data Context to Cost-Effectively Automate End-to-End Data Wrangling",
"fno": "08691825",
"hasPdf": true,
"idPrefix": "bd",
"keywords": [
"Big Data",
"Information Management",
"Data Mining",
"Manuals",
"Cleaning",
"Automation",
"Computer Science",
"Data Wrangling",
"Data Matching",
"Mapping Generation",
"Data Transformation",
"Data Cleaning",
"Source Selection"
],
"authors": [
{
"givenName": "Martin",
"surname": "Koehler",
"fullName": "Martin Koehler",
"affiliation": "Information Management Group, School of Computer Science, University of Manchester, Manchester, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Edward",
"surname": "Abel",
"fullName": "Edward Abel",
"affiliation": "Information Management Group, School of Computer Science, University of Manchester, Manchester, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alex",
"surname": "Bogatu",
"fullName": "Alex Bogatu",
"affiliation": "Information Management Group, School of Computer Science, University of Manchester, Manchester, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cristina",
"surname": "Civili",
"fullName": "Cristina Civili",
"affiliation": "School of Informatics, University of Edinburgh, Edinburgh, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lacramioara",
"surname": "Mazilu",
"fullName": "Lacramioara Mazilu",
"affiliation": "Information Management Group, School of Computer Science, University of Manchester, Manchester, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nikolaos",
"surname": "Konstantinou",
"fullName": "Nikolaos Konstantinou",
"affiliation": "Information Management Group, School of Computer Science, University of Manchester, Manchester, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alvaro A.A.",
"surname": "Fernandes",
"fullName": "Alvaro A.A. Fernandes",
"affiliation": "Information Management Group, School of Computer Science, University of Manchester, Manchester, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Keane",
"fullName": "John Keane",
"affiliation": "Software Systems Group, School of Computer Science, University of Manchester, Manchester, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Leonid",
"surname": "Libkin",
"fullName": "Leonid Libkin",
"affiliation": "School of Informatics, University of Edinburgh, Edinburgh, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Norman W.",
"surname": "Paton",
"fullName": "Norman W. Paton",
"affiliation": "Information Management Group, School of Computer Science, University of Manchester, Manchester, United Kingdom",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2021-01-01 00:00:00",
"pubType": "trans",
"pages": "169-186",
"year": "2021",
"issn": "2332-7790",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdmw/2016/5910/0/07836686",
"title": "Using Machine Learning to Accelerate Data Wrangling",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2016/07836686/12OmNy3AgAL",
"parentPublication": {
"id": "proceedings/icdmw/2016/5910/0",
"title": "2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2012/1066/0/06227131",
"title": "Automating test automation",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2012/06227131/12OmNzcPAgI",
"parentPublication": {
"id": "proceedings/icse/2012/1066/0",
"title": "2012 34th International Conference on Software Engineering (ICSE 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08258015",
"title": "Data context informed data wrangling",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08258015/17D45WGGoLr",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2021/3902/0/09671956",
"title": "A Machine Learning Approach to Detection of Critical Alerts from Imbalanced Multi-Appliance Threat Alert Logs",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2021/09671956/1A8joT4VDu8",
"parentPublication": {
"id": "proceedings/big-data/2021/3902/0",
"title": "2021 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2021/0337/0/033700a304",
"title": "Subtle Bugs Everywhere: Generating Documentation for Data Wrangling Code",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2021/033700a304/1AjThH8TZEQ",
"parentPublication": {
"id": "proceedings/ase/2021/0337/0",
"title": "2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904459",
"title": "Revealing the Semantics of Data Wrangling Scripts With Comantics",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904459/1H1gq4Y9HZm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09953543",
"title": "AI Assistants: A Framework for Semi-Automated Data Wrangling",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09953543/1IlJyZsPxwQ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/06/08843909",
"title": "Capturing and Visualizing Provenance From Data Wrangling",
"doi": null,
"abstractUrl": "/magazine/cg/2019/06/08843909/1dqsvldDQuQ",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__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": "trans/tg/2021/02/09229515",
"title": "Table Scraps: An Actionable Framework for Multi-Table Data Wrangling From An Artifact Study of Computational Journalism",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09229515/1o3nxS8lm7u",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08676337",
"articleId": "18Nk6pc8fAI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08701483",
"articleId": "1rDQFnWBi7K",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"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": "1As79CUmeZO",
"doi": "10.1109/TVCG.2022.3144975",
"abstract": "Data workers use various scripting languages for data transformation, such as SAS, R, and Python. However, understanding intricate code pieces requires advanced programming skills, which hinders data workers from grasping the idea of data transformation at ease. Program visualization is beneficial for debugging and education and has the potential to illustrate transformations intuitively and interactively. In this article, we explore visualization design for demonstrating the semantics of code pieces in the context of data transformation. First, to depict individual data transformations, we structure a design space by two primary dimensions, i.e., key parameters to encode and possible visual channels to be mapped. Then, we derive a collection of 23 glyphs that visualize the semantics of transformations. Next, we design a pipeline, named <sc>Somnus</sc>, that provides an overview of the creation and evolution of data tables using a provenance graph. At the same time, it allows detailed investigation of individual transformations. User feedback on <sc>Somnus</sc> is positive. Our study participants achieved better accuracy with less time using <sc>Somnus</sc>, and preferred it over carefully-crafted textual description. Further, we provide two example applications to demonstrate the utility and versatility of <sc>Somnus</sc>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data workers use various scripting languages for data transformation, such as SAS, R, and Python. However, understanding intricate code pieces requires advanced programming skills, which hinders data workers from grasping the idea of data transformation at ease. Program visualization is beneficial for debugging and education and has the potential to illustrate transformations intuitively and interactively. In this article, we explore visualization design for demonstrating the semantics of code pieces in the context of data transformation. First, to depict individual data transformations, we structure a design space by two primary dimensions, i.e., key parameters to encode and possible visual channels to be mapped. Then, we derive a collection of 23 glyphs that visualize the semantics of transformations. Next, we design a pipeline, named <sc>Somnus</sc>, that provides an overview of the creation and evolution of data tables using a provenance graph. At the same time, it allows detailed investigation of individual transformations. User feedback on <sc>Somnus</sc> is positive. Our study participants achieved better accuracy with less time using <sc>Somnus</sc>, and preferred it over carefully-crafted textual description. Further, we provide two example applications to demonstrate the utility and versatility of <sc>Somnus</sc>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data workers use various scripting languages for data transformation, such as SAS, R, and Python. However, understanding intricate code pieces requires advanced programming skills, which hinders data workers from grasping the idea of data transformation at ease. Program visualization is beneficial for debugging and education and has the potential to illustrate transformations intuitively and interactively. In this article, we explore visualization design for demonstrating the semantics of code pieces in the context of data transformation. First, to depict individual data transformations, we structure a design space by two primary dimensions, i.e., key parameters to encode and possible visual channels to be mapped. Then, we derive a collection of 23 glyphs that visualize the semantics of transformations. Next, we design a pipeline, named Somnus, that provides an overview of the creation and evolution of data tables using a provenance graph. At the same time, it allows detailed investigation of individual transformations. User feedback on Somnus is positive. Our study participants achieved better accuracy with less time using Somnus, and preferred it over carefully-crafted textual description. Further, we provide two example applications to demonstrate the utility and versatility of Somnus.",
"title": "Visualizing the Scripts of Data Wrangling With <sc>Somnus</sc>",
"normalizedTitle": "Visualizing the Scripts of Data Wrangling With Somnus",
"fno": "09693232",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Codes",
"Semantics",
"Visualization",
"Debugging",
"Python",
"Task Analysis",
"Program Understanding",
"Data Transformation",
"Visualization Design"
],
"authors": [
{
"givenName": "Kai",
"surname": "Xiong",
"fullName": "Kai Xiong",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Siwei",
"surname": "Fu",
"fullName": "Siwei Fu",
"affiliation": "Zhejiang Lab, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guoming",
"surname": "Ding",
"fullName": "Guoming Ding",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhongsu",
"surname": "Luo",
"fullName": "Zhongsu Luo",
"affiliation": "Zhejiang University of Technology, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rong",
"surname": "Yu",
"fullName": "Rong Yu",
"affiliation": "Zhejiang Lab, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Chen",
"fullName": "Wei Chen",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hujun",
"surname": "Bao",
"fullName": "Hujun Bao",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, 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": "06",
"pubDate": "2023-06-01 00:00:00",
"pubType": "trans",
"pages": "2950-2964",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2023/01/09904459",
"title": "Revealing the Semantics of Data Wrangling Scripts With Comantics",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904459/1H1gq4Y9HZm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2023/04/09913705",
"title": "<sc>SynShine</sc>: Improved Fixing of Syntax Errors",
"doi": null,
"abstractUrl": "/journal/ts/2023/04/09913705/1HmgnvqCmCA",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2023/04/09978686",
"title": "<sc>InterEvo-TR</sc>: Interactive Evolutionary Test Generation With Readability Assessment",
"doi": null,
"abstractUrl": "/journal/ts/2023/04/09978686/1IXUvsgjhxm",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/5555/01/09983476",
"title": "<sc>iQuery</sc>: A Trustworthy and Scalable Blockchain Analytics Platform",
"doi": null,
"abstractUrl": "/journal/tq/5555/01/09983476/1J4y5uvz66s",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vds/2022/5721/0/572100a037",
"title": "Interactive Visualization for Data Science Scripts",
"doi": null,
"abstractUrl": "/proceedings-article/vds/2022/572100a037/1JezKXQ9OQ8",
"parentPublication": {
"id": "proceedings/vds/2022/5721/0",
"title": "2022 IEEE Visualization in Data Science (VDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2021/11/08880510",
"title": "<sc>CrySL</sc>: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs",
"doi": null,
"abstractUrl": "/journal/ts/2021/11/08880510/1emyjandtgA",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2022/01/08979384",
"title": "<sc>Conan</sc>: A Practical Real-Time APT Detection System With High Accuracy and Efficiency",
"doi": null,
"abstractUrl": "/journal/tq/2022/01/08979384/1h7zseYtWHm",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/02/09050839",
"title": "<sc>Obscure</sc>: Information-Theoretically Secure, Oblivious, and Verifiable Aggregation Queries on Secret-Shared Outsourced Data",
"doi": null,
"abstractUrl": "/journal/tk/2022/02/09050839/1iCrMXPV3mo",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__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/tq/2023/01/09609695",
"title": "<sc>VerSA</sc>: Verifiable Secure Aggregation for Cross-Device Federated Learning",
"doi": null,
"abstractUrl": "/journal/tq/2023/01/09609695/1yoxLPfEwsE",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09689957",
"articleId": "1AlCfIlPhfy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09693178",
"articleId": "1As7aEVtgNW",
"__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": "1IlJyZsPxwQ",
"doi": "10.1109/TKDE.2022.3222538",
"abstract": "Data wrangling tasks such as obtaining and linking data from various sources, transforming data formats, and correcting erroneous records, can constitute up to 80% of typical data engineering work. Despite the rise of machine learning and artificial intelligence, data wrangling remains a tedious and manual task. We introduce <italic>AI assistants</italic>, a class of semi-automatic interactive tools to streamline data wrangling. An AI assistant guides the analyst through a specific data wrangling task by recommending a suitable data transformation that respects the constraints obtained through interaction with the analyst.       We formally define the structure of AI assistants and describe how existing tools that treat data cleaning as an optimization problem fit the definition. We implement AI assistants for four common data wrangling tasks and make AI assistants easily accessible to data analysts in an open-source notebook environment for data science, by leveraging the common structure they follow. We evaluate our AI assistants both quantitatively and qualitatively through three example scenarios. We show that the unified and interactive design makes it easy to perform tasks that would be difficult to do manually or with a fully automatic tool.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data wrangling tasks such as obtaining and linking data from various sources, transforming data formats, and correcting erroneous records, can constitute up to 80% of typical data engineering work. Despite the rise of machine learning and artificial intelligence, data wrangling remains a tedious and manual task. We introduce <italic>AI assistants</italic>, a class of semi-automatic interactive tools to streamline data wrangling. An AI assistant guides the analyst through a specific data wrangling task by recommending a suitable data transformation that respects the constraints obtained through interaction with the analyst.       We formally define the structure of AI assistants and describe how existing tools that treat data cleaning as an optimization problem fit the definition. We implement AI assistants for four common data wrangling tasks and make AI assistants easily accessible to data analysts in an open-source notebook environment for data science, by leveraging the common structure they follow. We evaluate our AI assistants both quantitatively and qualitatively through three example scenarios. We show that the unified and interactive design makes it easy to perform tasks that would be difficult to do manually or with a fully automatic tool.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data wrangling tasks such as obtaining and linking data from various sources, transforming data formats, and correcting erroneous records, can constitute up to 80% of typical data engineering work. Despite the rise of machine learning and artificial intelligence, data wrangling remains a tedious and manual task. We introduce AI assistants, a class of semi-automatic interactive tools to streamline data wrangling. An AI assistant guides the analyst through a specific data wrangling task by recommending a suitable data transformation that respects the constraints obtained through interaction with the analyst. We formally define the structure of AI assistants and describe how existing tools that treat data cleaning as an optimization problem fit the definition. We implement AI assistants for four common data wrangling tasks and make AI assistants easily accessible to data analysts in an open-source notebook environment for data science, by leveraging the common structure they follow. We evaluate our AI assistants both quantitatively and qualitatively through three example scenarios. We show that the unified and interactive design makes it easy to perform tasks that would be difficult to do manually or with a fully automatic tool.",
"title": "AI Assistants: A Framework for Semi-Automated Data Wrangling",
"normalizedTitle": "AI Assistants: A Framework for Semi-Automated Data Wrangling",
"fno": "09953543",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Artificial Intelligence",
"Task Analysis",
"Merging",
"Machine Learning",
"Cleaning",
"Data Science",
"Iterative Methods",
"Data Wrangling",
"Data Cleaning",
"Human In The Loop"
],
"authors": [
{
"givenName": "Tomas",
"surname": "Petricek",
"fullName": "Tomas Petricek",
"affiliation": "Charles University, Prague, Czechia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gerrit J.J.",
"surname": "van den Burg",
"fullName": "Gerrit J.J. van den Burg",
"affiliation": "Amazon, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alfredo",
"surname": "Nazábal",
"fullName": "Alfredo Nazábal",
"affiliation": "AmazonThe Alan Turing Institute",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Taha",
"surname": "Ceritli",
"fullName": "Taha Ceritli",
"affiliation": "University of Oxford, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ernesto",
"surname": "Jiménez-Ruiz",
"fullName": "Ernesto Jiménez-Ruiz",
"affiliation": "City, University of London, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christopher K. I.",
"surname": "Williams",
"fullName": "Christopher K. I. Williams",
"affiliation": "The Alan Turing Institute",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-11-01 00:00:00",
"pubType": "trans",
"pages": "1-12",
"year": "5555",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "mags/ex/2006/03/x3076",
"title": "AI and Science's Lost Realm",
"doi": null,
"abstractUrl": "/magazine/ex/2006/03/x3076/13rRUwhpBUn",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2021/01/08691825",
"title": "Incorporating Data Context to Cost-Effectively Automate End-to-End Data Wrangling",
"doi": null,
"abstractUrl": "/journal/bd/2021/01/08691825/19fxlYsck0g",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2021/0337/0/033700a304",
"title": "Subtle Bugs Everywhere: Generating Documentation for Data Wrangling Code",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2021/033700a304/1AjThH8TZEQ",
"parentPublication": {
"id": "proceedings/ase/2021/0337/0",
"title": "2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cogmi/2021/1621/0/162100a242",
"title": "AI-Powered IoT System at the Edge",
"doi": null,
"abstractUrl": "/proceedings-article/cogmi/2021/162100a242/1CxzV5mF9ja",
"parentPublication": {
"id": "proceedings/cogmi/2021/1621/0",
"title": "2021 IEEE Third International Conference on Cognitive Machine Intelligence (CogMI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse-euc/2019/1664/0/166400a154",
"title": "Participatory AI: Reducing AI Bias and Developing Socially Responsible AI in Smart Cities",
"doi": null,
"abstractUrl": "/proceedings-article/cse-euc/2019/166400a154/1fHkyFQgVsQ",
"parentPublication": {
"id": "proceedings/cse-euc/2019/1664/0",
"title": "2019 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iri/2020/1054/0/09191630",
"title": "Fairness in Data Wrangling",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2020/09191630/1n0Iv5fBnjy",
"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/tg/2021/02/09229515",
"title": "Table Scraps: An Actionable Framework for Multi-Table Data Wrangling From An Artifact Study of Computational Journalism",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09229515/1o3nxS8lm7u",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/it/2021/03/09464111",
"title": "The Duality of Data and Knowledge Across the Three Waves of AI",
"doi": null,
"abstractUrl": "/magazine/it/2021/03/09464111/1uHclwinxQY",
"parentPublication": {
"id": "mags/it",
"title": "IT Professional",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2021/4106/0/410600a238",
"title": "AI Writers in Language Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2021/410600a238/1vK05ISsgDe",
"parentPublication": {
"id": "proceedings/icalt/2021/4106/0",
"title": "2021 International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl-hcc/2021/4592/0/09576290",
"title": "Teaching Students About Conversational AI Using Convo, a Conversational Programming Agent",
"doi": null,
"abstractUrl": "/proceedings-article/vl-hcc/2021/09576290/1y63rQyWeIg",
"parentPublication": {
"id": "proceedings/vl-hcc/2021/4592/0",
"title": "2021 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09950609",
"articleId": "1Ik4HsmA7mg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09953314",
"articleId": "1IlJzD8YXS0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1InoqxlCmWs",
"name": "ttk555501-09953543s1-supp1-3222538.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk555501-09953543s1-supp1-3222538.pdf",
"extension": "pdf",
"size": "398 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": "1o3nxS8lm7u",
"doi": "10.1109/TVCG.2020.3030462",
"abstract": "For the many journalists who use data and computation to report the news, data wrangling is an integral part of their work. Despite an abundance of literature on data wrangling in the context of enterprise data analysis, little is known about the specific operations, processes, and pain points journalists encounter while performing this tedious, time-consuming task. To better understand the needs of this user group, we conduct a technical observation study of 50 public repositories of data and analysis code authored by 33 professional journalists at 26 news organizations. We develop two detailed and cross-cutting taxonomies of data wrangling in computational journalism, for actions and for processes. We observe the extensive use of multiple tables, a notable gap in previous wrangling analyses. We develop a concise, actionable framework for general multi-table data wrangling that includes wrangling operations documented in our taxonomy that are without clear parallels in other work. This framework, the first to incorporate tables as first-class objects, will support future interactive wrangling tools for both computational journalism and general-purpose use. We assess the generative and descriptive power of our framework through discussion of its relationship to our set of taxonomies.",
"abstracts": [
{
"abstractType": "Regular",
"content": "For the many journalists who use data and computation to report the news, data wrangling is an integral part of their work. Despite an abundance of literature on data wrangling in the context of enterprise data analysis, little is known about the specific operations, processes, and pain points journalists encounter while performing this tedious, time-consuming task. To better understand the needs of this user group, we conduct a technical observation study of 50 public repositories of data and analysis code authored by 33 professional journalists at 26 news organizations. We develop two detailed and cross-cutting taxonomies of data wrangling in computational journalism, for actions and for processes. We observe the extensive use of multiple tables, a notable gap in previous wrangling analyses. We develop a concise, actionable framework for general multi-table data wrangling that includes wrangling operations documented in our taxonomy that are without clear parallels in other work. This framework, the first to incorporate tables as first-class objects, will support future interactive wrangling tools for both computational journalism and general-purpose use. We assess the generative and descriptive power of our framework through discussion of its relationship to our set of taxonomies.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "For the many journalists who use data and computation to report the news, data wrangling is an integral part of their work. Despite an abundance of literature on data wrangling in the context of enterprise data analysis, little is known about the specific operations, processes, and pain points journalists encounter while performing this tedious, time-consuming task. To better understand the needs of this user group, we conduct a technical observation study of 50 public repositories of data and analysis code authored by 33 professional journalists at 26 news organizations. We develop two detailed and cross-cutting taxonomies of data wrangling in computational journalism, for actions and for processes. We observe the extensive use of multiple tables, a notable gap in previous wrangling analyses. We develop a concise, actionable framework for general multi-table data wrangling that includes wrangling operations documented in our taxonomy that are without clear parallels in other work. This framework, the first to incorporate tables as first-class objects, will support future interactive wrangling tools for both computational journalism and general-purpose use. We assess the generative and descriptive power of our framework through discussion of its relationship to our set of taxonomies.",
"title": "Table Scraps: An Actionable Framework for Multi-Table Data Wrangling From An Artifact Study of Computational Journalism",
"normalizedTitle": "Table Scraps: An Actionable Framework for Multi-Table Data Wrangling From An Artifact Study of Computational Journalism",
"fno": "09229515",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Internet",
"Interactive Wrangling Tools",
"General Multitable Data",
"Multiple Tables",
"News Organizations",
"Professional Journalists",
"Technical Observation Study",
"Pain Points Journalists",
"Enterprise Data Analysis",
"Computational Journalism",
"Artifact Study",
"Multitable Data Wrangling",
"Actionable Framework",
"Table Scraps",
"Journalism",
"Taxonomy",
"Tools",
"Data Analysis",
"Encoding",
"Task Analysis",
"Cleaning",
"Computational Journalism",
"Data Journalism",
"Data Wrangling"
],
"authors": [
{
"givenName": "Stephen",
"surname": "Kasica",
"fullName": "Stephen Kasica",
"affiliation": "Department of Computer ScienceUniversity of British Columbia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Charles",
"surname": "Berret",
"fullName": "Charles Berret",
"affiliation": "University of British Columbia, School of Journalism, Writing, and Media",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tamara",
"surname": "Munzner",
"fullName": "Tamara Munzner",
"affiliation": "Department of Computer ScienceUniversity of British Columbia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "957-966",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2012/4771/0/4771a349",
"title": "Data Visualization in Online Journalism and Its Implications for the Production Process",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2012/4771a349/12OmNvSKO2M",
"parentPublication": {
"id": "proceedings/iv/2012/4771/0",
"title": "2012 16th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iisa/2018/8161/0/08633593",
"title": "Creative Information Exploration in Journalism",
"doi": null,
"abstractUrl": "/proceedings-article/iisa/2018/08633593/17D45WaTkk3",
"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/bd/2021/01/08691825",
"title": "Incorporating Data Context to Cost-Effectively Automate End-to-End Data Wrangling",
"doi": null,
"abstractUrl": "/journal/bd/2021/01/08691825/19fxlYsck0g",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2021/0337/0/033700a304",
"title": "Subtle Bugs Everywhere: Generating Documentation for Data Wrangling Code",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2021/033700a304/1AjThH8TZEQ",
"parentPublication": {
"id": "proceedings/ase/2021/0337/0",
"title": "2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904459",
"title": "Revealing the Semantics of Data Wrangling Scripts With Comantics",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904459/1H1gq4Y9HZm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cost/2022/6248/0/624800a303",
"title": "Feature Extraction of the Information Clues in the Data Journalism",
"doi": null,
"abstractUrl": "/proceedings-article/cost/2022/624800a303/1H2pqD3KR9u",
"parentPublication": {
"id": "proceedings/cost/2022/6248/0",
"title": "2022 International Conference on Culture-Oriented Science and Technology (CoST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09953543",
"title": "AI Assistants: A Framework for Semi-Automated Data Wrangling",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09953543/1IlJyZsPxwQ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2022/5661/0/10068697",
"title": "MOGPlay: A Decentralized Crowd Journalism Application for Democratic News Production",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2022/10068697/1LKwZWJt1NS",
"parentPublication": {
"id": "proceedings/asonam/2022/5661/0",
"title": "2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933773",
"title": "Thumbnails for Data Stories: A Survey of Current Practices",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933773/1fTgFlSnH8s",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2019/0801/0/08940357",
"title": "Research on Interactive Journalism in the Background of Big Data, Virtual Reality Technology and Media Convergence",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2019/08940357/1gjRQ76uXNC",
"parentPublication": {
"id": "proceedings/icis/2019/0801/0",
"title": "2019 IEEE/ACIS 18th International Conference on Computer and Information Science (ICIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222102",
"articleId": "1nTr1JohElO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09222287",
"articleId": "1nTq4rvK0g0",
"__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": "1GZolJg0E7e",
"doi": "10.1109/TVCG.2022.3209382",
"abstract": "Embedding is a common technique for analyzing multi-dimensional data. However, the embedding projection cannot always form significant and interpretable visual structures that foreshadow underlying data patterns. We propose an approach that incorporates human knowledge into data embeddings to improve pattern significance and interpretability. The core idea is (1) externalizing tacit human knowledge as explicit sample labels and (2) adding a classification loss in the embedding network to encode samples' classes. The approach pulls samples of the same class with similar data features closer in the projection, leading to more compact (significant) and class-consistent (interpretable) visual structures. We give an embedding network with a customized classification loss to implement the idea and integrate the network into a visualization system to form a workflow that supports flexible class creation and pattern exploration. Patterns found on open datasets in case studies, subjects' performance in a user study, and quantitative experiment results illustrate the general usability and effectiveness of the approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Embedding is a common technique for analyzing multi-dimensional data. However, the embedding projection cannot always form significant and interpretable visual structures that foreshadow underlying data patterns. We propose an approach that incorporates human knowledge into data embeddings to improve pattern significance and interpretability. The core idea is (1) externalizing tacit human knowledge as explicit sample labels and (2) adding a classification loss in the embedding network to encode samples' classes. The approach pulls samples of the same class with similar data features closer in the projection, leading to more compact (significant) and class-consistent (interpretable) visual structures. We give an embedding network with a customized classification loss to implement the idea and integrate the network into a visualization system to form a workflow that supports flexible class creation and pattern exploration. Patterns found on open datasets in case studies, subjects' performance in a user study, and quantitative experiment results illustrate the general usability and effectiveness of the approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Embedding is a common technique for analyzing multi-dimensional data. However, the embedding projection cannot always form significant and interpretable visual structures that foreshadow underlying data patterns. We propose an approach that incorporates human knowledge into data embeddings to improve pattern significance and interpretability. The core idea is (1) externalizing tacit human knowledge as explicit sample labels and (2) adding a classification loss in the embedding network to encode samples' classes. The approach pulls samples of the same class with similar data features closer in the projection, leading to more compact (significant) and class-consistent (interpretable) visual structures. We give an embedding network with a customized classification loss to implement the idea and integrate the network into a visualization system to form a workflow that supports flexible class creation and pattern exploration. Patterns found on open datasets in case studies, subjects' performance in a user study, and quantitative experiment results illustrate the general usability and effectiveness of the approach.",
"title": "Incorporation of Human Knowledge into Data Embeddings to Improve Pattern Significance and Interpretability",
"normalizedTitle": "Incorporation of Human Knowledge into Data Embeddings to Improve Pattern Significance and Interpretability",
"fno": "09903342",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Mining",
"Data Visualisation",
"Learning Artificial Intelligence",
"Pattern Classification",
"Pattern Clustering",
"Compact",
"Customized Classification Loss",
"Data Embeddings",
"Embedding Network",
"Embedding Projection",
"Explicit Sample Labels",
"Flexible Class Creation",
"Interpretable Visual Structures",
"Multidimensional Data",
"Pattern Exploration",
"Pattern Significance",
"Samples",
"Significant Structures",
"Similar Data Features",
"Tacit Human Knowledge",
"Underlying Data Patterns",
"Visualization System",
"Continents",
"Economic Indicators",
"Data Visualization",
"Knowledge Engineering",
"Visual Analytics",
"Mathematical Models",
"Usability",
"Tabular Data",
"Multi Dimensional Exploration",
"Embedding Projection",
"Explicit Knowledge Generation",
"Visual Analytics"
],
"authors": [
{
"givenName": "Jie",
"surname": "Li",
"fullName": "Jie Li",
"affiliation": "College of Intelligence and Computing, Tianjin University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chun-qi",
"surname": "Zhou",
"fullName": "Chun-qi Zhou",
"affiliation": "College of Intelligence and Computing, Tianjin University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "723-733",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2016/8851/0/8851a069",
"title": "Latent Embeddings for Zero-Shot Classification",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851a069/12OmNyQYtqF",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09729550",
"title": "Visual Exploration of Relationships and Structure in Low-Dimensional Embeddings",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09729550/1Bya8LDahDa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/05/09128033",
"title": "Interpretation of Structural Preservation in Low-Dimensional Embeddings",
"doi": null,
"abstractUrl": "/journal/tk/2022/05/09128033/1l3u8JV5SP6",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09904437",
"articleId": "1H1gnemxdqE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09904480",
"articleId": "1H0GkV5P1qo",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1J9yNuubD5C",
"name": "ttg202301-09903342s1-tvcg-3209382-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09903342s1-tvcg-3209382-mm.zip",
"extension": "zip",
"size": "66.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": "1HbasXGQDEk",
"doi": "10.1109/TVCG.2022.3209385",
"abstract": "We present Rigel, an interactive system for rapid transformation of tabular data. Rigel implements a new declarative mapping approach that formulates the data transformation procedure as direct mappings from data to the row, column, and cell channels of the target table. To construct such mappings, Rigel allows users to directly drag data attributes from input data to these three channels and indirectly drag or type data values in a spreadsheet, and possible mappings that do not contradict these interactions are recommended to achieve efficient and straightforward data transformation. The recommended mappings are generated by enumerating and composing data variables based on the row, column, and cell channels, thereby revealing the possibility of alternative tabular forms and facilitating open-ended exploration in many data transformation scenarios, such as designing tables for presentation. In contrast to existing systems that transform data by composing operations (like transposing and pivoting), Rigel requires less prior knowledge on these operations, and constructing tables from the channels is more efficient and results in less ambiguity than generating operation sequences as done by the traditional by-example approaches. User study results demonstrated that Rigel is significantly less demanding in terms of time and interactions and suits more scenarios compared to the state-of-the-art by-example approach. A gallery of diverse transformation cases is also presented to show the potential of Rigel's expressiveness.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present Rigel, an interactive system for rapid transformation of tabular data. Rigel implements a new declarative mapping approach that formulates the data transformation procedure as direct mappings from data to the row, column, and cell channels of the target table. To construct such mappings, Rigel allows users to directly drag data attributes from input data to these three channels and indirectly drag or type data values in a spreadsheet, and possible mappings that do not contradict these interactions are recommended to achieve efficient and straightforward data transformation. The recommended mappings are generated by enumerating and composing data variables based on the row, column, and cell channels, thereby revealing the possibility of alternative tabular forms and facilitating open-ended exploration in many data transformation scenarios, such as designing tables for presentation. In contrast to existing systems that transform data by composing operations (like transposing and pivoting), Rigel requires less prior knowledge on these operations, and constructing tables from the channels is more efficient and results in less ambiguity than generating operation sequences as done by the traditional by-example approaches. User study results demonstrated that Rigel is significantly less demanding in terms of time and interactions and suits more scenarios compared to the state-of-the-art by-example approach. A gallery of diverse transformation cases is also presented to show the potential of Rigel's expressiveness.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present Rigel, an interactive system for rapid transformation of tabular data. Rigel implements a new declarative mapping approach that formulates the data transformation procedure as direct mappings from data to the row, column, and cell channels of the target table. To construct such mappings, Rigel allows users to directly drag data attributes from input data to these three channels and indirectly drag or type data values in a spreadsheet, and possible mappings that do not contradict these interactions are recommended to achieve efficient and straightforward data transformation. The recommended mappings are generated by enumerating and composing data variables based on the row, column, and cell channels, thereby revealing the possibility of alternative tabular forms and facilitating open-ended exploration in many data transformation scenarios, such as designing tables for presentation. In contrast to existing systems that transform data by composing operations (like transposing and pivoting), Rigel requires less prior knowledge on these operations, and constructing tables from the channels is more efficient and results in less ambiguity than generating operation sequences as done by the traditional by-example approaches. User study results demonstrated that Rigel is significantly less demanding in terms of time and interactions and suits more scenarios compared to the state-of-the-art by-example approach. A gallery of diverse transformation cases is also presented to show the potential of Rigel's expressiveness.",
"title": "Rigel: Transforming Tabular Data by Declarative Mapping",
"normalizedTitle": "Rigel: Transforming Tabular Data by Declarative Mapping",
"fno": "09908529",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Astronomy Computing",
"Data Analysis",
"Data Mining",
"Data Visualisation",
"Spreadsheet Programs",
"XML",
"Alternative Tabular Forms",
"Cell Channels",
"Data Attributes",
"Data Transformation Procedure",
"Data Transformation Scenarios",
"Data Values",
"Declarative Mapping Approach",
"Direct Mappings",
"Diverse Transformation Cases",
"Efficient Data Transformation",
"Enumerating Composing Data Variables",
"Interactive System",
"Possible Mappings",
"Rapid Transformation",
"Recommended Mappings",
"Rigels Expressiveness",
"Straightforward Data Transformation",
"Transforming Tabular Data",
"Transforms",
"Task Analysis",
"Data Models",
"Usability",
"Economic Indicators",
"Data Visualization",
"Writing",
"Data Transformation",
"Self Service Data Transformation",
"Programming By Example",
"Declarative Specification"
],
"authors": [
{
"givenName": "Ran",
"surname": "Chen",
"fullName": "Ran Chen",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Di",
"surname": "Weng",
"fullName": "Di Weng",
"affiliation": "Microsoft Research Asia, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yanwei",
"surname": "Huang",
"fullName": "Yanwei Huang",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xinhuan",
"surname": "Shu",
"fullName": "Xinhuan Shu",
"affiliation": "Hong Kong University of Science and Technology, Hong Kong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiayi",
"surname": "Zhou",
"fullName": "Jiayi Zhou",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guodao",
"surname": "Sun",
"fullName": "Guodao Sun",
"affiliation": "Zhejiang University of Technology, Hangzhou, 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": "128-138",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2008/1836/0/04497409",
"title": "Muse: Mapping Understanding and deSign by Example",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2008/04497409/12OmNAkWvfi",
"parentPublication": {
"id": "proceedings/icde/2008/1836/0",
"title": "2008 IEEE 24th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wiri/2005/2414/0/24140173",
"title": "Mapping Between Data Sources on the Web",
"doi": null,
"abstractUrl": "/proceedings-article/wiri/2005/24140173/12OmNApcuE1",
"parentPublication": {
"id": "proceedings/wiri/2005/2414/0",
"title": "Proceedings. International Workshop on Challenges in Web Information Retrieval and Integration",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisis/2009/3575/0/3575a688",
"title": "Creating Visualizations through Ontology Mapping",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2009/3575a688/12OmNC1Y5iR",
"parentPublication": {
"id": "proceedings/cisis/2009/3575/0",
"title": "2009 International Conference on Complex, Intelligent and Software Intensive Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2018/1424/0/142401a116",
"title": "Composite Visual Mapping for Time Series Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2018/142401a116/12OmNCmpcJW",
"parentPublication": {
"id": "proceedings/pacificvis/2018/1424/0",
"title": "2018 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aswec/2009/3599/0/3599a111",
"title": "Integrated Data Mapping for a Software Meta-tool",
"doi": null,
"abstractUrl": "/proceedings-article/aswec/2009/3599a111/12OmNqzcvMk",
"parentPublication": {
"id": "proceedings/aswec/2009/3599/0",
"title": "2009 Australian Software Engineering Conference (ASWEC 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2010/8306/0/05706607",
"title": "Improving robustness of gene ranking by resampling and permutation based score correction and normalization",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2010/05706607/12OmNzVoBsa",
"parentPublication": {
"id": "proceedings/bibm/2010/8306/0",
"title": "2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2007/2755/0/04076959",
"title": "Towards Model Transformation Generation By-Example",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2007/04076959/17D45WnnFUF",
"parentPublication": {
"id": "proceedings/hicss/2007/2755/0",
"title": "2007 40th Annual Hawaii International Conference on System Sciences (HICSS'07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2022/0915/0/091500b332",
"title": "Robustly Recognizing Irregular Scene Text by Rectifying Principle Irregularities",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2022/091500b332/1B13zUSoago",
"parentPublication": {
"id": "proceedings/wacv/2022/0915/0",
"title": "2022 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903342",
"title": "Incorporation of Human Knowledge into Data Embeddings to Improve Pattern Significance and Interpretability",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903342/1GZolJg0E7e",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2020/4380/0/438000b297",
"title": "BML: A Data Mapping Language for Blockchain Platforms",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2020/438000b297/1r547ZCTKz6",
"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"
}
],
"adjacentArticles": {
"previous": {
"fno": "09904459",
"articleId": "1H1gq4Y9HZm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09903293",
"articleId": "1GZon61xLpK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1J9yOIkcWKk",
"name": "ttg202301-09908529s1-supp1-3209385.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09908529s1-supp1-3209385.pdf",
"extension": "pdf",
"size": "996 kB",
"__typename": "WebExtraType"
},
{
"id": "1J9yOxJ5yCY",
"name": "ttg202301-09908529s1-supp2-3209385.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09908529s1-supp2-3209385.mp4",
"extension": "mp4",
"size": "42.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxwENDN",
"title": "May/June",
"year": "2007",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvya9g",
"doi": "10.1109/TVCG.2007.1005",
"abstract": "Abstract—Current techniques for generating animated scenes involve either videos (whose resolution is limited) or a single image (which requires a significant amount of user interaction). In this paper, we describe a system that allows the user to quickly and easily produce a compelling-looking animation from a small collection of high resolution stills. Our system has two unique features. First, it applies an automatic partial temporal order recovery algorithm to the stills in order to approximate the original scene dynamics. The output sequence is subsequently extracted using a second-order Markov Chain model. Second, a region with large motion variation can be automatically decomposed into semiautonomous regions such that their temporal orderings are softly constrained. This is to ensure motion smoothness throughout the original region. The final animation is obtained by frame interpolation and feathering. Our system also provides a simple-to-use interface to help the user to fine-tune the motion of the animated scene. Using our system, an animated scene can be generated in minutes. We show results for a variety of scenes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Current techniques for generating animated scenes involve either videos (whose resolution is limited) or a single image (which requires a significant amount of user interaction). In this paper, we describe a system that allows the user to quickly and easily produce a compelling-looking animation from a small collection of high resolution stills. Our system has two unique features. First, it applies an automatic partial temporal order recovery algorithm to the stills in order to approximate the original scene dynamics. The output sequence is subsequently extracted using a second-order Markov Chain model. Second, a region with large motion variation can be automatically decomposed into semiautonomous regions such that their temporal orderings are softly constrained. This is to ensure motion smoothness throughout the original region. The final animation is obtained by frame interpolation and feathering. Our system also provides a simple-to-use interface to help the user to fine-tune the motion of the animated scene. Using our system, an animated scene can be generated in minutes. We show results for a variety of scenes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Current techniques for generating animated scenes involve either videos (whose resolution is limited) or a single image (which requires a significant amount of user interaction). In this paper, we describe a system that allows the user to quickly and easily produce a compelling-looking animation from a small collection of high resolution stills. Our system has two unique features. First, it applies an automatic partial temporal order recovery algorithm to the stills in order to approximate the original scene dynamics. The output sequence is subsequently extracted using a second-order Markov Chain model. Second, a region with large motion variation can be automatically decomposed into semiautonomous regions such that their temporal orderings are softly constrained. This is to ensure motion smoothness throughout the original region. The final animation is obtained by frame interpolation and feathering. Our system also provides a simple-to-use interface to help the user to fine-tune the motion of the animated scene. Using our system, an animated scene can be generated in minutes. We show results for a variety of scenes.",
"title": "High Resolution Animated Scenes from Stills",
"normalizedTitle": "High Resolution Animated Scenes from Stills",
"fno": "v0562",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Texture Synthesis",
"Animation"
],
"authors": [
{
"givenName": "Zhouchen",
"surname": "Lin",
"fullName": "Zhouchen Lin",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lifeng",
"surname": "Wang",
"fullName": "Lifeng Wang",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yunbo",
"surname": "Wang",
"fullName": "Yunbo Wang",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sing Bing",
"surname": "Kang",
"fullName": "Sing Bing Kang",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tian",
"surname": "Fang",
"fullName": "Tian Fang",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2007-05-01 00:00:00",
"pubType": "trans",
"pages": "562-568",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgi/2000/0643/0/06430029",
"title": "Hand Gesture Animation from Static Postures Using an Anatomy-Based Model",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2000/06430029/12OmNCxbXGs",
"parentPublication": {
"id": "proceedings/cgi/2000/0643/0",
"title": "Computer Graphics International Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mpeople/1999/0362/0/03620062",
"title": "Generating a Population of Animated faces from Pictures",
"doi": null,
"abstractUrl": "/proceedings-article/mpeople/1999/03620062/12OmNvzJFYt",
"parentPublication": {
"id": "proceedings/mpeople/1999/0362/0",
"title": "Modeling People, IEEE International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2001/1195/0/11950317",
"title": "Animated Illuminated Lines for Flow Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2001/11950317/12OmNwBT1mq",
"parentPublication": {
"id": "proceedings/iv/2001/1195/0",
"title": "Proceedings Fifth International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"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/cgiv/2012/4778/0/4778a037",
"title": "A Sketch-based Skeletal Figure Animation Tool for Novice Users",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2012/4778a037/12OmNz4SOso",
"parentPublication": {
"id": "proceedings/cgiv/2012/4778/0",
"title": "2012 Ninth International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssst/1992/2665/0/00712303",
"title": "Animated Simulation of Control Systems Personal Computers",
"doi": null,
"abstractUrl": "/proceedings-article/ssst/1992/00712303/12OmNzsJ7Fn",
"parentPublication": {
"id": "proceedings/ssst/1992/2665/0",
"title": "The 24th Southeastern Symposium on System Theory and The 3rd Annual Symposium on Communications, Signal Processing Expert Systems, and ASIC VLSI Design",
"__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/2018/09/08031015",
"title": "A Vector Field Design Approach to Animated Transitions",
"doi": null,
"abstractUrl": "/journal/tg/2018/09/08031015/13rRUB7a117",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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": "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": "v0549",
"articleId": "13rRUwkfAZc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0569",
"articleId": "13rRUwIF6dF",
"__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": "1nTqOo5NR3G",
"doi": "10.1109/TVCG.2020.3030378",
"abstract": "Natural language interfaces (NLls) have shown great promise for visual data analysis, allowing people to flexibly specify and interact with visualizations. However, developing visualization NLIs remains a challenging task, requiring low-level implementation of natural language processing (NLP) techniques as well as knowledge of visual analytic tasks and visualization design. We present NL4DV, a toolkit for natural language-driven data visualization. NL4DV is a Python package that takes as input a tabular dataset and a natural language query about that dataset. In response, the toolkit returns an analytic specification modeled as a JSON object containing data attributes, analytic tasks, and a list of Vega-Lite specifications relevant to the input query. In doing so, NL4DV aids visualization developers who may not have a background in NLP, enabling them to create new visualization NLIs or incorporate natural language input within their existing systems. We demonstrate NL4DV's usage and capabilities through four examples: 1) rendering visualizations using natural language in a Jupyter notebook, 2) developing a NLI to specify and edit Vega-Lite charts, 3) recreating data ambiguity widgets from the DataTone system, and 4) incorporating speech input to create a multimodal visualization system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Natural language interfaces (NLls) have shown great promise for visual data analysis, allowing people to flexibly specify and interact with visualizations. However, developing visualization NLIs remains a challenging task, requiring low-level implementation of natural language processing (NLP) techniques as well as knowledge of visual analytic tasks and visualization design. We present NL4DV, a toolkit for natural language-driven data visualization. NL4DV is a Python package that takes as input a tabular dataset and a natural language query about that dataset. In response, the toolkit returns an analytic specification modeled as a JSON object containing data attributes, analytic tasks, and a list of Vega-Lite specifications relevant to the input query. In doing so, NL4DV aids visualization developers who may not have a background in NLP, enabling them to create new visualization NLIs or incorporate natural language input within their existing systems. We demonstrate NL4DV's usage and capabilities through four examples: 1) rendering visualizations using natural language in a Jupyter notebook, 2) developing a NLI to specify and edit Vega-Lite charts, 3) recreating data ambiguity widgets from the DataTone system, and 4) incorporating speech input to create a multimodal visualization system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Natural language interfaces (NLls) have shown great promise for visual data analysis, allowing people to flexibly specify and interact with visualizations. However, developing visualization NLIs remains a challenging task, requiring low-level implementation of natural language processing (NLP) techniques as well as knowledge of visual analytic tasks and visualization design. We present NL4DV, a toolkit for natural language-driven data visualization. NL4DV is a Python package that takes as input a tabular dataset and a natural language query about that dataset. In response, the toolkit returns an analytic specification modeled as a JSON object containing data attributes, analytic tasks, and a list of Vega-Lite specifications relevant to the input query. In doing so, NL4DV aids visualization developers who may not have a background in NLP, enabling them to create new visualization NLIs or incorporate natural language input within their existing systems. We demonstrate NL4DV's usage and capabilities through four examples: 1) rendering visualizations using natural language in a Jupyter notebook, 2) developing a NLI to specify and edit Vega-Lite charts, 3) recreating data ambiguity widgets from the DataTone system, and 4) incorporating speech input to create a multimodal visualization system.",
"title": "NL4DV: A Toolkit for Generating Analytic Specifications for Data Visualization from Natural Language Queries",
"normalizedTitle": "NL4DV: A Toolkit for Generating Analytic Specifications for Data Visualization from Natural Language Queries",
"fno": "09222342",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Interactive Systems",
"Natural Language Interfaces",
"Natural Language Processing",
"Query Processing",
"Rendering Computer Graphics",
"Analytic Specification",
"Natural Language Query",
"Natural Language Interfaces",
"Visual Data Analysis",
"Visualization NL Is",
"Visual Analytic Tasks",
"Natural Language Driven Data Visualization",
"Data Attributes",
"Vega Lite Specifications",
"NL 4 DV",
"Multimodal Visualization System",
"Analytic Specifications",
"JSON",
"Vega Lite Charts",
"Visualization Rendering",
"Data Visualization",
"Task Analysis",
"Natural Language Processing",
"Grammar",
"Motion Pictures",
"Natural Language Interfaces",
"Visualization Toolkits"
],
"authors": [
{
"givenName": "Arpit",
"surname": "Narechania",
"fullName": "Arpit Narechania",
"affiliation": "Georgia Institute of Technology, Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arjun",
"surname": "Srinivasan",
"fullName": "Arjun Srinivasan",
"affiliation": "Georgia Institute of Technology, Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Stasko",
"fullName": "John Stasko",
"affiliation": "Georgia Institute of Technology, Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "369-379",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ssiri/2009/3758/0/3758a348",
"title": "Generating Test Cases for Timed Systems from Controlled Natural Language Specifications",
"doi": null,
"abstractUrl": "/proceedings-article/ssiri/2009/3758a348/12OmNBtl1E6",
"parentPublication": {
"id": "proceedings/ssiri/2009/3758/0",
"title": "Secure System Integration and Reliability Improvement",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icst/2018/5012/0/501201a428",
"title": "Testing Natural Language Grammars",
"doi": null,
"abstractUrl": "/proceedings-article/icst/2018/501201a428/12OmNC8dgqe",
"parentPublication": {
"id": "proceedings/icst/2018/5012/0",
"title": "2018 IEEE 11th International Conference on Software Testing, Verification and Validation (ICST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2006/2687/0/26870199",
"title": "Improving the Quality of Natural Language Requirements Specifications through Natural Language Requirements Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2006/26870199/12OmNrFkeRf",
"parentPublication": {
"id": "proceedings/cit/2006/2687/0",
"title": "The Sixth IEEE International Conference on Computer and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsc/2019/6783/0/08665517",
"title": "Controlled Natural Language Framework for Generating Assertions from Hardware Specifications",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2019/08665517/18qcdZ7PxBe",
"parentPublication": {
"id": "proceedings/icsc/2019/6783/0",
"title": "2019 IEEE 13th International Conference on Semantic Computing (ICSC)",
"__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": "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/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": "trans/tg/5555/01/10026499",
"title": "XNLI: Explaining and Diagnosing NLI-based Visual Data Analysis",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10026499/1KkXscJg6vm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2019/0869/0/086900a188",
"title": "Automatically Generating Precise Oracles from Structured Natural Language Specifications",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2019/086900a188/1cMFuexw06Y",
"parentPublication": {
"id": "proceedings/icse/2019/0869/0",
"title": "2019 IEEE/ACM 41st 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"
}
],
"adjacentArticles": {
"previous": {
"fno": "09216572",
"articleId": "1nJsGl1c7GE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09246282",
"articleId": "1olDLxl43Qc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLerblduhy",
"name": "ttg202102-09222342s1-supp1-3030378.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222342s1-supp1-3030378.mp4",
"extension": "mp4",
"size": "80.3 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclnW",
"title": "Aug.",
"year": "2014",
"issueNum": "08",
"idPrefix": "tp",
"pubType": "journal",
"volume": "36",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwghdap",
"doi": "10.1109/TPAMI.2014.2300479",
"abstract": "Multi-resolution image features may be approximated via extrapolation from nearby scales, rather than being computed explicitly. This fundamental insight allows us to design object detection algorithms that are as accurate, and considerably faster, than the state-of-the-art. The computational bottleneck of many modern detectors is the computation of features at every scale of a finely-sampled image pyramid. Our key insight is that one may compute finely sampled feature pyramids at a fraction of the cost, without sacrificing performance: for a broad family of features we find that features computed at octave-spaced scale intervals are sufficient to approximate features on a finely-sampled pyramid. Extrapolation is inexpensive as compared to direct feature computation. As a result, our approximation yields considerable speedups with negligible loss in detection accuracy. We modify three diverse visual recognition systems to use fast feature pyramids and show results on both pedestrian detection (measured on the Caltech, INRIA, TUD-Brussels and ETH data sets) and general object detection (measured on the PASCAL VOC). The approach is general and is widely applicable to vision algorithms requiring fine-grained multi-scale analysis. Our approximation is valid for images with broad spectra (most natural images) and fails for images with narrow band-pass spectra (e.g., periodic textures).",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multi-resolution image features may be approximated via extrapolation from nearby scales, rather than being computed explicitly. This fundamental insight allows us to design object detection algorithms that are as accurate, and considerably faster, than the state-of-the-art. The computational bottleneck of many modern detectors is the computation of features at every scale of a finely-sampled image pyramid. Our key insight is that one may compute finely sampled feature pyramids at a fraction of the cost, without sacrificing performance: for a broad family of features we find that features computed at octave-spaced scale intervals are sufficient to approximate features on a finely-sampled pyramid. Extrapolation is inexpensive as compared to direct feature computation. As a result, our approximation yields considerable speedups with negligible loss in detection accuracy. We modify three diverse visual recognition systems to use fast feature pyramids and show results on both pedestrian detection (measured on the Caltech, INRIA, TUD-Brussels and ETH data sets) and general object detection (measured on the PASCAL VOC). The approach is general and is widely applicable to vision algorithms requiring fine-grained multi-scale analysis. Our approximation is valid for images with broad spectra (most natural images) and fails for images with narrow band-pass spectra (e.g., periodic textures).",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multi-resolution image features may be approximated via extrapolation from nearby scales, rather than being computed explicitly. This fundamental insight allows us to design object detection algorithms that are as accurate, and considerably faster, than the state-of-the-art. The computational bottleneck of many modern detectors is the computation of features at every scale of a finely-sampled image pyramid. Our key insight is that one may compute finely sampled feature pyramids at a fraction of the cost, without sacrificing performance: for a broad family of features we find that features computed at octave-spaced scale intervals are sufficient to approximate features on a finely-sampled pyramid. Extrapolation is inexpensive as compared to direct feature computation. As a result, our approximation yields considerable speedups with negligible loss in detection accuracy. We modify three diverse visual recognition systems to use fast feature pyramids and show results on both pedestrian detection (measured on the Caltech, INRIA, TUD-Brussels and ETH data sets) and general object detection (measured on the PASCAL VOC). The approach is general and is widely applicable to vision algorithms requiring fine-grained multi-scale analysis. Our approximation is valid for images with broad spectra (most natural images) and fails for images with narrow band-pass spectra (e.g., periodic textures).",
"title": "Fast Feature Pyramids for Object Detection",
"normalizedTitle": "Fast Feature Pyramids for Object Detection",
"fno": "06714453",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Histograms",
"Approximation Methods",
"Feature Extraction",
"Object Detection",
"Visualization",
"Detectors",
"Accuracy",
"Real Time Systems",
"Visual Features",
"Object Detection",
"Image Pyramids",
"Pedestrian Detection",
"Natural Image Statistics"
],
"authors": [
{
"givenName": "Piotr",
"surname": "Dollar",
"fullName": "Piotr Dollar",
"affiliation": "Interactive Visual Media Group at Microsoft Research, One Microsoft Way, Redmond,",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ron",
"surname": "Appel",
"fullName": "Ron Appel",
"affiliation": "Department of Electrical Engineering , California Institute of Technology, Pasadena,",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Serge",
"surname": "Belongie",
"fullName": "Serge Belongie",
"affiliation": "Cornell NYC Tech and the Cornell Computer Science Department,",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pietro",
"surname": "Perona",
"fullName": "Pietro Perona",
"affiliation": "Department of Electrical Engineering , California Institute of Technology, Pasadena,",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2014-08-01 00:00:00",
"pubType": "trans",
"pages": "1532-1545",
"year": "2014",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2017/0457/0/0457h341",
"title": "Mimicking Very Efficient Network for Object Detection",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457h341/12OmNBsue9q",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032b290",
"title": "Learning Feature Pyramids for Human Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032b290/12OmNC0y5Dl",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391a046",
"title": "Object Detection Using Generalization and Efficiency Balanced Co-Occurrence Features",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391a046/12OmNwF0BLs",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457a936",
"title": "Feature Pyramid Networks for Object Detection",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457a936/12OmNyxFKaQ",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2018/4195/0/08551547",
"title": "Hyper Feature Fusion Pyramid Network for Object Detection",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2018/08551547/17D45VsBU4O",
"parentPublication": {
"id": "proceedings/icmew/2018/4195/0",
"title": "2018 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/6.42E144",
"title": "Feature Selective Networks for Object Detection",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/6.42E144/17D45XfSEUG",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200c743",
"title": "GraphFPN: Graph Feature Pyramid Network for Object Detection",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200c743/1BmGEeISUAo",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2019/4328/0/09047445",
"title": "Weighted Feature Pyramid Networks for Object Detection",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-bdcloud-socialcom-sustaincom/2019/09047445/1iC6ziWErYI",
"parentPublication": {
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2019/4328/0",
"title": "2019 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412229",
"title": "Bidirectional Matrix Feature Pyramid Network for Object Detection",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412229/1tmjub7XLW0",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900n3034",
"title": "You Only Look One-level Feature",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900n3034/1yeMiRtPCOQ",
"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": "06678501",
"articleId": "13rRUxAASUB",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06710175",
"articleId": "13rRUwkxc6F",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1Hcio5iMQBW",
"title": "Nov.",
"year": "2022",
"issueNum": "11",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xlvSWIQHuM",
"doi": "10.1109/TPAMI.2021.3116945",
"abstract": "This paper introduces video domain generalization where most video classification networks degenerate due to the lack of exposure to the target domains of divergent distributions. We observe that the global temporal features are less generalizable, due to the temporal domain shift that videos from other unseen domains may have an unexpected absence or misalignment of the temporal relations. This finding has motivated us to solve video domain generalization by effectively learning the local-relation features of different timescales that are more generalizable, and exploiting them along with the global-relation features to maintain the discriminability. This paper presents the VideoDG framework with two technical contributions. The first is a new deep architecture named the Adversarial Pyramid Network, which improves the generalizability of video features by capturing the local-relation, global-relation, and cross-relation features progressively. On the basis of pyramid features, the second contribution is a new and robust approach of adversarial data augmentation that can bridge different video domains by improving the diversity and quality of augmented data. We construct three video domain generalization benchmarks in which domains are divided according to different datasets, different consequences of actions, or different camera views, respectively. VideoDG consistently outperforms the combinations of previous video classification models and existing domain generalization methods on all benchmarks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper introduces video domain generalization where most video classification networks degenerate due to the lack of exposure to the target domains of divergent distributions. We observe that the global temporal features are less generalizable, due to the temporal domain shift that videos from other unseen domains may have an unexpected absence or misalignment of the temporal relations. This finding has motivated us to solve video domain generalization by effectively learning the local-relation features of different timescales that are more generalizable, and exploiting them along with the global-relation features to maintain the discriminability. This paper presents the VideoDG framework with two technical contributions. The first is a new deep architecture named the Adversarial Pyramid Network, which improves the generalizability of video features by capturing the local-relation, global-relation, and cross-relation features progressively. On the basis of pyramid features, the second contribution is a new and robust approach of adversarial data augmentation that can bridge different video domains by improving the diversity and quality of augmented data. We construct three video domain generalization benchmarks in which domains are divided according to different datasets, different consequences of actions, or different camera views, respectively. VideoDG consistently outperforms the combinations of previous video classification models and existing domain generalization methods on all benchmarks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper introduces video domain generalization where most video classification networks degenerate due to the lack of exposure to the target domains of divergent distributions. We observe that the global temporal features are less generalizable, due to the temporal domain shift that videos from other unseen domains may have an unexpected absence or misalignment of the temporal relations. This finding has motivated us to solve video domain generalization by effectively learning the local-relation features of different timescales that are more generalizable, and exploiting them along with the global-relation features to maintain the discriminability. This paper presents the VideoDG framework with two technical contributions. The first is a new deep architecture named the Adversarial Pyramid Network, which improves the generalizability of video features by capturing the local-relation, global-relation, and cross-relation features progressively. On the basis of pyramid features, the second contribution is a new and robust approach of adversarial data augmentation that can bridge different video domains by improving the diversity and quality of augmented data. We construct three video domain generalization benchmarks in which domains are divided according to different datasets, different consequences of actions, or different camera views, respectively. VideoDG consistently outperforms the combinations of previous video classification models and existing domain generalization methods on all benchmarks.",
"title": "VideoDG: Generalizing Temporal Relations in Videos to Novel Domains",
"normalizedTitle": "VideoDG: Generalizing Temporal Relations in Videos to Novel Domains",
"fno": "09556560",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Feature Extraction",
"Image Classification",
"Image Motion Analysis",
"Learning Artificial Intelligence",
"Object Recognition",
"Pattern Classification",
"Video Signal Processing",
"Video DG",
"Generalizing Temporal Relations",
"Video Classification Networks",
"Target Domains",
"Global Temporal Features",
"Temporal Domain Shift",
"Unseen Domains",
"Local Relation Features",
"Global Relation Features",
"Adversarial Pyramid Network",
"Video Features",
"Cross Relation Features",
"Pyramid Features",
"Different Video Domains",
"Video Domain Generalization Benchmarks",
"Previous Video Classification Models",
"Existing Domain Generalization Methods",
"Videos",
"Training",
"Adaptation Models",
"Transfer Learning",
"Spatiotemporal Phenomena",
"Benchmark Testing",
"Robustness",
"Deep Learning",
"Transfer Learning",
"Domain Generalization",
"Adversarial Pyramid Network",
"Video Action Recognition"
],
"authors": [
{
"givenName": "Zhiyu",
"surname": "Yao",
"fullName": "Zhiyu Yao",
"affiliation": "School of Software, BNRist, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yunbo",
"surname": "Wang",
"fullName": "Yunbo Wang",
"affiliation": "School of Software, BNRist, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jianmin",
"surname": "Wang",
"fullName": "Jianmin Wang",
"affiliation": "School of Software, BNRist, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Philip S.",
"surname": "Yu",
"fullName": "Philip S. Yu",
"affiliation": "School of Software, BNRist, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mingsheng",
"surname": "Long",
"fullName": "Mingsheng Long",
"affiliation": "School of Software, BNRist, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2022-11-01 00:00:00",
"pubType": "trans",
"pages": "7989-8004",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2017/0457/0/0457b003",
"title": "Temporal Convolutional Networks for Action Segmentation and Detection",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457b003/12OmNC2fGuk",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2017/1034/0/1034c313",
"title": "Temporal Localization and Spatial Segmentation of Joint Attention in Multiple First-Person Videos",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034c313/12OmNrIJqAw",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2016/7258/0/07552913",
"title": "Understanding spatial correlation in eye-fixation maps for visual attention in videos",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2016/07552913/12OmNwDAC6H",
"parentPublication": {
"id": "proceedings/icme/2016/7258/0",
"title": "2016 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032f161",
"title": "Spatiotemporal Modeling for Crowd Counting in Videos",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032f161/12OmNyyeWuD",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460560",
"title": "Visual attention region determination for H.264 videos",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460560/12OmNzlUKzW",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032e308",
"title": "Self-Supervised Learning of Pose Embeddings from Spatiotemporal Relations in Videos",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032e308/12OmNzmclBw",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391c012",
"title": "Human Pose Estimation in Videos",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391c012/12OmNzt0ItY",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09782500",
"title": "Generalizing to Unseen Domains: A Survey on Domain Generalization",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09782500/1DGRWOb6qCA",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdarw/2019/5054/4/505404a013",
"title": "Summarizing Lecture Videos by Key Handwritten Content Regions",
"doi": null,
"abstractUrl": "/proceedings-article/icdarw/2019/505404a013/1eLyeh2rQv6",
"parentPublication": {
"id": "icdarw/2019/5054/4",
"title": "2019 International Conference on Document Analysis and Recognition Workshops (ICDARW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800o4380",
"title": "Generalizing Hand Segmentation in Egocentric Videos With Uncertainty-Guided Model Adaptation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800o4380/1m3o7z7qCuA",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09516988",
"articleId": "1watWmznfRS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09513556",
"articleId": "1w2fcr0y8Ao",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1DjDhzwzxlu",
"title": "June",
"year": "2022",
"issueNum": "03",
"idPrefix": "bd",
"pubType": "journal",
"volume": "8",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1jNtx4z0Dgk",
"doi": "10.1109/TBDATA.2020.2980849",
"abstract": "Koopman mode decomposition is a flow analysis technique developed by Igor Mezić in 2004, based upon the Koopman operator first proposed by Bernard Koopman in 1931. Via Koopman decomposition any non-chaotic well-sampled dynamic system – linear, non-linear, laminar or turbulent – is broken down into single-frequency repetitive components (modes). This paper presents a survey consolidating published information regarding data-driven Koopman analysis techniques. It is intended to aid researchers exploring the suitability of data-driven Koopman analysis in anticipation of developing their own modeling. A basic mathematical explanation of Koopman analysis is given with emphasis toward the data-driven Dynamic Mode Decomposition (DMD) solution, which converges to the Koopman operator given a highly-sampled dataset. The four primary uses of Koopman analysis: flow analysis, power grid analysis, building thermal analysis, and biomedical analysis are discussed, along with other public. Finally, weaknesses and problems inherent within Koopman analysis/DMD will be enumerated, alongside potential solutions. Koopman analysis is a computationally complex, yet often suitable method for determining periodic motion in any highly-sampled dataset. When compared to a similar analysis method, Proper Orthogonal Decomposition, Koopman analysis often provides additional detail regarding the structure of less significant modes present, albeit at the cost of increased computational complexity.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Koopman mode decomposition is a flow analysis technique developed by Igor Mezić in 2004, based upon the Koopman operator first proposed by Bernard Koopman in 1931. Via Koopman decomposition any non-chaotic well-sampled dynamic system – linear, non-linear, laminar or turbulent – is broken down into single-frequency repetitive components (modes). This paper presents a survey consolidating published information regarding data-driven Koopman analysis techniques. It is intended to aid researchers exploring the suitability of data-driven Koopman analysis in anticipation of developing their own modeling. A basic mathematical explanation of Koopman analysis is given with emphasis toward the data-driven Dynamic Mode Decomposition (DMD) solution, which converges to the Koopman operator given a highly-sampled dataset. The four primary uses of Koopman analysis: flow analysis, power grid analysis, building thermal analysis, and biomedical analysis are discussed, along with other public. Finally, weaknesses and problems inherent within Koopman analysis/DMD will be enumerated, alongside potential solutions. Koopman analysis is a computationally complex, yet often suitable method for determining periodic motion in any highly-sampled dataset. When compared to a similar analysis method, Proper Orthogonal Decomposition, Koopman analysis often provides additional detail regarding the structure of less significant modes present, albeit at the cost of increased computational complexity.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Koopman mode decomposition is a flow analysis technique developed by Igor Mezić in 2004, based upon the Koopman operator first proposed by Bernard Koopman in 1931. Via Koopman decomposition any non-chaotic well-sampled dynamic system – linear, non-linear, laminar or turbulent – is broken down into single-frequency repetitive components (modes). This paper presents a survey consolidating published information regarding data-driven Koopman analysis techniques. It is intended to aid researchers exploring the suitability of data-driven Koopman analysis in anticipation of developing their own modeling. A basic mathematical explanation of Koopman analysis is given with emphasis toward the data-driven Dynamic Mode Decomposition (DMD) solution, which converges to the Koopman operator given a highly-sampled dataset. The four primary uses of Koopman analysis: flow analysis, power grid analysis, building thermal analysis, and biomedical analysis are discussed, along with other public. Finally, weaknesses and problems inherent within Koopman analysis/DMD will be enumerated, alongside potential solutions. Koopman analysis is a computationally complex, yet often suitable method for determining periodic motion in any highly-sampled dataset. When compared to a similar analysis method, Proper Orthogonal Decomposition, Koopman analysis often provides additional detail regarding the structure of less significant modes present, albeit at the cost of increased computational complexity.",
"title": "A Survey on the Methods and Results of Data-Driven Koopman Analysis in the Visualization of Dynamical Systems",
"normalizedTitle": "A Survey on the Methods and Results of Data-Driven Koopman Analysis in the Visualization of Dynamical Systems",
"fno": "09037083",
"hasPdf": true,
"idPrefix": "bd",
"keywords": [
"Chaos",
"Computational Complexity",
"Eigenvalues And Eigenfunctions",
"Flow Instability",
"Nonlinear Dynamical Systems",
"Power Grids",
"Spectral Analysis",
"Koopman Mode Decomposition",
"Flow Analysis Technique",
"Koopman Operator",
"Bernard Koopman",
"Via Koopman Decomposition",
"Nonchaotic Well Sampled Dynamic System Linear",
"Data Driven Koopman Analysis Techniques",
"Power Grid Analysis",
"Thermal Analysis",
"Biomedical Analysis",
"Similar Analysis Method",
"Data Driven Dynamic Mode Decomposition Solution",
"Mathematical Model",
"Nonlinear Dynamical Systems",
"Eigenvalues And Eigenfunctions",
"Power System Dynamics",
"Big Data",
"Dynamic Mode Decomposition",
"Koopman Operator",
"Linearization Techniques",
"Nonlinear Dynamical Systems"
],
"authors": [
{
"givenName": "Nishaal",
"surname": "Parmar",
"fullName": "Nishaal Parmar",
"affiliation": "Department of Electrical and Computer Engineering, University of Oklahoma, Tulsa, OK, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hazem H.",
"surname": "Refai",
"fullName": "Hazem H. Refai",
"affiliation": "Department of Electrical and Computer Engineering, University of Oklahoma, Tulsa, OK, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thordur",
"surname": "Runolfsson",
"fullName": "Thordur Runolfsson",
"affiliation": "Department of Electrical and Computer Engineering, University of Oklahoma, Tulsa, OK, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2022-06-01 00:00:00",
"pubType": "trans",
"pages": "723-738",
"year": "2022",
"issn": "2332-7790",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/robot/1992/2720/0/00219943",
"title": "Simulation of flexible-link manipulators: basis functions and nonlinear terms in the motion equations",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1992/00219943/12OmNvSKNEa",
"parentPublication": {
"id": "proceedings/robot/1992/2720/0",
"title": "Proceedings 1992 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2017/3013/0/3013a892",
"title": "Chaotic Dynamics of a Six-Dimensional Nonautonomous Rectangular Thin Plate under In-Plane Excitation",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2017/3013a892/12OmNwDj1be",
"parentPublication": {
"id": "proceedings/icisce/2017/3013/0",
"title": "2017 4th International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391a585",
"title": "Multiple-Hypothesis Affine Region Estimation with Anisotropic LoG Filters",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391a585/12OmNwpXRVA",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2017/6067/0/08019475",
"title": "Blind image deblurring via adaptive dynamical system learning",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2017/08019475/12OmNyugyZb",
"parentPublication": {
"id": "proceedings/icme/2017/6067/0",
"title": "2017 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2017/1034/0/1034b862",
"title": "Dynamic Mode Decomposition for Background Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034b862/12OmNzlD9DK",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2021/2420/0/242000a388",
"title": "Improving Momentum Strategies using Adaptive Elastic Dynamic Mode Decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2021/242000a388/1Eb2DBFtF2o",
"parentPublication": {
"id": "proceedings/iiai-aai/2021/2420/0",
"title": "2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904965",
"title": "Constrained Dynamic Mode Decomposition",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904965/1H2kZdjPRNm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020504",
"title": "Combining Dynamic Mode Decomposition and Difference-in-Differences in an Analysis of At-Risk Youth",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020504/1KfQYFrvi4E",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scala/2020/1050/0/105000a027",
"title": "A Survey of Singular Value Decomposition Methods for Distributed Tall/Skinny Data",
"doi": null,
"abstractUrl": "/proceedings-article/scala/2020/105000a027/1q0FWN86r1C",
"parentPublication": {
"id": "proceedings/scala/2020/1050/0",
"title": "2020 IEEE/ACM 11th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems (ScalA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09378297",
"title": "Analyzing Effectiveness of Gang Interventions using Koopman Operator Theory",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09378297/1s64Dqs9jvW",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09028215",
"articleId": "1i3AL8ailbO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09039623",
"articleId": "1igS0nvuwXm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"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": "1yeCaMmiM3S",
"doi": "10.1109/TVCG.2021.3124729",
"abstract": "Large-scale structures have been observed in many shear flows which are the fluid generated between two surfaces moving with different velocity. A better understanding of the physics of the structures (especially large-scale structures) in shear flows will help explain a diverse range of physical phenomena and improve our capability of modeling more complex turbulence flows. Many efforts have been made in order to capture such structures; however, conventional methods have their limitations, such as arbitrariness in parameter choice or specificity to certain setups. To address this challenge, we propose to use Multi-Resolution Dynamic Mode Decomposition (mrDMD), for large-scale structure extraction in shear flows. In particular, we show that the slow motion DMD modes are able to reveal large-scale structures in shear flows that also have slow dynamics. In most cases, we find that the slowest DMD mode and its reconstructed flow can sufficiently capture the large-scale dynamics in the shear flows, which leads to a parameter-free strategy for large-scale structure extraction. Effective visualization of the large-scale structures can then be produced with the aid of the slowest DMD mode. To speed up the computation of mrDMD, we provide a fast GPU-based implementation. We also apply our method to some non-shear flows that need not behave quasi-linearly to demonstrate the limitation of our strategy of using the slowest DMD mode. For non-shear flows, we show that multiple modes from different levels of mrDMD may be needed to sufficiently characterize the flow behavior.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Large-scale structures have been observed in many shear flows which are the fluid generated between two surfaces moving with different velocity. A better understanding of the physics of the structures (especially large-scale structures) in shear flows will help explain a diverse range of physical phenomena and improve our capability of modeling more complex turbulence flows. Many efforts have been made in order to capture such structures; however, conventional methods have their limitations, such as arbitrariness in parameter choice or specificity to certain setups. To address this challenge, we propose to use Multi-Resolution Dynamic Mode Decomposition (mrDMD), for large-scale structure extraction in shear flows. In particular, we show that the slow motion DMD modes are able to reveal large-scale structures in shear flows that also have slow dynamics. In most cases, we find that the slowest DMD mode and its reconstructed flow can sufficiently capture the large-scale dynamics in the shear flows, which leads to a parameter-free strategy for large-scale structure extraction. Effective visualization of the large-scale structures can then be produced with the aid of the slowest DMD mode. To speed up the computation of mrDMD, we provide a fast GPU-based implementation. We also apply our method to some non-shear flows that need not behave quasi-linearly to demonstrate the limitation of our strategy of using the slowest DMD mode. For non-shear flows, we show that multiple modes from different levels of mrDMD may be needed to sufficiently characterize the flow behavior.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Large-scale structures have been observed in many shear flows which are the fluid generated between two surfaces moving with different velocity. A better understanding of the physics of the structures (especially large-scale structures) in shear flows will help explain a diverse range of physical phenomena and improve our capability of modeling more complex turbulence flows. Many efforts have been made in order to capture such structures; however, conventional methods have their limitations, such as arbitrariness in parameter choice or specificity to certain setups. To address this challenge, we propose to use Multi-Resolution Dynamic Mode Decomposition (mrDMD), for large-scale structure extraction in shear flows. In particular, we show that the slow motion DMD modes are able to reveal large-scale structures in shear flows that also have slow dynamics. In most cases, we find that the slowest DMD mode and its reconstructed flow can sufficiently capture the large-scale dynamics in the shear flows, which leads to a parameter-free strategy for large-scale structure extraction. Effective visualization of the large-scale structures can then be produced with the aid of the slowest DMD mode. To speed up the computation of mrDMD, we provide a fast GPU-based implementation. We also apply our method to some non-shear flows that need not behave quasi-linearly to demonstrate the limitation of our strategy of using the slowest DMD mode. For non-shear flows, we show that multiple modes from different levels of mrDMD may be needed to sufficiently characterize the flow behavior.",
"title": "Dynamic Mode Decomposition for Large-Scale Coherent Structure Extraction in Shear Flows",
"normalizedTitle": "Dynamic Mode Decomposition for Large-Scale Coherent Structure Extraction in Shear Flows",
"fno": "09599597",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Channel Flow",
"Computational Fluid Dynamics",
"Flow Simulation",
"Flow Visualisation",
"Graphics Processing Units",
"Shear Flow",
"Shear Turbulence",
"Turbulence",
"Large Scale Coherent Structure Extraction",
"Large Scale Dynamics",
"Large Scale Structure Extraction",
"Large Scale Structures",
"Multi Resolution Dynamic Mode Decomposition",
"Nonshear",
"Shear Flows",
"Slowest DMD Mode",
"Feature Extraction",
"Vehicle Dynamics",
"Three Dimensional Displays",
"Visualization",
"Shape",
"Task Analysis",
"Standards",
"Flow Visualization",
"Shear Flows",
"Dynamic Mode Decomposition"
],
"authors": [
{
"givenName": "Duong B.",
"surname": "Nguyen",
"fullName": "Duong B. Nguyen",
"affiliation": "University of Houston, Houston, TX, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Panruo",
"surname": "Wu",
"fullName": "Panruo Wu",
"affiliation": "University of Houston, Houston, TX, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rodolfo Ostilla",
"surname": "Monico",
"fullName": "Rodolfo Ostilla Monico",
"affiliation": "University of Houston, Houston, TX, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guoning",
"surname": "Chen",
"fullName": "Guoning Chen",
"affiliation": "University of Houston, Houston, TX, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "1531-1544",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cdc/2000/6638/2/00912108",
"title": "Overview of some theoretical and experimental results on modeling and control of shear flows",
"doi": null,
"abstractUrl": "/proceedings-article/cdc/2000/00912108/12OmNBcj5Dw",
"parentPublication": {
"id": "proceedings/cdc/2000/6638/4",
"title": "Proceedings of the 39th IEEE Conference on Decision and Control",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vv/2004/8781/0/01374291",
"title": "Visualization of the energy-containing turbulent scales",
"doi": null,
"abstractUrl": "/proceedings-article/vv/2004/01374291/12OmNrH1PHb",
"parentPublication": {
"id": "proceedings/vv/2004/8781/0",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2016/7258/0/07552877",
"title": "Robust low rank dynamic mode decomposition for compressed domain crowd and traffic flow analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2016/07552877/12OmNvTBB51",
"parentPublication": {
"id": "proceedings/icme/2016/7258/0",
"title": "2016 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2008/3508/1/3508a560",
"title": "Shape Constraint Incorporated Geometric Flows for Blood Vessels Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2008/3508a560/12OmNwekjvz",
"parentPublication": {
"id": "proceedings/cis/2008/3508/1",
"title": "2008 International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/05/ttg2010050854",
"title": "Active Shape Modeling with Electric Flows",
"doi": null,
"abstractUrl": "/journal/tg/2010/05/ttg2010050854/13rRUNvyaeV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2007/06/mcs2007060045",
"title": "Shear Flows and Turbulence in Nature",
"doi": null,
"abstractUrl": "/magazine/cs/2007/06/mcs2007060045/13rRUxD9h13",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/04/ttg2011040412",
"title": "Visualizing the Evolution and Interaction of Vortices and Shear Layers in Time-Dependent 3D Flow",
"doi": null,
"abstractUrl": "/journal/tg/2011/04/ttg2011040412/13rRUyYSWsO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2021/2420/0/242000a388",
"title": "Improving Momentum Strategies using Adaptive Elastic Dynamic Mode Decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2021/242000a388/1Eb2DBFtF2o",
"parentPublication": {
"id": "proceedings/iiai-aai/2021/2420/0",
"title": "2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800f335",
"title": "Novel View Synthesis of Dynamic Scenes With Globally Coherent Depths From a Monocular Camera",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800f335/1m3nsLsycz6",
"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/bibe/2021/4261/0/09635269",
"title": "Computational Finite Element Analysis of Aortic Root with Bicuspid Valve",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2021/09635269/1zmvo7RzhwA",
"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": "09585392",
"articleId": "1y11d1nDEas",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09600876",
"articleId": "1yfWB7atOh2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Jv6ydo27Yc",
"name": "ttg202302-09599597s1-supp1-3124729.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202302-09599597s1-supp1-3124729.pdf",
"extension": "pdf",
"size": "20.2 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxeutf3",
"title": "Jan.",
"year": "2013",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUzphDxW",
"doi": "10.1109/TVCG.2012.108",
"abstract": "Treemaps are a well known and powerful space-filling visualisation method for displaying hierarchical data. Many alternative treemap algorithms have been proposed, often with the aim being to optimise performance across several criteria, including spatial stability to assist users in locating and monitoring items of interest. In this paper, we demonstrate that spatial stability is not fully captured by the commonly used \"distance change” (DC) metric, and we introduce a new \"location drift” (LD) metric to more fully capture spatial stability. An empirical study examines the validity and usefulness of the location drift metric, showing that it explains some effects on user performance that distance change does not. Next, we introduce \"Hilbert” and \"Moore” treemap algorithms, which are designed to achieve high spatial stability. We assess their performance in comparison to other treemaps, showing that Hilbert and Moore treemaps perform well across all stability metrics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Treemaps are a well known and powerful space-filling visualisation method for displaying hierarchical data. Many alternative treemap algorithms have been proposed, often with the aim being to optimise performance across several criteria, including spatial stability to assist users in locating and monitoring items of interest. In this paper, we demonstrate that spatial stability is not fully captured by the commonly used \"distance change” (DC) metric, and we introduce a new \"location drift” (LD) metric to more fully capture spatial stability. An empirical study examines the validity and usefulness of the location drift metric, showing that it explains some effects on user performance that distance change does not. Next, we introduce \"Hilbert” and \"Moore” treemap algorithms, which are designed to achieve high spatial stability. We assess their performance in comparison to other treemaps, showing that Hilbert and Moore treemaps perform well across all stability metrics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Treemaps are a well known and powerful space-filling visualisation method for displaying hierarchical data. Many alternative treemap algorithms have been proposed, often with the aim being to optimise performance across several criteria, including spatial stability to assist users in locating and monitoring items of interest. In this paper, we demonstrate that spatial stability is not fully captured by the commonly used \"distance change” (DC) metric, and we introduce a new \"location drift” (LD) metric to more fully capture spatial stability. An empirical study examines the validity and usefulness of the location drift metric, showing that it explains some effects on user performance that distance change does not. Next, we introduce \"Hilbert” and \"Moore” treemap algorithms, which are designed to achieve high spatial stability. We assess their performance in comparison to other treemaps, showing that Hilbert and Moore treemaps perform well across all stability metrics.",
"title": "Enhanced Spatial Stability with Hilbert and Moore Treemaps",
"normalizedTitle": "Enhanced Spatial Stability with Hilbert and Moore Treemaps",
"fno": "ttg2013010141",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Trees Mathematics",
"Data Visualisation",
"LD",
"Enhanced Spatial Stability",
"Hilbert Treemaps",
"Moore Treemaps",
"Space Filling Visualisation Method",
"Hierarchical Data",
"Distance Change Metric",
"DC",
"Location Drift Metric",
"Layout",
"Measurement",
"Stability Criteria",
"Algorithm Design And Analysis",
"Gravity",
"Monitoring",
"Space Filling Curve",
"Trees Mathematics",
"Data Visualisation",
"LD",
"Enhanced Spatial Stability",
"Hilbert Treemaps",
"Moore Treemaps",
"Space Filling Visualisation Method",
"Hierarchical Data",
"Distance Change Metric",
"DC",
"Location Drift Metric",
"Layout",
"Measurement",
"Stability Criteria",
"Algorithm Design And Analysis",
"Gravity",
"Monitoring",
"Spatial Stability",
"Treemap"
],
"authors": [
{
"givenName": "S.",
"surname": "Tak",
"fullName": "S. Tak",
"affiliation": "Dept. of Comput. Sci. & Software Eng., Univ. of Canterbury, Christchurch, New Zealand",
"__typename": "ArticleAuthorType"
},
{
"givenName": "A.",
"surname": "Cockburn",
"fullName": "A. Cockburn",
"affiliation": "Dept. of Comput. Sci. & Software Eng., Univ. of Canterbury, Christchurch, New Zealand",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2013-01-01 00:00:00",
"pubType": "trans",
"pages": "141-148",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900008",
"title": "Elastic Hierarchies: Combining Treemaps and Node-Link Diagrams",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900008/12OmNAOKnSi",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2012/4771/0/4771a074",
"title": "Angular Treemaps - A New Technique for Visualizing and Emphasizing Hierarchical Structures",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2012/4771a074/12OmNqFJhII",
"parentPublication": {
"id": "proceedings/iv/2012/4771/0",
"title": "2012 16th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvd/2009/3781/0/3781a265",
"title": "Visualizing Biodiversity with Voronoi Treemaps",
"doi": null,
"abstractUrl": "/proceedings-article/isvd/2009/3781a265/12OmNy7QfoW",
"parentPublication": {
"id": "proceedings/isvd/2009/3781/0",
"title": "2009 Sixth International Symposium on Voronoi Diagrams",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900007",
"title": "Voronoi Treemaps",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900007/12OmNzSyCdf",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08019841",
"title": "Stable Treemaps via Local Moves",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019841/13rRUIJcWlt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010060990",
"title": "Perceptual Guidelines for Creating Rectangular Treemaps",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010060990/13rRUx0gezT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061348",
"title": "Spatially Ordered Treemaps",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061348/13rRUxBJhmN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/04376152",
"title": "Visualizing Changes of Hierarchical Data using Treemaps",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/04376152/13rRUxYrbUw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1286",
"title": "Visualizing Changes of Hierarchical Data using Treemaps",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1286/13rRUy0qnLA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904436",
"title": "SizePairs: Achieving Stable and Balanced Temporal Treemaps using Hierarchical Size-based Pairing",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904436/1H1gs021YFa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013010130",
"articleId": "13rRUwh80Ha",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013010149",
"articleId": "13rRUynHuj9",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"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": "13rRUwInuWy",
"doi": "10.1109/TVCG.2017.2746080",
"abstract": "Dynamic networks naturally appear in a multitude of applications from different fields. Analyzing and exploring dynamic networks in order to understand and detect patterns and phenomena is challenging, fostering the development of new methodologies, particularly in the field of visual analytics. In this work, we propose a novel visual analytics methodology for dynamic networks, which relies on the spectral graph wavelet theory. We enable the automatic analysis of a signal defined on the nodes of the network, making viable the robust detection of network properties. Specifically, we use a fast approximation of a graph wavelet transform to derive a set of wavelet coefficients, which are then used to identify activity patterns on large networks, including their temporal recurrence. The coefficients naturally encode the spatial and temporal variations of the signal, leading to an efficient and meaningful representation. This methodology allows for the exploration of the structural evolution of the network and their patterns over time. The effectiveness of our approach is demonstrated using usage scenarios and comparisons involving real dynamic networks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Dynamic networks naturally appear in a multitude of applications from different fields. Analyzing and exploring dynamic networks in order to understand and detect patterns and phenomena is challenging, fostering the development of new methodologies, particularly in the field of visual analytics. In this work, we propose a novel visual analytics methodology for dynamic networks, which relies on the spectral graph wavelet theory. We enable the automatic analysis of a signal defined on the nodes of the network, making viable the robust detection of network properties. Specifically, we use a fast approximation of a graph wavelet transform to derive a set of wavelet coefficients, which are then used to identify activity patterns on large networks, including their temporal recurrence. The coefficients naturally encode the spatial and temporal variations of the signal, leading to an efficient and meaningful representation. This methodology allows for the exploration of the structural evolution of the network and their patterns over time. The effectiveness of our approach is demonstrated using usage scenarios and comparisons involving real dynamic networks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Dynamic networks naturally appear in a multitude of applications from different fields. Analyzing and exploring dynamic networks in order to understand and detect patterns and phenomena is challenging, fostering the development of new methodologies, particularly in the field of visual analytics. In this work, we propose a novel visual analytics methodology for dynamic networks, which relies on the spectral graph wavelet theory. We enable the automatic analysis of a signal defined on the nodes of the network, making viable the robust detection of network properties. Specifically, we use a fast approximation of a graph wavelet transform to derive a set of wavelet coefficients, which are then used to identify activity patterns on large networks, including their temporal recurrence. The coefficients naturally encode the spatial and temporal variations of the signal, leading to an efficient and meaningful representation. This methodology allows for the exploration of the structural evolution of the network and their patterns over time. The effectiveness of our approach is demonstrated using usage scenarios and comparisons involving real dynamic networks.",
"title": "Wavelet-Based Visual Analysis of Dynamic Networks",
"normalizedTitle": "Wavelet-Based Visual Analysis of Dynamic Networks",
"fno": "08017630",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Wavelet Analysis",
"Visual Analytics",
"Wavelet Transforms",
"Data Visualization",
"Tools",
"Network Topology",
"Dynamic Networks",
"Spectral Graph Wavelets",
"Visual Analytics"
],
"authors": [
{
"givenName": "Alcebiades Dal",
"surname": "Col",
"fullName": "Alcebiades Dal Col",
"affiliation": "University of São Paulo, São Carlos, São Paulo, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Paola",
"surname": "Valdivia",
"fullName": "Paola Valdivia",
"affiliation": "University of São Paulo, São Carlos, São Paulo, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fabiano",
"surname": "Petronetto",
"fullName": "Fabiano Petronetto",
"affiliation": "Federal University of Espirito Santo, Vitória, ES, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fabio",
"surname": "Dias",
"fullName": "Fabio Dias",
"affiliation": "New York University, New York, NY",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Claudio T.",
"surname": "Silva",
"fullName": "Claudio T. Silva",
"affiliation": "New York University, New York, NY",
"__typename": "ArticleAuthorType"
},
{
"givenName": "L. Gustavo",
"surname": "Nonato",
"fullName": "L. Gustavo Nonato",
"affiliation": "University of São Paulo, São Carlos, São Paulo, Brazil",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2018-08-01 00:00:00",
"pubType": "trans",
"pages": "2456-2469",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/eisic/2013/5062/0/06657138",
"title": "Visual Analysis of Heterogeneous Networks",
"doi": null,
"abstractUrl": "/proceedings-article/eisic/2013/06657138/12OmNvA1hAw",
"parentPublication": {
"id": "proceedings/eisic/2013/5062/0",
"title": "2013 European Intelligence and Security Informatics Conference (EISIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2009/3596/0/3596b456",
"title": "Epileptic Seizures Detection Using Continuous Time Wavelet Based Artificial Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2009/3596b456/12OmNwCJOFr",
"parentPublication": {
"id": "proceedings/itng/2009/3596/0",
"title": "Information Technology: New Generations, Third International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156359",
"title": "MultiStory: Visual analytics of dynamic multi-relational networks",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156359/12OmNwK7o9E",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/microw/2012/4920/0/4920a032",
"title": "Wavelet transform based pre-processing for side channel analysis",
"doi": null,
"abstractUrl": "/proceedings-article/microw/2012/4920a032/12OmNxFJXHB",
"parentPublication": {
"id": "proceedings/microw/2012/4920/0",
"title": "2012 45th Annual IEEE/ACM International Symposium on Microarchitecture Workshops (MICROW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2012/4799/0/4799a179",
"title": "Visual Analysis of Dynamic Networks Using Change Centrality",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2012/4799a179/12OmNynJMLG",
"parentPublication": {
"id": "proceedings/asonam/2012/4799/0",
"title": "2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2014/6854/0/6854a130",
"title": "A Hybrid Visual Analytics Approach to Dynamic Space-Based Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2014/6854a130/12OmNzAohUL",
"parentPublication": {
"id": "proceedings/icvrv/2014/6854/0",
"title": "2014 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2010/02/ttk2010020193",
"title": "Dynamic Wavelet Synopses Management over Sliding Windows in Sensor Networks",
"doi": null,
"abstractUrl": "/journal/tk/2010/02/ttk2010020193/13rRUwbs1SO",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2017/05/mcs2017050085",
"title": "Wavelet-Based Visual Analysis for Data Exploration",
"doi": null,
"abstractUrl": "/magazine/cs/2017/05/mcs2017050085/13rRUxlgxZh",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vds/2022/5721/0/572100a017",
"title": "Motif-Based Visual Analysis of Dynamic Networks",
"doi": null,
"abstractUrl": "/proceedings-article/vds/2022/572100a017/1JezLDABVYs",
"parentPublication": {
"id": "proceedings/vds/2022/5721/0",
"title": "2022 IEEE Visualization in Data Science (VDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2020/9574/0/957400a017",
"title": "Cancer Classification Analysis for Microarray Gene Expression Data by Integrating Wavelet Transform and Visual Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2020/957400a017/1pBMoZgfw2s",
"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": "07959130",
"articleId": "13rRUwbs1Sy",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"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": "1HmgsIIjwsg",
"doi": "10.1109/MCG.2022.3210004",
"abstract": "IEEE VAST Challenge 2021 provides fruitful data to test the visual analytics capability of participants. We summarize our work in this paper. Trajectory data and consumption data contain a lot of information, such as consumption patterns, behavior characteristics and so on. The information can provide favorable clues for law enforcement departments to crack a case about missing employees. We designed a visual analytics system called Sundial for spatio-temporal situation awareness with multi-data fusion. It contains three views, that is, consumption view, temporal behavior view, and spatial-temporal map. With the system, analysts can effectively identify the consumption and behavior patterns of employees, detect the suspicious activities and informal or formal relationships. Through case analysis, we illustrated how to use the system and obtain effective information.",
"abstracts": [
{
"abstractType": "Regular",
"content": "IEEE VAST Challenge 2021 provides fruitful data to test the visual analytics capability of participants. We summarize our work in this paper. Trajectory data and consumption data contain a lot of information, such as consumption patterns, behavior characteristics and so on. The information can provide favorable clues for law enforcement departments to crack a case about missing employees. We designed a visual analytics system called Sundial for spatio-temporal situation awareness with multi-data fusion. It contains three views, that is, consumption view, temporal behavior view, and spatial-temporal map. With the system, analysts can effectively identify the consumption and behavior patterns of employees, detect the suspicious activities and informal or formal relationships. Through case analysis, we illustrated how to use the system and obtain effective information.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "IEEE VAST Challenge 2021 provides fruitful data to test the visual analytics capability of participants. We summarize our work in this paper. Trajectory data and consumption data contain a lot of information, such as consumption patterns, behavior characteristics and so on. The information can provide favorable clues for law enforcement departments to crack a case about missing employees. We designed a visual analytics system called Sundial for spatio-temporal situation awareness with multi-data fusion. It contains three views, that is, consumption view, temporal behavior view, and spatial-temporal map. With the system, analysts can effectively identify the consumption and behavior patterns of employees, detect the suspicious activities and informal or formal relationships. Through case analysis, we illustrated how to use the system and obtain effective information.",
"title": "IEEE VAST Challenge 2021 Winner: Visual Analytics for Spatial-Temporal Situation Awareness",
"normalizedTitle": "IEEE VAST Challenge 2021 Winner: Visual Analytics for Spatial-Temporal Situation Awareness",
"fno": "09915364",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Trajectory",
"Visual Analytics",
"Behavioral Sciences",
"Data Visualization",
"Credit Cards",
"Task Analysis",
"Automobiles"
],
"authors": [
{
"givenName": "Siqi",
"surname": "Shen",
"fullName": "Siqi Shen",
"affiliation": "School of Data Science, Fudan University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xingui",
"surname": "Lai",
"fullName": "Xingui Lai",
"affiliation": "School of Data Science, Fudan University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Siming",
"surname": "Chen",
"fullName": "Siming Chen",
"affiliation": "School of Data Science, Fudan University, Shanghai, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-10-01 00:00:00",
"pubType": "mags",
"pages": "1-14",
"year": "5555",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2014/6227/0/07042569",
"title": "Visual analytics of GPS tracks: From location to place to behaviour",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042569/12OmNA0dMFU",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2014/6227/0/07042550",
"title": "VAST challenge 2014: Mini-challenge 1",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042550/12OmNs59JJd",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2014/6227/0/07042574",
"title": "VAST 2014: Summary on Mini Challenge 3 work",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042574/12OmNvDI3Rg",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a348",
"title": "Japanese Behavior in Visual Analytics of Temporal Daily Life Data",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a348/12OmNvEQsfX",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2012/4752/0/06400529",
"title": "VAST Challenge 2012: Visual analytics for big data",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400529/12OmNwlqhST",
"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/vast/2014/6227/0/07042539",
"title": "VAST 2014: Summary on grant challenge work",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042539/12OmNzdoMtA",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2017/3163/0/08585620",
"title": "ClockPetals: Interactive Sequential Analysis of Traffic Patterns VAST Challenge MC1 Award: Multi-Challenge Award for Aesthetic Design",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585620/17D45WIXbRE",
"parentPublication": {
"id": "proceedings/vast/2017/3163/0",
"title": "2017 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2017/3163/0/08585677",
"title": "VAST Mini-Challenge 1",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585677/17D45WK5Aox",
"parentPublication": {
"id": "proceedings/vast/2017/3163/0",
"title": "2017 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2017/3163/0/08585723",
"title": "Visualizing chemicals detection VAST 2017 Mini Challenge 2",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585723/17D45WK5Aoy",
"parentPublication": {
"id": "proceedings/vast/2017/3163/0",
"title": "2017 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2017/3163/0/08585461",
"title": "VAST Challenge 2017: Mini-challenge 1",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585461/17D45XfSET1",
"parentPublication": {
"id": "proceedings/vast/2017/3163/0",
"title": "2017 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "09999325",
"articleId": "1JqD9O3nz68",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1HojErMg35u",
"name": "mcg555501-09915364s1-supp1-3210004.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/mcg555501-09915364s1-supp1-3210004.mp4",
"extension": "mp4",
"size": "13.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1s2GuNMihEY",
"title": "March-April",
"year": "2021",
"issueNum": "02",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "41",
"label": "March-April",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1hpPHFkOXCg",
"doi": "10.1109/MCG.2020.2973939",
"abstract": "Community-level event (CLE) datasets, such as police reports of crime events, contain abundant semantic information of event situations, and descriptions in a geospatial-temporal context. They are critical for frontline users, such as police officers and social workers, to discover and examine insights about community neighborhoods. We propose CLEVis, a neighborhood visual analytics system for CLE datasets, to help frontline users explore events for insights at community regions of interest, namely fine-grained geographical resolutions, such as small neighborhoods around local restaurants, churches, and schools. CLEVis fully utilizes semantic information by integrating automatic algorithms and interactive visualizations. The design and development of CLEVis are conducted with solid collaborations with real-world community workers and social scientists. Case studies and user feedback are presented with real-world datasets and applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Community-level event (CLE) datasets, such as police reports of crime events, contain abundant semantic information of event situations, and descriptions in a geospatial-temporal context. They are critical for frontline users, such as police officers and social workers, to discover and examine insights about community neighborhoods. We propose CLEVis, a neighborhood visual analytics system for CLE datasets, to help frontline users explore events for insights at community regions of interest, namely fine-grained geographical resolutions, such as small neighborhoods around local restaurants, churches, and schools. CLEVis fully utilizes semantic information by integrating automatic algorithms and interactive visualizations. The design and development of CLEVis are conducted with solid collaborations with real-world community workers and social scientists. Case studies and user feedback are presented with real-world datasets and applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Community-level event (CLE) datasets, such as police reports of crime events, contain abundant semantic information of event situations, and descriptions in a geospatial-temporal context. They are critical for frontline users, such as police officers and social workers, to discover and examine insights about community neighborhoods. We propose CLEVis, a neighborhood visual analytics system for CLE datasets, to help frontline users explore events for insights at community regions of interest, namely fine-grained geographical resolutions, such as small neighborhoods around local restaurants, churches, and schools. CLEVis fully utilizes semantic information by integrating automatic algorithms and interactive visualizations. The design and development of CLEVis are conducted with solid collaborations with real-world community workers and social scientists. Case studies and user feedback are presented with real-world datasets and applications.",
"title": "CLEVis: A Semantic Driven Visual Analytics System for Community Level Events",
"normalizedTitle": "CLEVis: A Semantic Driven Visual Analytics System for Community Level Events",
"fno": "08999535",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Visualisation",
"Geographic Information Systems",
"Geospatial Temporal Context",
"Event Situations",
"Abundant Semantic Information",
"Community Level Event Datasets",
"Semantic Driven Visual Analytics System",
"Community Neighborhoods",
"CLE Vis",
"Neighborhood Visual Analytics System",
"CLE Datasets",
"Frontline Users",
"Fine Grained Geographical Resolutions",
"Interactive Visualizations",
"Real World Community Workers",
"User Feedback",
"Data Models",
"Semantics",
"Data Visualization",
"Communities",
"Visual Analytics",
"Ontologies"
],
"authors": [
{
"givenName": "Chao",
"surname": "Ma",
"fullName": "Chao Ma",
"affiliation": "Kent State University, Kent, OH, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ye",
"surname": "Zhao",
"fullName": "Ye Zhao",
"affiliation": "Kent State University, Kent, OH, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrew",
"surname": "Curtis",
"fullName": "Andrew Curtis",
"affiliation": "Case Western Reserve University, Cleveland, OH, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Farah",
"surname": "Kamw",
"fullName": "Farah Kamw",
"affiliation": "Concordia University, Ann Arbor, MI, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shamal",
"surname": "AL-Dohuki",
"fullName": "Shamal AL-Dohuki",
"affiliation": "University of Duhok, Dohuk, Kurdistan Region, AJ, Iraq",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jing",
"surname": "Yang",
"fullName": "Jing Yang",
"affiliation": "UNC Charlotte, Charlotte, NC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Suphanut",
"surname": "Jamonnak",
"fullName": "Suphanut Jamonnak",
"affiliation": "Kent State University, Kent, OH, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ismael",
"surname": "Ali",
"fullName": "Ismael Ali",
"affiliation": "University of Zakho, Dohuk, Kurdistan Region, AJ, Iraq",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-03-01 00:00:00",
"pubType": "mags",
"pages": "49-62",
"year": "2021",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bdva/2015/7343/0/07314304",
"title": "Visual Analytics of Gene Sets Comparison",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2015/07314304/12OmNC3FGdO",
"parentPublication": {
"id": "proceedings/bdva/2015/7343/0",
"title": "2015 Big Data Visual Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2012/4752/0/06400544",
"title": "Optimizing an SPT-tree for visual analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400544/12OmNwx3Q97",
"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/pacificvis/2013/4797/0/06596145",
"title": "A visual analytics approach to exploring protein flexibility subspaces",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596145/12OmNxR5UHr",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsc/2016/0662/0/0662a392",
"title": "A Knowledge Base Visual Analytics Technique for Semantic Web",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2016/0662a392/12OmNyv7mla",
"parentPublication": {
"id": "proceedings/icsc/2016/0662/0",
"title": "2016 IEEE Tenth International Conference on Semantic Computing (ICSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2009/02/mcg2009020014",
"title": "Defining Insight for Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2009/02/mcg2009020014/13rRUwh80JN",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2014/02/mcg2014020026",
"title": "DIVE: A Graph-Based Visual-Analytics Framework for Big Data",
"doi": null,
"abstractUrl": "/magazine/cg/2014/02/mcg2014020026/13rRUwh80Jb",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2017/01/mcg2017010100",
"title": "Sampling for Scalable Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2017/01/mcg2017010100/13rRUxBa5pi",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08023780",
"title": "EVA: Visual Analytics to Identify Fraudulent Events",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08023780/13rRUxNEqQ0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/06/ttg2013061034",
"title": "PIWI: Visually Exploring Graphs Based on Their Community Structure",
"doi": null,
"abstractUrl": "/journal/tg/2013/06/ttg2013061034/13rRUxd2aYZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2009/02/mcg2009020084",
"title": "Demystifying Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2009/02/mcg2009020084/13rRUy3gn3z",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08691491",
"articleId": "1ikcyv4XAmk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09094384",
"articleId": "1jQNuB0f5x6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNARAndl",
"title": "May-June",
"year": "2020",
"issueNum": "03",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "40",
"label": "May-June",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1jqfbRdclvq",
"doi": "10.1109/MCG.2020.2981855",
"abstract": "TimeSets is a temporal data visualization technique designed to reveal insights into event sets, such as all the events linked to one person or organization. In this article, we describe two TimeSets-based visual analytics tools for intelligence analysis. In the first case, TimeSets is integrated with other visual analytics tools to support open-source intelligence analysis with Twitter data, particularly the challenge of finding the right questions to ask. The second case uses TimeSets in a participatory design process with analysts that aims to meet their requirements of uncertainty analysis involving fake news. Lessons learned are potentially beneficial to other application domains.",
"abstracts": [
{
"abstractType": "Regular",
"content": "TimeSets is a temporal data visualization technique designed to reveal insights into event sets, such as all the events linked to one person or organization. In this article, we describe two TimeSets-based visual analytics tools for intelligence analysis. In the first case, TimeSets is integrated with other visual analytics tools to support open-source intelligence analysis with Twitter data, particularly the challenge of finding the right questions to ask. The second case uses TimeSets in a participatory design process with analysts that aims to meet their requirements of uncertainty analysis involving fake news. Lessons learned are potentially beneficial to other application domains.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "TimeSets is a temporal data visualization technique designed to reveal insights into event sets, such as all the events linked to one person or organization. In this article, we describe two TimeSets-based visual analytics tools for intelligence analysis. In the first case, TimeSets is integrated with other visual analytics tools to support open-source intelligence analysis with Twitter data, particularly the challenge of finding the right questions to ask. The second case uses TimeSets in a participatory design process with analysts that aims to meet their requirements of uncertainty analysis involving fake news. Lessons learned are potentially beneficial to other application domains.",
"title": "TimeSets: Temporal Sensemaking in Intelligence Analysis",
"normalizedTitle": "TimeSets: Temporal Sensemaking in Intelligence Analysis",
"fno": "09082281",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Public Domain Software",
"Social Networking Online",
"Twitter Data",
"Participatory Design Process",
"Uncertainty Analysis",
"Temporal Sensemaking",
"Temporal Data Visualization Technique",
"Event Sets",
"Open Source Intelligence Analysis",
"Time Sets Based Visual Analytics Tools",
"Software Tools",
"Data Visualization",
"Visual Analytics",
"Color",
"Histograms",
"Information Analysis"
],
"authors": [
{
"givenName": "Kai",
"surname": "Xu",
"fullName": "Kai Xu",
"affiliation": "Middlesex University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Saminu",
"surname": "Salisu",
"fullName": "Saminu Salisu",
"affiliation": "Vienna University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Phong H.",
"surname": "Nguyen",
"fullName": "Phong H. Nguyen",
"affiliation": "Red Sift, Ltd.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rick",
"surname": "Walker",
"fullName": "Rick Walker",
"affiliation": "King",
"__typename": "ArticleAuthorType"
},
{
"givenName": "B. L. William",
"surname": "Wong",
"fullName": "B. L. William Wong",
"affiliation": "Middlesex University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Adrian",
"surname": "Wagstaff",
"fullName": "Adrian Wagstaff",
"affiliation": "Hawkesford Consultancy, Ltd.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Graham",
"surname": "Phillips",
"fullName": "Graham Phillips",
"affiliation": "MASS, Ltd.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mike",
"surname": "Biggs",
"fullName": "Mike Biggs",
"affiliation": "MASS, Ltd.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2020-05-01 00:00:00",
"pubType": "mags",
"pages": "83-93",
"year": "2020",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdmw/2012/4925/0/4925a894",
"title": "Cubix: A Visual Analytics Tool for Conceptual and Semantic Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2012/4925a894/12OmNz5JCf2",
"parentPublication": {
"id": "proceedings/icdmw/2012/4925/0",
"title": "2012 IEEE 12th International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eisic/2015/8657/0/8657a177",
"title": "Guidelines for Sensemaking in Intelligence Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/eisic/2015/8657a177/12OmNzTYBR1",
"parentPublication": {
"id": "proceedings/eisic/2015/8657/0",
"title": "2015 European Intelligence and Security Informatics Conference (EISIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07194834",
"title": "SensePath: Understanding the Sensemaking Process Through Analytic Provenance",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07194834/13rRUEgarnM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/07/mco2013070030",
"title": "Visual Analytics Support for Intelligence Analysis",
"doi": null,
"abstractUrl": "/magazine/co/2013/07/mco2013070030/13rRUxD9h0P",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__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": "trans/tg/2019/01/08440804",
"title": "ForVizor: Visualizing Spatio-Temporal Team Formations in Soccer",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440804/17D45WXIkAs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2017/3163/0/08585484",
"title": "CRICTO: Supporting Sensemaking through Crowdsourced Information Schematization",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585484/17D45Wc1ILV",
"parentPublication": {
"id": "proceedings/vast/2017/3163/0",
"title": "2017 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2008/2935/0/04677387",
"title": "Migrant Boat Mini Challenge Award: Simple and Effective Integrated Display Geo-Temporal Analysis of migrant boats",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2008/04677387/19t1L6Kivjq",
"parentPublication": {
"id": "proceedings/vast/2008/2935/0",
"title": "2008 IEEE Symposium on Visual Analytics Science and Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2019/2284/0/08986929",
"title": "Visualization of Spatial-Temporal Distribution of Damage Reports",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2019/08986929/1hrMyxzAZDG",
"parentPublication": {
"id": "proceedings/vast/2019/2284/0",
"title": "2019 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2021/3335/0/333500a181",
"title": "Narrative Sensemaking: Strategies for Narrative Maps Construction",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2021/333500a181/1yXuj3PJXRm",
"parentPublication": {
"id": "proceedings/vis/2021/3335/0",
"title": "2021 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09082751",
"articleId": "1jrRWZgvV72",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09082277",
"articleId": "1jqf9YuWiyI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrFBPWq",
"title": "September-October",
"year": "2006",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "September-October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwcAqq6",
"doi": "10.1109/TVCG.2006.137",
"abstract": "Animation is an effective way to show how time-varying phenomena evolve over time. A key issue of generating a good animation is to select ideal views through which the user can perceive the maximum amount of information from the time-varying dataset. In this paper, we first propose an improved view selection method for static data. The method measures the quality of a static view by analyzing the opacity, color and curvature distributions of the corresponding volume rendering images from the given view. Our view selection metric prefers an even opacity distribution with a larger projection area, a larger area of salient features' colors with an even distribution among the salient features, and more perceived curvatures. We use this static view selection method and a dynamic programming approach to select time-varying views. The time-varying view selection maximizes the information perceived from the time-varying dataset based on the constraints that the time-varying view should show smooth changes of direction and near-constant speed. We also introduce a method that allows the user to generate a smooth transition between any two views in a given time step, with the perceived information maximized as well. By combining the static and dynamic view selection methods, the users are able to generate a time-varying view that shows the maximum amount of information from a time-varying data set.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Animation is an effective way to show how time-varying phenomena evolve over time. A key issue of generating a good animation is to select ideal views through which the user can perceive the maximum amount of information from the time-varying dataset. In this paper, we first propose an improved view selection method for static data. The method measures the quality of a static view by analyzing the opacity, color and curvature distributions of the corresponding volume rendering images from the given view. Our view selection metric prefers an even opacity distribution with a larger projection area, a larger area of salient features' colors with an even distribution among the salient features, and more perceived curvatures. We use this static view selection method and a dynamic programming approach to select time-varying views. The time-varying view selection maximizes the information perceived from the time-varying dataset based on the constraints that the time-varying view should show smooth changes of direction and near-constant speed. We also introduce a method that allows the user to generate a smooth transition between any two views in a given time step, with the perceived information maximized as well. By combining the static and dynamic view selection methods, the users are able to generate a time-varying view that shows the maximum amount of information from a time-varying data set.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Animation is an effective way to show how time-varying phenomena evolve over time. A key issue of generating a good animation is to select ideal views through which the user can perceive the maximum amount of information from the time-varying dataset. In this paper, we first propose an improved view selection method for static data. The method measures the quality of a static view by analyzing the opacity, color and curvature distributions of the corresponding volume rendering images from the given view. Our view selection metric prefers an even opacity distribution with a larger projection area, a larger area of salient features' colors with an even distribution among the salient features, and more perceived curvatures. We use this static view selection method and a dynamic programming approach to select time-varying views. The time-varying view selection maximizes the information perceived from the time-varying dataset based on the constraints that the time-varying view should show smooth changes of direction and near-constant speed. We also introduce a method that allows the user to generate a smooth transition between any two views in a given time step, with the perceived information maximized as well. By combining the static and dynamic view selection methods, the users are able to generate a time-varying view that shows the maximum amount of information from a time-varying data set.",
"title": "Dynamic View Selection for Time-Varying Volumes",
"normalizedTitle": "Dynamic View Selection for Time-Varying Volumes",
"fno": "v1109",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Animation",
"Data Visualization",
"Image Color Analysis",
"Rendering Computer Graphics",
"Optimization Methods",
"Volume Measurement",
"Image Analysis",
"Dynamic Programming",
"Diversity Reception",
"Information Entropy",
"Optimization",
"Static View Selection",
"Image Based Method",
"Dynamic View Selection",
"Information Entropy"
],
"authors": [
{
"givenName": "Guangfeng",
"surname": "Ji",
"fullName": "Guangfeng Ji",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Han-Wei",
"surname": "Shen",
"fullName": "Han-Wei Shen",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "1109-1116",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/27660062",
"title": "View Selection for Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660062/12OmNAkWvwQ",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2007/2822/1/28220422",
"title": "K-Nearest Oracle for Dynamic Ensemble Selection",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2007/28220422/12OmNAqU4T2",
"parentPublication": {
"id": "proceedings/icdar/2007/2822/1",
"title": "Ninth International Conference on Document Analysis and Recognition (ICDAR 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2009/3735/7/05360003",
"title": "Efficient Materialized View Selection Dynamic Improvement Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/05360003/12OmNArbG4A",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/7",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vg/2005/26/0/01500530",
"title": "Time-varying interval volumes",
"doi": null,
"abstractUrl": "/proceedings-article/vg/2005/01500530/12OmNBigFuM",
"parentPublication": {
"id": "proceedings/vg/2005/26/0",
"title": "Volume Graphics 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2008/3305/5/3305e391",
"title": "Clustering-Based Dynamic Materialized View Selection Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2008/3305e391/12OmNwM6A0K",
"parentPublication": {
"id": "proceedings/fskd/2008/3305/5",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ifcsta/2009/3930/2/3930b326",
"title": "Research on Materialized View Selection Algorithm in Data Warehouse",
"doi": null,
"abstractUrl": "/proceedings-article/ifcsta/2009/3930b326/12OmNxGj9WF",
"parentPublication": {
"id": "proceedings/ifcsta/2009/3930/2",
"title": "Computer Science-Technology and Applications, International Forum on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/05/06477041",
"title": "Diverse Set Selection Over Dynamic Data",
"doi": null,
"abstractUrl": "/journal/tk/2014/05/06477041/13rRUxD9gYb",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200f692",
"title": "Dynamic View Synthesis from Dynamic Monocular Video",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200f692/1BmLiD3ETcI",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10100894",
"title": "C<sup>2</sup>IMUFS: Complementary and Consensus Learning-based Incomplete Multi-view Unsupervised Feature Selection",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10100894/1MhE5xz6Dy8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2021/0898/0/089800a823",
"title": "RMkNN and KNORA-IU: Combining Imbalanced Dynamic Selection Techniques for Credit Scoring",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2021/089800a823/1zw6gSZlfi0",
"parentPublication": {
"id": "proceedings/ictai/2021/0898/0",
"title": "2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1101",
"articleId": "13rRUwInvJ9",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1117",
"articleId": "13rRUygT7y1",
"__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": "17D45WWzW3c",
"doi": "10.1109/TVCG.2018.2865159",
"abstract": "This paper introduces dynamic composite physicalizations, a new class of physical visualizations that use collections of self-propelled objects to represent data. Dynamic composite physicalizations can be used both to give physical form to well-known interactive visualization techniques, and to explore new visualizations and interaction paradigms. We first propose a design space characterizing composite physicalizations based on previous work in the fields of Information Visualization and Human Computer Interaction. We illustrate dynamic composite physicalizations in two scenarios demonstrating potential benefits for collaboration and decision making, as well as new opportunities for physical interaction. We then describe our implementation using wheeled micro-robots capable of locating themselves and sensing user input, before discussing limitations and opportunities for future work.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper introduces dynamic composite physicalizations, a new class of physical visualizations that use collections of self-propelled objects to represent data. Dynamic composite physicalizations can be used both to give physical form to well-known interactive visualization techniques, and to explore new visualizations and interaction paradigms. We first propose a design space characterizing composite physicalizations based on previous work in the fields of Information Visualization and Human Computer Interaction. We illustrate dynamic composite physicalizations in two scenarios demonstrating potential benefits for collaboration and decision making, as well as new opportunities for physical interaction. We then describe our implementation using wheeled micro-robots capable of locating themselves and sensing user input, before discussing limitations and opportunities for future work.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper introduces dynamic composite physicalizations, a new class of physical visualizations that use collections of self-propelled objects to represent data. Dynamic composite physicalizations can be used both to give physical form to well-known interactive visualization techniques, and to explore new visualizations and interaction paradigms. We first propose a design space characterizing composite physicalizations based on previous work in the fields of Information Visualization and Human Computer Interaction. We illustrate dynamic composite physicalizations in two scenarios demonstrating potential benefits for collaboration and decision making, as well as new opportunities for physical interaction. We then describe our implementation using wheeled micro-robots capable of locating themselves and sensing user input, before discussing limitations and opportunities for future work.",
"title": "Dynamic Composite Data Physicalization Using Wheeled Micro-Robots",
"normalizedTitle": "Dynamic Composite Data Physicalization Using Wheeled Micro-Robots",
"fno": "08440836",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Human Computer Interaction",
"Microrobots",
"Mobile Robots",
"Dynamic Composite Data Physicalization",
"Wheeled Microrobots",
"Physical Visualizations",
"Interactive Visualization Techniques",
"Physical Interaction",
"Information Visualization",
"Human Computer Interaction",
"Decision Making",
"Data Visualization",
"Visualization",
"Two Dimensional Displays",
"Collaboration",
"Animation",
"Shape",
"Human Computer Interaction",
"Information Visualization",
"Data Physicalization",
"Tangible User Interfaces"
],
"authors": [
{
"givenName": "Mathieu",
"surname": "Le Goc",
"fullName": "Mathieu Le Goc",
"affiliation": "Stanford University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Charles",
"surname": "Perin",
"fullName": "Charles Perin",
"affiliation": "University of Victoria, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sean",
"surname": "Follmer",
"fullName": "Sean Follmer",
"affiliation": "Stanford University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean-Daniel",
"surname": "Fekete",
"fullName": "Jean-Daniel Fekete",
"affiliation": "INRIA, Saclay, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pierre",
"surname": "Dragicevic",
"fullName": "Pierre Dragicevic",
"affiliation": "INRIA, Saclay, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "737-747",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2016/01/07194845",
"title": "A Psychophysical Investigation of Size as a Physical Variable",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07194845/13rRUxBa5s0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539616",
"title": "HindSight: Encouraging Exploration through Direct Encoding of Personal Interaction History",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539616/13rRUyeTVi6",
"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/2022/10/09802784",
"title": "Visualization in Motion: A Research Agenda and Two Evaluations",
"doi": null,
"abstractUrl": "/journal/tg/2022/10/09802784/1Eo1xk9vKuI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09908523",
"title": "KiriPhys: Exploring New Data Physicalization Opportunities",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09908523/1HbapfvixQA",
"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": "mags/cg/2019/05/08809393",
"title": "An Emotional Response to the Value of Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2019/05/08809393/1cFV47pIeRy",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/04/09193986",
"title": "Touch and Beyond: Comparing Physical and Virtual Reality Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2022/04/09193986/1n0EpCxIH8Q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09225008",
"title": "Revisited: Comparison of Empirical Methods to Evaluate Visualizations Supporting Crafting and Assembly Purposes",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09225008/1nWJFACcD4I",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a001",
"title": "The Anatomical Edutainer",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a001/1qROLWUge9q",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08444077",
"articleId": "17D45WaTkdH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440830",
"articleId": "17D45WIXbOg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i3JXVkBOFi",
"name": "ttg201901-08440836s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440836s1.mp4",
"extension": "mp4",
"size": "143 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1qnQQML0BmE",
"title": "Jan.-Feb.",
"year": "2021",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "41",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1ndVAIKBPuU",
"doi": "10.1109/MCG.2020.3025078",
"abstract": "Physical engagement with data necessarily influences the reflective process. However, the role of interactivity and narration are often overlooked when designing and analyzing personal data physicalizations. We introduce Narrative Physicalizations, everyday objects modified to support nuanced self-reflection through embodied engagement with personal data. Narrative physicalizations borrow from narrative visualizations, storytelling with graphs, and engagement with mundane artifacts from data-objects. Our research uses a participatory approach to research-through-design and includes two interdependent studies. In the first, personalized data physicalizations are developed for three individuals. In the second, we conduct a parallel autobiographical exploration of what constitutes personal data when using a Fitbit. Our work expands the landscape of data physicalization by introducing narrative physicalizations. It suggests an experience-centric view on data physicalization where people engage physically with their data in playful ways, making their body an active agent during the reflective process.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Physical engagement with data necessarily influences the reflective process. However, the role of interactivity and narration are often overlooked when designing and analyzing personal data physicalizations. We introduce Narrative Physicalizations, everyday objects modified to support nuanced self-reflection through embodied engagement with personal data. Narrative physicalizations borrow from narrative visualizations, storytelling with graphs, and engagement with mundane artifacts from data-objects. Our research uses a participatory approach to research-through-design and includes two interdependent studies. In the first, personalized data physicalizations are developed for three individuals. In the second, we conduct a parallel autobiographical exploration of what constitutes personal data when using a Fitbit. Our work expands the landscape of data physicalization by introducing narrative physicalizations. It suggests an experience-centric view on data physicalization where people engage physically with their data in playful ways, making their body an active agent during the reflective process.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Physical engagement with data necessarily influences the reflective process. However, the role of interactivity and narration are often overlooked when designing and analyzing personal data physicalizations. We introduce Narrative Physicalizations, everyday objects modified to support nuanced self-reflection through embodied engagement with personal data. Narrative physicalizations borrow from narrative visualizations, storytelling with graphs, and engagement with mundane artifacts from data-objects. Our research uses a participatory approach to research-through-design and includes two interdependent studies. In the first, personalized data physicalizations are developed for three individuals. In the second, we conduct a parallel autobiographical exploration of what constitutes personal data when using a Fitbit. Our work expands the landscape of data physicalization by introducing narrative physicalizations. It suggests an experience-centric view on data physicalization where people engage physically with their data in playful ways, making their body an active agent during the reflective process.",
"title": "Narrative Physicalization: Supporting Interactive Engagement With Personal Data",
"normalizedTitle": "Narrative Physicalization: Supporting Interactive Engagement With Personal Data",
"fno": "09200790",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Handling",
"Interactive Systems",
"User Interfaces",
"Interactive Engagement",
"Physical Engagement",
"Reflective Process",
"Narrative Physicalizations",
"Embodied Engagement",
"Narrative Visualizations",
"Data Objects",
"Personalized Data Physicalizations",
"Data Physicalization",
"Fitbit",
"Reflection",
"Data Visualization",
"DNA",
"Physiology",
"Physical Design",
"Data Models",
"Data Physicalisation",
"Personal Data",
"Embodiment"
],
"authors": [
{
"givenName": "Maria",
"surname": "Karyda",
"fullName": "Maria Karyda",
"affiliation": "Department of DesignAalto University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Danielle",
"surname": "Wilde",
"fullName": "Danielle Wilde",
"affiliation": "University of Southern Denmark",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mette Gislev",
"surname": "Kjarsgaard",
"fullName": "Mette Gislev Kjarsgaard",
"affiliation": "University of Southern Denmark",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2021-01-01 00:00:00",
"pubType": "mags",
"pages": "74-86",
"year": "2021",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgames/2013/0820/0/06632611",
"title": "Examining the effects of avatar customization and narrative on engagement and learning in video games",
"doi": null,
"abstractUrl": "/proceedings-article/cgames/2013/06632611/12OmNC2fGwa",
"parentPublication": {
"id": "proceedings/cgames/2013/0820/0",
"title": "2013 18th International Conference on Computer Games: AI, Animation, Mobile, Interactive Multimedia, Educational & Serious Games (CGAMES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/collaboratecom/2014/043/0/07014582",
"title": "SideBar: Videoconferencing system supporting social engagement",
"doi": null,
"abstractUrl": "/proceedings-article/collaboratecom/2014/07014582/12OmNvkpljN",
"parentPublication": {
"id": "proceedings/collaboratecom/2014/043/0",
"title": "2014 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom)",
"__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": "trans/tg/2023/01/09908523",
"title": "KiriPhys: Exploring New Data Physicalization Opportunities",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09908523/1HbapfvixQA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2022/02/08822965",
"title": "On the Influence of Shot Scale on Film Mood and Narrative Engagement in Film Viewers",
"doi": null,
"abstractUrl": "/journal/ta/2022/02/08822965/1d1yNMygICY",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__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": "mags/cg/2020/06/09238588",
"title": "Data Physicalization",
"doi": null,
"abstractUrl": "/magazine/cg/2020/06/09238588/1oa1IW3TD6U",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/01/09325145",
"title": "Data Physicalization—Part II",
"doi": null,
"abstractUrl": "/magazine/cg/2021/01/09325145/1qnQUgYO8rC",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/06/09547792",
"title": "What Students Learn With Personal Data Physicalization",
"doi": null,
"abstractUrl": "/magazine/cg/2021/06/09547792/1x9TP3EpwJ2",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2021/3335/0/333500a181",
"title": "Narrative Sensemaking: Strategies for Narrative Maps Construction",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2021/333500a181/1yXuj3PJXRm",
"parentPublication": {
"id": "proceedings/vis/2021/3335/0",
"title": "2021 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09200769",
"articleId": "1ndVAUVnems",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09201339",
"articleId": "1niUC5QM0mc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyxXlpc",
"title": "Nov.-Dec.",
"year": "2020",
"issueNum": "06",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "40",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1niUCwuef7y",
"doi": "10.1109/MCG.2020.3025504",
"abstract": "In this pictorial, we present the design and making process of Data Badges as they were deployed during a one-week academic seminar. Data Badges are customizable physical conference badges that invite participants to make their own independent and personalized expressions of their academic profile by choosing and assembling a collection of predefined physical tokens on a flat wearable canvas. As our modular and intuitive design approach allows the construction to occur as a shared, collective activity, Data Badges take advantage of the creative, affective, and social values that underlie physicalization and its construction to engage participants in reflecting on personal data. Among other unexpected phenomena, we noticed how the freedom of assembly and interpretation encouraged a variety of appropriations, which expanded its intended representational space from fully representative to more resistive and provocative forms of data expression.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this pictorial, we present the design and making process of Data Badges as they were deployed during a one-week academic seminar. Data Badges are customizable physical conference badges that invite participants to make their own independent and personalized expressions of their academic profile by choosing and assembling a collection of predefined physical tokens on a flat wearable canvas. As our modular and intuitive design approach allows the construction to occur as a shared, collective activity, Data Badges take advantage of the creative, affective, and social values that underlie physicalization and its construction to engage participants in reflecting on personal data. Among other unexpected phenomena, we noticed how the freedom of assembly and interpretation encouraged a variety of appropriations, which expanded its intended representational space from fully representative to more resistive and provocative forms of data expression.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this pictorial, we present the design and making process of Data Badges as they were deployed during a one-week academic seminar. Data Badges are customizable physical conference badges that invite participants to make their own independent and personalized expressions of their academic profile by choosing and assembling a collection of predefined physical tokens on a flat wearable canvas. As our modular and intuitive design approach allows the construction to occur as a shared, collective activity, Data Badges take advantage of the creative, affective, and social values that underlie physicalization and its construction to engage participants in reflecting on personal data. Among other unexpected phenomena, we noticed how the freedom of assembly and interpretation encouraged a variety of appropriations, which expanded its intended representational space from fully representative to more resistive and provocative forms of data expression.",
"title": "Data Badges: Making an Academic Profile Through a DIY Wearable Physicalization",
"normalizedTitle": "Data Badges: Making an Academic Profile Through a DIY Wearable Physicalization",
"fno": "09201309",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Affective Computing",
"Data Analysis",
"Data Privacy",
"Educational Administrative Data Processing",
"Creative Value",
"Affective Value",
"Social Value",
"Data Badge Design Process",
"Data Badge Making Process",
"Predefined Physical Tokens",
"Customizable Physical Conference Badges",
"DIY Wearable Physicalization",
"Academic Profile",
"Data Expression",
"Personal Data",
"Data Visualization",
"Encoding",
"Cognition",
"Wires",
"Seminars",
"Image Color Analysis",
"Shape",
"Data Visualisation",
"Physicalisation",
"Physicalisation Construction",
"Data Humanism"
],
"authors": [
{
"givenName": "Georgia",
"surname": "Panagiotidou",
"fullName": "Georgia Panagiotidou",
"affiliation": "Research[x]Design, KU Leuven",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sinem",
"surname": "Görücü",
"fullName": "Sinem Görücü",
"affiliation": "Research[x]Design, KU Leuven",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrew",
"surname": "Vande Moere",
"fullName": "Andrew Vande Moere",
"affiliation": "Research[x]Design, KU Leuven",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2020-11-01 00:00:00",
"pubType": "mags",
"pages": "51-60",
"year": "2020",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cccm/2008/3290/1/3290a509",
"title": "Design and Implementation of Short Message Query System for Academic Office Based-On J2ME",
"doi": null,
"abstractUrl": "/proceedings-article/cccm/2008/3290a509/12OmNwwd2Q1",
"parentPublication": {
"id": "cccm/2008/3290/1",
"title": "Computing, Communication, Control and Management, ISECS International Colloquium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2018/1174/0/08659227",
"title": "Digital Badges for Motivating Introductory Programmers: Qualitative Findings from Focus Groups",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2018/08659227/18j8Zklopyg",
"parentPublication": {
"id": "proceedings/fie/2018/1174/0",
"title": "2018 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2019/3485/0/348500a158",
"title": "Academic Performance Analysis Supported by a Web-Based Visual Analytics Tool",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2019/348500a158/1cYi2u2hrhu",
"parentPublication": {
"id": "proceedings/icalt/2019/3485/2161-377X",
"title": "2019 IEEE 19th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2019/1746/0/09028554",
"title": "A Preliminary Study of How Undergraduate Engineering Students Describe Intelligence and Smartness",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2019/09028554/1iffoW7WA2k",
"parentPublication": {
"id": "proceedings/fie/2019/1746/0",
"title": "2019 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccia/2021/3933/0/393300a006",
"title": "Discovery of Object Concepts in Academic Field Based on Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/iccia/2021/393300a006/1zpzOqPXDlS",
"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": "09209080",
"articleId": "1nwbjDqNO7e",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09201404",
"articleId": "1niUCgmMC8o",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyxXlpc",
"title": "Nov.-Dec.",
"year": "2020",
"issueNum": "06",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "40",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1oa1IW3TD6U",
"doi": "10.1109/MCG.2020.3027223",
"abstract": "The articles in this special section focus on data physicalization. The practice of representing data in physical form has existed for thousands of years, yet it has only become an area of investigation and exploration for scientists, designers, and artists much more recently.3 Advances in areas such as digital fabrication, actuated tangible interfaces, and shape-changing displays have spurred an emerging area of research now called Data Physicalization.1 This Special Issue of IEEE Computer Graphics and Applications presents four articles spanning a wide breadth of current data physicalization research, from theory to practice.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The articles in this special section focus on data physicalization. The practice of representing data in physical form has existed for thousands of years, yet it has only become an area of investigation and exploration for scientists, designers, and artists much more recently.3 Advances in areas such as digital fabrication, actuated tangible interfaces, and shape-changing displays have spurred an emerging area of research now called Data Physicalization.1 This Special Issue of IEEE Computer Graphics and Applications presents four articles spanning a wide breadth of current data physicalization research, from theory to practice.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The articles in this special section focus on data physicalization. The practice of representing data in physical form has existed for thousands of years, yet it has only become an area of investigation and exploration for scientists, designers, and artists much more recently.3 Advances in areas such as digital fabrication, actuated tangible interfaces, and shape-changing displays have spurred an emerging area of research now called Data Physicalization.1 This Special Issue of IEEE Computer Graphics and Applications presents four articles spanning a wide breadth of current data physicalization research, from theory to practice.",
"title": "Data Physicalization",
"normalizedTitle": "Data Physicalization",
"fno": "09238588",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Special Issues And Sections",
"Data Visualization",
"Computer Science",
"Information Technology",
"Data Analysis"
],
"authors": [
{
"givenName": "Trevor",
"surname": "Hogan",
"fullName": "Trevor Hogan",
"affiliation": "Munster Technical University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Uta",
"surname": "Hinrichs",
"fullName": "Uta Hinrichs",
"affiliation": "University of St Andrews",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Samuel",
"surname": "Huron",
"fullName": "Samuel Huron",
"affiliation": "Design of Information Technologies, Social and Economical Science DepartmentTelecom Paris School, Polytechnique de Paris",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jason",
"surname": "Alexander",
"fullName": "Jason Alexander",
"affiliation": "Department of Computer ScienceUniversity of Bath",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yvonne",
"surname": "Jansen",
"fullName": "Yvonne Jansen",
"affiliation": "Sorbonne Université, CNRS, ISIR",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "06",
"pubDate": "2020-11-01 00:00:00",
"pubType": "mags",
"pages": "21-24",
"year": "2020",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/th/2012/01/tth2012010004",
"title": "Guest Editorial for Special Section on Consumer Electronics",
"doi": null,
"abstractUrl": "/journal/th/2012/01/tth2012010004/13rRUIJcWlw",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2014/04/mmi2014040004",
"title": "Big Data [Guest editors' introduction]",
"doi": null,
"abstractUrl": "/magazine/mi/2014/04/mmi2014040004/13rRUwI5UcK",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2013/06/ttd2013061062",
"title": "Guest Editors' Introduction: Special Issue on Cloud Computing",
"doi": null,
"abstractUrl": "/journal/td/2013/06/ttd2013061062/13rRUwInuWd",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/sp/2016/06/msp2016060007",
"title": "Building a Community of Real-World Cryptographers",
"doi": null,
"abstractUrl": "/magazine/sp/2016/06/msp2016060007/13rRUxly9cd",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/dt/2012/06/06497102",
"title": "Guest Editors' Introduction: Digitally Enhanced Wireless Transceivers",
"doi": null,
"abstractUrl": "/magazine/dt/2012/06/06497102/13rRUyeTVm8",
"parentPublication": {
"id": "mags/dt",
"title": "IEEE Design & Test of Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/an/2019/04/08903582",
"title": "From the Editor's Desk",
"doi": null,
"abstractUrl": "/magazine/an/2019/04/08903582/1f3LQon1a80",
"parentPublication": {
"id": "mags/an",
"title": "IEEE Annals of the History of Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2020/03/09034244",
"title": "Distributed Data Analysis and Reliable Operation of Cyberphysical Systems",
"doi": null,
"abstractUrl": "/magazine/co/2020/03/09034244/1i8zBqUo036",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/01/09325145",
"title": "Data Physicalization—Part II",
"doi": null,
"abstractUrl": "/magazine/cg/2021/01/09325145/1qnQUgYO8rC",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2021/02/09388781",
"title": "Best Papers From Hot Chips 32",
"doi": null,
"abstractUrl": "/magazine/mi/2021/02/09388781/1sn03kNnuRq",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/it/2021/02/09390430",
"title": "Introduction to SI",
"doi": null,
"abstractUrl": "/magazine/it/2021/02/09390430/1soTSJDC9C8",
"parentPublication": {
"id": "mags/it",
"title": "IT Professional",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09205611",
"articleId": "1nnSRMhXKMM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09198117",
"articleId": "1n8WRM3WCAg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zdLz0NqD7O",
"title": "Nov.-Dec.",
"year": "2021",
"issueNum": "06",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "41",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1x9TP3EpwJ2",
"doi": "10.1109/MCG.2021.3115417",
"abstract": "I describe the results of implementing a personal data physicalization assignment in an information visualization course for senior undergraduate and graduate students in computer science and software engineering. By collecting data about themselves and representing this data in physical forms, students were able to 1) learn about data visualization, 2) design creatively, and 3) learn about themselves. While data physicalization in education has been explored with nontechnical and novice audiences, the experience I report in this article provides evidence that data physicalization also has benefits for technical, visualization-savvy students.",
"abstracts": [
{
"abstractType": "Regular",
"content": "I describe the results of implementing a personal data physicalization assignment in an information visualization course for senior undergraduate and graduate students in computer science and software engineering. By collecting data about themselves and representing this data in physical forms, students were able to 1) learn about data visualization, 2) design creatively, and 3) learn about themselves. While data physicalization in education has been explored with nontechnical and novice audiences, the experience I report in this article provides evidence that data physicalization also has benefits for technical, visualization-savvy students.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "I describe the results of implementing a personal data physicalization assignment in an information visualization course for senior undergraduate and graduate students in computer science and software engineering. By collecting data about themselves and representing this data in physical forms, students were able to 1) learn about data visualization, 2) design creatively, and 3) learn about themselves. While data physicalization in education has been explored with nontechnical and novice audiences, the experience I report in this article provides evidence that data physicalization also has benefits for technical, visualization-savvy students.",
"title": "What Students Learn With Personal Data Physicalization",
"normalizedTitle": "What Students Learn With Personal Data Physicalization",
"fno": "09547792",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Computer Aided Instruction",
"Computer Science Education",
"Data Visualisation",
"Educational Courses",
"Software Engineering",
"Senior Undergraduate Students",
"Computer Science",
"Data Visualization",
"Visualization Savvy Students",
"Personal Data Physicalization Assignment",
"Information Visualization Course",
"Data Visualization",
"Data Collection",
"Visualization",
"Mood",
"Music",
"Education",
"Three Dimensional Displays"
],
"authors": [
{
"givenName": "Charles",
"surname": "Perin",
"fullName": "Charles Perin",
"affiliation": "University of Victoria, Victoria, BC, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2021-11-01 00:00:00",
"pubType": "mags",
"pages": "48-58",
"year": "2021",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icalt/2015/7334/0/7334a205",
"title": "Online Peer Learning: What Influences the Students' Learning Experience",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2015/7334a205/12OmNzTppDS",
"parentPublication": {
"id": "proceedings/icalt/2015/7334/0",
"title": "2015 IEEE 15th International Conference on Advanced Learning Technologies (ICALT)",
"__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": "trans/tg/2023/01/09908523",
"title": "KiriPhys: Exploring New Data Physicalization Opportunities",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09908523/1HbapfvixQA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis4good/2022/9421/0/942100a010",
"title": "Data Bricks Space Mission: Teaching Kids about Data with Physicalization",
"doi": null,
"abstractUrl": "/proceedings-article/vis4good/2022/942100a010/1J2YmdCyf6w",
"parentPublication": {
"id": "proceedings/vis4good/2022/9421/0",
"title": "2022 IEEE Workshop on Visualization for Social Good (VIS4Good)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2022/9007/0/900700a073",
"title": "A Flexible Pipeline to Create Different Types of Data Physicalizations",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2022/900700a073/1KaH4gYfBzG",
"parentPublication": {
"id": "proceedings/iv/2022/9007/0",
"title": "2022 26th International Conference Information Visualisation (IV)",
"__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": "mags/cg/2021/01/09200790",
"title": "Narrative Physicalization: Supporting Interactive Engagement With Personal Data",
"doi": null,
"abstractUrl": "/magazine/cg/2021/01/09200790/1ndVAIKBPuU",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09233460",
"title": "Chemicals in the Creek: designing a situated data physicalization of open government data with the community",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09233460/1o53gztMlC8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2020/06/09238588",
"title": "Data Physicalization",
"doi": null,
"abstractUrl": "/magazine/cg/2020/06/09238588/1oa1IW3TD6U",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csde/2020/1974/0/09411611",
"title": "Visualization of NAPLAN Data: What Do We Learn From?",
"doi": null,
"abstractUrl": "/proceedings-article/csde/2020/09411611/1taF8JF7sOY",
"parentPublication": {
"id": "proceedings/csde/2020/1974/0",
"title": "2020 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09547834",
"articleId": "1x9TPHRuq9G",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09547773",
"articleId": "1x9TPkOzHmU",
"__typename": "AdjacentArticleType"
},
"__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": "13rRUwgQpDv",
"doi": "10.1109/TVCG.2014.2346292",
"abstract": "The accessibility of infovis authoring tools to a wide audience has been identified as a major research challenge. A key task in the authoring process is the development of visual mappings. While the infovis community has long been deeply interested in finding effective visual mappings, comparatively little attention has been placed on how people construct visual mappings. In this paper, we present the results of a study designed to shed light on how people transform data into visual representations. We asked people to create, update and explain their own information visualizations using only tangible building blocks. We learned that all participants, most of whom had little experience in visualization authoring, were readily able to create and talk about their own visualizations. Based on our observations, we discuss participants' actions during the development of their visual representations and during their analytic activities. We conclude by suggesting implications for tool design to enable broader support for infovis authoring.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The accessibility of infovis authoring tools to a wide audience has been identified as a major research challenge. A key task in the authoring process is the development of visual mappings. While the infovis community has long been deeply interested in finding effective visual mappings, comparatively little attention has been placed on how people construct visual mappings. In this paper, we present the results of a study designed to shed light on how people transform data into visual representations. We asked people to create, update and explain their own information visualizations using only tangible building blocks. We learned that all participants, most of whom had little experience in visualization authoring, were readily able to create and talk about their own visualizations. Based on our observations, we discuss participants' actions during the development of their visual representations and during their analytic activities. We conclude by suggesting implications for tool design to enable broader support for infovis authoring.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The accessibility of infovis authoring tools to a wide audience has been identified as a major research challenge. A key task in the authoring process is the development of visual mappings. While the infovis community has long been deeply interested in finding effective visual mappings, comparatively little attention has been placed on how people construct visual mappings. In this paper, we present the results of a study designed to shed light on how people transform data into visual representations. We asked people to create, update and explain their own information visualizations using only tangible building blocks. We learned that all participants, most of whom had little experience in visualization authoring, were readily able to create and talk about their own visualizations. Based on our observations, we discuss participants' actions during the development of their visual representations and during their analytic activities. We conclude by suggesting implications for tool design to enable broader support for infovis authoring.",
"title": "Constructing Visual Representations: Investigating the Use of Tangible Tokens",
"normalizedTitle": "Constructing Visual Representations: Investigating the Use of Tangible Tokens",
"fno": "06875946",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Authoring Tools",
"Image Color Analysis",
"Encoding",
"Publishing",
"Context Awareness",
"Visual Analytics",
"Constructive Visualization",
"Physical Visualization",
"Dynamic Visualization",
"Empirical Study",
"Token",
"Visualization Authoring",
"Information Visualization",
"Visual Mapping",
"Novices",
"Visualization Construction"
],
"authors": [
{
"givenName": "Samuel",
"surname": "Huron",
"fullName": "Samuel Huron",
"affiliation": ", Inria and IRI",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yvonne",
"surname": "Jansen",
"fullName": "Yvonne Jansen",
"affiliation": ", Inria and University of Copenhagen",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sheelagh",
"surname": "Carpendale",
"fullName": "Sheelagh Carpendale",
"affiliation": ", University of Calgary",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2102-2111",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bdva/2015/7343/0/07314298",
"title": "Interactive Visual Analysis of Browsing and Authoring Behaviors in Web Media",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2015/07314298/12OmNy2rS3N",
"parentPublication": {
"id": "proceedings/bdva/2015/7343/0",
"title": "2015 Big Data Visual Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017638",
"title": "Assessing the Graphical Perception of Time and Speed on 2D+Time Trajectories",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017638/13rRUx0xPTV",
"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/07539327",
"title": "Visualization by Demonstration: An Interaction Paradigm for Visual Data Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539327/13rRUytWF9q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08454346",
"title": "Mapping Color to Meaning in Colormap Data Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08454346/17D45VsBU7I",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/05/09714045",
"title": "Do You Need Another Hand? Investigating Dual Body Representations During Anisomorphic 3D Manipulation",
"doi": null,
"abstractUrl": "/journal/tg/2022/05/09714045/1B0XYybHJjq",
"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/09905997",
"title": "Unifying Effects of Direct and Relational Associations for Visual Communication",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09905997/1H3ZWHY73by",
"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/2022/01/09552216",
"title": "Context Matters: A Theory of Semantic Discriminability for Perceptual Encoding Systems",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552216/1xic1HOWGli",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06876042",
"articleId": "13rRUwI5U2H",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06876039",
"articleId": "13rRUEgs2M4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFsm",
"name": "ttg201412-06875946s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201412-06875946s1.zip",
"extension": "zip",
"size": "1.88 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBqMDkL",
"title": "Aug.",
"year": "2020",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45Wuc367",
"doi": "10.1109/TVCG.2019.2892415",
"abstract": "Recent advances in mobile augmented reality (AR) techniques have shed new light on personal visualization for their advantages of fitting visualization within personal routines, situating visualization in a real-world context, and arousing users' interests. However, enabling non-experts to create data visualization in mobile AR environments is challenging given the lack of tools that allow in-situ design while supporting the binding of data to AR content. Most existing AR authoring tools require working on personal computers or manually creating each virtual object and modifying its visual attributes. We systematically study this issue by identifying the specificity of AR glyph-based visualization authoring tool and distill four design considerations. Following these design considerations, we design and implement MARVisT, a mobile authoring tool that leverages information from reality to assist non-experts in addressing relationships between data and virtual glyphs, real objects and virtual glyphs, and real objects and data. With MARVisT, users without visualization expertise can bind data to real-world objects to create expressive AR glyph-based visualizations rapidly and effortlessly, reshaping the representation of the real world with data. We use several examples to demonstrate the expressiveness of MARVisT. A user study with non-experts is also conducted to evaluate the authoring experience of MARVisT.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recent advances in mobile augmented reality (AR) techniques have shed new light on personal visualization for their advantages of fitting visualization within personal routines, situating visualization in a real-world context, and arousing users' interests. However, enabling non-experts to create data visualization in mobile AR environments is challenging given the lack of tools that allow in-situ design while supporting the binding of data to AR content. Most existing AR authoring tools require working on personal computers or manually creating each virtual object and modifying its visual attributes. We systematically study this issue by identifying the specificity of AR glyph-based visualization authoring tool and distill four design considerations. Following these design considerations, we design and implement MARVisT, a mobile authoring tool that leverages information from reality to assist non-experts in addressing relationships between data and virtual glyphs, real objects and virtual glyphs, and real objects and data. With MARVisT, users without visualization expertise can bind data to real-world objects to create expressive AR glyph-based visualizations rapidly and effortlessly, reshaping the representation of the real world with data. We use several examples to demonstrate the expressiveness of MARVisT. A user study with non-experts is also conducted to evaluate the authoring experience of MARVisT.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recent advances in mobile augmented reality (AR) techniques have shed new light on personal visualization for their advantages of fitting visualization within personal routines, situating visualization in a real-world context, and arousing users' interests. However, enabling non-experts to create data visualization in mobile AR environments is challenging given the lack of tools that allow in-situ design while supporting the binding of data to AR content. Most existing AR authoring tools require working on personal computers or manually creating each virtual object and modifying its visual attributes. We systematically study this issue by identifying the specificity of AR glyph-based visualization authoring tool and distill four design considerations. Following these design considerations, we design and implement MARVisT, a mobile authoring tool that leverages information from reality to assist non-experts in addressing relationships between data and virtual glyphs, real objects and virtual glyphs, and real objects and data. With MARVisT, users without visualization expertise can bind data to real-world objects to create expressive AR glyph-based visualizations rapidly and effortlessly, reshaping the representation of the real world with data. We use several examples to demonstrate the expressiveness of MARVisT. A user study with non-experts is also conducted to evaluate the authoring experience of MARVisT.",
"title": "MARVisT: Authoring Glyph-Based Visualization in Mobile Augmented Reality",
"normalizedTitle": "MARVisT: Authoring Glyph-Based Visualization in Mobile Augmented Reality",
"fno": "08611113",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Augmented Reality",
"Authoring Systems",
"Data Visualisation",
"Mobile Computing",
"MAR Vis T",
"Authoring Glyph Based Visualization",
"Mobile Augmented Reality Techniques",
"Personal Visualization",
"Personal Routines",
"Data Visualization",
"Mobile AR Environments",
"In Situ Design",
"Personal Computers",
"Virtual Object",
"Visual Attributes",
"Mobile Authoring Tool",
"Virtual Glyphs",
"Real World Objects",
"AR Glyph Based Visualization Authoring Tool",
"Data Visualization",
"Authoring Systems",
"Mobile Handsets",
"Tools",
"Visualization",
"Augmented Reality",
"Three Dimensional Displays",
"Personal Visualization",
"Augmented Reality",
"Mobile Interactions",
"Authoring Tool"
],
"authors": [
{
"givenName": "Zhutian",
"surname": "Chen",
"fullName": "Zhutian Chen",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yijia",
"surname": "Su",
"fullName": "Yijia Su",
"affiliation": "Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yifang",
"surname": "Wang",
"fullName": "Yifang Wang",
"affiliation": "Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qianwen",
"surname": "Wang",
"fullName": "Qianwen Wang",
"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"
},
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, Hangzhou, P.R. China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2020-08-01 00:00:00",
"pubType": "trans",
"pages": "2645-2658",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icsc/2016/0662/0/0662a358",
"title": "Mobile Augmented Reality Authoring Tool",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2016/0662a358/12OmNAXglVC",
"parentPublication": {
"id": "proceedings/icsc/2016/0662/0",
"title": "2016 IEEE Tenth International Conference on Semantic Computing (ICSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isuvr/2010/4124/0/4124a040",
"title": "ARtalet: Tangible User Interface Based Immersive Augmented Reality Authoring Tool for Digilog Book",
"doi": null,
"abstractUrl": "/proceedings-article/isuvr/2010/4124a040/12OmNrEL2B8",
"parentPublication": {
"id": "proceedings/isuvr/2010/4124/0",
"title": "International Symposium on Ubiquitous Virtual Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2002/1781/0/17810237",
"title": "A Pragmatic Approach to Augmented Reality Authoring",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2002/17810237/12OmNxV4iuj",
"parentPublication": {
"id": "proceedings/ismar/2002/1781/0",
"title": "Proceedings. International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isuvr/2010/4124/0/4124a016",
"title": "Context-Aware Augmented Reality Authoring Tool in Digital Ecosystem",
"doi": null,
"abstractUrl": "/proceedings-article/isuvr/2010/4124a016/12OmNyjccBb",
"parentPublication": {
"id": "proceedings/isuvr/2010/4124/0",
"title": "International Symposium on Ubiquitous Virtual Reality",
"__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": "mags/cg/2017/02/mcg2017020031",
"title": "Glyph Visualization: A Fail-Safe Design Scheme Based on Quasi-Hamming Distances",
"doi": null,
"abstractUrl": "/magazine/cg/2017/02/mcg2017020031/13rRUxjyX9G",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2022/7177/0/717700b292",
"title": "Quality-Aware Real-Time Augmented Reality Visualization under Delay Constraints",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2022/717700b292/1HriR086Tra",
"parentPublication": {
"id": "proceedings/icdcs/2022/7177/0",
"title": "2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798148",
"title": "CAVE-AR: A VR Authoring System to Interactively Design, Simulate, and Debug Multi-user AR Experiences",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798148/1cJ0FRS6rjG",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08797973",
"title": "A Comparison of Desktop and Augmented Reality Scenario Based Training Authoring Tools",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797973/1cJ0S2MS49O",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2021/1298/0/129800a324",
"title": "Towards In-situ Authoring of AR Visualizations with Mobile Devices",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2021/129800a324/1yeQJrGq6WI",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2021/1298/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08611181",
"articleId": "17D45WHONjM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08611145",
"articleId": "17D45XDIXSX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1l5icgQzJFS",
"name": "ttg202008-08611113s1-appendix.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202008-08611113s1-appendix.pdf",
"extension": "pdf",
"size": "6.46 MB",
"__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": "1x9TL0bvSlq",
"doi": "10.1109/TVCG.2021.3114211",
"abstract": "Visual data storytelling is gaining importance as a means of presenting data-driven information or analysis results, especially to the general public. This has resulted in design principles being proposed for data-driven storytelling, and new authoring tools being created to aid such storytelling. However, data analysts typically lack sufficient background in design and storytelling to make effective use of these principles and authoring tools. To assist this process, we present <italic>ChartStory</italic> for crafting data stories from a collection of user-created charts, using a style akin to comic panels to imply the underlying sequence and logic of data-driven narratives. Our approach is to operationalize established design principles into an advanced pipeline that characterizes charts by their properties and similarities to each other, and recommends ways to partition, layout, and caption story pieces to serve a narrative. ChartStory also augments this pipeline with intuitive user interactions for visual refinement of generated data comics. We extensively and holistically evaluate ChartStory via a trio of studies. We first assess how the tool supports data comic <italic>creation</italic> in comparison to a manual baseline tool. Data comics from this study are subsequently compared and evaluated to ChartStory’s automated recommendations by a team of narrative visualization practitioners. This is followed by a pair of interview studies with data scientists using their own datasets and charts who provide an additional assessment of the system. We find that ChartStory provides cogent recommendations for narrative generation, resulting in data comics that compare favorably to manually-created ones.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visual data storytelling is gaining importance as a means of presenting data-driven information or analysis results, especially to the general public. This has resulted in design principles being proposed for data-driven storytelling, and new authoring tools being created to aid such storytelling. However, data analysts typically lack sufficient background in design and storytelling to make effective use of these principles and authoring tools. To assist this process, we present <italic>ChartStory</italic> for crafting data stories from a collection of user-created charts, using a style akin to comic panels to imply the underlying sequence and logic of data-driven narratives. Our approach is to operationalize established design principles into an advanced pipeline that characterizes charts by their properties and similarities to each other, and recommends ways to partition, layout, and caption story pieces to serve a narrative. ChartStory also augments this pipeline with intuitive user interactions for visual refinement of generated data comics. We extensively and holistically evaluate ChartStory via a trio of studies. We first assess how the tool supports data comic <italic>creation</italic> in comparison to a manual baseline tool. Data comics from this study are subsequently compared and evaluated to ChartStory’s automated recommendations by a team of narrative visualization practitioners. This is followed by a pair of interview studies with data scientists using their own datasets and charts who provide an additional assessment of the system. We find that ChartStory provides cogent recommendations for narrative generation, resulting in data comics that compare favorably to manually-created ones.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visual data storytelling is gaining importance as a means of presenting data-driven information or analysis results, especially to the general public. This has resulted in design principles being proposed for data-driven storytelling, and new authoring tools being created to aid such storytelling. However, data analysts typically lack sufficient background in design and storytelling to make effective use of these principles and authoring tools. To assist this process, we present ChartStory for crafting data stories from a collection of user-created charts, using a style akin to comic panels to imply the underlying sequence and logic of data-driven narratives. Our approach is to operationalize established design principles into an advanced pipeline that characterizes charts by their properties and similarities to each other, and recommends ways to partition, layout, and caption story pieces to serve a narrative. ChartStory also augments this pipeline with intuitive user interactions for visual refinement of generated data comics. We extensively and holistically evaluate ChartStory via a trio of studies. We first assess how the tool supports data comic creation in comparison to a manual baseline tool. Data comics from this study are subsequently compared and evaluated to ChartStory’s automated recommendations by a team of narrative visualization practitioners. This is followed by a pair of interview studies with data scientists using their own datasets and charts who provide an additional assessment of the system. We find that ChartStory provides cogent recommendations for narrative generation, resulting in data comics that compare favorably to manually-created ones.",
"title": "ChartStory: Automated Partitioning, Layout, and Captioning of Charts into Comic-Style Narratives",
"normalizedTitle": "ChartStory: Automated Partitioning, Layout, and Captioning of Charts into Comic-Style Narratives",
"fno": "09547737",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Authoring Systems",
"Data Analysis",
"Data Visualisation",
"Humanities",
"Interactive Systems",
"Patient Monitoring",
"Software Tools",
"User Interfaces",
"Authoring Tools",
"Automated Partitioning",
"Caption Story Pieces",
"Chart Storys Automated Recommendations",
"Comic Panels",
"Comic Style Narratives",
"Data Analysts",
"Data Scientists",
"Data Stories",
"Data Driven Information",
"Data Driven Narratives",
"Data Driven Storytelling",
"Established Design Principles",
"General Public",
"Generated Data Comics",
"Intuitive User Interactions",
"Logic",
"Manual Baseline Tool",
"Manually Created Ones",
"Narrative Generation",
"Narrative Visualization Practitioners",
"Underlying Sequence",
"User Created Charts",
"Visual Data Storytelling",
"Visual Refinement",
"Layout",
"Data Visualization",
"Visualization",
"Tools",
"Pipelines",
"Authoring Systems",
"Annotations",
"Data Story Generation",
"Narrative Visualization",
"Data Driven Storytelling",
"Data Comics"
],
"authors": [
{
"givenName": "Jian",
"surname": "Zhao",
"fullName": "Jian Zhao",
"affiliation": "University of Waterloo, Waterloo, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shenyu",
"surname": "Xu",
"fullName": "Shenyu Xu",
"affiliation": "Georgia Institute of Technology, Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Senthil",
"surname": "Chandrasegaran",
"fullName": "Senthil Chandrasegaran",
"affiliation": "Technische Universiteit Delft, Delft, CD, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chris",
"surname": "Bryan",
"fullName": "Chris Bryan",
"affiliation": "Arizona State University, Phoenix, AZ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fan",
"surname": "Du",
"fullName": "Fan Du",
"affiliation": "Adobe Research, San Jose, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aditi",
"surname": "Mishra",
"fullName": "Aditi Mishra",
"affiliation": "Arizona State University, Phoenix, AZ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xin",
"surname": "Qian",
"fullName": "Xin Qian",
"affiliation": "University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yiran",
"surname": "Li",
"fullName": "Yiran Li",
"affiliation": "University of California, Davis, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kwan-Liu",
"surname": "Ma",
"fullName": "Kwan-Liu Ma",
"affiliation": "University of California, Davis, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "1384-1399",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2017/0457/0/0457g478",
"title": "The Amazing Mysteries of the Gutter: Drawing Inferences Between Panels in Comic Book Narratives",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457g478/12OmNx19k23",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__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/2018/01/08017584",
"title": "Visualizing Nonlinear Narratives with Story Curves",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017584/13rRUyueghe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aivr/2018/9269/0/926900a100",
"title": "A Two-Level Planning Framework for Mixed Reality Interactive Narratives with User Engagement",
"doi": null,
"abstractUrl": "/proceedings-article/aivr/2018/926900a100/17D45Xh13v2",
"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/2023/06/09695173",
"title": "Roslingifier: Semi-Automated Storytelling for Animated Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2023/06/09695173/1AvqJqAJOKY",
"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": "mags/cg/5555/01/10107759",
"title": "The Stories We Tell About Data: Surveying Data-Driven Storytelling Using Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/5555/01/10107759/1MDGmTM8oOA",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aivr/2019/5604/0/560400a102",
"title": "A Live Storytelling Virtual Reality System with Programmable Cartoon-Style Emotion Embodiment",
"doi": null,
"abstractUrl": "/proceedings-article/aivr/2019/560400a102/1grOlrH5hdK",
"parentPublication": {
"id": "proceedings/aivr/2019/5604/0",
"title": "2019 IEEE International Conference on Artificial Intelligence and Virtual Reality (AIVR)",
"__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/2022/01/09552591",
"title": "Interactive Data Comics",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552591/1xibWdHwteo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09547845",
"articleId": "1x9TLh9tiow",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09551755",
"articleId": "1xgx3sOEUXS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Jv6sHnWMoM",
"name": "ttg202302-09547737s1-supp1-3114211.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202302-09547737s1-supp1-3114211.mp4",
"extension": "mp4",
"size": "24.8 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1Ax5KStiZmU",
"title": "March",
"year": "2022",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1mXkglIVFVS",
"doi": "10.1109/TVCG.2020.3022480",
"abstract": "In monochrome-color dual-lens systems, the monochrome camera can capture images with higher quality than the color camera. To obtain high quality color images, a better approach is to colorize the gray images from the monochrome camera with the color images from the color camera serving as a reference. In addition, the colorization may fail in some cases, which makes the estimation of the colorization quality a necessary step before outputting the colorization result. To solve these problems, we propose a deep convolutional network based framework. 1) In the colorization module, the proposed colorization CNN uses deep feature representations, attention operation, 3-D regulation and color correction to make use of colors of multiple pixels in the reference image for colorizing each pixel in the input gray image. 2) In the colorization quality estimation module, based on the symmetry property of colorization, we propose to utilize the colorization CNN again to colorize the gray map of the original reference color image using the first-time colorization result from the colorization module as reference. Then, the quality loss of the second-time colorization result can be used for estimating the colorization quality. Experimental results show that our method can largely outperform the state-of-the-art colorization methods and estimate the colorization quality accurately as well.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In monochrome-color dual-lens systems, the monochrome camera can capture images with higher quality than the color camera. To obtain high quality color images, a better approach is to colorize the gray images from the monochrome camera with the color images from the color camera serving as a reference. In addition, the colorization may fail in some cases, which makes the estimation of the colorization quality a necessary step before outputting the colorization result. To solve these problems, we propose a deep convolutional network based framework. 1) In the colorization module, the proposed colorization CNN uses deep feature representations, attention operation, 3-D regulation and color correction to make use of colors of multiple pixels in the reference image for colorizing each pixel in the input gray image. 2) In the colorization quality estimation module, based on the symmetry property of colorization, we propose to utilize the colorization CNN again to colorize the gray map of the original reference color image using the first-time colorization result from the colorization module as reference. Then, the quality loss of the second-time colorization result can be used for estimating the colorization quality. Experimental results show that our method can largely outperform the state-of-the-art colorization methods and estimate the colorization quality accurately as well.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In monochrome-color dual-lens systems, the monochrome camera can capture images with higher quality than the color camera. To obtain high quality color images, a better approach is to colorize the gray images from the monochrome camera with the color images from the color camera serving as a reference. In addition, the colorization may fail in some cases, which makes the estimation of the colorization quality a necessary step before outputting the colorization result. To solve these problems, we propose a deep convolutional network based framework. 1) In the colorization module, the proposed colorization CNN uses deep feature representations, attention operation, 3-D regulation and color correction to make use of colors of multiple pixels in the reference image for colorizing each pixel in the input gray image. 2) In the colorization quality estimation module, based on the symmetry property of colorization, we propose to utilize the colorization CNN again to colorize the gray map of the original reference color image using the first-time colorization result from the colorization module as reference. Then, the quality loss of the second-time colorization result can be used for estimating the colorization quality. Experimental results show that our method can largely outperform the state-of-the-art colorization methods and estimate the colorization quality accurately as well.",
"title": "A Colorization Framework for Monochrome-Color Dual-Lens Systems Using a Deep Convolutional Network",
"normalizedTitle": "A Colorization Framework for Monochrome-Color Dual-Lens Systems Using a Deep Convolutional Network",
"fno": "09188002",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Cameras",
"Feature Extraction",
"Image Colour Analysis",
"High Quality Color Images",
"Gray Images",
"Monochrome Camera",
"Color Camera",
"Deep Convolutional Network Based Framework",
"Colorization Module",
"Colorization CNN",
"Color Correction",
"Reference Image",
"Input Gray Image",
"Colorization Quality Estimation Module",
"Original Reference Color Image",
"First Time Colorization Result",
"Second Time Colorization Result",
"State Of The Art Colorization Methods",
"Colorization Framework",
"Monochrome Color Dual Lens Systems",
"Image Color Analysis",
"Color",
"Estimation",
"Cameras",
"Feature Extraction",
"Lenses",
"Training",
"Colorization CNN",
"Weight Volume",
"Color Correction",
"Colorization Quality Estimation"
],
"authors": [
{
"givenName": "Xuan",
"surname": "Dong",
"fullName": "Xuan Dong",
"affiliation": "School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weixin",
"surname": "Li",
"fullName": "Weixin Li",
"affiliation": "Beijing Advanced Innovation Center for Big Data and Brain Computing, Beihang University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoyan",
"surname": "Hu",
"fullName": "Xiaoyan Hu",
"affiliation": "School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaojie",
"surname": "Wang",
"fullName": "Xiaojie Wang",
"affiliation": "School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yunhong",
"surname": "Wang",
"fullName": "Yunhong Wang",
"affiliation": "Beijing Advanced Innovation Center for Big Data and Brain Computing, Beihang University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2022-03-01 00:00:00",
"pubType": "trans",
"pages": "1469-1485",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icig/2013/5050/0/5050a089",
"title": "An Interactive Framework for Video Colorization",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2013/5050a089/12OmNBLdKIJ",
"parentPublication": {
"id": "proceedings/icig/2013/5050/0",
"title": "2013 Seventh International Conference on Image and Graphics (ICIG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391a415",
"title": "Deep Colorization",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391a415/12OmNBNM93v",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2006/2521/3/252130685",
"title": "Simple and Efficient Colorization in YCbCr Color Space",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2006/252130685/12OmNBRsVvi",
"parentPublication": {
"id": "proceedings/icpr/2006/2521/3",
"title": "2006 18th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460810",
"title": "Patch-based image colorization",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460810/12OmNBigFy1",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2012/4829/0/4829a032",
"title": "Colorization by Multidimensional Projection",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2012/4829a032/12OmNBsLPdX",
"parentPublication": {
"id": "proceedings/sibgrapi/2012/4829/0",
"title": "2012 25th SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/07780812",
"title": "Stereo Matching with Color and Monochrome Cameras in Low-Light Conditions",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/07780812/12OmNyRxFGp",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391a567",
"title": "Learning Large-Scale Automatic Image Colorization",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391a567/12OmNzgwmSr",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904484",
"title": "Self-Supervised Color-Concept Association via Image Colorization",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904484/1H1ggMqzJUQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800h965",
"title": "Instance-Aware Image Colorization",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800h965/1m3nNZyhYXe",
"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/icme/2021/3864/0/09428402",
"title": "Asymmetric Stereo Color Transfer",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2021/09428402/1uilObHsUb6",
"parentPublication": {
"id": "proceedings/icme/2021/3864/0",
"title": "2021 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09184129",
"articleId": "1mLI01i7J6g",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09173765",
"articleId": "1mts9gNKec0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAXPyfw",
"title": "July-Sept.",
"year": "2016",
"issueNum": "03",
"idPrefix": "pc",
"pubType": "magazine",
"volume": "15",
"label": "July-Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy3xY5u",
"doi": "10.1109/MPRV.2016.49",
"abstract": "The deployment of pervasive displays in classrooms of children with severe autism is challenging. In this article, the authors explore the use of pervasive displays in special-education classrooms to help children with autism better reflect on their behaviors. They designed and developed three pervasive displays, each one varying its visualization in relation to targeted behaviors and the reinforcement mechanism used. BxColor mimics traditional practices by varying the color of \"tags.\" BxPuzzle reinforces positive behavior by varying the clarity of puzzle pieces. BxBalloons penalizes negative behavior by deflating virtual aircrafts piloted by children. Each display was deployed in one classroom of children with severe autism for three weeks. The results indicate that BxColor was too abstract to be understood by participants. In contrast, both BxPuzzle and BxBalloons were instrumental in increasing behavior awareness, triggering social interactions, and promoting teamwork. This article is part of a special issue on pervasive displays.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The deployment of pervasive displays in classrooms of children with severe autism is challenging. In this article, the authors explore the use of pervasive displays in special-education classrooms to help children with autism better reflect on their behaviors. They designed and developed three pervasive displays, each one varying its visualization in relation to targeted behaviors and the reinforcement mechanism used. BxColor mimics traditional practices by varying the color of \"tags.\" BxPuzzle reinforces positive behavior by varying the clarity of puzzle pieces. BxBalloons penalizes negative behavior by deflating virtual aircrafts piloted by children. Each display was deployed in one classroom of children with severe autism for three weeks. The results indicate that BxColor was too abstract to be understood by participants. In contrast, both BxPuzzle and BxBalloons were instrumental in increasing behavior awareness, triggering social interactions, and promoting teamwork. This article is part of a special issue on pervasive displays.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The deployment of pervasive displays in classrooms of children with severe autism is challenging. In this article, the authors explore the use of pervasive displays in special-education classrooms to help children with autism better reflect on their behaviors. They designed and developed three pervasive displays, each one varying its visualization in relation to targeted behaviors and the reinforcement mechanism used. BxColor mimics traditional practices by varying the color of \"tags.\" BxPuzzle reinforces positive behavior by varying the clarity of puzzle pieces. BxBalloons penalizes negative behavior by deflating virtual aircrafts piloted by children. Each display was deployed in one classroom of children with severe autism for three weeks. The results indicate that BxColor was too abstract to be understood by participants. In contrast, both BxPuzzle and BxBalloons were instrumental in increasing behavior awareness, triggering social interactions, and promoting teamwork. This article is part of a special issue on pervasive displays.",
"title": "Pervasive Displays in Classrooms of Children with Severe Autism",
"normalizedTitle": "Pervasive Displays in Classrooms of Children with Severe Autism",
"fno": "mpc2016030048",
"hasPdf": true,
"idPrefix": "pc",
"keywords": [
"Autism",
"Visualization",
"Pervasive Computing",
"Prototypes",
"Human Computer Interaction",
"Pediatrics",
"Graphics",
"Pervasive Displays",
"Behavior Awareness",
"Autism",
"Pervasive Computing",
"Healthcare",
"Education"
],
"authors": [
{
"givenName": "Monica",
"surname": "Tentori",
"fullName": "Monica Tentori",
"affiliation": "Center for Scientific Research and Higher Education, Mexico",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lizbeth",
"surname": "Escobedo",
"fullName": "Lizbeth Escobedo",
"affiliation": "National Technological of Mexico",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Carlos",
"surname": "Hernandez",
"fullName": "Carlos Hernandez",
"affiliation": "Center for Scientific Research and Higher Education, Mexico",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aleksandar",
"surname": "Matic",
"fullName": "Aleksandar Matic",
"affiliation": "Telefonica Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gillian R.",
"surname": "Hayes",
"fullName": "Gillian R. Hayes",
"affiliation": "University of California, Irvine",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2016-07-01 00:00:00",
"pubType": "mags",
"pages": "48-57",
"year": "2016",
"issn": "1536-1268",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iciev/2016/1269/0/07760073",
"title": "Autism Barta — A smart device based automated autism screening tool for Bangladesh",
"doi": null,
"abstractUrl": "/proceedings-article/iciev/2016/07760073/12OmNAlNiL1",
"parentPublication": {
"id": "proceedings/iciev/2016/1269/0",
"title": "2016 International Conference on Informatics, Electronics and Vision (ICIEV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbsc/2012/4890/0/4890a053",
"title": "Music Spectrum: A Collaborative Immersion Musical System for Children with Autism",
"doi": null,
"abstractUrl": "/proceedings-article/sbsc/2012/4890a053/12OmNvqmUB3",
"parentPublication": {
"id": "proceedings/sbsc/2012/4890/0",
"title": "Sistemas Colaborativos, Simpósio Brasilerio de",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2012/1353/0/06462271",
"title": "Work in progress: Using smart mobile tools to enhance autism therapy for children",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2012/06462271/12OmNwlHSVj",
"parentPublication": {
"id": "proceedings/fie/2012/1353/0",
"title": "2012 Frontiers in Education Conference Proceedings",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/digitel/2008/3409/0/3409a070",
"title": "Evaluation the Efficacy of Computer - Based Training Using Tangible User Interface for Low-Function Children with Autism",
"doi": null,
"abstractUrl": "/proceedings-article/digitel/2008/3409a070/12OmNyGtjre",
"parentPublication": {
"id": "proceedings/digitel/2008/3409/0",
"title": "Digital Game and Intelligent Toy Enhanced Learning, IEEE International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/achi/2009/3529/0/3529a205",
"title": "From Isolation to Communication: A Case Study Evaluation of Robot Assisted Play for Children with Autism with a Minimally Expressive Humanoid Robot",
"doi": null,
"abstractUrl": "/proceedings-article/achi/2009/3529a205/12OmNyeECE3",
"parentPublication": {
"id": "proceedings/achi/2009/3529/0",
"title": "International Conference on Advances in Computer-Human Interaction",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ict4m/2016/4521/0/4521a047",
"title": "A Review for Future Research and Practice in Using Computer Assisted Instruction on Vocabulary Learning among Children with Autism Spectrum Disorder",
"doi": null,
"abstractUrl": "/proceedings-article/ict4m/2016/4521a047/12OmNzR8CxN",
"parentPublication": {
"id": "proceedings/ict4m/2016/4521/0",
"title": "2016 6th International Conference on Information and Communication Technology for The Muslim World (ICT4M)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eitt/2017/0629/0/0629a106",
"title": "Assessment of Children with Autism Based on Computer Games Compared with PEP Scale",
"doi": null,
"abstractUrl": "/proceedings-article/eitt/2017/0629a106/12OmNzl3WZT",
"parentPublication": {
"id": "proceedings/eitt/2017/0629/0",
"title": "2017 International Conference of Educational Innovation through Technology (EITT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2012/4736/0/4736a368",
"title": "WorldTour: Towards an Adaptive Software to Support Children with Autism in Tour Planning",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2012/4736a368/12OmNzmcllL",
"parentPublication": {
"id": "proceedings/compsac/2012/4736/0",
"title": "2012 IEEE 36th Annual Computer Software and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/pc/2007/01/b1028",
"title": "Pervasive Computing and Autism: Assisting Caregivers of Children with Special Needs",
"doi": null,
"abstractUrl": "/magazine/pc/2007/01/b1028/13rRUx0gest",
"parentPublication": {
"id": "mags/pc",
"title": "IEEE Pervasive Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/pc/2015/02/mpc2015020042",
"title": "A Smart Environment for Children with Autism",
"doi": null,
"abstractUrl": "/magazine/pc/2015/02/mpc2015020042/13rRUxDItex",
"parentPublication": {
"id": "mags/pc",
"title": "IEEE Pervasive Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mpc2016030040",
"articleId": "13rRUxASuD8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mpc2016030058",
"articleId": "13rRUxBa5kW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvDI3IP",
"title": "Jan.-March",
"year": "2017",
"issueNum": "01",
"idPrefix": "ec",
"pubType": "journal",
"volume": "5",
"label": "Jan.-March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwI5Uc3",
"doi": "10.1109/TETC.2015.2504241",
"abstract": "In a world where students are increasing digitally tethered to powerful, always on mobile devices, new models of engagement and approaches to teaching and learning are required from educators. Serious games (SGs) have proved to have instructional potential, but there is still a lack of methodologies and tools not only for their design but also to support the game analysis and assessment. This paper explores the use of SG to increase student engagement and retention. The development phase of the Circuit Warz game is presented to demonstrate how electronic engineering education can radically be reimagined to create immersive, highly engaging learning experiences that are problem-centered and pedagogically sound. The learning mechanics-game mechanics framework for the SG game analysis is introduced and its practical use in an educational game design scenario is shown as a case study.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In a world where students are increasing digitally tethered to powerful, always on mobile devices, new models of engagement and approaches to teaching and learning are required from educators. Serious games (SGs) have proved to have instructional potential, but there is still a lack of methodologies and tools not only for their design but also to support the game analysis and assessment. This paper explores the use of SG to increase student engagement and retention. The development phase of the Circuit Warz game is presented to demonstrate how electronic engineering education can radically be reimagined to create immersive, highly engaging learning experiences that are problem-centered and pedagogically sound. The learning mechanics-game mechanics framework for the SG game analysis is introduced and its practical use in an educational game design scenario is shown as a case study.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In a world where students are increasing digitally tethered to powerful, always on mobile devices, new models of engagement and approaches to teaching and learning are required from educators. Serious games (SGs) have proved to have instructional potential, but there is still a lack of methodologies and tools not only for their design but also to support the game analysis and assessment. This paper explores the use of SG to increase student engagement and retention. The development phase of the Circuit Warz game is presented to demonstrate how electronic engineering education can radically be reimagined to create immersive, highly engaging learning experiences that are problem-centered and pedagogically sound. The learning mechanics-game mechanics framework for the SG game analysis is introduced and its practical use in an educational game design scenario is shown as a case study.",
"title": "Mapping Learning and Game Mechanics for Serious Games Analysis in Engineering Education",
"normalizedTitle": "Mapping Learning and Game Mechanics for Serious Games Analysis in Engineering Education",
"fno": "07347407",
"hasPdf": true,
"idPrefix": "ec",
"keywords": [
"Computer Aided Instruction",
"Electronic Engineering Computing",
"Electronic Engineering Education",
"Serious Games Computing",
"Teaching",
"Mobile Devices",
"Teaching",
"Instructional Potential",
"Student Engagement",
"Student Retention",
"Circuit Warz Game",
"Electronic Engineering Education",
"Learning Experiences",
"Problem Centered Learning Experiences",
"Learning Mechanics Game Mechanics Framework",
"SG Game Analysis",
"Educational Game Design",
"Serious Game Assessment",
"Games",
"Circuit Theory",
"Integrated Circuit Modeling",
"Oscillators",
"Tutorials",
"Electrical Engineering",
"Engineering Education",
"Learning Mechanics Game Mechanics LM GM Model",
"Game Based Learning"
],
"authors": [
{
"givenName": "Michael",
"surname": "Callaghan",
"fullName": "Michael Callaghan",
"affiliation": "School of Computing and Intelligent Systems, Ulster University, Derry, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Maggi",
"surname": "Savin-Baden",
"fullName": "Maggi Savin-Baden",
"affiliation": "School of Computing and Intelligent Systems, Ulster University, Derry, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Niall",
"surname": "McShane",
"fullName": "Niall McShane",
"affiliation": "School of Computing and Intelligent Systems, Ulster University, Derry, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Augusto Gómez",
"surname": "Eguíluz",
"fullName": "Augusto Gómez Eguíluz",
"affiliation": "School of Computing and Intelligent Systems, Ulster University, Derry, U.K.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "77-83",
"year": "2017",
"issn": "2168-6750",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/segah/2014/4823/0/07067091",
"title": "Gaming to master the game - Game usability and game mechanics",
"doi": null,
"abstractUrl": "/proceedings-article/segah/2014/07067091/12OmNAndix0",
"parentPublication": {
"id": "proceedings/segah/2014/4823/0",
"title": "2014 IEEE 3rd International Conference on Serious Games and Applications for Health (SeGAH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vs-games/2016/2722/0/07590348",
"title": "Evidence-Based Mapping between the Theory of Multiple Intelligences and Game Mechanics for the Purpose of Player-Centered Serious Game Design",
"doi": null,
"abstractUrl": "/proceedings-article/vs-games/2016/07590348/12OmNBaBuR3",
"parentPublication": {
"id": "proceedings/vs-games/2016/2722/0",
"title": "2016 8th International Conference on Games and Virtual Worlds for Serious Applications (VS-Games)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2018/6049/0/604901a119",
"title": "Learning Objects in Instructional Serious Game Design",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2018/604901a119/12OmNC8uRpy",
"parentPublication": {
"id": "proceedings/icalt/2018/6049/0",
"title": "2018 IEEE 18th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vs-games/2016/2722/0/07590337",
"title": "Analysis of Game and Learning Mechanics According to the Learning Theories",
"doi": null,
"abstractUrl": "/proceedings-article/vs-games/2016/07590337/12OmNqN6R1t",
"parentPublication": {
"id": "proceedings/vs-games/2016/2722/0",
"title": "2016 8th International Conference on Games and Virtual Worlds for Serious Applications (VS-Games)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2017/1710/0/1710a193",
"title": "Ecoepidemiological Simulation as a Serious Game Engine Module",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2017/1710a193/12OmNxdVgKx",
"parentPublication": {
"id": "proceedings/cbms/2017/1710/0",
"title": "2017 IEEE 30th International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2017/3588/0/3588a227",
"title": "Augmented Reality and Serious Games: A Systematic Literature Mapping",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2017/3588a227/12OmNyQGS43",
"parentPublication": {
"id": "proceedings/svr/2017/3588/0",
"title": "2017 19th Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2013/5009/0/5009a299",
"title": "On Effective Integration of Educational Content in Serious Games: Text vs. Game Mechanics",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2013/5009a299/12OmNzZEArO",
"parentPublication": {
"id": "proceedings/icalt/2013/5009/0",
"title": "2013 IEEE 13th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cso/2012/1365/0/06274802",
"title": "A New Approach of Mechanics Simulation Based on Game Engine",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2012/06274802/12OmNzvQHY7",
"parentPublication": {
"id": "proceedings/cso/2012/1365/0",
"title": "2012 Fifth International Joint Conference on Computational Sciences and Optimization (CSO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2015/7367/0/7367a626",
"title": "A Field Application to Vet a Serious Game toward Learning Objectives",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2015/7367a626/12OmNzwHvhN",
"parentPublication": {
"id": "proceedings/hicss/2015/7367/0",
"title": "2015 48th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/lt/2017/04/07782404",
"title": "Let Them Play: The Impact of Mechanics and Dynamics of a Serious Game on Student Perceptions of Learning Engagement",
"doi": null,
"abstractUrl": "/journal/lt/2017/04/07782404/13rRUynpT9I",
"parentPublication": {
"id": "trans/lt",
"title": "IEEE Transactions on Learning Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07404245",
"articleId": "13rRUB7a17i",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07586041",
"articleId": "13rRUwwsly2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"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": "13rRUNvgz4o",
"doi": "10.1109/TVCG.2017.2744018",
"abstract": "Conventional dot plots use a constant dot size and are typically applied to show the frequency distribution of small data sets. Unfortunately, they are not designed for a high dynamic range of frequencies. We address this problem by introducing nonlinear dot plots. Adopting the idea of nonlinear scaling from logarithmic bar charts, our plots allow for dots of varying size so that columns with a large number of samples are reduced in height. For the construction of these diagrams, we introduce an efficient two-way sweep algorithm that leads to a dense and symmetrical layout. We compensate aliasing artifacts at high dot densities by a specifically designed low-pass filtering method. Examples of nonlinear dot plots are compared to conventional dot plots as well as linear and logarithmic histograms. Finally, we include feedback from an expert review.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Conventional dot plots use a constant dot size and are typically applied to show the frequency distribution of small data sets. Unfortunately, they are not designed for a high dynamic range of frequencies. We address this problem by introducing nonlinear dot plots. Adopting the idea of nonlinear scaling from logarithmic bar charts, our plots allow for dots of varying size so that columns with a large number of samples are reduced in height. For the construction of these diagrams, we introduce an efficient two-way sweep algorithm that leads to a dense and symmetrical layout. We compensate aliasing artifacts at high dot densities by a specifically designed low-pass filtering method. Examples of nonlinear dot plots are compared to conventional dot plots as well as linear and logarithmic histograms. Finally, we include feedback from an expert review.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Conventional dot plots use a constant dot size and are typically applied to show the frequency distribution of small data sets. Unfortunately, they are not designed for a high dynamic range of frequencies. We address this problem by introducing nonlinear dot plots. Adopting the idea of nonlinear scaling from logarithmic bar charts, our plots allow for dots of varying size so that columns with a large number of samples are reduced in height. For the construction of these diagrams, we introduce an efficient two-way sweep algorithm that leads to a dense and symmetrical layout. We compensate aliasing artifacts at high dot densities by a specifically designed low-pass filtering method. Examples of nonlinear dot plots are compared to conventional dot plots as well as linear and logarithmic histograms. Finally, we include feedback from an expert review.",
"title": "Nonlinear Dot Plots",
"normalizedTitle": "Nonlinear Dot Plots",
"fno": "08017644",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Histograms",
"Data Visualization",
"Layout",
"Dynamic Range",
"Bars",
"Rendering Computer Graphics",
"Algorithm Design And Analysis",
"Nonlinear Dot Plot",
"Statistical Graphics",
"Sweep Algorithm",
"Layout"
],
"authors": [
{
"givenName": "Nils",
"surname": "Rodrigues",
"fullName": "Nils Rodrigues",
"affiliation": "VISUS, University of Stuttgart, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Weiskopf",
"fullName": "Daniel Weiskopf",
"affiliation": "VISUS, University of Stuttgart, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "616-625",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2011/0039/0/05759433",
"title": "Random dot markers",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2011/05759433/12OmNAZOJUM",
"parentPublication": {
"id": "proceedings/vr/2011/0039/0",
"title": "2011 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2005/2488/0/24880159",
"title": "Dot Plots for Time Series Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2005/24880159/12OmNqzu6OG",
"parentPublication": {
"id": "proceedings/ictai/2005/2488/0",
"title": "17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1995/7310/3/73103117",
"title": "Halftoning by multiscale dot distribution",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1995/73103117/12OmNrHSD4u",
"parentPublication": {
"id": "proceedings/icip/1995/7310/3",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2010/4360/0/4360a451",
"title": "VFD Dot-Matrix Display Control Module GU160X32-800B and Its Application",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2010/4360a451/12OmNwCsdKR",
"parentPublication": {
"id": "proceedings/isise/2010/4360/0",
"title": "2010 Third International Symposium on Information Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1990/2062/1/00118226",
"title": "Dot image matching using local affine transformation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1990/00118226/12OmNxEBz4j",
"parentPublication": {
"id": "proceedings/icpr/1990/2062/1",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"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": "proceedings/iih-msp/2008/3278/0/3278a323",
"title": "A Study of Information Hiding Performance Using Simple Dot Pattern with Different Tile Sizes",
"doi": null,
"abstractUrl": "/proceedings-article/iih-msp/2008/3278a323/12OmNzTYBYl",
"parentPublication": {
"id": "proceedings/iih-msp/2008/3278/0",
"title": "2008 Fourth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nanoarch/2012/1671/0/06464141",
"title": "A conventional design for CLB implementation of a FPGA in Quantum-dot Cellular Automata (QCA)",
"doi": null,
"abstractUrl": "/proceedings-article/nanoarch/2012/06464141/12OmNzmLxRh",
"parentPublication": {
"id": "proceedings/nanoarch/2012/1671/0",
"title": "2012 IEEE/ACM International Symposium on Nanoscale Architectures (NANOARCH 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/services/2009/3708/0/3708a740",
"title": "Composite Service Selection Based on Dot Pattern Mining",
"doi": null,
"abstractUrl": "/proceedings-article/services/2009/3708a740/12OmNzxgHEw",
"parentPublication": {
"id": "proceedings/services/2009/3708/0",
"title": "2009 Congress on Services - I",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904443",
"title": "Relaxed Dot Plots: Faithful Visualization of Samples and Their Distribution",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904443/1H1gjXXGG2s",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08017621",
"articleId": "13rRUxD9gXN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08017609",
"articleId": "13rRUwbaqUT",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgON",
"name": "ttg201801-08017644s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201801-08017644s1.zip",
"extension": "zip",
"size": "16.4 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxEjY43",
"title": "July",
"year": "2019",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASupE",
"doi": "10.1109/TVCG.2018.2841385",
"abstract": "Temporal data visualization is used to analyze dependent variables that vary over time, with time being an independent variable. Visualizing temporal data is inherently difficult, due to the many aspects that need to be communicated to the users (e.g., time and variable changes). This is an important topic in visualization, and a wide range of visualization techniques dealing with different tasks have already been designed. In this paper we propose popup-plots, a novel concept where the common interaction of 3D rotation is used to navigate through the data. This allows the users to view the data from different perspectives without having to learn and adapt to new interaction concepts. Popup-plots are therefore a novel method for visualizing and interacting with dependent variables over time. We extend 2D plots with the temporal information by bending the space according to the time. The bending is calculated based on a spherical coordinates approach, which is continuously influenced by the viewing direction towards the plot. Hence, the plot can be viewed from various angles with seamless transitions in between, offering the possibility to analyze different aspects of the represented data. As the current viewing direction is inherently depicted by the shape of the data, the users are able to deduce which part of the data is currently viewed. The temporal information is encoded into the visualization itself, resembling annual rings of a tree. We demonstrate our method by applying it to data from two different domains, comprising measurements at spatial positions over time, and we also evaluated the usability of our solution.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Temporal data visualization is used to analyze dependent variables that vary over time, with time being an independent variable. Visualizing temporal data is inherently difficult, due to the many aspects that need to be communicated to the users (e.g., time and variable changes). This is an important topic in visualization, and a wide range of visualization techniques dealing with different tasks have already been designed. In this paper we propose popup-plots, a novel concept where the common interaction of 3D rotation is used to navigate through the data. This allows the users to view the data from different perspectives without having to learn and adapt to new interaction concepts. Popup-plots are therefore a novel method for visualizing and interacting with dependent variables over time. We extend 2D plots with the temporal information by bending the space according to the time. The bending is calculated based on a spherical coordinates approach, which is continuously influenced by the viewing direction towards the plot. Hence, the plot can be viewed from various angles with seamless transitions in between, offering the possibility to analyze different aspects of the represented data. As the current viewing direction is inherently depicted by the shape of the data, the users are able to deduce which part of the data is currently viewed. The temporal information is encoded into the visualization itself, resembling annual rings of a tree. We demonstrate our method by applying it to data from two different domains, comprising measurements at spatial positions over time, and we also evaluated the usability of our solution.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Temporal data visualization is used to analyze dependent variables that vary over time, with time being an independent variable. Visualizing temporal data is inherently difficult, due to the many aspects that need to be communicated to the users (e.g., time and variable changes). This is an important topic in visualization, and a wide range of visualization techniques dealing with different tasks have already been designed. In this paper we propose popup-plots, a novel concept where the common interaction of 3D rotation is used to navigate through the data. This allows the users to view the data from different perspectives without having to learn and adapt to new interaction concepts. Popup-plots are therefore a novel method for visualizing and interacting with dependent variables over time. We extend 2D plots with the temporal information by bending the space according to the time. The bending is calculated based on a spherical coordinates approach, which is continuously influenced by the viewing direction towards the plot. Hence, the plot can be viewed from various angles with seamless transitions in between, offering the possibility to analyze different aspects of the represented data. As the current viewing direction is inherently depicted by the shape of the data, the users are able to deduce which part of the data is currently viewed. The temporal information is encoded into the visualization itself, resembling annual rings of a tree. We demonstrate our method by applying it to data from two different domains, comprising measurements at spatial positions over time, and we also evaluated the usability of our solution.",
"title": "Popup-Plots: Warping Temporal Data Visualization",
"normalizedTitle": "Popup-Plots: Warping Temporal Data Visualization",
"fno": "08368315",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Popup Plots",
"Temporal Data Visualization",
"Dependent Variables",
"Interaction Concepts",
"3 D Rotation",
"Spherical Coordinates",
"Data Visualization",
"Three Dimensional Displays",
"Two Dimensional Displays",
"Temperature Measurement",
"Time Measurement",
"Layout",
"Temporal Data",
"Time Dependent Visualization",
"3 D Plots",
"Ellipsoidal Coordinate System"
],
"authors": [
{
"givenName": "Johanna",
"surname": "Schmidt",
"fullName": "Johanna Schmidt",
"affiliation": "AIT Austrian Institute of Technology, Vienna, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dominik",
"surname": "Fleischmann",
"fullName": "Dominik Fleischmann",
"affiliation": "Stanford University, Stanford, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bernhard",
"surname": "Preim",
"fullName": "Bernhard Preim",
"affiliation": "Otto-von-Guericke University, Magdeburg, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Norbert",
"surname": "Brändle",
"fullName": "Norbert Brändle",
"affiliation": "AIT Austrian Institute of Technology, Vienna, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gabriel",
"surname": "Mistelbauer",
"fullName": "Gabriel Mistelbauer",
"affiliation": "Otto-von-Guericke University, Magdeburg, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2019-07-01 00:00:00",
"pubType": "trans",
"pages": "2443-2457",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2017/0831/0/0831a078",
"title": "A Scatterplots Selection Technique for Multi-dimensional Data Visualization Combining with Parallel Coordinate Plots",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2017/0831a078/12OmNARRYtP",
"parentPublication": {
"id": "proceedings/iv/2017/0831/0",
"title": "2017 21st International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a185",
"title": "Embedding Temporal Display into Maps for Occlusion-Free Visualization of Spatio-temporal Data",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a185/12OmNzGlREz",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/1997/8147/0/81470590",
"title": "Plots of Narratives over Temporal Databases",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/1997/81470590/12OmNzcxZ9k",
"parentPublication": {
"id": "proceedings/dexa/1997/8147/0",
"title": "Database and Expert Systems Applications. 8th International Conference, DEXA '97. Proceedings",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192673",
"title": "Temporal MDS Plots for Analysis of Multivariate Data",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192673/13rRUx0gefm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539342",
"title": "Time-Hierarchical Clustering and Visualization of Weather Forecast Ensembles",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539342/13rRUxYIN4d",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2002/03/c3090",
"title": "Geographic Statistics Visualization: Web-Based Linked Micromap Plots",
"doi": null,
"abstractUrl": "/magazine/cs/2002/03/c3090/13rRUy3gn1j",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07194852",
"title": "Effective Visualization of Temporal Ensembles",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07194852/13rRUy3xY8c",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08258329",
"title": "Optimal viewpoint finding for 3D visualization of spatio-temporal vehicle trajectories on caution crossroads detected from vehicle recorder big data",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08258329/17D45VsBTUM",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2020/9429/0/942900a146",
"title": "Exploring Visual Attention and Machine Learning in 3D Visualization of Medical Temporal Data",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2020/942900a146/1mLMlIp5G92",
"parentPublication": {
"id": "proceedings/cbms/2020/9429/0",
"title": "2020 IEEE 33rd International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a236",
"title": "Integrated Spatio-temporal Storyline Visualization with Low Crossover",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a236/1rSR7y0mRfW",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08361045",
"articleId": "13rRUIM2VBN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08355684",
"articleId": "13rRUygT7sM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1awf8maHO4U",
"name": "ttg201907-08368315s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201907-08368315s1.zip",
"extension": "zip",
"size": "22.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvH7fgc",
"title": "April",
"year": "2018",
"issueNum": "04",
"idPrefix": "tk",
"pubType": "journal",
"volume": "30",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwhpBOr",
"doi": "10.1109/TKDE.2017.2777851",
"abstract": "Finding the shortest path in road networks becomes one of important issues in location based services (LBS). The problem of finding the optimal meeting point for a group of users has also been well studied in existing works. In this paper, we investigate a new problem for two users. Each user has his/her own source and destination. However, whether to meet before going to their destinations is with some uncertainty. We model it as minimum path pair (<italic> MPP</italic>) query, which consists of two pairs of source and destination and a user-specified weight <inline-formula> <tex-math notation=\"LaTeX\">Z_$\\alpha$_Z</tex-math></inline-formula> to balance the two different needs. The result is a pair of paths connecting the two sources and destinations respectively, with minimal overall cost of the two paths and the shortest route between them. To solve <italic>MPP</italic> queries, we devise algorithms by enumerating node pairs. We adopt a location-based pruning strategy to reduce the number of node pairs for enumeration. An efficient algorithm based on point-to-point shortest path calculation is proposed to further improve query efficiency. We also give two fast approximate algorithms with approximation bounds. Extensive experiments are conducted to show the effectiveness and efficiency of our methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Finding the shortest path in road networks becomes one of important issues in location based services (LBS). The problem of finding the optimal meeting point for a group of users has also been well studied in existing works. In this paper, we investigate a new problem for two users. Each user has his/her own source and destination. However, whether to meet before going to their destinations is with some uncertainty. We model it as minimum path pair (<italic> MPP</italic>) query, which consists of two pairs of source and destination and a user-specified weight <inline-formula> <tex-math notation=\"LaTeX\">$\\alpha$</tex-math><alternatives><inline-graphic xlink:href=\"shang-ieq1-2777851.gif\"/> </alternatives></inline-formula> to balance the two different needs. The result is a pair of paths connecting the two sources and destinations respectively, with minimal overall cost of the two paths and the shortest route between them. To solve <italic>MPP</italic> queries, we devise algorithms by enumerating node pairs. We adopt a location-based pruning strategy to reduce the number of node pairs for enumeration. An efficient algorithm based on point-to-point shortest path calculation is proposed to further improve query efficiency. We also give two fast approximate algorithms with approximation bounds. Extensive experiments are conducted to show the effectiveness and efficiency of our methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Finding the shortest path in road networks becomes one of important issues in location based services (LBS). The problem of finding the optimal meeting point for a group of users has also been well studied in existing works. In this paper, we investigate a new problem for two users. Each user has his/her own source and destination. However, whether to meet before going to their destinations is with some uncertainty. We model it as minimum path pair ( MPP) query, which consists of two pairs of source and destination and a user-specified weight - to balance the two different needs. The result is a pair of paths connecting the two sources and destinations respectively, with minimal overall cost of the two paths and the shortest route between them. To solve MPP queries, we devise algorithms by enumerating node pairs. We adopt a location-based pruning strategy to reduce the number of node pairs for enumeration. An efficient algorithm based on point-to-point shortest path calculation is proposed to further improve query efficiency. We also give two fast approximate algorithms with approximation bounds. Extensive experiments are conducted to show the effectiveness and efficiency of our methods.",
"title": "To Meet or Not to Meet: Finding the Shortest Paths in Road Networks",
"normalizedTitle": "To Meet or Not to Meet: Finding the Shortest Paths in Road Networks",
"fno": "08120025",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Approximation Algorithms",
"Roads",
"Bridges",
"Uncertainty",
"Shortest Path Problem",
"Companies",
"Steiner Trees",
"Shortest Paths",
"Meeting Requirement",
"Algorithms"
],
"authors": [
{
"givenName": "Weihuang",
"surname": "Huang",
"fullName": "Weihuang Huang",
"affiliation": "Chinese University of Hong Kong, Shatin, Hong Kong, NT, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yikai",
"surname": "Zhang",
"fullName": "Yikai Zhang",
"affiliation": "Chinese University of Hong Kong, Shatin, Hong Kong, NT, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zechao",
"surname": "Shang",
"fullName": "Zechao Shang",
"affiliation": "University of Chicago, Chicago, IL",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeffrey Xu",
"surname": "Yu",
"fullName": "Jeffrey Xu Yu",
"affiliation": "Chinese University of Hong Kong, Shatin, Hong Kong, NT, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2018-04-01 00:00:00",
"pubType": "trans",
"pages": "772-785",
"year": "2018",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/focs/1989/1982/0/063517",
"title": "Using cellular graph embeddings in solving all pairs shortest paths problems",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1989/063517/12OmNBghtvb",
"parentPublication": {
"id": "proceedings/focs/1989/1982/0",
"title": "30th Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/2010/4244/0/4244a663",
"title": "All-Pairs Shortest Paths in O(n²) Time with High Probability",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2010/4244a663/12OmNCd2rpc",
"parentPublication": {
"id": "proceedings/focs/2010/4244/0",
"title": "2010 IEEE 51st Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2003/1988/0/19880665",
"title": "Simultaneous Finding the Shortest Paths and Distances in Directed Graphs Using Associative Parallel Processors",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2003/19880665/12OmNCm7BIw",
"parentPublication": {
"id": "proceedings/iv/2003/1988/0",
"title": "Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2010/4307/0/4307a299",
"title": "Broadcasting Algorithm Via Shortest Paths",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2010/4307a299/12OmNrJ11FQ",
"parentPublication": {
"id": "proceedings/icpads/2010/4307/0",
"title": "Parallel and Distributed Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1991/2445/0/0185419",
"title": "Finding the hidden path: time bounds for all-pairs shortest paths",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1991/0185419/12OmNvlPkFO",
"parentPublication": {
"id": "proceedings/focs/1991/2445/0",
"title": "[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa/2008/3471/0/3471a284",
"title": "A Task Parallel Algorithm for Computing the Costs of All-Pairs Shortest Paths on the CUDA-Compatible GPU",
"doi": null,
"abstractUrl": "/proceedings-article/ispa/2008/3471a284/12OmNxbW4O2",
"parentPublication": {
"id": "proceedings/ispa/2008/3471/0",
"title": "2008 IEEE International Symposium on Parallel and Distributed Processing with Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1987/03/01676904",
"title": "Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles",
"doi": null,
"abstractUrl": "/journal/tc/1987/03/01676904/13rRUNvya8e",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2006/06/t0686",
"title": "An Efficient Dynamic Algorithm for Maintaining All-Pairs Shortest Paths in Stochastic Networks",
"doi": null,
"abstractUrl": "/journal/tc/2006/06/t0686/13rRUygBwh3",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ifip-networking/2017/94/0/08264825",
"title": "Packing strictly-shortest paths in a tree for QoS-aware routing",
"doi": null,
"abstractUrl": "/proceedings-article/ifip-networking/2017/08264825/17D45Xq6dB9",
"parentPublication": {
"id": "proceedings/ifip-networking/2017/94/0",
"title": "2017 IFIP Networking Conference (IFIP Networking) and Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2019/1246/0/124600a023",
"title": "Distributed Weighted All Pairs Shortest Paths Through Pipelining",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2019/124600a023/1cYhQmTGSKA",
"parentPublication": {
"id": "proceedings/ipdps/2019/1246/0",
"title": "2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08118111",
"articleId": "13rRUwInvtg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08125189",
"articleId": "13rRUB6Sq0W",
"__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": "1xic0JWIDfy",
"doi": "10.1109/TVCG.2021.3114793",
"abstract": "Zero-shot classification is a promising paradigm to solve an applicable problem when the training classes and test classes are disjoint. Achieving this usually needs experts to externalize their domain knowledge by manually specifying a class-attribute matrix to define which classes have which attributes. Designing a suitable class-attribute matrix is the key to the subsequent procedure, but this design process is tedious and trial-and-error with no guidance. This paper proposes a visual explainable active learning approach with its design and implementation called semantic navigator to solve the above problems. This approach promotes human-AI teaming with four actions (ask, explain, recommend, respond) in each interaction loop. The machine asks contrastive questions to guide humans in the thinking process of attributes. A novel visualization called semantic map explains the current status of the machine. Therefore analysts can better understand why the machine misclassifies objects. Moreover, the machine recommends the labels of classes for each attribute to ease the labeling burden. Finally, humans can steer the model by modifying the labels interactively, and the machine adjusts its recommendations. The visual explainable active learning approach improves humans' efficiency of building zero-shot classification models interactively, compared with the method without guidance. We justify our results with user studies using the standard benchmarks for zero-shot classification.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Zero-shot classification is a promising paradigm to solve an applicable problem when the training classes and test classes are disjoint. Achieving this usually needs experts to externalize their domain knowledge by manually specifying a class-attribute matrix to define which classes have which attributes. Designing a suitable class-attribute matrix is the key to the subsequent procedure, but this design process is tedious and trial-and-error with no guidance. This paper proposes a visual explainable active learning approach with its design and implementation called semantic navigator to solve the above problems. This approach promotes human-AI teaming with four actions (ask, explain, recommend, respond) in each interaction loop. The machine asks contrastive questions to guide humans in the thinking process of attributes. A novel visualization called semantic map explains the current status of the machine. Therefore analysts can better understand why the machine misclassifies objects. Moreover, the machine recommends the labels of classes for each attribute to ease the labeling burden. Finally, humans can steer the model by modifying the labels interactively, and the machine adjusts its recommendations. The visual explainable active learning approach improves humans' efficiency of building zero-shot classification models interactively, compared with the method without guidance. We justify our results with user studies using the standard benchmarks for zero-shot classification.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Zero-shot classification is a promising paradigm to solve an applicable problem when the training classes and test classes are disjoint. Achieving this usually needs experts to externalize their domain knowledge by manually specifying a class-attribute matrix to define which classes have which attributes. Designing a suitable class-attribute matrix is the key to the subsequent procedure, but this design process is tedious and trial-and-error with no guidance. This paper proposes a visual explainable active learning approach with its design and implementation called semantic navigator to solve the above problems. This approach promotes human-AI teaming with four actions (ask, explain, recommend, respond) in each interaction loop. The machine asks contrastive questions to guide humans in the thinking process of attributes. A novel visualization called semantic map explains the current status of the machine. Therefore analysts can better understand why the machine misclassifies objects. Moreover, the machine recommends the labels of classes for each attribute to ease the labeling burden. Finally, humans can steer the model by modifying the labels interactively, and the machine adjusts its recommendations. The visual explainable active learning approach improves humans' efficiency of building zero-shot classification models interactively, compared with the method without guidance. We justify our results with user studies using the standard benchmarks for zero-shot classification.",
"title": "Towards Visual Explainable Active Learning for Zero-Shot Classification",
"normalizedTitle": "Towards Visual Explainable Active Learning for Zero-Shot Classification",
"fno": "09552842",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Image Classification",
"Image Representation",
"Learning Artificial Intelligence",
"Pattern Classification",
"Visual Databases",
"Visual Explainable Active Learning Approach",
"Human AI Teaming",
"Zero Shot Classification Models",
"Applicable Problem",
"Training Classes",
"Test Classes",
"Suitable Class Attribute Matrix",
"Design Process",
"Semantics",
"Labeling",
"Training",
"Visual Analytics",
"Testing",
"Task Analysis",
"Navigation",
"Active Learning",
"Explainable Artificial Intelligence",
"Human AI Teaming",
"Mixed Initiative Visual Analytics"
],
"authors": [
{
"givenName": "Shichao",
"surname": "Jia",
"fullName": "Shichao Jia",
"affiliation": "College of Intelligence and Computing, Tianjin University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zeyu",
"surname": "Li",
"fullName": "Zeyu Li",
"affiliation": "College of Intelligence and Computing, Tianjin University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nuo",
"surname": "Chen",
"fullName": "Nuo Chen",
"affiliation": "College of Intelligence and Computing, Tianjin University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiawan",
"surname": "Zhang",
"fullName": "Jiawan Zhang",
"affiliation": "College of Intelligence and Computing, Tianjin University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "791-801",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2016/8851/0/8851a059",
"title": "Multi-cue Zero-Shot Learning with Strong Supervision",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851a059/12OmNBcAGKE",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118c441",
"title": "COSTA: Co-Occurrence Statistics for Zero-Shot Classification",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118c441/12OmNqGA50v",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/08237715",
"title": "Learning Discriminative Latent Attributes for Zero-Shot Classification",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/08237715/12OmNy6qfNL",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2014/03/ttp2014030453",
"title": "Attribute-Based Classification for Zero-Shot Visual Object Categorization",
"doi": null,
"abstractUrl": "/journal/tp/2014/03/ttp2014030453/13rRUILtJsd",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000h670",
"title": "Zero-Shot Kernel Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000h670/17D45WwsQ8j",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545869",
"title": "Hard Zero Shot Learning for Gesture Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545869/17D45Xh13t4",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09681230",
"title": "Towards Zero-Shot Sign Language Recognition",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09681230/1A8c6K0vAnm",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2022/8739/0/873900d930",
"title": "Zero-shot Learning Using Multimodal Descriptions",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2022/873900d930/1G56OtiHKUg",
"parentPublication": {
"id": "proceedings/cvprw/2022/8739/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300f783",
"title": "Creativity Inspired Zero-Shot Learning",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300f783/1hVlAFirKeY",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a251",
"title": "Visually Analyzing and Steering Zero Shot Learning",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a251/1qRNQGu8try",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552218",
"articleId": "1xic3hb4Hle",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552921",
"articleId": "1xic8w3ygrm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1KJsBx9E7uM",
"title": "April",
"year": "2023",
"issueNum": "04",
"idPrefix": "td",
"pubType": "journal",
"volume": "34",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1KnSuhIoNAA",
"doi": "10.1109/TPDS.2023.3240767",
"abstract": "Federated Learning (FL), allowing data owners to conduct model training without sending their raw data to third-party servers, can enhance data privacy in Mobile Edge Computing (MEC) which brings data processing closer to the data sources. However, the heterogeneity of local data and constrained local resources in MEC bring new challenges hindering the development of FL. To this end, we propose an Auction-based Cluster Federated Learning scheme, called ACFL, comprising a clustered FL framework and an auction-based client selection strategy. Our clustered FL framework first introduces a mean-shift clustering algorithm to FL, which can intelligently cluster clients according to their local data distribution. Then, we select clients from each cluster using an auction mechanism to participate in FL training, which can mitigate the impact of data heterogeneity on model convergence and balance energy consumption. Moreover, we prove the proposed clustered FL framework converges at a sublinear rate. Extensive experiments conducted on real-world datasets demonstrate that the proposed FL scheme outperforms the conventional FL schemes in terms of convergence rate and energy balance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Federated Learning (FL), allowing data owners to conduct model training without sending their raw data to third-party servers, can enhance data privacy in Mobile Edge Computing (MEC) which brings data processing closer to the data sources. However, the heterogeneity of local data and constrained local resources in MEC bring new challenges hindering the development of FL. To this end, we propose an Auction-based Cluster Federated Learning scheme, called ACFL, comprising a clustered FL framework and an auction-based client selection strategy. Our clustered FL framework first introduces a mean-shift clustering algorithm to FL, which can intelligently cluster clients according to their local data distribution. Then, we select clients from each cluster using an auction mechanism to participate in FL training, which can mitigate the impact of data heterogeneity on model convergence and balance energy consumption. Moreover, we prove the proposed clustered FL framework converges at a sublinear rate. Extensive experiments conducted on real-world datasets demonstrate that the proposed FL scheme outperforms the conventional FL schemes in terms of convergence rate and energy balance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Federated Learning (FL), allowing data owners to conduct model training without sending their raw data to third-party servers, can enhance data privacy in Mobile Edge Computing (MEC) which brings data processing closer to the data sources. However, the heterogeneity of local data and constrained local resources in MEC bring new challenges hindering the development of FL. To this end, we propose an Auction-based Cluster Federated Learning scheme, called ACFL, comprising a clustered FL framework and an auction-based client selection strategy. Our clustered FL framework first introduces a mean-shift clustering algorithm to FL, which can intelligently cluster clients according to their local data distribution. Then, we select clients from each cluster using an auction mechanism to participate in FL training, which can mitigate the impact of data heterogeneity on model convergence and balance energy consumption. Moreover, we prove the proposed clustered FL framework converges at a sublinear rate. Extensive experiments conducted on real-world datasets demonstrate that the proposed FL scheme outperforms the conventional FL schemes in terms of convergence rate and energy balance.",
"title": "Auction-Based Cluster Federated Learning in Mobile Edge Computing Systems",
"normalizedTitle": "Auction-Based Cluster Federated Learning in Mobile Edge Computing Systems",
"fno": "10032710",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Data Privacy",
"Edge Computing",
"Learning Artificial Intelligence",
"Mobile Computing",
"Pattern Clustering",
"Auction Mechanism",
"Auction Based Client Selection Strategy",
"Auction Based Cluster Federated Learning Scheme",
"Balance Energy Consumption",
"Cluster Clients",
"Clustered FL Framework Converges",
"Conventional FL Schemes",
"Data Heterogeneity",
"Data Owners",
"Data Privacy",
"Data Processing",
"Data Sources",
"FL Scheme",
"FL Training",
"Local Data Distribution",
"Local Resources",
"Mean Shift Clustering Algorithm",
"MEC",
"Mobile Edge Computing Systems",
"Model Convergence",
"Model Training",
"Raw Data",
"Data Models",
"Training",
"Servers",
"Computational Modeling",
"Convergence",
"Federated Learning",
"Energy Consumption",
"Auction Mechanism",
"Clustering Strategy",
"Federated Learning"
],
"authors": [
{
"givenName": "Renhao",
"surname": "Lu",
"fullName": "Renhao Lu",
"affiliation": "School of Cyberspace Science, Harbin Institute of Technology, Harbin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weizhe",
"surname": "Zhang",
"fullName": "Weizhe Zhang",
"affiliation": "School of Cyberspace Science, Harbin Institute of Technology, Harbin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yan",
"surname": "Wang",
"fullName": "Yan Wang",
"affiliation": "Department of Computing, Macquarie University, Sydney, NSW, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qiong",
"surname": "Li",
"fullName": "Qiong Li",
"affiliation": "School of Cyberspace Science, Harbin Institute of Technology, Harbin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoxiong",
"surname": "Zhong",
"fullName": "Xiaoxiong Zhong",
"affiliation": "Department of New Networks, Peng Cheng Laboratory (PCL), Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongwei",
"surname": "Yang",
"fullName": "Hongwei Yang",
"affiliation": "School of Cyberspace Science, Harbin Institute of Technology, Harbin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Desheng",
"surname": "Wang",
"fullName": "Desheng Wang",
"affiliation": "School of Cyberspace Science, Harbin Institute of Technology, Harbin, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "1145-1158",
"year": "2023",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tm/5555/01/09795863",
"title": "An Incentive Auction for Heterogeneous Client Selection in Federated Learning",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/09795863/1EcpaqQI25y",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2023/01/09935309",
"title": "HierFedML: Aggregator Placement and UE Assignment for Hierarchical Federated Learning in Mobile Edge Computing",
"doi": null,
"abstractUrl": "/journal/td/2023/01/09935309/1HYqMThIyvC",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2022/7177/0/717700a895",
"title": "Sustainable Federated Learning with Long-term Online VCG Auction Mechanism",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2022/717700a895/1HriWejJ1Ty",
"parentPublication": {
"id": "proceedings/icdcs/2022/7177/0",
"title": "2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/5555/01/09944948",
"title": "Decentralized Federated Learning with Intermediate Results in Mobile Edge Computing",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/09944948/1IbMb0GzL8c",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/5555/01/09954190",
"title": "Towards Effective Clustered Federated Learning: A Peer-to-peer Framework with Adaptive Neighbor Matching",
"doi": null,
"abstractUrl": "/journal/bd/5555/01/09954190/1Inoq0EldXG",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/5555/01/09960821",
"title": "Cross-FCL: Toward a Cross-edge Federated Continual Learning Framework in Mobile Edge Computing Systems",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/09960821/1IxvW9zvOO4",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sec/2022/8611/0/861100a349",
"title": "Energy-aware Edge Federated Learning for Enhanced Reliability and Sustainability",
"doi": null,
"abstractUrl": "/proceedings-article/sec/2022/861100a349/1JC1kUMlDva",
"parentPublication": {
"id": "proceedings/sec/2022/8611/0",
"title": "2022 IEEE/ACM 7th Symposium on Edge Computing (SEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/5555/01/10004844",
"title": "SlimFL: Federated Learning With Superposition Coding Over Slimmable Neural Networks",
"doi": null,
"abstractUrl": "/journal/nt/5555/01/10004844/1JC5roWqGu4",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/5555/01/10025677",
"title": "Privacy-Enhanced Decentralized Federated Learning at Dynamic Edge",
"doi": null,
"abstractUrl": "/journal/tc/5555/01/10025677/1KdUSqKKwAo",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoin/2021/9101/0/09333972",
"title": "Loss and Energy Tradeoff in Multi-access Edge Computing Enabled Federated Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icoin/2021/09333972/1qTrTNdgSvS",
"parentPublication": {
"id": "proceedings/icoin/2021/9101/0",
"title": "2021 International Conference on Information Networking (ICOIN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10005831",
"articleId": "1JF3VDhC6li",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10029878",
"articleId": "1Kmz3sfJ92o",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1KJsBITJe8g",
"name": "ttd202304-010032710s1-supp1-3240767.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttd202304-010032710s1-supp1-3240767.pdf",
"extension": "pdf",
"size": "168 kB",
"__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": "1sVEP6R17eU",
"doi": "10.1109/TVCG.2021.3074010",
"abstract": "As a decentralized training approach, horizontal federated learning (HFL) enables distributed clients to collaboratively learn a machine learning model while keeping personal/private information on local devices. Despite the enhanced performance and efficiency of HFL over local training, clues for inspecting the behaviors of the participating clients and the federated model are usually lacking due to the privacy-preserving nature of HFL. Consequently, the users can only conduct a shallow-level analysis of potential abnormal behaviors and have limited means to assess the contributions of individual clients and implement the necessary intervention. Visualization techniques have been introduced to facilitate the HFL process inspection, usually by providing model metrics and evaluation results as a dashboard representation. Although the existing visualization methods allow a simple examination of the HFL model performance, they cannot support the intensive exploration of the HFL process. In this article, strictly following the HFL privacy-preserving protocol, we design an exploratory visual analytics system for the HFL process termed <italic>HFLens</italic>, which supports comparative visual interpretation at the overview, communication round, and client instance levels. Specifically, the proposed system facilitates the investigation of the overall process involving all clients, the correlation analysis of clients’ information in one or different communication round(s), the identification of potential anomalies, and the contribution assessment of each HFL client. Two case studies confirm the efficacy of our system. Experts’ feedback suggests that our approach indeed helps in understanding and diagnosing the HFL process better.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As a decentralized training approach, horizontal federated learning (HFL) enables distributed clients to collaboratively learn a machine learning model while keeping personal/private information on local devices. Despite the enhanced performance and efficiency of HFL over local training, clues for inspecting the behaviors of the participating clients and the federated model are usually lacking due to the privacy-preserving nature of HFL. Consequently, the users can only conduct a shallow-level analysis of potential abnormal behaviors and have limited means to assess the contributions of individual clients and implement the necessary intervention. Visualization techniques have been introduced to facilitate the HFL process inspection, usually by providing model metrics and evaluation results as a dashboard representation. Although the existing visualization methods allow a simple examination of the HFL model performance, they cannot support the intensive exploration of the HFL process. In this article, strictly following the HFL privacy-preserving protocol, we design an exploratory visual analytics system for the HFL process termed <italic>HFLens</italic>, which supports comparative visual interpretation at the overview, communication round, and client instance levels. Specifically, the proposed system facilitates the investigation of the overall process involving all clients, the correlation analysis of clients’ information in one or different communication round(s), the identification of potential anomalies, and the contribution assessment of each HFL client. Two case studies confirm the efficacy of our system. Experts’ feedback suggests that our approach indeed helps in understanding and diagnosing the HFL process better.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As a decentralized training approach, horizontal federated learning (HFL) enables distributed clients to collaboratively learn a machine learning model while keeping personal/private information on local devices. Despite the enhanced performance and efficiency of HFL over local training, clues for inspecting the behaviors of the participating clients and the federated model are usually lacking due to the privacy-preserving nature of HFL. Consequently, the users can only conduct a shallow-level analysis of potential abnormal behaviors and have limited means to assess the contributions of individual clients and implement the necessary intervention. Visualization techniques have been introduced to facilitate the HFL process inspection, usually by providing model metrics and evaluation results as a dashboard representation. Although the existing visualization methods allow a simple examination of the HFL model performance, they cannot support the intensive exploration of the HFL process. In this article, strictly following the HFL privacy-preserving protocol, we design an exploratory visual analytics system for the HFL process termed HFLens, which supports comparative visual interpretation at the overview, communication round, and client instance levels. Specifically, the proposed system facilitates the investigation of the overall process involving all clients, the correlation analysis of clients’ information in one or different communication round(s), the identification of potential anomalies, and the contribution assessment of each HFL client. Two case studies confirm the efficacy of our system. Experts’ feedback suggests that our approach indeed helps in understanding and diagnosing the HFL process better.",
"title": "Inspecting the Running Process of Horizontal Federated Learning via Visual Analytics",
"normalizedTitle": "Inspecting the Running Process of Horizontal Federated Learning via Visual Analytics",
"fno": "09408377",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Privacy",
"Data Visualisation",
"Learning Artificial Intelligence",
"Client Instance Levels",
"Comparative Visual Interpretation",
"Decentralized Training Approach",
"Existing Visualization Methods",
"Exploratory Visual Analytics System",
"Federated Model",
"HFL Client",
"HFL Model Performance",
"HFL Privacy Preserving Protocol",
"HFL Process Inspection",
"Horizontal Federated Learning",
"Individual Clients",
"Local Devices",
"Local Training",
"Machine Learning Model",
"Model Metrics",
"Participating Clients",
"Potential Abnormal Behaviors",
"Privacy Preserving Nature",
"Running Process",
"Shallow Level Analysis",
"Visualization Techniques",
"Data Models",
"Data Visualization",
"Federated Learning",
"Predictive Models",
"Analytical Models",
"Computational Modeling",
"Servers",
"Anomaly Detection",
"Federated Learning",
"Anomaly Detection",
"Contribution Assessment",
"Visualization"
],
"authors": [
{
"givenName": "Quan",
"surname": "Li",
"fullName": "Quan Li",
"affiliation": "School of Information Science and Technology, ShanghaiTech University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiguang",
"surname": "Wei",
"fullName": "Xiguang Wei",
"affiliation": "AI Department, Shenzhen Semacare Medical Technology Co., Ltd, Shenzhen, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huanbin",
"surname": "Lin",
"fullName": "Huanbin Lin",
"affiliation": "AI Group, WeBank, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yang",
"surname": "Liu",
"fullName": "Yang Liu",
"affiliation": "AI Group, WeBank, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tianjian",
"surname": "Chen",
"fullName": "Tianjian Chen",
"affiliation": "AI Group, WeBank, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaojuan",
"surname": "Ma",
"fullName": "Xiaojuan Ma",
"affiliation": "Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "4085-4100",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2022/0883/0/088300a911",
"title": "Efficient Participant Contribution Evaluation for Horizontal and Vertical Federated Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2022/088300a911/1FwFC7U2nJK",
"parentPublication": {
"id": "proceedings/icde/2022/0883/0",
"title": "2022 IEEE 38th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09912364",
"title": "HetVis: A Visual Analysis Approach for Identifying Data Heterogeneity in Horizontal Federated Learning",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09912364/1HeiTxRhh9C",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2022/7177/0/717700a820",
"title": "Toward Cleansing Backdoored Neural Networks in Federated Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2022/717700a820/1Hrj5bKb04w",
"parentPublication": {
"id": "proceedings/icdcs/2022/7177/0",
"title": "2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nas/2022/5408/0/09925313",
"title": "Participant Selection for Hierarchical Federated Learning in Edge Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/nas/2022/09925313/1I09PEIIXmw",
"parentPublication": {
"id": "proceedings/nas/2022/5408/0",
"title": "2022 IEEE International Conference on Networking, Architecture and Storage (NAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2023/01/09618806",
"title": "Secure Aggregation is Insecure: Category Inference Attack on Federated Learning",
"doi": null,
"abstractUrl": "/journal/tq/2023/01/09618806/1JU081kA53O",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020554",
"title": "Robust Personalized Federated Learning under Demographic Fairness Heterogeneity",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020554/1KfSRvnzxUQ",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/oj/2023/01/10081485",
"title": "FLIS: Clustered Federated Learning Via Inference Similarity for Non-IID Data Distribution",
"doi": null,
"abstractUrl": "/journal/oj/2023/01/10081485/1LR5HC3J9iU",
"parentPublication": {
"id": "trans/oj",
"title": "IEEE Open Journal of the Computer Society",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-dss-smartcity-dependsys/2022/1993/0/199300b196",
"title": "Optimized Client-side Detection of Model Poisoning Attacks in Federated learning",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-dss-smartcity-dependsys/2022/199300b196/1LSPfQoE93y",
"parentPublication": {
"id": "proceedings/hpcc-dss-smartcity-dependsys/2022/1993/0",
"title": "2022 IEEE 24th Int Conf on High Performance Computing & Communications; 8th Int Conf on Data Science & Systems; 20th Int Conf on Smart City; 8th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msn/2022/6457/0/645700a495",
"title": "Anomaly Detection Through Unsupervised Federated Learning",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2022/645700a495/1LUtH1eeYak",
"parentPublication": {
"id": "proceedings/msn/2022/6457/0",
"title": "2022 18th International Conference on Mobility, Sensing and Networking (MSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/10/09661312",
"title": "Privacy-Preserving Efficient Federated-Learning Model Debugging",
"doi": null,
"abstractUrl": "/journal/td/2022/10/09661312/1zzlgOMDmaQ",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09408420",
"articleId": "1sVEPtgtAWI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09408391",
"articleId": "1sVEPCiNLI4",
"__typename": "AdjacentArticleType"
},
"__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": "13rRUwd9CG7",
"doi": "10.1109/TVCG.2016.2598694",
"abstract": "Recently proposed techniques have finally made it possible for analysts to interactively explore very large datasets in real time. However powerful, the class of analyses these systems enable is somewhat limited: specifically, one can only quickly obtain plots such as histograms and heatmaps. In this paper, we contribute Gaussian Cubes, which significantly improves on state-of-the-art systems by providing interactive modeling capabilities, which include but are not limited to linear least squares and principal components analysis (PCA). The fundamental insight in Gaussian Cubes is that instead of precomputing counts of many data subsets (as state-of-the-art systems do), Gaussian Cubes precomputes the best multivariate Gaussian for the respective data subsets. As an example, Gaussian Cubes can fit hundreds of models over millions of data points in well under a second, enabling novel types of visual exploration of such large datasets. We present three case studies that highlight the visualization and analysis capabilities in Gaussian Cubes, using earthquake safety simulations, astronomical catalogs, and transportation statistics. The dataset sizes range around one hundred million elements and 5 to 10 dimensions. We present extensive performance results, a discussion of the limitations in Gaussian Cubes, and future research directions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recently proposed techniques have finally made it possible for analysts to interactively explore very large datasets in real time. However powerful, the class of analyses these systems enable is somewhat limited: specifically, one can only quickly obtain plots such as histograms and heatmaps. In this paper, we contribute Gaussian Cubes, which significantly improves on state-of-the-art systems by providing interactive modeling capabilities, which include but are not limited to linear least squares and principal components analysis (PCA). The fundamental insight in Gaussian Cubes is that instead of precomputing counts of many data subsets (as state-of-the-art systems do), Gaussian Cubes precomputes the best multivariate Gaussian for the respective data subsets. As an example, Gaussian Cubes can fit hundreds of models over millions of data points in well under a second, enabling novel types of visual exploration of such large datasets. We present three case studies that highlight the visualization and analysis capabilities in Gaussian Cubes, using earthquake safety simulations, astronomical catalogs, and transportation statistics. The dataset sizes range around one hundred million elements and 5 to 10 dimensions. We present extensive performance results, a discussion of the limitations in Gaussian Cubes, and future research directions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recently proposed techniques have finally made it possible for analysts to interactively explore very large datasets in real time. However powerful, the class of analyses these systems enable is somewhat limited: specifically, one can only quickly obtain plots such as histograms and heatmaps. In this paper, we contribute Gaussian Cubes, which significantly improves on state-of-the-art systems by providing interactive modeling capabilities, which include but are not limited to linear least squares and principal components analysis (PCA). The fundamental insight in Gaussian Cubes is that instead of precomputing counts of many data subsets (as state-of-the-art systems do), Gaussian Cubes precomputes the best multivariate Gaussian for the respective data subsets. As an example, Gaussian Cubes can fit hundreds of models over millions of data points in well under a second, enabling novel types of visual exploration of such large datasets. We present three case studies that highlight the visualization and analysis capabilities in Gaussian Cubes, using earthquake safety simulations, astronomical catalogs, and transportation statistics. The dataset sizes range around one hundred million elements and 5 to 10 dimensions. We present extensive performance results, a discussion of the limitations in Gaussian Cubes, and future research directions.",
"title": "Gaussian Cubes: Real-Time Modeling for Visual Exploration of Large Multidimensional Datasets",
"normalizedTitle": "Gaussian Cubes: Real-Time Modeling for Visual Exploration of Large Multidimensional Datasets",
"fno": "07536648",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Models",
"Data Visualization",
"Computational Modeling",
"Analytical Models",
"Visualization",
"Principal Component Analysis",
"Manuals",
"Data Cubes",
"Data Modeling",
"Dimensionality Reduction",
"Interactive Visualization"
],
"authors": [
{
"givenName": "Zhe",
"surname": "Wang",
"fullName": "Zhe Wang",
"affiliation": "University of Arizona",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nivan",
"surname": "Ferreira",
"fullName": "Nivan Ferreira",
"affiliation": "Universidade Federal de Pernambuco",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Youhao",
"surname": "Wei",
"fullName": "Youhao Wei",
"affiliation": "University of Arizona",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aarthy Sankari",
"surname": "Bhaskar",
"fullName": "Aarthy Sankari Bhaskar",
"affiliation": "University of Arizona",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Carlos",
"surname": "Scheidegger",
"fullName": "Carlos Scheidegger",
"affiliation": "University of Arizona",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "681-690",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2014/2555/0/06816674",
"title": "Distributed and interactive cube exploration",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2014/06816674/12OmNAmE5W7",
"parentPublication": {
"id": "proceedings/icde/2014/2555/0",
"title": "2014 IEEE 30th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/skg/2013/3012/0/3012a173",
"title": "Data Compression Techniques and Algorithms for Effectively and Efficiently Managing Multidimensional Stream Cubes over Grids",
"doi": null,
"abstractUrl": "/proceedings-article/skg/2013/3012a173/12OmNBE7Mqo",
"parentPublication": {
"id": "proceedings/skg/2013/3012/0",
"title": "2013 Ninth International Conference on Semantics, Knowledge and Grids (SKG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichi/2013/5089/0/5089a248",
"title": "Automated Trauma Incident Cubes Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2013/5089a248/12OmNwkhTdq",
"parentPublication": {
"id": "proceedings/ichi/2013/5089/0",
"title": "2013 IEEE International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031587",
"title": "SwiftTuna: Responsive and incremental visual exploration of large-scale multidimensional data",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031587/12OmNzvQHYR",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2012/06/mcs2012060044",
"title": "The Application of Data Cubes in Business Data Visualization",
"doi": null,
"abstractUrl": "/magazine/cs/2012/06/mcs2012060044/13rRUypp540",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122456",
"title": "Nanocubes for Real-Time Exploration of Spatiotemporal Datasets",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122456/13rRUytF41z",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcomp/2022/2197/0/219700a023",
"title": "Aggregating the Gaussian Experts' Predictions via Undirected Graphical Models",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2022/219700a023/1BYIEpxsjHW",
"parentPublication": {
"id": "proceedings/bigcomp/2022/2197/0",
"title": "2022 IEEE International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoin/2019/8350/0/08718172",
"title": "Ontology Enhanced Mining of Multidimensional Association Rules from Data Cubes",
"doi": null,
"abstractUrl": "/proceedings-article/icoin/2019/08718172/1aIRXXmswpi",
"parentPublication": {
"id": "proceedings/icoin/2019/8350/0",
"title": "2019 International Conference on Information Networking (ICOIN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/06/08902053",
"title": "Nonparametric Regression via Variance-Adjusted Gradient Boosting Gaussian Process Regression",
"doi": null,
"abstractUrl": "/journal/tk/2021/06/08902053/1eYN6682xnW",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a421",
"title": "An Intelligent Visual Big Data Analytics Framework for Supporting Interactive Exploration and Visualization of Big OLAP Cubes",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a421/1rSRd1tLD1K",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07539326",
"articleId": "13rRUxCitJh",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07539398",
"articleId": "13rRUEgarnP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx1qV7M",
"title": "March-April",
"year": "2020",
"issueNum": "02",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "22",
"label": "March-April",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45WODaoM",
"doi": "10.1109/MCSE.2018.2882750",
"abstract": "Validating simulations with experimental results is a vital component of modern materials science. Existing workflows require substantial human intervention to interpret their results. We present a statistical approach to identify physically meaningful features, and we construct a visualization system that allows users to interactively and intuitively explore their datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Validating simulations with experimental results is a vital component of modern materials science. Existing workflows require substantial human intervention to interpret their results. We present a statistical approach to identify physically meaningful features, and we construct a visualization system that allows users to interactively and intuitively explore their datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Validating simulations with experimental results is a vital component of modern materials science. Existing workflows require substantial human intervention to interpret their results. We present a statistical approach to identify physically meaningful features, and we construct a visualization system that allows users to interactively and intuitively explore their datasets.",
"title": "An Interactive Exploration Tool for High-Dimensional Datasets: A Shock Physics Case Study",
"normalizedTitle": "An Interactive Exploration Tool for High-Dimensional Datasets: A Shock Physics Case Study",
"fno": "08542728",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Data Visualisation",
"Physics Computing",
"Substantial Human Intervention",
"Workflows",
"Modern Materials Science",
"Shock Physics Case Study",
"High Dimensional Datasets",
"Interactive Exploration Tool",
"Visualization System",
"Data Visualization",
"Software Tools",
"Feature Extraction",
"Simulation",
"Human Factors",
"Data Analysis"
],
"authors": [
{
"givenName": "Ayan",
"surname": "Biswas",
"fullName": "Ayan Biswas",
"affiliation": "Los Alamos National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christopher M.",
"surname": "Biwer",
"fullName": "Christopher M. Biwer",
"affiliation": "Los Alamos National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David J.",
"surname": "Walters",
"fullName": "David J. Walters",
"affiliation": "Los Alamos National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "James",
"surname": "Ahrens",
"fullName": "James Ahrens",
"affiliation": "Los Alamos National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Devin",
"surname": "Francom",
"fullName": "Devin Francom",
"affiliation": "Los Alamos National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Earl",
"surname": "Lawrence",
"fullName": "Earl Lawrence",
"affiliation": "Los Alamos National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Richard L.",
"surname": "Sandberg",
"fullName": "Richard L. Sandberg",
"affiliation": "Los Alamos National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "D. Anthony",
"surname": "Fredenburg",
"fullName": "D. Anthony Fredenburg",
"affiliation": "Los Alamos National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cynthia",
"surname": "Bolme",
"fullName": "Cynthia Bolme",
"affiliation": "Los Alamos National Laboratory",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2020-03-01 00:00:00",
"pubType": "mags",
"pages": "44-54",
"year": "2020",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2004/8779/0/87790073",
"title": "Value and Relation Display for Interactive Exploration of High Dimensional Datasets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2004/87790073/12OmNB7LvJ4",
"parentPublication": {
"id": "proceedings/ieee-infovis/2004/8779/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vsmm/2009/3790/0/3790a179",
"title": "Realistic Interactive Pedestrian Simulation and Visualization for Virtual 3D Environments",
"doi": null,
"abstractUrl": "/proceedings-article/vsmm/2009/3790a179/12OmNqJ8tkF",
"parentPublication": {
"id": "proceedings/vsmm/2009/3790/0",
"title": "Virtual Systems and MultiMedia, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2010/4263/2/4263b150",
"title": "Combining Text and Graphics for Interactive Exploration of Behavior Datasets",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2010/4263b150/12OmNxWLTET",
"parentPublication": {
"id": "proceedings/ictai/2010/4263/2",
"title": "2010 22nd IEEE International Conference on Tools with Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wetice/2012/4717/0/4717a220",
"title": "Simulation-Assisted Elicitation and Validation of Behavioral Specifications for Multiple Stakeholders",
"doi": null,
"abstractUrl": "/proceedings-article/wetice/2012/4717a220/12OmNy68EAQ",
"parentPublication": {
"id": "proceedings/wetice/2012/4717/0",
"title": "2012 IEEE 21st International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/1992/03/s3023",
"title": "How the Learning Curve Affects CASE Tool Adoption",
"doi": null,
"abstractUrl": "/magazine/so/1992/03/s3023/13rRUILtJjt",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/02/ttg2010020325",
"title": "Real-Time Physics-Based 3D Biped Character Animation Using an Inverted Pendulum Model",
"doi": null,
"abstractUrl": "/journal/tg/2010/02/ttg2010020325/13rRUwdIOUF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122317",
"title": "Synthetic Generation of High-Dimensional Datasets",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122317/13rRUxjQyvf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904448",
"title": "DendroMap: Visual Exploration of Large-Scale Image Datasets for Machine Learning with Treemaps",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904448/1H1gmbVShUI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2008/2935/0/04677368",
"title": "Multivariate visual explanation for high dimensional datasets",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2008/04677368/1oFGMltTtFC",
"parentPublication": {
"id": "proceedings/vast/2008/2935/0",
"title": "2008 IEEE Symposium on Visual Analytics Science and Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2021/0191/0/1.91E44",
"title": "Thermal Image Processing via Physics-Inspired Deep Networks",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2021/1.91E44/1yNhYnrSMj6",
"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": "08946737",
"articleId": "1gd8JLa9BIc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08496821",
"articleId": "14tNJqXh8C5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyr8Ysp",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tb",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1ISVBEPt0kw",
"doi": "10.1109/TCBB.2022.3227202",
"abstract": "Single-cell RNA sequencing (scRNA-seq) is a revolutionary methodology that helps to analyze transcriptome or genome information from a single cell. However, high dimensionality and sparsity in data due to dropout events pose computational challenges for existing state-of-the-art scRNA-seq clustering methods. Learning efficient representations becomes even more challenging due to the presence of noise in scRNA-seq data. To overcome the effect of noise and learn effective representations, this paper proposes sc-INDC (<italic>S</italic>ingle-<italic>C</italic>ell <italic>I</italic>nformation Maximized <italic>N</italic>oise-Invariant <italic>D</italic>eep <italic>C</italic>lustering), a deep neural network that facilitates learning of informative and noise-invariant representations of scRNA-seq data. Furthermore, the time complexity of the proposed sc-INDC is significantly lower compared to state-of-the-art scRNA-seq clustering methods. Extensive experimentation on fourteen publicly available scRNA-seq datasets illustrates the efficacy of the proposed model. Additionally, visualizations of t-SNE plots and several ablation studies are also conducted to provide insights into the improved representation ability of sc-INDC. Code of the proposed sc-INDC will be available at: <uri>https://github.com/arnabkmondal/sc-INDC</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Single-cell RNA sequencing (scRNA-seq) is a revolutionary methodology that helps to analyze transcriptome or genome information from a single cell. However, high dimensionality and sparsity in data due to dropout events pose computational challenges for existing state-of-the-art scRNA-seq clustering methods. Learning efficient representations becomes even more challenging due to the presence of noise in scRNA-seq data. To overcome the effect of noise and learn effective representations, this paper proposes sc-INDC (<italic>S</italic>ingle-<italic>C</italic>ell <italic>I</italic>nformation Maximized <italic>N</italic>oise-Invariant <italic>D</italic>eep <italic>C</italic>lustering), a deep neural network that facilitates learning of informative and noise-invariant representations of scRNA-seq data. Furthermore, the time complexity of the proposed sc-INDC is significantly lower compared to state-of-the-art scRNA-seq clustering methods. Extensive experimentation on fourteen publicly available scRNA-seq datasets illustrates the efficacy of the proposed model. Additionally, visualizations of t-SNE plots and several ablation studies are also conducted to provide insights into the improved representation ability of sc-INDC. Code of the proposed sc-INDC will be available at: <uri>https://github.com/arnabkmondal/sc-INDC</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Single-cell RNA sequencing (scRNA-seq) is a revolutionary methodology that helps to analyze transcriptome or genome information from a single cell. However, high dimensionality and sparsity in data due to dropout events pose computational challenges for existing state-of-the-art scRNA-seq clustering methods. Learning efficient representations becomes even more challenging due to the presence of noise in scRNA-seq data. To overcome the effect of noise and learn effective representations, this paper proposes sc-INDC (Single-Cell Information Maximized Noise-Invariant Deep Clustering), a deep neural network that facilitates learning of informative and noise-invariant representations of scRNA-seq data. Furthermore, the time complexity of the proposed sc-INDC is significantly lower compared to state-of-the-art scRNA-seq clustering methods. Extensive experimentation on fourteen publicly available scRNA-seq datasets illustrates the efficacy of the proposed model. Additionally, visualizations of t-SNE plots and several ablation studies are also conducted to provide insights into the improved representation ability of sc-INDC. Code of the proposed sc-INDC will be available at: https://github.com/arnabkmondal/sc-INDC.",
"title": "Clustering Single-cell RNA Sequence Data using Information Maximized and Noise-Invariant Representations",
"normalizedTitle": "Clustering Single-cell RNA Sequence Data using Information Maximized and Noise-Invariant Representations",
"fno": "09971464",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Clustering Algorithms",
"Data Models",
"Clustering Methods",
"Deep Learning",
"Neural Networks",
"Training",
"Representation Learning",
"Dimensionality Reduction Of Sc RNA Seq Data",
"Clustering Of Sc RNA Seq Data",
"Noise Invariant Representation Learning"
],
"authors": [
{
"givenName": "Arnab",
"surname": "Kumar Mondal",
"fullName": "Arnab Kumar Mondal",
"affiliation": "IIT, Delhi, India",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Indu",
"surname": "Joshi",
"fullName": "Indu Joshi",
"affiliation": "INRIA Sophia Antipolis, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pravendra",
"surname": "Singh",
"fullName": "Pravendra Singh",
"affiliation": "IIT, Roorkee, India",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Prathosh",
"surname": "A P",
"fullName": "Prathosh A P",
"affiliation": "IISc, Bangalore, India",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "1-12",
"year": "5555",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2021/0126/0/09669638",
"title": "DeepCI: a deep learning based clustering method for single cell RNA-seq data",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2021/09669638/1A9Vmi0p8EU",
"parentPublication": {
"id": "proceedings/bibm/2021/0126/0",
"title": "2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/01/09697358",
"title": "IsoCell: An Approach to Enhance Single Cell Clustering by Integrating Isoform-Level Expression Through Orthogonal Projection",
"doi": null,
"abstractUrl": "/journal/tb/2023/01/09697358/1AC4hUTzFw4",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisai/2021/0692/0/069200a797",
"title": "Clustering single-cell RNA sequencing data by multi-view latent embedding learning",
"doi": null,
"abstractUrl": "/proceedings-article/cisai/2021/069200a797/1BmO5OAo69W",
"parentPublication": {
"id": "proceedings/cisai/2021/0692/0",
"title": "2021 International Conference on Computer Information Science and Artificial Intelligence (CISAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/5555/01/09991252",
"title": "scBKAP: a clustering model for single-cell RNA-seq data based on bisecting K-means",
"doi": null,
"abstractUrl": "/journal/tb/5555/01/09991252/1JevudAHS3C",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/5555/01/10044260",
"title": "scENT for Revealing Gene Clusters From Single-Cell RNA-Seq Data",
"doi": null,
"abstractUrl": "/journal/tb/5555/01/10044260/1KL6SgAKPwA",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/09031320",
"title": "An Effective Biclustering-Based Framework for Identifying Cell Subpopulations From scRNA-seq Data",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/09031320/1i6UAvMdyQE",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2020/9228/0/922800a681",
"title": "Deep Denoising Sparse Coding",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2020/922800a681/1pP3DNLv7jO",
"parentPublication": {
"id": "proceedings/ictai/2020/9228/0",
"title": "2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2020/6215/0/09313474",
"title": "Discovering Cell Types by Integrating Single-cell RNA-sequencing and Protein Interaction Network",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313474/1qmfHYqLZSg",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2020/6215/0/09313569",
"title": "Accurately Clustering Single-cell RNA-seq data by Capturing Structural Relations between Cells through Graph Convolutional Network",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313569/1qmg2wG65oI",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/06/09618768",
"title": "Effectively Clustering Single Cell RNA Sequencing Data by Sparse Representation",
"doi": null,
"abstractUrl": "/journal/tb/2022/06/09618768/1yBAyosWJoc",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09971775",
"articleId": "1ISVBvq9k1W",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09979754",
"articleId": "1IXUidy0Fi0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyr8Ysp",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tb",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1JevudAHS3C",
"doi": "10.1109/TCBB.2022.3230098",
"abstract": "Advances in single-cell RNA sequencing (scRNA-seq) technologies allow researchers to analyze the genome-wide transcription profile and to solve biological problems at the individual-cell resolution. However, existing clustering methods on scRNA-seq suffer from high dropout rate and curse of dimensionality in the data. Here, we propose a novel pipeline, scBKAP, the cornerstone of which is a single-cell bisecting K-means clustering method based on an autoencoder network and a dimensionality reduction model MPDR. Specially, scBKAP utilizes an autoencoder network to reconstruct gene expression values from scRNA-seq data to alleviate the dropout issue, and the MPDR model composed of the M3Drop feature selection algorithm and the PHATE dimensionality reduction algorithm to reduce the dimensions of reconstructed data. The dimensionality-reduced data are then fed into the bisecting K-means clustering algorithm to identify the clusters of cells. Comprehensive experiments demonstrate scBKAP's superior performance over nine state-of-the-art single-cell clustering methods on 21 public scRNA-seq datasets and simulated datasets. The source codes and datasets are available at <uri>https://github.com/YuBinLab-QUST/scBKAP/</uri> and <uri>https://doi.org/10.24433/CO.4592131.v1</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Advances in single-cell RNA sequencing (scRNA-seq) technologies allow researchers to analyze the genome-wide transcription profile and to solve biological problems at the individual-cell resolution. However, existing clustering methods on scRNA-seq suffer from high dropout rate and curse of dimensionality in the data. Here, we propose a novel pipeline, scBKAP, the cornerstone of which is a single-cell bisecting K-means clustering method based on an autoencoder network and a dimensionality reduction model MPDR. Specially, scBKAP utilizes an autoencoder network to reconstruct gene expression values from scRNA-seq data to alleviate the dropout issue, and the MPDR model composed of the M3Drop feature selection algorithm and the PHATE dimensionality reduction algorithm to reduce the dimensions of reconstructed data. The dimensionality-reduced data are then fed into the bisecting K-means clustering algorithm to identify the clusters of cells. Comprehensive experiments demonstrate scBKAP's superior performance over nine state-of-the-art single-cell clustering methods on 21 public scRNA-seq datasets and simulated datasets. The source codes and datasets are available at <uri>https://github.com/YuBinLab-QUST/scBKAP/</uri> and <uri>https://doi.org/10.24433/CO.4592131.v1</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Advances in single-cell RNA sequencing (scRNA-seq) technologies allow researchers to analyze the genome-wide transcription profile and to solve biological problems at the individual-cell resolution. However, existing clustering methods on scRNA-seq suffer from high dropout rate and curse of dimensionality in the data. Here, we propose a novel pipeline, scBKAP, the cornerstone of which is a single-cell bisecting K-means clustering method based on an autoencoder network and a dimensionality reduction model MPDR. Specially, scBKAP utilizes an autoencoder network to reconstruct gene expression values from scRNA-seq data to alleviate the dropout issue, and the MPDR model composed of the M3Drop feature selection algorithm and the PHATE dimensionality reduction algorithm to reduce the dimensions of reconstructed data. The dimensionality-reduced data are then fed into the bisecting K-means clustering algorithm to identify the clusters of cells. Comprehensive experiments demonstrate scBKAP's superior performance over nine state-of-the-art single-cell clustering methods on 21 public scRNA-seq datasets and simulated datasets. The source codes and datasets are available at https://github.com/YuBinLab-QUST/scBKAP/ and https://doi.org/10.24433/CO.4592131.v1.",
"title": "scBKAP: a clustering model for single-cell RNA-seq data based on bisecting K-means",
"normalizedTitle": "scBKAP: a clustering model for single-cell RNA-seq data based on bisecting K-means",
"fno": "09991252",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Clustering Algorithms",
"Data Models",
"Pipelines",
"Dimensionality Reduction",
"Clustering Methods",
"Standards",
"Sequential Analysis",
"Sc RNA Seq",
"Autoencoder Network",
"MPDR Dimensionality Reduction",
"Bisecting K Means Clustering"
],
"authors": [
{
"givenName": "Xiaolin",
"surname": "Wang",
"fullName": "Xiaolin Wang",
"affiliation": "College of Mathematics and Physics, Qingdao University of Science and Technology, Qingdao, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongli",
"surname": "Gao",
"fullName": "Hongli Gao",
"affiliation": "College of Mathematics and Physics, Qingdao University of Science and Technology, Qingdao, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ren",
"surname": "Qi",
"fullName": "Ren Qi",
"affiliation": "College of Intelligence and Computing, Tianjin University, Tianjin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ruiqing",
"surname": "Zheng",
"fullName": "Ruiqing Zheng",
"affiliation": "School of Information Science and Engineering, Central South University, Changsha, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xin",
"surname": "Gao",
"fullName": "Xin Gao",
"affiliation": "Computational Bioscience Research Center (CBRC), King Abdullah University of Science and Technology (KAUST), Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bin",
"surname": "Yu",
"fullName": "Bin Yu",
"affiliation": "College of Information Science and Technology, School of Data Science, Qingdao University of Science and Technology, Qingdao, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "1-10",
"year": "5555",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccabs/2018/8520/0/08542088",
"title": "SC1: A web-based single cell RNA-seq analysis pipeline",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2018/08542088/17D45VUZMUr",
"parentPublication": {
"id": "proceedings/iccabs/2018/8520/0",
"title": "2018 IEEE 8th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2021/0126/0/09669638",
"title": "DeepCI: a deep learning based clustering method for single cell RNA-seq data",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2021/09669638/1A9Vmi0p8EU",
"parentPublication": {
"id": "proceedings/bibm/2021/0126/0",
"title": "2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2021/0126/0/09669379",
"title": "Adaptive total-variation joint learning model for analyzing single cell RNA seq data",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2021/09669379/1A9VvOS9YJi",
"parentPublication": {
"id": "proceedings/bibm/2021/0126/0",
"title": "2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisai/2021/0692/0/069200a797",
"title": "Clustering single-cell RNA sequencing data by multi-view latent embedding learning",
"doi": null,
"abstractUrl": "/proceedings-article/cisai/2021/069200a797/1BmO5OAo69W",
"parentPublication": {
"id": "proceedings/cisai/2021/0692/0",
"title": "2021 International Conference on Computer Information Science and Artificial Intelligence (CISAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccabs/2017/2594/0/08114311",
"title": "A computational method to aid in the design and analysis of single cell RNA-seq experiments",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2017/08114311/1DICc9mozks",
"parentPublication": {
"id": "proceedings/iccabs/2017/2594/0",
"title": "2017 IEEE 7th International Conference on Computational Advances in Bio- and Medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/5555/01/09971464",
"title": "Clustering Single-cell RNA Sequence Data using Information Maximized and Noise-Invariant Representations",
"doi": null,
"abstractUrl": "/journal/tb/5555/01/09971464/1ISVBEPt0kw",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/5555/01/10027187",
"title": "Deep Multi-Constraint Soft Clustering Analysis for Single-Cell RNA-Seq Data Via Zero-Inflated Autoencoder Embedding",
"doi": null,
"abstractUrl": "/journal/tb/5555/01/10027187/1KkZZRGe2M8",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2020/6215/0/09313380",
"title": "Locally Manifold Non-negative Matrix Factorization Based on Centroid for scRNA-seq Data Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313380/1qmfTtkCM2k",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2020/6215/0/09313378",
"title": "Unsupervised Identification of SARS-CoV-2 Target Cell Groups via Nonlinear Dimensionality Reduction on Single-cell RNA-Seq Data",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313378/1qmfY23X7Gw",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2020/6215/0/09313423",
"title": "Dual Graph regularized PCA based on Different Norm Constraints for Bi-clustering Analysis on Single-cell RNA-seq Data",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313423/1qmghJPbK3m",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09992084",
"articleId": "1Jevu24OHVm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09992149",
"articleId": "1JevuSGzlAI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1JDoU0kGRdm",
"name": "ttb555501-09991252s1-supp1-3230098.docx",
"location": "https://www.computer.org/csdl/api/v1/extra/ttb555501-09991252s1-supp1-3230098.docx",
"extension": "docx",
"size": "19.1 MB",
"__typename": "WebExtraType"
}
],
"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": "1MkXSR95oIM",
"doi": "10.1109/TKDE.2023.3267036",
"abstract": "Visual question answering (VQA) is a challenging task that reasons over questions on images with knowledge. A prerequisite for VQA is the availability of annotated datasets, while the available datasets have several limitations. 1) The diversity of questions and answers are limited to a few question categories and certain concepts (e.g., objects, relations, actions.) with somewhat mechanical answers. 2) The availability of background knowledge or context information has been disregarded with just images, questions and answers being provided. 3) The timeliness of knowledge has not been examined, though some works may introduce factual or commonsense knowledge bases, e.g., ConceptNet, DBPedia. In this paper, we provide an Event-oriented Visual Question Answering (E-VQA) dataset including free-form questions and answers for real-world event concepts, which provides context information of events as domain knowledge in addition to images. E-VQA consists of 2,690 social media images, 9,088 questions, 5,479 answers, and 1,157 news media articles for references being annotated to 182 real-world events, covering a wide range of topics, such as armed conflicts and attacks, disasters and accidents, law and crime. For comparisons, we investigate 10 state-of-the-art VQA methods as benchmarks. The dataset is available at <uri>https://github.com/zhengyang5/E-VQA</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visual question answering (VQA) is a challenging task that reasons over questions on images with knowledge. A prerequisite for VQA is the availability of annotated datasets, while the available datasets have several limitations. 1) The diversity of questions and answers are limited to a few question categories and certain concepts (e.g., objects, relations, actions.) with somewhat mechanical answers. 2) The availability of background knowledge or context information has been disregarded with just images, questions and answers being provided. 3) The timeliness of knowledge has not been examined, though some works may introduce factual or commonsense knowledge bases, e.g., ConceptNet, DBPedia. In this paper, we provide an Event-oriented Visual Question Answering (E-VQA) dataset including free-form questions and answers for real-world event concepts, which provides context information of events as domain knowledge in addition to images. E-VQA consists of 2,690 social media images, 9,088 questions, 5,479 answers, and 1,157 news media articles for references being annotated to 182 real-world events, covering a wide range of topics, such as armed conflicts and attacks, disasters and accidents, law and crime. For comparisons, we investigate 10 state-of-the-art VQA methods as benchmarks. The dataset is available at <uri>https://github.com/zhengyang5/E-VQA</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visual question answering (VQA) is a challenging task that reasons over questions on images with knowledge. A prerequisite for VQA is the availability of annotated datasets, while the available datasets have several limitations. 1) The diversity of questions and answers are limited to a few question categories and certain concepts (e.g., objects, relations, actions.) with somewhat mechanical answers. 2) The availability of background knowledge or context information has been disregarded with just images, questions and answers being provided. 3) The timeliness of knowledge has not been examined, though some works may introduce factual or commonsense knowledge bases, e.g., ConceptNet, DBPedia. In this paper, we provide an Event-oriented Visual Question Answering (E-VQA) dataset including free-form questions and answers for real-world event concepts, which provides context information of events as domain knowledge in addition to images. E-VQA consists of 2,690 social media images, 9,088 questions, 5,479 answers, and 1,157 news media articles for references being annotated to 182 real-world events, covering a wide range of topics, such as armed conflicts and attacks, disasters and accidents, law and crime. For comparisons, we investigate 10 state-of-the-art VQA methods as benchmarks. The dataset is available at https://github.com/zhengyang5/E-VQA.",
"title": "Event-Oriented Visual Question Answering: The E-VQA Dataset and Benchmark",
"normalizedTitle": "Event-Oriented Visual Question Answering: The E-VQA Dataset and Benchmark",
"fno": "10102595",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Task Analysis",
"Visualization",
"Transformers",
"Feature Extraction",
"Question Answering Information Retrieval",
"Encyclopedias",
"Data Models",
"Visual Question Answering",
"Event Mining",
"Social Media Data Mining"
],
"authors": [
{
"givenName": "Zhenguo",
"surname": "Yang",
"fullName": "Zhenguo Yang",
"affiliation": "School of Computer Science, Guangdong University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiale",
"surname": "Xiang",
"fullName": "Jiale Xiang",
"affiliation": "School of Computer Science, Guangdong University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiuxiang",
"surname": "You",
"fullName": "Jiuxiang You",
"affiliation": "School of Computer Science, Guangdong University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qing",
"surname": "Li",
"fullName": "Qing Li",
"affiliation": "Department of Computing, Hong Kong Polytechnic University, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenyin",
"surname": "Liu",
"fullName": "Wenyin Liu",
"affiliation": "School of Computer Science, Guangdong University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "1-14",
"year": "5555",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdmw/2011/4409/0/4409a089",
"title": "AQA: Aspect-based Opinion Question Answering",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2011/4409a089/12OmNrJAe9F",
"parentPublication": {
"id": "proceedings/icdmw/2011/4409/0",
"title": "2011 IEEE 11th International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391c425",
"title": "VQA: Visual Question Answering",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391c425/12OmNrYlmBL",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/kse/2009/3846/0/3846a026",
"title": "A Vietnamese Question Answering System",
"doi": null,
"abstractUrl": "/proceedings-article/kse/2009/3846a026/12OmNyqzLXO",
"parentPublication": {
"id": "proceedings/kse/2009/3846/0",
"title": "Knowledge and Systems Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2022/8563/0/09859591",
"title": "Question-Driven Graph Fusion Network for Visual Question Answering",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2022/09859591/1G9Ep1BWxIQ",
"parentPublication": {
"id": "proceedings/icme/2022/8563/0",
"title": "2022 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09965773",
"title": "3D Question Answering",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09965773/1IHMR48xnyM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995473",
"title": "MHKD-MVQA: Multimodal Hierarchical Knowledge Distillation for Medical Visual Question Answering",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995473/1JC2qFvLZ96",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020945",
"title": "A Business Workflow For Providing Open-Domain Question Answering Reader Systems on The Wikipedia Dataset",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020945/1KfTaPHtWjm",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600b155",
"title": "VLC-BERT: Visual Question Answering with Contextualized Commonsense Knowledge",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600b155/1KxVl7qMe3e",
"parentPublication": {
"id": "proceedings/wacv/2023/9346/0",
"title": "2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600b084",
"title": "Barlow constrained optimization for Visual Question Answering",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600b084/1L8qm6uqYWQ",
"parentPublication": {
"id": "proceedings/wacv/2023/9346/0",
"title": "2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2019/3293/0/329300d190",
"title": "OK-VQA: A Visual Question Answering Benchmark Requiring External Knowledge",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300d190/1gyrWZg6U3S",
"parentPublication": {
"id": "proceedings/cvpr/2019/3293/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10102298",
"articleId": "1MjiZVom7F6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10102589",
"articleId": "1MkXT1k5GSc",
"__typename": "AdjacentArticleType"
},
"__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": "13rRUEgs2ts",
"doi": "10.1109/TVCG.2014.2346318",
"abstract": "Researchers from many domains use scientific visualization in their daily practice. Existing implementations of algorithms usually come with a graphical user interface (high-level interface), or as software library or source code (low-level interface). In this paper we present a system that integrates domain-specific languages (DSLs) and facilitates the creation of new DSLs. DSLs provide an effective interface for domain scientists avoiding the difficulties involved with low-level interfaces and at the same time offering more flexibility than high-level interfaces. We describe the design and implementation of ViSlang, an interpreted language specifically tailored for scientific visualization. A major contribution of our design is the extensibility of the ViSlang language. Novel DSLs that are tailored to the problems of the domain can be created and integrated into ViSlang. We show that our approach can be added to existing user interfaces to increase the flexibility for expert users on demand, but at the same time does not interfere with the user experience of novice users. To demonstrate the flexibility of our approach we present new DSLs for volume processing, querying and visualization. We report the implementation effort for new DSLs and compare our approach with Matlab and Python implementations in terms of run-time performance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Researchers from many domains use scientific visualization in their daily practice. Existing implementations of algorithms usually come with a graphical user interface (high-level interface), or as software library or source code (low-level interface). In this paper we present a system that integrates domain-specific languages (DSLs) and facilitates the creation of new DSLs. DSLs provide an effective interface for domain scientists avoiding the difficulties involved with low-level interfaces and at the same time offering more flexibility than high-level interfaces. We describe the design and implementation of ViSlang, an interpreted language specifically tailored for scientific visualization. A major contribution of our design is the extensibility of the ViSlang language. Novel DSLs that are tailored to the problems of the domain can be created and integrated into ViSlang. We show that our approach can be added to existing user interfaces to increase the flexibility for expert users on demand, but at the same time does not interfere with the user experience of novice users. To demonstrate the flexibility of our approach we present new DSLs for volume processing, querying and visualization. We report the implementation effort for new DSLs and compare our approach with Matlab and Python implementations in terms of run-time performance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Researchers from many domains use scientific visualization in their daily practice. Existing implementations of algorithms usually come with a graphical user interface (high-level interface), or as software library or source code (low-level interface). In this paper we present a system that integrates domain-specific languages (DSLs) and facilitates the creation of new DSLs. DSLs provide an effective interface for domain scientists avoiding the difficulties involved with low-level interfaces and at the same time offering more flexibility than high-level interfaces. We describe the design and implementation of ViSlang, an interpreted language specifically tailored for scientific visualization. A major contribution of our design is the extensibility of the ViSlang language. Novel DSLs that are tailored to the problems of the domain can be created and integrated into ViSlang. We show that our approach can be added to existing user interfaces to increase the flexibility for expert users on demand, but at the same time does not interfere with the user experience of novice users. To demonstrate the flexibility of our approach we present new DSLs for volume processing, querying and visualization. We report the implementation effort for new DSLs and compare our approach with Matlab and Python implementations in terms of run-time performance.",
"title": "ViSlang: A System for Interpreted Domain-Specific Languages for Scientific Visualization",
"normalizedTitle": "ViSlang: A System for Interpreted Domain-Specific Languages for Scientific Visualization",
"fno": "06876040",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"DSL",
"Data Visualization",
"Science General",
"Graphics Processing Units",
"Programming",
"Domain Specific Languages",
"Volume Visualization Framework",
"Domain Specific Languages",
"Volume Visualization"
],
"authors": [
{
"givenName": "Peter",
"surname": "Rautek",
"fullName": "Peter Rautek",
"affiliation": ", KAUST",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefan",
"surname": "Bruckner",
"fullName": "Stefan Bruckner",
"affiliation": ", University of Bergen",
"__typename": "ArticleAuthorType"
},
{
"givenName": "M. Eduard",
"surname": "Groller",
"fullName": "M. Eduard Groller",
"affiliation": ", Vienna University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Markus",
"surname": "Hadwiger",
"fullName": "Markus Hadwiger",
"affiliation": ", KAUST",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2388-2396",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/quatic/2012/4777/0/4777a342",
"title": "Usability Evaluation of Domain-Specific Languages",
"doi": null,
"abstractUrl": "/proceedings-article/quatic/2012/4777a342/12OmNBubOSe",
"parentPublication": {
"id": "proceedings/quatic/2012/4777/0",
"title": "2012 Eighth International Conference on the Quality of Information and Communications Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itcc/2005/2315/2/231520392",
"title": "Document-Oriented Software Construction based on Domain-Specific Markup Languages",
"doi": null,
"abstractUrl": "/proceedings-article/itcc/2005/231520392/12OmNs0kyxo",
"parentPublication": {
"id": "proceedings/itcc/2005/2315/1",
"title": "Proceedings. ITCC 2005 International Conference on Information Technology: Coding and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsea/2010/4144/0/4144a162",
"title": "Agile Engineering of Internal Domain-Specific Languages with Dynamic Programming Languages",
"doi": null,
"abstractUrl": "/proceedings-article/icsea/2010/4144a162/12OmNy3RRvZ",
"parentPublication": {
"id": "proceedings/icsea/2010/4144/0",
"title": "Software Engineering Advances, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2001/0981/0/00927269",
"title": "Configuring component-based specifications for domain-specific languages",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2001/00927269/12OmNzdoN19",
"parentPublication": {
"id": "proceedings/hicss/2001/0981/2",
"title": "Proceedings of the 34th Annual Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2009/04/mso2009040013",
"title": "A Pedagogical Framework for Domain-Specific Languages",
"doi": null,
"abstractUrl": "/magazine/so/2009/04/mso2009040013/13rRUIJcWjP",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2018/01/mcs2018010088",
"title": "Domain-Specific Languages in Scientific Computing",
"doi": null,
"abstractUrl": "/magazine/cs/2018/01/mcs2018010088/13rRUx0xPPx",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2009/06/tts2009060825",
"title": "A Model-Based Approach to Families of Embedded Domain-Specific Languages",
"doi": null,
"abstractUrl": "/journal/ts/2009/06/tts2009060825/13rRUx0xPk0",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2011/05/mmi2011050042",
"title": "Implementing Domain-Specific Languages for Heterogeneous Parallel Computing",
"doi": null,
"abstractUrl": "/magazine/mi/2011/05/mmi2011050042/13rRUxASusa",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/springsim/2020/370/0/09185475",
"title": "Scenario-Based Generation of Ontologies for Domain-Specific Languages",
"doi": null,
"abstractUrl": "/proceedings-article/springsim/2020/09185475/1mP61MnANDW",
"parentPublication": {
"id": "proceedings/springsim/2020/370/0",
"title": "2020 Spring Simulation Conference (SpringSim)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ser&ip/2021/4476/0/447600a049",
"title": "Towards a Systematic Engineering of Industrial Domain-Specific Languages",
"doi": null,
"abstractUrl": "/proceedings-article/ser&ip/2021/447600a049/1v2Qjh0BdGE",
"parentPublication": {
"id": "proceedings/ser&ip/2021/4476/0",
"title": "2021 IEEE/ACM 8th International Workshop on Software Engineering Research and Industrial Practice (SER&IP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06876031",
"articleId": "13rRUynHujd",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06875936",
"articleId": "13rRUxZRbo1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgLv",
"name": "ttg201412-06876040s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201412-06876040s1.zip",
"extension": "zip",
"size": "11.2 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": "13rRUxAAT0M",
"doi": "10.1109/TVCG.2010.144",
"abstract": "We investigate the design of declarative, domain-specific languages for constructing interactive visualizations. By separatingspecification from execution, declarative languages can simplify development, enable unobtrusive optimization, and supportretargeting across platforms. We describe the design of the Protovis specification language and its implementation within anobject-oriented, statically-typed programming language (Java). We demonstrate how to support rich visualizations without requiring atoolkit-specific data model and extend Protovis to enable declarative specification of animated transitions. To support cross-platformdeployment, we introduce rendering and event-handling infrastructures decoupled from the runtime platform, letting designers retargetvisualization specifications (e.g., from desktop to mobile phone) with reduced effort. We also explore optimizations such as runtimecompilation of visualization specifications, parallelized execution, and hardware-accelerated rendering. We present benchmark studiesmeasuring the performance gains provided by these optimizations and compare performance to existing Java-based visualizationtools, demonstrating scalability improvements exceeding an order of magnitude.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We investigate the design of declarative, domain-specific languages for constructing interactive visualizations. By separatingspecification from execution, declarative languages can simplify development, enable unobtrusive optimization, and supportretargeting across platforms. We describe the design of the Protovis specification language and its implementation within anobject-oriented, statically-typed programming language (Java). We demonstrate how to support rich visualizations without requiring atoolkit-specific data model and extend Protovis to enable declarative specification of animated transitions. To support cross-platformdeployment, we introduce rendering and event-handling infrastructures decoupled from the runtime platform, letting designers retargetvisualization specifications (e.g., from desktop to mobile phone) with reduced effort. We also explore optimizations such as runtimecompilation of visualization specifications, parallelized execution, and hardware-accelerated rendering. We present benchmark studiesmeasuring the performance gains provided by these optimizations and compare performance to existing Java-based visualizationtools, demonstrating scalability improvements exceeding an order of magnitude.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We investigate the design of declarative, domain-specific languages for constructing interactive visualizations. By separatingspecification from execution, declarative languages can simplify development, enable unobtrusive optimization, and supportretargeting across platforms. We describe the design of the Protovis specification language and its implementation within anobject-oriented, statically-typed programming language (Java). We demonstrate how to support rich visualizations without requiring atoolkit-specific data model and extend Protovis to enable declarative specification of animated transitions. To support cross-platformdeployment, we introduce rendering and event-handling infrastructures decoupled from the runtime platform, letting designers retargetvisualization specifications (e.g., from desktop to mobile phone) with reduced effort. We also explore optimizations such as runtimecompilation of visualization specifications, parallelized execution, and hardware-accelerated rendering. We present benchmark studiesmeasuring the performance gains provided by these optimizations and compare performance to existing Java-based visualizationtools, demonstrating scalability improvements exceeding an order of magnitude.",
"title": "Declarative Language Design for Interactive Visualization",
"normalizedTitle": "Declarative Language Design for Interactive Visualization",
"fno": "ttg2010061149",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Information Visualization",
"User Interfaces",
"Toolkits",
"Domain Specific Languages",
"Declarative Languages",
"Optimization"
],
"authors": [
{
"givenName": "Jeffrey",
"surname": "Heer",
"fullName": "Jeffrey Heer",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Bostock",
"fullName": "Michael Bostock",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2010-11-01 00:00:00",
"pubType": "trans",
"pages": "1149-1156",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icwe/2008/3261/0/3261a175",
"title": "Declarative Access Control for WebDSL: Combining Language Integration and Separation of Concerns",
"doi": null,
"abstractUrl": "/proceedings-article/icwe/2008/3261a175/12OmNqBtiQY",
"parentPublication": {
"id": "proceedings/icwe/2008/3261/0",
"title": "Web Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1995/7045/0/70450120",
"title": "A declarative programming environment based on constraints",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1995/70450120/12OmNrJAeey",
"parentPublication": {
"id": "proceedings/vl/1995/7045/0",
"title": "Visual Languages, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/edocw/2012/4786/0/4786a056",
"title": "Using Declarative Workflow Languages to Develop Process-Centric Web Applications",
"doi": null,
"abstractUrl": "/proceedings-article/edocw/2012/4786a056/12OmNrNh0Jd",
"parentPublication": {
"id": "proceedings/edocw/2012/4786/0",
"title": "2012 IEEE 16th International Enterprise Distributed Object Computing Conference Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2011/0445/0/04450511",
"title": "Unifying execution of imperative and declarative code",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2011/04450511/12OmNyo1o4x",
"parentPublication": {
"id": "proceedings/icse/2011/0445/0",
"title": "2011 33rd International Conference on Software Engineering (ICSE 2011)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2006/04/s4062",
"title": "Choosing a Programming Language",
"doi": null,
"abstractUrl": "/magazine/so/2006/04/s4062/13rRUB7a0Za",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2013/01/mso2013010090",
"title": "The Importance of Being Declarative",
"doi": null,
"abstractUrl": "/magazine/so/2013/01/mso2013010090/13rRUEgs2K4",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2007/04/s4016",
"title": "Declarative GUI Programming in Microsoft Windows",
"doi": null,
"abstractUrl": "/magazine/so/2007/04/s4016/13rRUwh80F7",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__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/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/2020/01/08809730",
"title": "P5: Portable Progressive Parallel Processing Pipelines for Interactive Data Analysis and Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08809730/1cHE2tYwF7a",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010061139",
"articleId": "13rRUxAAST1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010061157",
"articleId": "13rRUxZzAhz",
"__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": "17D45VTRotk",
"doi": "10.1109/TVCG.2018.2865141",
"abstract": "Multiclass maps are scatterplots, multidimensional projections, or thematic geographic maps where data points have a categorical attribute in addition to two quantitative attributes. This categorical attribute is often rendered using shape or color, which does not scale when overplotting occurs. When the number of data points increases, multiclass maps must resort to data aggregation to remain readable. We present multiclass density maps: multiple 2D histograms computed for each of the category values. Multiclass density maps are meant as a building block to improve the expressiveness and scalability of multiclass map visualization. In this article, we first present a short survey of aggregated multiclass maps, mainly from cartography. We then introduce a declarative model-a simple yet expressive JSON grammar associated with visual semantics-that specifies a wide design space of visualizations for multiclass density maps. Our declarative model is expressive and can be efficiently implemented in visualization front-ends such as modern web browsers. Furthermore, it can be reconfigured dynamically to support data exploration tasks without recomputing the raw data. Finally, we demonstrate how our model can be used to reproduce examples from the past and support exploring data at scale.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multiclass maps are scatterplots, multidimensional projections, or thematic geographic maps where data points have a categorical attribute in addition to two quantitative attributes. This categorical attribute is often rendered using shape or color, which does not scale when overplotting occurs. When the number of data points increases, multiclass maps must resort to data aggregation to remain readable. We present multiclass density maps: multiple 2D histograms computed for each of the category values. Multiclass density maps are meant as a building block to improve the expressiveness and scalability of multiclass map visualization. In this article, we first present a short survey of aggregated multiclass maps, mainly from cartography. We then introduce a declarative model-a simple yet expressive JSON grammar associated with visual semantics-that specifies a wide design space of visualizations for multiclass density maps. Our declarative model is expressive and can be efficiently implemented in visualization front-ends such as modern web browsers. Furthermore, it can be reconfigured dynamically to support data exploration tasks without recomputing the raw data. Finally, we demonstrate how our model can be used to reproduce examples from the past and support exploring data at scale.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multiclass maps are scatterplots, multidimensional projections, or thematic geographic maps where data points have a categorical attribute in addition to two quantitative attributes. This categorical attribute is often rendered using shape or color, which does not scale when overplotting occurs. When the number of data points increases, multiclass maps must resort to data aggregation to remain readable. We present multiclass density maps: multiple 2D histograms computed for each of the category values. Multiclass density maps are meant as a building block to improve the expressiveness and scalability of multiclass map visualization. In this article, we first present a short survey of aggregated multiclass maps, mainly from cartography. We then introduce a declarative model-a simple yet expressive JSON grammar associated with visual semantics-that specifies a wide design space of visualizations for multiclass density maps. Our declarative model is expressive and can be efficiently implemented in visualization front-ends such as modern web browsers. Furthermore, it can be reconfigured dynamically to support data exploration tasks without recomputing the raw data. Finally, we demonstrate how our model can be used to reproduce examples from the past and support exploring data at scale.",
"title": "A Declarative Rendering Model for Multiclass Density Maps",
"normalizedTitle": "A Declarative Rendering Model for Multiclass Density Maps",
"fno": "08440817",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Cartography",
"Data Aggregation",
"Data Analysis",
"Data Visualisation",
"Grammars",
"Online Front Ends",
"Rendering Computer Graphics",
"Multiclass Density Maps",
"Categorical Attribute",
"Multiclass Map Visualization",
"Aggregated Multiclass Maps",
"Expressive JSON Grammar",
"Declarative Rendering Model",
"Scatterplots",
"Multidimensional Projections",
"Thematic Geographic Maps",
"Data Aggregation",
"Multiple 2 D Histograms",
"Visualization Front Ends",
"Modern Web Browsers",
"Data Visualization",
"Image Color Analysis",
"Task Analysis",
"Scalability",
"Visualization",
"Computational Modeling",
"Rendering Computer Graphics",
"Scalability",
"Multiclass Scatterplots",
"Density Maps",
"Aggregation",
"Declarative Specification",
"Visualization Grammar"
],
"authors": [
{
"givenName": "Jaemin",
"surname": "Jo",
"fullName": "Jaemin Jo",
"affiliation": "Seoul National University, Republic of Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Frédéric",
"surname": "Vernier",
"fullName": "Frédéric Vernier",
"affiliation": "LIMSICNRSUniv. Paris-SudUniversité Paris-Saclay",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pierre",
"surname": "Dragicevic",
"fullName": "Pierre Dragicevic",
"affiliation": "Inria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean-Daniel",
"surname": "Fekete",
"fullName": "Jean-Daniel Fekete",
"affiliation": "Inria",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "470-480",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2011/935/0/05742384",
"title": "Interactive visualization of multivariate trajectory data with density maps",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742384/12OmNqAU6rq",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2016/2239/0/07515942",
"title": "Visual abstraction improvement of interactive dot map",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2016/07515942/12OmNxEBz1D",
"parentPublication": {
"id": "proceedings/snpd/2016/2239/0",
"title": "2016 17th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2012/01/mcg2012010056",
"title": "Interactive Density Maps for Moving Objects",
"doi": null,
"abstractUrl": "/magazine/cg/2012/01/mcg2012010056/13rRUwcS1uV",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/09/ttg2013091438",
"title": "Bristle Maps: A Multivariate Abstraction Technique for Geovisualization",
"doi": null,
"abstractUrl": "/journal/tg/2013/09/ttg2013091438/13rRUxASuGk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122556",
"title": "Spatial Text Visualization Using Automatic Typographic Maps",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122556/13rRUxNmPDR",
"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/2023/01/09909991",
"title": "A Framework for Multiclass Contour Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09909991/1HcjalbroGY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807296",
"title": "GenerativeMap: Visualization and Exploration of Dynamic Density Maps via Generative Learning Model",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807296/1cG6usdi8aQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933709",
"title": "Hi-D Maps: An Interactive Visualization Technique for Multi-Dimensional Categorical Data",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933709/1fTgGSW14Q0",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (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": "08456575",
"articleId": "17D45VUZMTZ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440820",
"articleId": "17D45Xtvp8C",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1L8lPE0ODrG",
"title": "April",
"year": "2023",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zTfZV1Ocnu",
"doi": "10.1109/TVCG.2021.3140153",
"abstract": "Ensemble simulation is a crucial method to handle potential uncertainty in modern simulation and has been widely applied in many disciplines. Many ensemble contour visualization methods have been introduced to facilitate ensemble data analysis. On the basis of deep exploration and summarization of existing techniques and domain requirements, we propose a unified framework of ensemble contour visualization, <italic>EnConVis (Ensemble Contour Visualization)</italic>, which systematically combines state-of-the-art methods. We model ensemble contour visualization as a four-step pipeline consisting of four essential procedures: member filtering, point-wise modeling, uncertainty band extraction, and visual mapping. For each of the four essential procedures, we compare different methods they use, analyze their pros and cons, highlight research gaps, and attempt to fill them. Specifically, we add Kernel Density Estimation in the point-wise modeling procedure and multi-layer extraction in the uncertainty band extraction procedure. This step shows the ensemble data’s details accurately and provides abstract levels. We also analyze existing methods from a global perspective. We investigate their mechanisms and compare their effects, on the basis of which, we offer selection guidelines for them. From the overall perspective of this framework, we find choices and combinations that have not been tried before, which can be well compensated by our method. Synthetic data and real-world data are leveraged to verify the efficacy of our method. Domain experts’ feedback suggests that our approach helps them better understand ensemble data analysis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Ensemble simulation is a crucial method to handle potential uncertainty in modern simulation and has been widely applied in many disciplines. Many ensemble contour visualization methods have been introduced to facilitate ensemble data analysis. On the basis of deep exploration and summarization of existing techniques and domain requirements, we propose a unified framework of ensemble contour visualization, <italic>EnConVis (Ensemble Contour Visualization)</italic>, which systematically combines state-of-the-art methods. We model ensemble contour visualization as a four-step pipeline consisting of four essential procedures: member filtering, point-wise modeling, uncertainty band extraction, and visual mapping. For each of the four essential procedures, we compare different methods they use, analyze their pros and cons, highlight research gaps, and attempt to fill them. Specifically, we add Kernel Density Estimation in the point-wise modeling procedure and multi-layer extraction in the uncertainty band extraction procedure. This step shows the ensemble data’s details accurately and provides abstract levels. We also analyze existing methods from a global perspective. We investigate their mechanisms and compare their effects, on the basis of which, we offer selection guidelines for them. From the overall perspective of this framework, we find choices and combinations that have not been tried before, which can be well compensated by our method. Synthetic data and real-world data are leveraged to verify the efficacy of our method. Domain experts’ feedback suggests that our approach helps them better understand ensemble data analysis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Ensemble simulation is a crucial method to handle potential uncertainty in modern simulation and has been widely applied in many disciplines. Many ensemble contour visualization methods have been introduced to facilitate ensemble data analysis. On the basis of deep exploration and summarization of existing techniques and domain requirements, we propose a unified framework of ensemble contour visualization, EnConVis (Ensemble Contour Visualization), which systematically combines state-of-the-art methods. We model ensemble contour visualization as a four-step pipeline consisting of four essential procedures: member filtering, point-wise modeling, uncertainty band extraction, and visual mapping. For each of the four essential procedures, we compare different methods they use, analyze their pros and cons, highlight research gaps, and attempt to fill them. Specifically, we add Kernel Density Estimation in the point-wise modeling procedure and multi-layer extraction in the uncertainty band extraction procedure. This step shows the ensemble data’s details accurately and provides abstract levels. We also analyze existing methods from a global perspective. We investigate their mechanisms and compare their effects, on the basis of which, we offer selection guidelines for them. From the overall perspective of this framework, we find choices and combinations that have not been tried before, which can be well compensated by our method. Synthetic data and real-world data are leveraged to verify the efficacy of our method. Domain experts’ feedback suggests that our approach helps them better understand ensemble data analysis.",
"title": "<italic>EnConVis</italic>: A Unified Framework for Ensemble Contour Visualization",
"normalizedTitle": "EnConVis: A Unified Framework for Ensemble Contour Visualization",
"fno": "09669058",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Statistical Analysis",
"En Con Vis",
"Ensemble Contour Visualization",
"Ensemble Data Analysis",
"Ensemble Simulation",
"Kernel Density Estimation",
"Member Filtering Procedure",
"Point Wise Modeling Procedure",
"Uncertainty Band Extraction Procedure",
"Visual Mapping Procedure",
"Data Visualization",
"Uncertainty",
"Data Models",
"Computational Modeling",
"Feature Extraction",
"Visualization",
"Analytical Models",
"Uncertainty Visualization",
"Ensemble Visualization",
"Visualization Framework",
"Contour Visualization"
],
"authors": [
{
"givenName": "Mingdong",
"surname": "Zhang",
"fullName": "Mingdong Zhang",
"affiliation": "School of Software, BNRist, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Quan",
"surname": "Li",
"fullName": "Quan Li",
"affiliation": "School of Information Science and Technology, ShanghaiTech University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Li",
"surname": "Chen",
"fullName": "Li Chen",
"affiliation": "School of Software, BNRist, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoru",
"surname": "Yuan",
"fullName": "Xiaoru Yuan",
"affiliation": "Key Lab of Machine Perception (MoE), School of AINational Engineering Laboratory of Big Data Analysis and Application, Peking University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Junhai",
"surname": "Yong",
"fullName": "Junhai Yong",
"affiliation": "School of Software, BNRist, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "2067-2079",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdmw/2009/3902/0/05360497",
"title": "Ensemble-Vis: A Framework for the Statistical Visualization of Ensemble Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2009/05360497/12OmNya72rr",
"parentPublication": {
"id": "proceedings/icdmw/2009/3902/0",
"title": "2009 IEEE International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/09/08405549",
"title": "Visualization and Visual Analysis of Ensemble Data: A Survey",
"doi": null,
"abstractUrl": "/journal/tg/2019/09/08405549/13rRUIIVlcV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061421",
"title": "Noodles: A Tool for Visualization of Numerical Weather Model Ensemble Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061421/13rRUILtJm4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2016/03/mcg2016030060",
"title": "Evaluating Shape Alignment via Ensemble Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2016/03/mcg2016030060/13rRUxASu3j",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122713",
"title": "Contour Boxplots: A Method for Characterizing Uncertainty in Feature Sets from Simulation Ensembles",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122713/13rRUxd2aZ1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/10/07352364",
"title": "Modality-Driven Classification and Visualization of Ensemble Variance",
"doi": null,
"abstractUrl": "/journal/tg/2016/10/07352364/13rRUyp7tWZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/09/07055260",
"title": "Uncertainty-Aware Multidimensional Ensemble Data Visualization and Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2015/09/07055260/13rRUyuegp9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09905423",
"title": "Visualizing Ensemble Predictions of Music Mood",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09905423/1H2libIERoY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222092",
"title": "Uncertainty-Oriented Ensemble Data Visualization and Exploration using Variable Spatial Spreading",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222092/1nTqGJRtSIU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis4dh/2021/1370/0/137000a012",
"title": "Uncertainty-aware Topic Modeling Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vis4dh/2021/137000a012/1yNiG9yU9JS",
"parentPublication": {
"id": "proceedings/vis4dh/2021/1370/0",
"title": "2021 IEEE 6th Workshop on Visualization for the Digital Humanities (VIS4DH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09668999",
"articleId": "1zTfZzq1wqY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09669131",
"articleId": "1zTg06F4VTq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1L8lT24gujK",
"name": "ttg202304-09669058s1-supp1-3140153.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202304-09669058s1-supp1-3140153.pdf",
"extension": "pdf",
"size": "1.85 MB",
"__typename": "WebExtraType"
},
{
"id": "1L8lSX3rIT6",
"name": "ttg202304-09669058s1-supp2-3140153.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202304-09669058s1-supp2-3140153.mp4",
"extension": "mp4",
"size": "18.4 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1BoctALNVRu",
"title": "Jan.-March",
"year": "2022",
"issueNum": "01",
"idPrefix": "ta",
"pubType": "journal",
"volume": "13",
"label": "Jan.-March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1bpYyZwW1kk",
"doi": "10.1109/TAFFC.2019.2926724",
"abstract": "We propose a multi-task ensemble framework that jointly learns multiple related problems. The ensemble model aims to leverage the learned representations of three deep learning models (i.e., CNN, LSTM and GRU) and a hand-crafted feature representation for the predictions. Through multi-task framework, we address four problems of emotion and sentiment analysis, i.e., “emotion <italic>classification</italic> & <italic>intensity</italic>”, “<italic>valence</italic>, <italic>arousal</italic> & <italic>dominance</italic> for emotion”, “<italic>valence</italic> & <italic>arousal</italic> for sentiment”, and “<italic>3-class categorical</italic> & <italic>5-class ordinal classification</italic> for sentiment”. The underlying problems cover two granularity (i.e., <italic>coarse-grained</italic> and <italic>fine-grained</italic>) and a diverse range of domains (i.e., <italic>tweets</italic>, <italic>Facebook posts</italic>, <italic>news headlines</italic>, <italic>blogs</italic>, <italic>letters</italic> etc.). Experimental results suggest that the proposed multi-task framework outperforms the single-task frameworks in all experiments.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose a multi-task ensemble framework that jointly learns multiple related problems. The ensemble model aims to leverage the learned representations of three deep learning models (i.e., CNN, LSTM and GRU) and a hand-crafted feature representation for the predictions. Through multi-task framework, we address four problems of emotion and sentiment analysis, i.e., “emotion <italic>classification</italic> & <italic>intensity</italic>”, “<italic>valence</italic>, <italic>arousal</italic> & <italic>dominance</italic> for emotion”, “<italic>valence</italic> & <italic>arousal</italic> for sentiment”, and “<italic>3-class categorical</italic> & <italic>5-class ordinal classification</italic> for sentiment”. The underlying problems cover two granularity (i.e., <italic>coarse-grained</italic> and <italic>fine-grained</italic>) and a diverse range of domains (i.e., <italic>tweets</italic>, <italic>Facebook posts</italic>, <italic>news headlines</italic>, <italic>blogs</italic>, <italic>letters</italic> etc.). Experimental results suggest that the proposed multi-task framework outperforms the single-task frameworks in all experiments.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose a multi-task ensemble framework that jointly learns multiple related problems. The ensemble model aims to leverage the learned representations of three deep learning models (i.e., CNN, LSTM and GRU) and a hand-crafted feature representation for the predictions. Through multi-task framework, we address four problems of emotion and sentiment analysis, i.e., “emotion classification & intensity”, “valence, arousal & dominance for emotion”, “valence & arousal for sentiment”, and “3-class categorical & 5-class ordinal classification for sentiment”. The underlying problems cover two granularity (i.e., coarse-grained and fine-grained) and a diverse range of domains (i.e., tweets, Facebook posts, news headlines, blogs, letters etc.). Experimental results suggest that the proposed multi-task framework outperforms the single-task frameworks in all experiments.",
"title": "<italic>All-in-One:</italic> Emotion, Sentiment and Intensity Prediction Using a Multi-Task Ensemble Framework",
"normalizedTitle": "All-in-One: Emotion, Sentiment and Intensity Prediction Using a Multi-Task Ensemble Framework",
"fno": "08756111",
"hasPdf": true,
"idPrefix": "ta",
"keywords": [
"Learning Artificial Intelligence",
"Pattern Classification",
"Sentiment Analysis",
"Social Networking Online",
"Intensity Prediction",
"Multitask Ensemble Framework",
"Ensemble Model",
"Learned Representations",
"Deep Learning Models",
"Hand Crafted Feature Representation",
"Multitask Framework",
"Sentiment Analysis",
"Single Task Frameworks",
"Emotion Classification And Intensity",
"Task Analysis",
"Hidden Markov Models",
"Sentiment Analysis",
"Deep Learning",
"Computational Modeling",
"Predictive Models",
"Organizations",
"Emotion Analysis",
"Sentiment Analysis",
"Intensity Prediction",
"Valence Prediction",
"Arousal Prediction",
"Dominance Prediction",
"Coarse Grained Emotion Analysis",
"Fine Grained Emotion Analysis",
"Fine Grained Sentiment Analysis",
"Multi Layer Perceptron",
"Ensemble"
],
"authors": [
{
"givenName": "Md Shad",
"surname": "Akhtar",
"fullName": "Md Shad Akhtar",
"affiliation": "Department of Computer Science & Engineering, Indian Institute of Technology Patna, Bihar, India",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Deepanway",
"surname": "Ghosal",
"fullName": "Deepanway Ghosal",
"affiliation": "School of Computer Science and Engineering, Nanyang Technological University, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Asif",
"surname": "Ekbal",
"fullName": "Asif Ekbal",
"affiliation": "Department of Computer Science & Engineering, Indian Institute of Technology Patna, Bihar, India",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pushpak",
"surname": "Bhattacharyya",
"fullName": "Pushpak Bhattacharyya",
"affiliation": "Department of Computer Science & Engineering, Indian Institute of Technology Patna, Bihar, India",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sadao",
"surname": "Kurohashi",
"fullName": "Sadao Kurohashi",
"affiliation": "Department of Intelligence Science and Technology, Kyoto University, Kyoto, Japan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "285-297",
"year": "2022",
"issn": "1949-3045",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/msr/2016/4186/0/07832903",
"title": "Sentiment Analysis in Tickets for IT Support",
"doi": null,
"abstractUrl": "/proceedings-article/msr/2016/07832903/12OmNBC8AtQ",
"parentPublication": {
"id": "proceedings/msr/2016/4186/0",
"title": "2016 IEEE/ACM 13th Working Conference on Mining Software Repositories (MSR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ishc/2021/6743/0/674300a120",
"title": "Exploring Neighborhood Service and Development Strategies by Multi-dimensional Sentiment Analysis of Online Restaurant Review",
"doi": null,
"abstractUrl": "/proceedings-article/ishc/2021/674300a120/1EBWeIA70ZO",
"parentPublication": {
"id": "proceedings/ishc/2021/6743/0",
"title": "2021 3rd International Symposium on Smart and Healthy Cities (ISHC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/5555/01/09865200",
"title": "<italic>DeepContext:</italic> Mobile Context Modeling and Prediction Via HMMs and Deep Learning",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/09865200/1G4AyNfIfII",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccict/2022/7224/0/722400a388",
"title": "Video Based Sentiment Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ccict/2022/722400a388/1HpE09ObkFq",
"parentPublication": {
"id": "proceedings/ccict/2022/7224/0",
"title": "2022 Fifth International Conference on Computational Intelligence and Communication Technologies (CCICT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aike/2022/7120/0/712000a082",
"title": "A Sentiment Analysis Based Stock Recommendation System",
"doi": null,
"abstractUrl": "/proceedings-article/aike/2022/712000a082/1IbQobAB2hy",
"parentPublication": {
"id": "proceedings/aike/2022/7120/0",
"title": "2022 IEEE Fifth International Conference on Artificial Intelligence and Knowledge Engineering (AIKE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/5555/01/09991064",
"title": "Ranking top-<italic>k</italic> trees in tree-based phylogenetic networks",
"doi": null,
"abstractUrl": "/journal/tb/5555/01/09991064/1J9xS2tlx2o",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/5555/01/10017359",
"title": "Hybrid Regularizations for Multi-Aspect Category Sentiment Analysis",
"doi": null,
"abstractUrl": "/journal/ta/5555/01/10017359/1JYYDjldt5e",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10109879",
"title": "Dual Consistency-enhanced Semi-supervised Sentiment Analysis towards COVID-19 Tweets",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10109879/1MGxICeWfoA",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2019/05/08802324",
"title": "Sentiment and Emotion in Software Engineering",
"doi": null,
"abstractUrl": "/magazine/so/2019/05/08802324/1cw1E0bu0A8",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsc/2021/8899/0/889900a404",
"title": "Estimating Sentiment in Social Media - a Case Study of the Migrant Caravans News on Twitter",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2021/889900a404/1rFzVRp8hX2",
"parentPublication": {
"id": "proceedings/icsc/2021/8899/0",
"title": "2021 IEEE 15th International Conference on Semantic Computing (ICSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08747404",
"articleId": "1bcHku7UUI8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08897617",
"articleId": "1eVthVfa6M8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1CAPghPMNWw",
"title": "April",
"year": "2022",
"issueNum": "04",
"idPrefix": "ts",
"pubType": "journal",
"volume": "48",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1lZA3D0k1A4",
"doi": "10.1109/TSE.2020.3013716",
"abstract": "<italic>Grammars</italic> can serve as <italic>producers</italic> for structured test inputs that are syntactically correct by construction. A probabilistic grammar assigns probabilities to individual productions, thus controlling the distribution of input elements. Using the grammars as input parsers, we show how to <italic>learn input distributions from input samples,</italic> allowing to create inputs that are <italic>similar</italic> to the sample; by <italic>inverting</italic> the probabilities, we can create inputs that are <italic>dissimilar</italic> to the sample. This allows for three <italic>test generation strategies</italic>: 1) “Common inputs”–by learning from common inputs, we can create inputs that are <italic>similar</italic> to the sample; this is useful for regression testing. 2) “Uncommon inputs”–learning from common inputs and inverting probabilities yields inputs that are <italic>strongly dissimilar</italic> to the sample; this is useful for completing a test suite with “inputs from hell” that test uncommon features, yet are syntactically valid. 3) “Failure-inducing inputs”–learning from inputs that caused failures in the past gives us inputs that share similar features and thus also have a <italic>high chance of triggering bugs</italic>; this is useful for testing the completeness of fixes. Our evaluation on three common input formats (JSON, JavaScript, CSS) shows the effectiveness of these approaches. Results show that “common inputs” reproduced 96 percent of the methods induced by the samples. In contrast, for almost all subjects (95 percent), the “uncommon inputs” covered significantly different methods from the samples. Learning from failure-inducing samples reproduced all exceptions (100 percent) triggered by the failure-inducing samples and discovered new exceptions not found in any of the samples learned from.",
"abstracts": [
{
"abstractType": "Regular",
"content": "<italic>Grammars</italic> can serve as <italic>producers</italic> for structured test inputs that are syntactically correct by construction. A probabilistic grammar assigns probabilities to individual productions, thus controlling the distribution of input elements. Using the grammars as input parsers, we show how to <italic>learn input distributions from input samples,</italic> allowing to create inputs that are <italic>similar</italic> to the sample; by <italic>inverting</italic> the probabilities, we can create inputs that are <italic>dissimilar</italic> to the sample. This allows for three <italic>test generation strategies</italic>: 1) “Common inputs”–by learning from common inputs, we can create inputs that are <italic>similar</italic> to the sample; this is useful for regression testing. 2) “Uncommon inputs”–learning from common inputs and inverting probabilities yields inputs that are <italic>strongly dissimilar</italic> to the sample; this is useful for completing a test suite with “inputs from hell” that test uncommon features, yet are syntactically valid. 3) “Failure-inducing inputs”–learning from inputs that caused failures in the past gives us inputs that share similar features and thus also have a <italic>high chance of triggering bugs</italic>; this is useful for testing the completeness of fixes. Our evaluation on three common input formats (JSON, JavaScript, CSS) shows the effectiveness of these approaches. Results show that “common inputs” reproduced 96 percent of the methods induced by the samples. In contrast, for almost all subjects (95 percent), the “uncommon inputs” covered significantly different methods from the samples. Learning from failure-inducing samples reproduced all exceptions (100 percent) triggered by the failure-inducing samples and discovered new exceptions not found in any of the samples learned from.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Grammars can serve as producers for structured test inputs that are syntactically correct by construction. A probabilistic grammar assigns probabilities to individual productions, thus controlling the distribution of input elements. Using the grammars as input parsers, we show how to learn input distributions from input samples, allowing to create inputs that are similar to the sample; by inverting the probabilities, we can create inputs that are dissimilar to the sample. This allows for three test generation strategies: 1) “Common inputs”–by learning from common inputs, we can create inputs that are similar to the sample; this is useful for regression testing. 2) “Uncommon inputs”–learning from common inputs and inverting probabilities yields inputs that are strongly dissimilar to the sample; this is useful for completing a test suite with “inputs from hell” that test uncommon features, yet are syntactically valid. 3) “Failure-inducing inputs”–learning from inputs that caused failures in the past gives us inputs that share similar features and thus also have a high chance of triggering bugs; this is useful for testing the completeness of fixes. Our evaluation on three common input formats (JSON, JavaScript, CSS) shows the effectiveness of these approaches. Results show that “common inputs” reproduced 96 percent of the methods induced by the samples. In contrast, for almost all subjects (95 percent), the “uncommon inputs” covered significantly different methods from the samples. Learning from failure-inducing samples reproduced all exceptions (100 percent) triggered by the failure-inducing samples and discovered new exceptions not found in any of the samples learned from.",
"title": "Inputs From Hell:",
"normalizedTitle": "Inputs From Hell:",
"fno": "09154602",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Grammar",
"Production",
"Probabilistic Logic",
"Computer Bugs",
"Software",
"Test Pattern Generators",
"Test Case Generation",
"Probabilistic Grammars",
"Input Samples"
],
"authors": [
{
"givenName": "Ezekiel",
"surname": "Soremekun",
"fullName": "Ezekiel Soremekun",
"affiliation": "Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Esteban",
"surname": "Pavese",
"fullName": "Esteban Pavese",
"affiliation": "Department of Computer Science, Humboldt-Universität zu Berlin, Berlin, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nikolas",
"surname": "Havrikov",
"fullName": "Nikolas Havrikov",
"affiliation": "CISPA Helmholtz Center for Information Security, Saarbrucken, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lars",
"surname": "Grunske",
"fullName": "Lars Grunske",
"affiliation": "Department of Computer Science, Humboldt-Universität zu Berlin, Berlin, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andreas",
"surname": "Zeller",
"fullName": "Andreas Zeller",
"affiliation": "CISPA Helmholtz Center for Information Security, Saarbrucken, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2022-04-01 00:00:00",
"pubType": "trans",
"pages": "1138-1153",
"year": "2022",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dsn/2013/6471/0/06575303",
"title": "Automating the debugging of datacenter applications with ADDA",
"doi": null,
"abstractUrl": "/proceedings-article/dsn/2013/06575303/12OmNAYoKkh",
"parentPublication": {
"id": "proceedings/dsn/2013/6471/0",
"title": "2013 43rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-c/2017/1589/0/07965377",
"title": "Local Analysis for Global Inputs",
"doi": null,
"abstractUrl": "/proceedings-article/icse-c/2017/07965377/12OmNxXUhWQ",
"parentPublication": {
"id": "proceedings/icse-c/2017/1589/0",
"title": "2017 IEEE/ACM 39th International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/12/09678017",
"title": "<sc>Astraea</sc>: Grammar-Based Fairness Testing",
"doi": null,
"abstractUrl": "/journal/ts/2022/12/09678017/1A4Sz68iffO",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/09/09618831",
"title": "Critique of “MemXCT: Memory-Centric X-Ray CT Reconstruction With Massive Parallelization” by SCC Team From University of California San Diego",
"doi": null,
"abstractUrl": "/journal/td/2022/09/09618831/1AvqQ4P7RE4",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2022/01/08756111",
"title": "<italic>All-in-One:</italic> Emotion, Sentiment and Intensity Prediction Using a Multi-Task Ensemble Framework",
"doi": null,
"abstractUrl": "/journal/ta/2022/01/08756111/1bpYyZwW1kk",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-companion/2019/1764/0/176400a244",
"title": "Optimizing Seed Inputs in Fuzzing with Machine Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icse-companion/2019/176400a244/1cJ7kNgF8jK",
"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/cvpr/2020/7168/0/716800c366",
"title": "Resolution Adaptive Networks for Efficient Inference",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800c366/1m3nPFGNVAI",
"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/focs/2020/9621/0/962100a001",
"title": "Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2020/962100a001/1qyxxzV50hq",
"parentPublication": {
"id": "proceedings/focs/2020/9621/0",
"title": "2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2022/10/09361223",
"title": "Adapting to Unknown Conditions in Learning-Based Mobile Sensing",
"doi": null,
"abstractUrl": "/journal/tm/2022/10/09361223/1rsezDBBjvG",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2021/0296/0/029600a699",
"title": "Input Algebras",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2021/029600a699/1sEXoq8CSaI",
"parentPublication": {
"id": "proceedings/icse/2021/0296/0/",
"title": "2021 IEEE/ACM 43rd International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09153947",
"articleId": "1lUB9DzMHAc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09159928",
"articleId": "1m3mb2AShfa",
"__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": "17D45Vw15v5",
"doi": "10.1109/TVCG.2018.2865145",
"abstract": "Recently, an increasing number of visualization systems have begun to incorporate natural language generation (NLG) capabilities into their interfaces. NLG-based visualization systems typically leverage a suite of statistical functions to automatically extract key facts about the underlying data and surface them as natural language sentences alongside visualizations. With current systems, users are typically required to read the system-generated sentences and mentally map them back to the accompanying visualization. However, depending on the features of the visualization (e.g., visualization type, data density) and the complexity of the data fact, mentally mapping facts to visualizations can be a challenging task. Furthermore, more than one visualization could be used to illustrate a single data fact. Unfortunately, current tools provide little or no support for users to explore such alternatives. In this paper, we explore how system-generated data facts can be treated as interactive widgets to help users interpret visualizations and communicate their findings. We present Voder, a system that lets users interact with automatically-generated data facts to explore both alternative visualizations to convey a data fact as well as a set of embellishments to highlight a fact within a visualization. Leveraging data facts as interactive widgets, Voder also facilitates data fact-based visualization search. To assess Voder's design and features, we conducted a preliminary user study with 12 participants having varying levels of experience with visualization tools. Participant feedback suggested that interactive data facts aided them in interpreting visualizations. Participants also stated that the suggestions surfaced through the facts helped them explore alternative visualizations and embellishments to communicate individual data facts.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recently, an increasing number of visualization systems have begun to incorporate natural language generation (NLG) capabilities into their interfaces. NLG-based visualization systems typically leverage a suite of statistical functions to automatically extract key facts about the underlying data and surface them as natural language sentences alongside visualizations. With current systems, users are typically required to read the system-generated sentences and mentally map them back to the accompanying visualization. However, depending on the features of the visualization (e.g., visualization type, data density) and the complexity of the data fact, mentally mapping facts to visualizations can be a challenging task. Furthermore, more than one visualization could be used to illustrate a single data fact. Unfortunately, current tools provide little or no support for users to explore such alternatives. In this paper, we explore how system-generated data facts can be treated as interactive widgets to help users interpret visualizations and communicate their findings. We present Voder, a system that lets users interact with automatically-generated data facts to explore both alternative visualizations to convey a data fact as well as a set of embellishments to highlight a fact within a visualization. Leveraging data facts as interactive widgets, Voder also facilitates data fact-based visualization search. To assess Voder's design and features, we conducted a preliminary user study with 12 participants having varying levels of experience with visualization tools. Participant feedback suggested that interactive data facts aided them in interpreting visualizations. Participants also stated that the suggestions surfaced through the facts helped them explore alternative visualizations and embellishments to communicate individual data facts.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recently, an increasing number of visualization systems have begun to incorporate natural language generation (NLG) capabilities into their interfaces. NLG-based visualization systems typically leverage a suite of statistical functions to automatically extract key facts about the underlying data and surface them as natural language sentences alongside visualizations. With current systems, users are typically required to read the system-generated sentences and mentally map them back to the accompanying visualization. However, depending on the features of the visualization (e.g., visualization type, data density) and the complexity of the data fact, mentally mapping facts to visualizations can be a challenging task. Furthermore, more than one visualization could be used to illustrate a single data fact. Unfortunately, current tools provide little or no support for users to explore such alternatives. In this paper, we explore how system-generated data facts can be treated as interactive widgets to help users interpret visualizations and communicate their findings. We present Voder, a system that lets users interact with automatically-generated data facts to explore both alternative visualizations to convey a data fact as well as a set of embellishments to highlight a fact within a visualization. Leveraging data facts as interactive widgets, Voder also facilitates data fact-based visualization search. To assess Voder's design and features, we conducted a preliminary user study with 12 participants having varying levels of experience with visualization tools. Participant feedback suggested that interactive data facts aided them in interpreting visualizations. Participants also stated that the suggestions surfaced through the facts helped them explore alternative visualizations and embellishments to communicate individual data facts.",
"title": "Augmenting Visualizations with Interactive Data Facts to Facilitate Interpretation and Communication",
"normalizedTitle": "Augmenting Visualizations with Interactive Data Facts to Facilitate Interpretation and Communication",
"fno": "08440860",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Natural Language Processing",
"Natural Language Generation",
"Statistical Functions",
"Data Fact Based Visualization Search",
"Voder Design",
"Visualization Tools",
"Automatically Generated Data Facts",
"Interactive Widgets",
"System Generated Data Facts",
"Data Density",
"System Generated Sentences",
"Natural Language Sentences",
"NLG Based Visualization Systems",
"Interactive Data Facts",
"Augmenting Visualizations",
"Data Visualization",
"Tools",
"Visualization",
"Natural Languages",
"Data Mining",
"Histograms",
"Complexity Theory",
"Natural Language Generation",
"Mixed Initiative Interaction",
"Visualization Recommendation",
"Data Driven Communication"
],
"authors": [
{
"givenName": "Arjun",
"surname": "Srinivasan",
"fullName": "Arjun Srinivasan",
"affiliation": "Georgia Institute of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steven M.",
"surname": "Drucker",
"fullName": "Steven M. Drucker",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alex",
"surname": "Endert",
"fullName": "Alex Endert",
"affiliation": "Georgia Institute of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Stasko",
"fullName": "John Stasko",
"affiliation": "Georgia Institute of Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "672-681",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icse-c/2016/4205/0/4205a605",
"title": "Toward Arbitrary Mapping for Debugging Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/icse-c/2016/4205a605/12OmNASraVb",
"parentPublication": {
"id": "proceedings/icse-c/2016/4205/0",
"title": "2016 IEEE/ACM 38th International Conference on Software Engineering Companion (ICSE-C)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/08/07563865",
"title": "How Progressive Visualizations Affect Exploratory Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2017/08/07563865/13rRUNvya9q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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/2019/01/08440818",
"title": "Looks Good To Me: Visualizations As Sanity Checks",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440818/17D45W2WyxG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903602",
"title": "Comparison Conundrum and the Chamber of Visualizations: An Exploration of How Language Influences Visual Design",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903602/1GZokBOfm2A",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv-2/2019/2850/0/285000a116",
"title": "Visual (dis)Confirmation: Validating Models and Hypotheses with Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/iv-2/2019/285000a116/1cMEOINHDQk",
"parentPublication": {
"id": "proceedings/iv-2/2019/2850/0",
"title": "2019 23rd International Conference in Information Visualization – Part II",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/08/09023002",
"title": "Interweaving Multimodal Interaction With Flexible Unit Visualizations for Data Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2021/08/09023002/1hTHRTEQgRG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/beliv/2020/9642/0/964200a019",
"title": "How to evaluate data visualizations across different levels of understanding",
"doi": null,
"abstractUrl": "/proceedings-article/beliv/2020/964200a019/1q0FOQPpIic",
"parentPublication": {
"id": "proceedings/beliv/2020/9642/0",
"title": "2020 IEEE Workshop on Evaluation and Beyond - Methodological Approaches to Visualization (BELIV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09395231",
"title": "Deep Colormap Extraction From Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09395231/1syq9xMMQY8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440810",
"articleId": "17D45WwsQ5M",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08443395",
"articleId": "17D45XDIXWb",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFpJ",
"name": "ttg201901-08440860s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440860s1.zip",
"extension": "zip",
"size": "43.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": "1nTqMd2ZViE",
"doi": "10.1109/TVCG.2020.3030367",
"abstract": "Recent graphical interfaces offer direct manipulation mechanisms for authoring visualizations, but are largely restricted to static output. To author interactive visualizations, users must instead turn to textual specification, but such approaches impose a higher technical burden. To bridge this gap, we introduce Lyra 2, a system that extends a prior visualization design environment with novel methods for authoring interaction techniques by demonstration. Users perform an interaction (e.g., button clicks, drags, or key presses) directly on the visualization they are editing. The system interprets this performance using a set of heuristics and enumerates suggestions of possible interaction designs. These heuristics account for the properties of the interaction (e.g., target and event type) as well as the visualization (e.g., mark and scale types, and multiple views). Interaction design suggestions are displayed as thumbnails; users can preview and test these suggestions, iteratively refine them through additional demonstrations, and finally apply and customize them via property inspectors. We evaluate our approach through a gallery of diverse examples, and evaluate its usability through a first-use study and via an analysis of its cognitive dimensions. We find that, in Lyra 2, interaction design by demonstration enables users to rapidly express a wide range of interactive visualizations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recent graphical interfaces offer direct manipulation mechanisms for authoring visualizations, but are largely restricted to static output. To author interactive visualizations, users must instead turn to textual specification, but such approaches impose a higher technical burden. To bridge this gap, we introduce Lyra 2, a system that extends a prior visualization design environment with novel methods for authoring interaction techniques by demonstration. Users perform an interaction (e.g., button clicks, drags, or key presses) directly on the visualization they are editing. The system interprets this performance using a set of heuristics and enumerates suggestions of possible interaction designs. These heuristics account for the properties of the interaction (e.g., target and event type) as well as the visualization (e.g., mark and scale types, and multiple views). Interaction design suggestions are displayed as thumbnails; users can preview and test these suggestions, iteratively refine them through additional demonstrations, and finally apply and customize them via property inspectors. We evaluate our approach through a gallery of diverse examples, and evaluate its usability through a first-use study and via an analysis of its cognitive dimensions. We find that, in Lyra 2, interaction design by demonstration enables users to rapidly express a wide range of interactive visualizations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recent graphical interfaces offer direct manipulation mechanisms for authoring visualizations, but are largely restricted to static output. To author interactive visualizations, users must instead turn to textual specification, but such approaches impose a higher technical burden. To bridge this gap, we introduce Lyra 2, a system that extends a prior visualization design environment with novel methods for authoring interaction techniques by demonstration. Users perform an interaction (e.g., button clicks, drags, or key presses) directly on the visualization they are editing. The system interprets this performance using a set of heuristics and enumerates suggestions of possible interaction designs. These heuristics account for the properties of the interaction (e.g., target and event type) as well as the visualization (e.g., mark and scale types, and multiple views). Interaction design suggestions are displayed as thumbnails; users can preview and test these suggestions, iteratively refine them through additional demonstrations, and finally apply and customize them via property inspectors. We evaluate our approach through a gallery of diverse examples, and evaluate its usability through a first-use study and via an analysis of its cognitive dimensions. We find that, in Lyra 2, interaction design by demonstration enables users to rapidly express a wide range of interactive visualizations.",
"title": "Lyra 2: Designing Interactive Visualizations by Demonstration",
"normalizedTitle": "Lyra 2: Designing Interactive Visualizations by Demonstration",
"fno": "09222289",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Graphical User Interfaces",
"Interactive Systems",
"Lyra 2",
"Direct Manipulation Mechanisms",
"Interactive Visualization",
"Textual Specification",
"Interaction Techniques",
"Interaction Design Suggestions",
"Visualization Design Environment",
"Data Visualization",
"Visualization",
"Brushes",
"Programming",
"Image Color Analysis",
"Usability",
"Tools",
"Direct Manipulation",
"Interactive Visualization",
"Interaction Design By Demonstration"
],
"authors": [
{
"givenName": "Jonathan",
"surname": "Zong",
"fullName": "Jonathan Zong",
"affiliation": "Massachusetts Institute of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dhiraj",
"surname": "Barnwal",
"fullName": "Dhiraj Barnwal",
"affiliation": "Indian Institute of Technology Kharagpur",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rupayan",
"surname": "Neogy",
"fullName": "Rupayan Neogy",
"affiliation": "Massachusetts Institute of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arvind",
"surname": "Satyanarayan",
"fullName": "Arvind Satyanarayan",
"affiliation": "Massachusetts Institute of Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "304-314",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"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/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/2016/01/07185456",
"title": "Visualization-by-Sketching: An Artist's Interface for Creating Multivariate Time-Varying Data Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07185456/13rRUIIVlcO",
"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/2019/01/08454343",
"title": "A Heuristic Approach to Value-Driven Evaluation of Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08454343/17D45XDIXSW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a169",
"title": "An Instrument for Evaluating the Quality of Data Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a169/17D45XvMcd8",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__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/vis/2019/4941/0/08933747",
"title": "EasyPZ.js: Interaction Binding for Pan and Zoom Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933747/1fTgFR19dTi",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__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/ismar-adjunct/2021/1298/0/129800a324",
"title": "Towards In-situ Authoring of AR Visualizations with Mobile Devices",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2021/129800a324/1yeQJrGq6WI",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2021/1298/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222335",
"articleId": "1nTqzC75UfS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09222091",
"articleId": "1nTroDgoFeo",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgK7",
"title": "Oct.",
"year": "2013",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwI5Ug7",
"doi": "10.1109/TVCG.2012.315",
"abstract": "Visualization techniques often use color to present categorical differences to a user. When selecting a color palette, the perceptual qualities of color need careful consideration. Large coherent groups visually suppress smaller groups and are often visually dominant in images. This paper introduces the concept of class visibility used to quantitatively measure the utility of a color palette to present coherent categorical structure to the user. We present a color optimization algorithm based on our class visibility metric to make categorical differences clearly visible to the user. We performed two user experiments on user preference and visual search to validate our visibility measure over a range of color palettes. The results indicate that visibility is a robust measure, and our color optimization can increase the effectiveness of categorical data visualizations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visualization techniques often use color to present categorical differences to a user. When selecting a color palette, the perceptual qualities of color need careful consideration. Large coherent groups visually suppress smaller groups and are often visually dominant in images. This paper introduces the concept of class visibility used to quantitatively measure the utility of a color palette to present coherent categorical structure to the user. We present a color optimization algorithm based on our class visibility metric to make categorical differences clearly visible to the user. We performed two user experiments on user preference and visual search to validate our visibility measure over a range of color palettes. The results indicate that visibility is a robust measure, and our color optimization can increase the effectiveness of categorical data visualizations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visualization techniques often use color to present categorical differences to a user. When selecting a color palette, the perceptual qualities of color need careful consideration. Large coherent groups visually suppress smaller groups and are often visually dominant in images. This paper introduces the concept of class visibility used to quantitatively measure the utility of a color palette to present coherent categorical structure to the user. We present a color optimization algorithm based on our class visibility metric to make categorical differences clearly visible to the user. We performed two user experiments on user preference and visual search to validate our visibility measure over a range of color palettes. The results indicate that visibility is a robust measure, and our color optimization can increase the effectiveness of categorical data visualizations.",
"title": "Perceptually Driven Visibility Optimization for Categorical Data Visualization",
"normalizedTitle": "Perceptually Driven Visibility Optimization for Categorical Data Visualization",
"fno": "ttg2013101746",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Image Color Analysis",
"Visualization",
"Data Visualization",
"Optimization",
"Measurement",
"Retina",
"User Interface",
"Color Design",
"Visualization",
"Visibility"
],
"authors": [
{
"givenName": null,
"surname": "Sungkil Lee",
"fullName": "Sungkil Lee",
"affiliation": "Dept. of Comput. Sci. & Eng., Sungkyunkwan Univ., Suwon, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "M.",
"surname": "Sips",
"fullName": "M. Sips",
"affiliation": "Helmholtz Centre Potsdam, German Res. Centre for Geosci. GFZ, Potsdam, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "H-P",
"surname": "Seidel",
"fullName": "H-P Seidel",
"affiliation": "Max-Planck-Inst. Inf., Saarbrucken, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2013-10-01 00:00:00",
"pubType": "trans",
"pages": "1746-1757",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2014/4103/0/4103a084",
"title": "A Heatmap-Based Time-Varying Multi-variate Data Visualization Unifying Numeric and Categorical Variables",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2014/4103a084/12OmNqESuhq",
"parentPublication": {
"id": "proceedings/iv/2014/4103/0",
"title": "2014 18th International Conference on Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a081",
"title": "Using Entropy-Related Measures in Categorical Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a081/12OmNvjgWDe",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539556",
"title": "Categorical Colormap Optimization with Visualization Case Studies",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539556/13rRUNvyaf5",
"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": "trans/tg/2020/01/08809846",
"title": "Estimating Color-Concept Associations from Image Statistics",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08809846/1cHEoEeTId2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933709",
"title": "Hi-D Maps: An Interactive Visualization Technique for Multi-Dimensional Categorical Data",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933709/1fTgGSW14Q0",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222351",
"title": "Palettailor: Discriminable Colorization for Categorical Data",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222351/1nTq353vBNS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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": "ttg2013101732",
"articleId": "13rRUwvBy8T",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013101758",
"articleId": "13rRUwbaqLv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"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": "13rRUxYIN4e",
"doi": "10.1109/TVCG.2017.2744320",
"abstract": "Visualization designers regularly use color to encode quantitative or categorical data. However, visualizations “in the wild” often violate perceptual color design principles and may only be available as bitmap images. In this work, we contribute a method to semi-automatically extract color encodings from a bitmap visualization image. Given an image and a legend location, we classify the legend as describing either a discrete or continuous color encoding, identify the colors used, and extract legend text using OCR methods. We then combine this information to recover the specific color mapping. Users can also correct interpretation errors using an annotation interface. We evaluate our techniques using a corpus of images extracted from scientific papers and demonstrate accurate automatic inference of color mappings across a variety of chart types. In addition, we present two applications of our method: automatic recoloring to improve perceptual effectiveness, and interactive overlays to enable improved reading of static visualizations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visualization designers regularly use color to encode quantitative or categorical data. However, visualizations “in the wild” often violate perceptual color design principles and may only be available as bitmap images. In this work, we contribute a method to semi-automatically extract color encodings from a bitmap visualization image. Given an image and a legend location, we classify the legend as describing either a discrete or continuous color encoding, identify the colors used, and extract legend text using OCR methods. We then combine this information to recover the specific color mapping. Users can also correct interpretation errors using an annotation interface. We evaluate our techniques using a corpus of images extracted from scientific papers and demonstrate accurate automatic inference of color mappings across a variety of chart types. In addition, we present two applications of our method: automatic recoloring to improve perceptual effectiveness, and interactive overlays to enable improved reading of static visualizations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visualization designers regularly use color to encode quantitative or categorical data. However, visualizations “in the wild” often violate perceptual color design principles and may only be available as bitmap images. In this work, we contribute a method to semi-automatically extract color encodings from a bitmap visualization image. Given an image and a legend location, we classify the legend as describing either a discrete or continuous color encoding, identify the colors used, and extract legend text using OCR methods. We then combine this information to recover the specific color mapping. Users can also correct interpretation errors using an annotation interface. We evaluate our techniques using a corpus of images extracted from scientific papers and demonstrate accurate automatic inference of color mappings across a variety of chart types. In addition, we present two applications of our method: automatic recoloring to improve perceptual effectiveness, and interactive overlays to enable improved reading of static visualizations.",
"title": "Extracting and Retargeting Color Mappings from Bitmap Images of Visualizations",
"normalizedTitle": "Extracting and Retargeting Color Mappings from Bitmap Images of Visualizations",
"fno": "08017646",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Image Color Analysis",
"Data Visualization",
"Data Mining",
"Encoding",
"Image Coding",
"Optical Character Recognition Software",
"Feature Extraction",
"Visualization",
"Color",
"Chart Understanding",
"Information Extraction",
"Redesign",
"Computer Vision"
],
"authors": [
{
"givenName": "Jorge",
"surname": "Poco",
"fullName": "Jorge Poco",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Angela",
"surname": "Mayhua",
"fullName": "Angela Mayhua",
"affiliation": "Universidad Católica San Pablo",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeffrey",
"surname": "Heer",
"fullName": "Jeffrey Heer",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "637-646",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dcc/1995/7012/0/70120476",
"title": "Byte-aligned bitmap compression",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/1995/70120476/12OmNrAMETJ",
"parentPublication": {
"id": "proceedings/dcc/1995/7012/0",
"title": "Proceedings DCC '95 Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2016/3906/0/3906a370",
"title": "A Method of Fire and Smoke Detection Based on Surendra Background and Gray Bitmap Plane Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2016/3906a370/12OmNxbEtMN",
"parentPublication": {
"id": "proceedings/itme/2016/3906/0",
"title": "2016 8th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875978",
"title": "Ranking Visualizations of Correlation Using Weber's Law",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875978/13rRUyeCkai",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08454346",
"title": "Mapping Color to Meaning in Colormap Data Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08454346/17D45VsBU7I",
"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/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": "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": "trans/tg/2021/02/09239918",
"title": "Semantic Discriminability for Visual Communication",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09239918/1oeZWSkMqre",
"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/09395231",
"title": "Deep Colormap Extraction From Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09395231/1syq9xMMQY8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08017609",
"articleId": "13rRUwbaqUT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08017586",
"articleId": "13rRUIJuxvp",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRU5",
"name": "ttg201801-08017646s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201801-08017646s1.zip",
"extension": "zip",
"size": "47.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": "13rRUyYjKaj",
"doi": "10.1109/TVCG.2015.2467471",
"abstract": "When data categories have strong color associations, it is useful to use these semantically meaningful concept-color associations in data visualizations. In this paper, we explore how linguistic information about the terms defining the data can be used to generate semantically meaningful colors. To do this effectively, we need first to establish that a term has a strong semantic color association, then discover which color or colors express it. Using co-occurrence measures of color name frequencies from Google n-grams, we define a measure for colorability that describes how strongly associated a given term is to any of a set of basic color terms. We then show how this colorability score can be used with additional semantic analysis to rank and retrieve a representative color from Google Images. Alternatively, we use symbolic relationships defined by WordNet to select identity colors for categories such as countries or brands. To create visually distinct color palettes, we use k-means clustering to create visually distinct sets, iteratively reassigning terms with multiple basic color associations as needed. This can be additionally constrained to use colors only in a predefined palette.",
"abstracts": [
{
"abstractType": "Regular",
"content": "When data categories have strong color associations, it is useful to use these semantically meaningful concept-color associations in data visualizations. In this paper, we explore how linguistic information about the terms defining the data can be used to generate semantically meaningful colors. To do this effectively, we need first to establish that a term has a strong semantic color association, then discover which color or colors express it. Using co-occurrence measures of color name frequencies from Google n-grams, we define a measure for colorability that describes how strongly associated a given term is to any of a set of basic color terms. We then show how this colorability score can be used with additional semantic analysis to rank and retrieve a representative color from Google Images. Alternatively, we use symbolic relationships defined by WordNet to select identity colors for categories such as countries or brands. To create visually distinct color palettes, we use k-means clustering to create visually distinct sets, iteratively reassigning terms with multiple basic color associations as needed. This can be additionally constrained to use colors only in a predefined palette.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "When data categories have strong color associations, it is useful to use these semantically meaningful concept-color associations in data visualizations. In this paper, we explore how linguistic information about the terms defining the data can be used to generate semantically meaningful colors. To do this effectively, we need first to establish that a term has a strong semantic color association, then discover which color or colors express it. Using co-occurrence measures of color name frequencies from Google n-grams, we define a measure for colorability that describes how strongly associated a given term is to any of a set of basic color terms. We then show how this colorability score can be used with additional semantic analysis to rank and retrieve a representative color from Google Images. Alternatively, we use symbolic relationships defined by WordNet to select identity colors for categories such as countries or brands. To create visually distinct color palettes, we use k-means clustering to create visually distinct sets, iteratively reassigning terms with multiple basic color associations as needed. This can be additionally constrained to use colors only in a predefined palette.",
"title": "A Linguistic Approach to Categorical Color Assignment for Data Visualization",
"normalizedTitle": "A Linguistic Approach to Categorical Color Assignment for Data Visualization",
"fno": "07192709",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Image Color Analysis",
"Semantics",
"Color",
"Google",
"Data Visualization",
"Context",
"Databases",
"XKCD",
"Linguistics",
"Natural Language Processing",
"Semantics",
"Color Names",
"Categorical Color",
"Google N Grams",
"Word Net",
"XKCD",
"Linguistics",
"Natural Language Processing",
"Semantics",
"Color Names",
"Categorical Color",
"Google N Grams",
"Word Net"
],
"authors": [
{
"givenName": "Vidya",
"surname": "Setlur",
"fullName": "Vidya Setlur",
"affiliation": ", Tableau Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Maureen C.",
"surname": "Stone",
"fullName": "Maureen C. Stone",
"affiliation": ", Tableau Research",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2016-01-01 00:00:00",
"pubType": "trans",
"pages": "698-707",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icci-cc/2012/2795/0/06311173",
"title": "Design through cognitive color theme: A new approach for fabric design",
"doi": null,
"abstractUrl": "/proceedings-article/icci-cc/2012/06311173/12OmNAhOUNd",
"parentPublication": {
"id": "proceedings/icci-cc/2012/2795/0",
"title": "2012 11th IEEE International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2010/3962/3/3962e303",
"title": "Scanner Color Chart Making and its Application in Printing Color Conversion",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2010/3962e303/12OmNCdTePL",
"parentPublication": {
"id": "proceedings/icmtma/2010/3962/3",
"title": "2010 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2006/0054/0/01639282",
"title": "Distributed algorithm for a color assignment on asynchronous rings",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2006/01639282/12OmNrIae8L",
"parentPublication": {
"id": "proceedings/ipdps/2006/0054/0",
"title": "Proceedings 20th IEEE International Parallel & Distributed Processing Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017604",
"title": "Modeling Color Difference for Visualization Design",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017604/13rRUB7a1fY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539556",
"title": "Categorical Colormap Optimization with Visualization Case Studies",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539556/13rRUNvyaf5",
"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": "proceedings/hpcc-dss-smartcity-dependsys/2021/9457/0/945700c349",
"title": "Reasoning and evolution of perceptions. The Influence of Color, on Brand's Logo in Malaysia",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-dss-smartcity-dependsys/2021/945700c349/1DNCU7ZhqWA",
"parentPublication": {
"id": "proceedings/hpcc-dss-smartcity-dependsys/2021/9457/0",
"title": "2021 IEEE 23rd Int Conf on High Performance Computing & Communications; 7th Int Conf on Data Science & Systems; 19th Int Conf on Smart City; 7th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904484",
"title": "Self-Supervised Color-Concept Association via Image Colorization",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904484/1H1ggMqzJUQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08809846",
"title": "Estimating Color-Concept Associations from Image Statistics",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08809846/1cHEoEeTId2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552216",
"title": "Context Matters: A Theory of Semantic Discriminability for Perceptual Encoding Systems",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552216/1xic1HOWGli",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07194854",
"articleId": "13rRUxOve9M",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07192678",
"articleId": "13rRUwgyOjn",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesV2",
"name": "ttg201601-07192709s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201601-07192709s1.zip",
"extension": "zip",
"size": "496 kB",
"__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": "1xic1HOWGli",
"doi": "10.1109/TVCG.2021.3114780",
"abstract": "People's associations between colors and concepts influence their ability to interpret the meanings of colors in information visualizations. Previous work has suggested such effects are limited to concepts that have strong, specific associations with colors. However, although a concept may not be strongly associated with any colors, its mapping can be disambiguated in the context of other concepts in an encoding system. We articulate this view in semantic discriminability theory, a general framework for understanding conditions determining when people can infer meaning from perceptual features. Semantic discriminability is the degree to which observers can infer a unique mapping between visual features and concepts. Semantic discriminability theory posits that the capacity for semantic discriminability for a set of concepts is constrained by the difference between the feature-concept association distributions across the concepts in the set. We define formal properties of this theory and test its implications in two experiments. The results show that the capacity to produce semantically discriminable colors for sets of concepts was indeed constrained by the statistical distance between color-concept association distributions (Experiment 1). Moreover, people could interpret meanings of colors in bar graphs insofar as the colors were semantically discriminable, even for concepts previously considered “non-colorable” (Experiment 2). The results suggest that colors are more robust for visual communication than previously thought.",
"abstracts": [
{
"abstractType": "Regular",
"content": "People's associations between colors and concepts influence their ability to interpret the meanings of colors in information visualizations. Previous work has suggested such effects are limited to concepts that have strong, specific associations with colors. However, although a concept may not be strongly associated with any colors, its mapping can be disambiguated in the context of other concepts in an encoding system. We articulate this view in semantic discriminability theory, a general framework for understanding conditions determining when people can infer meaning from perceptual features. Semantic discriminability is the degree to which observers can infer a unique mapping between visual features and concepts. Semantic discriminability theory posits that the capacity for semantic discriminability for a set of concepts is constrained by the difference between the feature-concept association distributions across the concepts in the set. We define formal properties of this theory and test its implications in two experiments. The results show that the capacity to produce semantically discriminable colors for sets of concepts was indeed constrained by the statistical distance between color-concept association distributions (Experiment 1). Moreover, people could interpret meanings of colors in bar graphs insofar as the colors were semantically discriminable, even for concepts previously considered “non-colorable” (Experiment 2). The results suggest that colors are more robust for visual communication than previously thought.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "People's associations between colors and concepts influence their ability to interpret the meanings of colors in information visualizations. Previous work has suggested such effects are limited to concepts that have strong, specific associations with colors. However, although a concept may not be strongly associated with any colors, its mapping can be disambiguated in the context of other concepts in an encoding system. We articulate this view in semantic discriminability theory, a general framework for understanding conditions determining when people can infer meaning from perceptual features. Semantic discriminability is the degree to which observers can infer a unique mapping between visual features and concepts. Semantic discriminability theory posits that the capacity for semantic discriminability for a set of concepts is constrained by the difference between the feature-concept association distributions across the concepts in the set. We define formal properties of this theory and test its implications in two experiments. The results show that the capacity to produce semantically discriminable colors for sets of concepts was indeed constrained by the statistical distance between color-concept association distributions (Experiment 1). Moreover, people could interpret meanings of colors in bar graphs insofar as the colors were semantically discriminable, even for concepts previously considered “non-colorable” (Experiment 2). The results suggest that colors are more robust for visual communication than previously thought.",
"title": "Context Matters: A Theory of Semantic Discriminability for Perceptual Encoding Systems",
"normalizedTitle": "Context Matters: A Theory of Semantic Discriminability for Perceptual Encoding Systems",
"fno": "09552216",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Color",
"Semantics",
"Visualization",
"Image Color Analysis",
"Encoding",
"Plastics",
"Visual Communication",
"Visual Reasoning",
"Information Visualization",
"Visual Communication",
"Visual Encoding",
"Color Cognition"
],
"authors": [
{
"givenName": "Kushin",
"surname": "Mukherjee",
"fullName": "Kushin Mukherjee",
"affiliation": "Psychology and Wisconsin Institute for Discovery University of Wisconsin_Madison, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brian",
"surname": "Yin",
"fullName": "Brian Yin",
"affiliation": "Cognitive Science University of California, Berkeley",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brianne E.",
"surname": "Sherman",
"fullName": "Brianne E. Sherman",
"affiliation": "Neurobiology and Wisconsin Institute for Discovery University of Wisconsin-Madison, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Laurent",
"surname": "Lessard",
"fullName": "Laurent Lessard",
"affiliation": "Mechanical and Industrial Engineering Northeastern University, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Karen B.",
"surname": "Schloss",
"fullName": "Karen B. Schloss",
"affiliation": "Psychology and Wisconsin Institute for Discovery University of Wisconsin-Madison, United States",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "697-706",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dsc/2018/4210/0/421001a837",
"title": "Automatic Taxonomy Construction for Eye Colors Data without Using Context Information",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2018/421001a837/12OmNviZlCk",
"parentPublication": {
"id": "proceedings/dsc/2018/4210/0",
"title": "2018 IEEE Third International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2011/0063/0/06130335",
"title": "A theory of color barcodes",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2011/06130335/12OmNyQ7FOF",
"parentPublication": {
"id": "proceedings/iccvw/2011/0063/0",
"title": "2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)",
"__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": "proceedings/nicoint/2022/6908/0/690800a021",
"title": "Perceptual Control of Food Taste with Projection Mapping",
"doi": null,
"abstractUrl": "/proceedings-article/nicoint/2022/690800a021/1FWmZYvi4MM",
"parentPublication": {
"id": "proceedings/nicoint/2022/6908/0",
"title": "2022 Nicograph International (NicoInt)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904484",
"title": "Self-Supervised Color-Concept Association via Image Colorization",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904484/1H1ggMqzJUQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09905997",
"title": "Unifying Effects of Direct and Relational Associations for Visual Communication",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09905997/1H3ZWHY73by",
"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": "trans/tg/2020/01/08809846",
"title": "Estimating Color-Concept Associations from Image Statistics",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08809846/1cHEoEeTId2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800i866",
"title": "Harmonizing Transferability and Discriminability for Adapting Object Detectors",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800i866/1m3oc7dAkbS",
"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/tg/2021/02/09239918",
"title": "Semantic Discriminability for Visual Communication",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09239918/1oeZWSkMqre",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09555457",
"articleId": "1xjR0ZcLMNW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09557878",
"articleId": "1xquNQMVFCM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBaFJNYm7C",
"name": "ttg202201-09552216s1-supp1-3114780.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552216s1-supp1-3114780.pdf",
"extension": "pdf",
"size": "458 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyPQ4Dx",
"title": "Dec.",
"year": "2012",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILLkDN",
"doi": "10.1109/TVCG.2012.215",
"abstract": "For information visualization researchers, eye tracking has been a useful tool to investigate research participants’ underlying cognitive processes by tracking their eye movements while they interact with visual techniques. We used an eye tracker to better understand why participants with a variant of a tabular visualization called ‘SimulSort’ outperformed ones with a conventional table and typical one-column sorting feature (i.e., Typical Sorting). The collected eye-tracking data certainly shed light on the detailed cognitive processes of the participants; SimulSort helped with decision-making tasks by promoting efficient browsing behavior and compensatory decision-making strategies. However, more interestingly, we also found unexpected eye-tracking patterns with Simul- Sort. We investigated the cause of the unexpected patterns through a crowdsourcing-based study (i.e., Experiment 2), which elicited an important limitation of the eye tracking method: incapability of capturing peripheral vision. This particular result would be a caveat for other visualization researchers who plan to use an eye tracker in their studies. In addition, the method to use a testing stimulus (i.e., influential column) in Experiment 2 to verify the existence of such limitations would be useful for researchers who would like to verify their eye tracking results.",
"abstracts": [
{
"abstractType": "Regular",
"content": "For information visualization researchers, eye tracking has been a useful tool to investigate research participants’ underlying cognitive processes by tracking their eye movements while they interact with visual techniques. We used an eye tracker to better understand why participants with a variant of a tabular visualization called ‘SimulSort’ outperformed ones with a conventional table and typical one-column sorting feature (i.e., Typical Sorting). The collected eye-tracking data certainly shed light on the detailed cognitive processes of the participants; SimulSort helped with decision-making tasks by promoting efficient browsing behavior and compensatory decision-making strategies. However, more interestingly, we also found unexpected eye-tracking patterns with Simul- Sort. We investigated the cause of the unexpected patterns through a crowdsourcing-based study (i.e., Experiment 2), which elicited an important limitation of the eye tracking method: incapability of capturing peripheral vision. This particular result would be a caveat for other visualization researchers who plan to use an eye tracker in their studies. In addition, the method to use a testing stimulus (i.e., influential column) in Experiment 2 to verify the existence of such limitations would be useful for researchers who would like to verify their eye tracking results.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "For information visualization researchers, eye tracking has been a useful tool to investigate research participants’ underlying cognitive processes by tracking their eye movements while they interact with visual techniques. We used an eye tracker to better understand why participants with a variant of a tabular visualization called ‘SimulSort’ outperformed ones with a conventional table and typical one-column sorting feature (i.e., Typical Sorting). The collected eye-tracking data certainly shed light on the detailed cognitive processes of the participants; SimulSort helped with decision-making tasks by promoting efficient browsing behavior and compensatory decision-making strategies. However, more interestingly, we also found unexpected eye-tracking patterns with Simul- Sort. We investigated the cause of the unexpected patterns through a crowdsourcing-based study (i.e., Experiment 2), which elicited an important limitation of the eye tracking method: incapability of capturing peripheral vision. This particular result would be a caveat for other visualization researchers who plan to use an eye tracker in their studies. In addition, the method to use a testing stimulus (i.e., influential column) in Experiment 2 to verify the existence of such limitations would be useful for researchers who would like to verify their eye tracking results.",
"title": "Does an Eye Tracker Tell the Truth about Visualizations?: Findings while Investigating Visualizations for Decision Making",
"normalizedTitle": "Does an Eye Tracker Tell the Truth about Visualizations?: Findings while Investigating Visualizations for Decision Making",
"fno": "ttg2012122421",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Decision Making",
"Data Visualization",
"Tracking",
"Market Research",
"Research And Development",
"Crowdsourcing",
"Peripheral Vision",
"Visualized Decision Making",
"Eye Tracking",
"Crowdsourcing",
"Quantitative Empirical Study",
"Limitations"
],
"authors": [
{
"givenName": "Sung-Hee",
"surname": "Kim",
"fullName": "Sung-Hee Kim",
"affiliation": "Purdue University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhihua",
"surname": "Dong",
"fullName": "Zhihua Dong",
"affiliation": "Purdue University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanjun",
"surname": "Xian",
"fullName": "Hanjun Xian",
"affiliation": "Purdue University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Benjavan",
"surname": "Upatising",
"fullName": "Benjavan Upatising",
"affiliation": "Purdue University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ji Soo",
"surname": "Yi",
"fullName": "Ji Soo Yi",
"affiliation": "Purdue University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2421-2430",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/etvis/2016/4731/0/07851171",
"title": "Eye tracking data in multimedia containers for instantaneous visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/etvis/2016/07851171/12OmNCmGNXy",
"parentPublication": {
"id": "proceedings/etvis/2016/4731/0",
"title": "2016 IEEE Second Workshop on Eye Tracking and Visualization (ETVIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2016/8942/0/8942a159",
"title": "A Low Level Evaluation of Head-Tracker and Speech Commands Interactions in Information Visualization Tasks",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a159/12OmNscxj3B",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vissoft/2017/1003/0/1003a022",
"title": "iTraceVis: Visualizing Eye Movement Data Within Eclipse",
"doi": null,
"abstractUrl": "/proceedings-article/vissoft/2017/1003a022/12OmNxWcHcx",
"parentPublication": {
"id": "proceedings/vissoft/2017/1003/0",
"title": "2017 IEEE Working Conference on Software Visualization (VISSOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/das/2012/4661/0/4661a333",
"title": "Recognizing Words in Scenes with a Head-Mounted Eye-Tracker",
"doi": null,
"abstractUrl": "/proceedings-article/das/2012/4661a333/12OmNyQ7FWS",
"parentPublication": {
"id": "proceedings/das/2012/4661/0",
"title": "Document Analysis Systems, IAPR International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460117",
"title": "Robust eye localization in video by combining eye detector and eye tracker",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460117/12OmNyQYtxg",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2017/1710/0/1710a538",
"title": "An Eye Tracker based Computer System to Support Oculomotor and Attention Deficit Investigations",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2017/1710a538/12OmNzC5SYa",
"parentPublication": {
"id": "proceedings/cbms/2017/1710/0",
"title": "2017 IEEE 30th International Symposium on Computer-Based Medical Systems (CBMS)",
"__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": "trans/tg/2014/12/06875968",
"title": "Comparative Eye Tracking Study on Node-Link Visualizations of Trajectories",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875968/13rRUy3gn7y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fit/2018/9355/0/935500a099",
"title": "Mesh of SSVEP-Based BCI and Eye-Tracker for Use of Higher Frequency Stimuli and Lower Number of EEG Channels",
"doi": null,
"abstractUrl": "/proceedings-article/fit/2018/935500a099/17D45VTRowY",
"parentPublication": {
"id": "proceedings/fit/2018/9355/0",
"title": "2018 International Conference on Frontiers of Information Technology (FIT)",
"__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"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122411",
"articleId": "13rRUxNW1Zm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122431",
"articleId": "13rRUwI5U2D",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1xlvIBjDUyc",
"title": "Nov.",
"year": "2021",
"issueNum": "11",
"idPrefix": "tp",
"pubType": "journal",
"volume": "43",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1jP8wDap5VC",
"doi": "10.1109/TPAMI.2020.2994749",
"abstract": "There still involve lots of challenges when applying machine learning algorithms in <italic>unknown</italic> environments, especially those with <italic>limited</italic> training data. To handle the data insufficiency and make a further step towards robust learning, we adopt the <italic>learnware</italic> notion Z.-H. Zhou, “Learnware: On the future of machine learning,” <italic>Front. Comput. Sci.</italic>, vol. 10, no. 4 pp. 589–590, 2016 which equips a model with an essential <italic>reusable</italic> property—the model learned in a related task could be easily adapted to the current data-scarce environment <italic>without data sharing</italic>. To this end, we propose the REctiFy via heterOgeneous pRedictor Mapping (<sc>ReForm</sc>) framework enabling the current model to take advantage of a related model from two kinds of <italic>heterogeneous environment</italic>, i.e., either with different sets of features or labels. By Encoding Meta InformaTion (<sc>Emit</sc>) of features and labels as the model specification, we utilize an optimal transported semantic mapping to characterize and bridge the environment changes. After fine-tuning over a few labeled examples through a biased regularization objective, the transformed heterogeneous model adapts to the current task efficiently. We apply <sc>ReForm</sc> over both synthetic and real-world tasks such as few-shot image classification with either learned or pre-defined specifications. Experimental results validate the effectiveness and practical utility of the proposed <sc>ReForm</sc> framework.",
"abstracts": [
{
"abstractType": "Regular",
"content": "There still involve lots of challenges when applying machine learning algorithms in <italic>unknown</italic> environments, especially those with <italic>limited</italic> training data. To handle the data insufficiency and make a further step towards robust learning, we adopt the <italic>learnware</italic> notion Z.-H. Zhou, “Learnware: On the future of machine learning,” <italic>Front. Comput. Sci.</italic>, vol. 10, no. 4 pp. 589–590, 2016 which equips a model with an essential <italic>reusable</italic> property—the model learned in a related task could be easily adapted to the current data-scarce environment <italic>without data sharing</italic>. To this end, we propose the REctiFy via heterOgeneous pRedictor Mapping (<sc>ReForm</sc>) framework enabling the current model to take advantage of a related model from two kinds of <italic>heterogeneous environment</italic>, i.e., either with different sets of features or labels. By Encoding Meta InformaTion (<sc>Emit</sc>) of features and labels as the model specification, we utilize an optimal transported semantic mapping to characterize and bridge the environment changes. After fine-tuning over a few labeled examples through a biased regularization objective, the transformed heterogeneous model adapts to the current task efficiently. We apply <sc>ReForm</sc> over both synthetic and real-world tasks such as few-shot image classification with either learned or pre-defined specifications. Experimental results validate the effectiveness and practical utility of the proposed <sc>ReForm</sc> framework.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "There still involve lots of challenges when applying machine learning algorithms in unknown environments, especially those with limited training data. To handle the data insufficiency and make a further step towards robust learning, we adopt the learnware notion Z.-H. Zhou, “Learnware: On the future of machine learning,” Front. Comput. Sci., vol. 10, no. 4 pp. 589–590, 2016 which equips a model with an essential reusable property—the model learned in a related task could be easily adapted to the current data-scarce environment without data sharing. To this end, we propose the REctiFy via heterOgeneous pRedictor Mapping (ReForm) framework enabling the current model to take advantage of a related model from two kinds of heterogeneous environment, i.e., either with different sets of features or labels. By Encoding Meta InformaTion (Emit) of features and labels as the model specification, we utilize an optimal transported semantic mapping to characterize and bridge the environment changes. After fine-tuning over a few labeled examples through a biased regularization objective, the transformed heterogeneous model adapts to the current task efficiently. We apply ReForm over both synthetic and real-world tasks such as few-shot image classification with either learned or pre-defined specifications. Experimental results validate the effectiveness and practical utility of the proposed ReForm framework.",
"title": "Heterogeneous Few-Shot Model Rectification With Semantic Mapping",
"normalizedTitle": "Heterogeneous Few-Shot Model Rectification With Semantic Mapping",
"fno": "09093972",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Image Classification",
"Learning Artificial Intelligence",
"Heterogeneous Few Shot Model Rectification",
"Machine Learning Algorithms",
"Data Insufficiency",
"Robust Learning",
"Reusable Property",
"Data Scarce Environment",
"Rectify Via Heterogeneous Predictor Mapping Framework",
"Model Specification",
"Optimal Transported Semantic Mapping",
"Few Shot Image Classification",
"Re Form Framework",
"Learnware Notion",
"Encoding Meta Information",
"Biased Regularization Objective",
"Transformed Heterogeneous Model",
"Predefined Specification Learning",
"Task Analysis",
"Adaptation Models",
"Predictive Models",
"Data Models",
"Training",
"Semantics",
"Robustness",
"Model Reuse",
"Heterogeneous Model Reuse",
"Few Shot Learning",
"Transfer Learning",
"Meta Representation",
"Learnware"
],
"authors": [
{
"givenName": "Han-Jia",
"surname": "Ye",
"fullName": "Han-Jia Ye",
"affiliation": "National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "De-Chuan",
"surname": "Zhan",
"fullName": "De-Chuan Zhan",
"affiliation": "National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuan",
"surname": "Jiang",
"fullName": "Yuan Jiang",
"affiliation": "National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhi-Hua",
"surname": "Zhou",
"fullName": "Zhi-Hua Zhou",
"affiliation": "National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2021-11-01 00:00:00",
"pubType": "trans",
"pages": "3878-3891",
"year": "2021",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tk/2019/02/08355676",
"title": "Heterogeneous Information Network Embedding for Recommendation",
"doi": null,
"abstractUrl": "/journal/tk/2019/02/08355676/17D45VTRoyX",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwecai/2022/7997/0/799700a486",
"title": "TAFL: Task-Adaptive Few-shot Learning for KPIs Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/iwecai/2022/799700a486/1CugvysNv7q",
"parentPublication": {
"id": "proceedings/iwecai/2022/7997/0",
"title": "2022 3rd International Conference on Electronic Communication and Artificial Intelligence (IWECAI)",
"__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/tq/5555/01/09928211",
"title": "FewM-HGCL : Few-Shot Malware Variants Detection Via Heterogeneous Graph Contrastive Learning",
"doi": null,
"abstractUrl": "/journal/tq/5555/01/09928211/1HJuUzzFey4",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/05/09916072",
"title": "Defensive Few-Shot Learning",
"doi": null,
"abstractUrl": "/journal/tp/2023/05/09916072/1HojxV3XlMk",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09961953",
"title": "Heterogeneous Graph Neural Network With Multi-View Representation Learning",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09961953/1IxvQWCOYBa",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/5555/01/10065509",
"title": "HFedMS: Heterogeneous Federated Learning with Memorable Data Semantics in Industrial Metaverse",
"doi": null,
"abstractUrl": "/journal/cc/5555/01/10065509/1LoWxWntxsI",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2022/03/09170861",
"title": "To Predict or to Relay: Tracking Neighbors via Beaconing in Heterogeneous Vehicle Conditions",
"doi": null,
"abstractUrl": "/journal/tm/2022/03/09170861/1motisPuF6E",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/09/09262018",
"title": "Few-Shot Named Entity Recognition via Meta-Learning",
"doi": null,
"abstractUrl": "/journal/tk/2022/09/09262018/1oPzNXzelHy",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/12/09634045",
"title": "Bridging the Gap Between Few-Shot and Many-Shot Learning via Distribution Calibration",
"doi": null,
"abstractUrl": "/journal/tp/2022/12/09634045/1z294QnLffG",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09086075",
"articleId": "1jyxuUznEAM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09096519",
"articleId": "1jXr1u6gYKc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1xlvP9EZOak",
"name": "ttp202111-09093972s1-supp1-2994749.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp202111-09093972s1-supp1-2994749.pdf",
"extension": "pdf",
"size": "363 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNySXEWS",
"title": "July/August",
"year": "2007",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygBw71",
"doi": "10.1109/TVCG.2007.1023",
"abstract": "Abstract—One of the common problems businesses need to solve is how to use large volumes of sales histories, Web transactions, and other data to understand the behavior of their customers and increase their revenues. Bar charts are widely used for daily analysis, but only show highly aggregated data. Users often need to visualize detailed multidimensional information reflecting the health of their businesses. In this paper, we propose an innovative visualization solution based on the use of value cells within bar charts to represent business metrics. The value of a transaction can be discretized into one or multiple cells: high-value transactions are mapped to multiple value cells, whereas many small-value transactions are combined into one cell. With value-cell bar charts, users can 1) visualize transaction value distributions and correlations, 2) identify high-value transactions and outliers at a glance, and 3) instantly display values at the transaction record level. Value-Cell Bar Charts have been applied with success to different sales and IT service usage applications, demonstrating the benefits of the technique over traditional charting techniques. A comparison with two variants of the well-known Treemap technique and our earlier work on Pixel Bar Charts is also included.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—One of the common problems businesses need to solve is how to use large volumes of sales histories, Web transactions, and other data to understand the behavior of their customers and increase their revenues. Bar charts are widely used for daily analysis, but only show highly aggregated data. Users often need to visualize detailed multidimensional information reflecting the health of their businesses. In this paper, we propose an innovative visualization solution based on the use of value cells within bar charts to represent business metrics. The value of a transaction can be discretized into one or multiple cells: high-value transactions are mapped to multiple value cells, whereas many small-value transactions are combined into one cell. With value-cell bar charts, users can 1) visualize transaction value distributions and correlations, 2) identify high-value transactions and outliers at a glance, and 3) instantly display values at the transaction record level. Value-Cell Bar Charts have been applied with success to different sales and IT service usage applications, demonstrating the benefits of the technique over traditional charting techniques. A comparison with two variants of the well-known Treemap technique and our earlier work on Pixel Bar Charts is also included.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—One of the common problems businesses need to solve is how to use large volumes of sales histories, Web transactions, and other data to understand the behavior of their customers and increase their revenues. Bar charts are widely used for daily analysis, but only show highly aggregated data. Users often need to visualize detailed multidimensional information reflecting the health of their businesses. In this paper, we propose an innovative visualization solution based on the use of value cells within bar charts to represent business metrics. The value of a transaction can be discretized into one or multiple cells: high-value transactions are mapped to multiple value cells, whereas many small-value transactions are combined into one cell. With value-cell bar charts, users can 1) visualize transaction value distributions and correlations, 2) identify high-value transactions and outliers at a glance, and 3) instantly display values at the transaction record level. Value-Cell Bar Charts have been applied with success to different sales and IT service usage applications, demonstrating the benefits of the technique over traditional charting techniques. A comparison with two variants of the well-known Treemap technique and our earlier work on Pixel Bar Charts is also included.",
"title": "Value-Cell Bar Charts for Visualizing Large Transaction Data Sets",
"normalizedTitle": "Value-Cell Bar Charts for Visualizing Large Transaction Data Sets",
"fno": "v0822",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Marketing And Sales",
"Multidimensional Systems",
"History",
"Displays",
"Data Analysis",
"Information Analysis",
"Graphics",
"Data Mining",
"Decision Trees",
"Information Visualization",
"Multivariate Visualization",
"Visualization Techniques",
"Methodologies"
],
"authors": [
{
"givenName": "Daniel A.",
"surname": "Keim",
"fullName": "Daniel A. Keim",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ming C.",
"surname": "Hao",
"fullName": "Ming C. Hao",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Umeshwar",
"surname": "Dayal",
"fullName": "Umeshwar Dayal",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Martha",
"surname": "Lyons",
"fullName": "Martha Lyons",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2007-07-01 00:00:00",
"pubType": "trans",
"pages": "822-833",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/1991/2245/0/00175791",
"title": "Gray scale diagrams as business charts",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1991/00175791/12OmNqyUUHz",
"parentPublication": {
"id": "proceedings/visual/1991/2245/0",
"title": "1991 Proceeding Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2001/1342/0/13420113",
"title": "Pixel Bar Charts: A New Technique for Visualizing Large Multi-Attribute Data Sets without Aggregation",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2001/13420113/12OmNwE9OuO",
"parentPublication": {
"id": "proceedings/ieee-infovis/2001/1342/0",
"title": "Information Visualization, IEEE Symposium on",
"__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/2014/12/06875990",
"title": "Multi-Charts for Comparative 3D Ensemble Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875990/13rRUxYIMUZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2002/03/v0255",
"title": "Hierarchical Pixel Bar Charts",
"doi": null,
"abstractUrl": "/journal/tg/2002/03/v0255/13rRUyuegh1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a159",
"title": "Improving Perception Accuracy in Bar Charts with Internal Contrast and Framing Enhancements",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a159/17D45WnnFWc",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__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": "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": "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": "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"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0810",
"articleId": "13rRUxjyX3N",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0834",
"articleId": "13rRUwInvJa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrJRP2h",
"title": "Feb.",
"year": "2018",
"issueNum": "02",
"idPrefix": "tk",
"pubType": "journal",
"volume": "30",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbs21q",
"doi": "10.1109/TKDE.2017.2766065",
"abstract": "Given a set of facilities and a set of users, a reverse nearest neighbors (RNN) query retrieves every user <inline-formula><tex-math notation=\"LaTeX\">Z_$u$_Z</tex-math></inline-formula> for which the query facility <inline-formula><tex-math notation=\"LaTeX\">Z_$q$_Z</tex-math></inline-formula> is its closest facility. Since <inline-formula><tex-math notation=\"LaTeX\">Z_$q$_Z</tex-math></inline-formula> is the closest facility to <inline-formula><tex-math notation=\"LaTeX\">Z_$u$_Z</tex-math></inline-formula>, the user <inline-formula> <tex-math notation=\"LaTeX\">Z_$u$_Z</tex-math></inline-formula> is said to be influenced by <inline-formula><tex-math notation=\"LaTeX\">Z_$q$_Z</tex-math> </inline-formula>. In this paper, we propose a <italic>relaxed</italic> definition of influence where a user <inline-formula><tex-math notation=\"LaTeX\">Z_$u$_Z</tex-math></inline-formula> is said to be influenced by not only its closest facility but also every other facility that is <italic>almost</italic> as close to <inline-formula><tex-math notation=\"LaTeX\">Z_$u$_Z</tex-math></inline-formula> as its closest facility is. Based on this definition of influence, we propose reverse approximate nearest neighbors (RANN) queries. Formally, given a value <inline-formula><tex-math notation=\"LaTeX\">Z_$x>1$_Z</tex-math></inline-formula>, an RANN query <inline-formula> <tex-math notation=\"LaTeX\">Z_$q$_Z</tex-math></inline-formula> returns every user <inline-formula><tex-math notation=\"LaTeX\">Z_$u$_Z</tex-math> </inline-formula> for which <inline-formula><tex-math notation=\"LaTeX\">Z_$dist(u,q) \\leq x\\times NNDist(u)$_Z</tex-math></inline-formula> where <inline-formula> <tex-math notation=\"LaTeX\">Z_$NNDist(u)$_Z</tex-math></inline-formula> denotes the distance between a user <inline-formula><tex-math notation=\"LaTeX\">Z_$u$_Z</tex-math></inline-formula> and its nearest facility, i.e., <inline-formula><tex-math notation=\"LaTeX\">Z_$q$_Z</tex-math></inline-formula> is an approximate nearest neighbor of <inline-formula><tex-math notation=\"LaTeX\">Z_$u$_Z</tex-math></inline-formula>. In this paper, we study both <italic>snapshot</italic> and <italic>continuous</italic> versions of RANN queries. In a snapshot RANN query, the underlying data sets do not change and the results of a query are to be computed only once. In the continuous version, the users continuously change their locations and the results of RANN queries are to be continuously monitored. Based on effective pruning techniques and several non-trivial observations, we propose efficient RANN query processing algorithms for both the snapshot and continuous RANN queries. We conduct extensive experiments on both real and synthetic data sets and demonstrate that our algorithm for both snapshot and continuous queries are significantly better than the competitors.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Given a set of facilities and a set of users, a reverse nearest neighbors (RNN) query retrieves every user <inline-formula><tex-math notation=\"LaTeX\">$u$</tex-math><alternatives> <inline-graphic xlink:href=\"cheema-ieq1-2766065.gif\"/></alternatives></inline-formula> for which the query facility <inline-formula><tex-math notation=\"LaTeX\">$q$</tex-math><alternatives> <inline-graphic xlink:href=\"cheema-ieq2-2766065.gif\"/></alternatives></inline-formula> is its closest facility. Since <inline-formula><tex-math notation=\"LaTeX\">$q$</tex-math><alternatives> <inline-graphic xlink:href=\"cheema-ieq3-2766065.gif\"/></alternatives></inline-formula> is the closest facility to <inline-formula><tex-math notation=\"LaTeX\">$u$</tex-math><alternatives> <inline-graphic xlink:href=\"cheema-ieq4-2766065.gif\"/></alternatives></inline-formula>, the user <inline-formula> <tex-math notation=\"LaTeX\">$u$</tex-math><alternatives><inline-graphic xlink:href=\"cheema-ieq5-2766065.gif\"/> </alternatives></inline-formula> is said to be influenced by <inline-formula><tex-math notation=\"LaTeX\">$q$</tex-math> <alternatives><inline-graphic xlink:href=\"cheema-ieq6-2766065.gif\"/></alternatives></inline-formula>. In this paper, we propose a <italic>relaxed</italic> definition of influence where a user <inline-formula><tex-math notation=\"LaTeX\">$u$ </tex-math><alternatives><inline-graphic xlink:href=\"cheema-ieq7-2766065.gif\"/></alternatives></inline-formula> is said to be influenced by not only its closest facility but also every other facility that is <italic>almost</italic> as close to <inline-formula><tex-math notation=\"LaTeX\">$u$</tex-math><alternatives> <inline-graphic xlink:href=\"cheema-ieq8-2766065.gif\"/></alternatives></inline-formula> as its closest facility is. Based on this definition of influence, we propose reverse approximate nearest neighbors (RANN) queries. Formally, given a value <inline-formula><tex-math notation=\"LaTeX\">$x>1$</tex-math><alternatives> <inline-graphic xlink:href=\"cheema-ieq9-2766065.gif\"/></alternatives></inline-formula>, an RANN query <inline-formula> <tex-math notation=\"LaTeX\">$q$</tex-math><alternatives><inline-graphic xlink:href=\"cheema-ieq10-2766065.gif\"/> </alternatives></inline-formula> returns every user <inline-formula><tex-math notation=\"LaTeX\">$u$</tex-math> <alternatives><inline-graphic xlink:href=\"cheema-ieq11-2766065.gif\"/></alternatives></inline-formula> for which <inline-formula><tex-math notation=\"LaTeX\">$dist(u,q) \\leq x\\times NNDist(u)$</tex-math><alternatives> <inline-graphic xlink:href=\"cheema-ieq12-2766065.gif\"/></alternatives></inline-formula> where <inline-formula> <tex-math notation=\"LaTeX\">$NNDist(u)$</tex-math><alternatives><inline-graphic xlink:href=\"cheema-ieq13-2766065.gif\"/> </alternatives></inline-formula> denotes the distance between a user <inline-formula><tex-math notation=\"LaTeX\">$u$ </tex-math><alternatives><inline-graphic xlink:href=\"cheema-ieq14-2766065.gif\"/></alternatives></inline-formula> and its nearest facility, i.e., <inline-formula><tex-math notation=\"LaTeX\">$q$</tex-math><alternatives> <inline-graphic xlink:href=\"cheema-ieq15-2766065.gif\"/></alternatives></inline-formula> is an approximate nearest neighbor of <inline-formula><tex-math notation=\"LaTeX\">$u$</tex-math><alternatives> <inline-graphic xlink:href=\"cheema-ieq16-2766065.gif\"/></alternatives></inline-formula>. In this paper, we study both <italic>snapshot</italic> and <italic>continuous</italic> versions of RANN queries. In a snapshot RANN query, the underlying data sets do not change and the results of a query are to be computed only once. In the continuous version, the users continuously change their locations and the results of RANN queries are to be continuously monitored. Based on effective pruning techniques and several non-trivial observations, we propose efficient RANN query processing algorithms for both the snapshot and continuous RANN queries. We conduct extensive experiments on both real and synthetic data sets and demonstrate that our algorithm for both snapshot and continuous queries are significantly better than the competitors.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Given a set of facilities and a set of users, a reverse nearest neighbors (RNN) query retrieves every user - for which the query facility - is its closest facility. Since - is the closest facility to -, the user - is said to be influenced by -. In this paper, we propose a relaxed definition of influence where a user - is said to be influenced by not only its closest facility but also every other facility that is almost as close to - as its closest facility is. Based on this definition of influence, we propose reverse approximate nearest neighbors (RANN) queries. Formally, given a value -, an RANN query - returns every user - for which - where - denotes the distance between a user - and its nearest facility, i.e., - is an approximate nearest neighbor of -. In this paper, we study both snapshot and continuous versions of RANN queries. In a snapshot RANN query, the underlying data sets do not change and the results of a query are to be computed only once. In the continuous version, the users continuously change their locations and the results of RANN queries are to be continuously monitored. Based on effective pruning techniques and several non-trivial observations, we propose efficient RANN query processing algorithms for both the snapshot and continuous RANN queries. We conduct extensive experiments on both real and synthetic data sets and demonstrate that our algorithm for both snapshot and continuous queries are significantly better than the competitors.",
"title": "Reverse Approximate Nearest Neighbor Queries",
"normalizedTitle": "Reverse Approximate Nearest Neighbor Queries",
"fno": "08081813",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Monitoring",
"Fuels",
"Indexes",
"Australia",
"Information Technology",
"Nearest Neighbor Searches",
"Query Processing",
"Reverse Nearest Neighbors",
"Influence Detection",
"Continuous Monitoring",
"Voronoi Diagram"
],
"authors": [
{
"givenName": "Arif",
"surname": "Hidayat",
"fullName": "Arif Hidayat",
"affiliation": "Faculty of Information Technology, Monash University, Clayton, VIC, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shiyu",
"surname": "Yang",
"fullName": "Shiyu Yang",
"affiliation": "School of Computer Science and Engineering, The University of New South Wales, Sydney, NSW, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Muhammad Aamir",
"surname": "Cheema",
"fullName": "Muhammad Aamir Cheema",
"affiliation": "Faculty of Information Technology, Monash University, Clayton, VIC, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Taniar",
"fullName": "David Taniar",
"affiliation": "Faculty of Information Technology, Monash University, Clayton, VIC, Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2018-02-01 00:00:00",
"pubType": "trans",
"pages": "339-352",
"year": "2018",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tq/2018/02/07469381",
"title": "On the Efficiency of FHE-Based Private Queries",
"doi": null,
"abstractUrl": "/journal/tq/2018/02/07469381/13rRUEgarkQ",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"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/tp/2019/04/08326558",
"title": "Ordinal Constraint Binary Coding for Approximate Nearest Neighbor Search",
"doi": null,
"abstractUrl": "/journal/tp/2019/04/08326558/13rRUyp7tY3",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2023/01/09726805",
"title": "Accelerating Large-Scale Graph-Based Nearest Neighbor Search on a Computational Storage Platform",
"doi": null,
"abstractUrl": "/journal/tc/2023/01/09726805/1Brwvt2KImI",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2022/02/08966480",
"title": "Reverse Nearest Neighbor Search in Semantic Trajectories for Location-Based Services",
"doi": null,
"abstractUrl": "/journal/sc/2022/02/08966480/1gNEzYzsFAk",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/12/09007415",
"title": "Flexible Aggregate Nearest Neighbor Queries and its Keyword-Aware Variant on Road Networks",
"doi": null,
"abstractUrl": "/journal/tk/2021/12/09007415/1hJKhc0u1So",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/11/09001178",
"title": "Cohesive Group Nearest Neighbor Queries on Road-Social Networks under Multi-Criteria",
"doi": null,
"abstractUrl": "/journal/tk/2021/11/09001178/1hwt2btgALu",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/2022/03/09143389",
"title": "QuickN: Practical and Secure Nearest Neighbor Search on Encrypted Large-Scale Data",
"doi": null,
"abstractUrl": "/journal/cc/2022/03/09143389/1lxmjz6YUy4",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/07/09180058",
"title": "Distributed Multimodal Path Queries",
"doi": null,
"abstractUrl": "/journal/tk/2022/07/09180058/1mF4jty4vPa",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/07/09199134",
"title": "Computing K-Cores in Large Uncertain Graphs: An Index-Based Optimal Approach",
"doi": null,
"abstractUrl": "/journal/tk/2022/07/09199134/1naBq7vTUIw",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08070349",
"articleId": "13rRUEgarjS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07990163",
"articleId": "13rRUwbs2gP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFp6",
"name": "ttk201802-08081813s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk201802-08081813s1.zip",
"extension": "zip",
"size": "417 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvH7fgd",
"title": "Sept.",
"year": "2018",
"issueNum": "09",
"idPrefix": "td",
"pubType": "journal",
"volume": "29",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyp7tWJ",
"doi": "10.1109/TPDS.2018.2810179",
"abstract": "As one type of the most popular cloud storage services, OpenStack Swift and its follow-up systems replicate each object across multiple storage nodes and leverage <italic>object sync protocols</italic> to achieve high reliability and <italic>eventual consistency</italic>. The performance of object sync protocols heavily relies on two key parameters: <inline-formula><tex-math notation=\"LaTeX\">Z_$r$_Z</tex-math></inline-formula> (number of replicas for each object) and <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula> (number of objects hosted by each storage node). In existing tutorials and demos, the configurations are usually <inline-formula> <tex-math notation=\"LaTeX\">Z_$r=3$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_$n<1,000$_Z</tex-math></inline-formula> by default, and the sync process seems to perform well. However, we discover in data-intensive scenarios, e.g., when <inline-formula> <tex-math notation=\"LaTeX\">Z_$r>3$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_$n\\gg 1,000$_Z</tex-math></inline-formula>, the sync process is significantly delayed and produces massive network overhead, referred to as the <italic>sync bottleneck problem</italic>. By reviewing the source code of OpenStack Swift, we find that its object sync protocol utilizes a fairly simple and network-intensive approach to check the consistency among replicas of objects. Hence in a sync round, the number of exchanged hash values per node is <inline-formula><tex-math notation=\"LaTeX\">Z_$\\Theta (n\\times r)$_Z</tex-math> </inline-formula>. To tackle the problem, we propose a lightweight and practical object sync protocol, <italic>LightSync</italic>, which not only remarkably reduces the sync overhead, but also preserves high reliability and eventual consistency. LightSync derives this capability from three novel building blocks: 1) <italic>Hashing of Hashes</italic>, which aggregates all the <inline-formula><tex-math notation=\"LaTeX\">Z_$h$_Z</tex-math></inline-formula> hash values of each data partition into a single but representative hash value with the Merkle tree; 2) <italic>Circular Hash Checking</italic>, which checks the consistency of different partition replicas by only sending the aggregated hash value to the clockwise neighbor; and 3) <italic>Failed Neighbor Handling</italic>, which properly detects and handles node failures with moderate overhead to effectively strengthen the robustness of LightSync. The design of LightSync offers provable guarantee on reducing the per-node network overhead from <inline-formula><tex-math notation=\"LaTeX\">Z_$\\Theta (n\\times r)$_Z</tex-math></inline-formula> to <inline-formula><tex-math notation=\"LaTeX\">Z_$\\Theta (\\frac{n}{h})$_Z</tex-math></inline-formula>. Furthermore, we have implemented LightSync as an open-source patch and adopted it to OpenStack Swift, thus reducing the sync delay by up to 879 <inline-formula><tex-math notation=\"LaTeX\">Z_$\\times$_Z</tex-math></inline-formula> and the network overhead by up to 47.5<inline-formula><tex-math notation=\"LaTeX\">Z_$\\times$_Z</tex-math></inline-formula>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As one type of the most popular cloud storage services, OpenStack Swift and its follow-up systems replicate each object across multiple storage nodes and leverage <italic>object sync protocols</italic> to achieve high reliability and <italic>eventual consistency</italic>. The performance of object sync protocols heavily relies on two key parameters: <inline-formula><tex-math notation=\"LaTeX\">$r$</tex-math><alternatives> <inline-graphic xlink:href=\"ruan-ieq1-2810179.gif\"/></alternatives></inline-formula> (number of replicas for each object) and <inline-formula><tex-math notation=\"LaTeX\">$n$</tex-math><alternatives> <inline-graphic xlink:href=\"ruan-ieq2-2810179.gif\"/></alternatives></inline-formula> (number of objects hosted by each storage node). In existing tutorials and demos, the configurations are usually <inline-formula> <tex-math notation=\"LaTeX\">$r=3$</tex-math><alternatives><inline-graphic xlink:href=\"ruan-ieq3-2810179.gif\"/> </alternatives></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">$n<1,000$</tex-math><alternatives> <inline-graphic xlink:href=\"ruan-ieq4-2810179.gif\"/></alternatives></inline-formula> by default, and the sync process seems to perform well. However, we discover in data-intensive scenarios, e.g., when <inline-formula> <tex-math notation=\"LaTeX\">$r>3$</tex-math><alternatives><inline-graphic xlink:href=\"ruan-ieq5-2810179.gif\"/> </alternatives></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">$n\\gg 1,000$</tex-math><alternatives> <inline-graphic xlink:href=\"ruan-ieq6-2810179.gif\"/></alternatives></inline-formula>, the sync process is significantly delayed and produces massive network overhead, referred to as the <italic>sync bottleneck problem</italic>. By reviewing the source code of OpenStack Swift, we find that its object sync protocol utilizes a fairly simple and network-intensive approach to check the consistency among replicas of objects. Hence in a sync round, the number of exchanged hash values per node is <inline-formula><tex-math notation=\"LaTeX\">$\\Theta (n\\times r)$</tex-math> <alternatives><inline-graphic xlink:href=\"ruan-ieq7-2810179.gif\"/></alternatives></inline-formula>. To tackle the problem, we propose a lightweight and practical object sync protocol, <italic>LightSync</italic>, which not only remarkably reduces the sync overhead, but also preserves high reliability and eventual consistency. LightSync derives this capability from three novel building blocks: 1) <italic>Hashing of Hashes</italic>, which aggregates all the <inline-formula><tex-math notation=\"LaTeX\">$h$</tex-math><alternatives> <inline-graphic xlink:href=\"ruan-ieq8-2810179.gif\"/></alternatives></inline-formula> hash values of each data partition into a single but representative hash value with the Merkle tree; 2) <italic>Circular Hash Checking</italic>, which checks the consistency of different partition replicas by only sending the aggregated hash value to the clockwise neighbor; and 3) <italic>Failed Neighbor Handling</italic>, which properly detects and handles node failures with moderate overhead to effectively strengthen the robustness of LightSync. The design of LightSync offers provable guarantee on reducing the per-node network overhead from <inline-formula><tex-math notation=\"LaTeX\">$\\Theta (n\\times r)$</tex-math><alternatives><inline-graphic xlink:href=\"ruan-ieq9-2810179.gif\"/></alternatives></inline-formula> to <inline-formula><tex-math notation=\"LaTeX\">$\\Theta (\\frac{n}{h})$</tex-math><alternatives> <inline-graphic xlink:href=\"ruan-ieq10-2810179.gif\"/></alternatives></inline-formula>. Furthermore, we have implemented LightSync as an open-source patch and adopted it to OpenStack Swift, thus reducing the sync delay by up to 879 <inline-formula><tex-math notation=\"LaTeX\">$\\times$</tex-math><alternatives> <inline-graphic xlink:href=\"ruan-ieq11-2810179.gif\"/></alternatives></inline-formula> and the network overhead by up to 47.5<inline-formula><tex-math notation=\"LaTeX\">$\\times$</tex-math><alternatives> <inline-graphic xlink:href=\"ruan-ieq12-2810179.gif\"/></alternatives></inline-formula>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As one type of the most popular cloud storage services, OpenStack Swift and its follow-up systems replicate each object across multiple storage nodes and leverage object sync protocols to achieve high reliability and eventual consistency. The performance of object sync protocols heavily relies on two key parameters: - (number of replicas for each object) and - (number of objects hosted by each storage node). In existing tutorials and demos, the configurations are usually - and - by default, and the sync process seems to perform well. However, we discover in data-intensive scenarios, e.g., when - and -, the sync process is significantly delayed and produces massive network overhead, referred to as the sync bottleneck problem. By reviewing the source code of OpenStack Swift, we find that its object sync protocol utilizes a fairly simple and network-intensive approach to check the consistency among replicas of objects. Hence in a sync round, the number of exchanged hash values per node is -. To tackle the problem, we propose a lightweight and practical object sync protocol, LightSync, which not only remarkably reduces the sync overhead, but also preserves high reliability and eventual consistency. LightSync derives this capability from three novel building blocks: 1) Hashing of Hashes, which aggregates all the - hash values of each data partition into a single but representative hash value with the Merkle tree; 2) Circular Hash Checking, which checks the consistency of different partition replicas by only sending the aggregated hash value to the clockwise neighbor; and 3) Failed Neighbor Handling, which properly detects and handles node failures with moderate overhead to effectively strengthen the robustness of LightSync. The design of LightSync offers provable guarantee on reducing the per-node network overhead from - to -. Furthermore, we have implemented LightSync as an open-source patch and adopted it to OpenStack Swift, thus reducing the sync delay by up to 879 - and the network overhead by up to 47.5-.",
"title": "On the Synchronization Bottleneck of OpenStack Swift-Like Cloud Storage Systems",
"normalizedTitle": "On the Synchronization Bottleneck of OpenStack Swift-Like Cloud Storage Systems",
"fno": "08303732",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Cloud Computing",
"Protocols",
"Storage Management",
"Synchronisation",
"Light Sync",
"Sync Delay",
"Open Stack Swift Like Cloud Storage Systems",
"Sync Process",
"Massive Network Overhead",
"Sync Bottleneck Problem",
"Network Intensive Approach",
"Exchanged Hash Values",
"Lightweight Object Sync Protocol",
"Practical Object Sync Protocol",
"Sync Overhead",
"Aggregated Hash Value",
"Per Node Network Overhead",
"Cloud Storage Services",
"Object Sync Protocols",
"Representative Hash Value",
"Merkle Tree",
"Synchronization",
"Protocols",
"Cloud Computing",
"Delays",
"Electronic Mail",
"Reliability",
"Open Source Software",
"Cloud Storage",
"Open Stack Swift",
"Object Synchronization",
"Performance Bottleneck"
],
"authors": [
{
"givenName": "Mingkang",
"surname": "Ruan",
"fullName": "Mingkang Ruan",
"affiliation": "School of Software, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thierry",
"surname": "Titcheu",
"fullName": "Thierry Titcheu",
"affiliation": "Interdisciplinary Centre for Security, Reliability and Trust, University of Luxembourg, Luxembourg",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ennan",
"surname": "Zhai",
"fullName": "Ennan Zhai",
"affiliation": "Department of Computer Science, Yale University, New Haven, CT",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhenhua",
"surname": "Li",
"fullName": "Zhenhua Li",
"affiliation": "School of Software, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yao",
"surname": "Liu",
"fullName": "Yao Liu",
"affiliation": "Department of Computer Science, Binghamton University, NY",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jinlong",
"surname": "E",
"fullName": "Jinlong E",
"affiliation": "Department of Computer Science and Technology, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yong",
"surname": "Cui",
"fullName": "Yong Cui",
"affiliation": "Department of Computer Science and Technology, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hong",
"surname": "Xu",
"fullName": "Hong Xu",
"affiliation": "Department of Computer Science, City University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2018-09-01 00:00:00",
"pubType": "trans",
"pages": "2059-2074",
"year": "2018",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/cc/2019/01/07299623",
"title": "SDN-Based Multi-Class QoS Guarantee in Inter-Data Center Communications",
"doi": null,
"abstractUrl": "/journal/cc/2019/01/07299623/13rRUwciPeL",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2023/01/09721000",
"title": "An Iterative Montgomery Modular Multiplication Algorithm With Low Area-Time Product",
"doi": null,
"abstractUrl": "/journal/tc/2023/01/09721000/1BfUabvXdDy",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/12/09729476",
"title": "Solving Consensus in True Partial Synchrony",
"doi": null,
"abstractUrl": "/journal/td/2022/12/09729476/1Byafq1ui4w",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2022/02/09141372",
"title": "Highly Efficient and Re-Executable Private Function Evaluation With Linear Complexity",
"doi": null,
"abstractUrl": "/journal/tq/2022/02/09141372/1lu2SzkDEpG",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/07/09199134",
"title": "Computing K-Cores in Large Uncertain Graphs: An Index-Based Optimal Approach",
"doi": null,
"abstractUrl": "/journal/tk/2022/07/09199134/1naBq7vTUIw",
"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/09/09269479",
"title": "Efficient Radius-Bounded Community Search in Geo-Social Networks",
"doi": null,
"abstractUrl": "/journal/tk/2022/09/09269479/1p1c8tla0DK",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/01/09290398",
"title": "Non-Triangular Self-Synchronizing Stream Ciphers",
"doi": null,
"abstractUrl": "/journal/tc/2022/01/09290398/1prKTDC9Lq0",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2022/11/09372784",
"title": "WUR-TS: Semi-Passive Wake-Up Radio Receiver Based Time Synchronization Method for Energy Harvesting Wireless Networks",
"doi": null,
"abstractUrl": "/journal/tm/2022/11/09372784/1rNOAZyjtrq",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/10/09534659",
"title": "<inline-formula><tex-math notation=\"LaTeX\">Z_${{\\sf Colosseum}}$_Z</tex-math></inline-formula>: Regression Test Prioritization by Delta Displacement in Test Coverage",
"doi": null,
"abstractUrl": "/journal/ts/2022/10/09534659/1wLbkFoyBQ4",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08320837",
"articleId": "13rRUwghd4L",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08314090",
"articleId": "13rRUEgarBh",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy4IF3l",
"title": "March",
"year": "2020",
"issueNum": "03",
"idPrefix": "tk",
"pubType": "journal",
"volume": "32",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45WrVgec",
"doi": "10.1109/TKDE.2018.2878247",
"abstract": "This paper presents a general inductive graph representation learning framework called <inline-formula><tex-math notation=\"LaTeX\">Z_$\\text{DeepGL}$_Z</tex-math></inline-formula> for learning deep node <italic>and</italic> edge features that generalize across-networks. In particular, <inline-formula><tex-math notation=\"LaTeX\">Z_$\\text{DeepGL}$_Z</tex-math></inline-formula> begins by deriving a set of base features from the graph (e.g., graphlet features) and automatically learns a multi-layered hierarchical graph representation where each successive layer leverages the output from the previous layer to learn features of a higher-order. Contrary to previous work, <inline-formula><tex-math notation=\"LaTeX\">Z_$\\text{DeepGL}$_Z</tex-math></inline-formula> learns <italic>relational functions</italic> (each representing a feature) that naturally generalize across-networks and are therefore useful for graph-based transfer learning tasks. Moreover, <inline-formula><tex-math notation=\"LaTeX\">Z_$\\text{DeepGL}$_Z</tex-math></inline-formula> naturally supports attributed graphs, learns interpretable inductive graph representations, and is space-efficient (by learning sparse feature vectors). In addition, <inline-formula><tex-math notation=\"LaTeX\">Z_$\\text{DeepGL}$_Z</tex-math></inline-formula> is expressive, flexible with many interchangeable components, efficient with a time complexity of <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {O}(|E|)$_Z</tex-math></inline-formula>, and scalable for large networks via an efficient parallel implementation. Compared with recent methods, <inline-formula><tex-math notation=\"LaTeX\">Z_$\\text{DeepGL}$_Z</tex-math></inline-formula> is (1) <italic>effective</italic> for across-network transfer learning tasks <italic>and</italic> large (attributed) graphs, (2) <italic>space-efficient</italic> requiring up to 6x less memory, (3) <italic>fast</italic> with up to 106x speedup in runtime performance, and (4) <italic>accurate</italic> with an average improvement in AUC of 20 percent or more on many learning tasks and across a wide variety of networks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a general inductive graph representation learning framework called <inline-formula><tex-math notation=\"LaTeX\">$\\text{DeepGL}$</tex-math><alternatives><mml:math><mml:mtext>DeepGL</mml:mtext></mml:math><inline-graphic xlink:href=\"rossi-ieq1-2878247.gif\"/></alternatives></inline-formula> for learning deep node <italic>and</italic> edge features that generalize across-networks. In particular, <inline-formula><tex-math notation=\"LaTeX\">$\\text{DeepGL}$</tex-math><alternatives><mml:math><mml:mtext>DeepGL</mml:mtext></mml:math><inline-graphic xlink:href=\"rossi-ieq2-2878247.gif\"/></alternatives></inline-formula> begins by deriving a set of base features from the graph (e.g., graphlet features) and automatically learns a multi-layered hierarchical graph representation where each successive layer leverages the output from the previous layer to learn features of a higher-order. Contrary to previous work, <inline-formula><tex-math notation=\"LaTeX\">$\\text{DeepGL}$</tex-math><alternatives><mml:math><mml:mtext>DeepGL</mml:mtext></mml:math><inline-graphic xlink:href=\"rossi-ieq3-2878247.gif\"/></alternatives></inline-formula> learns <italic>relational functions</italic> (each representing a feature) that naturally generalize across-networks and are therefore useful for graph-based transfer learning tasks. Moreover, <inline-formula><tex-math notation=\"LaTeX\">$\\text{DeepGL}$</tex-math><alternatives><mml:math><mml:mtext>DeepGL</mml:mtext></mml:math><inline-graphic xlink:href=\"rossi-ieq4-2878247.gif\"/></alternatives></inline-formula> naturally supports attributed graphs, learns interpretable inductive graph representations, and is space-efficient (by learning sparse feature vectors). In addition, <inline-formula><tex-math notation=\"LaTeX\">$\\text{DeepGL}$</tex-math><alternatives><mml:math><mml:mtext>DeepGL</mml:mtext></mml:math><inline-graphic xlink:href=\"rossi-ieq5-2878247.gif\"/></alternatives></inline-formula> is expressive, flexible with many interchangeable components, efficient with a time complexity of <inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {O}(|E|)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi mathvariant=\"script\">O</mml:mi><mml:mo>(</mml:mo><mml:mo>|</mml:mo><mml:mi>E</mml:mi><mml:mo>|</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"rossi-ieq6-2878247.gif\"/></alternatives></inline-formula>, and scalable for large networks via an efficient parallel implementation. Compared with recent methods, <inline-formula><tex-math notation=\"LaTeX\">$\\text{DeepGL}$</tex-math><alternatives><mml:math><mml:mtext>DeepGL</mml:mtext></mml:math><inline-graphic xlink:href=\"rossi-ieq7-2878247.gif\"/></alternatives></inline-formula> is (1) <italic>effective</italic> for across-network transfer learning tasks <italic>and</italic> large (attributed) graphs, (2) <italic>space-efficient</italic> requiring up to 6x less memory, (3) <italic>fast</italic> with up to 106x speedup in runtime performance, and (4) <italic>accurate</italic> with an average improvement in AUC of 20 percent or more on many learning tasks and across a wide variety of networks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a general inductive graph representation learning framework called - for learning deep node and edge features that generalize across-networks. In particular, - begins by deriving a set of base features from the graph (e.g., graphlet features) and automatically learns a multi-layered hierarchical graph representation where each successive layer leverages the output from the previous layer to learn features of a higher-order. Contrary to previous work, - learns relational functions (each representing a feature) that naturally generalize across-networks and are therefore useful for graph-based transfer learning tasks. Moreover, - naturally supports attributed graphs, learns interpretable inductive graph representations, and is space-efficient (by learning sparse feature vectors). In addition, - is expressive, flexible with many interchangeable components, efficient with a time complexity of -, and scalable for large networks via an efficient parallel implementation. Compared with recent methods, - is (1) effective for across-network transfer learning tasks and large (attributed) graphs, (2) space-efficient requiring up to 6x less memory, (3) fast with up to 106x speedup in runtime performance, and (4) accurate with an average improvement in AUC of 20 percent or more on many learning tasks and across a wide variety of networks.",
"title": "Deep Inductive Graph Representation Learning",
"normalizedTitle": "Deep Inductive Graph Representation Learning",
"fno": "08519335",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Graph Theory",
"Learning Artificial Intelligence",
"Attributed Graphs",
"Interpretable Inductive Graph Representations",
"Sparse Feature Vectors",
"Deep GL",
"Graphlet Features",
"Graph Based Transfer Learning Tasks",
"Deep Inductive Graph Representation Learning",
"Multilayered Hierarchical Graph Representation",
"Graph Theory",
"Learning Artificial Intelligence",
"Runtime",
"Graph Representation Learning",
"Inductive Representation Learning",
"Relational Function Learning",
"Transfer Learning",
"Graph Based Feature Learning",
"Higher Order Structures"
],
"authors": [
{
"givenName": "Ryan A.",
"surname": "Rossi",
"fullName": "Ryan A. Rossi",
"affiliation": "Adobe Research, San Jose, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rong",
"surname": "Zhou",
"fullName": "Rong Zhou",
"affiliation": "Google, Mountain View, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nesreen K.",
"surname": "Ahmed",
"fullName": "Nesreen K. Ahmed",
"affiliation": "Intel Labs, Santa Clara, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "03",
"pubDate": "2020-03-01 00:00:00",
"pubType": "trans",
"pages": "438-452",
"year": "2020",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"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/tp/2023/03/09786656",
"title": "Logarithmic Schatten-<inline-formula><tex-math notation=\"LaTeX\">Z_$p$_Z</tex-math></inline-formula> Norm Minimization for Tensorial Multi-View Subspace Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2023/03/09786656/1DQPxlTv7lS",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/04/09813586",
"title": "Tensorized Bipartite Graph Learning for Multi-View Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2023/04/09813586/1EJBgVxqety",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2022/03/09112322",
"title": "Backdoor Attacks Against Transfer Learning With Pre-Trained Deep Learning Models",
"doi": null,
"abstractUrl": "/journal/sc/2022/03/09112322/1kwiidLDgty",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2022/04/09184150",
"title": "Prime Inner Product Encoding for Effective Wildcard-Based Multi-Keyword Fuzzy Search",
"doi": null,
"abstractUrl": "/journal/sc/2022/04/09184150/1mLHTnHtwqc",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/2022/04/09336330",
"title": "Bidirectional and Malleable Proof-of-Ownership for Large File in Cloud Storage",
"doi": null,
"abstractUrl": "/journal/cc/2022/04/09336330/1qHLb1H9WDu",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2022/04/09366363",
"title": "Security of Multi-Adjustable Join Schemes: Separations and Implications",
"doi": null,
"abstractUrl": "/journal/tq/2022/04/09366363/1twaRGe1SOQ",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/01/09452800",
"title": "Core Decomposition on Uncertain Graphs Revisited",
"doi": null,
"abstractUrl": "/journal/tk/2023/01/09452800/1ulCu0Hdqs8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2022/06/09525235",
"title": "Secure Anonymous Communication on Corrupted Machines With Reverse Firewalls",
"doi": null,
"abstractUrl": "/journal/tq/2022/06/09525235/1wup6HcCXIY",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/10/09652093",
"title": "Alternative Tower Field Construction for Quantum Implementation of the AES S-Box",
"doi": null,
"abstractUrl": "/journal/tc/2022/10/09652093/1zmuUCGaiK4",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08606161",
"articleId": "17D45W9KVH1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08523627",
"articleId": "17D45WIXbPc",
"__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": "1FUYx502pJC",
"doi": "10.1109/TKDE.2022.3199592",
"abstract": "There are extensive studies focusing on the application scenario that all the bipartite cohesive subgraphs need to be discovered in a bipartite graph. However, we observe that, for some applications, one is interested in finding bipartite cohesive subgraphs containing a specific vertex. In this paper, we study a new query-dependent bipartite cohesive subgraph search problem based on <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-wing model, named as personalized <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-wing search problem. We study the <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-wing equivalence relationship to summarize the edges of a bipartite graph <inline-formula><tex-math notation=\"LaTeX\">Z_$G$_Z</tex-math></inline-formula> into groups. Therefore, all the edges of <inline-formula><tex-math notation=\"LaTeX\">Z_$G$_Z</tex-math></inline-formula> are segregated into different groups, i.e. <italic><inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-wing equivalence class</italic>, forming an efficient and wing number conserving index called <italic>EquiWing-Graph</italic>. Further, we propose a more compact index, <italic>EquiWing-Tree</italic>, which is achieved by using our proposed <italic><inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-butterfly loose</italic> approach and discovered hierarchy properties. These indices are used to expedite the personalized <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-wing search with a non-repetitive access to <inline-formula><tex-math notation=\"LaTeX\">Z_$G$_Z</tex-math></inline-formula>, which leads to linear algorithms for searching the personalized <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-wing. Moreover, we conduct a thorough study on the maintenance of the proposed indices for evolving bipartite graphs. We discover novel properties that help us localize the scope of the maintenance at a low cost. By exploiting the discoveries, we propose novel algorithms for maintaining the two indices, which substantially reduces the cost of maintenance. We perform extensive experimental studies in real-world graphs to validate the efficiency and effectiveness of <italic>EquiWing-Graph</italic> and <italic>EquiWing-Tree</italic> compared to the baseline.",
"abstracts": [
{
"abstractType": "Regular",
"content": "There are extensive studies focusing on the application scenario that all the bipartite cohesive subgraphs need to be discovered in a bipartite graph. However, we observe that, for some applications, one is interested in finding bipartite cohesive subgraphs containing a specific vertex. In this paper, we study a new query-dependent bipartite cohesive subgraph search problem based on <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math></inline-formula>-wing model, named as personalized <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math></inline-formula>-wing search problem. We study the <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math></inline-formula>-wing equivalence relationship to summarize the edges of a bipartite graph <inline-formula><tex-math notation=\"LaTeX\">$G$</tex-math></inline-formula> into groups. Therefore, all the edges of <inline-formula><tex-math notation=\"LaTeX\">$G$</tex-math></inline-formula> are segregated into different groups, i.e. <italic><inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math></inline-formula>-wing equivalence class</italic>, forming an efficient and wing number conserving index called <italic>EquiWing-Graph</italic>. Further, we propose a more compact index, <italic>EquiWing-Tree</italic>, which is achieved by using our proposed <italic><inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math></inline-formula>-butterfly loose</italic> approach and discovered hierarchy properties. These indices are used to expedite the personalized <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math></inline-formula>-wing search with a non-repetitive access to <inline-formula><tex-math notation=\"LaTeX\">$G$</tex-math></inline-formula>, which leads to linear algorithms for searching the personalized <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math></inline-formula>-wing. Moreover, we conduct a thorough study on the maintenance of the proposed indices for evolving bipartite graphs. We discover novel properties that help us localize the scope of the maintenance at a low cost. By exploiting the discoveries, we propose novel algorithms for maintaining the two indices, which substantially reduces the cost of maintenance. We perform extensive experimental studies in real-world graphs to validate the efficiency and effectiveness of <italic>EquiWing-Graph</italic> and <italic>EquiWing-Tree</italic> compared to the baseline.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "There are extensive studies focusing on the application scenario that all the bipartite cohesive subgraphs need to be discovered in a bipartite graph. However, we observe that, for some applications, one is interested in finding bipartite cohesive subgraphs containing a specific vertex. In this paper, we study a new query-dependent bipartite cohesive subgraph search problem based on --wing model, named as personalized --wing search problem. We study the --wing equivalence relationship to summarize the edges of a bipartite graph - into groups. Therefore, all the edges of - are segregated into different groups, i.e. --wing equivalence class, forming an efficient and wing number conserving index called EquiWing-Graph. Further, we propose a more compact index, EquiWing-Tree, which is achieved by using our proposed --butterfly loose approach and discovered hierarchy properties. These indices are used to expedite the personalized --wing search with a non-repetitive access to -, which leads to linear algorithms for searching the personalized --wing. Moreover, we conduct a thorough study on the maintenance of the proposed indices for evolving bipartite graphs. We discover novel properties that help us localize the scope of the maintenance at a low cost. By exploiting the discoveries, we propose novel algorithms for maintaining the two indices, which substantially reduces the cost of maintenance. We perform extensive experimental studies in real-world graphs to validate the efficiency and effectiveness of EquiWing-Graph and EquiWing-Tree compared to the baseline.",
"title": "Searching Personalized <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-wing in Bipartite Graphs",
"normalizedTitle": "Searching Personalized --wing in Bipartite Graphs",
"fno": "09860045",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Bipartite Graph",
"Indexes",
"Maintenance Engineering",
"Image Edge Detection",
"Costs",
"Search Problems",
"Heuristic Algorithms",
"Bipartite Graphs",
"Dense Subgraph Search",
"<inline-formula xmlns:ali=\"http://www.niso.org/schemas/ali/1.0/\" xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"> <tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math> </inline-formula>-wing",
"Dynamic Maintenance"
],
"authors": [
{
"givenName": "Aman",
"surname": "Abidi",
"fullName": "Aman Abidi",
"affiliation": "Department of Computer Science and Software Engineering, Swinburne University of Technology, Melbourne, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lu",
"surname": "Chen",
"fullName": "Lu Chen",
"affiliation": "Department of Computer Science and Software Engineering, Swinburne University of Technology, Melbourne, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rui",
"surname": "Zhou",
"fullName": "Rui Zhou",
"affiliation": "Department of Computer Science and Software Engineering, Swinburne University of Technology, Melbourne, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chengfei",
"surname": "Liu",
"fullName": "Chengfei Liu",
"affiliation": "Department of Computer Science and Software Engineering, Swinburne University of Technology, Melbourne, Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-08-01 00:00:00",
"pubType": "trans",
"pages": "1-14",
"year": "5555",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/td/2015/04/06800081",
"title": "The <inline-formula><tex-math notation=\"LaTeX\">Z_${\\schmi g}$_Z</tex-math></inline-formula>-Good-Neighbor Conditional Diagnosability of <inline-formula><tex-math notation=\"LaTeX\">Z_${\\schmi k}$_Z</tex-math></inline-formula>-Ary <inline-formula><tex-math notation=\"LaTeX\">Z_${\\schmi n}$_Z</tex-math></inline-formula>-Cubes under the PMC Model and MM Model",
"doi": null,
"abstractUrl": "/journal/td/2015/04/06800081/13rRUyeCka1",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09889176",
"title": "Finding the Maximum <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Balanced Biclique on Weighted Bipartite Graphs",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09889176/1GDrnzNt5Re",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/5555/01/09894070",
"title": "mCore <inline-formula><tex-math notation=\"LaTeX\">Z_$+$_Z</tex-math></inline-formula>: A Real-Time Design Achieving <inline-formula><tex-math notation=\"LaTeX\">Z_$\\sim 500~\\mu$_Z</tex-math></inline-formula> s Scheduling for 5G MU-MIMO Systems",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/09894070/1GIqn6CnOY8",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/5555/01/09904298",
"title": "<italic>RF-Ear<inline-formula><tex-math notation=\"LaTeX\">Z_$^+$_Z</tex-math></inline-formula></italic>: A Mechanical Identification and Troubleshooting System based on Contactless Vibration Sensing",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/09904298/1H0G4yOvGPm",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09944955",
"title": "<inline-formula><tex-math notation=\"LaTeX\">Z_$kt$_Z</tex-math></inline-formula>-Safety: Graph Release via <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Anonymity and <inline-formula><tex-math notation=\"LaTeX\">Z_$t$_Z</tex-math></inline-formula>-Closeness",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09944955/1IbM9dSufYI",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10018284",
"title": "Bidirectional String Anchors for Improved Text Indexing and Top-<inline-formula><tex-math notation=\"LaTeX\">Z_$K$_Z</tex-math></inline-formula> Similarity Search",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10018284/1JYYXitocWQ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/09996549",
"title": "Non-Graph Data Clustering via <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {O}(n)$_Z</tex-math></inline-formula> Bipartite Graph Convolution",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/09996549/1Jju3GyUgog",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10023987",
"title": "Towards Multi-User, Secure, and Verifiable <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>NN Query in Cloud Database",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10023987/1K9soYKgOT6",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10078319",
"title": "Top-<inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula> Community Similarity Search Over Large-Scale Road Networks",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10078319/1LIN5YpM6HK",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/5555/01/10093117",
"title": "An Efficient Algorithm for Hamiltonian Path Embedding of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Ary <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula>-Cubes under the Partitioned Edge Fault Model",
"doi": null,
"abstractUrl": "/journal/td/5555/01/10093117/1M61XDsMpB6",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09857632",
"articleId": "1FSY4UKLfP2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09858599",
"articleId": "1FUYxcHtIw8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1N0sxRjgSbK",
"title": "June",
"year": "2023",
"issueNum": "06",
"idPrefix": "tc",
"pubType": "journal",
"volume": "72",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1HJuLchrDsA",
"doi": "10.1109/TC.2022.3215640",
"abstract": "The <italic>multiparty comparison</italic> allows to compare two integers <inline-formula><tex-math notation=\"LaTeX\">Z_$x$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_$y$_Z</tex-math></inline-formula> blindly, where a set of players hold the shares of the elements <inline-formula><tex-math notation=\"LaTeX\">Z_$x and y, x, y \\in \\mathbb {F}_{p}$_Z</tex-math></inline-formula>, a prime field. The existing <italic>multiparty comparison</italic> protocols execute in constant rounds, but the number of multiplications depends on the size of the prime <inline-formula><tex-math notation=\"LaTeX\">Z_$p$_Z</tex-math></inline-formula>, i.e., the communication complexity will be high for large prime <inline-formula><tex-math notation=\"LaTeX\">Z_$p$_Z</tex-math></inline-formula>. In this paper, we present a <italic>multiparty comparison</italic> protocol with constant rounds in which the number of multiplications depends on the number of players rather than the prime <inline-formula><tex-math notation=\"LaTeX\">Z_$p$_Z</tex-math></inline-formula> itself. This <italic>multiparty comparison</italic> protocol is further extended to design a <italic>multiparty equality-test</italic> protocol. An equality-test protocol computes the equality of shares in constant rounds and its number of multiplications depends on the number of players. Our proposed protocols <italic>multiparty comparison</italic> and equality-test are unconditionally secure against the active and passive attacks and have <inline-formula><tex-math notation=\"LaTeX\">Z_$O(n)$_Z</tex-math></inline-formula> communication complexity, where <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula> is the number of players. We also present an efficient technique for <italic>fault detection</italic> that can verify the correctness of various protocols.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The <italic>multiparty comparison</italic> allows to compare two integers <inline-formula><tex-math notation=\"LaTeX\">$x$</tex-math><alternatives><mml:math><mml:mi>x</mml:mi></mml:math><inline-graphic xlink:href=\"sutradhar-ieq1-3215640.gif\"/></alternatives></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">$y$</tex-math><alternatives><mml:math><mml:mi>y</mml:mi></mml:math><inline-graphic xlink:href=\"sutradhar-ieq2-3215640.gif\"/></alternatives></inline-formula> blindly, where a set of players hold the shares of the elements <inline-formula><tex-math notation=\"LaTeX\">$x and y, x, y \\in \\mathbb {F}_{p}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>x</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>y</mml:mi><mml:mo>,</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>∈</mml:mo><mml:msub><mml:mi mathvariant=\"double-struck\">F</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:math><inline-graphic xlink:href=\"sutradhar-ieq3-3215640.gif\"/></alternatives></inline-formula>, a prime field. The existing <italic>multiparty comparison</italic> protocols execute in constant rounds, but the number of multiplications depends on the size of the prime <inline-formula><tex-math notation=\"LaTeX\">$p$</tex-math><alternatives><mml:math><mml:mi>p</mml:mi></mml:math><inline-graphic xlink:href=\"sutradhar-ieq4-3215640.gif\"/></alternatives></inline-formula>, i.e., the communication complexity will be high for large prime <inline-formula><tex-math notation=\"LaTeX\">$p$</tex-math><alternatives><mml:math><mml:mi>p</mml:mi></mml:math><inline-graphic xlink:href=\"sutradhar-ieq5-3215640.gif\"/></alternatives></inline-formula>. In this paper, we present a <italic>multiparty comparison</italic> protocol with constant rounds in which the number of multiplications depends on the number of players rather than the prime <inline-formula><tex-math notation=\"LaTeX\">$p$</tex-math><alternatives><mml:math><mml:mi>p</mml:mi></mml:math><inline-graphic xlink:href=\"sutradhar-ieq6-3215640.gif\"/></alternatives></inline-formula> itself. This <italic>multiparty comparison</italic> protocol is further extended to design a <italic>multiparty equality-test</italic> protocol. An equality-test protocol computes the equality of shares in constant rounds and its number of multiplications depends on the number of players. Our proposed protocols <italic>multiparty comparison</italic> and equality-test are unconditionally secure against the active and passive attacks and have <inline-formula><tex-math notation=\"LaTeX\">$O(n)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"sutradhar-ieq7-3215640.gif\"/></alternatives></inline-formula> communication complexity, where <inline-formula><tex-math notation=\"LaTeX\">$n$</tex-math><alternatives><mml:math><mml:mi>n</mml:mi></mml:math><inline-graphic xlink:href=\"sutradhar-ieq8-3215640.gif\"/></alternatives></inline-formula> is the number of players. We also present an efficient technique for <italic>fault detection</italic> that can verify the correctness of various protocols.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The multiparty comparison allows to compare two integers - and - blindly, where a set of players hold the shares of the elements -, a prime field. The existing multiparty comparison protocols execute in constant rounds, but the number of multiplications depends on the size of the prime -, i.e., the communication complexity will be high for large prime -. In this paper, we present a multiparty comparison protocol with constant rounds in which the number of multiplications depends on the number of players rather than the prime - itself. This multiparty comparison protocol is further extended to design a multiparty equality-test protocol. An equality-test protocol computes the equality of shares in constant rounds and its number of multiplications depends on the number of players. Our proposed protocols multiparty comparison and equality-test are unconditionally secure against the active and passive attacks and have - communication complexity, where - is the number of players. We also present an efficient technique for fault detection that can verify the correctness of various protocols.",
"title": "A Privacy-Preserving Comparison Protocol",
"normalizedTitle": "A Privacy-Preserving Comparison Protocol",
"fno": "09927425",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Protocols",
"Costs",
"Cryptography",
"Sorting",
"Complexity Theory",
"Arithmetic",
"Fault Detection",
"Millionaires Problem",
"Secure Computation",
"Data Privacy",
"Information Security",
"Multiparty Computation"
],
"authors": [
{
"givenName": "Kartick",
"surname": "Sutradhar",
"fullName": "Kartick Sutradhar",
"affiliation": "Department of Computer Science and Engineering, Gandhi Institute of Technology and Management, Bengaluru, Karnataka, India",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hari",
"surname": "Om",
"fullName": "Hari Om",
"affiliation": "Department of Computer Science and Engineering, Indian Institute of Technology (ISM)- Dhanbad, Dhanbad, India",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2023-06-01 00:00:00",
"pubType": "trans",
"pages": "1815-1821",
"year": "2023",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/2019/04/08494787",
"title": "Better Circuits for Binary Polynomial Multiplication",
"doi": null,
"abstractUrl": "/journal/tc/2019/04/08494787/14s8M4Sn2IE",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/06/09756312",
"title": "Continuous <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Regret Minimization Queries: A Dynamic Coreset Approach",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09756312/1CvQcl7WKu4",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/03/09827923",
"title": "PMNS for Efficient Arithmetic and Small Memory Cost",
"doi": null,
"abstractUrl": "/journal/ec/2022/03/09827923/1EWSBFUfd6M",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2020/06/08976264",
"title": "Algorithms for Inversion Mod <inline-formula><tex-math notation="LaTeX">Z_$p^k$_Z</tex-math></inline-formula>",
"doi": null,
"abstractUrl": "/journal/tc/2020/06/08976264/1h0W7qmGRHO",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2021/12/09108400",
"title": "iTAM: Bilateral Privacy-Preserving Task Assignment for Mobile Crowdsensing",
"doi": null,
"abstractUrl": "/journal/tm/2021/12/09108400/1koLbGlOPa8",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/02/09328560",
"title": "High-Radix Design of a Scalable Montgomery Modular Multiplier With Low Latency",
"doi": null,
"abstractUrl": "/journal/tc/2022/02/09328560/1qw8PWGHmEM",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/02/09463675",
"title": "Efficient Hardware Implementation of Finite Field Arithmetic <inline-formula><tex-math notation=\"LaTeX\">Z_$AB+C$_Z</tex-math></inline-formula> for Binary Ring-LWE Based Post-Quantum Cryptography",
"doi": null,
"abstractUrl": "/journal/ec/2022/02/09463675/1uFxptYevFC",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09531369",
"title": "Deletion Propagation Revisited for Multiple Key Preserving Views",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09531369/1wJkZcWVIE8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/06/09535228",
"title": "Improved Fixed-Parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network",
"doi": null,
"abstractUrl": "/journal/tb/2022/06/09535228/1wMEIAs9pni",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2023/01/09615013",
"title": "Privacy-Preserving Proof-of-Location With Security Against Geo-Tampering",
"doi": null,
"abstractUrl": "/journal/tq/2023/01/09615013/1yyhBtMPBss",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09913718",
"articleId": "1Hmgfqc8f7i",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09924609",
"articleId": "1HBI0hVXxss",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1MTOUEFAeT6",
"title": "June",
"year": "2023",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "45",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1I05uIgMI1i",
"doi": "10.1109/TPAMI.2022.3219121",
"abstract": "Transfer regression is a practical and challenging problem with important applications in various domains, such as engineering design and localization. Capturing the relatedness of different domains is the key of adaptive knowledge transfer. In this paper, we investigate an effective way of explicitly modelling domain relatedness through transfer kernel, a transfer-specified kernel that considers domain information in the covariance calculation. Specifically, we first give the formal definition of transfer kernel, and introduce three basic general forms that well cover existing related works. To cope with the limitations of the basic forms in handling complex real-world data, we further propose two advanced forms. Corresponding instantiations of the two forms are developed, namely <inline-formula><tex-math notation=\"LaTeX\">Z_${Trk}_{\\alpha \\beta }$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_${Trk}_{\\omega }$_Z</tex-math></inline-formula> based on multiple kernel learning and neural networks, respectively. For each instantiation, we present a condition with which the positive semi-definiteness is guaranteed and a semantic meaning is interpreted to the learned domain relatedness. Moreover, the condition can be easily used in the learning of <italic>TrGP</italic><inline-formula><tex-math notation=\"LaTeX\">Z_$_{\\alpha \\beta }$_Z</tex-math></inline-formula> and <italic>TrGP</italic><inline-formula><tex-math notation=\"LaTeX\">Z_$_{\\omega }$_Z</tex-math></inline-formula> that are the Gaussian process models with the transfer kernels <inline-formula><tex-math notation=\"LaTeX\">Z_${Trk}_{\\alpha \\beta }$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_${Trk}_{\\omega }$_Z</tex-math></inline-formula> respectively. Extensive empirical studies show the effectiveness of <italic>TrGP</italic><inline-formula><tex-math notation=\"LaTeX\">Z_$_{\\alpha \\beta }$_Z</tex-math></inline-formula> and <italic>TrGP</italic><inline-formula><tex-math notation=\"LaTeX\">Z_$_{\\omega }$_Z</tex-math></inline-formula> on domain relatedness modelling and transfer adaptiveness.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Transfer regression is a practical and challenging problem with important applications in various domains, such as engineering design and localization. Capturing the relatedness of different domains is the key of adaptive knowledge transfer. In this paper, we investigate an effective way of explicitly modelling domain relatedness through transfer kernel, a transfer-specified kernel that considers domain information in the covariance calculation. Specifically, we first give the formal definition of transfer kernel, and introduce three basic general forms that well cover existing related works. To cope with the limitations of the basic forms in handling complex real-world data, we further propose two advanced forms. Corresponding instantiations of the two forms are developed, namely <inline-formula><tex-math notation=\"LaTeX\">${Trk}_{\\alpha \\beta }$</tex-math><alternatives><mml:math><mml:msub><mml:mrow><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mi>α</mml:mi><mml:mi>β</mml:mi></mml:mrow></mml:msub></mml:math><inline-graphic xlink:href=\"wei-ieq1-3219121.gif\"/></alternatives></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">${Trk}_{\\omega }$</tex-math><alternatives><mml:math><mml:msub><mml:mrow><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mi>ω</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"wei-ieq2-3219121.gif\"/></alternatives></inline-formula> based on multiple kernel learning and neural networks, respectively. For each instantiation, we present a condition with which the positive semi-definiteness is guaranteed and a semantic meaning is interpreted to the learned domain relatedness. Moreover, the condition can be easily used in the learning of <italic>TrGP</italic><inline-formula><tex-math notation=\"LaTeX\">$_{\\alpha \\beta }$</tex-math><alternatives><mml:math><mml:msub><mml:mrow/><mml:mrow><mml:mi>α</mml:mi><mml:mi>β</mml:mi></mml:mrow></mml:msub></mml:math><inline-graphic xlink:href=\"wei-ieq3-3219121.gif\"/></alternatives></inline-formula> and <italic>TrGP</italic><inline-formula><tex-math notation=\"LaTeX\">$_{\\omega }$</tex-math><alternatives><mml:math><mml:msub><mml:mrow/><mml:mi>ω</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"wei-ieq4-3219121.gif\"/></alternatives></inline-formula> that are the Gaussian process models with the transfer kernels <inline-formula><tex-math notation=\"LaTeX\">${Trk}_{\\alpha \\beta }$</tex-math><alternatives><mml:math><mml:msub><mml:mrow><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mi>α</mml:mi><mml:mi>β</mml:mi></mml:mrow></mml:msub></mml:math><inline-graphic xlink:href=\"wei-ieq5-3219121.gif\"/></alternatives></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">${Trk}_{\\omega }$</tex-math><alternatives><mml:math><mml:msub><mml:mrow><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mi>ω</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"wei-ieq6-3219121.gif\"/></alternatives></inline-formula> respectively. Extensive empirical studies show the effectiveness of <italic>TrGP</italic><inline-formula><tex-math notation=\"LaTeX\">$_{\\alpha \\beta }$</tex-math><alternatives><mml:math><mml:msub><mml:mrow/><mml:mrow><mml:mi>α</mml:mi><mml:mi>β</mml:mi></mml:mrow></mml:msub></mml:math><inline-graphic xlink:href=\"wei-ieq7-3219121.gif\"/></alternatives></inline-formula> and <italic>TrGP</italic><inline-formula><tex-math notation=\"LaTeX\">$_{\\omega }$</tex-math><alternatives><mml:math><mml:msub><mml:mrow/><mml:mi>ω</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"wei-ieq8-3219121.gif\"/></alternatives></inline-formula> on domain relatedness modelling and transfer adaptiveness.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Transfer regression is a practical and challenging problem with important applications in various domains, such as engineering design and localization. Capturing the relatedness of different domains is the key of adaptive knowledge transfer. In this paper, we investigate an effective way of explicitly modelling domain relatedness through transfer kernel, a transfer-specified kernel that considers domain information in the covariance calculation. Specifically, we first give the formal definition of transfer kernel, and introduce three basic general forms that well cover existing related works. To cope with the limitations of the basic forms in handling complex real-world data, we further propose two advanced forms. Corresponding instantiations of the two forms are developed, namely - and - based on multiple kernel learning and neural networks, respectively. For each instantiation, we present a condition with which the positive semi-definiteness is guaranteed and a semantic meaning is interpreted to the learned domain relatedness. Moreover, the condition can be easily used in the learning of TrGP- and TrGP- that are the Gaussian process models with the transfer kernels - and - respectively. Extensive empirical studies show the effectiveness of TrGP- and TrGP- on domain relatedness modelling and transfer adaptiveness.",
"title": "Adaptive Transfer Kernel Learning for Transfer Gaussian Process Regression",
"normalizedTitle": "Adaptive Transfer Kernel Learning for Transfer Gaussian Process Regression",
"fno": "09937157",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Kernel",
"Task Analysis",
"Matrix Decomposition",
"Data Models",
"Adaptation Models",
"Standards",
"Semantics",
"Transfer Regression",
"Domain Relatedness",
"Transfer Kernel"
],
"authors": [
{
"givenName": "Pengfei",
"surname": "Wei",
"fullName": "Pengfei Wei",
"affiliation": "Speech & Audio Team, Bytedance AI Lab, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yiping",
"surname": "Ke",
"fullName": "Yiping Ke",
"affiliation": "School of Computer Science and Engineering, Nanyang Technological University, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yew-Soon",
"surname": "Ong",
"fullName": "Yew-Soon Ong",
"affiliation": "School of Computer Science and Engineering, Nanyang Technological University, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zejun",
"surname": "Ma",
"fullName": "Zejun Ma",
"affiliation": "Speech & Audio Team, Bytedance AI Lab, Singapore",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2023-06-01 00:00:00",
"pubType": "trans",
"pages": "7142-7156",
"year": "2023",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/2019/04/08494787",
"title": "Better Circuits for Binary Polynomial Multiplication",
"doi": null,
"abstractUrl": "/journal/tc/2019/04/08494787/14s8M4Sn2IE",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2020/02/08624452",
"title": "A Reaction-Based Model of the State Space of Chemical Reaction Systems Enables Efficient Simulations",
"doi": null,
"abstractUrl": "/journal/tb/2020/02/08624452/17D45Xh13sh",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/02/09690063",
"title": "Algebraic Attacks on Block Ciphers Using Quantum Annealing",
"doi": null,
"abstractUrl": "/journal/ec/2022/02/09690063/1AlCiyYAakw",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/03/09802749",
"title": "Transfer Kernel Learning for Multi-Source Transfer Gaussian Process Regression",
"doi": null,
"abstractUrl": "/journal/tp/2023/03/09802749/1Eo1uOhsy2c",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2023/01/09930647",
"title": "The High Faulty Tolerant Capability of the Alternating Group Graphs",
"doi": null,
"abstractUrl": "/journal/td/2023/01/09930647/1HMP3UkhGus",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2021/11/09099372",
"title": "On Heterogeneous Sensing Capability for Distributed Rendezvous in Cognitive Radio Networks",
"doi": null,
"abstractUrl": "/journal/tm/2021/11/09099372/1k7oCRHzGAE",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/09/09266749",
"title": "Easy-But-Effective Domain Sub-Similarity Learning for Transfer Regression",
"doi": null,
"abstractUrl": "/journal/tk/2022/09/09266749/1oZxqu9nYcg",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/05/09241452",
"title": "Enhanced Group Sparse Regularized Nonconvex Regression for Face Recognition",
"doi": null,
"abstractUrl": "/journal/tp/2022/05/09241452/1ogEy0c42R2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/08/09369083",
"title": "Robust Low-Tubal-Rank Tensor Recovery From Binary Measurements",
"doi": null,
"abstractUrl": "/journal/tp/2022/08/09369083/1rFvS23KDAI",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/05/09423579",
"title": "Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks",
"doi": null,
"abstractUrl": "/journal/tc/2022/05/09423579/1tkyeT8TOwg",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09960802",
"articleId": "1IxvTfTI568",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09954214",
"articleId": "1InorY9vGXS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1JNmPQgzUwU",
"title": "March",
"year": "2023",
"issueNum": "03",
"idPrefix": "td",
"pubType": "journal",
"volume": "34",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1IWfP8p5MQ0",
"doi": "10.1109/TPDS.2022.3227544",
"abstract": "With the increasing problem complexity, more irregular applications are deployed on high-performance clusters due to the parallel working paradigm, and yield irregular memory access behaviors across nodes. However, the irregularity of memory access behaviors is not comprehensively studied, which results in low utilization of the integrated hybrid memory system compositing of stacked DRAM and off-chip DRAM. To address this problem, we devise a novel method called <italic>Similarity-Managed Hybrid Memory System</italic> (<italic>SM-HMS</italic>) to improve the hybrid memory system performance by leveraging the memory access similarity among nodes in a cluster. Within <italic>SM-HMS</italic>, two techniques are proposed, <italic>Memory Access Similarity Measuring</italic> and <italic>Similarity-based Memory Access Behavior Sharing</italic>. To quantify the memory access similarity, memory access behaviors of each node are vectorized, and the distance between two vectors is used as the memory access similarity. The calculated memory access similarity is used to share memory access behaviors precisely across nodes. With the shared memory access behaviors, <italic>SM-HMS</italic> divides the stacked DRAM into two sections, the <italic>sliding window section</italic> and the <italic>outlier section</italic>. The shared memory access behaviors guide the replacement of the <italic>sliding window section</italic> while the <italic>outlier section</italic> is managed in the LRU manner. Our evaluation results with a set of irregular applications on various clusters consisting of up to 256 nodes have shown that <italic>SM-HMS</italic> outperforms the state-of-the-art approaches, <italic>Cameo</italic>, <italic>Chameleon</italic>, and <italic>Hyrbid2</italic>, on job finish time reduction by up to <inline-formula><tex-math notation=\"LaTeX\">Z_$58.6\\%$_Z</tex-math></inline-formula>, <inline-formula><tex-math notation=\"LaTeX\">Z_$56.7\\%$_Z</tex-math></inline-formula>, and <inline-formula><tex-math notation=\"LaTeX\">Z_$31.3\\%$_Z</tex-math></inline-formula>, with <inline-formula><tex-math notation=\"LaTeX\">Z_$46.1\\%$_Z</tex-math></inline-formula>, <inline-formula><tex-math notation=\"LaTeX\">Z_$41.6\\%$_Z</tex-math></inline-formula>, and <inline-formula><tex-math notation=\"LaTeX\">Z_$19.3\\%$_Z</tex-math></inline-formula> on average, respectively. <italic>SM-HMS</italic> can also achieve up to <inline-formula><tex-math notation=\"LaTeX\">Z_$98.6\\%$_Z</tex-math></inline-formula> (<inline-formula><tex-math notation=\"LaTeX\">Z_$91.9\\%$_Z</tex-math></inline-formula> on average) of the ideal hybrid memory system performance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With the increasing problem complexity, more irregular applications are deployed on high-performance clusters due to the parallel working paradigm, and yield irregular memory access behaviors across nodes. However, the irregularity of memory access behaviors is not comprehensively studied, which results in low utilization of the integrated hybrid memory system compositing of stacked DRAM and off-chip DRAM. To address this problem, we devise a novel method called <italic>Similarity-Managed Hybrid Memory System</italic> (<italic>SM-HMS</italic>) to improve the hybrid memory system performance by leveraging the memory access similarity among nodes in a cluster. Within <italic>SM-HMS</italic>, two techniques are proposed, <italic>Memory Access Similarity Measuring</italic> and <italic>Similarity-based Memory Access Behavior Sharing</italic>. To quantify the memory access similarity, memory access behaviors of each node are vectorized, and the distance between two vectors is used as the memory access similarity. The calculated memory access similarity is used to share memory access behaviors precisely across nodes. With the shared memory access behaviors, <italic>SM-HMS</italic> divides the stacked DRAM into two sections, the <italic>sliding window section</italic> and the <italic>outlier section</italic>. The shared memory access behaviors guide the replacement of the <italic>sliding window section</italic> while the <italic>outlier section</italic> is managed in the LRU manner. Our evaluation results with a set of irregular applications on various clusters consisting of up to 256 nodes have shown that <italic>SM-HMS</italic> outperforms the state-of-the-art approaches, <italic>Cameo</italic>, <italic>Chameleon</italic>, and <italic>Hyrbid2</italic>, on job finish time reduction by up to <inline-formula><tex-math notation=\"LaTeX\">$58.6\\%$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>58</mml:mn><mml:mo>.</mml:mo><mml:mn>6</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"liu-ieq1-3227544.gif\"/></alternatives></inline-formula>, <inline-formula><tex-math notation=\"LaTeX\">$56.7\\%$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>56</mml:mn><mml:mo>.</mml:mo><mml:mn>7</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"liu-ieq2-3227544.gif\"/></alternatives></inline-formula>, and <inline-formula><tex-math notation=\"LaTeX\">$31.3\\%$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>31</mml:mn><mml:mo>.</mml:mo><mml:mn>3</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"liu-ieq3-3227544.gif\"/></alternatives></inline-formula>, with <inline-formula><tex-math notation=\"LaTeX\">$46.1\\%$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>46</mml:mn><mml:mo>.</mml:mo><mml:mn>1</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"liu-ieq4-3227544.gif\"/></alternatives></inline-formula>, <inline-formula><tex-math notation=\"LaTeX\">$41.6\\%$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>41</mml:mn><mml:mo>.</mml:mo><mml:mn>6</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"liu-ieq5-3227544.gif\"/></alternatives></inline-formula>, and <inline-formula><tex-math notation=\"LaTeX\">$19.3\\%$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>19</mml:mn><mml:mo>.</mml:mo><mml:mn>3</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"liu-ieq6-3227544.gif\"/></alternatives></inline-formula> on average, respectively. <italic>SM-HMS</italic> can also achieve up to <inline-formula><tex-math notation=\"LaTeX\">$98.6\\%$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>98</mml:mn><mml:mo>.</mml:mo><mml:mn>6</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"liu-ieq7-3227544.gif\"/></alternatives></inline-formula> (<inline-formula><tex-math notation=\"LaTeX\">$91.9\\%$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>91</mml:mn><mml:mo>.</mml:mo><mml:mn>9</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"liu-ieq8-3227544.gif\"/></alternatives></inline-formula> on average) of the ideal hybrid memory system performance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With the increasing problem complexity, more irregular applications are deployed on high-performance clusters due to the parallel working paradigm, and yield irregular memory access behaviors across nodes. However, the irregularity of memory access behaviors is not comprehensively studied, which results in low utilization of the integrated hybrid memory system compositing of stacked DRAM and off-chip DRAM. To address this problem, we devise a novel method called Similarity-Managed Hybrid Memory System (SM-HMS) to improve the hybrid memory system performance by leveraging the memory access similarity among nodes in a cluster. Within SM-HMS, two techniques are proposed, Memory Access Similarity Measuring and Similarity-based Memory Access Behavior Sharing. To quantify the memory access similarity, memory access behaviors of each node are vectorized, and the distance between two vectors is used as the memory access similarity. The calculated memory access similarity is used to share memory access behaviors precisely across nodes. With the shared memory access behaviors, SM-HMS divides the stacked DRAM into two sections, the sliding window section and the outlier section. The shared memory access behaviors guide the replacement of the sliding window section while the outlier section is managed in the LRU manner. Our evaluation results with a set of irregular applications on various clusters consisting of up to 256 nodes have shown that SM-HMS outperforms the state-of-the-art approaches, Cameo, Chameleon, and Hyrbid2, on job finish time reduction by up to -, -, and -, with -, -, and - on average, respectively. SM-HMS can also achieve up to - (- on average) of the ideal hybrid memory system performance.",
"title": "Exploring Memory Access Similarity to Improve Irregular Application Performance for Distributed Hybrid Memory Systems",
"normalizedTitle": "Exploring Memory Access Similarity to Improve Irregular Application Performance for Distributed Hybrid Memory Systems",
"fno": "09976297",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Cache Storage",
"DRAM Chips",
"Memory Architecture",
"Shared Memory Systems",
"Storage Management",
"Calculated Memory Access Similarity",
"Ideal Hybrid Memory System Performance",
"Integrated Hybrid Memory System Compositing",
"Irregular Applications",
"Irregular Memory Access Behaviors",
"Memory Access Similarity Measuring",
"Novel Method Called Similarity Managed Hybrid Memory System",
"Similarity Based Memory Access Behavior Sharing",
"Similarity Managed Hybrid Memory System",
"SM HMS",
"Stacked DRAM",
"Behavioral Sciences",
"Random Access Memory",
"Monitoring",
"Task Analysis",
"Indium Tin Oxide",
"Operating Systems",
"Data Structures",
"Cluster",
"Irregular Application",
"Memory System",
"DRAM",
"Hybrid Memory System"
],
"authors": [
{
"givenName": "Wenjie",
"surname": "Liu",
"fullName": "Wenjie Liu",
"affiliation": "Department of Computer and Information Sciences, Temple University, Philadelphia, PA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xubin",
"surname": "He",
"fullName": "Xubin He",
"affiliation": "Department of Computer and Information Sciences, Temple University, Philadelphia, PA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qing",
"surname": "Liu",
"fullName": "Qing Liu",
"affiliation": "Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2023-03-01 00:00:00",
"pubType": "trans",
"pages": "797-809",
"year": "2023",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tb/2020/02/08464179",
"title": "Detection of Colorectal Carcinoma Based on Microbiota Analysis Using Generalized Regression Neural Networks and Nonlinear Feature Selection",
"doi": null,
"abstractUrl": "/journal/tb/2020/02/08464179/13xI8A6oaMD",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/su/2022/04/09748006",
"title": "Safe Building HVAC Control via Batch Reinforcement Learning",
"doi": null,
"abstractUrl": "/journal/su/2022/04/09748006/1CdACdGDfDa",
"parentPublication": {
"id": "trans/su",
"title": "IEEE Transactions on Sustainable Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2023/05/09851943",
"title": "ROLLED: <underline>R</underline>acetrack Memory <underline>O</underline>ptimized <underline>L</underline>inear <underline>L</underline>ayout and <underline>E</underline>fficient <underline>D</underline>ecomposition of Decision Trees",
"doi": null,
"abstractUrl": "/journal/tc/2023/05/09851943/1FFHeRJbMTm",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2023/05/10082870",
"title": "Congestion Control for Datacenter Networks: A Control-Theoretic Approach",
"doi": null,
"abstractUrl": "/journal/td/2023/05/10082870/1LRbYqKSRvW",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/01/09456991",
"title": "A Clinical Dataset and Various Baselines for Chromosome Instance Segmentation",
"doi": null,
"abstractUrl": "/journal/tb/2022/01/09456991/1utV0kh5nA4",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2023/03/09525260",
"title": "PROCS: Power Routing and Current Scheduling in Multi-Relay Magnetic MIMO WPT System",
"doi": null,
"abstractUrl": "/journal/tm/2023/03/09525260/1wuoX5UFC0g",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2023/04/09563210",
"title": "Measuring Micrometer-Level Vibrations With mmWave Radar",
"doi": null,
"abstractUrl": "/journal/tm/2023/04/09563210/1xvtheduFDa",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/09/09591330",
"title": "Neural-PIM: Efficient Processing-In-Memory With Neural Approximation of Peripherals",
"doi": null,
"abstractUrl": "/journal/tc/2022/09/09591330/1y2Fypc47e0",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__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"
},
{
"id": "trans/td/2022/11/09647969",
"title": "Flexible Clustered Federated Learning for Client-Level Data Distribution Shift",
"doi": null,
"abstractUrl": "/journal/td/2022/11/09647969/1ziKk2OmMkU",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09999286",
"articleId": "1JqD99lmous",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09999473",
"articleId": "1JrMCACX55K",
"__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": "1K3XDAtRZ8Q",
"doi": "10.1109/TVCG.2023.3238008",
"abstract": "This paper introduces an efficient algorithm for persistence diagram computation, given an input piecewise linear scalar field <inline-formula><tex-math notation=\"LaTeX\">Z_$f$_Z</tex-math></inline-formula> defined on a <inline-formula><tex-math notation=\"LaTeX\">Z_$d$_Z</tex-math></inline-formula>-dimensional simplicial complex <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {K}$_Z</tex-math></inline-formula>, with <inline-formula><tex-math notation=\"LaTeX\">Z_$d \\leq 3$_Z</tex-math></inline-formula>. Our work revisits the seminal algorithm <italic>“PairSimplices”</italic> [31], [103] with discrete Morse theory (DMT) [34], [80], which greatly reduces the number of input simplices to consider. Further, we also extend to DMT and accelerate the stratification strategy described in <italic>“PairSimplices”</italic> [31], [103] for the fast computation of the <inline-formula><tex-math notation=\"LaTeX\">Z_$0^{th}$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_$(d-1)^{th}$_Z</tex-math></inline-formula> diagrams, noted <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {D}_{0}(f)$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {D}_{d-1}(f)$_Z</tex-math></inline-formula>. Minima-saddle persistence pairs (<inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {D}_{0}(f)$_Z</tex-math></inline-formula>) and saddle-maximum persistence pairs (<inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {D}_{d-1}(f)$_Z</tex-math></inline-formula>) are efficiently computed by processing , with a Union-Find , the unstable sets of 1-saddles and the stable sets of <inline-formula><tex-math notation=\"LaTeX\">Z_$(d-1)$_Z</tex-math></inline-formula>-saddles. We provide a detailed description of the (optional) handling of the boundary component of <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {K}$_Z</tex-math></inline-formula> when processing <inline-formula><tex-math notation=\"LaTeX\">Z_$(d-1)$_Z</tex-math></inline-formula>-saddles. This fast pre-computation for the dimensions 0 and <inline-formula><tex-math notation=\"LaTeX\">Z_$(d-1)$_Z</tex-math></inline-formula> enables an aggressive specialization of [4] to the 3D case, which results in a drastic reduction of the number of input simplices for the computation of <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {D}_{1}(f)$_Z</tex-math></inline-formula>, the intermediate layer of the <italic>sandwich</italic>. Finally, we document several performance improvements via shared-memory parallelism. We provide an open-source implementation of our algorithm for reproducibility purposes. We also contribute a reproducible benchmark package, which exploits three-dimensional data from a public repository and compares our algorithm to a variety of publicly available implementations. Extensive experiments indicate that our algorithm improves by two orders of magnitude the time performance of the seminal <italic>“PairSimplices”</italic> algorithm it extends. Moreover, it also improves memory footprint and time performance over a selection of 14 competing approaches, with a substantial gain over the fastest available approaches, while producing a strictly identical output. We illustrate the utility of our contributions with an application to the fast and robust extraction of persistent 1-dimensional generators on surfaces, volume data and high-dimensional point clouds.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper introduces an efficient algorithm for persistence diagram computation, given an input piecewise linear scalar field <inline-formula><tex-math notation=\"LaTeX\">$f$</tex-math></inline-formula> defined on a <inline-formula><tex-math notation=\"LaTeX\">$d$</tex-math></inline-formula>-dimensional simplicial complex <inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {K}$</tex-math></inline-formula>, with <inline-formula><tex-math notation=\"LaTeX\">$d \\leq 3$</tex-math></inline-formula>. Our work revisits the seminal algorithm <italic>“PairSimplices”</italic> [31], [103] with discrete Morse theory (DMT) [34], [80], which greatly reduces the number of input simplices to consider. Further, we also extend to DMT and accelerate the stratification strategy described in <italic>“PairSimplices”</italic> [31], [103] for the fast computation of the <inline-formula><tex-math notation=\"LaTeX\">$0^{th}$</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">$(d-1)^{th}$</tex-math></inline-formula> diagrams, noted <inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {D}_{0}(f)$</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {D}_{d-1}(f)$</tex-math></inline-formula>. Minima-saddle persistence pairs (<inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {D}_{0}(f)$</tex-math></inline-formula>) and saddle-maximum persistence pairs (<inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {D}_{d-1}(f)$</tex-math></inline-formula>) are efficiently computed by processing , with a Union-Find , the unstable sets of 1-saddles and the stable sets of <inline-formula><tex-math notation=\"LaTeX\">$(d-1)$</tex-math></inline-formula>-saddles. We provide a detailed description of the (optional) handling of the boundary component of <inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {K}$</tex-math></inline-formula> when processing <inline-formula><tex-math notation=\"LaTeX\">$(d-1)$</tex-math></inline-formula>-saddles. This fast pre-computation for the dimensions 0 and <inline-formula><tex-math notation=\"LaTeX\">$(d-1)$</tex-math></inline-formula> enables an aggressive specialization of [4] to the 3D case, which results in a drastic reduction of the number of input simplices for the computation of <inline-formula><tex-math notation=\"LaTeX\">$\\mathcal {D}_{1}(f)$</tex-math></inline-formula>, the intermediate layer of the <italic>sandwich</italic>. Finally, we document several performance improvements via shared-memory parallelism. We provide an open-source implementation of our algorithm for reproducibility purposes. We also contribute a reproducible benchmark package, which exploits three-dimensional data from a public repository and compares our algorithm to a variety of publicly available implementations. Extensive experiments indicate that our algorithm improves by two orders of magnitude the time performance of the seminal <italic>“PairSimplices”</italic> algorithm it extends. Moreover, it also improves memory footprint and time performance over a selection of 14 competing approaches, with a substantial gain over the fastest available approaches, while producing a strictly identical output. We illustrate the utility of our contributions with an application to the fast and robust extraction of persistent 1-dimensional generators on surfaces, volume data and high-dimensional point clouds.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper introduces an efficient algorithm for persistence diagram computation, given an input piecewise linear scalar field - defined on a --dimensional simplicial complex -, with -. Our work revisits the seminal algorithm “PairSimplices” [31], [103] with discrete Morse theory (DMT) [34], [80], which greatly reduces the number of input simplices to consider. Further, we also extend to DMT and accelerate the stratification strategy described in “PairSimplices” [31], [103] for the fast computation of the - and - diagrams, noted - and -. Minima-saddle persistence pairs (-) and saddle-maximum persistence pairs (-) are efficiently computed by processing , with a Union-Find , the unstable sets of 1-saddles and the stable sets of --saddles. We provide a detailed description of the (optional) handling of the boundary component of - when processing --saddles. This fast pre-computation for the dimensions 0 and - enables an aggressive specialization of [4] to the 3D case, which results in a drastic reduction of the number of input simplices for the computation of -, the intermediate layer of the sandwich. Finally, we document several performance improvements via shared-memory parallelism. We provide an open-source implementation of our algorithm for reproducibility purposes. We also contribute a reproducible benchmark package, which exploits three-dimensional data from a public repository and compares our algorithm to a variety of publicly available implementations. Extensive experiments indicate that our algorithm improves by two orders of magnitude the time performance of the seminal “PairSimplices” algorithm it extends. Moreover, it also improves memory footprint and time performance over a selection of 14 competing approaches, with a substantial gain over the fastest available approaches, while producing a strictly identical output. We illustrate the utility of our contributions with an application to the fast and robust extraction of persistent 1-dimensional generators on surfaces, volume data and high-dimensional point clouds.",
"title": "Discrete Morse Sandwich: Fast Computation of Persistence Diagrams for Scalar Data – An Algorithm and A Benchmark",
"normalizedTitle": "Discrete Morse Sandwich: Fast Computation of Persistence Diagrams for Scalar Data – An Algorithm and A Benchmark",
"fno": "10021892",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Mining",
"Feature Extraction",
"Data Visualization",
"Data Analysis",
"Three Dimensional Displays",
"Stars",
"Sea Surface",
"Topological Data Analysis",
"Scalar Data",
"Persistence Diagrams",
"Discrete Morse Theory"
],
"authors": [
{
"givenName": "Pierre",
"surname": "Guillou",
"fullName": "Pierre Guillou",
"affiliation": "CNRS and Sorbonne Université, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jules",
"surname": "Vidal",
"fullName": "Jules Vidal",
"affiliation": "CNRS and Sorbonne Université, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julien",
"surname": "Tierny",
"fullName": "Julien Tierny",
"affiliation": "CNRS and Sorbonne Université, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "1-18",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tq/5555/01/09842386",
"title": "Verifiable Homomorphic Secret Sharing for Low Degree Polynomials",
"doi": null,
"abstractUrl": "/journal/tq/5555/01/09842386/1FlM51CnLeo",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09893402",
"title": "Structured Sparse Non-negative Matrix Factorization with <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,0}$_Z</tex-math></inline-formula>-Norm",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09893402/1GGLdY0vH0c",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/5555/01/09987649",
"title": "Anonymous Aggregate Fine-Grained Cloud Data Verification System for Smart Health",
"doi": null,
"abstractUrl": "/journal/cc/5555/01/09987649/1J7RK3HdSpO",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2023/04/10036482",
"title": "Test Data Compression for Transparent-Scan Sequences",
"doi": null,
"abstractUrl": "/journal/si/2023/04/10036482/1KxPXOB1Ogg",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/5555/01/10093117",
"title": "An Efficient Algorithm for Hamiltonian Path Embedding of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Ary <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula>-Cubes under the Partitioned Edge Fault Model",
"doi": null,
"abstractUrl": "/journal/td/5555/01/10093117/1M61XDsMpB6",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/01/09037115",
"title": "Aligning Points to Lines: Provable Approximations",
"doi": null,
"abstractUrl": "/journal/tk/2022/01/09037115/1igMO6tI3Is",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2020/11/09179010",
"title": "Computing-in-Memory for Performance and Energy-Efficient Homomorphic Encryption",
"doi": null,
"abstractUrl": "/journal/si/2020/11/09179010/1mDpvhCa3rW",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2023/01/09420260",
"title": "Age Optimal Information Gathering and Dissemination on Graphs",
"doi": null,
"abstractUrl": "/journal/tm/2023/01/09420260/1tdUGrSPdg4",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2022/01/09523604",
"title": "Universal Scaling of Distributed Queues Under Load Balancing in the Super-Halfin-Whitt Regime",
"doi": null,
"abstractUrl": "/journal/nt/2022/01/09523604/1wnL9MNq6Vq",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/04/09650532",
"title": "A Variational Framework for Curve Shortening in Various Geometric Domains",
"doi": null,
"abstractUrl": "/journal/tg/2023/04/09650532/1zkoVsoJeow",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10021890",
"articleId": "1K3XC5MZdGE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10021888",
"articleId": "1K3XDZ8pUAg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1K9sskESoSY",
"name": "ttg555501-010021892s1-supp1-3238008.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-010021892s1-supp1-3238008.pdf",
"extension": "pdf",
"size": "2.2 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwc3wwx",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tq",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1KnSwOy3LmE",
"doi": "10.1109/TDSC.2023.3241184",
"abstract": "Oblivious Random Access Machines (ORAMs) allow cloud users to access remote data without leaking access patterns. Current ORAM solutions achieve this goal at expense of either increasing bandwidth consumption by a factor of <inline-formula><tex-math notation=\"LaTeX\">Z_$O(\\log N)$_Z</tex-math></inline-formula>, where <inline-formula><tex-math notation=\"LaTeX\">Z_$N$_Z</tex-math></inline-formula> is the number of data blocks, or relying on homomorphic encryption for bandwidth amplification reduction to <inline-formula><tex-math notation=\"LaTeX\">Z_$O(1)$_Z</tex-math></inline-formula>. Furthermore, most ORAMs are only effective for a single user, while the solutions for multi-user scenarios often induce security or performance problems. This paper introduces <italic>Tianji</italic> — an asynchronous multi-user Shamir-based ORAM system — which supports asynchronous network access scenarios for multiple users with improved security and performance. <italic>Tianji</italic> is implemented on top of <italic>S <inline-formula><tex-math notation=\"LaTeX\">Z_$^{3}$_Z</tex-math></inline-formula> ORAM<inline-formula><tex-math notation=\"LaTeX\">Z_$^+$_Z</tex-math></inline-formula></italic>—an extension of the state-of-the-art Shamir-based S <inline-formula><tex-math notation=\"LaTeX\">Z_$^{3}$_Z</tex-math></inline-formula> ORAM with a new non-eviction data write-back scheme to achieve <inline-formula><tex-math notation=\"LaTeX\">Z_$O(1)$_Z</tex-math></inline-formula> consumption in both bandwidth amplification and storage capacity. Our experimental results show that the proposed <italic>Tianji</italic> with <italic>S <inline-formula><tex-math notation=\"LaTeX\">Z_$^{3}$_Z</tex-math></inline-formula> ORAM<inline-formula><tex-math notation=\"LaTeX\">Z_$^+$_Z</tex-math></inline-formula></italic> can significantly outperform the state-of-the-art multi-user <italic>TaoStore</italic> in terms of access latency and client scalability. Additionally, its average response time is relatively stable when client loads increase.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Oblivious Random Access Machines (ORAMs) allow cloud users to access remote data without leaking access patterns. Current ORAM solutions achieve this goal at expense of either increasing bandwidth consumption by a factor of <inline-formula><tex-math notation=\"LaTeX\">$O(\\log N)$</tex-math></inline-formula>, where <inline-formula><tex-math notation=\"LaTeX\">$N$</tex-math></inline-formula> is the number of data blocks, or relying on homomorphic encryption for bandwidth amplification reduction to <inline-formula><tex-math notation=\"LaTeX\">$O(1)$</tex-math></inline-formula>. Furthermore, most ORAMs are only effective for a single user, while the solutions for multi-user scenarios often induce security or performance problems. This paper introduces <italic>Tianji</italic> — an asynchronous multi-user Shamir-based ORAM system — which supports asynchronous network access scenarios for multiple users with improved security and performance. <italic>Tianji</italic> is implemented on top of <italic>S <inline-formula><tex-math notation=\"LaTeX\">$^{3}$</tex-math></inline-formula> ORAM<inline-formula><tex-math notation=\"LaTeX\">$^+$</tex-math></inline-formula></italic>—an extension of the state-of-the-art Shamir-based S <inline-formula><tex-math notation=\"LaTeX\">$^{3}$</tex-math></inline-formula> ORAM with a new non-eviction data write-back scheme to achieve <inline-formula><tex-math notation=\"LaTeX\">$O(1)$</tex-math></inline-formula> consumption in both bandwidth amplification and storage capacity. Our experimental results show that the proposed <italic>Tianji</italic> with <italic>S <inline-formula><tex-math notation=\"LaTeX\">$^{3}$</tex-math></inline-formula> ORAM<inline-formula><tex-math notation=\"LaTeX\">$^+$</tex-math></inline-formula></italic> can significantly outperform the state-of-the-art multi-user <italic>TaoStore</italic> in terms of access latency and client scalability. Additionally, its average response time is relatively stable when client loads increase.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Oblivious Random Access Machines (ORAMs) allow cloud users to access remote data without leaking access patterns. Current ORAM solutions achieve this goal at expense of either increasing bandwidth consumption by a factor of -, where - is the number of data blocks, or relying on homomorphic encryption for bandwidth amplification reduction to -. Furthermore, most ORAMs are only effective for a single user, while the solutions for multi-user scenarios often induce security or performance problems. This paper introduces Tianji — an asynchronous multi-user Shamir-based ORAM system — which supports asynchronous network access scenarios for multiple users with improved security and performance. Tianji is implemented on top of S - ORAM-—an extension of the state-of-the-art Shamir-based S - ORAM with a new non-eviction data write-back scheme to achieve - consumption in both bandwidth amplification and storage capacity. Our experimental results show that the proposed Tianji with S - ORAM- can significantly outperform the state-of-the-art multi-user TaoStore in terms of access latency and client scalability. Additionally, its average response time is relatively stable when client loads increase.",
"title": "Tianji: Securing A Practical Asynchronous Multi-User ORAM",
"normalizedTitle": "Tianji: Securing A Practical Asynchronous Multi-User ORAM",
"fno": "10032622",
"hasPdf": true,
"idPrefix": "tq",
"keywords": [
"Bandwidth",
"Servers",
"Security",
"Data Privacy",
"Time Factors",
"Throughput",
"Secure Storage",
"Multi User Oblivious RAM",
"Access Control",
"Oblivious Storage",
"Shamirs Secret Sharing"
],
"authors": [
{
"givenName": "Wen",
"surname": "Cheng",
"fullName": "Wen Cheng",
"affiliation": "Wuhan National Laboratory for Optoelectronics, Huazhong University of Science and Technology, Wuhan, Hubei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dazou",
"surname": "Sang",
"fullName": "Dazou Sang",
"affiliation": "Wuhan National Laboratory for Optoelectronics, Huazhong University of Science and Technology, Wuhan, Hubei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lingfang",
"surname": "Zeng",
"fullName": "Lingfang Zeng",
"affiliation": "Zhejiang Laboratory, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yang",
"surname": "Wang",
"fullName": "Yang Wang",
"affiliation": "Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "André",
"surname": "Brinkmann",
"fullName": "André Brinkmann",
"affiliation": "Johannes Gutenberg-University Mainz, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "1-13",
"year": "5555",
"issn": "1545-5971",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tq/2020/05/08375657",
"title": "The Cost of Scaling a Reliable Interconnection Topology",
"doi": null,
"abstractUrl": "/journal/tq/2020/05/08375657/13rRUygBw8s",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/5555/01/09925109",
"title": "Privacy-Preserving and Publicly Verifiable Matrix Multiplication",
"doi": null,
"abstractUrl": "/journal/sc/5555/01/09925109/1HBHUwyHb6o",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/5555/01/09980572",
"title": "Achieving High Availability in Inter-DC WAN Traffic Engineering",
"doi": null,
"abstractUrl": "/journal/nt/5555/01/09980572/1J2T00A5VqU",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10023987",
"title": "Towards Multi-User, Secure, and Verifiable <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>NN Query in Cloud Database",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10023987/1K9soYKgOT6",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/5555/01/10075522",
"title": "Optimal Random Access Strategies for Trigger-Based Multiple-Packet Reception Channels",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/10075522/1LAuBzpYxAQ",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2023/05/10082870",
"title": "Congestion Control for Datacenter Networks: A Control-Theoretic Approach",
"doi": null,
"abstractUrl": "/journal/td/2023/05/10082870/1LRbYqKSRvW",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2021/01/08713938",
"title": "RoD: Evaluating the Risk of Data Disclosure Using Noise Estimation for Differential Privacy",
"doi": null,
"abstractUrl": "/journal/bd/2021/01/08713938/1a313aIkenm",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/09/09253703",
"title": "Effective and Efficient Discovery of Top-k Meta Paths in Heterogeneous Information Networks",
"doi": null,
"abstractUrl": "/journal/tk/2022/09/09253703/1oDXxbwvBoQ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2022/10/09351661",
"title": "ULPT: A User-Centric Location Privacy Trading Framework for Mobile Crowd Sensing",
"doi": null,
"abstractUrl": "/journal/tm/2022/10/09351661/1r50nvdb8TS",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2023/01/09615013",
"title": "Privacy-Preserving Proof-of-Location With Security Against Geo-Tampering",
"doi": null,
"abstractUrl": "/journal/tq/2023/01/09615013/1yyhBtMPBss",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10032626",
"articleId": "1KnSwkPR5bW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10032613",
"articleId": "1KnSwXdG1IQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1KJsT6THF5e",
"name": "ttq555501-010032622s1-supp1-3241184.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttq555501-010032622s1-supp1-3241184.pdf",
"extension": "pdf",
"size": "95.9 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1yhBm9PMLUA",
"title": "Dec.",
"year": "2021",
"issueNum": "12",
"idPrefix": "tk",
"pubType": "journal",
"volume": "33",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1hJKhc0u1So",
"doi": "10.1109/TKDE.2020.2975998",
"abstract": "Aggregate nearest neighbor (<sc>Ann</sc>) query in both the euclidean space and road networks has been extensively studied, and the flexible aggregate nearest neighbor (<sc>Fann</sc>) problem further generalizes <sc>Ann</sc> by introducing an extra flexibility parameter <inline-formula><tex-math notation=\"LaTeX\">Z_$\\phi$_Z</tex-math></inline-formula> that ranges in <inline-formula><tex-math notation=\"LaTeX\">Z_$(0, 1]$_Z</tex-math></inline-formula>. In this article, we focus on <sc>Fann</sc> on road networks, denoted as <sc>Fann</sc><inline-formula><tex-math notation=\"LaTeX\">Z_$_\\mathcal {R}$_Z</tex-math></inline-formula>, and its keyword-aware variant, denoted as <sc>KFann</sc><inline-formula><tex-math notation=\"LaTeX\">Z_$_\\mathcal {R}$_Z</tex-math></inline-formula>. To solve these problems, we propose a series of universal (i.e., suitable for both <italic>max</italic> and <italic>sum</italic>) algorithms, including a Dijkstra-based algorithm that enumerates <inline-formula><tex-math notation=\"LaTeX\">Z_$P$_Z</tex-math></inline-formula> instead of <inline-formula><tex-math notation=\"LaTeX\">Z_$\\phi |Q|$_Z</tex-math></inline-formula>-combinations of <inline-formula><tex-math notation=\"LaTeX\">Z_$Q$_Z</tex-math></inline-formula>, a queue-based approach that processes data points from-near-to-far, and a framework that combines <italic>incremental euclidean restriction</italic> (IER) and <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>NN. We also propose a specific exact solution to <italic>max</italic>-<sc>Fann</sc><inline-formula><tex-math notation=\"LaTeX\">Z_$_\\mathcal {R}$_Z</tex-math></inline-formula> and a constant-factor ratio approximate solution to <italic>sum</italic>-<sc>Fann</sc><inline-formula><tex-math notation=\"LaTeX\">Z_$_\\mathcal {R}$_Z</tex-math></inline-formula>. These specific algorithms are easy to implement and can achieve excellent performance in some scenarios. Besides, we further extend this problem to top-<inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula> and multiple <sc>Fann</sc><inline-formula><tex-math notation=\"LaTeX\">Z_$_\\mathcal {R}$_Z</tex-math></inline-formula> (resp., <sc>KFann</sc><inline-formula><tex-math notation=\"LaTeX\">Z_$_\\mathcal {R}$_Z</tex-math></inline-formula>) queries. We conduct a comprehensive experimental evaluation for the proposed algorithms on real datasets to demonstrate their superior efficiency and high quality.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Aggregate nearest neighbor (<sc>Ann</sc>) query in both the euclidean space and road networks has been extensively studied, and the flexible aggregate nearest neighbor (<sc>Fann</sc>) problem further generalizes <sc>Ann</sc> by introducing an extra flexibility parameter <inline-formula><tex-math notation=\"LaTeX\">$\\phi$</tex-math><alternatives><mml:math><mml:mi>ϕ</mml:mi></mml:math><inline-graphic xlink:href=\"chen-ieq1-2975998.gif\"/></alternatives></inline-formula> that ranges in <inline-formula><tex-math notation=\"LaTeX\">$(0, 1]$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"chen-ieq2-2975998.gif\"/></alternatives></inline-formula>. In this article, we focus on <sc>Fann</sc> on road networks, denoted as <sc>Fann</sc><inline-formula><tex-math notation=\"LaTeX\">$_\\mathcal {R}$</tex-math><alternatives><mml:math><mml:msub><mml:mrow/><mml:mi mathvariant=\"script\">R</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"chen-ieq3-2975998.gif\"/></alternatives></inline-formula>, and its keyword-aware variant, denoted as <sc>KFann</sc><inline-formula><tex-math notation=\"LaTeX\">$_\\mathcal {R}$</tex-math><alternatives><mml:math><mml:msub><mml:mrow/><mml:mi mathvariant=\"script\">R</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"chen-ieq4-2975998.gif\"/></alternatives></inline-formula>. To solve these problems, we propose a series of universal (i.e., suitable for both <italic>max</italic> and <italic>sum</italic>) algorithms, including a Dijkstra-based algorithm that enumerates <inline-formula><tex-math notation=\"LaTeX\">$P$</tex-math><alternatives><mml:math><mml:mi>P</mml:mi></mml:math><inline-graphic xlink:href=\"chen-ieq5-2975998.gif\"/></alternatives></inline-formula> instead of <inline-formula><tex-math notation=\"LaTeX\">$\\phi |Q|$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>ϕ</mml:mi><mml:mo>|</mml:mo><mml:mi>Q</mml:mi><mml:mo>|</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"chen-ieq6-2975998.gif\"/></alternatives></inline-formula>-combinations of <inline-formula><tex-math notation=\"LaTeX\">$Q$</tex-math><alternatives><mml:math><mml:mi>Q</mml:mi></mml:math><inline-graphic xlink:href=\"chen-ieq7-2975998.gif\"/></alternatives></inline-formula>, a queue-based approach that processes data points from-near-to-far, and a framework that combines <italic>incremental euclidean restriction</italic> (IER) and <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"chen-ieq8-2975998.gif\"/></alternatives></inline-formula>NN. We also propose a specific exact solution to <italic>max</italic>-<sc>Fann</sc><inline-formula><tex-math notation=\"LaTeX\">$_\\mathcal {R}$</tex-math><alternatives><mml:math><mml:msub><mml:mrow/><mml:mi mathvariant=\"script\">R</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"chen-ieq9-2975998.gif\"/></alternatives></inline-formula> and a constant-factor ratio approximate solution to <italic>sum</italic>-<sc>Fann</sc><inline-formula><tex-math notation=\"LaTeX\">$_\\mathcal {R}$</tex-math><alternatives><mml:math><mml:msub><mml:mrow/><mml:mi mathvariant=\"script\">R</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"chen-ieq10-2975998.gif\"/></alternatives></inline-formula>. These specific algorithms are easy to implement and can achieve excellent performance in some scenarios. Besides, we further extend this problem to top-<inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"chen-ieq11-2975998.gif\"/></alternatives></inline-formula> and multiple <sc>Fann</sc><inline-formula><tex-math notation=\"LaTeX\">$_\\mathcal {R}$</tex-math><alternatives><mml:math><mml:msub><mml:mrow/><mml:mi mathvariant=\"script\">R</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"chen-ieq12-2975998.gif\"/></alternatives></inline-formula> (resp., <sc>KFann</sc><inline-formula><tex-math notation=\"LaTeX\">$_\\mathcal {R}$</tex-math><alternatives><mml:math><mml:msub><mml:mrow/><mml:mi mathvariant=\"script\">R</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"chen-ieq13-2975998.gif\"/></alternatives></inline-formula>) queries. We conduct a comprehensive experimental evaluation for the proposed algorithms on real datasets to demonstrate their superior efficiency and high quality.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Aggregate nearest neighbor (Ann) query in both the euclidean space and road networks has been extensively studied, and the flexible aggregate nearest neighbor (Fann) problem further generalizes Ann by introducing an extra flexibility parameter - that ranges in -. In this article, we focus on Fann on road networks, denoted as Fann-, and its keyword-aware variant, denoted as KFann-. To solve these problems, we propose a series of universal (i.e., suitable for both max and sum) algorithms, including a Dijkstra-based algorithm that enumerates - instead of --combinations of -, a queue-based approach that processes data points from-near-to-far, and a framework that combines incremental euclidean restriction (IER) and -NN. We also propose a specific exact solution to max-Fann- and a constant-factor ratio approximate solution to sum-Fann-. These specific algorithms are easy to implement and can achieve excellent performance in some scenarios. Besides, we further extend this problem to top-- and multiple Fann- (resp., KFann-) queries. We conduct a comprehensive experimental evaluation for the proposed algorithms on real datasets to demonstrate their superior efficiency and high quality.",
"title": "Flexible Aggregate Nearest Neighbor Queries and its Keyword-Aware Variant on Road Networks",
"normalizedTitle": "Flexible Aggregate Nearest Neighbor Queries and its Keyword-Aware Variant on Road Networks",
"fno": "09007415",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Approximation Theory",
"Query Processing",
"Visual Databases",
"Flexible Aggregate Nearest Neighbor Queries",
"Keyword Aware Variant",
"Road Networks",
"Euclidean Space",
"Flexible Aggregate Nearest Neighbor Problem",
"Fann Problem",
"Incremental Euclidean Restriction",
"Dijkstra Based Algorithm",
"Nearest Neighbor Methods",
"Indexing",
"Approximation Algorithms",
"Heuristic Algorithms",
"Keyword Search",
"Spatial Databases",
"Query Processing",
"Road Networks",
"Indexing",
"Spatial Keyword Databases"
],
"authors": [
{
"givenName": "Zhongpu",
"surname": "Chen",
"fullName": "Zhongpu Chen",
"affiliation": "Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bin",
"surname": "Yao",
"fullName": "Bin Yao",
"affiliation": "Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhi-Jie",
"surname": "Wang",
"fullName": "Zhi-Jie Wang",
"affiliation": "College of Computer Science, Chongqing University, Chongqing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaofeng",
"surname": "Gao",
"fullName": "Xiaofeng Gao",
"affiliation": "Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shuo",
"surname": "Shang",
"fullName": "Shuo Shang",
"affiliation": "Computer Science Program, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shuai",
"surname": "Ma",
"fullName": "Shuai Ma",
"affiliation": "School of Computer Science and Engineering, Beihang University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Minyi",
"surname": "Guo",
"fullName": "Minyi Guo",
"affiliation": "Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2021-12-01 00:00:00",
"pubType": "trans",
"pages": "3701-3715",
"year": "2021",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/2023/01/09726805",
"title": "Accelerating Large-Scale Graph-Based Nearest Neighbor Search on a Computational Storage Platform",
"doi": null,
"abstractUrl": "/journal/tc/2023/01/09726805/1Brwvt2KImI",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/08964488",
"title": "Efficient Compression and Indexing for Highly Repetitive DNA Sequence Collections",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/08964488/1gLZGsjhZkc",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2022/02/08966480",
"title": "Reverse Nearest Neighbor Search in Semantic Trajectories for Location-Based Services",
"doi": null,
"abstractUrl": "/journal/sc/2022/02/08966480/1gNEzYzsFAk",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/11/09001178",
"title": "Cohesive Group Nearest Neighbor Queries on Road-Social Networks under Multi-Criteria",
"doi": null,
"abstractUrl": "/journal/tk/2021/11/09001178/1hwt2btgALu",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/01/09127807",
"title": "Average Top-k Aggregate Loss for Supervised Learning",
"doi": null,
"abstractUrl": "/journal/tp/2022/01/09127807/1l3uajhdTP2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/2022/03/09143389",
"title": "QuickN: Practical and Secure Nearest Neighbor Search on Encrypted Large-Scale Data",
"doi": null,
"abstractUrl": "/journal/cc/2022/03/09143389/1lxmjz6YUy4",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/2023/01/09465718",
"title": "Scalable Fuzzy Keyword Ranked Search Over Encrypted Data on Hybrid Clouds",
"doi": null,
"abstractUrl": "/journal/cc/2023/01/09465718/1uIR8zUjkje",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09534476",
"title": "Discovering Significant Communities on Bipartite Graphs: An Index-Based Approach",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09534476/1wLbitNpdle",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2023/01/09540336",
"title": "BIB-MKS: Post-Quantum Secure Biometric Identity-Based Multi-Keyword Search Over Encrypted Data in Cloud Storage Systems",
"doi": null,
"abstractUrl": "/journal/sc/2023/01/09540336/1wWCa73jr5C",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/10/09672729",
"title": "Spatial-Keyword Skyline Publish/Subscribe Query Processing Over Distributed Sliding Window Streaming Data",
"doi": null,
"abstractUrl": "/journal/tc/2022/10/09672729/1zWzLpjhFDy",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09018163",
"articleId": "1hN4iaVmQFy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09007743",
"articleId": "1hGqqn7qNNu",
"__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": "1Fu4IEH0oAU",
"doi": "10.1109/TVCG.2022.3193672",
"abstract": "The <italic>MD-Cave</italic> is an immersive analytics system that provides enhanced stereoscopic visualizations to support visual diagnoses performed by radiologists. The system harnesses contemporary paradigms in immersive visualization and 3D interaction, which are better suited for investigating 3D volumetric data. We retain practicality through efficient utilization of desk space and comfort for radiologists in terms of frequent long duration use. <italic>MD-Cave</italic> is general and incorporates: (1) high resolution stereoscopic visualizations through a surround triple-monitor setup, (2) 3D interactions through head and hand tracking, (3) and a general framework that supports 3D visualization of deep-seated anatomical structures without the need for explicit segmentation algorithms. Such a general framework expands the utility of our system to many diagnostic scenarios. We have developed <italic>MD-Cave</italic> through close collaboration and feedback from two expert radiologists who evaluated the utility of <italic>MD-Cave</italic> and the 3D interactions in the context of radiological examinations. We also provide evaluation of <italic>MD-Cave</italic> through case studies performed by an expert radiologist and concrete examples on multiple real-world diagnostic scenarios, such as pancreatic cancer, shoulder-CT, and COVID-19 Chest CT examination.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The <italic>MD-Cave</italic> is an immersive analytics system that provides enhanced stereoscopic visualizations to support visual diagnoses performed by radiologists. The system harnesses contemporary paradigms in immersive visualization and 3D interaction, which are better suited for investigating 3D volumetric data. We retain practicality through efficient utilization of desk space and comfort for radiologists in terms of frequent long duration use. <italic>MD-Cave</italic> is general and incorporates: (1) high resolution stereoscopic visualizations through a surround triple-monitor setup, (2) 3D interactions through head and hand tracking, (3) and a general framework that supports 3D visualization of deep-seated anatomical structures without the need for explicit segmentation algorithms. Such a general framework expands the utility of our system to many diagnostic scenarios. We have developed <italic>MD-Cave</italic> through close collaboration and feedback from two expert radiologists who evaluated the utility of <italic>MD-Cave</italic> and the 3D interactions in the context of radiological examinations. We also provide evaluation of <italic>MD-Cave</italic> through case studies performed by an expert radiologist and concrete examples on multiple real-world diagnostic scenarios, such as pancreatic cancer, shoulder-CT, and COVID-19 Chest CT examination.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The MD-Cave is an immersive analytics system that provides enhanced stereoscopic visualizations to support visual diagnoses performed by radiologists. The system harnesses contemporary paradigms in immersive visualization and 3D interaction, which are better suited for investigating 3D volumetric data. We retain practicality through efficient utilization of desk space and comfort for radiologists in terms of frequent long duration use. MD-Cave is general and incorporates: (1) high resolution stereoscopic visualizations through a surround triple-monitor setup, (2) 3D interactions through head and hand tracking, (3) and a general framework that supports 3D visualization of deep-seated anatomical structures without the need for explicit segmentation algorithms. Such a general framework expands the utility of our system to many diagnostic scenarios. We have developed MD-Cave through close collaboration and feedback from two expert radiologists who evaluated the utility of MD-Cave and the 3D interactions in the context of radiological examinations. We also provide evaluation of MD-Cave through case studies performed by an expert radiologist and concrete examples on multiple real-world diagnostic scenarios, such as pancreatic cancer, shoulder-CT, and COVID-19 Chest CT examination.",
"title": "<italic>MD-Cave</italic>: An Immersive Visualization Workbench for Radiologists",
"normalizedTitle": "MD-Cave: An Immersive Visualization Workbench for Radiologists",
"fno": "09847102",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Three Dimensional Displays",
"Visualization",
"Stereo Image Processing",
"Data Visualization",
"Task Analysis",
"Head",
"Radiology",
"3 D Selection",
"Immersive Diagnosis",
"Stereoscopic Visualization",
"Volume Rendering"
],
"authors": [
{
"givenName": "Shreeraj",
"surname": "Jadhav",
"fullName": "Shreeraj Jadhav",
"affiliation": "Department of Computer Science, Stony Brook University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arie E.",
"surname": "Kaufman",
"fullName": "Arie E. Kaufman",
"affiliation": "Department of Computer Science, Stony Brook University, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-07-01 00:00:00",
"pubType": "trans",
"pages": "1-12",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visapp/2014/8133/3/07295085",
"title": "Immersive visualizations in a VR Cave environment for the training and enhancement of social skills for children with autism",
"doi": null,
"abstractUrl": "/proceedings-article/visapp/2014/07295085/12OmNBQkx5E",
"parentPublication": {
"id": "proceedings/visapp/2014/8133/2",
"title": "2014 International Conference on Computer Vision Theory and Applications (VISAPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2016/4149/0/4149a178",
"title": "A CAVE/Desktop Collaborative Virtual Environment for Offshore Oil Platform Training",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2016/4149a178/12OmNrJiCGH",
"parentPublication": {
"id": "proceedings/svr/2016/4149/0",
"title": "2016 XVIII Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvri/2011/0054/0/05759646",
"title": "Image-based stereo background modeling for CAVE system",
"doi": null,
"abstractUrl": "/proceedings-article/isvri/2011/05759646/12OmNxG1yLl",
"parentPublication": {
"id": "proceedings/isvri/2011/0054/0",
"title": "2011 IEEE International Symposium on VR Innovation (ISVRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539620",
"title": "Immersive Collaborative Analysis of Network Connectivity: CAVE-style or Head-Mounted Display?",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539620/13rRUwcS1D0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/04/07384536",
"title": "Examining Rotation Gain in CAVE-like Virtual Environments",
"doi": null,
"abstractUrl": "/journal/tg/2016/04/07384536/13rRUxOdD2H",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030381",
"title": "Autocalibration of Multiprojector CAVE-Like Immersive Environments",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030381/13rRUy0qnLF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2020/01/08821384",
"title": "A Compelling Virtual Tour of the Dunhuang Cave With an Immersive Head-Mounted Display",
"doi": null,
"abstractUrl": "/magazine/cg/2020/01/08821384/1eTOS0wFeY8",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/06/09222121",
"title": "<italic>SAniHead:</italic> Sketching Animal-Like 3D Character Heads Using a View-Surface Collaborative Mesh Generative Network",
"doi": null,
"abstractUrl": "/journal/tg/2022/06/09222121/1nTqKKPoy5i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cds/2020/7106/0/710600a377",
"title": "A virtual environment making method for CAVE system",
"doi": null,
"abstractUrl": "/proceedings-article/cds/2020/710600a377/1pqa4RCdUAg",
"parentPublication": {
"id": "proceedings/cds/2020/7106/0",
"title": "2020 International Conference on Computing and Data Science (CDS)",
"__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": "09845414",
"articleId": "1Fu4IsDCz72",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09850404",
"articleId": "1Fz4SEQnoiY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1FvJy8Nb6xO",
"name": "ttg555501-09847102s1-supp1-3193672.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09847102s1-supp1-3193672.mp4",
"extension": "mp4",
"size": "98.9 MB",
"__typename": "WebExtraType"
}
],
"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": "1IxvQWCOYBa",
"doi": "10.1109/TKDE.2022.3224193",
"abstract": "In recent years, graph neural networks (GNNs)-based methods have been widely adopted for heterogeneous graph (HG) embedding, due to their power in effectively encoding rich information from a HG into the low-dimensional node embeddings. However, previous works usually easily fail to fully leverage the inherent heterogeneity and rich semantics contained in the complex local structures of HGs. On the one hand, most of the existing methods either inadequately model the local structure under specific semantics, or neglect the heterogeneity when aggregating information from the local structure. On the other hand, representations from multiple semantics are not comprehensively integrated to obtain node embeddings with versatility. To address the problem, we propose a <italic>Heterogeneous Graph Neural Network</italic> for HG embedding <italic>within a Multi-View representation learning framework</italic> (named MV-HetGNN), which consists of a view-specific ego graph encoder and auto multi-view fusion layer. MV-HetGNN thoroughly learns complex heterogeneity and semantics in the local structure to generate comprehensive and versatile node representations for HGs. Extensive experiments on three real-world HG datasets demonstrate the significant superiority of our proposed MV-HetGNN compared to the state-of-the-art baselines in various downstream tasks, <italic>e</italic>.<italic>g</italic>. node classification, node clustering, and link prediction.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In recent years, graph neural networks (GNNs)-based methods have been widely adopted for heterogeneous graph (HG) embedding, due to their power in effectively encoding rich information from a HG into the low-dimensional node embeddings. However, previous works usually easily fail to fully leverage the inherent heterogeneity and rich semantics contained in the complex local structures of HGs. On the one hand, most of the existing methods either inadequately model the local structure under specific semantics, or neglect the heterogeneity when aggregating information from the local structure. On the other hand, representations from multiple semantics are not comprehensively integrated to obtain node embeddings with versatility. To address the problem, we propose a <italic>Heterogeneous Graph Neural Network</italic> for HG embedding <italic>within a Multi-View representation learning framework</italic> (named MV-HetGNN), which consists of a view-specific ego graph encoder and auto multi-view fusion layer. MV-HetGNN thoroughly learns complex heterogeneity and semantics in the local structure to generate comprehensive and versatile node representations for HGs. Extensive experiments on three real-world HG datasets demonstrate the significant superiority of our proposed MV-HetGNN compared to the state-of-the-art baselines in various downstream tasks, <italic>e</italic>.<italic>g</italic>. node classification, node clustering, and link prediction.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In recent years, graph neural networks (GNNs)-based methods have been widely adopted for heterogeneous graph (HG) embedding, due to their power in effectively encoding rich information from a HG into the low-dimensional node embeddings. However, previous works usually easily fail to fully leverage the inherent heterogeneity and rich semantics contained in the complex local structures of HGs. On the one hand, most of the existing methods either inadequately model the local structure under specific semantics, or neglect the heterogeneity when aggregating information from the local structure. On the other hand, representations from multiple semantics are not comprehensively integrated to obtain node embeddings with versatility. To address the problem, we propose a Heterogeneous Graph Neural Network for HG embedding within a Multi-View representation learning framework (named MV-HetGNN), which consists of a view-specific ego graph encoder and auto multi-view fusion layer. MV-HetGNN thoroughly learns complex heterogeneity and semantics in the local structure to generate comprehensive and versatile node representations for HGs. Extensive experiments on three real-world HG datasets demonstrate the significant superiority of our proposed MV-HetGNN compared to the state-of-the-art baselines in various downstream tasks, e.g. node classification, node clustering, and link prediction.",
"title": "Heterogeneous Graph Neural Network With Multi-View Representation Learning",
"normalizedTitle": "Heterogeneous Graph Neural Network With Multi-View Representation Learning",
"fno": "09961953",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Semantics",
"Mercury Metals",
"Graph Neural Networks",
"Aggregates",
"Task Analysis",
"Representation Learning",
"Adaptation Models",
"Graph Embedding",
"Graph Neural Networks",
"Heterogeneous Graphs"
],
"authors": [
{
"givenName": "Zezhi",
"surname": "Shao",
"fullName": "Zezhi Shao",
"affiliation": "Institute of Computing Technology, CAS, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yongjun",
"surname": "Xu",
"fullName": "Yongjun Xu",
"affiliation": "Institute of Computing Technology, CAS, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Wei",
"fullName": "Wei Wei",
"affiliation": "School of Computer Science and Technology, Huazhong University of Science and Technology, Hubei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fei",
"surname": "Wang",
"fullName": "Fei Wang",
"affiliation": "Institute of Computing Technology, CAS, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhao",
"surname": "Zhang",
"fullName": "Zhao Zhang",
"affiliation": "Institute of Computing Technology, CAS, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Feida",
"surname": "Zhu",
"fullName": "Feida Zhu",
"affiliation": "School of Information Systems, Singapore Management University, Singapore",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-11-01 00:00:00",
"pubType": "trans",
"pages": "1-13",
"year": "5555",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/1988/0842/2/00011861",
"title": "The PEG environment: parallel programming with Petri net semantics",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1988/00011861/12OmNzaQozB",
"parentPublication": {
"id": "proceedings/hicss/1988/0842/2",
"title": "Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/06/09737399",
"title": "Heterogeneous Graph Representation Learning With Relation Awareness",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09737399/1BQi9s33pfy",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2023/02/09780569",
"title": "A Survey on Heterogeneous Graph Embedding: Methods, Techniques, Applications and Sources",
"doi": null,
"abstractUrl": "/journal/bd/2023/02/09780569/1DDy8pMi82k",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09844866",
"title": "Multi-grained Semantics-aware Graph Neural Networks",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09844866/1Fp5PukyTqE",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2022/9062/0/09956484",
"title": "Multi-View Graph Autoencoder for Unsupervised Graph Representation Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09956484/1IHp94LMn3W",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020299",
"title": "Temporal Graph Representation Learning via Maximal Cliques",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020299/1KfRMAqO2wE",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/5555/01/10058556",
"title": "API Usage Recommendation via Multi-View Heterogeneous Graph Representation Learning",
"doi": null,
"abstractUrl": "/journal/ts/5555/01/10058556/1LdkkBWtmY8",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cic/2020/4146/0/414600a088",
"title": "Discovering Localized Information for Heterogeneous Graph Node Representation Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cic/2020/414600a088/1qyxLO0I6hG",
"parentPublication": {
"id": "proceedings/cic/2020/4146/0",
"title": "2020 IEEE 6th International Conference on Collaboration and Internet Computing (CIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/01/09428609",
"title": "Heterogeneous Graph Propagation Network",
"doi": null,
"abstractUrl": "/journal/tk/2023/01/09428609/1twaBkzBB2E",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09546546",
"title": "Bundle Recommendation and Generation With Graph Neural Networks",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09546546/1x6zzmXG7Fm",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09961954",
"articleId": "1IxvQL6EdkQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09960856",
"articleId": "1IxvR7dELAs",
"__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": "1nTqTQAK47K",
"doi": "10.1109/TVCG.2020.3030338",
"abstract": "Multiple-view visualization (MV) is a layout design technique often employed to help users see a large number of data attributes and values in a single cohesive representation. Because of its generalizability, the MV design has been widely adopted by the visualization community to help users examine and interact with large, complex, and high-dimensional data. However, although ubiquitous, there has been little work to categorize and analyze MVs in order to better understand its design space. As a result, there has been little to no guideline in how to use the MV design effectively. In this paper, we present an in-depth study of how MVs are designed in practice. We focus on two fundamental measures of multiple-view patterns: composition, which quantifies what view types and how many are there; and configuration, which characterizes spatial arrangement of view layouts in the display space. We build a new dataset containing 360 images of MVs collected from IEEE VIS, EuroVis, and PacificVis publications 2011 to 2019, and make fine-grained annotations of view types and layouts for these visualization images. From this data we conduct composition and configuration analyses using quantitative metrics of term frequency and layout topology. We identify common practices around MVs, including relationship of view types, popular view layouts, and correlation between view types and layouts. We combine the findings into a MV recommendation system, providing interactive tools to explore the design space, and support example-based design.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multiple-view visualization (MV) is a layout design technique often employed to help users see a large number of data attributes and values in a single cohesive representation. Because of its generalizability, the MV design has been widely adopted by the visualization community to help users examine and interact with large, complex, and high-dimensional data. However, although ubiquitous, there has been little work to categorize and analyze MVs in order to better understand its design space. As a result, there has been little to no guideline in how to use the MV design effectively. In this paper, we present an in-depth study of how MVs are designed in practice. We focus on two fundamental measures of multiple-view patterns: composition, which quantifies what view types and how many are there; and configuration, which characterizes spatial arrangement of view layouts in the display space. We build a new dataset containing 360 images of MVs collected from IEEE VIS, EuroVis, and PacificVis publications 2011 to 2019, and make fine-grained annotations of view types and layouts for these visualization images. From this data we conduct composition and configuration analyses using quantitative metrics of term frequency and layout topology. We identify common practices around MVs, including relationship of view types, popular view layouts, and correlation between view types and layouts. We combine the findings into a MV recommendation system, providing interactive tools to explore the design space, and support example-based design.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multiple-view visualization (MV) is a layout design technique often employed to help users see a large number of data attributes and values in a single cohesive representation. Because of its generalizability, the MV design has been widely adopted by the visualization community to help users examine and interact with large, complex, and high-dimensional data. However, although ubiquitous, there has been little work to categorize and analyze MVs in order to better understand its design space. As a result, there has been little to no guideline in how to use the MV design effectively. In this paper, we present an in-depth study of how MVs are designed in practice. We focus on two fundamental measures of multiple-view patterns: composition, which quantifies what view types and how many are there; and configuration, which characterizes spatial arrangement of view layouts in the display space. We build a new dataset containing 360 images of MVs collected from IEEE VIS, EuroVis, and PacificVis publications 2011 to 2019, and make fine-grained annotations of view types and layouts for these visualization images. From this data we conduct composition and configuration analyses using quantitative metrics of term frequency and layout topology. We identify common practices around MVs, including relationship of view types, popular view layouts, and correlation between view types and layouts. We combine the findings into a MV recommendation system, providing interactive tools to explore the design space, and support example-based design.",
"title": "Composition and Configuration Patterns in Multiple-View Visualizations",
"normalizedTitle": "Composition and Configuration Patterns in Multiple-View Visualizations",
"fno": "09222323",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Configuration Patterns",
"Multiple View Visualization",
"Layout Design",
"Data Attributes",
"Single Cohesive Representation",
"MV Design",
"Visualization Community",
"High Dimensional Data",
"Design Space",
"Multiple View Patterns",
"View Types",
"Visualization Images",
"Layout Topology",
"MV Recommendation System",
"Example Based Design",
"View Layouts",
"IEEE VIS",
"Euro Vis",
"Pacific Vis Publications",
"Term Frequency",
"Interactive Tools",
"Quantitative Metrics",
"Data Visualization",
"Layout",
"Visualization",
"Tools",
"Task Analysis",
"Guidelines",
"Multiple Views",
"Design Pattern",
"Quantitative Analysis",
"Example Based Design"
],
"authors": [
{
"givenName": "Xi",
"surname": "Chen",
"fullName": "Xi Chen",
"affiliation": "Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Zeng",
"fullName": "Wei Zeng",
"affiliation": "Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yanna",
"surname": "Lin",
"fullName": "Yanna Lin",
"affiliation": "Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hayder Mahdi",
"surname": "AI-maneea",
"fullName": "Hayder Mahdi AI-maneea",
"affiliation": "Bangor University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jonathan",
"surname": "Roberts",
"fullName": "Jonathan Roberts",
"affiliation": "Bangor University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Remco",
"surname": "Chang",
"fullName": "Remco Chang",
"affiliation": "Tufts University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "1514-1524",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tk/2023/06/09744426",
"title": "<inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathtt {AutoView}$_Z</tex-math></inline-formula>: An Autonomous Materialized View Management System With Encoder-Reducer",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09744426/1C8Bxg3wis0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600m2591",
"title": "Uncertainty-Aware Deep Multi-View Photometric Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600m2591/1H1lGLw9BaE",
"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/2023/01/09904883",
"title": "Effects of View Layout on Situated Analytics for Multiple-View Representations in Immersive Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904883/1H2lc7qemsg",
"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/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": "proceedings/vis/2019/4941/0/08933655",
"title": "Towards Quantifying Multiple View Layouts in Visualisation as Seen from Research Publications",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933655/1fTgHP2omAM",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222335",
"title": "PlotThread: Creating Expressive Storyline Visualizations using Reinforcement Learning",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222335/1nTqzC75UfS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09223736",
"title": "Comparative Layouts Revisited: Design Space, Guidelines, and Future Directions",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09223736/1nV7HJ2WAak",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2021/9184/0/918400c159",
"title": "An Autonomous Materialized View Management System with Deep Reinforcement Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2021/918400c159/1uGXym4TfB6",
"parentPublication": {
"id": "proceedings/icde/2021/9184/0",
"title": "2021 IEEE 37th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555226",
"title": "SightBi: Exploring Cross-View Data Relationships with Biclusters",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555226/1xjQVmm2wE0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09246308",
"articleId": "1olDVqD8b0A",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09223736",
"articleId": "1nV7HJ2WAak",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1KmyNRPfdXG",
"title": "March",
"year": "2023",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zc6DjegSGY",
"doi": "10.1109/TVCG.2021.3133511",
"abstract": "Augmented Reality (AR) embeds digital information into objects of the physical world. Data can be shown <italic>in-situ</italic>, thereby enabling real-time visual comparisons and object search in real-life user tasks, such as comparing products and looking up scores in a sports game. While there have been studies on designing AR interfaces for situated information retrieval, there has only been limited research on AR object labeling for visual search tasks in the spatial environment. In this article, we identify and categorize different design aspects in AR label design and report on a formal user study on labels for out-of-view objects to support visual search tasks in AR. We design three visualization techniques for out-of-view object labeling in AR, which respectively encode the relative physical position (height-encoded), the rotational direction (angle-encoded), and the label values (value-encoded) of the objects. We further implement two traditional in-view object labeling techniques, where labels are placed either next to the respective objects (situated) or at the edge of the AR FoV (boundary). We evaluate these five different label conditions in three visual search tasks for static objects. Our study shows that out-of-view object labels are beneficial when searching for objects outside the FoV, spatial orientation, and when comparing multiple spatially sparse objects. Angle-encoded labels with directional cues of the surrounding objects have the overall best performance with the highest user satisfaction. We discuss the implications of our findings for future immersive AR interface design.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Augmented Reality (AR) embeds digital information into objects of the physical world. Data can be shown <italic>in-situ</italic>, thereby enabling real-time visual comparisons and object search in real-life user tasks, such as comparing products and looking up scores in a sports game. While there have been studies on designing AR interfaces for situated information retrieval, there has only been limited research on AR object labeling for visual search tasks in the spatial environment. In this article, we identify and categorize different design aspects in AR label design and report on a formal user study on labels for out-of-view objects to support visual search tasks in AR. We design three visualization techniques for out-of-view object labeling in AR, which respectively encode the relative physical position (height-encoded), the rotational direction (angle-encoded), and the label values (value-encoded) of the objects. We further implement two traditional in-view object labeling techniques, where labels are placed either next to the respective objects (situated) or at the edge of the AR FoV (boundary). We evaluate these five different label conditions in three visual search tasks for static objects. Our study shows that out-of-view object labels are beneficial when searching for objects outside the FoV, spatial orientation, and when comparing multiple spatially sparse objects. Angle-encoded labels with directional cues of the surrounding objects have the overall best performance with the highest user satisfaction. We discuss the implications of our findings for future immersive AR interface design.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Augmented Reality (AR) embeds digital information into objects of the physical world. Data can be shown in-situ, thereby enabling real-time visual comparisons and object search in real-life user tasks, such as comparing products and looking up scores in a sports game. While there have been studies on designing AR interfaces for situated information retrieval, there has only been limited research on AR object labeling for visual search tasks in the spatial environment. In this article, we identify and categorize different design aspects in AR label design and report on a formal user study on labels for out-of-view objects to support visual search tasks in AR. We design three visualization techniques for out-of-view object labeling in AR, which respectively encode the relative physical position (height-encoded), the rotational direction (angle-encoded), and the label values (value-encoded) of the objects. We further implement two traditional in-view object labeling techniques, where labels are placed either next to the respective objects (situated) or at the edge of the AR FoV (boundary). We evaluate these five different label conditions in three visual search tasks for static objects. Our study shows that out-of-view object labels are beneficial when searching for objects outside the FoV, spatial orientation, and when comparing multiple spatially sparse objects. Angle-encoded labels with directional cues of the surrounding objects have the overall best performance with the highest user satisfaction. We discuss the implications of our findings for future immersive AR interface design.",
"title": "Labeling Out-of-View Objects in Immersive Analytics to Support Situated Visual Searching",
"normalizedTitle": "Labeling Out-of-View Objects in Immersive Analytics to Support Situated Visual Searching",
"fno": "09645242",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Augmented Reality",
"Data Analysis",
"Data Visualisation",
"Encoding",
"Information Retrieval",
"Natural Language Processing",
"Sport",
"User Interfaces",
"Angle Encoded Labels",
"AR Fo V",
"AR Interface Design",
"AR Object Labeling",
"Augmented Reality",
"Digital Information",
"Immersive Analytics",
"Multiple Spatially Sparse Objects",
"Out Of View Object Labeling Techniques",
"Situated Information Retrieval",
"Sports Game",
"Static Objects",
"Surrounding Objects",
"Visual Search Tasks",
"Visualization Techniques",
"Visualization",
"Labeling",
"Task Analysis",
"Search Problems",
"Data Visualization",
"Three Dimensional Displays",
"Clutter",
"Object Labeling",
"Mixed Augmented Reality",
"Immersive Analytics",
"Situated Analytics",
"Data Visualization"
],
"authors": [
{
"givenName": "Tica",
"surname": "Lin",
"fullName": "Tica Lin",
"affiliation": "John A. Paulson School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yalong",
"surname": "Yang",
"fullName": "Yalong Yang",
"affiliation": "Department of Computer Science, Virginia Tech, Blacksburg, VA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Johanna",
"surname": "Beyer",
"fullName": "Johanna Beyer",
"affiliation": "John A. Paulson School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanspeter",
"surname": "Pfister",
"fullName": "Hanspeter Pfister",
"affiliation": "John A. Paulson School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2023-03-01 00:00:00",
"pubType": "trans",
"pages": "1831-1844",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2014/2874/0/2874a243",
"title": "Boundary Labeling Methods for Dynamic Focus Regions",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a243/12OmNBOllhJ",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457f910",
"title": "Unsupervised Semantic Scene Labeling for Streaming Data",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457f910/12OmNsdo6q1",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118b178",
"title": "Scene Labeling Using Beam Search under Mutex Constraints",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118b178/12OmNyQphbb",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761504",
"title": "Object labeling for recognition using vocabulary trees",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761504/12OmNzRHOOe",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/11/09874390",
"title": "Investigating Search Among Physical and Virtual Objects Under Different Lighting Conditions",
"doi": null,
"abstractUrl": "/journal/tg/2022/11/09874390/1GjwKHZsfIc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacvw/2023/2056/0/205600a155",
"title": "Discriminative Sampling of Proposals in Self-Supervised Transformers for Weakly Supervised Object Localization",
"doi": null,
"abstractUrl": "/proceedings-article/wacvw/2023/205600a155/1KzyZTHx2sE",
"parentPublication": {
"id": "proceedings/wacvw/2023/2056/0",
"title": "2023 IEEE/CVF Winter Conference on Applications of Computer Vision Workshops (WACVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08797804",
"title": "Semantic Labeling and Object Registration for Augmented Reality Language Learning",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797804/1cJ0NXcPJGo",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798358",
"title": "In-Situ Labeling for Augmented Reality Language Learning",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798358/1cJ0VFN6eIw",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/04/09207965",
"title": "Mixed Labeling: Integrating Internal and External Labels",
"doi": null,
"abstractUrl": "/journal/tg/2022/04/09207965/1nuwBNaxzjy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cds/2021/0428/0/042800a296",
"title": "Active Object Searching on Mobile Robot Using Reinforcement Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cds/2021/042800a296/1uZxzf21kC4",
"parentPublication": {
"id": "proceedings/cds/2021/0428/0",
"title": "2021 2nd International Conference on Computing and Data Science (CDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09640557",
"articleId": "1z98whOAZ4Q",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09645189",
"articleId": "1zc6CdFskcU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxFJXw2",
"title": "Oct.-Dec.",
"year": "2014",
"issueNum": "04",
"idPrefix": "th",
"pubType": "journal",
"volume": "7",
"label": "Oct.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyfKIDw",
"doi": "10.1109/TOH.2014.2332173",
"abstract": "In this paper we present a new visuo-haptic interaction mechanism for human-robot formation control. The formation setup consists of a human leader and multiple follower robots. The mobile robots are equipped only with RGB-D cameras, and they should maintain a desired distance and orientation to the leader at all times. Mechanical limitations common to all the robots limit the possible trajectories that the human can take. In this regard, vibrotactile feedback provided by a haptic bracelet guides the human along trajectories that are feasible for the team by warning her/him when the formation constraints are being violated. Psychophysical tests on the bracelet together with real-world experiments conducted with a team of Pioneer robots show the effectiveness of the proposed visuo-haptic paradigm for the coordination of mixed human-robot teams.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper we present a new visuo-haptic interaction mechanism for human-robot formation control. The formation setup consists of a human leader and multiple follower robots. The mobile robots are equipped only with RGB-D cameras, and they should maintain a desired distance and orientation to the leader at all times. Mechanical limitations common to all the robots limit the possible trajectories that the human can take. In this regard, vibrotactile feedback provided by a haptic bracelet guides the human along trajectories that are feasible for the team by warning her/him when the formation constraints are being violated. Psychophysical tests on the bracelet together with real-world experiments conducted with a team of Pioneer robots show the effectiveness of the proposed visuo-haptic paradigm for the coordination of mixed human-robot teams.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper we present a new visuo-haptic interaction mechanism for human-robot formation control. The formation setup consists of a human leader and multiple follower robots. The mobile robots are equipped only with RGB-D cameras, and they should maintain a desired distance and orientation to the leader at all times. Mechanical limitations common to all the robots limit the possible trajectories that the human can take. In this regard, vibrotactile feedback provided by a haptic bracelet guides the human along trajectories that are feasible for the team by warning her/him when the formation constraints are being violated. Psychophysical tests on the bracelet together with real-world experiments conducted with a team of Pioneer robots show the effectiveness of the proposed visuo-haptic paradigm for the coordination of mixed human-robot teams.",
"title": "Human-Robot Formation Control via Visual and Vibrotactile Haptic Feedback",
"normalizedTitle": "Human-Robot Formation Control via Visual and Vibrotactile Haptic Feedback",
"fno": "06841044",
"hasPdf": true,
"idPrefix": "th",
"keywords": [
"Robot Kinematics",
"Haptic Interfaces",
"Cameras",
"Mobile Robots",
"Robot Vision Systems",
"Trajectory",
"Autonomous Vehicles",
"Haptic I O",
"Design For Wearability",
"Human Robot Team",
"Vibrotactile Feedback"
],
"authors": [
{
"givenName": "Stefano",
"surname": "Scheggi",
"fullName": "Stefano Scheggi",
"affiliation": "Department of Information Engineering and Mathematics, University of Siena, Siena, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fabio",
"surname": "Morbidi",
"fullName": "Fabio Morbidi",
"affiliation": "NeCS team, INRIA Grenoble Rhône-Alpes, Montbonnot Saint-Martin, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Domenico",
"surname": "Prattichizzo",
"fullName": "Domenico Prattichizzo",
"affiliation": "Department of Information Engineering and Mathematics, University of Siena, Siena, Italy",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2014-10-01 00:00:00",
"pubType": "trans",
"pages": "499-511",
"year": "2014",
"issn": "1939-1412",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icmeae/2015/8328/0/07386206",
"title": "CyberForce Haptic Device: Kinematics and Manipulability",
"doi": null,
"abstractUrl": "/proceedings-article/icmeae/2015/07386206/12OmNwDACt4",
"parentPublication": {
"id": "proceedings/icmeae/2015/8328/0",
"title": "2015 International Conference on Mechatronics, Electronics and Automotive Engineering (ICMEAE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2008/1971/0/04480792",
"title": "3D Virtual Haptic Cone for Intuitive Vehicle Motion Control",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2008/04480792/12OmNzUPpCo",
"parentPublication": {
"id": "proceedings/vr/2008/1971/0",
"title": "IEEE Virtual Reality 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2010/6821/0/05444649",
"title": "A preliminary experimental study on haptic teleoperation of mobile robot with variable force feedback gain",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2010/05444649/12OmNzb7ZsH",
"parentPublication": {
"id": "proceedings/haptics/2010/6821/0",
"title": "2010 IEEE Haptics Symposium (Formerly known as Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2012/03/tth2012030193",
"title": "Haptic Human-Robot Interaction",
"doi": null,
"abstractUrl": "/journal/th/2012/03/tth2012030193/13rRUIJuxpI",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2013/01/tth2013010094",
"title": "The Role of Haptic Feedback for the Integration of Intentions in Shared Task Execution",
"doi": null,
"abstractUrl": "/journal/th/2013/01/tth2013010094/13rRUwjGoGc",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2014/02/06577375",
"title": "Design of a Robotic Mobility System with a Modular Haptic Feedback Approach to Promote Socialization in Children",
"doi": null,
"abstractUrl": "/journal/th/2014/02/06577375/13rRUxASubH",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903598",
"title": "RoboHapalytics: A Robot Assisted Haptic Controller for Immersive Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903598/1GZojHNSlRm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798195",
"title": "fARFEEL: Providing Haptic Sensation of Touched Objects Using Visuo-Haptic Feedback",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798195/1cJ18nc5sys",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2019/4765/0/476500a042",
"title": "Smart Haproxy: A Novel Vibrotactile Feedback Prototype Combining Passive and Active Haptic in AR Interaction",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2019/476500a042/1gysov56h20",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2019/4765/0",
"title": "2019 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/12/09117062",
"title": "Augmenting Perceived Softness of Haptic Proxy Objects Through Transient Vibration and Visuo-Haptic Illusion in Virtual Reality",
"doi": null,
"abstractUrl": "/journal/tg/2021/12/09117062/1kGg69DDrFe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06891304",
"articleId": "13rRUygT7yk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06819854",
"articleId": "13rRUxBa5nu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyeWdDk",
"title": "May-June",
"year": "2019",
"issueNum": "03",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "39",
"label": "May-June",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45VObpOa",
"doi": "10.1109/MCG.2019.2898856",
"abstract": "The VirtualDesk metaphor is an opportunity for more comfortable and efficient immersive data exploration, using tangible interaction with the analyst's physical work desk and embodied manipulation of mid-air data representations. In this paper, we present an extended discussion of its underlying concepts, and review and compare two previous case studies where promising results were obtained in terms of user comfort, engagement, and usability. We also discuss findings of a novel study conducted with geovisualization experts, pointing directions for improvement and future research.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The VirtualDesk metaphor is an opportunity for more comfortable and efficient immersive data exploration, using tangible interaction with the analyst's physical work desk and embodied manipulation of mid-air data representations. In this paper, we present an extended discussion of its underlying concepts, and review and compare two previous case studies where promising results were obtained in terms of user comfort, engagement, and usability. We also discuss findings of a novel study conducted with geovisualization experts, pointing directions for improvement and future research.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The VirtualDesk metaphor is an opportunity for more comfortable and efficient immersive data exploration, using tangible interaction with the analyst's physical work desk and embodied manipulation of mid-air data representations. In this paper, we present an extended discussion of its underlying concepts, and review and compare two previous case studies where promising results were obtained in terms of user comfort, engagement, and usability. We also discuss findings of a novel study conducted with geovisualization experts, pointing directions for improvement and future research.",
"title": "Comfortable Immersive Analytics With the VirtualDesk Metaphor",
"normalizedTitle": "Comfortable Immersive Analytics With the VirtualDesk Metaphor",
"fno": "08640072",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Visualisation",
"User Interfaces",
"Comfortable Immersive Analytics",
"User Comfort",
"Underlying Concepts",
"Extended Discussion",
"Mid Air Data Representations",
"Tangible Interaction",
"Efficient Immersive Data Exploration",
"Comfortable Data Exploration",
"Virtual Desk Metaphor",
"Three Dimensional Displays",
"Rendering Computer Graphics",
"Task Analysis",
"Thumb",
"Two Dimensional Displays",
"Virtual Environments"
],
"authors": [
{
"givenName": "Jorge A. Wagner",
"surname": "Filho",
"fullName": "Jorge A. Wagner Filho",
"affiliation": "Federal University of Rio Grande do Sul",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Carla M. D. S.",
"surname": "Freitas",
"fullName": "Carla M. D. S. Freitas",
"affiliation": "Federal University of Rio Grande do Sul",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luciana",
"surname": "Nedel",
"fullName": "Luciana Nedel",
"affiliation": "Federal University of Rio Grande do Sul",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2019-05-01 00:00:00",
"pubType": "mags",
"pages": "41-53",
"year": "2019",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ismarw/2016/3740/0/07836451",
"title": "DualCAD: Integrating Augmented Reality with a Desktop GUI and Smartphone Interaction",
"doi": null,
"abstractUrl": "/proceedings-article/ismarw/2016/07836451/12OmNAndit1",
"parentPublication": {
"id": "proceedings/ismarw/2016/3740/0",
"title": "2016 IEEE International Symposium on Mixed and Augmented Reality (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2015/6886/0/07131772",
"title": "Wedge: A musical interface for building and playing composition-appropriate immersive environments",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2015/07131772/12OmNz2TCJ9",
"parentPublication": {
"id": "proceedings/3dui/2015/6886/0",
"title": "2015 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446609",
"title": "Model Retrieval by 3D Sketching in Immersive Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446609/13bd1tl2omk",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2018/9194/0/08533893",
"title": "Building Multiple Coordinated Spaces for Effective Immersive Analytics through Distributed Cognition",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2018/08533893/17D45Wuc3a3",
"parentPublication": {
"id": "proceedings/bdva/2018/9194/0",
"title": "2018 International Symposium on Big Data Visual and Immersive Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903598",
"title": "RoboHapalytics: A Robot Assisted Haptic Controller for Immersive Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903598/1GZojHNSlRm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08797978",
"title": "IATK: An Immersive Analytics Toolkit",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797978/1cJ0GweguUo",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798155",
"title": "Grasping objects in immersive Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798155/1cJ0SxJIrrW",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798205",
"title": "Toward Universal Tangible Objects: Optimizing Haptic Pinching Sensations in 3D Interaction",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798205/1cJ1bY8RJIc",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08854316",
"title": "Evaluating an Immersive Space-Time Cube Geovisualization for Intuitive Trajectory Data Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08854316/1dM2fkHbAVa",
"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"
}
],
"adjacentArticles": {
"previous": {
"fno": "08636208",
"articleId": "17D45VsBTUT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08651386",
"articleId": "17WX57pKuPK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1AlHzMLlSUg",
"title": null,
"year": "2022",
"issueNum": "01",
"idPrefix": "qe",
"pubType": "journal",
"volume": "3",
"label": null,
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1BN1UYVcjao",
"doi": "10.1109/TQE.2022.3160015",
"abstract": "The qubit-mapping problem aims to assign and route qubits of a quantum circuit onto an noisy intermediate-scale quantum (NISQ) device in an optimized fashion, with respect to some cost function. Finding an optimal solution to this problem is known to scale exponentially in computational complexity; as such, it is imperative to investigate scalable qubit-mapping solutions for NISQ computation. In this work, a noise-aware heuristic qubit-assignment algorithm (which assigns initial placements for qubits in a quantum algorithm to qubits on an NISQ device, but does not route qubits during the quantum algorithm’s execution) is presented and compared against the optimal <italic>brute-force</italic> solution, as well as a trivial qubit assignment, with the aim to quantify the performance of our heuristic qubit-assignment algorithm. We find that for small, connected-graph algorithms, our heuristic-assignment algorithm faithfully lies in between the effective upper and lower bounds given by the brute-force and trivial qubit-assignment algorithms. Additionally, we find that the topological-graph properties of quantum algorithms with over six qubits play an important role in our heuristic qubit-assignment algorithm’s performance on NISQ devices. Finally, we investigate the scaling properties of our heuristic algorithm for quantum processors with up to 100 qubits; here, the algorithm was found to be scalable for quantum-algorithms that admit path-like graphs. Our findings show that as the size of the quantum processor in our simulation grows, so do the benefits from utilizing the heuristic qubit-assignment algorithm, under particular constraints for our heuristic algorithm. This work, thus, characterizes the performance of a heuristic qubit-assignment algorithm with respect to the topological-graph and scaling properties of a quantum algorithm that one may wish to run on a given NISQ device.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The qubit-mapping problem aims to assign and route qubits of a quantum circuit onto an noisy intermediate-scale quantum (NISQ) device in an optimized fashion, with respect to some cost function. Finding an optimal solution to this problem is known to scale exponentially in computational complexity; as such, it is imperative to investigate scalable qubit-mapping solutions for NISQ computation. In this work, a noise-aware heuristic qubit-assignment algorithm (which assigns initial placements for qubits in a quantum algorithm to qubits on an NISQ device, but does not route qubits during the quantum algorithm’s execution) is presented and compared against the optimal <italic>brute-force</italic> solution, as well as a trivial qubit assignment, with the aim to quantify the performance of our heuristic qubit-assignment algorithm. We find that for small, connected-graph algorithms, our heuristic-assignment algorithm faithfully lies in between the effective upper and lower bounds given by the brute-force and trivial qubit-assignment algorithms. Additionally, we find that the topological-graph properties of quantum algorithms with over six qubits play an important role in our heuristic qubit-assignment algorithm’s performance on NISQ devices. Finally, we investigate the scaling properties of our heuristic algorithm for quantum processors with up to 100 qubits; here, the algorithm was found to be scalable for quantum-algorithms that admit path-like graphs. Our findings show that as the size of the quantum processor in our simulation grows, so do the benefits from utilizing the heuristic qubit-assignment algorithm, under particular constraints for our heuristic algorithm. This work, thus, characterizes the performance of a heuristic qubit-assignment algorithm with respect to the topological-graph and scaling properties of a quantum algorithm that one may wish to run on a given NISQ device.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The qubit-mapping problem aims to assign and route qubits of a quantum circuit onto an noisy intermediate-scale quantum (NISQ) device in an optimized fashion, with respect to some cost function. Finding an optimal solution to this problem is known to scale exponentially in computational complexity; as such, it is imperative to investigate scalable qubit-mapping solutions for NISQ computation. In this work, a noise-aware heuristic qubit-assignment algorithm (which assigns initial placements for qubits in a quantum algorithm to qubits on an NISQ device, but does not route qubits during the quantum algorithm’s execution) is presented and compared against the optimal brute-force solution, as well as a trivial qubit assignment, with the aim to quantify the performance of our heuristic qubit-assignment algorithm. We find that for small, connected-graph algorithms, our heuristic-assignment algorithm faithfully lies in between the effective upper and lower bounds given by the brute-force and trivial qubit-assignment algorithms. Additionally, we find that the topological-graph properties of quantum algorithms with over six qubits play an important role in our heuristic qubit-assignment algorithm’s performance on NISQ devices. Finally, we investigate the scaling properties of our heuristic algorithm for quantum processors with up to 100 qubits; here, the algorithm was found to be scalable for quantum-algorithms that admit path-like graphs. Our findings show that as the size of the quantum processor in our simulation grows, so do the benefits from utilizing the heuristic qubit-assignment algorithm, under particular constraints for our heuristic algorithm. This work, thus, characterizes the performance of a heuristic qubit-assignment algorithm with respect to the topological-graph and scaling properties of a quantum algorithm that one may wish to run on a given NISQ device.",
"title": "Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm",
"normalizedTitle": "Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm",
"fno": "09736599",
"hasPdf": true,
"idPrefix": "qe",
"keywords": [
"Computational Complexity",
"Graph Theory",
"Optimisation",
"Quantum Computing",
"Scaling Properties",
"Qubit Mapping Problem",
"Route Qubits",
"Intermediate Scale Quantum Device",
"Scalable Qubit Mapping Solutions",
"Noise Aware Heuristic Qubit Assignment Algorithm",
"Quantum Algorithm",
"Trivial Qubit Assignment",
"Heuristic Assignment Algorithm",
"Trivial Qubit Assignment Algorithms",
"Heuristic Algorithm",
"Quantum Algorithms",
"Qubit",
"Logic Gates",
"Heuristic Algorithms",
"Quantum Computing",
"Quantum Algorithm",
"Quantum Mechanics",
"Quantum Circuit",
"Quantum Computing",
"Qubit Mapping Problem"
],
"authors": [
{
"givenName": "Matthew A.",
"surname": "Steinberg",
"fullName": "Matthew A. Steinberg",
"affiliation": "QuTech, Delft University of Technology, Delft, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sebastian",
"surname": "Feld",
"fullName": "Sebastian Feld",
"affiliation": "QuTech, Delft University of Technology, Delft, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Carmen G.",
"surname": "Almudever",
"fullName": "Carmen G. Almudever",
"affiliation": "QuTech, Delft University of Technology, Delft, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Marthaler",
"fullName": "Michael Marthaler",
"affiliation": "HQS Quantum Simulations GmbH, Karlsruhe, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jan-Michael",
"surname": "Reiner",
"fullName": "Jan-Michael Reiner",
"affiliation": "HQS Quantum Simulations GmbH, Karlsruhe, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "1-14",
"year": "2022",
"issn": "2689-1808",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dac/2003/2394/0/23940324",
"title": "An Arbitrary Two-qubit Computation In 23 Elementary Gates Or Less",
"doi": null,
"abstractUrl": "/proceedings-article/dac/2003/23940324/12OmNAQJzRF",
"parentPublication": {
"id": "proceedings/dac/2003/2394/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/qe/2022/01/09749894",
"title": "Simultaneous Execution of Quantum Circuits on Current and Near-Future NISQ Systems",
"doi": null,
"abstractUrl": "/journal/qe/2022/01/09749894/1CkdWRCLmqk",
"parentPublication": {
"id": "trans/qe",
"title": "IEEE Transactions on Quantum Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismvl/2022/2395/0/239500a035",
"title": "Nearest Neighbor Mapping of Quantum Circuits to Two-Dimensional Hexagonal Qubit Architecture",
"doi": null,
"abstractUrl": "/proceedings-article/ismvl/2022/239500a035/1Et60bS58RO",
"parentPublication": {
"id": "proceedings/ismvl/2022/2395/0",
"title": "2022 IEEE 52nd International Symposium on Multiple-Valued Logic (ISMVL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2022/9747/0/974700a607",
"title": "Locality-aware Qubit Routing for the Grid Architecture",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2022/974700a607/1Fu99EMuU9y",
"parentPublication": {
"id": "proceedings/ipdpsw/2022/9747/0",
"title": "2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tase/2019/3342/0/334200a184",
"title": "Optimizing Quantum Programs Against Decoherence: Delaying Qubits into Quantum Superposition",
"doi": null,
"abstractUrl": "/proceedings-article/tase/2019/334200a184/1fpNC0HBIbu",
"parentPublication": {
"id": "proceedings/tase/2019/3342/0",
"title": "2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/micro/2020/7383/0/738300a201",
"title": "Systematic Crosstalk Mitigation for Superconducting Qubits via Frequency-Aware Compilation",
"doi": null,
"abstractUrl": "/proceedings-article/micro/2020/738300a201/1oFGCoNMcfu",
"parentPublication": {
"id": "proceedings/micro/2020/7383/0",
"title": "2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/srds/2020/7626/0/762600a276",
"title": "Robust Cache-Aware Quantum Processor Layout",
"doi": null,
"abstractUrl": "/proceedings-article/srds/2020/762600a276/1oHlyDpdphS",
"parentPublication": {
"id": "proceedings/srds/2020/7626/0",
"title": "2020 International Symposium on Reliable Distributed Systems (SRDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qce/2020/8969/0/896900a345",
"title": "Just-in-time Quantum Circuit Transpilation Reduces Noise",
"doi": null,
"abstractUrl": "/proceedings-article/qce/2020/896900a345/1p2Vp5FeqhW",
"parentPublication": {
"id": "proceedings/qce/2020/8969/0",
"title": "2020 IEEE International Conference on Quantum Computing and Engineering (QCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvlsi/2021/3946/0/394600a431",
"title": "Automated Flag Qubit Insertion for Reliable Quantum Circuit Output",
"doi": null,
"abstractUrl": "/proceedings-article/isvlsi/2021/394600a431/1wiRVrNNKXm",
"parentPublication": {
"id": "proceedings/isvlsi/2021/3946/0",
"title": "2021 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qce/2021/1691/0/169100a465",
"title": "Quantifying Geometric Measure of Entanglement of Multi-qubit Graph States on the IBM’s Quantum Computer",
"doi": null,
"abstractUrl": "/proceedings-article/qce/2021/169100a465/1yEZdh9jRiU",
"parentPublication": {
"id": "proceedings/qce/2021/1691/0",
"title": "2021 IEEE International Conference on Quantum Computing and Engineering (QCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09713701",
"articleId": "1B4gKqy3Q7S",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09735298",
"articleId": "1BLn9OEYOJO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1AlHzMLlSUg",
"title": null,
"year": "2022",
"issueNum": "01",
"idPrefix": "qe",
"pubType": "journal",
"volume": "3",
"label": null,
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1CkdWRCLmqk",
"doi": "10.1109/TQE.2022.3164716",
"abstract": "In the noisy intermediate-scale quantum (NISQ) era, the idea of <italic>quantum multiprogramming</italic>, running multiple quantum circuits (QCs) simultaneously on the same hardware, helps to improve the throughput of quantum computation. However, the crosstalk, unwanted interference between qubits on NISQ processors, may cause performance degradation when using multiprogramming. To address this challenge, we introduce <italic>palloq</italic> (parallel allocation of QCs), a novel compilation protocol. Palloq improves the performance of quantum multiprogramming on NISQ processors, while paying attention to 1) the combination of QCs chosen for parallel execution and 2) the assignment of program qubit variables to physical qubits, to reduce unwanted interference among the active set of QCs. We also propose a software-based crosstalk detection protocol using a new combination of randomized benchmarking methods. Our method successfully characterizes the suitability of hardware for multiprogramming with relatively low detection costs. We found a tradeoff between the success rate and execution time of the multiprogramming. Our results will be of value when device throughput becomes a significant bottleneck. Until service providers have enough quantum processors available to more than meet demand, this approach will be attractive to the service providers and users who want to optimize job management and throughput of the processor.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In the noisy intermediate-scale quantum (NISQ) era, the idea of <italic>quantum multiprogramming</italic>, running multiple quantum circuits (QCs) simultaneously on the same hardware, helps to improve the throughput of quantum computation. However, the crosstalk, unwanted interference between qubits on NISQ processors, may cause performance degradation when using multiprogramming. To address this challenge, we introduce <italic>palloq</italic> (parallel allocation of QCs), a novel compilation protocol. Palloq improves the performance of quantum multiprogramming on NISQ processors, while paying attention to 1) the combination of QCs chosen for parallel execution and 2) the assignment of program qubit variables to physical qubits, to reduce unwanted interference among the active set of QCs. We also propose a software-based crosstalk detection protocol using a new combination of randomized benchmarking methods. Our method successfully characterizes the suitability of hardware for multiprogramming with relatively low detection costs. We found a tradeoff between the success rate and execution time of the multiprogramming. Our results will be of value when device throughput becomes a significant bottleneck. Until service providers have enough quantum processors available to more than meet demand, this approach will be attractive to the service providers and users who want to optimize job management and throughput of the processor.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In the noisy intermediate-scale quantum (NISQ) era, the idea of quantum multiprogramming, running multiple quantum circuits (QCs) simultaneously on the same hardware, helps to improve the throughput of quantum computation. However, the crosstalk, unwanted interference between qubits on NISQ processors, may cause performance degradation when using multiprogramming. To address this challenge, we introduce palloq (parallel allocation of QCs), a novel compilation protocol. Palloq improves the performance of quantum multiprogramming on NISQ processors, while paying attention to 1) the combination of QCs chosen for parallel execution and 2) the assignment of program qubit variables to physical qubits, to reduce unwanted interference among the active set of QCs. We also propose a software-based crosstalk detection protocol using a new combination of randomized benchmarking methods. Our method successfully characterizes the suitability of hardware for multiprogramming with relatively low detection costs. We found a tradeoff between the success rate and execution time of the multiprogramming. Our results will be of value when device throughput becomes a significant bottleneck. Until service providers have enough quantum processors available to more than meet demand, this approach will be attractive to the service providers and users who want to optimize job management and throughput of the processor.",
"title": "Simultaneous Execution of Quantum Circuits on Current and Near-Future NISQ Systems",
"normalizedTitle": "Simultaneous Execution of Quantum Circuits on Current and Near-Future NISQ Systems",
"fno": "09749894",
"hasPdf": true,
"idPrefix": "qe",
"keywords": [
"Crosstalk",
"Multiprogramming",
"Quantum Computing",
"Near Future NISQ Systems",
"Intermediate Scale Quantum Era",
"Quantum Multiprogramming",
"Multiple Quantum Circuits",
"Q Cs",
"Quantum Computation",
"Unwanted Interference",
"NISQ Processors",
"Parallel Allocation",
"Novel Compilation Protocol",
"Parallel Execution",
"Program Qubit Variables",
"Physical Qubits",
"Software Based Crosstalk Detection Protocol",
"Quantum Processors",
"Program Processors",
"Qubit",
"Crosstalk",
"Quantum Computing",
"Quantum Circuit",
"Cloud Computing",
"Throughput",
"Compiler",
"Crosstalk",
"Multiprogramming",
"Noisy Intermediate Scale Quantum NISQ",
"Quantum Computing"
],
"authors": [
{
"givenName": "Yasuhiro",
"surname": "Ohkura",
"fullName": "Yasuhiro Ohkura",
"affiliation": "Keio University Quantum Computing Center, Yokohama, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Takahiko",
"surname": "Satoh",
"fullName": "Takahiko Satoh",
"affiliation": "Keio University Quantum Computing Center, Yokohama, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rodney",
"surname": "Van Meter",
"fullName": "Rodney Van Meter",
"affiliation": "Keio University Quantum Computing Center, Yokohama, Japan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "1-10",
"year": "2022",
"issn": "2689-1808",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/qe/2022/01/09736599",
"title": "Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm",
"doi": null,
"abstractUrl": "/journal/qe/2022/01/09736599/1BN1UYVcjao",
"parentPublication": {
"id": "trans/qe",
"title": "IEEE Transactions on Quantum Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/qe/2022/01/09805433",
"title": "Quantum Volume in Practice: What Users Can Expect From NISQ Devices",
"doi": null,
"abstractUrl": "/journal/qe/2022/01/09805433/1ErlqmiKLhS",
"parentPublication": {
"id": "trans/qe",
"title": "IEEE Transactions on Quantum Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nas/2022/5408/0/09925456",
"title": "NISQ-Friendly Non-Linear Activation Functions for Quantum Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/nas/2022/09925456/1I09McKA4hi",
"parentPublication": {
"id": "proceedings/nas/2022/5408/0",
"title": "2022 IEEE International Conference on Networking, Architecture and Storage (NAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qce/2022/9113/0/911300a605",
"title": "Quantum Telecloning on NISQ Computers",
"doi": null,
"abstractUrl": "/proceedings-article/qce/2022/911300a605/1IvLEIMUNZS",
"parentPublication": {
"id": "proceedings/qce/2022/9113/0",
"title": "2022 IEEE International Conference on Quantum Computing and Engineering (QCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tase/2019/3342/0/334200a184",
"title": "Optimizing Quantum Programs Against Decoherence: Delaying Qubits into Quantum Superposition",
"doi": null,
"abstractUrl": "/proceedings-article/tase/2019/334200a184/1fpNC0HBIbu",
"parentPublication": {
"id": "proceedings/tase/2019/3342/0",
"title": "2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/srds/2020/7626/0/762600a276",
"title": "Robust Cache-Aware Quantum Processor Layout",
"doi": null,
"abstractUrl": "/proceedings-article/srds/2020/762600a276/1oHlyDpdphS",
"parentPublication": {
"id": "proceedings/srds/2020/7626/0",
"title": "2020 International Symposium on Reliable Distributed Systems (SRDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiswc/2020/7645/0/764500a094",
"title": "Reliability Modeling of NISQ- Era Quantum Computers",
"doi": null,
"abstractUrl": "/proceedings-article/iiswc/2020/764500a094/1oSXPUEot2g",
"parentPublication": {
"id": "proceedings/iiswc/2020/7645/0",
"title": "2020 IEEE International Symposium on Workload Characterization (IISWC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2020/9998/0/999800a636",
"title": "Experimental Evaluation of NISQ Quantum Computers: Error Measurement, Characterization, and Implications",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2020/999800a636/1oeOSSULE2s",
"parentPublication": {
"id": "proceedings/sc/2020/9998/0/",
"title": "2020 SC20: International Conference for High Performance Computing, Networking, Storage and Analysis (SC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vts/2021/1949/0/09441047",
"title": "Special Session: Noisy Intermediate-Scale Quantum (NISQ) Computers—How They Work, How They Fail, How to Test Them?",
"doi": null,
"abstractUrl": "/proceedings-article/vts/2021/09441047/1u3rGHwaVEs",
"parentPublication": {
"id": "proceedings/vts/2021/1949/0",
"title": "2021 IEEE 39th VLSI Test Symposium (VTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvlsi/2021/3946/0/394600a428",
"title": "Analyzing crosstalk error in the NISQ era",
"doi": null,
"abstractUrl": "/proceedings-article/isvlsi/2021/394600a428/1wiRWIRn53q",
"parentPublication": {
"id": "proceedings/isvlsi/2021/3946/0",
"title": "2021 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09740569",
"articleId": "1BYEsx700YE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09779984",
"articleId": "1DBTHH8nyMM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1AlHzMLlSUg",
"title": null,
"year": "2022",
"issueNum": "01",
"idPrefix": "qe",
"pubType": "journal",
"volume": "3",
"label": null,
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1EfIY2jpZkc",
"doi": "10.1109/TQE.2022.3183385",
"abstract": "The discrete logarithm problem (DLP) is the basis for several cryptographic primitives. Since Shor’s work, it has been known that the DLP can be solved by combining a polynomial-size quantum circuit and a polynomial-time classical postprocessing algorithm. The theoretical result corresponds the situation where a quantum device working with a medium number of qubits of very small errors can solve the DLP. However, all the quantum devices that we can use have a limited number of noisy qubits, as of the noisy intermediate-scale quantum (NISQ) era. Thus, evaluating the instance size that the latest quantum device can solve and giving a future prediction of the size along the progress of quantum devices are emerging research topics. This article contains two proposals to discuss the performance of quantum devices against the DLP in the NISQ era: 1) a quantitative measure based on the success probability of the postprocessing algorithm to determine whether an experiment on a quantum device (or a classical simulator) succeeded; and 2) a procedure to modify bit strings observed from a Shor’s circuit to increase the success probability of a lattice-based postprocessing algorithm. In this article, we conducted our experiments with the <monospace>ibm_kawasaki</monospace> device and discovered that the simplest circuit (7 qubits) from a 2-bit DLP instance achieves a sufficiently high success probability to proclaim the experiment successful. Experiments on another circuit from a slightly harder 2-bit DLP instance, on the other hand, did not succeed, and we determined that reducing the noise level by half is required to achieve a successful experiment. Finally, we give a near-term prediction based on required noise levels to solve some selected small DLPs and integer factoring instances.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The discrete logarithm problem (DLP) is the basis for several cryptographic primitives. Since Shor’s work, it has been known that the DLP can be solved by combining a polynomial-size quantum circuit and a polynomial-time classical postprocessing algorithm. The theoretical result corresponds the situation where a quantum device working with a medium number of qubits of very small errors can solve the DLP. However, all the quantum devices that we can use have a limited number of noisy qubits, as of the noisy intermediate-scale quantum (NISQ) era. Thus, evaluating the instance size that the latest quantum device can solve and giving a future prediction of the size along the progress of quantum devices are emerging research topics. This article contains two proposals to discuss the performance of quantum devices against the DLP in the NISQ era: 1) a quantitative measure based on the success probability of the postprocessing algorithm to determine whether an experiment on a quantum device (or a classical simulator) succeeded; and 2) a procedure to modify bit strings observed from a Shor’s circuit to increase the success probability of a lattice-based postprocessing algorithm. In this article, we conducted our experiments with the <monospace>ibm_kawasaki</monospace> device and discovered that the simplest circuit (7 qubits) from a 2-bit DLP instance achieves a sufficiently high success probability to proclaim the experiment successful. Experiments on another circuit from a slightly harder 2-bit DLP instance, on the other hand, did not succeed, and we determined that reducing the noise level by half is required to achieve a successful experiment. Finally, we give a near-term prediction based on required noise levels to solve some selected small DLPs and integer factoring instances.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The discrete logarithm problem (DLP) is the basis for several cryptographic primitives. Since Shor’s work, it has been known that the DLP can be solved by combining a polynomial-size quantum circuit and a polynomial-time classical postprocessing algorithm. The theoretical result corresponds the situation where a quantum device working with a medium number of qubits of very small errors can solve the DLP. However, all the quantum devices that we can use have a limited number of noisy qubits, as of the noisy intermediate-scale quantum (NISQ) era. Thus, evaluating the instance size that the latest quantum device can solve and giving a future prediction of the size along the progress of quantum devices are emerging research topics. This article contains two proposals to discuss the performance of quantum devices against the DLP in the NISQ era: 1) a quantitative measure based on the success probability of the postprocessing algorithm to determine whether an experiment on a quantum device (or a classical simulator) succeeded; and 2) a procedure to modify bit strings observed from a Shor’s circuit to increase the success probability of a lattice-based postprocessing algorithm. In this article, we conducted our experiments with the ibm_kawasaki device and discovered that the simplest circuit (7 qubits) from a 2-bit DLP instance achieves a sufficiently high success probability to proclaim the experiment successful. Experiments on another circuit from a slightly harder 2-bit DLP instance, on the other hand, did not succeed, and we determined that reducing the noise level by half is required to achieve a successful experiment. Finally, we give a near-term prediction based on required noise levels to solve some selected small DLPs and integer factoring instances.",
"title": "The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers",
"normalizedTitle": "The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers",
"fno": "09797855",
"hasPdf": true,
"idPrefix": "qe",
"keywords": [
"Computational Complexity",
"Polynomials",
"Probability",
"Quantum Computing",
"Lattice Based Postprocessing Algorithm",
"DLP Instance",
"Latest Quantum Device",
"Noisy Intermediate Scale Quantum Era",
"Polynomial Time Classical Postprocessing Algorithm",
"Polynomial Size Quantum Circuit",
"Noisy Quantum Computers",
"Discrete Logarithm Problem",
"Quantum Computing",
"Qubit",
"Quantum Circuit",
"Computers",
"Cryptography",
"Noise Level",
"Logic Gates",
"Discrete Logarithm Problem DLP",
"IBM Quantum",
"Lattice",
"Postprocessing Method",
"Shors Algorithm"
],
"authors": [
{
"givenName": "YOSHINORI",
"surname": "AONO",
"fullName": "YOSHINORI AONO",
"affiliation": "National Institute of Information and Communications Technology, Tokyo, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "SITONG",
"surname": "LIU",
"fullName": "SITONG LIU",
"affiliation": "Graduate School of Media and Governance, Keio University, Fujisawa, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "TOMOKI",
"surname": "TANAKA",
"fullName": "TOMOKI TANAKA",
"affiliation": "Mitsubishi UFJ Financial Group, Inc., Tokyo, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "SHUMPEI",
"surname": "UNO",
"fullName": "SHUMPEI UNO",
"affiliation": "Mizuho Research and Technologies, Ltd., Tokyo, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "RODNEY VAN",
"surname": "METER",
"fullName": "RODNEY VAN METER",
"affiliation": "Graduate School of Media and Governance, Keio University, Fujisawa, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "NAOYUKI",
"surname": "SHINOHARA",
"fullName": "NAOYUKI SHINOHARA",
"affiliation": "National Institute of Information and Communications Technology, Tokyo, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "RYO",
"surname": "NOJIMA",
"fullName": "RYO NOJIMA",
"affiliation": "National Institute of Information and Communications Technology, Tokyo, Japan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "1-21",
"year": "2022",
"issn": "2689-1808",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/qe/2022/01/09669165",
"title": "Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers",
"doi": null,
"abstractUrl": "/journal/qe/2022/01/09669165/1B4hzRGNowE",
"parentPublication": {
"id": "trans/qe",
"title": "IEEE Transactions on Quantum Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2022/9747/0/974700a435",
"title": "Performance Evaluations of Noisy Approximate Quantum Fourier Arithmetic",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2022/974700a435/1Fu9pr2JUt2",
"parentPublication": {
"id": "proceedings/ipdpsw/2022/9747/0",
"title": "2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2023/06/09924609",
"title": "Design Space Exploration for Efficient Quantum Most-Significant Digit-First Arithmetic",
"doi": null,
"abstractUrl": "/journal/tc/2023/06/09924609/1HBI0hVXxss",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/arith/2022/7827/0/782700a076",
"title": "Towards Quantum Logarithm Number Systems",
"doi": null,
"abstractUrl": "/proceedings-article/arith/2022/782700a076/1J9AUyMDjBS",
"parentPublication": {
"id": "proceedings/arith/2022/7827/0",
"title": "2022 IEEE 29th Symposium on Computer Arithmetic (ARITH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccd/2022/6186/0/618600a109",
"title": "Design and Analysis of a Scalable and Efficient Quantum Circuit for LWE Matrix Arithmetic",
"doi": null,
"abstractUrl": "/proceedings-article/iccd/2022/618600a109/1JeFXBGhiJq",
"parentPublication": {
"id": "proceedings/iccd/2022/6186/0",
"title": "2022 IEEE 40th International Conference on Computer Design (ICCD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "letters/ca/2019/02/08798600",
"title": "Quantum Circuits for Dynamic Runtime Assertions in Quantum Computation",
"doi": null,
"abstractUrl": "/journal/ca/2019/02/08798600/1cYd1OIIRKE",
"parentPublication": {
"id": "letters/ca",
"title": "IEEE Computer Architecture Letters",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiswc/2020/7645/0/764500a094",
"title": "Reliability Modeling of NISQ- Era Quantum Computers",
"doi": null,
"abstractUrl": "/proceedings-article/iiswc/2020/764500a094/1oSXPUEot2g",
"parentPublication": {
"id": "proceedings/iiswc/2020/7645/0",
"title": "2020 IEEE International Symposium on Workload Characterization (IISWC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2021/05/09465720",
"title": "On Double Full-Stack Communication-Enabled Architectures for Multicore Quantum Computers",
"doi": null,
"abstractUrl": "/magazine/mi/2021/05/09465720/1uIRfxWE5Tq",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccict/2021/2392/0/239200a084",
"title": "Quantum Memory Multiple Access",
"doi": null,
"abstractUrl": "/proceedings-article/ccict/2021/239200a084/1wkvFUdnq36",
"parentPublication": {
"id": "proceedings/ccict/2021/2392/0",
"title": "2021 Fourth International Conference on Computational Intelligence and Communication Technologies (CCICT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qce/2021/1691/0/169100a452",
"title": "Optimal Policies for Distributed Quantum Computing with Quantum Walk Control Plane Protocol",
"doi": null,
"abstractUrl": "/proceedings-article/qce/2021/169100a452/1yEZ5PuJZhm",
"parentPublication": {
"id": "proceedings/qce/2021/1691/0",
"title": "2021 IEEE International Conference on Quantum Computing and Engineering (QCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09775600",
"articleId": "1DqhoJXK6nS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09805433",
"articleId": "1ErlqmiKLhS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1N0sxRjgSbK",
"title": "June",
"year": "2023",
"issueNum": "06",
"idPrefix": "tc",
"pubType": "journal",
"volume": "72",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1HBI0hVXxss",
"doi": "10.1109/TC.2022.3215891",
"abstract": "Quantum computing has been considered as an emerging approach in addressing problems which are not easily solvable using classical computers. In parallel to the physical implementation of quantum processors, quantum algorithms have been actively developed for real-life applications to show quantum advantages, many of which benefit from quantum arithmetic algorithms and their efficient implementations. As one of the most important operations, quantum addition has been adopted in Shor's algorithm and quantum linear algebra algorithms. Although various least-significant digit-first quantum adders have been introduced in previous work, interest in investigating the efficient implementation of most-significant digit-first addition is growing. In this work, we propose a novel design method for most-significant digit-first addition with several quantum circuit optimisations to reduce the number of quantum bits (i.e. qubits), quantum gates, and circuit depth. An open-source library of different arithmetic operators based on our proposed method is presented, where all circuits are implemented on IBM Qiskit SDK. Extensive experiments demonstrate that our proposed design, together with the optimisation techniques, reduces T-depth by up-to 4.0×, T-count by 3.5×, and qubit consumption by 1.2×.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Quantum computing has been considered as an emerging approach in addressing problems which are not easily solvable using classical computers. In parallel to the physical implementation of quantum processors, quantum algorithms have been actively developed for real-life applications to show quantum advantages, many of which benefit from quantum arithmetic algorithms and their efficient implementations. As one of the most important operations, quantum addition has been adopted in Shor's algorithm and quantum linear algebra algorithms. Although various least-significant digit-first quantum adders have been introduced in previous work, interest in investigating the efficient implementation of most-significant digit-first addition is growing. In this work, we propose a novel design method for most-significant digit-first addition with several quantum circuit optimisations to reduce the number of quantum bits (i.e. qubits), quantum gates, and circuit depth. An open-source library of different arithmetic operators based on our proposed method is presented, where all circuits are implemented on IBM Qiskit SDK. Extensive experiments demonstrate that our proposed design, together with the optimisation techniques, reduces T-depth by up-to 4.0×, T-count by 3.5×, and qubit consumption by 1.2×.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Quantum computing has been considered as an emerging approach in addressing problems which are not easily solvable using classical computers. In parallel to the physical implementation of quantum processors, quantum algorithms have been actively developed for real-life applications to show quantum advantages, many of which benefit from quantum arithmetic algorithms and their efficient implementations. As one of the most important operations, quantum addition has been adopted in Shor's algorithm and quantum linear algebra algorithms. Although various least-significant digit-first quantum adders have been introduced in previous work, interest in investigating the efficient implementation of most-significant digit-first addition is growing. In this work, we propose a novel design method for most-significant digit-first addition with several quantum circuit optimisations to reduce the number of quantum bits (i.e. qubits), quantum gates, and circuit depth. An open-source library of different arithmetic operators based on our proposed method is presented, where all circuits are implemented on IBM Qiskit SDK. Extensive experiments demonstrate that our proposed design, together with the optimisation techniques, reduces T-depth by up-to 4.0×, T-count by 3.5×, and qubit consumption by 1.2×.",
"title": "Design Space Exploration for Efficient Quantum Most-Significant Digit-First Arithmetic",
"normalizedTitle": "Design Space Exploration for Efficient Quantum Most-Significant Digit-First Arithmetic",
"fno": "09924609",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Logic Gates",
"Adders",
"Qubit",
"Arithmetic",
"Quantum Circuit",
"Optimization",
"Computer Architecture",
"Most Significant Digit First Arithmetic",
"Quantum Circuits",
"Quantum Computing"
],
"authors": [
{
"givenName": "He",
"surname": "Li",
"fullName": "He Li",
"affiliation": "School of Electronic Science & Engineering, Southeast University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiawei",
"surname": "Liang",
"fullName": "Jiawei Liang",
"affiliation": "Zeku Technology Co., Ltd., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongxiang",
"surname": "Fan",
"fullName": "Hongxiang Fan",
"affiliation": "Computing Department, Imperial College London, London, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yongming",
"surname": "Tang",
"fullName": "Yongming Tang",
"affiliation": "School of Electronic Science & Engineering, Southeast University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2023-06-01 00:00:00",
"pubType": "trans",
"pages": "1822-1829",
"year": "2023",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/arith/1985/9999/0/06158979",
"title": "Improved normalization results for digit on-line arithmetic",
"doi": null,
"abstractUrl": "/proceedings-article/arith/1985/06158979/12OmNBtCCAv",
"parentPublication": {
"id": "proceedings/arith/1985/9999/0",
"title": "1985 IEEE 7th Symposium on Computer Arithmetic",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/arith/1981/9999/0/06159273",
"title": "Design of a digit-slice on-line arithmetic unit",
"doi": null,
"abstractUrl": "/proceedings-article/arith/1981/06159273/12OmNxuXcwT",
"parentPublication": {
"id": "proceedings/arith/1981/9999/0",
"title": "Computer Arithmetic, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/date/2011/4208/0/05763318",
"title": "An efficient Quantum-Dot Cellular Automata adder",
"doi": null,
"abstractUrl": "/proceedings-article/date/2011/05763318/12OmNySXEYl",
"parentPublication": {
"id": "proceedings/date/2011/4208/0",
"title": "Design, Automation & Test in Europe Conference & Exhibition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismvl/2008/3155/0/3155a202",
"title": "Quantum Logic Implementation of Unary Arithmetic Operations",
"doi": null,
"abstractUrl": "/proceedings-article/ismvl/2008/3155a202/12OmNzd7bBH",
"parentPublication": {
"id": "proceedings/ismvl/2008/3155/0",
"title": "38th International Symposium on Multiple Valued Logic (ismvl 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismvl/1991/2145/0/00130752",
"title": "Multiple-valued current-mode arithmetic circuits based on redundant positive-digit number representations",
"doi": null,
"abstractUrl": "/proceedings-article/ismvl/1991/00130752/12OmNzl3WNU",
"parentPublication": {
"id": "proceedings/ismvl/1991/2145/0",
"title": "1991 Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1969/03/01671226",
"title": "Decimal Adder with Signed Digit Arithmetic",
"doi": null,
"abstractUrl": "/journal/tc/1969/03/01671226/13rRUxOdD6U",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/qe/2022/01/09745362",
"title": "On the Realistic Worst-Case Analysis of Quantum Arithmetic Circuits",
"doi": null,
"abstractUrl": "/journal/qe/2022/01/09745362/1CagJpDWmAM",
"parentPublication": {
"id": "trans/qe",
"title": "IEEE Transactions on Quantum Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2022/9747/0/974700a435",
"title": "Performance Evaluations of Noisy Approximate Quantum Fourier Arithmetic",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2022/974700a435/1Fu9pr2JUt2",
"parentPublication": {
"id": "proceedings/ipdpsw/2022/9747/0",
"title": "2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2022/01/09626160",
"title": "Impact of Radix-10 Redundant Digit Set [−6, 9] on Basic Decimal Arithmetic Operations",
"doi": null,
"abstractUrl": "/journal/si/2022/01/09626160/1yNd5SWPlQc",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/igsc/2021/7851/0/09651595",
"title": "Quantum Most-Significant Digit-First Addition",
"doi": null,
"abstractUrl": "/proceedings-article/igsc/2021/09651595/1zHI1ESOo6s",
"parentPublication": {
"id": "proceedings/igsc/2021/7851/0",
"title": "2021 12th International Green and Sustainable Computing Conference (IGSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09927425",
"articleId": "1HJuLchrDsA",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1AlHzMLlSUg",
"title": null,
"year": "2022",
"issueNum": "01",
"idPrefix": "qe",
"pubType": "journal",
"volume": "3",
"label": null,
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1JilZqKkl3O",
"doi": "10.1109/TQE.2022.3231124",
"abstract": "Variational quantum algorithms (VQAs) have emerged as a powerful class of algorithms that is highly suitable for noisy quantum devices. Therefore, investigating their design has become key in quantum computing research. Previous works have shown that choosing an effective parameterized quantum circuit (PQC) or ansatz for a VQA is crucial to its overall performance, especially on near-term devices. In this article, we utilize pulse-level access to quantum machines, our understanding of their two-qubit interactions, and, more importantly, our knowledge of VQAs, to customize the design of two-qubit entanglers. Our analysis shows that utilizing customized pulse gates for ansatze reduces state preparation times by more than half, maintains expressibility relative to standard ansatze, and produces PQCs that are more trainable through local cost function analysis. Our algorithm performance results show that in three cases, our PQC configuration outperforms the base implementation. Experiments using IBM Quantum hardware demonstrate that our pulse-based PQC configurations are more capable of solving MaxCut and chemistry problems compared to a standard configuration.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Variational quantum algorithms (VQAs) have emerged as a powerful class of algorithms that is highly suitable for noisy quantum devices. Therefore, investigating their design has become key in quantum computing research. Previous works have shown that choosing an effective parameterized quantum circuit (PQC) or ansatz for a VQA is crucial to its overall performance, especially on near-term devices. In this article, we utilize pulse-level access to quantum machines, our understanding of their two-qubit interactions, and, more importantly, our knowledge of VQAs, to customize the design of two-qubit entanglers. Our analysis shows that utilizing customized pulse gates for ansatze reduces state preparation times by more than half, maintains expressibility relative to standard ansatze, and produces PQCs that are more trainable through local cost function analysis. Our algorithm performance results show that in three cases, our PQC configuration outperforms the base implementation. Experiments using IBM Quantum hardware demonstrate that our pulse-based PQC configurations are more capable of solving MaxCut and chemistry problems compared to a standard configuration.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Variational quantum algorithms (VQAs) have emerged as a powerful class of algorithms that is highly suitable for noisy quantum devices. Therefore, investigating their design has become key in quantum computing research. Previous works have shown that choosing an effective parameterized quantum circuit (PQC) or ansatz for a VQA is crucial to its overall performance, especially on near-term devices. In this article, we utilize pulse-level access to quantum machines, our understanding of their two-qubit interactions, and, more importantly, our knowledge of VQAs, to customize the design of two-qubit entanglers. Our analysis shows that utilizing customized pulse gates for ansatze reduces state preparation times by more than half, maintains expressibility relative to standard ansatze, and produces PQCs that are more trainable through local cost function analysis. Our algorithm performance results show that in three cases, our PQC configuration outperforms the base implementation. Experiments using IBM Quantum hardware demonstrate that our pulse-based PQC configurations are more capable of solving MaxCut and chemistry problems compared to a standard configuration.",
"title": "Evaluation of Parameterized Quantum Circuits With Cross-Resonance Pulse-Driven Entanglers",
"normalizedTitle": "Evaluation of Parameterized Quantum Circuits With Cross-Resonance Pulse-Driven Entanglers",
"fno": "09996174",
"hasPdf": true,
"idPrefix": "qe",
"keywords": [
"Quantum Communication",
"Quantum Computing",
"Quantum Entanglement",
"Quantum Gates",
"Algorithm Performance Results",
"Ansatz",
"Cross Resonance Pulse Driven Entanglers",
"Customized Pulse Gates",
"IBM Quantum Hardware",
"Local Cost Function Analysis",
"Near Term Devices",
"Noisy Quantum Devices",
"Parameterized Quantum Circuits",
"PQC Configuration",
"Pulse Based PQC Configurations",
"Pulse Level Access",
"Quantum Machines",
"Standard Ansatze",
"Two Qubit Entanglers",
"Two Qubit Interactions",
"Variational Quantum Algorithms",
"VQ As",
"Qubit",
"Hardware",
"Quantum Computing",
"Logic Gates",
"Quantum Circuit",
"Quantum Algorithm",
"Noise Measurement",
"Barren Plateaus",
"Hamiltonian Tomography HT",
"Parameterized Quantum Circuits PQ Cs",
"Pulse Level Control",
"Quantum Computing",
"Variational Quantum Algorithms VQ As"
],
"authors": [
{
"givenName": "Mohannad M.",
"surname": "Ibrahim",
"fullName": "Mohannad M. Ibrahim",
"affiliation": "Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hamed",
"surname": "Mohammadbagherpoor",
"fullName": "Hamed Mohammadbagherpoor",
"affiliation": "Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cynthia",
"surname": "Rios",
"fullName": "Cynthia Rios",
"affiliation": "Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nicholas T.",
"surname": "Bronn",
"fullName": "Nicholas T. Bronn",
"affiliation": "IBM Quantum, IBM T. J. Watson Research Center, Yorktown Heights, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gregory T.",
"surname": "Byrd",
"fullName": "Gregory T. Byrd",
"affiliation": "Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "1-13",
"year": "2022",
"issn": "2689-1808",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/qe/2022/01/09736599",
"title": "Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm",
"doi": null,
"abstractUrl": "/journal/qe/2022/01/09736599/1BN1UYVcjao",
"parentPublication": {
"id": "trans/qe",
"title": "IEEE Transactions on Quantum Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icrc/2021/2332/0/233200a014",
"title": "Enabling a Programming Environment for an Experimental Ion Trap Quantum Testbed",
"doi": null,
"abstractUrl": "/proceedings-article/icrc/2021/233200a014/1CbZIms13Da",
"parentPublication": {
"id": "proceedings/icrc/2021/2332/0",
"title": "2021 International Conference on Rebooting Computing (ICRC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/qe/2022/01/09775600",
"title": "A Distributed Learning Scheme for Variational Quantum Algorithms",
"doi": null,
"abstractUrl": "/journal/qe/2022/01/09775600/1DqhoJXK6nS",
"parentPublication": {
"id": "trans/qe",
"title": "IEEE Transactions on Quantum Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2022/9747/0/974700a600",
"title": "Methods and Results for Quantum Optimal Pulse Control on Superconducting Qubit Systems",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2022/974700a600/1Fu9pzIVn5m",
"parentPublication": {
"id": "proceedings/ipdpsw/2022/9747/0",
"title": "2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qce/2022/9113/0/911300a759",
"title": "Deep Reinforcement Learning Quantum Control on IBMQ Platforms and Qiskit Pulse",
"doi": null,
"abstractUrl": "/proceedings-article/qce/2022/911300a759/1IvLAUFuzCw",
"parentPublication": {
"id": "proceedings/qce/2022/9113/0",
"title": "2022 IEEE International Conference on Quantum Computing and Engineering (QCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/qe/2022/01/09991059",
"title": "Error-Mitigation-Aided Optimization of Parameterized Quantum Circuits: Convergence Analysis",
"doi": null,
"abstractUrl": "/journal/qe/2022/01/09991059/1J9z9HlMQ48",
"parentPublication": {
"id": "trans/qe",
"title": "IEEE Transactions on Quantum Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccd/2022/6186/0/618600a109",
"title": "Design and Analysis of a Scalable and Efficient Quantum Circuit for LWE Matrix Arithmetic",
"doi": null,
"abstractUrl": "/proceedings-article/iccd/2022/618600a109/1JeFXBGhiJq",
"parentPublication": {
"id": "proceedings/iccd/2022/6186/0",
"title": "2022 IEEE 40th International Conference on Computer Design (ICCD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/qe/2023/01/10041809",
"title": "Variational Quantum Optimization of Nonlocality in Noisy Quantum Networks",
"doi": null,
"abstractUrl": "/journal/qe/2023/01/10041809/1KCLOXZrpkI",
"parentPublication": {
"id": "trans/qe",
"title": "IEEE Transactions on Quantum Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tase/2019/3342/0/334200a184",
"title": "Optimizing Quantum Programs Against Decoherence: Delaying Qubits into Quantum Superposition",
"doi": null,
"abstractUrl": "/proceedings-article/tase/2019/334200a184/1fpNC0HBIbu",
"parentPublication": {
"id": "proceedings/tase/2019/3342/0",
"title": "2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qce/2021/1691/0/169100a100",
"title": "Optimizing Parameterized Quantum Circuits with Free-Axis Selection",
"doi": null,
"abstractUrl": "/proceedings-article/qce/2021/169100a100/1yEZ4dPgxAQ",
"parentPublication": {
"id": "proceedings/qce/2021/1691/0",
"title": "2021 IEEE International Conference on Quantum Computing and Engineering (QCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09991059",
"articleId": "1J9z9HlMQ48",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10012045",
"articleId": "1JNmKsSq2CQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1AlHmdyOjAc",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "qe",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1MNbQiUIthe",
"doi": "10.1109/TQE.2023.3272023",
"abstract": "It is important for the design of a distributed quantum circuit (DQC) to minimize the communication cost in <italic>k</italic>-way balanced partitioning. In this paper, given an original quantum circuit (QC), a partitioning number, <italic>k</italic>, the maximum capacity, δ, inside each partition and the maximum size-tolerance, γ, between two partitions, a new <italic>k</italic>-way (δ, γ)-balanced partitioning problem can be formulated as a <italic>k</italic>-way partitioning problem under the capacity constraint, δ, and the size-tolerance constraint, γ, and a fuzzy-based partitioning algorithm can be proposed to minimize the communication cost in <italic>k</italic>-way (δ, γ)-balanced partitioning for a DQC design. Firstly, an edge-weighted connection graph can be constructed from the gates in a given QC. Furthermore, based on the estimation of the probabilistic connection strength between two vertices in the connection graph and the <italic>initial k-way</italic> partitioning result in the connection graph, the fuzzy memberships on <italic>k</italic> clusters can be generated in fuzzy <italic>k</italic>-means graph clustering (FKGC). Finally, based on the fuzzy memberships on <italic>k</italic> clusters in the connection graph, the maximum capacity inside each partition and the maximum size-tolerance between two partitions, all the vertices in the connection graph can be assigned onto <italic>k</italic> partitions to minimize the communication cost in <italic>k</italic>-way (δ, γ)-balanced partitioning. Compared with Daei's recursive KL-based algorithm in 4-way balanced partitioning, the experimental results show that the proposed fuzzy-based partitioning algorithm with three size-tolerance constraints, γ = 1, γ = 2 and γ = 3, can use 58.3%, 61.3% and 64.5% of CPU time to reduce 16.1%, 21.2% and 24.6% of the communication cost for the 8 tested circuits on the average, respectively. Compared with the modified partitioning algorithm from Dadkhah's partitioning algorithm in 3-way, 4-way or 5-way balanced partitioning, the experimental results show that the proposed fuzzy-based partitioning algorithm with the size-tolerance constraint, γ = 3, can use 35.0% of CPU time to reduce 11.1% of the communication cost for the 8 tested circuits on the average, respectively.",
"abstracts": [
{
"abstractType": "Regular",
"content": "It is important for the design of a distributed quantum circuit (DQC) to minimize the communication cost in <italic>k</italic>-way balanced partitioning. In this paper, given an original quantum circuit (QC), a partitioning number, <italic>k</italic>, the maximum capacity, δ, inside each partition and the maximum size-tolerance, γ, between two partitions, a new <italic>k</italic>-way (δ, γ)-balanced partitioning problem can be formulated as a <italic>k</italic>-way partitioning problem under the capacity constraint, δ, and the size-tolerance constraint, γ, and a fuzzy-based partitioning algorithm can be proposed to minimize the communication cost in <italic>k</italic>-way (δ, γ)-balanced partitioning for a DQC design. Firstly, an edge-weighted connection graph can be constructed from the gates in a given QC. Furthermore, based on the estimation of the probabilistic connection strength between two vertices in the connection graph and the <italic>initial k-way</italic> partitioning result in the connection graph, the fuzzy memberships on <italic>k</italic> clusters can be generated in fuzzy <italic>k</italic>-means graph clustering (FKGC). Finally, based on the fuzzy memberships on <italic>k</italic> clusters in the connection graph, the maximum capacity inside each partition and the maximum size-tolerance between two partitions, all the vertices in the connection graph can be assigned onto <italic>k</italic> partitions to minimize the communication cost in <italic>k</italic>-way (δ, γ)-balanced partitioning. Compared with Daei's recursive KL-based algorithm in 4-way balanced partitioning, the experimental results show that the proposed fuzzy-based partitioning algorithm with three size-tolerance constraints, γ = 1, γ = 2 and γ = 3, can use 58.3%, 61.3% and 64.5% of CPU time to reduce 16.1%, 21.2% and 24.6% of the communication cost for the 8 tested circuits on the average, respectively. Compared with the modified partitioning algorithm from Dadkhah's partitioning algorithm in 3-way, 4-way or 5-way balanced partitioning, the experimental results show that the proposed fuzzy-based partitioning algorithm with the size-tolerance constraint, γ = 3, can use 35.0% of CPU time to reduce 11.1% of the communication cost for the 8 tested circuits on the average, respectively.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "It is important for the design of a distributed quantum circuit (DQC) to minimize the communication cost in k-way balanced partitioning. In this paper, given an original quantum circuit (QC), a partitioning number, k, the maximum capacity, δ, inside each partition and the maximum size-tolerance, γ, between two partitions, a new k-way (δ, γ)-balanced partitioning problem can be formulated as a k-way partitioning problem under the capacity constraint, δ, and the size-tolerance constraint, γ, and a fuzzy-based partitioning algorithm can be proposed to minimize the communication cost in k-way (δ, γ)-balanced partitioning for a DQC design. Firstly, an edge-weighted connection graph can be constructed from the gates in a given QC. Furthermore, based on the estimation of the probabilistic connection strength between two vertices in the connection graph and the initial k-way partitioning result in the connection graph, the fuzzy memberships on k clusters can be generated in fuzzy k-means graph clustering (FKGC). Finally, based on the fuzzy memberships on k clusters in the connection graph, the maximum capacity inside each partition and the maximum size-tolerance between two partitions, all the vertices in the connection graph can be assigned onto k partitions to minimize the communication cost in k-way (δ, γ)-balanced partitioning. Compared with Daei's recursive KL-based algorithm in 4-way balanced partitioning, the experimental results show that the proposed fuzzy-based partitioning algorithm with three size-tolerance constraints, γ = 1, γ = 2 and γ = 3, can use 58.3%, 61.3% and 64.5% of CPU time to reduce 16.1%, 21.2% and 24.6% of the communication cost for the 8 tested circuits on the average, respectively. Compared with the modified partitioning algorithm from Dadkhah's partitioning algorithm in 3-way, 4-way or 5-way balanced partitioning, the experimental results show that the proposed fuzzy-based partitioning algorithm with the size-tolerance constraint, γ = 3, can use 35.0% of CPU time to reduce 11.1% of the communication cost for the 8 tested circuits on the average, respectively.",
"title": "Fuzzy-Based Balanced Partitioning under Capacity and Size-Tolerance Constraints in Distributed Quantum Circuits",
"normalizedTitle": "Fuzzy-Based Balanced Partitioning under Capacity and Size-Tolerance Constraints in Distributed Quantum Circuits",
"fno": "10113735",
"hasPdf": true,
"idPrefix": "qe",
"keywords": [
"Logic Gates",
"Partitioning Algorithms",
"Costs",
"Qubit",
"Quantum Circuit",
"Teleportation",
"Quantum Entanglement",
"Distributed Quantum Circuit DQC",
"Fuzzy Italic Xmlns Ali Http Www Niso Org Schemas Ali 1 0 Xmlns Mml Http Www W 3 Org 1998 Math Math ML Xmlns Xlink Http Www W 3 Org 1999 Xlink Xmlns Xsi Http Www W 3 Org 2001 XML Schema Instance K Italic Means Graph Clustering FKGC",
"Communication Cost",
"Balanced Partitioning"
],
"authors": [
{
"givenName": "Jin-Tai",
"surname": "Yan",
"fullName": "Jin-Tai Yan",
"affiliation": "Graduate Institute of Sound Technology, Tainan National University of the Arts, Tainan, Taiwan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "1-14",
"year": "5555",
"issn": "2689-1808",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icnc/2018/3652/0/08390271",
"title": "An efficient quantum teleportation scheme based on six-particle cluster quantum channel",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2018/08390271/12OmNqJHFEM",
"parentPublication": {
"id": "proceedings/icnc/2018/3652/0",
"title": "2018 International Conference on Computing, Networking and Communications (ICNC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccae/2009/3569/0/3569a213",
"title": "A Review and Prospects of Quantum Teleportation",
"doi": null,
"abstractUrl": "/proceedings-article/iccae/2009/3569a213/12OmNrJ11wl",
"parentPublication": {
"id": "proceedings/iccae/2009/3569/0",
"title": "2009 International Conference on Computer and Automation Engineering. ICCAE 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/qe/2022/01/09706320",
"title": "DQRA: Deep Quantum Routing Agent for Entanglement Routing in Quantum Networks",
"doi": null,
"abstractUrl": "/journal/qe/2022/01/09706320/1B4gwabViJG",
"parentPublication": {
"id": "trans/qe",
"title": "IEEE Transactions on Quantum Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/qe/2022/01/09760110",
"title": "Efficient Quantum Network Communication Using Optimized Entanglement Swapping Trees",
"doi": null,
"abstractUrl": "/journal/qe/2022/01/09760110/1CHsD5G2J6E",
"parentPublication": {
"id": "trans/qe",
"title": "IEEE Transactions on Quantum Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/qe/2022/01/09774323",
"title": "A Divide-and-Conquer Approach to Dicke State Preparation",
"doi": null,
"abstractUrl": "/journal/qe/2022/01/09774323/1DjDqicaliw",
"parentPublication": {
"id": "trans/qe",
"title": "IEEE Transactions on Quantum Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/qe/2022/01/09779492",
"title": "A Connection-Oriented Entanglement Distribution Design in Quantum Networks",
"doi": null,
"abstractUrl": "/journal/qe/2022/01/09779492/1DwUDdErb8s",
"parentPublication": {
"id": "trans/qe",
"title": "IEEE Transactions on Quantum Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csp/2022/7975/0/797500a001",
"title": "Teleporting Qubits Between Participants by Third-Party Center",
"doi": null,
"abstractUrl": "/proceedings-article/csp/2022/797500a001/1FRKJBSLnS8",
"parentPublication": {
"id": "proceedings/csp/2022/7975/0",
"title": "2022 6th International Conference on Cryptography, Security and Privacy (CSP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qce/2022/9113/0/911300a426",
"title": "Pre-Distribution of Entanglements in Quantum Networks",
"doi": null,
"abstractUrl": "/proceedings-article/qce/2022/911300a426/1IvLt8qIaMU",
"parentPublication": {
"id": "proceedings/qce/2022/9113/0",
"title": "2022 IEEE International Conference on Quantum Computing and Engineering (QCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qce/2020/8969/0/896900a148",
"title": "Capacity Requirements in Networks of Quantum Repeaters and Terminals",
"doi": null,
"abstractUrl": "/proceedings-article/qce/2020/896900a148/1p2VnoHl56M",
"parentPublication": {
"id": "proceedings/qce/2020/8969/0",
"title": "2020 IEEE International Conference on Quantum Computing and Engineering (QCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qce/2021/1691/0/169100a313",
"title": "A quantum walk control plane for distributed quantum computing in quantum networks",
"doi": null,
"abstractUrl": "/proceedings-article/qce/2021/169100a313/1yEZ39SVZ9C",
"parentPublication": {
"id": "proceedings/qce/2021/1691/0",
"title": "2021 IEEE International Conference on Quantum Computing and Engineering (QCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10113746",
"articleId": "1MNbQ59sghi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10115473",
"articleId": "1MSa0sst5LO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1Gtu28DYSJO",
"title": "Oct.",
"year": "2022",
"issueNum": "10",
"idPrefix": "tc",
"pubType": "journal",
"volume": "71",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zmuUCGaiK4",
"doi": "10.1109/TC.2021.3135759",
"abstract": "Grover’s search algorithm allows a quantum adversary to find a <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-bit secret key of a block cipher by making O(<inline-formula><tex-math notation=\"LaTeX\">Z_$2^{k/2}$_Z</tex-math></inline-formula>) block cipher queries. Resistance of a block cipher to such an attack is evaluated by quantum resources required to implement Grover’s oracle for the target cipher. The quantum resources are typically estimated by the <inline-formula><tex-math notation=\"LaTeX\">Z_$\\textit {T}$_Z</tex-math></inline-formula>-depth of its circuit implementation and the number of qubits used by the circuit (width). Since the AES S-box is the only component which requires <inline-formula><tex-math notation=\"LaTeX\">Z_$\\textit {T}$_Z</tex-math></inline-formula>-gates in a quantum implementation of AES, recent research has put its focus on efficient implementation of the AES S-box. However, any efficient implementation with low <inline-formula><tex-math notation=\"LaTeX\">Z_$\\textit {T}$_Z</tex-math></inline-formula>-depth will not be practical in the real world without considering qubit consumption of the implementation. In this work, we propose three methods of trade-off between time and space for the quantum implementation of the AES S-box. In particular, one of our methods turns out to use the smallest number of qubits among the existing methods, significantly reducing its <inline-formula><tex-math notation=\"LaTeX\">Z_$\\textit {T}$_Z</tex-math></inline-formula>-depth.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Grover’s search algorithm allows a quantum adversary to find a <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"chung-ieq1-3135759.gif\"/></alternatives></inline-formula>-bit secret key of a block cipher by making O(<inline-formula><tex-math notation=\"LaTeX\">$2^{k/2}$</tex-math><alternatives><mml:math><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mi>k</mml:mi><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math><inline-graphic xlink:href=\"chung-ieq2-3135759.gif\"/></alternatives></inline-formula>) block cipher queries. Resistance of a block cipher to such an attack is evaluated by quantum resources required to implement Grover’s oracle for the target cipher. The quantum resources are typically estimated by the <inline-formula><tex-math notation=\"LaTeX\">$\\textit {T}$</tex-math><alternatives><mml:math><mml:mtext mathvariant=\"italic\">T</mml:mtext></mml:math><inline-graphic xlink:href=\"chung-ieq3-3135759.gif\"/></alternatives></inline-formula>-depth of its circuit implementation and the number of qubits used by the circuit (width). Since the AES S-box is the only component which requires <inline-formula><tex-math notation=\"LaTeX\">$\\textit {T}$</tex-math><alternatives><mml:math><mml:mtext mathvariant=\"italic\">T</mml:mtext></mml:math><inline-graphic xlink:href=\"chung-ieq4-3135759.gif\"/></alternatives></inline-formula>-gates in a quantum implementation of AES, recent research has put its focus on efficient implementation of the AES S-box. However, any efficient implementation with low <inline-formula><tex-math notation=\"LaTeX\">$\\textit {T}$</tex-math><alternatives><mml:math><mml:mtext mathvariant=\"italic\">T</mml:mtext></mml:math><inline-graphic xlink:href=\"chung-ieq5-3135759.gif\"/></alternatives></inline-formula>-depth will not be practical in the real world without considering qubit consumption of the implementation. In this work, we propose three methods of trade-off between time and space for the quantum implementation of the AES S-box. In particular, one of our methods turns out to use the smallest number of qubits among the existing methods, significantly reducing its <inline-formula><tex-math notation=\"LaTeX\">$\\textit {T}$</tex-math><alternatives><mml:math><mml:mtext mathvariant=\"italic\">T</mml:mtext></mml:math><inline-graphic xlink:href=\"chung-ieq6-3135759.gif\"/></alternatives></inline-formula>-depth.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Grover’s search algorithm allows a quantum adversary to find a --bit secret key of a block cipher by making O(-) block cipher queries. Resistance of a block cipher to such an attack is evaluated by quantum resources required to implement Grover’s oracle for the target cipher. The quantum resources are typically estimated by the --depth of its circuit implementation and the number of qubits used by the circuit (width). Since the AES S-box is the only component which requires --gates in a quantum implementation of AES, recent research has put its focus on efficient implementation of the AES S-box. However, any efficient implementation with low --depth will not be practical in the real world without considering qubit consumption of the implementation. In this work, we propose three methods of trade-off between time and space for the quantum implementation of the AES S-box. In particular, one of our methods turns out to use the smallest number of qubits among the existing methods, significantly reducing its --depth.",
"title": "Alternative Tower Field Construction for Quantum Implementation of the AES S-Box",
"normalizedTitle": "Alternative Tower Field Construction for Quantum Implementation of the AES S-Box",
"fno": "09652093",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Cryptography",
"Quantum Cryptography",
"Quantum Gates",
"Quantum Implementation",
"AES S Box",
"Grover Search Algorithm",
"Quantum Adversary",
"K Bit Secret Key",
"Block Cipher",
"Quantum Resources",
"Target Cipher",
"Circuit Implementation",
"Logic Gates",
"Qubit",
"Quantum Circuit",
"Ciphers",
"Poles And Towers",
"Resistance",
"Registers",
"Quantum Implementation",
"Quantum Cryptanalysis",
"Grovers Algorithm",
"AES",
"Multiplicative Inversion"
],
"authors": [
{
"givenName": "Doyoung",
"surname": "Chung",
"fullName": "Doyoung Chung",
"affiliation": "School of Computing, KAIST, Daejeon, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Seungkwang",
"surname": "Lee",
"fullName": "Seungkwang Lee",
"affiliation": "Information Security Research Division, ETRI, Daejeon, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dooho",
"surname": "Choi",
"fullName": "Dooho Choi",
"affiliation": "Department of AI Cyber Security, Korea University Sejong, Sejong, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jooyoung",
"surname": "Lee",
"fullName": "Jooyoung Lee",
"affiliation": "School of Computing, KAIST, Daejeon, South Korea",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2022-10-01 00:00:00",
"pubType": "trans",
"pages": "2553-2564",
"year": "2022",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/2019/01/08409309",
"title": "Hardware Optimizations and Analysis for the WG-16 Cipher with Tower Field Arithmetic",
"doi": null,
"abstractUrl": "/journal/tc/2019/01/08409309/17D45VsBU7x",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2020/03/08519335",
"title": "Deep Inductive Graph Representation Learning",
"doi": null,
"abstractUrl": "/journal/tk/2020/03/08519335/17D45WrVgec",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/02/09690063",
"title": "Algebraic Attacks on Block Ciphers Using Quantum Annealing",
"doi": null,
"abstractUrl": "/journal/ec/2022/02/09690063/1AlCiyYAakw",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__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/tp/2023/03/09786656",
"title": "Logarithmic Schatten-<inline-formula><tex-math notation=\"LaTeX\">Z_$p$_Z</tex-math></inline-formula> Norm Minimization for Tensorial Multi-View Subspace Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2023/03/09786656/1DQPxlTv7lS",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/04/09847017",
"title": "Do the Math: Making Mathematics in Wikipedia Computable",
"doi": null,
"abstractUrl": "/journal/tp/2023/04/09847017/1Fu4AXHNTXi",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/2022/04/09336330",
"title": "Bidirectional and Malleable Proof-of-Ownership for Large File in Cloud Storage",
"doi": null,
"abstractUrl": "/journal/cc/2022/04/09336330/1qHLb1H9WDu",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2022/04/09366363",
"title": "Security of Multi-Adjustable Join Schemes: Separations and Implications",
"doi": null,
"abstractUrl": "/journal/tq/2022/04/09366363/1twaRGe1SOQ",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/01/09452800",
"title": "Core Decomposition on Uncertain Graphs Revisited",
"doi": null,
"abstractUrl": "/journal/tk/2023/01/09452800/1ulCu0Hdqs8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2022/06/09525235",
"title": "Secure Anonymous Communication on Corrupted Machines With Reverse Firewalls",
"doi": null,
"abstractUrl": "/journal/tq/2022/06/09525235/1wup6HcCXIY",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09652119",
"articleId": "1zmuUpiKoFy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09656637",
"articleId": "1zumqoMDu9i",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvkpkSQ",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "ta",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1E5LuyXVj4k",
"doi": "10.1109/TAFFC.2022.3181033",
"abstract": "As Facial Expression Recognition (FER) systems become integrated into our daily lives, these systems need to prioritise making <italic>fair</italic> decisions instead of only aiming at higher individual accuracy scores. From surveillance systems, to monitoring the mental and emotional health of individuals, these systems need to balance the <italic>accuracy versus fairness</italic> trade-off to make decisions that do not unjustly discriminate against specific under-represented demographic groups. Identifying <italic>bias</italic> as a critical problem in facial analysis systems, different methods have been proposed that aim to mitigate bias both at data and algorithmic levels. In this work, we propose the novel use of Continual Learning (CL), in particular, using Domain-Incremental Learning (Domain-IL) settings, as a potent bias mitigation method to enhance the <italic>fairness</italic> of Facial Expression Recognition (FER) systems. We compare different non-Continual Learning (CL)-based and CL-based methods for their <italic>performance</italic> and <italic>fairness scores</italic> on expression recognition and Action Unit (AU) detection tasks using two popular benchmarks, the RAF-DB and BP4D datasets, respectively. Our experimental results show that CL-based methods, on average, outperform other popular bias mitigation techniques on both <italic>accuracy</italic> and <italic>fairness</italic> metrics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As Facial Expression Recognition (FER) systems become integrated into our daily lives, these systems need to prioritise making <italic>fair</italic> decisions instead of only aiming at higher individual accuracy scores. From surveillance systems, to monitoring the mental and emotional health of individuals, these systems need to balance the <italic>accuracy versus fairness</italic> trade-off to make decisions that do not unjustly discriminate against specific under-represented demographic groups. Identifying <italic>bias</italic> as a critical problem in facial analysis systems, different methods have been proposed that aim to mitigate bias both at data and algorithmic levels. In this work, we propose the novel use of Continual Learning (CL), in particular, using Domain-Incremental Learning (Domain-IL) settings, as a potent bias mitigation method to enhance the <italic>fairness</italic> of Facial Expression Recognition (FER) systems. We compare different non-Continual Learning (CL)-based and CL-based methods for their <italic>performance</italic> and <italic>fairness scores</italic> on expression recognition and Action Unit (AU) detection tasks using two popular benchmarks, the RAF-DB and BP4D datasets, respectively. Our experimental results show that CL-based methods, on average, outperform other popular bias mitigation techniques on both <italic>accuracy</italic> and <italic>fairness</italic> metrics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As Facial Expression Recognition (FER) systems become integrated into our daily lives, these systems need to prioritise making fair decisions instead of only aiming at higher individual accuracy scores. From surveillance systems, to monitoring the mental and emotional health of individuals, these systems need to balance the accuracy versus fairness trade-off to make decisions that do not unjustly discriminate against specific under-represented demographic groups. Identifying bias as a critical problem in facial analysis systems, different methods have been proposed that aim to mitigate bias both at data and algorithmic levels. In this work, we propose the novel use of Continual Learning (CL), in particular, using Domain-Incremental Learning (Domain-IL) settings, as a potent bias mitigation method to enhance the fairness of Facial Expression Recognition (FER) systems. We compare different non-Continual Learning (CL)-based and CL-based methods for their performance and fairness scores on expression recognition and Action Unit (AU) detection tasks using two popular benchmarks, the RAF-DB and BP4D datasets, respectively. Our experimental results show that CL-based methods, on average, outperform other popular bias mitigation techniques on both accuracy and fairness metrics.",
"title": "Domain-Incremental Continual Learning for Mitigating Bias in Facial Expression and Action Unit Recognition",
"normalizedTitle": "Domain-Incremental Continual Learning for Mitigating Bias in Facial Expression and Action Unit Recognition",
"fno": "09792455",
"hasPdf": true,
"idPrefix": "ta",
"keywords": [
"Task Analysis",
"Data Models",
"Face Recognition",
"Training",
"Computational Modeling",
"Training Data",
"Adaptation Models",
"Fairness",
"Continual Learning",
"Bias Mitigation",
"Affective Computing",
"Facial Expression Recognition",
"Facial Action Units"
],
"authors": [
{
"givenName": "Nikhil",
"surname": "Churamani",
"fullName": "Nikhil Churamani",
"affiliation": "Department of Computer Science and Technology, University of Cambridge, Cambridge, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ozgur",
"surname": "Kara",
"fullName": "Ozgur Kara",
"affiliation": "Electrical & Electronics Engineering Department, Bogazici University, Istanbul, Turkey",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hatice",
"surname": "Gunes",
"fullName": "Hatice Gunes",
"affiliation": "Department of Computer Science and Technology, University of Cambridge, Cambridge, U.K.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-06-01 00:00:00",
"pubType": "trans",
"pages": "1-15",
"year": "5555",
"issn": "1949-3045",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2021/2812/0/281200o4960",
"title": "Understanding and Mitigating Annotation Bias in Facial Expression Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200o4960/1BmGFhlboqY",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600u0259",
"title": "Face2Exp: Combating Data Biases for Facial Expression Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600u0259/1H1ixZrFJWU",
"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/ta/5555/01/09941198",
"title": "Bias-Based Soft Label Learning for Facial Expression Recognition",
"doi": null,
"abstractUrl": "/journal/ta/5555/01/09941198/1I8NHbqUa4w",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2023/4544/0/10042642",
"title": "Latent Generative Replay for Resource-Efficient Continual Learning of Facial Expressions",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2023/10042642/1KOuZOEgFGM",
"parentPublication": {
"id": "proceedings/fg/2023/4544/0",
"title": "2023 IEEE 17th International Conference on Automatic Face and Gesture Recognition (FG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10021107",
"title": "Fair Regression under Sample Selection Bias",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10021107/1KfRTsivwLS",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2022/02/08993748",
"title": "A Deeper Look at Facial Expression Dataset Bias",
"doi": null,
"abstractUrl": "/journal/ta/2022/02/08993748/1hkQDBA8eYw",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacvw/2020/7162/0/09096905",
"title": "Mitigating Algorithmic Bias: Evolving an Augmentation Policy that is Non-Biasing",
"doi": null,
"abstractUrl": "/proceedings-article/wacvw/2020/09096905/1jZaqgzYiJ2",
"parentPublication": {
"id": "proceedings/wacvw/2020/7162/0",
"title": "2020 IEEE Winter Applications of Computer Vision Workshops (WACVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2020/3079/0/307900a693",
"title": "CLIFER: Continual Learning with Imagination for Facial Expression Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2020/307900a693/1kecIRr1grK",
"parentPublication": {
"id": "proceedings/fg/2020/3079/0/",
"title": "2020 15th IEEE International Conference on Automatic Face and Gesture Recognition (FG 2020) (FG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800j319",
"title": "Mitigating Bias in Face Recognition Using Skewness-Aware Reinforcement Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800j319/1m3nhTmV41W",
"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/cvprw/2021/4899/0/489900d584",
"title": "Supervised Contrastive Replay: Revisiting the Nearest Class Mean Classifier in Online Class-Incremental Continual Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2021/489900d584/1yVzOWbvH3y",
"parentPublication": {
"id": "proceedings/cvprw/2021/4899/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09794419",
"articleId": "1E5LukLYNQk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09794817",
"articleId": "1Eb0WLV6Sha",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1E5LuvwKynS",
"name": "tta555501-09792455s1-supp1-3181033.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/tta555501-09792455s1-supp1-3181033.pdf",
"extension": "pdf",
"size": "110 kB",
"__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": "1xic387kwVy",
"doi": "10.1109/TVCG.2021.3114850",
"abstract": "Graph mining is an essential component of recommender systems and search engines. Outputs of graph mining models typically provide a ranked list sorted by each item's relevance or utility. However, recent research has identified issues of algorithmic bias in such models, and new graph mining algorithms have been proposed to correct for bias. As such, algorithm developers need tools that can help them uncover potential biases in their models while also exploring the impacts of correcting for biases when employing fairness-aware algorithms. In this paper, we present FairRankVis, a visual analytics framework designed to enable the exploration of multi-class bias in graph mining algorithms. We support both group and individual fairness levels of comparison. Our framework is designed to enable model developers to compare multi-class fairness between algorithms (for example, comparing PageRank with a debiased PageRank algorithm) to assess the impacts of algorithmic debiasing with respect to group and individual fairness. We demonstrate our framework through two usage scenarios inspecting algorithmic fairness.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Graph mining is an essential component of recommender systems and search engines. Outputs of graph mining models typically provide a ranked list sorted by each item's relevance or utility. However, recent research has identified issues of algorithmic bias in such models, and new graph mining algorithms have been proposed to correct for bias. As such, algorithm developers need tools that can help them uncover potential biases in their models while also exploring the impacts of correcting for biases when employing fairness-aware algorithms. In this paper, we present FairRankVis, a visual analytics framework designed to enable the exploration of multi-class bias in graph mining algorithms. We support both group and individual fairness levels of comparison. Our framework is designed to enable model developers to compare multi-class fairness between algorithms (for example, comparing PageRank with a debiased PageRank algorithm) to assess the impacts of algorithmic debiasing with respect to group and individual fairness. We demonstrate our framework through two usage scenarios inspecting algorithmic fairness.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Graph mining is an essential component of recommender systems and search engines. Outputs of graph mining models typically provide a ranked list sorted by each item's relevance or utility. However, recent research has identified issues of algorithmic bias in such models, and new graph mining algorithms have been proposed to correct for bias. As such, algorithm developers need tools that can help them uncover potential biases in their models while also exploring the impacts of correcting for biases when employing fairness-aware algorithms. In this paper, we present FairRankVis, a visual analytics framework designed to enable the exploration of multi-class bias in graph mining algorithms. We support both group and individual fairness levels of comparison. Our framework is designed to enable model developers to compare multi-class fairness between algorithms (for example, comparing PageRank with a debiased PageRank algorithm) to assess the impacts of algorithmic debiasing with respect to group and individual fairness. We demonstrate our framework through two usage scenarios inspecting algorithmic fairness.",
"title": "FairRankVis: A Visual Analytics Framework for Exploring Algorithmic Fairness in Graph Mining Models",
"normalizedTitle": "FairRankVis: A Visual Analytics Framework for Exploring Algorithmic Fairness in Graph Mining Models",
"fno": "09552229",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Analytical Models",
"Visual Analytics",
"Machine Learning Algorithms",
"Task Analysis",
"Data Mining",
"Data Models",
"Machine Learning",
"Graph Ranking",
"Fairness",
"Visual Analytics"
],
"authors": [
{
"givenName": "Tiankai",
"surname": "Xie",
"fullName": "Tiankai Xie",
"affiliation": "Arizona State University, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuxin",
"surname": "Ma",
"fullName": "Yuxin Ma",
"affiliation": "Southern University of Science and Technology, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jian",
"surname": "Kang",
"fullName": "Jian Kang",
"affiliation": "University of Illinois at Urbana-Champaign, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanghang",
"surname": "Tong",
"fullName": "Hanghang Tong",
"affiliation": "University of Illinois at Urbana-Champaign, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ross",
"surname": "Maciejewski",
"fullName": "Ross Maciejewski",
"affiliation": "Arizona State 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": "368-377",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "mags/sp/2018/03/msp2018030034",
"title": "A Harm-Reduction Framework for Algorithmic Fairness",
"doi": null,
"abstractUrl": "/magazine/sp/2018/03/msp2018030034/13rRUwI5TW0",
"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/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": "proceedings/big-data/2022/8045/0/10020588",
"title": "InfoFair: Information-Theoretic Intersectional Fairness",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020588/1KfRBGkyZTa",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10097603",
"title": "Fairness in Graph Mining: A Survey",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10097603/1M9lHGqR5oA",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2020/8316/0/831600a182",
"title": "Metric-Free Individual Fairness with Cooperative Contextual Bandits",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2020/831600a182/1r54IOsHM0o",
"parentPublication": {
"id": "proceedings/icdm/2020/8316/0",
"title": "2020 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09377894",
"title": "BeFair: Addressing Fairness in the Banking Sector",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09377894/1s64OBfBrwI",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/euros&p/2021/1491/0/149100a292",
"title": "On the Privacy Risks of Algorithmic Fairness",
"doi": null,
"abstractUrl": "/proceedings-article/euros&p/2021/149100a292/1yg1gS8yxq0",
"parentPublication": {
"id": "proceedings/euros&p/2021/1491/0",
"title": "2021 IEEE European Symposium on Security and Privacy (EuroS&P)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552899",
"articleId": "1xicaOuuM8w",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09555810",
"articleId": "1xlw2uJhEXe",
"__typename": "AdjacentArticleType"
},
"__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": "13rRUxE04tG",
"doi": "10.1109/TVCG.2016.2598471",
"abstract": "Despite the recent popularity of visual analytics focusing on big data, little is known about how to support users that use visualization techniques to explore multi-dimensional datasets and accomplish specific tasks. Our lack of models that can assist end-users during the data exploration process has made it challenging to learn from the user's interactive and analytical process. The ability to model how a user interacts with a specific visualization technique and what difficulties they face are paramount in supporting individuals with discovering new patterns within their complex datasets. This paper introduces the notion of visualization systems understanding and modeling user interactions with the intent of guiding a user through a task thereby enhancing visual data exploration. The challenges faced and the necessary future steps to take are discussed; and to provide a working example, a grammar-based model is presented that can learn from user interactions, determine the common patterns among a number of subjects using a K-Reversible algorithm, build a set of rules, and apply those rules in the form of suggestions to new users with the goal of guiding them along their visual analytic process. A formal evaluation study with 300 subjects was performed showing that our grammar-based model is effective at capturing the interactive process followed by users and that further research in this area has the potential to positively impact how users interact with a visualization system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Despite the recent popularity of visual analytics focusing on big data, little is known about how to support users that use visualization techniques to explore multi-dimensional datasets and accomplish specific tasks. Our lack of models that can assist end-users during the data exploration process has made it challenging to learn from the user's interactive and analytical process. The ability to model how a user interacts with a specific visualization technique and what difficulties they face are paramount in supporting individuals with discovering new patterns within their complex datasets. This paper introduces the notion of visualization systems understanding and modeling user interactions with the intent of guiding a user through a task thereby enhancing visual data exploration. The challenges faced and the necessary future steps to take are discussed; and to provide a working example, a grammar-based model is presented that can learn from user interactions, determine the common patterns among a number of subjects using a K-Reversible algorithm, build a set of rules, and apply those rules in the form of suggestions to new users with the goal of guiding them along their visual analytic process. A formal evaluation study with 300 subjects was performed showing that our grammar-based model is effective at capturing the interactive process followed by users and that further research in this area has the potential to positively impact how users interact with a visualization system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Despite the recent popularity of visual analytics focusing on big data, little is known about how to support users that use visualization techniques to explore multi-dimensional datasets and accomplish specific tasks. Our lack of models that can assist end-users during the data exploration process has made it challenging to learn from the user's interactive and analytical process. The ability to model how a user interacts with a specific visualization technique and what difficulties they face are paramount in supporting individuals with discovering new patterns within their complex datasets. This paper introduces the notion of visualization systems understanding and modeling user interactions with the intent of guiding a user through a task thereby enhancing visual data exploration. The challenges faced and the necessary future steps to take are discussed; and to provide a working example, a grammar-based model is presented that can learn from user interactions, determine the common patterns among a number of subjects using a K-Reversible algorithm, build a set of rules, and apply those rules in the form of suggestions to new users with the goal of guiding them along their visual analytic process. A formal evaluation study with 300 subjects was performed showing that our grammar-based model is effective at capturing the interactive process followed by users and that further research in this area has the potential to positively impact how users interact with a visualization system.",
"title": "A Grammar-based Approach for Modeling User Interactions and Generating Suggestions During the Data Exploration Process",
"normalizedTitle": "A Grammar-based Approach for Modeling User Interactions and Generating Suggestions During the Data Exploration Process",
"fno": "07534759",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Data Models",
"Automata",
"Computational Modeling",
"Analytical Models",
"Visual Analytics",
"Machine Learning",
"Visual Analytics",
"User Interactions",
"Analytic Provenance"
],
"authors": [
{
"givenName": "Filip",
"surname": "Dabek",
"fullName": "Filip Dabek",
"affiliation": "National Intrepid Center of Excellence, Walter Reed National Military Medical Center, Bethesda, MD",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jesus J",
"surname": "Caban",
"fullName": "Jesus J Caban",
"affiliation": "National Intrepid Center of Excellence, Walter Reed National Military Medical Center, Bethesda, MD",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "41-50",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2014/6227/0/07042510",
"title": "PIVE: Per-Iteration visualization environment for supporting real-time interactions with computational methods",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042510/12OmNBgz4CP",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2009/03/mcg2009030018",
"title": "Generating Synthetic Syndromic-Surveillance Data for Evaluating Visual-Analytics Techniques",
"doi": null,
"abstractUrl": "/magazine/cg/2009/03/mcg2009030018/13rRUxBrGjm",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875913",
"title": "Finding Waldo: Learning about Users from their Interactions",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875913/13rRUyv53Fr",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a001",
"title": "Exploring D3 Implementation Challenges on Stack Overflow",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a001/1J6h6awUbbG",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__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": "trans/tg/2021/02/09224186",
"title": "Competing Models: Inferring Exploration Patterns and Information Relevance via Bayesian Model Selection",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09224186/1nV8hTleAOk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a251",
"title": "Visually Analyzing and Steering Zero Shot Learning",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a251/1qRNQGu8try",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a131",
"title": "Encodable: Configurable Grammar for Visualization Components",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a131/1qRNXTuFymI",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__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"
}
],
"adjacentArticles": {
"previous": {
"fno": "07534849",
"articleId": "13rRUILLkDW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07534792",
"articleId": "13rRUxDIthg",
"__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": "13rRUxOveck",
"doi": "10.1109/MCG.2015.91",
"abstract": "The success of visual analytics is predicated on the ability of users to interactively explore information. Humans think about their data through interactive visual exploration, including testing hypotheses, exploring anomalies, and other cognitive processes of building understanding from data. The claim that these insights are generated as a result of the interaction led the attendees at the Pacific Northwest National Laboratory (PNNL) workshop on \"Semantic Interaction: Coupling Cognition and Computation through Usable Interactive Analytics\" to posit that user interaction must play a more central role in visual analytics systems, serving as the method for coupling cognition and computation. The claims and design principles discussed in this workshop report present research directions to advance visual analytics via a user interaction approach called semantic interaction.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The success of visual analytics is predicated on the ability of users to interactively explore information. Humans think about their data through interactive visual exploration, including testing hypotheses, exploring anomalies, and other cognitive processes of building understanding from data. The claim that these insights are generated as a result of the interaction led the attendees at the Pacific Northwest National Laboratory (PNNL) workshop on \"Semantic Interaction: Coupling Cognition and Computation through Usable Interactive Analytics\" to posit that user interaction must play a more central role in visual analytics systems, serving as the method for coupling cognition and computation. The claims and design principles discussed in this workshop report present research directions to advance visual analytics via a user interaction approach called semantic interaction.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The success of visual analytics is predicated on the ability of users to interactively explore information. Humans think about their data through interactive visual exploration, including testing hypotheses, exploring anomalies, and other cognitive processes of building understanding from data. The claim that these insights are generated as a result of the interaction led the attendees at the Pacific Northwest National Laboratory (PNNL) workshop on \"Semantic Interaction: Coupling Cognition and Computation through Usable Interactive Analytics\" to posit that user interaction must play a more central role in visual analytics systems, serving as the method for coupling cognition and computation. The claims and design principles discussed in this workshop report present research directions to advance visual analytics via a user interaction approach called semantic interaction.",
"title": "Semantic Interaction: Coupling Cognition and Computation through Usable Interactive Analytics",
"normalizedTitle": "Semantic Interaction: Coupling Cognition and Computation through Usable Interactive Analytics",
"fno": "mcg2015040094",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"User Interfaces",
"Semantic Interaction",
"Usable Interactive Analytics",
"Visual Analytics",
"Visual Exploration",
"Pacific Northwest National Laboratory",
"PNNL Workshop",
"User Interaction",
"Visual Analytics",
"Computational Modeling",
"Semantics",
"Analytical Models",
"Data Models",
"Cognition",
"Computer Graphics",
"Visualization",
"Visual Analytics",
"Information Visualization",
"Semantic Interaction",
"Sensemaking"
],
"authors": [
{
"givenName": "Alex",
"surname": "Endert",
"fullName": "Alex Endert",
"affiliation": "Georgia Tech",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Remco",
"surname": "Chang",
"fullName": "Remco Chang",
"affiliation": "Tufts University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chris",
"surname": "North",
"fullName": "Chris North",
"affiliation": "Virginia Tech",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michelle",
"surname": "Zhou",
"fullName": "Michelle Zhou",
"affiliation": "Juji",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2015-07-01 00:00:00",
"pubType": "mags",
"pages": "94-99",
"year": "2015",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/2011/9618/0/05718616",
"title": "Pair Analytics: Capturing Reasoning Processes in Collaborative Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2011/05718616/12OmNvAiShB",
"parentPublication": {
"id": "proceedings/hicss/2011/9618/0",
"title": "2011 44th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2011/9618/0/05718615",
"title": "Expanding the Scope: Interaction Design Perspectives for Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2011/05718615/12OmNxGSm6x",
"parentPublication": {
"id": "proceedings/hicss/2011/9618/0",
"title": "2011 44th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a352",
"title": "Visualization for Visual Analytics: Micro-visualization, Abstraction, and Physical Appeal",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a352/12OmNySG3Oy",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2016/5670/0/5670b427",
"title": "Mixed-Initiative for Big Data: The Intersection of Human + Visual Analytics + Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670b427/12OmNzVGcUy",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2014/3922/0/07044486",
"title": "Visual learning analytics techniques applied in software engineering subjects",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2014/07044486/12OmNzuIjh4",
"parentPublication": {
"id": "proceedings/fie/2014/3922/0",
"title": "2014 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122908",
"title": "The User Puzzle—Explaining the Interaction with Visual Analytics Systems",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122908/13rRUIIVlcH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2014/04/mcg2014040008",
"title": "Semantic Interaction for Visual Analytics: Toward Coupling Cognition and Computation",
"doi": null,
"abstractUrl": "/magazine/cg/2014/04/mcg2014040008/13rRUwwslv3",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2010/05/mcg2010050018",
"title": "Guest Editors' Introduction: Multimedia Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2010/05/mcg2010050018/13rRUxCRFQg",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2018/9194/0/08533893",
"title": "Building Multiple Coordinated Spaces for Effective Immersive Analytics through Distributed Cognition",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2018/08533893/17D45Wuc3a3",
"parentPublication": {
"id": "proceedings/bdva/2018/9194/0",
"title": "2018 International Symposium on Big Data Visual and Immersive Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlui/2019/4064/0/10075565",
"title": "DeepVA: Bridging Cognition and Computation through Semantic Interaction and Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/mlui/2019/10075565/1LIRvsHYwsE",
"parentPublication": {
"id": "proceedings/mlui/2019/4064/0",
"title": "2019 IEEE Workshop on Machine Learning from User Interaction for Visualization and Analytics (MLUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2015040082",
"articleId": "13rRUwh80Nt",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2015040100",
"articleId": "13rRUyp7tZa",
"__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": "17D45VsBU48",
"doi": "10.1109/TVCG.2018.2864825",
"abstract": "The results of anomaly detection are sensitive to the choice of detection algorithms as they are specialized for different properties of data, especially for multidimensional data. Thus, it is vital to select the algorithm appropriately. To systematically select the algorithms, ensemble analysis techniques have been developed to support the assembly and comparison of heterogeneous algorithms. However, challenges remain due to the absence of the ground truth, interpretation, or evaluation of these anomaly detectors. In this paper, we present a visual analytics system named EnsembleLens that evaluates anomaly detection algorithms based on the ensemble analysis process. The system visualizes the ensemble processes and results by a set of novel visual designs and multiple coordinated contextual views to meet the requirements of correlation analysis, assessment and reasoning of anomaly detection algorithms. We also introduce an interactive analysis workflow that dynamically produces contextualized and interpretable data summaries that allow further refinements of exploration results based on user feedback. We demonstrate the effectiveness of EnsembleLens through a quantitative evaluation, three case studies with real-world data and interviews with two domain experts.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The results of anomaly detection are sensitive to the choice of detection algorithms as they are specialized for different properties of data, especially for multidimensional data. Thus, it is vital to select the algorithm appropriately. To systematically select the algorithms, ensemble analysis techniques have been developed to support the assembly and comparison of heterogeneous algorithms. However, challenges remain due to the absence of the ground truth, interpretation, or evaluation of these anomaly detectors. In this paper, we present a visual analytics system named EnsembleLens that evaluates anomaly detection algorithms based on the ensemble analysis process. The system visualizes the ensemble processes and results by a set of novel visual designs and multiple coordinated contextual views to meet the requirements of correlation analysis, assessment and reasoning of anomaly detection algorithms. We also introduce an interactive analysis workflow that dynamically produces contextualized and interpretable data summaries that allow further refinements of exploration results based on user feedback. We demonstrate the effectiveness of EnsembleLens through a quantitative evaluation, three case studies with real-world data and interviews with two domain experts.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The results of anomaly detection are sensitive to the choice of detection algorithms as they are specialized for different properties of data, especially for multidimensional data. Thus, it is vital to select the algorithm appropriately. To systematically select the algorithms, ensemble analysis techniques have been developed to support the assembly and comparison of heterogeneous algorithms. However, challenges remain due to the absence of the ground truth, interpretation, or evaluation of these anomaly detectors. In this paper, we present a visual analytics system named EnsembleLens that evaluates anomaly detection algorithms based on the ensemble analysis process. The system visualizes the ensemble processes and results by a set of novel visual designs and multiple coordinated contextual views to meet the requirements of correlation analysis, assessment and reasoning of anomaly detection algorithms. We also introduce an interactive analysis workflow that dynamically produces contextualized and interpretable data summaries that allow further refinements of exploration results based on user feedback. We demonstrate the effectiveness of EnsembleLens through a quantitative evaluation, three case studies with real-world data and interviews with two domain experts.",
"title": "EnsembleLens: Ensemble-based Visual Exploration of Anomaly Detection Algorithms with Multidimensional Data",
"normalizedTitle": "EnsembleLens: Ensemble-based Visual Exploration of Anomaly Detection Algorithms with Multidimensional Data",
"fno": "08440102",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Ensemble Lens",
"Visual Exploration",
"Anomaly Detection Algorithms",
"Multidimensional Data",
"Ensemble Analysis Techniques",
"Heterogeneous Algorithms",
"Anomaly Detectors",
"Ensemble Analysis Process",
"Ensemble Processes",
"Interpretable Data Summaries",
"Visual Analytic System",
"Anomaly Detection",
"Correlation",
"Data Visualization",
"Detectors",
"Visual Analytics",
"Feature Extraction",
"Algorithm Evaluation",
"Ensemble Analysis",
"Anomaly Detection",
"Visual Analysis",
"Multidimensional Data"
],
"authors": [
{
"givenName": "Ke",
"surname": "Xu",
"fullName": "Ke Xu",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Meng",
"surname": "Xia",
"fullName": "Meng Xia",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xing",
"surname": "Mu",
"fullName": "Xing Mu",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yun",
"surname": "Wang",
"fullName": "Yun Wang",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nan",
"surname": "Cao",
"fullName": "Nan Cao",
"affiliation": "iDVx LabTongji University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "109-119",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2018/1424/0/142401a150",
"title": "Visual Analysis of Collective Anomalies Through High-Order Correlation Graph",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2018/142401a150/12OmNym2c5B",
"parentPublication": {
"id": "proceedings/pacificvis/2018/1424/0",
"title": "2018 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2010/4256/0/4256a953",
"title": "Anomaly Detection Using an Ensemble of Feature Models",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2010/4256a953/12OmNzb7Zkv",
"parentPublication": {
"id": "proceedings/icdm/2010/4256/0",
"title": "2010 IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/07/08587186",
"title": "Visual Analysis of Collective Anomalies Using Faceted High-Order Correlation Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2020/07/08587186/17D45Vw15wQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2021/3902/0/09671994",
"title": "Anomaly detection of high-dimensional sparse data based on Ensemble Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2021/09671994/1A8hbtEBZS0",
"parentPublication": {
"id": "proceedings/big-data/2021/3902/0",
"title": "2021 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/06/09965739",
"title": "Supervised Anomaly Detection via Conditional Generative Adversarial Network and Ensemble Active Learning",
"doi": null,
"abstractUrl": "/journal/tp/2023/06/09965739/1IHMNRyHTMs",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdcat/2022/6090/0/609000a180",
"title": "Anomaly detection of high-dimensional data based on Ensemble GANs with Dropout",
"doi": null,
"abstractUrl": "/proceedings-article/bdcat/2022/609000a180/1Lu4dM1rzJm",
"parentPublication": {
"id": "proceedings/bdcat/2022/6090/0",
"title": "2022 IEEE/ACM International Conference on Big Data Computing, Applications and Technologies (BDCAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006249",
"title": "Smart Home IoT Anomaly Detection based on Ensemble Model Learning From Heterogeneous Data",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006249/1hJrI8WHCrm",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2020/9360/0/09150635",
"title": "Unsupervised Ensemble-Kernel Principal Component Analysis for Hyperspectral Anomaly Detection",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09150635/1lPHo66hsgo",
"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/ithings-greencom-cpscom-smartdata-cybermatics/2020/7647/0/764700a264",
"title": "A semi-supervised dynamic ensemble algorithm for IoT anomaly detection",
"doi": null,
"abstractUrl": "/proceedings-article/ithings-greencom-cpscom-smartdata-cybermatics/2020/764700a264/1pVHi7qPWJa",
"parentPublication": {
"id": "proceedings/ithings-greencom-cpscom-smartdata-cybermatics/2020/7647/0",
"title": "2020 International Conferences on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData) and IEEE Congress on Cybermatics (Cybermatics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09378315",
"title": "Deep Anomaly Detection with Ensemble-Based Active Learning",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09378315/1s64qptGUCc",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440839",
"articleId": "17D45XfSEST",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440831",
"articleId": "17D45Wc1ILJ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFq6",
"name": "ttg201901-08440102s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08440102s1.zip",
"extension": "zip",
"size": "116 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": "1GZokLgYdTW",
"doi": "10.1109/TVCG.2022.3209477",
"abstract": "Temporal (or time-evolving) networks are commonly used to model complex systems and the evolution of their components throughout time. Although these networks can be analyzed by different means, visual analytics stands out as an effective way for a pre-analysis before doing quantitative/statistical analyses to identify patterns, anomalies, and other behaviors in the data, thus leading to new insights and better decision-making. However, the large number of nodes, edges, and/or timestamps in many real-world networks may lead to polluted layouts that make the analysis inefficient or even infeasible. In this paper, we propose LargeNetVis, a web-based visual analytics system designed to assist in analyzing small and large temporal networks. It successfully achieves this goal by leveraging three taxonomies focused on network communities to guide the visual exploration process. The system is composed of four interactive visual components: the first (Taxonomy Matrix) presents a summary of the network characteristics, the second (Global View) gives an overview of the network evolution, the third (a node-link diagram) enables community- and node-level structural analysis, and the fourth (a Temporal Activity Map – TAM) shows the community- and node-level activity under a temporal perspective. We demonstrate the usefulness and effectiveness of LargeNetVis through two usage scenarios and a user study with 14 participants.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Temporal (or time-evolving) networks are commonly used to model complex systems and the evolution of their components throughout time. Although these networks can be analyzed by different means, visual analytics stands out as an effective way for a pre-analysis before doing quantitative/statistical analyses to identify patterns, anomalies, and other behaviors in the data, thus leading to new insights and better decision-making. However, the large number of nodes, edges, and/or timestamps in many real-world networks may lead to polluted layouts that make the analysis inefficient or even infeasible. In this paper, we propose LargeNetVis, a web-based visual analytics system designed to assist in analyzing small and large temporal networks. It successfully achieves this goal by leveraging three taxonomies focused on network communities to guide the visual exploration process. The system is composed of four interactive visual components: the first (Taxonomy Matrix) presents a summary of the network characteristics, the second (Global View) gives an overview of the network evolution, the third (a node-link diagram) enables community- and node-level structural analysis, and the fourth (a Temporal Activity Map – TAM) shows the community- and node-level activity under a temporal perspective. We demonstrate the usefulness and effectiveness of LargeNetVis through two usage scenarios and a user study with 14 participants.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Temporal (or time-evolving) networks are commonly used to model complex systems and the evolution of their components throughout time. Although these networks can be analyzed by different means, visual analytics stands out as an effective way for a pre-analysis before doing quantitative/statistical analyses to identify patterns, anomalies, and other behaviors in the data, thus leading to new insights and better decision-making. However, the large number of nodes, edges, and/or timestamps in many real-world networks may lead to polluted layouts that make the analysis inefficient or even infeasible. In this paper, we propose LargeNetVis, a web-based visual analytics system designed to assist in analyzing small and large temporal networks. It successfully achieves this goal by leveraging three taxonomies focused on network communities to guide the visual exploration process. The system is composed of four interactive visual components: the first (Taxonomy Matrix) presents a summary of the network characteristics, the second (Global View) gives an overview of the network evolution, the third (a node-link diagram) enables community- and node-level structural analysis, and the fourth (a Temporal Activity Map – TAM) shows the community- and node-level activity under a temporal perspective. We demonstrate the usefulness and effectiveness of LargeNetVis through two usage scenarios and a user study with 14 participants.",
"title": "LargeNetVis: Visual Exploration of Large Temporal Networks Based on Community Taxonomies",
"normalizedTitle": "LargeNetVis: Visual Exploration of Large Temporal Networks Based on Community Taxonomies",
"fno": "09903295",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Graph Theory",
"Interactive Systems",
"Internet",
"Mathematics Computing",
"Network Theory Graphs",
"Community Taxonomies",
"Global View",
"Interactive Visual Components",
"Large Net Vis",
"Network Characteristics",
"Network Communities",
"Network Evolution",
"Node Level Activity",
"Node Level Structural Analysis",
"Node Link Diagram",
"TAM",
"Taxonomy Matrix",
"Temporal Activity Map",
"Temporal Networks",
"Visual Exploration Process",
"Web Based Visual Analytics System",
"Taxonomy",
"Layout",
"Animation",
"Stars",
"Visual Analytics",
"Task Analysis",
"Scalability",
"Temporal Networks",
"Dynamic Graphs",
"Network Visualization",
"Visual Scalability",
"Community Taxonomy"
],
"authors": [
{
"givenName": "Claudio D. G.",
"surname": "Linhares",
"fullName": "Claudio D. G. Linhares",
"affiliation": "Institute of Mathematics and Computer Sciences, University of São Paulo, São Carlos, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean R.",
"surname": "Ponciano",
"fullName": "Jean R. Ponciano",
"affiliation": "School of Applied Mathematics, Fundação Getulio Vargas, Rio de Janeiro, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Diogenes S.",
"surname": "Pedro",
"fullName": "Diogenes S. Pedro",
"affiliation": "Institute of Mathematics and Computer Sciences, University of São Paulo, São Carlos, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luis E. C.",
"surname": "Rocha",
"fullName": "Luis E. C. Rocha",
"affiliation": "Department of Economics & Department of Physics and Astronomy, Ghent University, Belgium",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Agma J. M.",
"surname": "Traina",
"fullName": "Agma J. M. Traina",
"affiliation": "Institute of Mathematics and Computer Sciences, University of São Paulo, São Carlos, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jorge",
"surname": "Poco",
"fullName": "Jorge Poco",
"affiliation": "School of Applied Mathematics, Fundação Getulio Vargas, Rio de Janeiro, Brazil",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "203-213",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2012/4752/0/06400514",
"title": "Big data exploration through visual analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400514/12OmNC3XhwY",
"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/hicss/2011/9618/0/05718613",
"title": "Describing Temporal Correlation Spatially in a Visual Analytics Environment",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2011/05718613/12OmNvpNIoc",
"parentPublication": {
"id": "proceedings/hicss/2011/9618/0",
"title": "2011 44th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2013/4797/0/06596142",
"title": "Visual task solution strategies in tree diagrams",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596142/12OmNxWcHdG",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/09/08054703",
"title": "VAUD: A Visual Analysis Approach for Exploring Spatio-Temporal Urban Data",
"doi": null,
"abstractUrl": "/journal/tg/2018/09/08054703/13rRUxlgxOq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi/2018/7325/0/732500a342",
"title": "Visual Analytics Interface for Time Series Data Based on Trajectory Manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/wi/2018/732500a342/17D45WODasq",
"parentPublication": {
"id": "proceedings/wi/2018/7325/0",
"title": "2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/07/08580402",
"title": "Exploring Evolution of Dynamic Networks via Diachronic Node Embeddings",
"doi": null,
"abstractUrl": "/journal/tg/2020/07/08580402/17D45XacGi5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2018/9194/0/08534025",
"title": "Towards Visual Exploration of Large Temporal Datasets",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2018/08534025/17D45XoXP4N",
"parentPublication": {
"id": "proceedings/bdva/2018/9194/0",
"title": "2018 International Symposium on Big Data Visual and Immersive Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09745848",
"title": "A Model for Types and Levels of Automation in Visual Analytics: a Survey, a Taxonomy, and Examples",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09745848/1CbVnSejsjK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a241",
"title": "Visual Exploration of Topics in Multimedia News Corpora",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a241/1cMF96AZvpu",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222072",
"title": "Multiscale Snapshots: Visual Analysis of Temporal Summaries in Dynamic Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222072/1nTqwNTE1AQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09904436",
"articleId": "1H1gs021YFa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09904890",
"articleId": "1H2kZnprMty",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1J9yDgk2fV6",
"name": "ttg202301-09903295s1-supp2-3209477.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09903295s1-supp2-3209477.mp4",
"extension": "mp4",
"size": "27.3 MB",
"__typename": "WebExtraType"
},
{
"id": "1J9yD35pUSA",
"name": "ttg202301-09903295s1-supp1-3209477.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09903295s1-supp1-3209477.pdf",
"extension": "pdf",
"size": "5.55 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": "1nV8hTleAOk",
"doi": "10.1109/TVCG.2020.3030430",
"abstract": "Analyzing interaction data provides an opportunity to learn about users, uncover their underlying goals, and create intelligent visualization systems. The first step for intelligent response in visualizations is to enable computers to infer user goals and strategies through observing their interactions with a system. Researchers have proposed multiple techniques to model users, however, their frameworks often depend on the visualization design, interaction space, and dataset. Due to these dependencies, many techniques do not provide a general algorithmic solution to user exploration modeling. In this paper, we construct a series of models based on the dataset and pose user exploration modeling as a Bayesian model selection problem where we maintain a belief over numerous competing models that could explain user interactions. Each of these competing models represent an exploration strategy the user could adopt during a session. The goal of our technique is to make high-level and in-depth inferences about the user by observing their low-level interactions. Although our proposed idea is applicable to various probabilistic model spaces, we demonstrate a specific instance of encoding exploration patterns as competing models to infer information relevance. We validate our technique's ability to infer exploration bias, predict future interactions, and summarize an analytic session using user study datasets. Our results indicate that depending on the application, our method outperforms established baselines for bias detection and future interaction prediction. Finally, we discuss future research directions based on our proposed modeling paradigm and suggest how practitioners can use this method to build intelligent visualization systems that understand users' goals and adapt to improve the exploration process.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Analyzing interaction data provides an opportunity to learn about users, uncover their underlying goals, and create intelligent visualization systems. The first step for intelligent response in visualizations is to enable computers to infer user goals and strategies through observing their interactions with a system. Researchers have proposed multiple techniques to model users, however, their frameworks often depend on the visualization design, interaction space, and dataset. Due to these dependencies, many techniques do not provide a general algorithmic solution to user exploration modeling. In this paper, we construct a series of models based on the dataset and pose user exploration modeling as a Bayesian model selection problem where we maintain a belief over numerous competing models that could explain user interactions. Each of these competing models represent an exploration strategy the user could adopt during a session. The goal of our technique is to make high-level and in-depth inferences about the user by observing their low-level interactions. Although our proposed idea is applicable to various probabilistic model spaces, we demonstrate a specific instance of encoding exploration patterns as competing models to infer information relevance. We validate our technique's ability to infer exploration bias, predict future interactions, and summarize an analytic session using user study datasets. Our results indicate that depending on the application, our method outperforms established baselines for bias detection and future interaction prediction. Finally, we discuss future research directions based on our proposed modeling paradigm and suggest how practitioners can use this method to build intelligent visualization systems that understand users' goals and adapt to improve the exploration process.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Analyzing interaction data provides an opportunity to learn about users, uncover their underlying goals, and create intelligent visualization systems. The first step for intelligent response in visualizations is to enable computers to infer user goals and strategies through observing their interactions with a system. Researchers have proposed multiple techniques to model users, however, their frameworks often depend on the visualization design, interaction space, and dataset. Due to these dependencies, many techniques do not provide a general algorithmic solution to user exploration modeling. In this paper, we construct a series of models based on the dataset and pose user exploration modeling as a Bayesian model selection problem where we maintain a belief over numerous competing models that could explain user interactions. Each of these competing models represent an exploration strategy the user could adopt during a session. The goal of our technique is to make high-level and in-depth inferences about the user by observing their low-level interactions. Although our proposed idea is applicable to various probabilistic model spaces, we demonstrate a specific instance of encoding exploration patterns as competing models to infer information relevance. We validate our technique's ability to infer exploration bias, predict future interactions, and summarize an analytic session using user study datasets. Our results indicate that depending on the application, our method outperforms established baselines for bias detection and future interaction prediction. Finally, we discuss future research directions based on our proposed modeling paradigm and suggest how practitioners can use this method to build intelligent visualization systems that understand users' goals and adapt to improve the exploration process.",
"title": "Competing Models: Inferring Exploration Patterns and Information Relevance via Bayesian Model Selection",
"normalizedTitle": "Competing Models: Inferring Exploration Patterns and Information Relevance via Bayesian Model Selection",
"fno": "09224186",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Bayes Methods",
"Data Visualisation",
"Human Computer Interaction",
"Interactive Systems",
"Learning Artificial Intelligence",
"Exploration Process",
"Modeling Paradigm",
"Bias Detection",
"User Study Datasets",
"Exploration Bias",
"Probabilistic Model Spaces",
"Low Level Interactions",
"Exploration Strategy",
"User Interactions",
"Bayesian Model Selection Problem",
"User Exploration Modeling",
"Interaction Space",
"Visualization Design",
"User Goals",
"Intelligent Visualization Systems",
"Interaction Data",
"Information Relevance",
"Exploration Patterns",
"Data Visualization",
"Hidden Markov Models",
"Data Models",
"Visual Analytics",
"Analytical Models",
"Bayes Methods",
"Task Analysis",
"User Interaction Modeling",
"Bayesian Machine Learning"
],
"authors": [
{
"givenName": "Shayan",
"surname": "Monadjemi",
"fullName": "Shayan Monadjemi",
"affiliation": "Washington University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roman",
"surname": "Garnett",
"fullName": "Roman Garnett",
"affiliation": "Washington University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alvitta",
"surname": "Ottley",
"fullName": "Alvitta Ottley",
"affiliation": "Washington University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "412-421",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isuc/2008/3433/0/3433a390",
"title": "Inferring User Interests from Relevance Feedback with High Similarity Sequence Data-Driven Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/isuc/2008/3433a390/12OmNAPSMkF",
"parentPublication": {
"id": "proceedings/isuc/2008/3433/0",
"title": "2008 Second International Symposium on Universal Communication",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse/2014/7981/0/7981a527",
"title": "A Bayesian Nonparametric Topic Model for User Interest Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/cse/2014/7981a527/12OmNyO8tMr",
"parentPublication": {
"id": "proceedings/cse/2014/7981/0",
"title": "2014 IEEE 17th International Conference on Computational Science and Engineering (CSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07534759",
"title": "A Grammar-based Approach for Modeling User Interactions and Generating Suggestions During the Data Exploration Process",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07534759/13rRUxE04tG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccabs/2018/8520/0/08542086",
"title": "Inferring Relationships in Microbiomes from Signed Bayesian Networks",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2018/08542086/17D45WHONh4",
"parentPublication": {
"id": "proceedings/iccabs/2018/8520/0",
"title": "2018 IEEE 8th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2018/9159/0/08594893",
"title": "Collapsed Variational Inference for Nonparametric Bayesian Group Factor Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2018/08594893/17D45WHONnn",
"parentPublication": {
"id": "proceedings/icdm/2018/9159/0",
"title": "2018 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903515",
"title": "A Unified Comparison of User Modeling Techniques for Predicting Data Interaction and Detecting Exploration Bias",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903515/1GZokjZcWFq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlui/2018/4063/0/10075559",
"title": "Speculative Execution for Guided Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/mlui/2018/10075559/1LIRzgCUp7a",
"parentPublication": {
"id": "proceedings/mlui/2018/4063/0",
"title": "2018 IEEE Workshop on Machine Learning from User Interaction for Visualization and Analytics (MLUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800g224",
"title": "Bayesian Adversarial Human Motion Synthesis",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800g224/1m3o39RokXS",
"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/tg/2021/02/09222294",
"title": "Visual Causality Analysis of Event Sequence Data",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222294/1nTqOCPOdTq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scc/2020/8789/0/878900a060",
"title": "BSE-MAML: Model Agnostic Meta-Reinforcement Learning via Bayesian Structured Exploration",
"doi": null,
"abstractUrl": "/proceedings-article/scc/2020/878900a060/1pttYXBgHPa",
"parentPublication": {
"id": "proceedings/scc/2020/8789/0",
"title": "2020 IEEE International Conference on Services Computing (SCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222038",
"articleId": "1nTq1lYLbEY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09230430",
"articleId": "1o3nARHsQes",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLhVtZUYg0",
"name": "ttg202102-09224186s1-supp1-3030430.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09224186s1-supp1-3030430.pdf",
"extension": "pdf",
"size": "121 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": "1o3nARHsQes",
"doi": "10.1109/TVCG.2020.3030383",
"abstract": "In this paper, we introduce 11-20 (Image Insight 2020), a multimedia analytics approach for analytic categorization of image collections. Advanced visualizations for image collections exist, but they need tight integration with a machine model to support the task of analytic categorization. Directly employing computer vision and interactive learning techniques gravitates towards search. Analytic categorization, however, is not machine classification (the difference between the two is called the pragmatic gap): a human adds/redefines/deletes categories of relevance on the fly to build insight, whereas the machine classifier is rigid and non-adaptive. Analytic categorization that truly brings the user to insight requires a flexible machine model that allows dynamic sliding on the exploration-search axis, as well as semantic interactions: a human thinks about image data mostly in semantic terms. 11-20 brings three major contributions to multimedia analytics on image collections and towards closing the pragmatic gap. Firstly, a new machine model that closely follows the user's interactions and dynamically models her categories of relevance. II-20's machine model, in addition to matching and exceeding the state of the art's ability to produce relevant suggestions, allows the user to dynamically slide on the exploration-search axis without any additional input from her side. Secondly, the dynamic, 1-image-at-a-time Tetris metaphor that synergizes with the model. It allows a well-trained model to analyze the collection by itself with minimal interaction from the user and complements the classic grid metaphor. Thirdly, the fast-forward interaction, allowing the user to harness the model to quickly expand (“fast-forward”) the categories of relevance, expands the multimedia analytics semantic interaction dictionary. Automated experiments show that II-20's machine model outperforms the existing state of the art and also demonstrate the Tetris metaphor's analytic quality. User studies further confirm that II-20 is an intuitive, efficient, and effective multimedia analytics tool.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we introduce 11-20 (Image Insight 2020), a multimedia analytics approach for analytic categorization of image collections. Advanced visualizations for image collections exist, but they need tight integration with a machine model to support the task of analytic categorization. Directly employing computer vision and interactive learning techniques gravitates towards search. Analytic categorization, however, is not machine classification (the difference between the two is called the pragmatic gap): a human adds/redefines/deletes categories of relevance on the fly to build insight, whereas the machine classifier is rigid and non-adaptive. Analytic categorization that truly brings the user to insight requires a flexible machine model that allows dynamic sliding on the exploration-search axis, as well as semantic interactions: a human thinks about image data mostly in semantic terms. 11-20 brings three major contributions to multimedia analytics on image collections and towards closing the pragmatic gap. Firstly, a new machine model that closely follows the user's interactions and dynamically models her categories of relevance. II-20's machine model, in addition to matching and exceeding the state of the art's ability to produce relevant suggestions, allows the user to dynamically slide on the exploration-search axis without any additional input from her side. Secondly, the dynamic, 1-image-at-a-time Tetris metaphor that synergizes with the model. It allows a well-trained model to analyze the collection by itself with minimal interaction from the user and complements the classic grid metaphor. Thirdly, the fast-forward interaction, allowing the user to harness the model to quickly expand (“fast-forward”) the categories of relevance, expands the multimedia analytics semantic interaction dictionary. Automated experiments show that II-20's machine model outperforms the existing state of the art and also demonstrate the Tetris metaphor's analytic quality. User studies further confirm that II-20 is an intuitive, efficient, and effective multimedia analytics tool.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we introduce 11-20 (Image Insight 2020), a multimedia analytics approach for analytic categorization of image collections. Advanced visualizations for image collections exist, but they need tight integration with a machine model to support the task of analytic categorization. Directly employing computer vision and interactive learning techniques gravitates towards search. Analytic categorization, however, is not machine classification (the difference between the two is called the pragmatic gap): a human adds/redefines/deletes categories of relevance on the fly to build insight, whereas the machine classifier is rigid and non-adaptive. Analytic categorization that truly brings the user to insight requires a flexible machine model that allows dynamic sliding on the exploration-search axis, as well as semantic interactions: a human thinks about image data mostly in semantic terms. 11-20 brings three major contributions to multimedia analytics on image collections and towards closing the pragmatic gap. Firstly, a new machine model that closely follows the user's interactions and dynamically models her categories of relevance. II-20's machine model, in addition to matching and exceeding the state of the art's ability to produce relevant suggestions, allows the user to dynamically slide on the exploration-search axis without any additional input from her side. Secondly, the dynamic, 1-image-at-a-time Tetris metaphor that synergizes with the model. It allows a well-trained model to analyze the collection by itself with minimal interaction from the user and complements the classic grid metaphor. Thirdly, the fast-forward interaction, allowing the user to harness the model to quickly expand (“fast-forward”) the categories of relevance, expands the multimedia analytics semantic interaction dictionary. Automated experiments show that II-20's machine model outperforms the existing state of the art and also demonstrate the Tetris metaphor's analytic quality. User studies further confirm that II-20 is an intuitive, efficient, and effective multimedia analytics tool.",
"title": "II-20: Intelligent and pragmatic analytic categorization of image collections",
"normalizedTitle": "II-20: Intelligent and pragmatic analytic categorization of image collections",
"fno": "09230430",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Vision",
"Data Visualisation",
"Dictionaries",
"Interactive Systems",
"Learning Artificial Intelligence",
"Multimedia Systems",
"User Interfaces",
"Pragmatic Analytic Categorization",
"Image Collections",
"Image Insight 2020",
"Multimedia Analytics Approach",
"Interactive Learning Techniques",
"Machine Classification",
"Pragmatic Gap",
"Machine Classifier",
"Flexible Machine Model",
"Exploration Search Axis",
"Image Data",
"Dynamically Models",
"Dynamic Image At A Time Tetris Metaphor",
"1 Image At A Time Tetris Metaphor",
"Multimedia Analytics Semantic Interaction Dictionary",
"Intuitive Multimedia Analytics Tool",
"Effective Multimedia Analytics Tool",
"Efficient Multimedia Analytics Tool",
"Analytical Models",
"Semantics",
"Pragmatics",
"Computational Modeling",
"Task Analysis",
"Visual Analytics",
"Multimedia Analytics",
"Image Data",
"Analytic Categorization",
"Pragmatic Gap"
],
"authors": [
{
"givenName": "Jan",
"surname": "Zahálka",
"fullName": "Jan Zahálka",
"affiliation": "Czech Technical University, Prague",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marcel",
"surname": "Worring",
"fullName": "Marcel Worring",
"affiliation": "University of Amsterdam",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jarke J.",
"surname": "Van Wijk",
"fullName": "Jarke J. Van Wijk",
"affiliation": "Eindhoven University of Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "422-431",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bdcat/2016/4617/0/6005a052",
"title": "A Visual Analytics Approach to Author Name Disambiguation",
"doi": null,
"abstractUrl": "/proceedings-article/bdcat/2016/6005a052/12OmNvjyxUp",
"parentPublication": {
"id": "proceedings/bdcat/2016/4617/0",
"title": "2016 IEEE/ACM 3rd International Conference on Big Data Computing Applications and Technologies (BDCAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2017/05/mcg2017050028",
"title": "ANALYTiC: An Active Learning System for Trajectory Classification",
"doi": null,
"abstractUrl": "/magazine/cg/2017/05/mcg2017050028/13rRUEgs2vI",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875967",
"title": "Knowledge Generation Model for Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875967/13rRUILLkvt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/06/07429778",
"title": "Coping with Volume and Variety in Temporal Event Sequences: Strategies for Sharpening Analytic Focus",
"doi": null,
"abstractUrl": "/journal/tg/2017/06/07429778/13rRUwjGoG9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2014/04/mcg2014040008",
"title": "Semantic Interaction for Visual Analytics: Toward Coupling Cognition and Computation",
"doi": null,
"abstractUrl": "/magazine/cg/2014/04/mcg2014040008/13rRUwwslv3",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2016/03/mcg2016030072",
"title": "Knowledge-Assisted Ranking: A Visual Analytic Application for Sports Event Data",
"doi": null,
"abstractUrl": "/magazine/cg/2016/03/mcg2016030072/13rRUyekIZN",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cic/2018/9502/0/950200a424",
"title": "Visual Analytics Ontology-Guided I-DE System: A Case Study of Head and Neck Cancer in Australia",
"doi": null,
"abstractUrl": "/proceedings-article/cic/2018/950200a424/17D45X0yjVB",
"parentPublication": {
"id": "proceedings/cic/2018/9502/0",
"title": "2018 IEEE 4th International Conference on Collaboration and Internet Computing (CIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2018/1174/0/08658790",
"title": "Visual Analytic Workflow to Understand Students’ Performance in Computer Science Courses",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2018/08658790/18j9pOuyFt6",
"parentPublication": {
"id": "proceedings/fie/2018/1174/0",
"title": "2018 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/annsim/2022/5288/0/09859344",
"title": "Video Analytic Data Reduction Model For Fog Computing",
"doi": null,
"abstractUrl": "/proceedings-article/annsim/2022/09859344/1G4ESPxlxks",
"parentPublication": {
"id": "proceedings/annsim/2022/5288/0",
"title": "2022 Annual Modeling and Simulation Conference (ANNSIM)",
"__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"
}
],
"adjacentArticles": {
"previous": {
"fno": "09224186",
"articleId": "1nV8hTleAOk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09286505",
"articleId": "1por3E5EhCU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLgvQ5kpQk",
"name": "ttg202102-09230430s1-supp1-3030383.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09230430s1-supp1-3030383.mp4",
"extension": "mp4",
"size": "29 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwoxSj5",
"title": "Aug.",
"year": "2017",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvya9q",
"doi": "10.1109/TVCG.2016.2607714",
"abstract": "The stated goal for visual data exploration is to operate at a rate that matches the pace of human data analysts, but the ever increasing amount of data has led to a fundamental problem: datasets are often too large to process within interactive time frames. Progressive analytics and visualizations have been proposed as potential solutions to this issue. By processing data incrementally in small chunks, progressive systems provide approximate query answers at interactive speeds that are then refined over time with increasing precision. We study how progressive visualizations affect users in exploratory settings in an experiment where we capture user behavior and knowledge discovery through interaction logs and think-aloud protocols. Our experiment includes three visualization conditions and different simulated dataset sizes. The visualization conditions are: (1) blocking, where results are displayed only after the entire dataset has been processed; (2) instantaneous, a hypothetical condition where results are shown almost immediately; and (3) progressive, where approximate results are displayed quickly and then refined over time. We analyze the data collected in our experiment and observe that users perform equally well with either instantaneous or progressive visualizations in key metrics, such as insight discovery rates and dataset coverage, while blocking visualizations have detrimental effects.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The stated goal for visual data exploration is to operate at a rate that matches the pace of human data analysts, but the ever increasing amount of data has led to a fundamental problem: datasets are often too large to process within interactive time frames. Progressive analytics and visualizations have been proposed as potential solutions to this issue. By processing data incrementally in small chunks, progressive systems provide approximate query answers at interactive speeds that are then refined over time with increasing precision. We study how progressive visualizations affect users in exploratory settings in an experiment where we capture user behavior and knowledge discovery through interaction logs and think-aloud protocols. Our experiment includes three visualization conditions and different simulated dataset sizes. The visualization conditions are: (1) blocking, where results are displayed only after the entire dataset has been processed; (2) instantaneous, a hypothetical condition where results are shown almost immediately; and (3) progressive, where approximate results are displayed quickly and then refined over time. We analyze the data collected in our experiment and observe that users perform equally well with either instantaneous or progressive visualizations in key metrics, such as insight discovery rates and dataset coverage, while blocking visualizations have detrimental effects.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The stated goal for visual data exploration is to operate at a rate that matches the pace of human data analysts, but the ever increasing amount of data has led to a fundamental problem: datasets are often too large to process within interactive time frames. Progressive analytics and visualizations have been proposed as potential solutions to this issue. By processing data incrementally in small chunks, progressive systems provide approximate query answers at interactive speeds that are then refined over time with increasing precision. We study how progressive visualizations affect users in exploratory settings in an experiment where we capture user behavior and knowledge discovery through interaction logs and think-aloud protocols. Our experiment includes three visualization conditions and different simulated dataset sizes. The visualization conditions are: (1) blocking, where results are displayed only after the entire dataset has been processed; (2) instantaneous, a hypothetical condition where results are shown almost immediately; and (3) progressive, where approximate results are displayed quickly and then refined over time. We analyze the data collected in our experiment and observe that users perform equally well with either instantaneous or progressive visualizations in key metrics, such as insight discovery rates and dataset coverage, while blocking visualizations have detrimental effects.",
"title": "How Progressive Visualizations Affect Exploratory Analysis",
"normalizedTitle": "How Progressive Visualizations Affect Exploratory Analysis",
"fno": "07563865",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Prefetching",
"Visualization",
"Measurement",
"Data Analysis",
"Histograms",
"Time Factors",
"Exploratory Analysis",
"Interactive Visualization",
"Progressive Visualization",
"Scalability",
"Insight Based Evaluation"
],
"authors": [
{
"givenName": "Emanuel",
"surname": "Zgraggen",
"fullName": "Emanuel Zgraggen",
"affiliation": "Computer Science Department, Brown University, Providence, RI",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alex",
"surname": "Galakatos",
"fullName": "Alex Galakatos",
"affiliation": "Computer Science Department, Brown University, Providence, RI",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrew",
"surname": "Crotty",
"fullName": "Andrew Crotty",
"affiliation": "Computer Science Department, Brown University, Providence, RI",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean-Daniel",
"surname": "Fekete",
"fullName": "Jean-Daniel Fekete",
"affiliation": "INRIA, Orsay, FR",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tim",
"surname": "Kraska",
"fullName": "Tim Kraska",
"affiliation": "Computer Science Department, Brown University, Providence, RI",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2017-08-01 00:00:00",
"pubType": "trans",
"pages": "1977-1987",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/edoc/2015/9203/0/9203a068",
"title": "A Description Framework for Data Visualizations in Enterprise Information Systems",
"doi": null,
"abstractUrl": "/proceedings-article/edoc/2015/9203a068/12OmNxd4tAO",
"parentPublication": {
"id": "proceedings/edoc/2015/9203/0",
"title": "2015 IEEE 19th International Enterprise Distributed Object Computing Conference (EDOC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010060943",
"title": "How Information Visualization Novices Construct Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010060943/13rRUwInvAZ",
"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/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/2019/01/08440818",
"title": "Looks Good To Me: Visualizations As Sanity Checks",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440818/17D45W2WyxG",
"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/2020/01/08809730",
"title": "P5: Portable Progressive Parallel Processing Pipelines for Interactive Data Analysis and Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08809730/1cHE2tYwF7a",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/07/08943144",
"title": "ProReveal: Progressive Visual Analytics With Safeguards",
"doi": null,
"abstractUrl": "/journal/tg/2021/07/08943144/1g3bi26D34k",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a161",
"title": "Evaluating Animated Transitions between Contiguous Visualizations for Streaming Big Data",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a161/1qRNZKxTd60",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09359504",
"title": "A Progressive Approach to Scalar Field Topology",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09359504/1rlAQHG5pao",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07530932",
"articleId": "13rRUxASubC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07493610",
"articleId": "13rRUwj7cpg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRFG",
"name": "ttg201708-07563865s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201708-07563865s1.zip",
"extension": "zip",
"size": "7.47 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": "1H0GlpjfzUc",
"doi": "10.1109/TVCG.2022.3209391",
"abstract": "Data privacy is an essential issue in publishing data visualizations. However, it is challenging to represent multiple data patterns in privacy-preserving visualizations. The prior approaches target specific chart types or perform an anonymization model uniformly without considering the importance of data patterns in visualizations. In this paper, we propose a visual analytics approach that facilitates data custodians to generate multiple private charts while maintaining user-preferred patterns. To this end, we introduce pattern constraints to model users' preferences over data patterns in the dataset and incorporate them into the proposed Bayesian network-based Differential Privacy (DP) model <italic>PriVis</italic>. A prototype system, <italic>DPVisCreator</italic>, is developed to assist data custodians in implementing our approach. The effectiveness of our approach is demonstrated with quantitative evaluation of pattern utility under the different levels of privacy protection, case studies, and semi-structured expert interviews.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data privacy is an essential issue in publishing data visualizations. However, it is challenging to represent multiple data patterns in privacy-preserving visualizations. The prior approaches target specific chart types or perform an anonymization model uniformly without considering the importance of data patterns in visualizations. In this paper, we propose a visual analytics approach that facilitates data custodians to generate multiple private charts while maintaining user-preferred patterns. To this end, we introduce pattern constraints to model users' preferences over data patterns in the dataset and incorporate them into the proposed Bayesian network-based Differential Privacy (DP) model <italic>PriVis</italic>. A prototype system, <italic>DPVisCreator</italic>, is developed to assist data custodians in implementing our approach. The effectiveness of our approach is demonstrated with quantitative evaluation of pattern utility under the different levels of privacy protection, case studies, and semi-structured expert interviews.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data privacy is an essential issue in publishing data visualizations. However, it is challenging to represent multiple data patterns in privacy-preserving visualizations. The prior approaches target specific chart types or perform an anonymization model uniformly without considering the importance of data patterns in visualizations. In this paper, we propose a visual analytics approach that facilitates data custodians to generate multiple private charts while maintaining user-preferred patterns. To this end, we introduce pattern constraints to model users' preferences over data patterns in the dataset and incorporate them into the proposed Bayesian network-based Differential Privacy (DP) model PriVis. A prototype system, DPVisCreator, is developed to assist data custodians in implementing our approach. The effectiveness of our approach is demonstrated with quantitative evaluation of pattern utility under the different levels of privacy protection, case studies, and semi-structured expert interviews.",
"title": "DPVisCreator: Incorporating Pattern Constraints to Privacy-preserving Visualizations via Differential Privacy",
"normalizedTitle": "DPVisCreator: Incorporating Pattern Constraints to Privacy-preserving Visualizations via Differential Privacy",
"fno": "09904449",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Belief Networks",
"Data Analysis",
"Data Privacy",
"Data Visualisation",
"Anonymization Model",
"Bayesian Network Based Differential Privacy",
"Chart Types",
"Data Custodians",
"Data Patterns",
"Data Privacy",
"Data Visualizations",
"DP Vis Creator",
"Pattern Constraints",
"Pattern Utility",
"Privacy Protection",
"Privacy Preserving Visualizations",
"Private Charts",
"Pri Vis",
"User Preferences",
"User Preferred Patterns",
"Visual Analytics",
"Data Visualization",
"Privacy",
"Measurement",
"Visualization",
"Data Models",
"Publishing",
"Syntactics",
"Privacy Preserving Visualization",
"Visual Analytics",
"Differential Privacy",
"Tabular Data"
],
"authors": [
{
"givenName": "Jiehui",
"surname": "Zhou",
"fullName": "Jiehui Zhou",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xumeng",
"surname": "Wang",
"fullName": "Xumeng Wang",
"affiliation": "TMCC, CS, Nankai University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jason K.",
"surname": "Wong",
"fullName": "Jason K. Wong",
"affiliation": "Hong Kong University of Science and Technology, Hong Kong, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huanliang",
"surname": "Wang",
"fullName": "Huanliang Wang",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhongwei",
"surname": "Wang",
"fullName": "Zhongwei Wang",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoyu",
"surname": "Yang",
"fullName": "Xiaoyu Yang",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoran",
"surname": "Yan",
"fullName": "Xiaoran Yan",
"affiliation": "Zhejiang Lab, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haozhe",
"surname": "Feng",
"fullName": "Haozhe Feng",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "Hong Kong University of Science and Technology, Hong Kong, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haochao",
"surname": "Ying",
"fullName": "Haochao Ying",
"affiliation": "School of Public Health, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Chen",
"fullName": "Wei Chen",
"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": "809-819",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/big-data/2014/5666/0/07004382",
"title": "Privacy-aware filter-based feature selection",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2014/07004382/12OmNxVV5VO",
"parentPublication": {
"id": "proceedings/big-data/2014/5666/0",
"title": "2014 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2014/2504/0/2504d224",
"title": "The Effect of Providing Visualizations in Privacy Policies on Trust in Data Privacy and Security",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2014/2504d224/12OmNxcdG1t",
"parentPublication": {
"id": "proceedings/hicss/2014/2504/0",
"title": "2014 47th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdew/2013/5303/0/06547433",
"title": "On syntactic anonymity and differential privacy",
"doi": null,
"abstractUrl": "/proceedings-article/icdew/2013/06547433/12OmNzmLxDi",
"parentPublication": {
"id": "proceedings/icdew/2013/5303/0",
"title": "2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2011/08/ttk2011081200",
"title": "Differential Privacy via Wavelet Transforms",
"doi": null,
"abstractUrl": "/journal/tk/2011/08/ttk2011081200/13rRUxOdD8B",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/taai/2018/1229/0/122900a106",
"title": "Privacy-Preserving SRS Data Anonymization by Incorporating Missing Values",
"doi": null,
"abstractUrl": "/proceedings-article/taai/2018/122900a106/17D45WHONhK",
"parentPublication": {
"id": "proceedings/taai/2018/1229/0",
"title": "2018 Conference on Technologies and Applications of Artificial Intelligence (TAAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vizsec/2018/8194/0/08709181",
"title": "An Empirical Study on Perceptually Masking Privacy in Graph Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/vizsec/2018/08709181/19ZL2eLPBfO",
"parentPublication": {
"id": "proceedings/vizsec/2018/8194/0",
"title": "2018 IEEE Symposium on Visualization for Cyber Security (VizSec)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903288",
"title": "Data Hunches: Incorporating Personal Knowledge into Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903288/1GZoks2MXAY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10035304",
"title": "Multi-Party Sequential Data Publishing Under Differential Privacy",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10035304/1Krc4EmQyQw",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/5555/01/10091141",
"title": "Privacy-Preserving Network Embedding against Private Link Inference Attacks",
"doi": null,
"abstractUrl": "/journal/tq/5555/01/10091141/1M2IKZfSO0o",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2020/6215/0/09313578",
"title": "Embracing Differential Privacy for Anonymizing Spontaneous ADE Reporting Data",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313578/1qmfL6gOE1O",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09904427",
"articleId": "1H1gllQLwcM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09904429",
"articleId": "1H1gjOQxk40",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1J9ysvcIcuc",
"name": "ttg202301-09904449s1-supp1-3209391.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09904449s1-supp1-3209391.mp4",
"extension": "mp4",
"size": "91.3 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": "1sVEPCiNLI4",
"doi": "10.1109/TVCG.2021.3074023",
"abstract": "When an organization chooses one course of action over alternatives, this task typically falls on a decision maker with relevant knowledge, experience, and understanding of context. Decision makers rely on data analysis, which is either delegated to analysts, or done on their own. Often the decision maker combines data, likely uncertain or incomplete, with non-formalized knowledge within a multi-objective problem space, weighing the recommendations of analysts within broader contexts and goals. As most past research in visual analytics has focused on understanding the needs and challenges of data analysts, less is known about the tasks and challenges of organizational decision makers, and how visualization support tools might help. Here we characterize the decision maker as a domain expert, review relevant literature in management theories, and report the results of an empirical survey and interviews with people who make organizational decisions. We identify challenges and opportunities for novel visualization tools, including trade-off overviews, scenario-based analysis, interrogation tools, flexible data input and collaboration support. Our findings stress the need to expand visualization design beyond data analysis into tools for information management.",
"abstracts": [
{
"abstractType": "Regular",
"content": "When an organization chooses one course of action over alternatives, this task typically falls on a decision maker with relevant knowledge, experience, and understanding of context. Decision makers rely on data analysis, which is either delegated to analysts, or done on their own. Often the decision maker combines data, likely uncertain or incomplete, with non-formalized knowledge within a multi-objective problem space, weighing the recommendations of analysts within broader contexts and goals. As most past research in visual analytics has focused on understanding the needs and challenges of data analysts, less is known about the tasks and challenges of organizational decision makers, and how visualization support tools might help. Here we characterize the decision maker as a domain expert, review relevant literature in management theories, and report the results of an empirical survey and interviews with people who make organizational decisions. We identify challenges and opportunities for novel visualization tools, including trade-off overviews, scenario-based analysis, interrogation tools, flexible data input and collaboration support. Our findings stress the need to expand visualization design beyond data analysis into tools for information management.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "When an organization chooses one course of action over alternatives, this task typically falls on a decision maker with relevant knowledge, experience, and understanding of context. Decision makers rely on data analysis, which is either delegated to analysts, or done on their own. Often the decision maker combines data, likely uncertain or incomplete, with non-formalized knowledge within a multi-objective problem space, weighing the recommendations of analysts within broader contexts and goals. As most past research in visual analytics has focused on understanding the needs and challenges of data analysts, less is known about the tasks and challenges of organizational decision makers, and how visualization support tools might help. Here we characterize the decision maker as a domain expert, review relevant literature in management theories, and report the results of an empirical survey and interviews with people who make organizational decisions. We identify challenges and opportunities for novel visualization tools, including trade-off overviews, scenario-based analysis, interrogation tools, flexible data input and collaboration support. Our findings stress the need to expand visualization design beyond data analysis into tools for information management.",
"title": "The Unmet Data Visualization Needs of Decision Makers Within Organizations",
"normalizedTitle": "The Unmet Data Visualization Needs of Decision Makers Within Organizations",
"fno": "09408391",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Decision Making",
"Information Management",
"Data Analysis",
"Data Analysts",
"Decision Maker",
"Organizational Decision Makers",
"Organizational Decisions",
"Unmet Data Visualization Needs",
"Data Visualization",
"Decision Making",
"Organizations",
"Business",
"Competitive Intelligence",
"Data Analysis",
"Uncertainty",
"Decision Making",
"Visualization",
"Interview",
"Survey",
"Organizations",
"Management",
"Business Intelligence"
],
"authors": [
{
"givenName": "Evanthia",
"surname": "Dimara",
"fullName": "Evanthia Dimara",
"affiliation": "Utrecht University, Utrecht, CS, Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Harry",
"surname": "Zhang",
"fullName": "Harry Zhang",
"affiliation": "Northwestern University, Evanston, IL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Melanie",
"surname": "Tory",
"fullName": "Melanie Tory",
"affiliation": "Tableau Software, Palo Alto, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steven",
"surname": "Franconeri",
"fullName": "Steven Franconeri",
"affiliation": "Northwestern University, Evanston, IL, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "4101-4112",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/1988/0843/3/00011931",
"title": "A framework of a decision critic and advisor",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1988/00011931/12OmNwEJ0Jb",
"parentPublication": {
"id": "proceedings/hicss/1988/0843/3",
"title": "Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cso/2012/1365/0/06274818",
"title": "Bridging Theories and Practices: An Evaluation Framework of Small and Medium Sized Enterprises' (SMEs) Decision-making in China",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2012/06274818/12OmNwekjFF",
"parentPublication": {
"id": "proceedings/cso/2012/1365/0",
"title": "2012 Fifth International Joint Conference on Computational Sciences and Optimization (CSO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/models/2015/6908/0/07338268",
"title": "Toward overcoming accidental complexity in organisational decision-making",
"doi": null,
"abstractUrl": "/proceedings-article/models/2015/07338268/12OmNxiKs2F",
"parentPublication": {
"id": "proceedings/models/2015/6908/0",
"title": "2015 ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems (MODELS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/1988/0843/3/00011883",
"title": "An investigation of performance, productivity, and rationality in multi-criteria decision making",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1988/00011883/12OmNyNzhwi",
"parentPublication": {
"id": "proceedings/hicss/1988/0843/3",
"title": "Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2014/4103/0/4103a132",
"title": "Effects of Visualizing Missing Data: An Empirical Evaluation",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2014/4103a132/12OmNzb7Zo6",
"parentPublication": {
"id": "proceedings/iv/2014/4103/0",
"title": "2014 18th International Conference on Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2014/05/mcg2014050042",
"title": "From Data to Insight: Work Practices of Analysts in the Enterprise",
"doi": null,
"abstractUrl": "/magazine/cg/2014/05/mcg2014050042/13rRUyXKxU9",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbk/2021/3858/0/385800a102",
"title": "Intuitionistic Fuzzy Requirements Aggregation for Graph Pattern Matching with Group Decision Makers",
"doi": null,
"abstractUrl": "/proceedings-article/icbk/2021/385800a102/1A9X1ZjYSnC",
"parentPublication": {
"id": "proceedings/icbk/2021/3858/0",
"title": "2021 IEEE International Conference on Big Knowledge (ICBK)",
"__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": "trans/ts/2022/05/09195777",
"title": "The Best Laid Plans or Lack Thereof: Security Decision-Making of Different Stakeholder Groups",
"doi": null,
"abstractUrl": "/journal/ts/2022/05/09195777/1n7i1bAZXfW",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09378243",
"title": "The Role of Multi-Criteria Decision-Making in a Sentry Agents Framework Utilizing Uncertainty of Information",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09378243/1s64WcbgD4Y",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09408377",
"articleId": "1sVEP6R17eU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09416829",
"articleId": "1t8VUXSYL2E",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1txPs9C3tok",
"title": "June",
"year": "2021",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1fm1QUuzRAI",
"doi": "10.1109/TVCG.2019.2956697",
"abstract": "Rendering an accurate image of an isosurface in a volumetric field typically requires large numbers of data samples. Reducing this number lies at the core of research in volume rendering. With the advent of deep learning networks, a number of architectures have been proposed recently to infer missing samples in multidimensional fields, for applications such as image super-resolution. In this article, we investigate the use of such architectures for learning the upscaling of a low resolution sampling of an isosurface to a higher resolution, with reconstruction of spatial detail and shading. We introduce a fully convolutional neural network, to learn a latent representation generating smooth, edge-aware depth and normal fields as well as ambient occlusions from a low resolution depth and normal field. By adding a frame-to-frame motion loss into the learning stage, upscaling can consider temporal variations and achieves improved frame-to-frame coherence. We assess the quality of inferred results and compare it to bi-linear and cubic upscaling. We do this for isosurfaces which were never seen during training, and investigate the improvements when the network can train on the same or similar isosurfaces. We discuss remote visualization and foveated rendering as potential applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Rendering an accurate image of an isosurface in a volumetric field typically requires large numbers of data samples. Reducing this number lies at the core of research in volume rendering. With the advent of deep learning networks, a number of architectures have been proposed recently to infer missing samples in multidimensional fields, for applications such as image super-resolution. In this article, we investigate the use of such architectures for learning the upscaling of a low resolution sampling of an isosurface to a higher resolution, with reconstruction of spatial detail and shading. We introduce a fully convolutional neural network, to learn a latent representation generating smooth, edge-aware depth and normal fields as well as ambient occlusions from a low resolution depth and normal field. By adding a frame-to-frame motion loss into the learning stage, upscaling can consider temporal variations and achieves improved frame-to-frame coherence. We assess the quality of inferred results and compare it to bi-linear and cubic upscaling. We do this for isosurfaces which were never seen during training, and investigate the improvements when the network can train on the same or similar isosurfaces. We discuss remote visualization and foveated rendering as potential applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Rendering an accurate image of an isosurface in a volumetric field typically requires large numbers of data samples. Reducing this number lies at the core of research in volume rendering. With the advent of deep learning networks, a number of architectures have been proposed recently to infer missing samples in multidimensional fields, for applications such as image super-resolution. In this article, we investigate the use of such architectures for learning the upscaling of a low resolution sampling of an isosurface to a higher resolution, with reconstruction of spatial detail and shading. We introduce a fully convolutional neural network, to learn a latent representation generating smooth, edge-aware depth and normal fields as well as ambient occlusions from a low resolution depth and normal field. By adding a frame-to-frame motion loss into the learning stage, upscaling can consider temporal variations and achieves improved frame-to-frame coherence. We assess the quality of inferred results and compare it to bi-linear and cubic upscaling. We do this for isosurfaces which were never seen during training, and investigate the improvements when the network can train on the same or similar isosurfaces. We discuss remote visualization and foveated rendering as potential applications.",
"title": "Volumetric Isosurface Rendering with Deep Learning-Based Super-Resolution",
"normalizedTitle": "Volumetric Isosurface Rendering with Deep Learning-Based Super-Resolution",
"fno": "08918030",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Image Reconstruction",
"Image Resolution",
"Image Sampling",
"Learning Artificial Intelligence",
"Neural Nets",
"Rendering Computer Graphics",
"Frame To Frame Coherence",
"Learning Stage",
"Frame To Frame Motion Loss",
"Low Resolution Depth",
"Normal Field",
"Smooth Edge Aware Depth",
"Fully Convolutional Neural Network",
"Low Resolution Sampling",
"Image Super Resolution",
"Multidimensional Fields",
"Missing Samples",
"Deep Learning Networks",
"Volume Rendering",
"Data Samples",
"Volumetric Field",
"Accurate Image",
"Deep Learning Based Super Resolution",
"Volumetric Isosurface Rendering",
"Similar Isosurfaces",
"Same Isosurfaces",
"Cubic Upscaling",
"Inferred Results",
"Isosurfaces",
"Image Reconstruction",
"Spatial Resolution",
"Signal Resolution",
"Rendering Computer Graphics",
"Training",
"Machine Learning",
"Extraction Of Surfaces Isosurfaces Material Boundaries",
"Volume Rendering"
],
"authors": [
{
"givenName": "Sebastian",
"surname": "Weiss",
"fullName": "Sebastian Weiss",
"affiliation": "Technical University of Munich, München, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mengyu",
"surname": "Chu",
"fullName": "Mengyu Chu",
"affiliation": "Technical University of Munich, München, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nils",
"surname": "Thuerey",
"fullName": "Nils Thuerey",
"affiliation": "Technical University of Munich, München, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rüdiger",
"surname": "Westermann",
"fullName": "Rüdiger Westermann",
"affiliation": "Technical University of Munich, München, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2021-06-01 00:00:00",
"pubType": "trans",
"pages": "3064-3078",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/1997/8076/0/80760330",
"title": "A new algorithm for multiresolution isosurface extraction",
"doi": null,
"abstractUrl": "/proceedings-article/iv/1997/80760330/12OmNCcbEjd",
"parentPublication": {
"id": "proceedings/iv/1997/8076/0",
"title": "Proceedings. 1997 IEEE Conference on Information Visualization (Cat. No.97TB100165)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498balmelli",
"title": "Volume Warping for Adaptive Isosurface Extraction",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498balmelli/12OmNqFJhHx",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2017/1600/0/1600a359",
"title": "Research on Multi-resolution Isosurface Extraction Method for 3D Scalar Field",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2017/1600a359/12OmNwekjAv",
"parentPublication": {
"id": "proceedings/dsc/2017/1600/0",
"title": "2017 IEEE Second International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2008/1966/0/04475455",
"title": "Interactive Exploration of Remote Isosurfaces with Point-Based Non-Photorealistic Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2008/04475455/12OmNy49sGe",
"parentPublication": {
"id": "proceedings/pacificvis/2008/1966/0",
"title": "IEEE Pacific Visualization Symposium 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031592",
"title": "Efficient GPU-accelerated computation of isosurface similarity maps",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031592/12OmNyNzhyo",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1267",
"title": "Interactive Point-based Isosurface Exploration and High-quality Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1267/13rRUxjQyhm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1259",
"title": "On Histograms and Isosurface Statistics",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1259/13rRUzp02of",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08493612",
"title": "CPU Isosurface Ray Tracing of Adaptive Mesh Refinement Data",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08493612/17D45Vw15vd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440120",
"title": "Exploring Time-Varying Multivariate Volume Data Using Matrix of Isosurface Similarity Maps",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440120/17D45Wuc38E",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09920542",
"title": "Deep Hierarchical Super Resolution for Scientific Data",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09920542/1HxSntuIBnW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08939459",
"articleId": "1fZRynxLXGM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08928535",
"articleId": "1fEi0BsQqBy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1txPt1Dez7y",
"name": "ttg202106-08918030s1-supp1-2956697.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202106-08918030s1-supp1-2956697.mp4",
"extension": "mp4",
"size": "164 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": "1hJKlSvNgo8",
"doi": "10.1109/TVCG.2020.2975801",
"abstract": "Light fields capture both the spatial and angular rays, thus enabling free-viewpoint rendering and custom selection of the focal plane. Scientists can interactively explore pre-recorded microscopic light fields of organs, microbes, and neurons using virtual reality headsets. However, rendering high-resolution light fields at interactive frame rates requires a very high rate of texture sampling, which is challenging as the resolutions of light fields and displays continue to increase. In this article, we present an efficient algorithm to visualize 4D light fields with 3D-kernel foveated rendering (3D-KFR). The 3D-KFR scheme coupled with eye-tracking has the potential to accelerate the rendering of 4D depth-cued light fields dramatically. We have developed a perceptual model for foveated light fields by extending the KFR for the rendering of 3D meshes. On datasets of high-resolution microscopic light fields, we observe 3.47×-7.28× speedup in light field rendering with minimal perceptual loss of detail. We envision that 3D-KFR will reconcile the mutually conflicting goals of visual fidelity and rendering speed for interactive visualization of light fields.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Light fields capture both the spatial and angular rays, thus enabling free-viewpoint rendering and custom selection of the focal plane. Scientists can interactively explore pre-recorded microscopic light fields of organs, microbes, and neurons using virtual reality headsets. However, rendering high-resolution light fields at interactive frame rates requires a very high rate of texture sampling, which is challenging as the resolutions of light fields and displays continue to increase. In this article, we present an efficient algorithm to visualize 4D light fields with 3D-kernel foveated rendering (3D-KFR). The 3D-KFR scheme coupled with eye-tracking has the potential to accelerate the rendering of 4D depth-cued light fields dramatically. We have developed a perceptual model for foveated light fields by extending the KFR for the rendering of 3D meshes. On datasets of high-resolution microscopic light fields, we observe 3.47×-7.28× speedup in light field rendering with minimal perceptual loss of detail. We envision that 3D-KFR will reconcile the mutually conflicting goals of visual fidelity and rendering speed for interactive visualization of light fields.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Light fields capture both the spatial and angular rays, thus enabling free-viewpoint rendering and custom selection of the focal plane. Scientists can interactively explore pre-recorded microscopic light fields of organs, microbes, and neurons using virtual reality headsets. However, rendering high-resolution light fields at interactive frame rates requires a very high rate of texture sampling, which is challenging as the resolutions of light fields and displays continue to increase. In this article, we present an efficient algorithm to visualize 4D light fields with 3D-kernel foveated rendering (3D-KFR). The 3D-KFR scheme coupled with eye-tracking has the potential to accelerate the rendering of 4D depth-cued light fields dramatically. We have developed a perceptual model for foveated light fields by extending the KFR for the rendering of 3D meshes. On datasets of high-resolution microscopic light fields, we observe 3.47×-7.28× speedup in light field rendering with minimal perceptual loss of detail. We envision that 3D-KFR will reconcile the mutually conflicting goals of visual fidelity and rendering speed for interactive visualization of light fields.",
"title": "3D-Kernel Foveated Rendering for Light Fields",
"normalizedTitle": "3D-Kernel Foveated Rendering for Light Fields",
"fno": "09007492",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Helmet Mounted Displays",
"Rendering Computer Graphics",
"Virtual Reality",
"Rendering High Resolution Light Fields",
"3 D Kernel Foveated Rendering",
"Free Viewpoint Rendering",
"Focal Plane",
"Virtual Reality Headsets",
"4 D 4 D Light Fields",
"3 D KFR",
"3 D 3 D Meshes",
"Visual Fidelity",
"Rendering Speed",
"Interactive Visualization",
"Rendering Computer Graphics",
"Microscopy",
"Kernel",
"Three Dimensional Displays",
"Visualization",
"Acceleration",
"Light Fields",
"Foveated Rendering",
"Microscopic Light Fields",
"Eye Tracking",
"Visualization"
],
"authors": [
{
"givenName": "Xiaoxu",
"surname": "Meng",
"fullName": "Xiaoxu Meng",
"affiliation": "Computer Science, University of Maryland at College Park, College Park, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ruofei",
"surname": "Du",
"fullName": "Ruofei Du",
"affiliation": "Google LLC, San Francisco, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Joseph F.",
"surname": "JaJa",
"fullName": "Joseph F. JaJa",
"affiliation": "Electrical and Computer Engineering, University of Maryland at College Park, College Park, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Amitabh",
"surname": "Varshney",
"fullName": "Amitabh Varshney",
"affiliation": "Computer Science, University of Maryland at College Park, College Park, MD, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2021-08-01 00:00:00",
"pubType": "trans",
"pages": "3350-3360",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pg/1997/8028/0/80280059",
"title": "Rendering of spherical light fields",
"doi": null,
"abstractUrl": "/proceedings-article/pg/1997/80280059/12OmNvTTciE",
"parentPublication": {
"id": "proceedings/pg/1997/8028/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446142",
"title": "Phase-Aligned Foveated Rendering for Virtual Reality Headsets",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446142/13bd1sx4ZsZ",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2022/9617/0/961700a756",
"title": "Rectangular Mapping-based Foveated Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2022/961700a756/1CJcj9wHjH2",
"parentPublication": {
"id": "proceedings/vr/2022/9617/0",
"title": "2022 IEEE on Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903564",
"title": "FoVolNet: Fast Volume Rendering using Foveated Deep Neural Networks",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903564/1GZombIreEg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/11/09873853",
"title": "Foveated Stochastic Lightcuts",
"doi": null,
"abstractUrl": "/journal/tg/2022/11/09873853/1GjwMIuxYUE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2023/4815/0/481500a471",
"title": "Locomotion-aware Foveated Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2023/481500a471/1MNgzzb0RWg",
"parentPublication": {
"id": "proceedings/vr/2023/4815/0",
"title": "2023 IEEE Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/05/09005240",
"title": "Eye-dominance-guided Foveated Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2020/05/09005240/1hzNcOce8OQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a001",
"title": "Foveated Instant Radiosity",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a001/1pysxhw4Bqw",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2021/1952/0/09466274",
"title": "View-dependent Scene Appearance Synthesis using Inverse Rendering from Light Fields",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2021/09466274/1uSSV7tRhSw",
"parentPublication": {
"id": "proceedings/iccp/2021/1952/0",
"title": "2021 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/11/09523836",
"title": "Foveated Photon Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2021/11/09523836/1wpquR1qr1S",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "09007507",
"articleId": "1hJKlGGBnpu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyq0zFI",
"title": "May",
"year": "2020",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1hzNcOce8OQ",
"doi": "10.1109/TVCG.2020.2973442",
"abstract": "Optimizing rendering performance is critical for a wide variety of virtual reality (VR) applications. Foveated rendering is emerging as an indispensable technique for reconciling interactive frame rates with ever-higher head-mounted display resolutions. Here, we present a simple yet effective technique for further reducing the cost of foveated rendering by leveraging ocular dominance - the tendency of the human visual system to prefer scene perception from one eye over the other. Our new approach, eye-dominance-guided foveated rendering (EFR), renders the scene at a lower foveation level (with higher detail) for the dominant eye than the non-dominant eye. Compared with traditional foveated rendering, EFR can be expected to provide superior rendering performance while preserving the same level of perceived visual quality.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Optimizing rendering performance is critical for a wide variety of virtual reality (VR) applications. Foveated rendering is emerging as an indispensable technique for reconciling interactive frame rates with ever-higher head-mounted display resolutions. Here, we present a simple yet effective technique for further reducing the cost of foveated rendering by leveraging ocular dominance - the tendency of the human visual system to prefer scene perception from one eye over the other. Our new approach, eye-dominance-guided foveated rendering (EFR), renders the scene at a lower foveation level (with higher detail) for the dominant eye than the non-dominant eye. Compared with traditional foveated rendering, EFR can be expected to provide superior rendering performance while preserving the same level of perceived visual quality.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Optimizing rendering performance is critical for a wide variety of virtual reality (VR) applications. Foveated rendering is emerging as an indispensable technique for reconciling interactive frame rates with ever-higher head-mounted display resolutions. Here, we present a simple yet effective technique for further reducing the cost of foveated rendering by leveraging ocular dominance - the tendency of the human visual system to prefer scene perception from one eye over the other. Our new approach, eye-dominance-guided foveated rendering (EFR), renders the scene at a lower foveation level (with higher detail) for the dominant eye than the non-dominant eye. Compared with traditional foveated rendering, EFR can be expected to provide superior rendering performance while preserving the same level of perceived visual quality.",
"title": "Eye-dominance-guided Foveated Rendering",
"normalizedTitle": "Eye-dominance-guided Foveated Rendering",
"fno": "09005240",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Gaze Tracking",
"Helmet Mounted Displays",
"Rendering Computer Graphics",
"Virtual Reality",
"Visual Perception",
"Eye Dominance Guided Foveated Rendering",
"Virtual Reality Applications",
"Ever Higher Head Mounted Display Resolutions",
"Ocular Dominance",
"Nondominant Eye",
"Human Visual System",
"Scene Perception",
"EFR",
"Perceived Visual Quality",
"Rendering Computer Graphics",
"Visualization",
"Kernel",
"Visual Systems",
"Pipelines",
"Sensitivity",
"Solid Modeling",
"Virtual Reality",
"Foveated Rendering",
"Perception",
"Gaze Contingent Rendering",
"Ocular Dominance",
"Eye Tracking"
],
"authors": [
{
"givenName": "Xiaoxu",
"surname": "Meng",
"fullName": "Xiaoxu Meng",
"affiliation": "University of Maryland, College Park",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ruofei",
"surname": "Du",
"fullName": "Ruofei Du",
"affiliation": "Google LLC.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Amitabh",
"surname": "Varshney",
"fullName": "Amitabh Varshney",
"affiliation": "University of Maryland, College Park",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2020-05-01 00:00:00",
"pubType": "trans",
"pages": "1972-1980",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/etvis/2016/4731/0/07851170",
"title": "An analysis of eye-tracking data in foveated ray tracing",
"doi": null,
"abstractUrl": "/proceedings-article/etvis/2016/07851170/12OmNvT2pjL",
"parentPublication": {
"id": "proceedings/etvis/2016/4731/0",
"title": "2016 IEEE Second Workshop on Eye Tracking and Visualization (ETVIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2018/4195/0/08551511",
"title": "Eye Tracking-Based 360 Vr Foveated/Tiled Video Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2018/08551511/17D45WK5AoH",
"parentPublication": {
"id": "proceedings/icmew/2018/4195/0",
"title": "2018 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2022/9617/0/961700a756",
"title": "Rectangular Mapping-based Foveated Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2022/961700a756/1CJcj9wHjH2",
"parentPublication": {
"id": "proceedings/vr/2022/9617/0",
"title": "2022 IEEE on Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2023/4815/0/481500a205",
"title": "Power, Performance, and Image Quality Tradeoffs in Foveated Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2023/481500a205/1MNgQoZswDu",
"parentPublication": {
"id": "proceedings/vr/2023/4815/0",
"title": "2023 IEEE Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2023/4815/0/481500a471",
"title": "Locomotion-aware Foveated Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2023/481500a471/1MNgzzb0RWg",
"parentPublication": {
"id": "proceedings/vr/2023/4815/0",
"title": "2023 IEEE Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/08/09007492",
"title": "3D-Kernel Foveated Rendering for Light Fields",
"doi": null,
"abstractUrl": "/journal/tg/2021/08/09007492/1hJKlSvNgo8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccem/2019/6334/0/633400a032",
"title": "Low-Cost Eye Tracking for Foveated Rendering Using Machine Learning",
"doi": null,
"abstractUrl": "/proceedings-article/ccem/2019/633400a032/1iHT2m32LIY",
"parentPublication": {
"id": "proceedings/ccem/2019/6334/0",
"title": "2019 IEEE International Conference on Cloud Computing in Emerging Markets (CCEM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a001",
"title": "Foveated Instant Radiosity",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a001/1pysxhw4Bqw",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/05/09382903",
"title": "A Log-Rectilinear Transformation for Foveated 360-degree Video Streaming",
"doi": null,
"abstractUrl": "/journal/tg/2021/05/09382903/1saZxiH9uaQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/11/09523836",
"title": "Foveated Photon Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2021/11/09523836/1wpquR1qr1S",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08998371",
"articleId": "1hrXiia6v9C",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08998293",
"articleId": "1hrXiCmKkak",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1y2FkV9ZFKM",
"title": "Nov.",
"year": "2021",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1wpquR1qr1S",
"doi": "10.1109/TVCG.2021.3106488",
"abstract": "Virtual reality (VR) applications require high-performance rendering algorithms to efficiently render 3D scenes on the VR head-mounted display, to provide users with an immersive and interactive virtual environment. Foveated rendering provides a solution to improve the performance of rendering algorithms by allocating computing resources to different regions based on the human visual acuity, and renders images of different qualities in different regions. Rasterization-based methods and ray tracing methods can be directly applied to foveated rendering, but rasterization-based methods are difficult to estimate global illumination (GI), and ray tracing methods are inefficient for rendering scenes that contain paths with low probability. Photon mapping is an efficient GI rendering method for scenes with different materials. However, since photon mapping cannot dynamically adjust the rendering quality of GI according to the human acuity, it cannot be directly applied to foveated rendering. In this paper, we propose a foveated photon mapping method to render realistic GI effects in the foveal region. We use the foveated photon tracing method to generate photons with high density in the foveal region, and these photons are used to render high-quality images in the foveal region. We further propose a temporal photon management to select and update the valid foveated photons of the previous frame for improving our method's performance. Our method can render diffuse, specular, glossy and transparent materials to achieve effects specifically related to GI, such as color bleeding, specular reflection, glossy reflection and caustics. Our method supports dynamic scenes and renders high-quality GI in the foveal region at interactive rates.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Virtual reality (VR) applications require high-performance rendering algorithms to efficiently render 3D scenes on the VR head-mounted display, to provide users with an immersive and interactive virtual environment. Foveated rendering provides a solution to improve the performance of rendering algorithms by allocating computing resources to different regions based on the human visual acuity, and renders images of different qualities in different regions. Rasterization-based methods and ray tracing methods can be directly applied to foveated rendering, but rasterization-based methods are difficult to estimate global illumination (GI), and ray tracing methods are inefficient for rendering scenes that contain paths with low probability. Photon mapping is an efficient GI rendering method for scenes with different materials. However, since photon mapping cannot dynamically adjust the rendering quality of GI according to the human acuity, it cannot be directly applied to foveated rendering. In this paper, we propose a foveated photon mapping method to render realistic GI effects in the foveal region. We use the foveated photon tracing method to generate photons with high density in the foveal region, and these photons are used to render high-quality images in the foveal region. We further propose a temporal photon management to select and update the valid foveated photons of the previous frame for improving our method's performance. Our method can render diffuse, specular, glossy and transparent materials to achieve effects specifically related to GI, such as color bleeding, specular reflection, glossy reflection and caustics. Our method supports dynamic scenes and renders high-quality GI in the foveal region at interactive rates.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Virtual reality (VR) applications require high-performance rendering algorithms to efficiently render 3D scenes on the VR head-mounted display, to provide users with an immersive and interactive virtual environment. Foveated rendering provides a solution to improve the performance of rendering algorithms by allocating computing resources to different regions based on the human visual acuity, and renders images of different qualities in different regions. Rasterization-based methods and ray tracing methods can be directly applied to foveated rendering, but rasterization-based methods are difficult to estimate global illumination (GI), and ray tracing methods are inefficient for rendering scenes that contain paths with low probability. Photon mapping is an efficient GI rendering method for scenes with different materials. However, since photon mapping cannot dynamically adjust the rendering quality of GI according to the human acuity, it cannot be directly applied to foveated rendering. In this paper, we propose a foveated photon mapping method to render realistic GI effects in the foveal region. We use the foveated photon tracing method to generate photons with high density in the foveal region, and these photons are used to render high-quality images in the foveal region. We further propose a temporal photon management to select and update the valid foveated photons of the previous frame for improving our method's performance. Our method can render diffuse, specular, glossy and transparent materials to achieve effects specifically related to GI, such as color bleeding, specular reflection, glossy reflection and caustics. Our method supports dynamic scenes and renders high-quality GI in the foveal region at interactive rates.",
"title": "Foveated Photon Mapping",
"normalizedTitle": "Foveated Photon Mapping",
"fno": "09523836",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Image Sensors",
"Ray Tracing",
"Rendering Computer Graphics",
"Virtual Reality",
"Virtual Reality Applications",
"High Performance Rendering Algorithms",
"VR Head Mounted Display",
"Immersive Environment",
"Interactive Virtual Environment",
"Foveated Rendering",
"Renders Images",
"Rasterization Based Methods",
"Ray Tracing Methods",
"Rendering Scenes",
"Efficient GI Rendering Method",
"Rendering Quality",
"Foveated Photon Mapping Method",
"Foveal Region",
"Foveated Photon Tracing Method",
"High Quality Images",
"Temporal Photon Management",
"Valid Foveated Photons",
"Renders High Quality GI",
"Photonics",
"Rendering Computer Graphics",
"Visualization",
"Three Dimensional Displays",
"Lighting",
"Spatial Resolution",
"Ray Tracing",
"Virtual Reality",
"Foveated Rendering",
"Photon Mapping"
],
"authors": [
{
"givenName": "Xuehuai",
"surname": "Shi",
"fullName": "Xuehuai Shi",
"affiliation": "State Key Laboratory of Virtual Reality Technology and Systems, School of Computer Science and Engineering, Beihang University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lili",
"surname": "Wang",
"fullName": "Lili Wang",
"affiliation": "State Key Laboratory of Virtual Reality Technology and Systems, Beihang University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoheng",
"surname": "Wei",
"fullName": "Xiaoheng Wei",
"affiliation": "State Key Laboratory of Virtual Reality Technology and Systems, School of Computer Science and Engineering, Beihang University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ling-Qi",
"surname": "Yan",
"fullName": "Ling-Qi Yan",
"affiliation": "University of California, Santa Barbara, California, U.S.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2021-11-01 00:00:00",
"pubType": "trans",
"pages": "4183-4193",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iiki/2016/5952/0/5952a022",
"title": "Distributed Global Illumination Method Based on Photon Mapping",
"doi": null,
"abstractUrl": "/proceedings-article/iiki/2016/5952a022/12OmNBubOQf",
"parentPublication": {
"id": "proceedings/iiki/2016/5952/0",
"title": "2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etvis/2016/4731/0/07851170",
"title": "An analysis of eye-tracking data in foveated ray tracing",
"doi": null,
"abstractUrl": "/proceedings-article/etvis/2016/07851170/12OmNvT2pjL",
"parentPublication": {
"id": "proceedings/etvis/2016/4731/0",
"title": "2016 IEEE Second Workshop on Eye Tracking and Visualization (ETVIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2017/2937/0/2937a444",
"title": "Towards Interactive and Realistic Rendering of 3D Fetal Ultrasound via Photon Mapping",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2017/2937a444/12OmNwNwzLh",
"parentPublication": {
"id": "proceedings/ism/2017/2937/0",
"title": "2017 IEEE International Symposium on Multimedia (ISM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07534852",
"title": "Correlated Photon Mapping for Interactive Global Illumination of Time-Varying Volumetric Data",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07534852/13rRUxZ0o1E",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122364",
"title": "Historygrams: Enabling Interactive Global Illumination in Direct Volume Rendering using Photon Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122364/13rRUyYjK5h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/08/ttg2013081317",
"title": "Real-Time Volume Rendering in Dynamic Lighting Environments Using Precomputed Photon Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2013/08/ttg2013081317/13rRUynHuja",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2022/9617/0/961700a756",
"title": "Rectangular Mapping-based Foveated Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2022/961700a756/1CJcj9wHjH2",
"parentPublication": {
"id": "proceedings/vr/2022/9617/0",
"title": "2022 IEEE on Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2023/4815/0/481500a471",
"title": "Locomotion-aware Foveated Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2023/481500a471/1MNgzzb0RWg",
"parentPublication": {
"id": "proceedings/vr/2023/4815/0",
"title": "2023 IEEE Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a001",
"title": "Foveated Instant Radiosity",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a001/1pysxhw4Bqw",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2021/0158/0/015800a413",
"title": "Selective Foveated Ray Tracing for Head-Mounted Displays",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2021/015800a413/1yeD8bFOZos",
"parentPublication": {
"id": "proceedings/ismar/2021/0158/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09523846",
"articleId": "1wpqw9G3Lws",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09523842",
"articleId": "1wpqr1B6wA8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1y2Ftho8O5y",
"name": "ttg202111-09523836s1-supp1-3106488.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202111-09523836s1-supp1-3106488.mp4",
"extension": "mp4",
"size": "62.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.