data
dict |
|---|
{
"proceeding": {
"id": "1J6h4A8ldF6",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"acronym": "vis",
"groupId": "9973064",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1J6henXuhws",
"doi": "10.1109/VIS54862.2022.00024",
"title": "Parametric Dimension Reduction by Preserving Local Structure",
"normalizedTitle": "Parametric Dimension Reduction by Preserving Local Structure",
"abstract": "We extend a well-known dimension reduction method, t-distributed stochastic neighbor embedding (t-SNE), from non-parametric to parametric by training neural networks. The main advantage of a parametric technique is the generalization of handling new data, which is beneficial for streaming data visualization. While previous parametric methods either require a network pre-training by the restricted Boltzmann machine or intermediate results obtained from the traditional non-parametric t-SNE, we found that recent network training skills can enable a direct optimization for the t-SNE objective function. Accordingly, our method achieves high embedding quality while enjoying generalization. Due to mini-batch network training, our parametric dimension reduction method is highly efficient. For evaluation, we compared our method to several baselines on a variety of datasets. Experiment results demonstrate the feasibility of our method. The source code is available at https://github.com/a07458666/parametric_dr.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We extend a well-known dimension reduction method, t-distributed stochastic neighbor embedding (t-SNE), from non-parametric to parametric by training neural networks. The main advantage of a parametric technique is the generalization of handling new data, which is beneficial for streaming data visualization. While previous parametric methods either require a network pre-training by the restricted Boltzmann machine or intermediate results obtained from the traditional non-parametric t-SNE, we found that recent network training skills can enable a direct optimization for the t-SNE objective function. Accordingly, our method achieves high embedding quality while enjoying generalization. Due to mini-batch network training, our parametric dimension reduction method is highly efficient. For evaluation, we compared our method to several baselines on a variety of datasets. Experiment results demonstrate the feasibility of our method. The source code is available at https://github.com/a07458666/parametric_dr.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We extend a well-known dimension reduction method, t-distributed stochastic neighbor embedding (t-SNE), from non-parametric to parametric by training neural networks. The main advantage of a parametric technique is the generalization of handling new data, which is beneficial for streaming data visualization. While previous parametric methods either require a network pre-training by the restricted Boltzmann machine or intermediate results obtained from the traditional non-parametric t-SNE, we found that recent network training skills can enable a direct optimization for the t-SNE objective function. Accordingly, our method achieves high embedding quality while enjoying generalization. Due to mini-batch network training, our parametric dimension reduction method is highly efficient. For evaluation, we compared our method to several baselines on a variety of datasets. Experiment results demonstrate the feasibility of our method. The source code is available at https://github.com/a07458666/parametric_dr.",
"fno": "881200a075",
"keywords": [
"Boltzmann Machines",
"Data Reduction",
"Data Visualisation",
"Learning Artificial Intelligence",
"Neural Nets",
"Stochastic Processes",
"Data Visualization",
"High Embedding Quality",
"Mini Batch Network Training",
"Network Pre Training",
"Neural Networks",
"Parametric Dimension Reduction Method",
"Parametric Technique",
"Preserving Local Structure",
"Previous Parametric Methods",
"Recent Network Training Skills",
"T Distributed Stochastic Neighbor",
"Training",
"Dimensionality Reduction",
"Manifolds",
"Deep Learning",
"Visual Analytics",
"Source Coding",
"Neural Networks",
"Computing Methodologies",
"Dimensionality Reduction And Manifold Learning",
"Human Centered Computing",
"Visualization Toolkits"
],
"authors": [
{
"affiliation": "National Yang Ming Chiao Tung University,Taiwan",
"fullName": "Chien-Hsun Lai",
"givenName": "Chien-Hsun",
"surname": "Lai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "National Yang Ming Chiao Tung University,Taiwan",
"fullName": "Ming-Feng Kuo",
"givenName": "Ming-Feng",
"surname": "Kuo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "National Yang Ming Chiao Tung University,Taiwan",
"fullName": "Yun-Hsuan Lien",
"givenName": "Yun-Hsuan",
"surname": "Lien",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "National Yang Ming Chiao Tung University,Taiwan",
"fullName": "Kuan-An Su",
"givenName": "Kuan-An",
"surname": "Su",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "National Yang Ming Chiao Tung University,Taiwan",
"fullName": "Yu-Shuen Wang",
"givenName": "Yu-Shuen",
"surname": "Wang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-10-01T00:00:00",
"pubType": "proceedings",
"pages": "75-79",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-8812-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [
{
"id": "1J6hekHX5aE",
"name": "pvis202288120-09973230s1-mm_881200a075.zip",
"size": "2.49 MB",
"location": "https://www.computer.org/csdl/api/v1/extra/pvis202288120-09973230s1-mm_881200a075.zip",
"__typename": "WebExtraType"
}
],
"adjacentArticles": {
"previous": {
"fno": "881200a070",
"articleId": "1J6h5R5WY1O",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "881200a080",
"articleId": "1J6hbOw1XBC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2013/5049/0/5049a174",
"title": "Nonlinear Dimensionality Reduction for Cluster Identification in Metagenomic Samples",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2013/5049a174/12OmNARRYzB",
"parentPublication": {
"id": "proceedings/iv/2013/5049/0",
"title": "2013 17th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichi/2018/5377/0/537701a363",
"title": "DNA Methylation Data to Predict Suicidal and Non-Suicidal Deaths: A Machine Learning Approach",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2018/537701a363/12OmNx7ouKB",
"parentPublication": {
"id": "proceedings/ichi/2018/5377/0",
"title": "2018 IEEE International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600a011",
"title": "CO-SNE: Dimensionality Reduction and Visualization for Hyperbolic Data",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600a011/1H0NVwymKFG",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsm/2022/5486/0/548600a009",
"title": "Using Dimensionality Reduction Techniques to Understand the Sources of Software Complexity",
"doi": null,
"abstractUrl": "/proceedings-article/iccsm/2022/548600a009/1JeF7w4hIuk",
"parentPublication": {
"id": "proceedings/iccsm/2022/5486/0",
"title": "2022 6th International Conference on Computer, Software and Modeling (ICCSM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icica/2022/9011/0/901100a022",
"title": "A Novel Dimension Reduction Framework Based on UMAP for Improving the Timeliness of Small Samples",
"doi": null,
"abstractUrl": "/proceedings-article/icica/2022/901100a022/1LKxb9MicGk",
"parentPublication": {
"id": "proceedings/icica/2022/9011/0",
"title": "2022 11th International Conference on Information Communication and Applications (ICICA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-dss-smartcity-dependsys/2022/1993/0/199300a009",
"title": "Matching Using Sufficient Dimension Reduction for Heterogeneity Causal Effect Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-dss-smartcity-dependsys/2022/199300a009/1LSPaDSDB4I",
"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": "trans/tk/2020/04/08798871",
"title": "LN-SNE: Log-Normal Distributed Stochastic Neighbor Embedding for Anomaly Detection",
"doi": null,
"abstractUrl": "/journal/tk/2020/04/08798871/1cumPI64Foc",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/08/09064929",
"title": "t-viSNE: Interactive Assessment and Interpretation of t-SNE Projections",
"doi": null,
"abstractUrl": "/journal/tg/2020/08/09064929/1iZGzFjpwPu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2020/8009/0/800900a107",
"title": "SMAP: A Joint Dimensionality Reduction Scheme for Secure Multi-Party Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2020/800900a107/1q7jvyVPaVi",
"parentPublication": {
"id": "proceedings/vast/2020/8009/0",
"title": "2020 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412900",
"title": "q-SNE: Visualizing Data using q-Gaussian Distributed Stochastic Neighbor Embedding",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412900/1tmhROYroSA",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1tmhi3ly74c",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1tmjjqNsISc",
"doi": "10.1109/ICPR48806.2021.9412261",
"title": "Improved Time-Series Clustering with UMAP dimension reduction method",
"normalizedTitle": "Improved Time-Series Clustering with UMAP dimension reduction method",
"abstract": "Clustering is an unsupervised machine learning method giving insights on data without early knowledge. Classes of data are return by assembling similar elements together. Giving the increasing of the available data, this method is now applied in a lot of fields with various data types. Here, we propose to explore the case of time series clustering. Indeed, time series are one of the most classic data type, and are present in various fields such as medical or finance. This kind of data can be pre-processed by of dimension reduction methods, such as the recent UMAP algorithm. In this paper, a benchmark of time series clustering is created, comparing the results with and without UMAP as a pre-processing step. UMAP is used to enhance clustering results. For completeness, three different clustering algorithms and two different geometric representation for the time series (Classic Euclidean geometry, and Riemannian geometry on the Stiefel Manifold) are applied. The results are compared with and without UMAP as a pre-processing step on the databases available at UCR Time Series Classification Archive www.cs.ucr.edu/~eamonn/time_series_data/.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Clustering is an unsupervised machine learning method giving insights on data without early knowledge. Classes of data are return by assembling similar elements together. Giving the increasing of the available data, this method is now applied in a lot of fields with various data types. Here, we propose to explore the case of time series clustering. Indeed, time series are one of the most classic data type, and are present in various fields such as medical or finance. This kind of data can be pre-processed by of dimension reduction methods, such as the recent UMAP algorithm. In this paper, a benchmark of time series clustering is created, comparing the results with and without UMAP as a pre-processing step. UMAP is used to enhance clustering results. For completeness, three different clustering algorithms and two different geometric representation for the time series (Classic Euclidean geometry, and Riemannian geometry on the Stiefel Manifold) are applied. The results are compared with and without UMAP as a pre-processing step on the databases available at UCR Time Series Classification Archive www.cs.ucr.edu/~eamonn/time_series_data/.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Clustering is an unsupervised machine learning method giving insights on data without early knowledge. Classes of data are return by assembling similar elements together. Giving the increasing of the available data, this method is now applied in a lot of fields with various data types. Here, we propose to explore the case of time series clustering. Indeed, time series are one of the most classic data type, and are present in various fields such as medical or finance. This kind of data can be pre-processed by of dimension reduction methods, such as the recent UMAP algorithm. In this paper, a benchmark of time series clustering is created, comparing the results with and without UMAP as a pre-processing step. UMAP is used to enhance clustering results. For completeness, three different clustering algorithms and two different geometric representation for the time series (Classic Euclidean geometry, and Riemannian geometry on the Stiefel Manifold) are applied. The results are compared with and without UMAP as a pre-processing step on the databases available at UCR Time Series Classification Archive www.cs.ucr.edu/~eamonn/time_series_data/.",
"fno": "09412261",
"keywords": [
"Geometry",
"Pattern Classification",
"Pattern Clustering",
"Time Series",
"Unsupervised Learning",
"UMAP Dimension Reduction Method",
"Data Types",
"Time Series Clustering",
"Classic Data Type",
"Dimension Reduction Methods",
"Recent UMAP Algorithm",
"Geometry",
"Dimensionality Reduction",
"Manifolds",
"Databases",
"Time Series Analysis",
"Clustering Algorithms",
"Finance"
],
"authors": [
{
"affiliation": "Univ Lyon, INSA-Lyon, DISP EA4570,Villeurbanne,France",
"fullName": "Clément Pealat",
"givenName": "Clément",
"surname": "Pealat",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Univ Lyon, INSA-Lyon, DISP EA4570,Villeurbanne,France",
"fullName": "Guillaume Bouleux",
"givenName": "Guillaume",
"surname": "Bouleux",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Univ Lyon, INSA-Lyon, DISP EA4570,Villeurbanne,France",
"fullName": "Vincent Cheutet",
"givenName": "Vincent",
"surname": "Cheutet",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-01-01T00:00:00",
"pubType": "proceedings",
"pages": "5658-5665",
"year": "2021",
"issn": "1051-4651",
"isbn": "978-1-7281-8808-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09413311",
"articleId": "1tmk1dDkIRa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09412739",
"articleId": "1tmiGNLh8JO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/aciids/2009/3580/0/3580a104",
"title": "Parallel Dimensionality Reduction Transformation for Time-Series Data",
"doi": null,
"abstractUrl": "/proceedings-article/aciids/2009/3580a104/12OmNBrDqE7",
"parentPublication": {
"id": "proceedings/aciids/2009/3580/0",
"title": "Intelligent Information and Database Systems, Asian Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408b086",
"title": "Discovering the Intrinsic Cardinality and Dimensionality of Time Series Using MDL",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408b086/12OmNqN6R5D",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsc/2010/4154/0/4154a101",
"title": "Speeding-Up the Similarity Search in Time Series Databases by Coupling Dimensionality Reduction Techniques with a Fast-and-Dirty Filter",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2010/4154a101/12OmNyNzhzV",
"parentPublication": {
"id": "proceedings/icsc/2010/4154/0",
"title": "2010 IEEE Fourth International Conference on Semantic Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a075",
"title": "Parametric Dimension Reduction by Preserving Local Structure",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a075/1J6henXuhws",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995272",
"title": "The Performance of UMAP plus Linkage Compared with Daura-Clustering of Molecular Dynamics of the PD-1 Checkpoint Receptor",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995272/1JC34WQEmL6",
"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/10020482",
"title": "Functional approach for Two Way Dimension Reduction in Time Series",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020482/1KfT7WuUT04",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icica/2022/9011/0/901100a022",
"title": "A Novel Dimension Reduction Framework Based on UMAP for Improving the Timeliness of Small Samples",
"doi": null,
"abstractUrl": "/proceedings-article/icica/2022/901100a022/1LKxb9MicGk",
"parentPublication": {
"id": "proceedings/icica/2022/9011/0",
"title": "2022 11th International Conference on Information Communication and Applications (ICICA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09413180",
"title": "Detecting Rare Cell Populations in Flow Cytometry Data Using UMAP",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09413180/1tmhj2mshy0",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aemcse/2021/1596/0/159600b227",
"title": "Dimension reduction of dynamic functional connectivity network based on clustering for ASD diagnosis",
"doi": null,
"abstractUrl": "/proceedings-article/aemcse/2021/159600b227/1wcdvc9IFTq",
"parentPublication": {
"id": "proceedings/aemcse/2021/1596/0",
"title": "2021 4th International Conference on Advanced Electronic Materials, Computers and Software Engineering (AEMCSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdataservice/2021/3483/0/348300a190",
"title": "A Similarity Measurement for Multivariate Time Series Based on Variable Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/bigdataservice/2021/348300a190/1xNNqRvqFbO",
"parentPublication": {
"id": "proceedings/bigdataservice/2021/3483/0",
"title": "2021 IEEE Seventh International Conference on Big Data Computing Service and Applications (BigDataService)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1ua4stSUlfa",
"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)",
"acronym": "ispa-bdcloud-socialcom-sustaincom",
"groupId": "1805944",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1ua4LOE4e7S",
"doi": "10.1109/ISPA-BDCloud-SocialCom-SustainCom51426.2020.00145",
"title": "Topic Clustering Using Induced Squared Correlation Thresholding with Dimension Reduction",
"normalizedTitle": "Topic Clustering Using Induced Squared Correlation Thresholding with Dimension Reduction",
"abstract": "Clustering algorithms are now increasingly being adopted for the detection of bursty events in Online Social Networks (OSNs). Traditionally designed to be used predominantly with structured dataset as an unsupervised technique, it is gaining popularity for text analytics in recent years. In a bid to achieve better accuracy when applying cluster analysis, variants of the original clustering algorithm have emerged within the research community and there is still no end in sight. The success of the clustering algorithms largely depends on the ideal cluster number that is initially set as a parameter before running the cluster analysis. Initial analysis, in addition to the selection of useful features, usually precedes the actual cluster analysis, which can provide useful insights whilst setting up the optimal number of clusters when analysing structured datasets. In the context of event detection, this translates to the number of events in an unstructured data. Using cluster analysis to infer the number of events in a text document may be less informative if the number of clusters is not carefully chosen, which also can make the entire process tedious and complex. With this in mind, this paper proposes an efficient strategy of cluster analysis, with the utilisation of Induced Squared Correlation Thresholding with Dimension Reduction (ISCT), which takes into consideration the squared correlation of a term within its own cluster and the nearest cluster. Our proposed method not only helps to reduce the dimension in the text data but also provides an estimate of the optimal number of clusters for a given document large enough to satisfy the ISCT conditions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Clustering algorithms are now increasingly being adopted for the detection of bursty events in Online Social Networks (OSNs). Traditionally designed to be used predominantly with structured dataset as an unsupervised technique, it is gaining popularity for text analytics in recent years. In a bid to achieve better accuracy when applying cluster analysis, variants of the original clustering algorithm have emerged within the research community and there is still no end in sight. The success of the clustering algorithms largely depends on the ideal cluster number that is initially set as a parameter before running the cluster analysis. Initial analysis, in addition to the selection of useful features, usually precedes the actual cluster analysis, which can provide useful insights whilst setting up the optimal number of clusters when analysing structured datasets. In the context of event detection, this translates to the number of events in an unstructured data. Using cluster analysis to infer the number of events in a text document may be less informative if the number of clusters is not carefully chosen, which also can make the entire process tedious and complex. With this in mind, this paper proposes an efficient strategy of cluster analysis, with the utilisation of Induced Squared Correlation Thresholding with Dimension Reduction (ISCT), which takes into consideration the squared correlation of a term within its own cluster and the nearest cluster. Our proposed method not only helps to reduce the dimension in the text data but also provides an estimate of the optimal number of clusters for a given document large enough to satisfy the ISCT conditions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Clustering algorithms are now increasingly being adopted for the detection of bursty events in Online Social Networks (OSNs). Traditionally designed to be used predominantly with structured dataset as an unsupervised technique, it is gaining popularity for text analytics in recent years. In a bid to achieve better accuracy when applying cluster analysis, variants of the original clustering algorithm have emerged within the research community and there is still no end in sight. The success of the clustering algorithms largely depends on the ideal cluster number that is initially set as a parameter before running the cluster analysis. Initial analysis, in addition to the selection of useful features, usually precedes the actual cluster analysis, which can provide useful insights whilst setting up the optimal number of clusters when analysing structured datasets. In the context of event detection, this translates to the number of events in an unstructured data. Using cluster analysis to infer the number of events in a text document may be less informative if the number of clusters is not carefully chosen, which also can make the entire process tedious and complex. With this in mind, this paper proposes an efficient strategy of cluster analysis, with the utilisation of Induced Squared Correlation Thresholding with Dimension Reduction (ISCT), which takes into consideration the squared correlation of a term within its own cluster and the nearest cluster. Our proposed method not only helps to reduce the dimension in the text data but also provides an estimate of the optimal number of clusters for a given document large enough to satisfy the ISCT conditions.",
"fno": "148500a948",
"keywords": [
"Data Mining",
"Pattern Clustering",
"Social Networking Online",
"Statistical Analysis",
"Text Analysis",
"Topic Clustering",
"Induced Squared Correlation Thresholding",
"Dimension Reduction",
"Clustering Algorithms",
"Applying Cluster Analysis",
"Original Clustering Algorithm",
"Ideal Cluster Number",
"Actual Cluster Analysis",
"Event Detection",
"Nearest Cluster",
"Dimensionality Reduction",
"Training",
"Correlation",
"Text Analysis",
"Social Networking Online",
"Clustering Algorithms",
"Process Control",
"Cluster Analysis",
"Dimension Reduction",
"K Means",
"Cubic Clustering Criterion",
"Pseudo F Statistic"
],
"authors": [
{
"affiliation": "School of Informatics, University of Leicester,United Kingdom",
"fullName": "Ayodeji Ayorinde",
"givenName": "Ayodeji",
"surname": "Ayorinde",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Leicester,Department of Informatics,United Kingdom",
"fullName": "John Panneerselvam",
"givenName": "John",
"surname": "Panneerselvam",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Leicester,Department of Informatics,United Kingdom",
"fullName": "Lu Liu",
"givenName": "Lu",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Automation and Automobile, Yangzhou Polytechnic College,China",
"fullName": "Dejun Miao",
"givenName": "Dejun",
"surname": "Miao",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ispa-bdcloud-socialcom-sustaincom",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-12-01T00:00:00",
"pubType": "proceedings",
"pages": "948-957",
"year": "2020",
"issn": null,
"isbn": "978-1-6654-1485-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "148500a941",
"articleId": "1ua4zMndgRy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "148500a958",
"articleId": "1ua4I0GzXiM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "trans/tk/2011/03/ttk2011030335",
"title": "A Fuzzy Self-Constructing Feature Clustering Algorithm for Text Classification",
"doi": null,
"abstractUrl": "/journal/tk/2011/03/ttk2011030335/13rRUB7a1gi",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcomp/2019/7789/0/08679255",
"title": "Time Series Topic Transition Based on Micro-Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2019/08679255/18Xkm9UkMco",
"parentPublication": {
"id": "proceedings/bigcomp/2019/7789/0",
"title": "2019 IEEE International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbfd/2021/1227/0/122700a168",
"title": "Content-aware Topic Recognition of Inquiry Letter",
"doi": null,
"abstractUrl": "/proceedings-article/cbfd/2021/122700a168/1CJfGXQZ77W",
"parentPublication": {
"id": "proceedings/cbfd/2021/1227/0",
"title": "2021 International Conference on Computer, Blockchain and Financial Development (CBFD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2022/0883/0/088300d254",
"title": "Intent Mining: A Social and Semantic Enhanced Topic Model for Operation-Friendly Digital Marketing",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2022/088300d254/1FwFsUylxao",
"parentPublication": {
"id": "proceedings/icde/2022/0883/0",
"title": "2022 IEEE 38th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2022/9755/0/975500a325",
"title": "Meaning of the Clusters on Dimensionality Reduction by Word Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2022/975500a325/1GU6T5a3HI4",
"parentPublication": {
"id": "proceedings/iiai-aai/2022/9755/0",
"title": "2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/candarw/2022/7532/0/753200a255",
"title": "Topic-Based Clustering of Japanese Sentences Using Sentence-BERT",
"doi": null,
"abstractUrl": "/proceedings-article/candarw/2022/753200a255/1LAz56O56c8",
"parentPublication": {
"id": "proceedings/candarw/2022/7532/0",
"title": "2022 Tenth International Symposium on Computing and Networking Workshops (CANDARW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805461",
"title": "Supporting Analysis of Dimensionality Reduction Results with Contrastive Learning",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805461/1cG4ulCK5S8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2021/3931/0/393100a216",
"title": "Visualization of Topic Transitions in SNSs Using Document Embedding and Dimensionality Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2021/393100a216/1tTtr6M0pl6",
"parentPublication": {
"id": "proceedings/pacificvis/2021/3931/0",
"title": "2021 IEEE 14th Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aemcse/2021/1596/0/159600b227",
"title": "Dimension reduction of dynamic functional connectivity network based on clustering for ASD diagnosis",
"doi": null,
"abstractUrl": "/proceedings-article/aemcse/2021/159600b227/1wcdvc9IFTq",
"parentPublication": {
"id": "proceedings/aemcse/2021/1596/0",
"title": "2021 4th International Conference on Advanced Electronic Materials, Computers and Software Engineering (AEMCSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2021/2856/0/285600a150",
"title": "Unsupervised Topic Discovery in User Comments",
"doi": null,
"abstractUrl": "/proceedings-article/re/2021/285600a150/1yDjGpsrkAM",
"parentPublication": {
"id": "proceedings/re/2021/2856/0",
"title": "2021 IEEE 29th International Requirements Engineering Conference (RE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqJ8taQ",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"acronym": "vast",
"groupId": "1001630",
"volume": "0",
"displayVolume": "0",
"year": "2014",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxzMnNA",
"doi": "10.1109/VAST.2014.7042514",
"title": "Visual analysis of missing data — To see what isn't there",
"normalizedTitle": "Visual analysis of missing data — To see what isn't there",
"abstract": "Missing data are records that are absent from a data set. They are data that were intended to be recorded, but for some reason were not. Missing values are common in data analysis and occur in almost any domain, causing problems such as biased results and reduced statistical rigour. Visual analytics has great potential to provide invaluable support for the investigation of missing data. This poster aims to highlight the importance of analysing missing data and the challenges involved, as well as to emphasize the lack of visualization support in the area and through this encourage visualization scientists to discuss and address this highly relevant issue.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Missing data are records that are absent from a data set. They are data that were intended to be recorded, but for some reason were not. Missing values are common in data analysis and occur in almost any domain, causing problems such as biased results and reduced statistical rigour. Visual analytics has great potential to provide invaluable support for the investigation of missing data. This poster aims to highlight the importance of analysing missing data and the challenges involved, as well as to emphasize the lack of visualization support in the area and through this encourage visualization scientists to discuss and address this highly relevant issue.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Missing data are records that are absent from a data set. They are data that were intended to be recorded, but for some reason were not. Missing values are common in data analysis and occur in almost any domain, causing problems such as biased results and reduced statistical rigour. Visual analytics has great potential to provide invaluable support for the investigation of missing data. This poster aims to highlight the importance of analysing missing data and the challenges involved, as well as to emphasize the lack of visualization support in the area and through this encourage visualization scientists to discuss and address this highly relevant issue.",
"fno": "07042514",
"keywords": [
"Data Visualization",
"Visual Analytics",
"Uncertainty",
"Measurement",
"Educational Institutions",
"Iris",
"Exploratory Analysis",
"Missing Data",
"Visualization"
],
"authors": [
{
"affiliation": "University of Cambridge",
"fullName": "Sara Johansson Fernstad",
"givenName": "Sara Johansson",
"surname": "Fernstad",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Cambridge",
"fullName": "Robert C Glen",
"givenName": "Robert C",
"surname": "Glen",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vast",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2014-10-01T00:00:00",
"pubType": "proceedings",
"pages": "249-250",
"year": "2014",
"issn": null,
"isbn": "978-1-4799-6227-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07042513",
"articleId": "12OmNy5zssl",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07042515",
"articleId": "12OmNvEhfZc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2017/0831/0/0831a422",
"title": "Visual Analytics for Electronic Intelligence: Challenges and Opportunities",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2017/0831a422/12OmNB7LvBm",
"parentPublication": {
"id": "proceedings/iv/2017/0831/0",
"title": "2017 21st International Conference Information Visualisation (IV)",
"__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": "trans/tg/2016/12/07368928",
"title": "What May Visualization Processes Optimize?",
"doi": null,
"abstractUrl": "/journal/tg/2016/12/07368928/13rRUILLkDV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904433",
"title": "Evaluating the Use of Uncertainty Visualisations for Imputations of Data Missing At Random in Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904433/1H1gkkbe0hy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904491",
"title": "Seeing What You Believe or Believing What You See? Belief Biases Correlation Estimation",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904491/1H1gs8qCjdu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805424",
"title": "What is Interaction for Data Visualization?",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805424/1cG4MsovTO0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2019/4896/0/489600a407",
"title": "Imputation Methods Outperform Missing-Indicator for Data Missing Completely at Random",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2019/489600a407/1gAwZFrU3Re",
"parentPublication": {
"id": "proceedings/icdmw/2019/4896/0",
"title": "2019 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcomp/2020/6034/0/603400a303",
"title": "Visual Imputation Analytics for Missing Time-Series Data in Bayesian Network",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2020/603400a303/1jdDwCsHB16",
"parentPublication": {
"id": "proceedings/bigcomp/2020/6034/0",
"title": "2020 IEEE International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/10/09374711",
"title": "To Explore What Isn't There—Glyph-Based Visualization for Analysis of Missing Values",
"doi": null,
"abstractUrl": "/journal/tg/2022/10/09374711/1rR7Vh9iRr2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a109",
"title": "A Visual-Interactive Idiom to Diagnose Missing Data Mechanisms",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a109/1rSRaDpGvle",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBTawn5",
"title": "2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing",
"acronym": "synasc",
"groupId": "1001577",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzahbYD",
"doi": "10.1109/SYNASC.2012.31",
"title": "Variable Density Based Genetic Clustering",
"normalizedTitle": "Variable Density Based Genetic Clustering",
"abstract": "From the existing clustering techniques, spatial density-based ones register one of the most promising results in detecting arbitrary shaped data, being robust to outliers and not restricted by various data distributions. The existing literature contains a plethora of density based algorithms but in all cases one or multiple global parameters need to be set, parameters that are seldom easy to set requiring in depth knowledge about the analyzed data. This paper proposes a parameter-free novel genetic clustering algorithm with an original method for encoding clustering solutions relying on density based clustering parameters. Within each clustering solution genotype, gene position, defined by several density based clustering attributes, plays a key role for recovering the encoded partition. Each gene defined density-based cluster can only attract object not already attracted by previously defined clusters. The proposed encoding scheme allows for always valid crossover results, with great offspring variations even when using simple crossover operators. While not requiring any input parameters, experiments involving multiple clustering validation indices as fitness criteria, across both synthetic and real data sets, show comparable results with existing density-based clustering techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "From the existing clustering techniques, spatial density-based ones register one of the most promising results in detecting arbitrary shaped data, being robust to outliers and not restricted by various data distributions. The existing literature contains a plethora of density based algorithms but in all cases one or multiple global parameters need to be set, parameters that are seldom easy to set requiring in depth knowledge about the analyzed data. This paper proposes a parameter-free novel genetic clustering algorithm with an original method for encoding clustering solutions relying on density based clustering parameters. Within each clustering solution genotype, gene position, defined by several density based clustering attributes, plays a key role for recovering the encoded partition. Each gene defined density-based cluster can only attract object not already attracted by previously defined clusters. The proposed encoding scheme allows for always valid crossover results, with great offspring variations even when using simple crossover operators. While not requiring any input parameters, experiments involving multiple clustering validation indices as fitness criteria, across both synthetic and real data sets, show comparable results with existing density-based clustering techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "From the existing clustering techniques, spatial density-based ones register one of the most promising results in detecting arbitrary shaped data, being robust to outliers and not restricted by various data distributions. The existing literature contains a plethora of density based algorithms but in all cases one or multiple global parameters need to be set, parameters that are seldom easy to set requiring in depth knowledge about the analyzed data. This paper proposes a parameter-free novel genetic clustering algorithm with an original method for encoding clustering solutions relying on density based clustering parameters. Within each clustering solution genotype, gene position, defined by several density based clustering attributes, plays a key role for recovering the encoded partition. Each gene defined density-based cluster can only attract object not already attracted by previously defined clusters. The proposed encoding scheme allows for always valid crossover results, with great offspring variations even when using simple crossover operators. While not requiring any input parameters, experiments involving multiple clustering validation indices as fitness criteria, across both synthetic and real data sets, show comparable results with existing density-based clustering techniques.",
"fno": "06481030",
"keywords": [
"Data Compression",
"Genetic Algorithms",
"Genetics",
"Medical Computing",
"Pattern Clustering",
"Variable Density Based Genetic Clustering Parameters",
"Spatial Density Based Ones Register Method",
"Arbitrary Shaped Data Detection",
"Data Distributions",
"Data Analysis",
"Global Parameter Free Genetic Clustering Algorithm",
"Clustering Solution Genotype",
"Clustering Solution Encoding",
"Gene Position",
"Density Based Clustering Attributes",
"Offspring Variations",
"Crossover Operators",
"Clustering Validation Indices",
"Fitness Criteria",
"Synthetic Sets",
"Real Data Sets",
"Clustering Algorithms",
"Encoding",
"Indexes",
"Partitioning Algorithms",
"Genetics",
"Prototypes",
"Sociology",
"Genetic Algorithm",
"Genetic Clustering",
"Parameter Free Clustering",
"Density Based Clustering",
"Encoding Algorithm"
],
"authors": [
{
"affiliation": null,
"fullName": "Andrei Sorin Sabau",
"givenName": "Andrei Sorin",
"surname": "Sabau",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "synasc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-09-01T00:00:00",
"pubType": "proceedings",
"pages": "200-206",
"year": "2012",
"issn": null,
"isbn": "978-1-4673-5026-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06481029",
"articleId": "12OmNAS9zL2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06481031",
"articleId": "12OmNzIUg2X",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bigcomp/2018/3649/0/364901a190",
"title": "Ensemble Clustering Using Maximum Relative Density Path",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2018/364901a190/12OmNAYGlxw",
"parentPublication": {
"id": "proceedings/bigcomp/2018/3649/0",
"title": "2018 IEEE International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icii/2001/7010/3/00983048",
"title": "GDILC: a grid-based density-isoline clustering algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icii/2001/00983048/12OmNCeK2ko",
"parentPublication": {
"id": "proceedings/icii/2001/7010/3",
"title": "2001 International Conferences on Info-tech and Info-net. Proceedings",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2016/4459/0/4459a570",
"title": "A Genetic Algorithm Approach for Clustering Large Data Sets",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2016/4459a570/12OmNvA1h6S",
"parentPublication": {
"id": "proceedings/ictai/2016/4459/0",
"title": "2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smartcloud/2016/5263/0/5263a176",
"title": "A Distance and Density-Based Clustering Algorithm Using Automatic Peak Detection",
"doi": null,
"abstractUrl": "/proceedings-article/smartcloud/2016/5263a176/12OmNwudQPQ",
"parentPublication": {
"id": "proceedings/smartcloud/2016/5263/0",
"title": "2016 IEEE International Conference on Smart Cloud (SmartCloud)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smartcity/2015/1893/0/1893a689",
"title": "An Improved Fast Search Clustering Algorithm Based on Kernel Density",
"doi": null,
"abstractUrl": "/proceedings-article/smartcity/2015/1893a689/12OmNyLiuqK",
"parentPublication": {
"id": "proceedings/smartcity/2015/1893/0",
"title": "2015 IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2015/8302/0/8302a348",
"title": "A Text Clustering Algorithm Based on Find of Density Peaks",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2015/8302a348/12OmNzgeLKC",
"parentPublication": {
"id": "proceedings/itme/2015/8302/0",
"title": "2015 7th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2021/01/08674542",
"title": "Hierarchical Density-Based Clustering Using MapReduce",
"doi": null,
"abstractUrl": "/journal/bd/2021/01/08674542/18IlkAhVKkE",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2017/2636/0/263600a156",
"title": "Research and Application of Genetic Algorithm Based on Variable Crossover Probability",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2017/263600a156/1ap5xAvH0Oc",
"parentPublication": {
"id": "proceedings/icvrv/2017/2636/0",
"title": "2017 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cyberc/2019/2542/0/254200a253",
"title": "Density Clustering Algorithm Based on the Dynamic Selection of Cluster Center",
"doi": null,
"abstractUrl": "/proceedings-article/cyberc/2019/254200a253/1gjRXnYjTna",
"parentPublication": {
"id": "proceedings/cyberc/2019/2542/0",
"title": "2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2019/5584/0/558400a544",
"title": "A Robust Density Clustering Algorithm Based on Gravity Peak",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2019/558400a544/1jdDTvZf60M",
"parentPublication": {
"id": "proceedings/csci/2019/5584/0",
"title": "2019 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1MuZAVrWsOQ",
"title": "2022 International Conference on Artificial Intelligence of Things and Crowdsensing (AIoTCs)",
"acronym": "aiotcs",
"groupId": "10102096",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1MuZOoZmef6",
"doi": "10.1109/AIoTCs58181.2022.00039",
"title": "Data Mining Analysis of New Energy Vehicles Based on Constrained Clustering Algorithm",
"normalizedTitle": "Data Mining Analysis of New Energy Vehicles Based on Constrained Clustering Algorithm",
"abstract": "A large amount of data, such as the state of batteries and motors, are generated during the use and operation of new energy vehicles. How to use a large amount of data generated by new energy vehicles for knowledge mining, machine error retrieval and other tasks has become one of the difficulties in the industry. Data mining technology can mine potential valuable information from massive raw data, which has become the focus of computer scientists and data scientists. In this paper, constraint-based clustering analysis is used for the first time to model and solve the data mining problem of new energy vehicles A constraint-based minimum spanning tree clustering algorithm is proposed, which can deal with clustering problems with various constraints Experiments prove that the algorithm is reasonable and effective in solving the problem of driving energy consumption data mining during the use of new energy vehicles, which provides a valuable technical reference for data mining of new energy vehicles.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A large amount of data, such as the state of batteries and motors, are generated during the use and operation of new energy vehicles. How to use a large amount of data generated by new energy vehicles for knowledge mining, machine error retrieval and other tasks has become one of the difficulties in the industry. Data mining technology can mine potential valuable information from massive raw data, which has become the focus of computer scientists and data scientists. In this paper, constraint-based clustering analysis is used for the first time to model and solve the data mining problem of new energy vehicles A constraint-based minimum spanning tree clustering algorithm is proposed, which can deal with clustering problems with various constraints Experiments prove that the algorithm is reasonable and effective in solving the problem of driving energy consumption data mining during the use of new energy vehicles, which provides a valuable technical reference for data mining of new energy vehicles.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A large amount of data, such as the state of batteries and motors, are generated during the use and operation of new energy vehicles. How to use a large amount of data generated by new energy vehicles for knowledge mining, machine error retrieval and other tasks has become one of the difficulties in the industry. Data mining technology can mine potential valuable information from massive raw data, which has become the focus of computer scientists and data scientists. In this paper, constraint-based clustering analysis is used for the first time to model and solve the data mining problem of new energy vehicles A constraint-based minimum spanning tree clustering algorithm is proposed, which can deal with clustering problems with various constraints Experiments prove that the algorithm is reasonable and effective in solving the problem of driving energy consumption data mining during the use of new energy vehicles, which provides a valuable technical reference for data mining of new energy vehicles.",
"fno": "341000a206",
"keywords": [
"Data Mining",
"Energy Consumption",
"Pattern Clustering",
"Trees Mathematics",
"Constrained Clustering Algorithm",
"Constraint Based Clustering Analysis",
"Constraint Based Minimum Spanning Tree Clustering Algorithm",
"Data Mining Analysis",
"Data Mining Problem",
"Data Mining Technology",
"Data Scientists",
"Energy Consumption Data Mining",
"Knowledge Mining",
"Massive Raw Data",
"New Energy Vehicles",
"Industries",
"Analytical Models",
"Energy Consumption",
"Crowdsensing",
"Clustering Algorithms",
"Data Models",
"Partitioning Algorithms",
"Constrained Clustering Algorithm",
"New Energy Vehicles",
"Data Mining"
],
"authors": [
{
"affiliation": "Sichuan Aerospace Vocational College,Chengdu,Sichuan,China,610100",
"fullName": "Xu Wu",
"givenName": "Xu",
"surname": "Wu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "aiotcs",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-10-01T00:00:00",
"pubType": "proceedings",
"pages": "206-210",
"year": "2022",
"issn": null,
"isbn": "979-8-3503-3410-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "341000a201",
"articleId": "1MuZLlrQVe8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "341000a211",
"articleId": "1MuZN3d8t2w",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icccnt/2013/3926/0/06726842",
"title": "A study on classification techniques in data mining",
"doi": null,
"abstractUrl": "/proceedings-article/icccnt/2013/06726842/12OmNCga1Ql",
"parentPublication": {
"id": "proceedings/icccnt/2013/3926/0",
"title": "2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icacte/2008/3489/0/04737006",
"title": "Fuzzy Clustering Methods in Data Mining: A Comparative Case Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icacte/2008/04737006/12OmNzGlRDz",
"parentPublication": {
"id": "proceedings/icacte/2008/3489/0",
"title": "2008 International Conference on Advanced Computer Theory and Engineering (ICACTE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2009/3735/1/3735a465",
"title": "Energy Description of Data Object and Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/3735a465/12OmNzfXazN",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/1",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2018/10/08070337",
"title": "Partition Level Constrained Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2018/10/08070337/13rRUEgarkJ",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2022/9978/0/997800a122",
"title": "New energy electric vehicle charging safety hazard identification method based on clustering algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2022/997800a122/1ByeoWHuuVW",
"parentPublication": {
"id": "proceedings/icmtma/2022/9978/0",
"title": "2022 14th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ainit/2021/1296/0/129600a065",
"title": "Dormitory allocation and constrained clustering algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/ainit/2021/129600a065/1BzWu1BGVnG",
"parentPublication": {
"id": "proceedings/ainit/2021/1296/0",
"title": "2021 2nd International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cecit/2021/3757/0/375700b019",
"title": "Research on New Energy Vehicle Sales Forecast and Product Optimization Based on Data Mining",
"doi": null,
"abstractUrl": "/proceedings-article/cecit/2021/375700b019/1CdF0iorDXO",
"parentPublication": {
"id": "proceedings/cecit/2021/3757/0",
"title": "2021 2nd International Conference on Electronics, Communications and Information Technology (CECIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnisc/2022/5351/0/535100a406",
"title": "Analysis of Real-time Online Key Parameters of New Energy Pure Electric Vehicles Based on Big Data Mining",
"doi": null,
"abstractUrl": "/proceedings-article/icnisc/2022/535100a406/1KYt618TqJa",
"parentPublication": {
"id": "proceedings/icnisc/2022/5351/0",
"title": "2022 8th Annual International Conference on Network and Information Systems for Computers (ICNISC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icapc/2022/6303/0/630300a290",
"title": "Research on Intelligent networked new energy vehicles based on mining algorithm and big data analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icapc/2022/630300a290/1M7L2WF4lDa",
"parentPublication": {
"id": "proceedings/icapc/2022/6303/0",
"title": "2022 International Conference on Applied Physics and Computing (ICAPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aemcse/2021/1596/0/159600a749",
"title": "Prediction of remaining mileage of hydrogen energy vehicles based on LSTM",
"doi": null,
"abstractUrl": "/proceedings-article/aemcse/2021/159600a749/1wcdaRYXwdi",
"parentPublication": {
"id": "proceedings/aemcse/2021/1596/0",
"title": "2021 4th International Conference on Advanced Electronic Materials, Computers and Software Engineering (AEMCSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxE2mTD",
"title": "2015 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"acronym": "iccvw",
"groupId": "1800041",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvsDHJg",
"doi": "10.1109/ICCVW.2015.12",
"title": "Do Deep Neural Networks Learn Facial Action Units When Doing Expression Recognition?",
"normalizedTitle": "Do Deep Neural Networks Learn Facial Action Units When Doing Expression Recognition?",
"abstract": "Despite being the appearance-based classifier of choice in recent years, relatively few works have examined how much convolutional neural networks (CNNs) can improve performance on accepted expression recognition benchmarks and, more importantly, examine what it is they actually learn. In this work, not only do we show that CNNs can achieve strong performance, but we also introduce an approach to decipher which portions of the face influence the CNN's predictions. First, we train a zero-bias CNN on facial expression data and achieve, to our knowledge, state-of-the-art performance on two expression recognition benchmarks: the extended Cohn-Kanade (CK+) dataset and the Toronto Face Dataset (TFD). We then qualitatively analyze the network by visualizing the spatial patterns that maximally excite different neurons in the convolutional layers and show how they resemble Facial Action Units (FAUs). Finally, we use the FAU labels provided in the CK+ dataset to verify that the FAUs observed in our filter visualizations indeed align with the subject's facial movements.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Despite being the appearance-based classifier of choice in recent years, relatively few works have examined how much convolutional neural networks (CNNs) can improve performance on accepted expression recognition benchmarks and, more importantly, examine what it is they actually learn. In this work, not only do we show that CNNs can achieve strong performance, but we also introduce an approach to decipher which portions of the face influence the CNN's predictions. First, we train a zero-bias CNN on facial expression data and achieve, to our knowledge, state-of-the-art performance on two expression recognition benchmarks: the extended Cohn-Kanade (CK+) dataset and the Toronto Face Dataset (TFD). We then qualitatively analyze the network by visualizing the spatial patterns that maximally excite different neurons in the convolutional layers and show how they resemble Facial Action Units (FAUs). Finally, we use the FAU labels provided in the CK+ dataset to verify that the FAUs observed in our filter visualizations indeed align with the subject's facial movements.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Despite being the appearance-based classifier of choice in recent years, relatively few works have examined how much convolutional neural networks (CNNs) can improve performance on accepted expression recognition benchmarks and, more importantly, examine what it is they actually learn. In this work, not only do we show that CNNs can achieve strong performance, but we also introduce an approach to decipher which portions of the face influence the CNN's predictions. First, we train a zero-bias CNN on facial expression data and achieve, to our knowledge, state-of-the-art performance on two expression recognition benchmarks: the extended Cohn-Kanade (CK+) dataset and the Toronto Face Dataset (TFD). We then qualitatively analyze the network by visualizing the spatial patterns that maximally excite different neurons in the convolutional layers and show how they resemble Facial Action Units (FAUs). Finally, we use the FAU labels provided in the CK+ dataset to verify that the FAUs observed in our filter visualizations indeed align with the subject's facial movements.",
"fno": "5720a019",
"keywords": [
"Face",
"Face Recognition",
"Training",
"Emotion Recognition",
"Databases",
"Biological Neural Networks",
"Benchmark Testing"
],
"authors": [
{
"affiliation": null,
"fullName": "Pooya Khorrami",
"givenName": "Pooya",
"surname": "Khorrami",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Tom Le Paine",
"givenName": "Tom Le",
"surname": "Paine",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Thomas S. Huang",
"givenName": "Thomas S.",
"surname": "Huang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccvw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-12-01T00:00:00",
"pubType": "proceedings",
"pages": "19-27",
"year": "2015",
"issn": null,
"isbn": "978-1-4673-9711-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "5720a010",
"articleId": "12OmNC3Xhcq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "5720a028",
"articleId": "12OmNzzP5GM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2014/4308/0/4308a132",
"title": "Real-Time Mobile Facial Expression Recognition System -- A Case Study",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2014/4308a132/12OmNAmVH7l",
"parentPublication": {
"id": "proceedings/cvprw/2014/4308/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2016/4320/0/07945716",
"title": "New distances combination for facial expression recognition from image sequences",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2016/07945716/12OmNyrIarE",
"parentPublication": {
"id": "proceedings/aiccsa/2016/4320/0",
"title": "2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2021/02/08528894",
"title": "Facial Expression Recognition with Identity and Emotion Joint Learning",
"doi": null,
"abstractUrl": "/journal/ta/2021/02/08528894/17D45XwUAMr",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcomp/2019/7789/0/08679370",
"title": "Deep Explanation Model for Facial Expression Recognition Through Facial Action Coding Unit",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2019/08679370/18XkkcOZO24",
"parentPublication": {
"id": "proceedings/bigcomp/2019/7789/0",
"title": "2019 IEEE International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csase/2022/2632/0/09759750",
"title": "Facial Emotion Classification of Multi-Type Datasets based on SVM Classifier",
"doi": null,
"abstractUrl": "/proceedings-article/csase/2022/09759750/1CRvUn98cso",
"parentPublication": {
"id": "proceedings/csase/2022/2632/0",
"title": "2022 International Conference on Computer Science and Software Engineering (CSASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csii/2021/0272/0/027200a043",
"title": "An Enhanced Expression Recognition Based on Sparse Representation Using Data Normalization",
"doi": null,
"abstractUrl": "/proceedings-article/csii/2021/027200a043/1CakYULk72o",
"parentPublication": {
"id": "proceedings/csii/2021/0272/0",
"title": "2021 8th International Conference on Computational Science/Intelligence and Applied Informatics (CSII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aciiw/2019/3891/0/08925055",
"title": "Deep Domain Adaptation for Facial Expression Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/aciiw/2019/08925055/1fHFerZYE3m",
"parentPublication": {
"id": "proceedings/aciiw/2019/3891/0",
"title": "2019 8th International Conference on Affective Computing and Intelligent Interaction Workshops and Demos (ACIIW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2019/3888/0/08925461",
"title": "Towards Facial De-Expression and Expression Recognition in the Wild",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2019/08925461/1fHGIFJatWw",
"parentPublication": {
"id": "proceedings/acii/2019/3888/0",
"title": "2019 8th International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412288",
"title": "Real-Time Driver Drowsiness Detection using Facial Action Units",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412288/1tmhEGkfhYI",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2020/1924/0/192400a514",
"title": "Happy Emotion Recognition in Videos Via Apex Spotting and Temporal Models",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2020/192400a514/1uHhkZvdaTu",
"parentPublication": {
"id": "proceedings/wi-iat/2020/1924/0",
"title": "2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwHz03L",
"title": "2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)",
"acronym": "icfhr",
"groupId": "1000298",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwGqBo2",
"doi": "10.1109/ICFHR.2016.0046",
"title": "On the Benefits of Convolutional Neural Network Combinations in Offline Handwriting Recognition",
"normalizedTitle": "On the Benefits of Convolutional Neural Network Combinations in Offline Handwriting Recognition",
"abstract": "In this paper, we elaborate the advantages of combining two neural network methodologies, convolutional neural networks (CNN) and long short-term memory (LSTM) recurrent neural networks, with the framework of hybrid hidden Markov models (HMM) for recognizing offline handwriting text. CNNs employ shift-invariant filters to generate discriminative features within neural networks. We show that CNNs are powerful tools to extract general purpose features that even work well for unknown classes. We evaluate our system on a Chinese handwritten text database and provide a GPU-based implementation that can be used to reproduce the experiments. All experiments were conducted with RWTH OCR, an open-source system developed at our institute.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we elaborate the advantages of combining two neural network methodologies, convolutional neural networks (CNN) and long short-term memory (LSTM) recurrent neural networks, with the framework of hybrid hidden Markov models (HMM) for recognizing offline handwriting text. CNNs employ shift-invariant filters to generate discriminative features within neural networks. We show that CNNs are powerful tools to extract general purpose features that even work well for unknown classes. We evaluate our system on a Chinese handwritten text database and provide a GPU-based implementation that can be used to reproduce the experiments. All experiments were conducted with RWTH OCR, an open-source system developed at our institute.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we elaborate the advantages of combining two neural network methodologies, convolutional neural networks (CNN) and long short-term memory (LSTM) recurrent neural networks, with the framework of hybrid hidden Markov models (HMM) for recognizing offline handwriting text. CNNs employ shift-invariant filters to generate discriminative features within neural networks. We show that CNNs are powerful tools to extract general purpose features that even work well for unknown classes. We evaluate our system on a Chinese handwritten text database and provide a GPU-based implementation that can be used to reproduce the experiments. All experiments were conducted with RWTH OCR, an open-source system developed at our institute.",
"fno": "0981a193",
"keywords": [
"Hidden Markov Models",
"Neurons",
"Training",
"Handwriting Recognition",
"Biological Neural Networks",
"Computer Architecture",
"Logic Gates",
"Continuous Chinese Handwritten Text",
"Convolutional Neural Network",
"Long Short Term Memory",
"Hybrid HMM",
"Framewise Training",
"Offline Handwriting"
],
"authors": [
{
"affiliation": null,
"fullName": "Dewi Suryani",
"givenName": "Dewi",
"surname": "Suryani",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Patrick Doetsch",
"givenName": "Patrick",
"surname": "Doetsch",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Hermann Ney",
"givenName": "Hermann",
"surname": "Ney",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icfhr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-10-01T00:00:00",
"pubType": "proceedings",
"pages": "193-198",
"year": "2016",
"issn": "2167-6445",
"isbn": "978-1-5090-0981-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "0981a187",
"articleId": "12OmNwoghas",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "0981a199",
"articleId": "12OmNqEji0X",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/das/2014/3244/0/3244a111",
"title": "The RWTH Large Vocabulary Arabic Handwriting Recognition System",
"doi": null,
"abstractUrl": "/proceedings-article/das/2014/3244a111/12OmNBQ2W25",
"parentPublication": {
"id": "proceedings/das/2014/3244/0",
"title": "2014 11th IAPR International Workshop on Document Analysis Systems (DAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfhr/2016/0981/0/0981a361",
"title": "Bidirectional Decoder Networks for Attention-Based End-to-End Offline Handwriting Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icfhr/2016/0981a361/12OmNqGRG67",
"parentPublication": {
"id": "proceedings/icfhr/2016/0981/0",
"title": "2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851c285",
"title": "CNN-RNN: A Unified Framework for Multi-label Image Classification",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851c285/12OmNqGRGbr",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfhr/2016/0981/0/0981a072",
"title": "DNN-HMM for Large Vocabulary Mongolian Offline Handwriting Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icfhr/2016/0981a072/12OmNqHqSBt",
"parentPublication": {
"id": "proceedings/icfhr/2016/0981/0",
"title": "2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460220",
"title": "Cascaded heterogeneous convolutional neural networks for handwritten digit recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460220/12OmNwc3wsJ",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfhr/2014/4335/0/06981033",
"title": "Fast and Robust Training of Recurrent Neural Networks for Offline Handwriting Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icfhr/2014/06981033/12OmNwnH4NB",
"parentPublication": {
"id": "proceedings/icfhr/2014/4335/0",
"title": "2014 14th International Conference on Frontiers in Handwriting Recognition (ICFHR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2009/3725/0/3725a773",
"title": "Improvements in BBN's HMM-Based Offline Arabic Handwriting Recognition System",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2009/3725a773/12OmNwogh3D",
"parentPublication": {
"id": "proceedings/icdar/2009/3725/0",
"title": "2009 10th International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2013/4999/0/06628630",
"title": "Feature Design for Offline Arabic Handwriting Recognition: Handcrafted vs Automated?",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2013/06628630/12OmNxisQQq",
"parentPublication": {
"id": "proceedings/icdar/2013/4999/0",
"title": "2013 12th International Conference on Document Analysis and Recognition (ICDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acit/2018/0385/0/08672667",
"title": "Convolutional Neural Network and BLSTM for Offline Arabic Handwriting Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/acit/2018/08672667/18Ipks9H4rK",
"parentPublication": {
"id": "proceedings/acit/2018/0385/0",
"title": "2018 International Arab Conference on Information Technology (ACIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2019/3014/0/301400a355",
"title": "No Padding Please: Efficient Neural Handwriting Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2019/301400a355/1h81zBMeg6s",
"parentPublication": {
"id": "proceedings/icdar/2019/3014/0",
"title": "2019 International Conference on Document Analysis and Recognition (ICDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNC1GueH",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwc3wsJ",
"doi": "",
"title": "Cascaded heterogeneous convolutional neural networks for handwritten digit recognition",
"normalizedTitle": "Cascaded heterogeneous convolutional neural networks for handwritten digit recognition",
"abstract": "This paper presents a handwritten digit recognition method based on cascaded heterogeneous convolutional neural networks (CNNs). The reliability and complementation of heterogeneous CNNs are investigated in our method. Each CNN recognizes a proportion of input samples with high-confidence, and feeds the rejected samples into the next CNN. The samples rejected by the last CNN are recognized by a voting committee of all CNNs. Experiments on MNIST dataset show that our method achieves an error rate 0.23% using only 5 C-NNs, on par with human vision system. Using heterogeneous networks can reduce the number of CNNs needed to reach certain performance compared with networks built from the same type. Further improvements include fine-tuning the rejection threshold of each CNN and adding CNNs of more types.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a handwritten digit recognition method based on cascaded heterogeneous convolutional neural networks (CNNs). The reliability and complementation of heterogeneous CNNs are investigated in our method. Each CNN recognizes a proportion of input samples with high-confidence, and feeds the rejected samples into the next CNN. The samples rejected by the last CNN are recognized by a voting committee of all CNNs. Experiments on MNIST dataset show that our method achieves an error rate 0.23% using only 5 C-NNs, on par with human vision system. Using heterogeneous networks can reduce the number of CNNs needed to reach certain performance compared with networks built from the same type. Further improvements include fine-tuning the rejection threshold of each CNN and adding CNNs of more types.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a handwritten digit recognition method based on cascaded heterogeneous convolutional neural networks (CNNs). The reliability and complementation of heterogeneous CNNs are investigated in our method. Each CNN recognizes a proportion of input samples with high-confidence, and feeds the rejected samples into the next CNN. The samples rejected by the last CNN are recognized by a voting committee of all CNNs. Experiments on MNIST dataset show that our method achieves an error rate 0.23% using only 5 C-NNs, on par with human vision system. Using heterogeneous networks can reduce the number of CNNs needed to reach certain performance compared with networks built from the same type. Further improvements include fine-tuning the rejection threshold of each CNN and adding CNNs of more types.",
"fno": "06460220",
"keywords": [
"Handwritten Character Recognition",
"Image Segmentation",
"Neural Nets",
"Reliability",
"Handwritten Digit Recognition Method",
"Cascaded Heterogeneous Convolutional Neural Networks",
"Heterogeneous CNN Reliability",
"MNIST Dataset",
"Human Vision System",
"Rejection Threshold Fine Tuning",
"Error Analysis",
"Training",
"Neural Networks",
"Handwriting Recognition",
"Neurons"
],
"authors": [
{
"affiliation": "Fujitsu Research & Development Center Co. Ltd., Beijing, 100025, China",
"fullName": "Chunpeng Wu",
"givenName": "Chunpeng",
"surname": "Wu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Fujitsu Research & Development Center Co. Ltd., Beijing, 100025, China",
"fullName": "Wei Fan",
"givenName": "Wei",
"surname": "Fan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Fujitsu Research & Development Center Co. Ltd., Beijing, 100025, China",
"fullName": "Yuan He",
"givenName": "Yuan",
"surname": "He",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Fujitsu Research & Development Center Co. Ltd., Beijing, 100025, China",
"fullName": "Jun Sun",
"givenName": "Jun",
"surname": "Sun",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Fujitsu Research & Development Center Co. Ltd., Beijing, 100025, China",
"fullName": "Satoshi Naoi",
"givenName": "Satoshi",
"surname": "Naoi",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-11-01T00:00:00",
"pubType": "proceedings",
"pages": "657-660",
"year": "2012",
"issn": "1051-4651",
"isbn": "978-1-4673-2216-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06460219",
"articleId": "12OmNyoiYY1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06460221",
"articleId": "12OmNrAv3Dq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icfhr/2016/0981/0/0981a524",
"title": "Tied Spatial Transformer Networks for Digit Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icfhr/2016/0981a524/12OmNBTawkv",
"parentPublication": {
"id": "proceedings/icfhr/2016/0981/0",
"title": "2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/das/2012/4661/0/06195348",
"title": "Offline handwritten English character recognition based on convolutional neural network",
"doi": null,
"abstractUrl": "/proceedings-article/das/2012/06195348/12OmNqH9hmf",
"parentPublication": {
"id": "proceedings/das/2012/4661/0",
"title": "Document Analysis Systems, IAPR International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfhr/2014/4335/0/06981035",
"title": "Handwritten Character Recognition by Alternately Trained Relaxation Convolutional Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/icfhr/2014/06981035/12OmNvwkukh",
"parentPublication": {
"id": "proceedings/icfhr/2014/4335/0",
"title": "2014 14th International Conference on Frontiers in Handwriting Recognition (ICFHR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfhr/2016/0981/0/0981a193",
"title": "On the Benefits of Convolutional Neural Network Combinations in Offline Handwriting Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icfhr/2016/0981a193/12OmNwGqBo2",
"parentPublication": {
"id": "proceedings/icfhr/2016/0981/0",
"title": "2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2016/2239/0/07515901",
"title": "Traffic sign detection based on cascaded convolutional neural networks",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2016/07515901/12OmNxYtubf",
"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": "proceedings/acpr/2017/3354/0/3354a846",
"title": "Holistic Handwritten Uyghur Word Recognition Using Convolutional Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/acpr/2017/3354a846/17D45XuDNHO",
"parentPublication": {
"id": "proceedings/acpr/2017/3354/0",
"title": "2017 4th IAPR Asian Conference on Pattern Recognition (ACPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdarw/2019/5054/5/505405a165",
"title": "Recognition of Handwritten Chemical Organic Ring Structure Symbols Using Convolutional Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icdarw/2019/505405a165/1eLyhqM0qvm",
"parentPublication": {
"id": "icdarw/2019/5054/5",
"title": "2019 International Conference on Document Analysis and Recognition Workshops (ICDARW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2019/4253/0/425300a245",
"title": "Recognition of Simple Handwritten Polynomials Using Segmentation with Fractional Calculus and Convolutional Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2019/425300a245/1fHkKJ5iQiQ",
"parentPublication": {
"id": "proceedings/bracis/2019/4253/0",
"title": "2019 8th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ewdts/2020/9899/0/09224822",
"title": "Convolution Neural Network Learning Features for Handwritten Digit Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/ewdts/2020/09224822/1nWNUSzNdGU",
"parentPublication": {
"id": "proceedings/ewdts/2020/9899/0",
"title": "2020 IEEE East-West Design & Test Symposium (EWDTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cds/2021/0428/0/042800a442",
"title": "Multi-language Handwritten Numeral Recognition with Convolutional Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/cds/2021/042800a442/1uZxzsCMnNC",
"parentPublication": {
"id": "proceedings/cds/2021/0428/0",
"title": "2021 2nd International Conference on Computing and Data Science (CDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBDyAaZ",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"acronym": "iccv",
"groupId": "1000149",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxZkht1",
"doi": "10.1109/ICCV.2015.314",
"title": "HD-CNN: Hierarchical Deep Convolutional Neural Networks for Large Scale Visual Recognition",
"normalizedTitle": "HD-CNN: Hierarchical Deep Convolutional Neural Networks for Large Scale Visual Recognition",
"abstract": "In image classification, visual separability between different object categories is highly uneven, and some categories are more difficult to distinguish than others. Such difficult categories demand more dedicated classifiers. However, existing deep convolutional neural networks (CNN) are trained as flat N-way classifiers, and few efforts have been made to leverage the hierarchical structure of categories. In this paper, we introduce hierarchical deep CNNs (HD-CNNs) by embedding deep CNNs into a two-level category hierarchy. An HD-CNN separates easy classes using a coarse category classifier while distinguishing difficult classes using fine category classifiers. During HDCNN training, component-wise pretraining is followed by global fine-tuning with a multinomial logistic loss regularized by a coarse category consistency term. In addition, conditional executions of fine category classifiers and layer parameter compression make HD-CNNs scalable for largescale visual recognition. We achieve state-of-the-art results on both CIFAR100 and large-scale ImageNet 1000-class benchmark datasets. In our experiments, we build up three different two-level HD-CNNs, and they lower the top-1 error of the standard CNNs by 2:65%, 3:1%, and 1:1%.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In image classification, visual separability between different object categories is highly uneven, and some categories are more difficult to distinguish than others. Such difficult categories demand more dedicated classifiers. However, existing deep convolutional neural networks (CNN) are trained as flat N-way classifiers, and few efforts have been made to leverage the hierarchical structure of categories. In this paper, we introduce hierarchical deep CNNs (HD-CNNs) by embedding deep CNNs into a two-level category hierarchy. An HD-CNN separates easy classes using a coarse category classifier while distinguishing difficult classes using fine category classifiers. During HDCNN training, component-wise pretraining is followed by global fine-tuning with a multinomial logistic loss regularized by a coarse category consistency term. In addition, conditional executions of fine category classifiers and layer parameter compression make HD-CNNs scalable for largescale visual recognition. We achieve state-of-the-art results on both CIFAR100 and large-scale ImageNet 1000-class benchmark datasets. In our experiments, we build up three different two-level HD-CNNs, and they lower the top-1 error of the standard CNNs by 2:65%, 3:1%, and 1:1%.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In image classification, visual separability between different object categories is highly uneven, and some categories are more difficult to distinguish than others. Such difficult categories demand more dedicated classifiers. However, existing deep convolutional neural networks (CNN) are trained as flat N-way classifiers, and few efforts have been made to leverage the hierarchical structure of categories. In this paper, we introduce hierarchical deep CNNs (HD-CNNs) by embedding deep CNNs into a two-level category hierarchy. An HD-CNN separates easy classes using a coarse category classifier while distinguishing difficult classes using fine category classifiers. During HDCNN training, component-wise pretraining is followed by global fine-tuning with a multinomial logistic loss regularized by a coarse category consistency term. In addition, conditional executions of fine category classifiers and layer parameter compression make HD-CNNs scalable for largescale visual recognition. We achieve state-of-the-art results on both CIFAR100 and large-scale ImageNet 1000-class benchmark datasets. In our experiments, we build up three different two-level HD-CNNs, and they lower the top-1 error of the standard CNNs by 2:65%, 3:1%, and 1:1%.",
"fno": "8391c740",
"keywords": [
"Training",
"Visualization",
"Feature Extraction",
"Neural Networks",
"Probabilistic Logic",
"Training Data",
"Computer Architecture"
],
"authors": [
{
"affiliation": null,
"fullName": "Zhicheng Yan",
"givenName": "Zhicheng",
"surname": "Yan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Hao Zhang",
"givenName": "Hao",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Robinson Piramuthu",
"givenName": "Robinson",
"surname": "Piramuthu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Vignesh Jagadeesh",
"givenName": "Vignesh",
"surname": "Jagadeesh",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Dennis DeCoste",
"givenName": "Dennis",
"surname": "DeCoste",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Wei Di",
"givenName": "Wei",
"surname": "Di",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yizhou Yu",
"givenName": "Yizhou",
"surname": "Yu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-12-01T00:00:00",
"pubType": "proceedings",
"pages": "2740-2748",
"year": "2015",
"issn": "2380-7504",
"isbn": "978-1-4673-8391-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "8391c731",
"articleId": "12OmNAle6Kp",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "8391c749",
"articleId": "12OmNzmcluY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2016/8851/0/8851c285",
"title": "CNN-RNN: A Unified Framework for Multi-label Image Classification",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851c285/12OmNqGRGbr",
"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/07410840",
"title": "Predicting Deep Zero-Shot Convolutional Neural Networks Using Textual Descriptions",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/07410840/12OmNrAv3Cs",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2019/07/08370896",
"title": "Feedback Convolutional Neural Network for Visual Localization and Segmentation",
"doi": null,
"abstractUrl": "/journal/tp/2019/07/08370896/13rRUwdIOTs",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000g857",
"title": "Zero-Shot Recognition via Semantic Embeddings and Knowledge Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000g857/17D45WIXbND",
"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/sbac-pad/2022/5155/0/515500a180",
"title": "FiBHA: Fixed Budget Hybrid CNN Accelerator",
"doi": null,
"abstractUrl": "/proceedings-article/sbac-pad/2022/515500a180/1JgrBQRoUlW",
"parentPublication": {
"id": "proceedings/sbac-pad/2022/5155/0",
"title": "2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2020/9360/0/09150800",
"title": "Hierarchical Color Learning in Convolutional Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09150800/1lPHawaBFg4",
"parentPublication": {
"id": "proceedings/cvprw/2020/9360/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800h639",
"title": "Dynamic Hierarchical Mimicking Towards Consistent Optimization Objectives",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800h639/1m3o48JdlhC",
"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/big-data/2020/6251/0/09378237",
"title": "Combined Convolutional and Recurrent Neural Networks for Hierarchical Classification of Images",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09378237/1s647oEI7cs",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iisa/2021/0032/0/09555567",
"title": "Semantic Information in Gating Patterns of Dynamic Convolutional Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/iisa/2021/09555567/1xxcm4uY87K",
"parentPublication": {
"id": "proceedings/iisa/2021/0032/0",
"title": "2021 12th International Conference on Information, Intelligence, Systems & Applications (IISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900b664",
"title": "Learning Deep Classifiers Consistent with Fine-Grained Novelty Detection",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900b664/1yeKe53YZfW",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNCbCrVT",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "2014",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxcvh5p",
"doi": "10.1109/CVPR.2014.222",
"title": "Learning and Transferring Mid-level Image Representations Using Convolutional Neural Networks",
"normalizedTitle": "Learning and Transferring Mid-level Image Representations Using Convolutional Neural Networks",
"abstract": "Convolutional neural networks (CNN) have recently shown outstanding image classification performance in the large- scale visual recognition challenge (ILSVRC2012). The suc- cess of CNNs is attributed to their ability to learn rich mid- level image representations as opposed to hand-designed low-level features used in other image classification meth- ods. Learning CNNs, however, amounts to estimating mil- lions of parameters and requires a very large number of annotated image samples. This property currently prevents application of CNNs to problems with limited training data. In this work we show how image representations learned with CNNs on large-scale annotated datasets can be effi- ciently transferred to other visual recognition tasks with limited amount of training data. We design a method to reuse layers trained on the ImageNet dataset to compute mid-level image representation for images in the PASCAL VOC dataset. We show that despite differences in image statistics and tasks in the two datasets, the transferred rep- resentation leads to significantly improved results for object and action classification, outperforming the current state of the art on Pascal VOC 2007 and 2012 datasets. We also show promising results for object and action localization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Convolutional neural networks (CNN) have recently shown outstanding image classification performance in the large- scale visual recognition challenge (ILSVRC2012). The suc- cess of CNNs is attributed to their ability to learn rich mid- level image representations as opposed to hand-designed low-level features used in other image classification meth- ods. Learning CNNs, however, amounts to estimating mil- lions of parameters and requires a very large number of annotated image samples. This property currently prevents application of CNNs to problems with limited training data. In this work we show how image representations learned with CNNs on large-scale annotated datasets can be effi- ciently transferred to other visual recognition tasks with limited amount of training data. We design a method to reuse layers trained on the ImageNet dataset to compute mid-level image representation for images in the PASCAL VOC dataset. We show that despite differences in image statistics and tasks in the two datasets, the transferred rep- resentation leads to significantly improved results for object and action classification, outperforming the current state of the art on Pascal VOC 2007 and 2012 datasets. We also show promising results for object and action localization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Convolutional neural networks (CNN) have recently shown outstanding image classification performance in the large- scale visual recognition challenge (ILSVRC2012). The suc- cess of CNNs is attributed to their ability to learn rich mid- level image representations as opposed to hand-designed low-level features used in other image classification meth- ods. Learning CNNs, however, amounts to estimating mil- lions of parameters and requires a very large number of annotated image samples. This property currently prevents application of CNNs to problems with limited training data. In this work we show how image representations learned with CNNs on large-scale annotated datasets can be effi- ciently transferred to other visual recognition tasks with limited amount of training data. We design a method to reuse layers trained on the ImageNet dataset to compute mid-level image representation for images in the PASCAL VOC dataset. We show that despite differences in image statistics and tasks in the two datasets, the transferred rep- resentation leads to significantly improved results for object and action classification, outperforming the current state of the art on Pascal VOC 2007 and 2012 datasets. We also show promising results for object and action localization.",
"fno": "5118b717",
"keywords": [
"Training",
"Training Data",
"Visualization",
"Image Recognition",
"Image Representation",
"Neural Networks",
"Computer Vision"
],
"authors": [
{
"affiliation": null,
"fullName": "Maxime Oquab",
"givenName": "Maxime",
"surname": "Oquab",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Leon Bottou",
"givenName": "Leon",
"surname": "Bottou",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Ivan Laptev",
"givenName": "Ivan",
"surname": "Laptev",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Josef Sivic",
"givenName": "Josef",
"surname": "Sivic",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2014-06-01T00:00:00",
"pubType": "proceedings",
"pages": "1717-1724",
"year": "2014",
"issn": "1063-6919",
"isbn": "978-1-4799-5118-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "5118b709",
"articleId": "12OmNxGSm3e",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "5118b725",
"articleId": "12OmNBf94VG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2016/8851/0/8851d557",
"title": "DeepCAMP: Deep Convolutional Action & Attribute Mid-Level Patterns",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851d557/12OmNAnMuGR",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2016/2491/0/2491a016",
"title": "Dense Image Labeling Using Deep Convolutional Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2016/2491a016/12OmNB8kI21",
"parentPublication": {
"id": "proceedings/crv/2016/2491/0",
"title": "2016 13th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2018/4210/0/421001a685",
"title": "Multimodal Object Classification Using Bidirectional Gated Recurrent Unit Networks",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2018/421001a685/12OmNBTawgq",
"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/cvpr/2014/5118/0/5118c385",
"title": "Immediate, Scalable Object Category Detection",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118c385/12OmNBlofVH",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457f235",
"title": "Learning Object Interactions and Descriptions for Semantic Image Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457f235/12OmNs5rkSx",
"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/2015/8391/0/8391b431",
"title": "Webly Supervised Learning of Convolutional Networks",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391b431/12OmNwLfMBa",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851d194",
"title": "Efficient Piecewise Training of Deep Structured Models for Semantic Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851d194/12OmNyQYtga",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icgi/2017/2280/0/2280a060",
"title": "Reuse of Mid-Level Feature in Deep Convolutional Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/icgi/2017/2280a060/12OmNym2c5a",
"parentPublication": {
"id": "proceedings/icgi/2017/2280/0",
"title": "2017 International Conference on Green Informatics (ICGI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2015/6759/0/07301274",
"title": "Multi-scale pyramid pooling for deep convolutional representation",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2015/07301274/12OmNzlUKhN",
"parentPublication": {
"id": "proceedings/cvprw/2015/6759/0",
"title": "2015 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2016/01/07112511",
"title": "Region-Based Convolutional Networks for Accurate Object Detection and Segmentation",
"doi": null,
"abstractUrl": "/journal/tp/2016/01/07112511/13rRUy2YLZF",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "13xI8A66zF1",
"title": "2017 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"acronym": "aipr",
"groupId": "1000046",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "13xI8A8WyXm",
"doi": "10.1109/AIPR.2017.8457965",
"title": "The poor generalization of deep convolutional networks to aerial imagery from new geographic locations: an empirical study with solar array detection",
"normalizedTitle": "The poor generalization of deep convolutional networks to aerial imagery from new geographic locations: an empirical study with solar array detection",
"abstract": "Convolutional neural networks (CNNs) have recently achieved unprecedented performance for the automatic recognition of objects (e.g., buildings, roads, or vehicles) in color aerial imagery. Although these results are promising, questions remain about their practical applicability. This is because there is a wide variability in the visual characteristics of remote sensing imagery across different geographic locations, and CNNs are often trained and tested on imagery from nearby (or the same) geographic locations. It is therefore unclear whether trained CNNs will perform well on new, previously unseen, geographic locations, which is an important practical consideration. In this work we investigate this problem when applying CNNs for solar array detection on a large aerial imagery dataset comprised of two nearby US cities. We compare the performance of CNNs under two conditions: training and testing on the same city vs training on one city and testing on another city. We discuss several subtle difficulties with these experiments and make recommendations. We show that there can be substantial performance loss in second case, when compared to the first. We also investigate how much training data is required from the unseen city in order to fine-tune the CNN so that it performs well. We investigate several different fine-tuning strategies, yielding a clear winner.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Convolutional neural networks (CNNs) have recently achieved unprecedented performance for the automatic recognition of objects (e.g., buildings, roads, or vehicles) in color aerial imagery. Although these results are promising, questions remain about their practical applicability. This is because there is a wide variability in the visual characteristics of remote sensing imagery across different geographic locations, and CNNs are often trained and tested on imagery from nearby (or the same) geographic locations. It is therefore unclear whether trained CNNs will perform well on new, previously unseen, geographic locations, which is an important practical consideration. In this work we investigate this problem when applying CNNs for solar array detection on a large aerial imagery dataset comprised of two nearby US cities. We compare the performance of CNNs under two conditions: training and testing on the same city vs training on one city and testing on another city. We discuss several subtle difficulties with these experiments and make recommendations. We show that there can be substantial performance loss in second case, when compared to the first. We also investigate how much training data is required from the unseen city in order to fine-tune the CNN so that it performs well. We investigate several different fine-tuning strategies, yielding a clear winner.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Convolutional neural networks (CNNs) have recently achieved unprecedented performance for the automatic recognition of objects (e.g., buildings, roads, or vehicles) in color aerial imagery. Although these results are promising, questions remain about their practical applicability. This is because there is a wide variability in the visual characteristics of remote sensing imagery across different geographic locations, and CNNs are often trained and tested on imagery from nearby (or the same) geographic locations. It is therefore unclear whether trained CNNs will perform well on new, previously unseen, geographic locations, which is an important practical consideration. In this work we investigate this problem when applying CNNs for solar array detection on a large aerial imagery dataset comprised of two nearby US cities. We compare the performance of CNNs under two conditions: training and testing on the same city vs training on one city and testing on another city. We discuss several subtle difficulties with these experiments and make recommendations. We show that there can be substantial performance loss in second case, when compared to the first. We also investigate how much training data is required from the unseen city in order to fine-tune the CNN so that it performs well. We investigate several different fine-tuning strategies, yielding a clear winner.",
"fno": "08457965",
"keywords": [
"Urban Areas",
"Training Data",
"Training",
"Visualization",
"Testing",
"Image Recognition",
"Buildings",
"Semantic Segmentation",
"Remote Sensing",
"Aerial Imagery",
"Geographic Generalization"
],
"authors": [
{
"affiliation": "Department of Electrical & Computer Engineering, Duke University, Durham, NC, 27708",
"fullName": "Rui Wang",
"givenName": "Rui",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Electrical & Computer Engineering, Duke University, Durham, NC, 27708",
"fullName": "Joseph Camilo",
"givenName": "Joseph",
"surname": "Camilo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Electrical & Computer Engineering, Duke University, Durham, NC, 27708",
"fullName": "Leslie M. Collins",
"givenName": "Leslie M.",
"surname": "Collins",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Energy Initiative, Duke University, Durham, NC, 27708",
"fullName": "Kyle Bradbury",
"givenName": "Kyle",
"surname": "Bradbury",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Electrical & Computer Engineering, Duke University, Durham, NC, 27708",
"fullName": "Jordan M. Malof",
"givenName": "Jordan M.",
"surname": "Malof",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "aipr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-10-01T00:00:00",
"pubType": "proceedings",
"pages": "1-8",
"year": "2017",
"issn": "2332-5615",
"isbn": "978-1-5386-1235-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08457956",
"articleId": "13xI8Aja7Dm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08457945",
"articleId": "13xI8AKpC7x",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/aiccsa/2016/4320/0/07945628",
"title": "The geo-social relevance ranking: A method based on geographic information and social media data",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2016/07945628/12OmNApcukM",
"parentPublication": {
"id": "proceedings/aiccsa/2016/4320/0",
"title": "2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ares/2016/0990/0/0990a844",
"title": "Geographic Localization of an Anonymous Social Network Message Data Set",
"doi": null,
"abstractUrl": "/proceedings-article/ares/2016/0990a844/12OmNvT2p0U",
"parentPublication": {
"id": "proceedings/ares/2016/0990/0",
"title": "2016 11th International Conference on Availability, Reliability and Security (ARES )",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aipr/2017/1235/0/08457960",
"title": "The poor generalization of deep convolutional networks to aerial imagery from new geographic locations: an empirical study with solar array detection",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2017/08457960/13xI8AH0qyZ",
"parentPublication": {
"id": "proceedings/aipr/2017/1235/0",
"title": "2017 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2017/2588/0/08291919",
"title": "Exploring Home and Work Locations in a City from Mobile Phone Data",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2017/08291919/17D45WaTkfD",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2017/2588/0",
"title": "2017 IEEE 19th International Conference on High Performance Computing and Communications; IEEE 15th International Conference on Smart City; IEEE 3rd International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsc/2019/6783/0/08665594",
"title": "Augmenting Google Search in Ranking Twitter Users",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2019/08665594/18qcf7C1Mcw",
"parentPublication": {
"id": "proceedings/icsc/2019/6783/0",
"title": "2019 IEEE 13th International Conference on Semantic Computing (ICSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600v1262",
"title": "The Auto Arborist Dataset: A Large-Scale Benchmark for Multiview Urban Forest Monitoring Under Domain Shift",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600v1262/1H1hDA0i8rC",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006384",
"title": "Streetify: Using Street View Imagery And Deep Learning For Urban Streets Development",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006384/1hJrPIgs0cU",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006186",
"title": "Short Paper: User Identification across Online Social Networks Based on Similarities among Distributions of Friends’ Locations",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006186/1hJsrX8sJOM",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093339",
"title": "The Synthinel-1 dataset: a collection of high resolution synthetic overhead imagery for building segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093339/1jPby0pJbvG",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2020/9228/0/922800a178",
"title": "Exploiting Sequential Mobility for Recommending new Locations on Geo-tagged Social Media",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2020/922800a178/1pP3yxr2HZe",
"parentPublication": {
"id": "proceedings/ictai/2020/9228/0",
"title": "2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "13xI8A66zF1",
"title": "2017 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"acronym": "aipr",
"groupId": "1000046",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "13xI8AH0qyZ",
"doi": "10.1109/AIPR.2017.8457960",
"title": "The poor generalization of deep convolutional networks to aerial imagery from new geographic locations: an empirical study with solar array detection",
"normalizedTitle": "The poor generalization of deep convolutional networks to aerial imagery from new geographic locations: an empirical study with solar array detection",
"abstract": "Convolutional neural networks (CNNs) have recently achieved unprecedented performance for the automatic recognition of objects (e.g., buildings, roads, or vehicles) in color aerial imagery. Although these results are promising, questions remain about their practical applicability. This is because there is a wide variability in the visual characteristics of remote sensing imagery across different geographic locations, and CNNs are often trained and tested on imagery from nearby (or the same) geographic locations. It is therefore unclear whether trained CNNs will perform well on new, previously unseen, geographic locations, which is an important practical consideration. In this work we investigate this problem when applying CNNs for solar array detection on a large aerial imagery dataset comprised of two nearby US cities. We compare the performance of CNNs under two conditions: training and testing on the same city vs training on one city and testing on another city. We discuss several subtle difficulties with these experiments and make recommendations. We show that there can be substantial performance loss in second case, when compared to the first. We also investigate how much training data is required from the unseen city in order to fine-tune the CNN so that it performs well. We investigate several different fine-tuning strategies, yielding a clear winner.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Convolutional neural networks (CNNs) have recently achieved unprecedented performance for the automatic recognition of objects (e.g., buildings, roads, or vehicles) in color aerial imagery. Although these results are promising, questions remain about their practical applicability. This is because there is a wide variability in the visual characteristics of remote sensing imagery across different geographic locations, and CNNs are often trained and tested on imagery from nearby (or the same) geographic locations. It is therefore unclear whether trained CNNs will perform well on new, previously unseen, geographic locations, which is an important practical consideration. In this work we investigate this problem when applying CNNs for solar array detection on a large aerial imagery dataset comprised of two nearby US cities. We compare the performance of CNNs under two conditions: training and testing on the same city vs training on one city and testing on another city. We discuss several subtle difficulties with these experiments and make recommendations. We show that there can be substantial performance loss in second case, when compared to the first. We also investigate how much training data is required from the unseen city in order to fine-tune the CNN so that it performs well. We investigate several different fine-tuning strategies, yielding a clear winner.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Convolutional neural networks (CNNs) have recently achieved unprecedented performance for the automatic recognition of objects (e.g., buildings, roads, or vehicles) in color aerial imagery. Although these results are promising, questions remain about their practical applicability. This is because there is a wide variability in the visual characteristics of remote sensing imagery across different geographic locations, and CNNs are often trained and tested on imagery from nearby (or the same) geographic locations. It is therefore unclear whether trained CNNs will perform well on new, previously unseen, geographic locations, which is an important practical consideration. In this work we investigate this problem when applying CNNs for solar array detection on a large aerial imagery dataset comprised of two nearby US cities. We compare the performance of CNNs under two conditions: training and testing on the same city vs training on one city and testing on another city. We discuss several subtle difficulties with these experiments and make recommendations. We show that there can be substantial performance loss in second case, when compared to the first. We also investigate how much training data is required from the unseen city in order to fine-tune the CNN so that it performs well. We investigate several different fine-tuning strategies, yielding a clear winner.",
"fno": "08457960",
"keywords": [
"Urban Areas",
"Training Data",
"Training",
"Visualization",
"Testing",
"Image Recognition",
"Buildings",
"Semantic Segmentation",
"Remote Sensing",
"Aerial Imagery",
"Geographic Generalization"
],
"authors": [
{
"affiliation": "Denartment of Electrical & Computer Engineering, Duke University, Durham, NC, 27708",
"fullName": "Rui Wang",
"givenName": "Rui",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Denartment of Electrical & Computer Engineering, Duke University, Durham, NC, 27708",
"fullName": "Joseph Camilo",
"givenName": "Joseph",
"surname": "Camilo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Denartment of Electrical & Computer Engineering, Duke University, Durham, NC, 27708",
"fullName": "Leslie M. Collins",
"givenName": "Leslie M.",
"surname": "Collins",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Energy Initiative, Duke University, Durham, NC, 27708",
"fullName": "Kyle Bradbury",
"givenName": "Kyle",
"surname": "Bradbury",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Denartment of Electrical & Computer Engineering, Duke University, Durham, NC, 27708",
"fullName": "Jordan M. Malof",
"givenName": "Jordan M.",
"surname": "Malof",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "aipr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-10-01T00:00:00",
"pubType": "proceedings",
"pages": "1-8",
"year": "2017",
"issn": "2332-5615",
"isbn": "978-1-5386-1235-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08457937",
"articleId": "13xI8A8WyXa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08457961",
"articleId": "13xI8AOXccS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/aiccsa/2016/4320/0/07945628",
"title": "The geo-social relevance ranking: A method based on geographic information and social media data",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2016/07945628/12OmNApcukM",
"parentPublication": {
"id": "proceedings/aiccsa/2016/4320/0",
"title": "2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ares/2016/0990/0/0990a844",
"title": "Geographic Localization of an Anonymous Social Network Message Data Set",
"doi": null,
"abstractUrl": "/proceedings-article/ares/2016/0990a844/12OmNvT2p0U",
"parentPublication": {
"id": "proceedings/ares/2016/0990/0",
"title": "2016 11th International Conference on Availability, Reliability and Security (ARES )",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aipr/2017/1235/0/08457965",
"title": "The poor generalization of deep convolutional networks to aerial imagery from new geographic locations: an empirical study with solar array detection",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2017/08457965/13xI8A8WyXm",
"parentPublication": {
"id": "proceedings/aipr/2017/1235/0",
"title": "2017 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2017/2588/0/08291919",
"title": "Exploring Home and Work Locations in a City from Mobile Phone Data",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2017/08291919/17D45WaTkfD",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2017/2588/0",
"title": "2017 IEEE 19th International Conference on High Performance Computing and Communications; IEEE 15th International Conference on Smart City; IEEE 3rd International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsc/2019/6783/0/08665594",
"title": "Augmenting Google Search in Ranking Twitter Users",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2019/08665594/18qcf7C1Mcw",
"parentPublication": {
"id": "proceedings/icsc/2019/6783/0",
"title": "2019 IEEE 13th International Conference on Semantic Computing (ICSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600v1262",
"title": "The Auto Arborist Dataset: A Large-Scale Benchmark for Multiview Urban Forest Monitoring Under Domain Shift",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600v1262/1H1hDA0i8rC",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006384",
"title": "Streetify: Using Street View Imagery And Deep Learning For Urban Streets Development",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006384/1hJrPIgs0cU",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006186",
"title": "Short Paper: User Identification across Online Social Networks Based on Similarities among Distributions of Friends’ Locations",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006186/1hJsrX8sJOM",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093339",
"title": "The Synthinel-1 dataset: a collection of high resolution synthetic overhead imagery for building segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093339/1jPby0pJbvG",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2020/9228/0/922800a178",
"title": "Exploiting Sequential Mobility for Recommending new Locations on Geo-tagged Social Media",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2020/922800a178/1pP3yxr2HZe",
"parentPublication": {
"id": "proceedings/ictai/2020/9228/0",
"title": "2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "17D45VtKir6",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "17D45WXIkAD",
"doi": "10.1109/ICPR.2018.8546054",
"title": "Convolutional Discriminant Analysis",
"normalizedTitle": "Convolutional Discriminant Analysis",
"abstract": "Softmax regressor is arguably the most commonly used classifier in convolutional neural networks (CNNs). However, the cross-entropy based softmax loss only supervises the deep neural networks to learn effective representations of data, but does not explicitly enforce the separability between the classes. In this paper, we propose a novel convolutional neural network model, called convolutional discriminative analysis (CDA). Beyond the softmax loss, CDA employs a convolutional discriminant loss (CD-Loss), which minimizes the distance between the sample and its class center while maximizes the distance between the sample and its adversarial class center in the space of the learned deep representations. Extensive experiments on two benchmark data sets, Fashion-MNIST and CIFAR-10, demonstrate the superiority of CDA over traditional deep CNNs on the image classification tasks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Softmax regressor is arguably the most commonly used classifier in convolutional neural networks (CNNs). However, the cross-entropy based softmax loss only supervises the deep neural networks to learn effective representations of data, but does not explicitly enforce the separability between the classes. In this paper, we propose a novel convolutional neural network model, called convolutional discriminative analysis (CDA). Beyond the softmax loss, CDA employs a convolutional discriminant loss (CD-Loss), which minimizes the distance between the sample and its class center while maximizes the distance between the sample and its adversarial class center in the space of the learned deep representations. Extensive experiments on two benchmark data sets, Fashion-MNIST and CIFAR-10, demonstrate the superiority of CDA over traditional deep CNNs on the image classification tasks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Softmax regressor is arguably the most commonly used classifier in convolutional neural networks (CNNs). However, the cross-entropy based softmax loss only supervises the deep neural networks to learn effective representations of data, but does not explicitly enforce the separability between the classes. In this paper, we propose a novel convolutional neural network model, called convolutional discriminative analysis (CDA). Beyond the softmax loss, CDA employs a convolutional discriminant loss (CD-Loss), which minimizes the distance between the sample and its class center while maximizes the distance between the sample and its adversarial class center in the space of the learned deep representations. Extensive experiments on two benchmark data sets, Fashion-MNIST and CIFAR-10, demonstrate the superiority of CDA over traditional deep CNNs on the image classification tasks.",
"fno": "08546054",
"keywords": [
"Entropy",
"Image Classification",
"Image Representation",
"Learning Artificial Intelligence",
"Neural Nets",
"Regression Analysis",
"Softmax Regressor",
"Convolutional Discriminant Analysis",
"Traditional Deep CN Ns",
"Benchmark Data Sets",
"Learned Deep Representations",
"Adversarial Class Center",
"CD Loss",
"Convolutional Discriminant Loss",
"CDA",
"Novel Convolutional Neural Network Model",
"Deep Neural Networks",
"Cross Entropy Based Softmax Loss",
"Training",
"Task Analysis",
"Convolutional Neural Networks",
"Face Recognition",
"Optimization"
],
"authors": [
{
"affiliation": "Department of Computer Science and Technology, Ocean University of China, Qingdao, 266100, China",
"fullName": "Guoqiang Zhong",
"givenName": "Guoqiang",
"surname": "Zhong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science and Technology, Ocean University of China, Qingdao, 266100, China",
"fullName": "Yan Zheng",
"givenName": "Yan",
"surname": "Zheng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing, 100190, China",
"fullName": "Xu-Yao Zhang",
"givenName": "Xu-Yao",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science and Technology, Ocean University of China, Qingdao, 266100, China",
"fullName": "Hongxu Wei",
"givenName": "Hongxu",
"surname": "Wei",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science and Technology, Ocean University of China, Qingdao, 266100, China",
"fullName": "Xiao Ling",
"givenName": "Xiao",
"surname": "Ling",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-08-01T00:00:00",
"pubType": "proceedings",
"pages": "1456-1461",
"year": "2018",
"issn": "1051-4651",
"isbn": "978-1-5386-3788-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08546269",
"articleId": "17D45Wuc33u",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08545107",
"articleId": "17D45WgziS5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdar/2017/3586/1/3586a382",
"title": "Local Discriminant Training and Global Optimization for Convolutional Neural Network Based Handwritten Chinese Character Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2017/3586a382/12OmNBubOOT",
"parentPublication": {
"id": "proceedings/icdar/2017/3586/1",
"title": "2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2017/3586/1/3586a388",
"title": "Analysis of Convolutional Neural Networks for Document Image Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2017/3586a388/12OmNxb5hsM",
"parentPublication": {
"id": "proceedings/icdar/2017/3586/1",
"title": "2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457g738",
"title": "SphereFace: Deep Hypersphere Embedding for Face Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457g738/12OmNxd4tyQ",
"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/2018/6420/0/642000f265",
"title": "CosFace: Large Margin Cosine Loss for Deep Face Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000f265/17D45WODaoU",
"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/cvpr/2018/6420/0/642000d474",
"title": "Robust Classification with Convolutional Prototype Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000d474/17D45WgziRG",
"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/cvpr/2018/6420/0/642000a840",
"title": "Modulated Convolutional Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000a840/17D45Wt3Ewh",
"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/iccvw/2019/5023/0/09022542",
"title": "Explaining Convolutional Neural Networks using Softmax Gradient Layer-wise Relevance Propagation",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2019/09022542/1i5myefF7Lq",
"parentPublication": {
"id": "proceedings/iccvw/2019/5023/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2020/6215/0/09313601",
"title": "A Dynamic Group Equivariant Convolutional Networks for Medical Image Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313601/1qmfYQ5BZZu",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412061",
"title": "Angular Sparsemax for Face Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412061/1tmiFAmdIre",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2021/0191/0/019100d307",
"title": "Learning to Automatically Diagnose Multiple Diseases in Pediatric Chest Radiographs Using Deep Convolutional Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2021/019100d307/1yNhpM52uqY",
"parentPublication": {
"id": "proceedings/iccvw/2021/0191/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1s645BaTzVu",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"acronym": "big-data",
"groupId": "1802964",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1s647oEI7cs",
"doi": "10.1109/BigData50022.2020.9378237",
"title": "Combined Convolutional and Recurrent Neural Networks for Hierarchical Classification of Images",
"normalizedTitle": "Combined Convolutional and Recurrent Neural Networks for Hierarchical Classification of Images",
"abstract": "Deep learning models based on CNNs are predominantly used in image classification tasks. Such approaches, assuming independence of object categories, normally use a CNN as a feature learner and apply a flat classifier on top of it. Object classes in many settings have known hierarchical relations, and classifiers exploiting these relations should perform better. We propose hierarchical classification models combining a CNN to extract hierarchical representations of images, and an RNN or sequence-to-sequence model to capture a hierarchical tree of classes. In addition, we apply residual learning to the RNN part in order to facilitate training our compound model and improve generalization of the model. Experimental results on a public and a real world proprietary dataset of images show that our hierarchical networks perform better than state-of-the-art CNNs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Deep learning models based on CNNs are predominantly used in image classification tasks. Such approaches, assuming independence of object categories, normally use a CNN as a feature learner and apply a flat classifier on top of it. Object classes in many settings have known hierarchical relations, and classifiers exploiting these relations should perform better. We propose hierarchical classification models combining a CNN to extract hierarchical representations of images, and an RNN or sequence-to-sequence model to capture a hierarchical tree of classes. In addition, we apply residual learning to the RNN part in order to facilitate training our compound model and improve generalization of the model. Experimental results on a public and a real world proprietary dataset of images show that our hierarchical networks perform better than state-of-the-art CNNs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Deep learning models based on CNNs are predominantly used in image classification tasks. Such approaches, assuming independence of object categories, normally use a CNN as a feature learner and apply a flat classifier on top of it. Object classes in many settings have known hierarchical relations, and classifiers exploiting these relations should perform better. We propose hierarchical classification models combining a CNN to extract hierarchical representations of images, and an RNN or sequence-to-sequence model to capture a hierarchical tree of classes. In addition, we apply residual learning to the RNN part in order to facilitate training our compound model and improve generalization of the model. Experimental results on a public and a real world proprietary dataset of images show that our hierarchical networks perform better than state-of-the-art CNNs.",
"fno": "09378237",
"keywords": [
"Convolutional Neural Nets",
"Deep Learning Artificial Intelligence",
"Feature Extraction",
"Image Classification",
"Recurrent Neural Nets",
"Trees Mathematics",
"Object Categories",
"CNN",
"Feature Learner",
"Flat Classifier",
"Object Classes",
"Hierarchical Relations",
"Hierarchical Classification Models",
"Hierarchical Representations",
"Sequence To Sequence Model",
"Residual Learning",
"RNN",
"Convolutional Neural Network",
"Recurrent Neural Network",
"Deep Learning",
"Image Classification",
"Hierarchical Tree",
"Training",
"Recurrent Neural Networks",
"Image Recognition",
"Memory Management",
"Predictive Models",
"Big Data",
"Task Analysis",
"Deep Learning",
"Image Recognition",
"Hierarchical Classification"
],
"authors": [
{
"affiliation": "Northwestern University,Evanston,IL,USA",
"fullName": "Jaehoon Koo",
"givenName": "Jaehoon",
"surname": "Koo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Northwestern University,Evanston,IL,USA",
"fullName": "Diego Klabjan",
"givenName": "Diego",
"surname": "Klabjan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Allstate Insurance Company,Northbrook,IL,USA",
"fullName": "Jean Utke",
"givenName": "Jean",
"surname": "Utke",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "big-data",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-12-01T00:00:00",
"pubType": "proceedings",
"pages": "1354-1361",
"year": "2020",
"issn": null,
"isbn": "978-1-7281-6251-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09378060",
"articleId": "1s64ihs3tLy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09378304",
"articleId": "1s64J1NcWKA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2015/6759/0/07301268",
"title": "Convolutional recurrent neural networks: Learning spatial dependencies for image representation",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2015/07301268/12OmNBAIASG",
"parentPublication": {
"id": "proceedings/cvprw/2015/6759/0",
"title": "2015 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eait/2011/4329/0/4329a041",
"title": "Application of Recurrent Neural Network for Generating Grayscale Digital Half-Tone Images",
"doi": null,
"abstractUrl": "/proceedings-article/eait/2011/4329a041/12OmNzAoi1S",
"parentPublication": {
"id": "proceedings/eait/2011/4329/0",
"title": "Emerging Applications of Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000c521",
"title": "Dynamic Scene Deblurring Using Spatially Variant Recurrent Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000c521/17D45WZZ7ER",
"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/bibm/2018/5488/0/08621228",
"title": "Convolutional Gated Recurrent Units for Medical Relation Classification",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2018/08621228/17D45XeKgn9",
"parentPublication": {
"id": "proceedings/bibm/2018/5488/0",
"title": "2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbd/2022/0745/0/074500a195",
"title": "Action recognition based on parallel convolutional recurrent neural networks",
"doi": null,
"abstractUrl": "/proceedings-article/cbd/2022/074500a195/1EVijA7T008",
"parentPublication": {
"id": "proceedings/cbd/2022/0745/0",
"title": "2021 Ninth International Conference on Advanced Cloud and Big Data (CBD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2018/1970/0/197000a703",
"title": "Improving Bug Localization with Character-Level Convolutional Neural Network and Recurrent Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2018/197000a703/1b66r2WTJok",
"parentPublication": {
"id": "proceedings/apsec/2018/1970/0",
"title": "2018 25th Asia-Pacific Software Engineering Conference (APSEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/05/08890615",
"title": "Knowledge Base Reasoning with Convolutional-Based Recurrent Neural Networks",
"doi": null,
"abstractUrl": "/journal/tk/2021/05/08890615/1eX8mA3pSbm",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09005707",
"title": "Hierarchical Transfer Convolutional Neural Networks for Image Classification",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09005707/1hJrXxdgW2I",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101679",
"title": "Hierarchical Quick Shift Guided Recurrent Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101679/1kaMzM2KQEg",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpbd&is/2021/1327/0/09658480",
"title": "Imitation Learning for Autonomous Driving Based on Convolutional and Recurrent Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/hpbd&is/2021/09658480/1zRFiNlj6dG",
"parentPublication": {
"id": "proceedings/hpbd&is/2021/1327/0",
"title": "2021 International Conference on High Performance Big Data and Intelligent Systems (HPBD&IS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyuPL0m",
"title": "Proceedings of 10th International Conference on Tools with Artificial Intelligence (ICTA'98)",
"acronym": "tai",
"groupId": "1000763",
"volume": "0",
"displayVolume": "0",
"year": "1998",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNrJAe5Q",
"doi": "10.1109/TAI.1998.744846",
"title": "Integrating boosting and stochastic attribute selection committees for further improving the performance of decision tree learning",
"normalizedTitle": "Integrating boosting and stochastic attribute selection committees for further improving the performance of decision tree learning",
"abstract": "Techniques for constructing classifier committees including boosting and bagging have demonstrated great success, especially boosting for decision tree learning. This type of technique generates several classifiers to form a committee by repeated application of a single base learning algorithm. The committee members vote to decide the final classification. Boosting and bagging create different classifiers by modifying the distribution of the training set. SASC (Stochastic Attribute Selection Committees) uses an alternative approach to generating classifier committees by stochastic manipulation of the set of attributes considered at each node during tree induction, but keeping the distribution of the training set unchanged. We propose a method for improving the performance of boosting. This technique combines boosting and SASC. It builds classifier committees by manipulating both the distribution of the training set and the set of attributes available during induction. In the synergy SASC effectively increases the model diversity of boosting. Experiments with a representative collection of natural domains show that, on average, the combined technique outperforms either boosting or SASC alone in terms of reducing the error rate of decision tree learning.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Techniques for constructing classifier committees including boosting and bagging have demonstrated great success, especially boosting for decision tree learning. This type of technique generates several classifiers to form a committee by repeated application of a single base learning algorithm. The committee members vote to decide the final classification. Boosting and bagging create different classifiers by modifying the distribution of the training set. SASC (Stochastic Attribute Selection Committees) uses an alternative approach to generating classifier committees by stochastic manipulation of the set of attributes considered at each node during tree induction, but keeping the distribution of the training set unchanged. We propose a method for improving the performance of boosting. This technique combines boosting and SASC. It builds classifier committees by manipulating both the distribution of the training set and the set of attributes available during induction. In the synergy SASC effectively increases the model diversity of boosting. Experiments with a representative collection of natural domains show that, on average, the combined technique outperforms either boosting or SASC alone in terms of reducing the error rate of decision tree learning.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Techniques for constructing classifier committees including boosting and bagging have demonstrated great success, especially boosting for decision tree learning. This type of technique generates several classifiers to form a committee by repeated application of a single base learning algorithm. The committee members vote to decide the final classification. Boosting and bagging create different classifiers by modifying the distribution of the training set. SASC (Stochastic Attribute Selection Committees) uses an alternative approach to generating classifier committees by stochastic manipulation of the set of attributes considered at each node during tree induction, but keeping the distribution of the training set unchanged. We propose a method for improving the performance of boosting. This technique combines boosting and SASC. It builds classifier committees by manipulating both the distribution of the training set and the set of attributes available during induction. In the synergy SASC effectively increases the model diversity of boosting. Experiments with a representative collection of natural domains show that, on average, the combined technique outperforms either boosting or SASC alone in terms of reducing the error rate of decision tree learning.",
"fno": "00744846",
"keywords": [
"Decision Trees",
"Learning Artificial Intelligence",
"Pattern Classification",
"Boosting",
"Stochastic Attribute Selection Committees",
"Decision Tree Learning",
"Performance",
"Classifier Committees",
"Bagging",
"Learning Algorithm",
"SASC",
"Tree Induction",
"Training Set",
"Model Diversity",
"Experiments",
"Error Rate",
"Boosting",
"Stochastic Processes",
"Decision Trees",
"Bagging",
"Classification Tree Analysis",
"Voting",
"Error Analysis",
"Induction Generators",
"Partitioning Algorithms",
"Mathematics"
],
"authors": [
{
"affiliation": "Dept. of Comput. & Math., Deakin Univ., Geelong, Vic., Australia",
"fullName": "Zijian Zheng",
"givenName": null,
"surname": "Zijian Zheng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "G.I. Webb",
"givenName": "G.I.",
"surname": "Webb",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Kai Ming Ting",
"givenName": null,
"surname": "Kai Ming Ting",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "tai",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1998-01-01T00:00:00",
"pubType": "proceedings",
"pages": "216,217,218,219,220,221,222,223",
"year": "1998",
"issn": "1082-3409",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00744845",
"articleId": "12OmNvoFjPU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00744847",
"articleId": "12OmNzTYC2W",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/fit/2014/7505/0/7505a226",
"title": "An Efficient Rule-Based Classification of Diabetes Using ID3, C4.5, & CART Ensembles",
"doi": null,
"abstractUrl": "/proceedings-article/fit/2014/7505a226/12OmNAJDBwH",
"parentPublication": {
"id": "proceedings/fit/2014/7505/0",
"title": "2014 12th International Conference on Frontiers of Information Technology (FIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761678",
"title": "Training sequential on-line boosting classifier for visual tracking",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761678/12OmNC17hTK",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2016/4459/0/4459a388",
"title": "Enhancing Classification of Ecological Momentary Assessment Data Using Bagging and Boosting",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2016/4459a388/12OmNqG0T5l",
"parentPublication": {
"id": "proceedings/ictai/2016/4459/0",
"title": "2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tai/1998/5214/0/00744847",
"title": "Turning majority voting classifiers into a single decision tree",
"doi": null,
"abstractUrl": "/proceedings-article/tai/1998/00744847/12OmNzTYC2W",
"parentPublication": {
"id": "proceedings/tai/1998/5214/0",
"title": "Proceedings of 10th International Conference on Tools with Artificial Intelligence (ICTA'98)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2015/0163/0/0163a186",
"title": "Using Feature Selection in Combination with Ensemble Learning Techniques to Improve Tweet Sentiment Classification Performance",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2015/0163a186/12OmNzmclDE",
"parentPublication": {
"id": "proceedings/ictai/2015/0163/0",
"title": "2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2016/12/07567497",
"title": "Online Bagging and Boosting for Imbalanced Data Streams",
"doi": null,
"abstractUrl": "/journal/tk/2016/12/07567497/13rRUwInuX0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/02/06731529",
"title": "Active Learning through Adaptive Heterogeneous Ensembling",
"doi": null,
"abstractUrl": "/journal/tk/2015/02/06731529/13rRUxD9h5J",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ewdts/2019/1003/0/08884377",
"title": "Boosting Model of Bioinspired Algorithms for Solving the Classification and Clustering Problems",
"doi": null,
"abstractUrl": "/proceedings-article/ewdts/2019/08884377/1eEV1TW5oOI",
"parentPublication": {
"id": "proceedings/ewdts/2019/1003/0",
"title": "2019 IEEE East-West Design & Test Symposium (EWDTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2019/4253/0/425300a132",
"title": "Online Local Boosting: Improving Performance in Online Decision Trees",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2019/425300a132/1fHkFnNqR6o",
"parentPublication": {
"id": "proceedings/bracis/2019/4253/0",
"title": "2019 8th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2020/9012/0/901200a251",
"title": "Boosting Algorithms for Delivery Time Prediction in Transportation Logistics",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2020/901200a251/1rgGnE4urv2",
"parentPublication": {
"id": "proceedings/icdmw/2020/9012/0",
"title": "2020 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAOsMGw",
"title": "2013 2nd International Conference on Informatics, Electronics and Vision (ICIEV 2013)",
"acronym": "iciev",
"groupId": "1802578",
"volume": "0",
"displayVolume": "0",
"year": "2013",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNrYlmPn",
"doi": "10.1109/ICIEV.2013.6572718",
"title": "A new approach of Boosting using decision tree classifier for classifying noisy data",
"normalizedTitle": "A new approach of Boosting using decision tree classifier for classifying noisy data",
"abstract": "In the last decade, a good number of supervised learning algorithms have been introduced by the intelligent computational researchers in machine learning and data mining. Recently research in classification problems to reduce misclassification rate focuses on aggregation methods like Boosting, which combines many classifiers to generate a single strong classifier. Boosting is also known as AdaBoost algorithm, which uses voting technique to focus on training instances that are hard to classify. In this paper, we introduce a new approach of Boosting using decision tree for classifying noisy data. The proposed approach considers a series of decision tree classifiers and combines the votes of each classifier for classifying known or unknown instances. We update the weights of training instances based on the misclassification error rates that are produced by the training instances in each round of classifier construction. We tested the performance of our proposed algorithm with existing decision tree algorithms by employing benchmark datasets from the UCI machine learning repository. Experimental analysis proved that the proposed approach achieved high classification accuracy for different types of dataset.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In the last decade, a good number of supervised learning algorithms have been introduced by the intelligent computational researchers in machine learning and data mining. Recently research in classification problems to reduce misclassification rate focuses on aggregation methods like Boosting, which combines many classifiers to generate a single strong classifier. Boosting is also known as AdaBoost algorithm, which uses voting technique to focus on training instances that are hard to classify. In this paper, we introduce a new approach of Boosting using decision tree for classifying noisy data. The proposed approach considers a series of decision tree classifiers and combines the votes of each classifier for classifying known or unknown instances. We update the weights of training instances based on the misclassification error rates that are produced by the training instances in each round of classifier construction. We tested the performance of our proposed algorithm with existing decision tree algorithms by employing benchmark datasets from the UCI machine learning repository. Experimental analysis proved that the proposed approach achieved high classification accuracy for different types of dataset.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In the last decade, a good number of supervised learning algorithms have been introduced by the intelligent computational researchers in machine learning and data mining. Recently research in classification problems to reduce misclassification rate focuses on aggregation methods like Boosting, which combines many classifiers to generate a single strong classifier. Boosting is also known as AdaBoost algorithm, which uses voting technique to focus on training instances that are hard to classify. In this paper, we introduce a new approach of Boosting using decision tree for classifying noisy data. The proposed approach considers a series of decision tree classifiers and combines the votes of each classifier for classifying known or unknown instances. We update the weights of training instances based on the misclassification error rates that are produced by the training instances in each round of classifier construction. We tested the performance of our proposed algorithm with existing decision tree algorithms by employing benchmark datasets from the UCI machine learning repository. Experimental analysis proved that the proposed approach achieved high classification accuracy for different types of dataset.",
"fno": "06572718",
"keywords": [
"Data Mining",
"Decision Trees",
"Learning Artificial Intelligence",
"Pattern Classification",
"Boosting Approach",
"Decision Tree Classifier",
"Noisy Data Classification",
"Supervised Learning Algorithms",
"UCI Machine Learning Repository",
"Data Mining",
"Misclassification Rate Reduction",
"Aggregation Methods",
"Ada Boost Algorithm",
"Voting Technique",
"Training Instances",
"Benchmark Datasets",
"Experimental Analysis",
"Training",
"Decision Trees",
"Boosting",
"Classification Algorithms",
"Machine Learning Algorithms",
"Training Data",
"Iris Recognition",
"Boosting",
"Classification",
"Decision Tree",
"Noisy Data"
],
"authors": [
{
"affiliation": "Computational Intelligence Group, Northumbria University, Newcastle upon Tyne, UK",
"fullName": "Dewan Md. Farid",
"givenName": "Dewan Md.",
"surname": "Farid",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science and Engineering, United International University, Bangladesh",
"fullName": "Golam Morshed Maruf",
"givenName": "Golam Morshed",
"surname": "Maruf",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science and Engineering, United International University, Bangladesh",
"fullName": "Chowdhury Mofizur Rahman",
"givenName": "Chowdhury Mofizur",
"surname": "Rahman",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iciev",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2013-05-01T00:00:00",
"pubType": "proceedings",
"pages": "1-4",
"year": "2013",
"issn": null,
"isbn": "978-1-4799-0400-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06572717",
"articleId": "12OmNyUFfRR",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06572719",
"articleId": "12OmNy4IFbv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2008/2174/0/04761678",
"title": "Training sequential on-line boosting classifier for visual tracking",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761678/12OmNC17hTK",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciev/2014/5179/0/06850838",
"title": "An adaptive ensemble classifier for mining complex noisy instances in data streams",
"doi": null,
"abstractUrl": "/proceedings-article/iciev/2014/06850838/12OmNCwlakV",
"parentPublication": {
"id": "proceedings/iciev/2014/5179/0",
"title": "2014 International Conference on Informatics, Electronics & Vision (ICIEV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tai/1998/5214/0/00744846",
"title": "Integrating boosting and stochastic attribute selection committees for further improving the performance of decision tree learning",
"doi": null,
"abstractUrl": "/proceedings-article/tai/1998/00744846/12OmNrJAe5Q",
"parentPublication": {
"id": "proceedings/tai/1998/5214/0",
"title": "Proceedings of 10th International Conference on Tools with Artificial Intelligence (ICTA'98)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391d056",
"title": "Tracking-by-Segmentation with Online Gradient Boosting Decision Tree",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d056/12OmNx7ov2B",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017582",
"title": "Visual Diagnosis of Tree Boosting Methods",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017582/13rRUwj7cph",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/06/06990607",
"title": "Cluster-Based Boosting",
"doi": null,
"abstractUrl": "/journal/tk/2015/06/06990607/13rRUxBa5nJ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdatasecurity-hpsc-ids/2017/6296/0/07980351",
"title": "A Taxi Gap Prediction Method via Double Ensemble Gradient Boosting Decision Tree",
"doi": null,
"abstractUrl": "/proceedings-article/bigdatasecurity-hpsc-ids/2017/07980351/17D45XeKgqx",
"parentPublication": {
"id": "proceedings/bigdatasecurity-hpsc-ids/2017/6296/0",
"title": "2017 IEEE 3rd International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing, (HPSC) and IEEE International Conference on Intelligent Data and Security (IDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2019/4734/0/08890990",
"title": "HarpGBDT: Optimizing Gradient Boosting Decision Tree for Parallel Efficiency",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2019/08890990/1eLymHVQenC",
"parentPublication": {
"id": "proceedings/cluster/2019/4734/0",
"title": "2019 IEEE International Conference on Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2019/4253/0/425300a132",
"title": "Online Local Boosting: Improving Performance in Online Decision Trees",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2019/425300a132/1fHkFnNqR6o",
"parentPublication": {
"id": "proceedings/bracis/2019/4253/0",
"title": "2019 8th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2021/3931/0/393100a186",
"title": "Investigating the Evolution of Tree Boosting Models with Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2021/393100a186/1tTtslm0K4g",
"parentPublication": {
"id": "proceedings/pacificvis/2021/3931/0",
"title": "2021 IEEE 14th Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBDyAaZ",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"acronym": "iccv",
"groupId": "1000149",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNx7ov2B",
"doi": "10.1109/ICCV.2015.350",
"title": "Tracking-by-Segmentation with Online Gradient Boosting Decision Tree",
"normalizedTitle": "Tracking-by-Segmentation with Online Gradient Boosting Decision Tree",
"abstract": "We propose an online tracking algorithm that adaptively models target appearances based on an online gradient boosting decision tree. Our algorithm is particularly useful for non-rigid and/or articulated objects since it handles various deformations of the target effectively by integrating a classifier operating on individual patches and provides segmentation masks of the target as final results. The posterior of the target state is propagated over time by particle filtering, where the likelihood is computed based mainly on patch-level confidence map associated with a latent target state corresponding to each sample. Once tracking is completed in each frame, our gradient boosting decision tree is updated to adapt new data in a recursive manner. For effective evaluation of segmentation-based tracking algorithms, we construct a new ground-truth that contains pixel-level annotation of segmentation mask. We evaluate the performance of our tracking algorithm based on the measures for segmentation masks, where our algorithm illustrates superior accuracy compared to the state-of-the-art segmentation-based tracking methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose an online tracking algorithm that adaptively models target appearances based on an online gradient boosting decision tree. Our algorithm is particularly useful for non-rigid and/or articulated objects since it handles various deformations of the target effectively by integrating a classifier operating on individual patches and provides segmentation masks of the target as final results. The posterior of the target state is propagated over time by particle filtering, where the likelihood is computed based mainly on patch-level confidence map associated with a latent target state corresponding to each sample. Once tracking is completed in each frame, our gradient boosting decision tree is updated to adapt new data in a recursive manner. For effective evaluation of segmentation-based tracking algorithms, we construct a new ground-truth that contains pixel-level annotation of segmentation mask. We evaluate the performance of our tracking algorithm based on the measures for segmentation masks, where our algorithm illustrates superior accuracy compared to the state-of-the-art segmentation-based tracking methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose an online tracking algorithm that adaptively models target appearances based on an online gradient boosting decision tree. Our algorithm is particularly useful for non-rigid and/or articulated objects since it handles various deformations of the target effectively by integrating a classifier operating on individual patches and provides segmentation masks of the target as final results. The posterior of the target state is propagated over time by particle filtering, where the likelihood is computed based mainly on patch-level confidence map associated with a latent target state corresponding to each sample. Once tracking is completed in each frame, our gradient boosting decision tree is updated to adapt new data in a recursive manner. For effective evaluation of segmentation-based tracking algorithms, we construct a new ground-truth that contains pixel-level annotation of segmentation mask. We evaluate the performance of our tracking algorithm based on the measures for segmentation masks, where our algorithm illustrates superior accuracy compared to the state-of-the-art segmentation-based tracking methods.",
"fno": "8391d056",
"keywords": [
"Boosting",
"Target Tracking",
"Decision Trees",
"Training",
"Visualization",
"Algorithm Design And Analysis"
],
"authors": [
{
"affiliation": null,
"fullName": "Jeany Son",
"givenName": "Jeany",
"surname": "Son",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Ilchae Jung",
"givenName": "Ilchae",
"surname": "Jung",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Kayoung Park",
"givenName": "Kayoung",
"surname": "Park",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Bohyung Han",
"givenName": "Bohyung",
"surname": "Han",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-12-01T00:00:00",
"pubType": "proceedings",
"pages": "3056-3064",
"year": "2015",
"issn": "2380-7504",
"isbn": "978-1-4673-8391-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "8391d047",
"articleId": "12OmNyFCvTQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "8391d065",
"articleId": "12OmNs0C9Fx",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2012/2216/0/06460281",
"title": "Online Transfer Boosting for object tracking",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460281/12OmNqGA5ap",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2018/4210/0/421001a153",
"title": "Webshell Detection Based on Random Forest–Gradient Boosting Decision Tree Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2018/421001a153/12OmNqJq4Gk",
"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/fccm/2014/5111/0/5111a165",
"title": "FPGA Accelerated Online Boosting for Multi-target Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/fccm/2014/5111a165/12OmNz6iO9m",
"parentPublication": {
"id": "proceedings/fccm/2014/5111/0",
"title": "2014 IEEE 22nd Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2010/7029/0/05543889",
"title": "Online multiple classifier boosting for object tracking",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2010/05543889/12OmNzZmZCd",
"parentPublication": {
"id": "proceedings/cvprw/2010/7029/0",
"title": "2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761196",
"title": "Human tracking based on Soft Decision Feature and online real boosting",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761196/12OmNzmclK8",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017582",
"title": "Visual Diagnosis of Tree Boosting Methods",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017582/13rRUwj7cph",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdatasecurity-hpsc-ids/2017/6296/0/07980351",
"title": "A Taxi Gap Prediction Method via Double Ensemble Gradient Boosting Decision Tree",
"doi": null,
"abstractUrl": "/proceedings-article/bigdatasecurity-hpsc-ids/2017/07980351/17D45XeKgqx",
"parentPublication": {
"id": "proceedings/bigdatasecurity-hpsc-ids/2017/6296/0",
"title": "2017 IEEE 3rd International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing, (HPSC) and IEEE International Conference on Intelligent Data and Security (IDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2019/4734/0/08890990",
"title": "HarpGBDT: Optimizing Gradient Boosting Decision Tree for Parallel Efficiency",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2019/08890990/1eLymHVQenC",
"parentPublication": {
"id": "proceedings/cluster/2019/4734/0",
"title": "2019 IEEE International Conference on Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2019/4253/0/425300a132",
"title": "Online Local Boosting: Improving Performance in Online Decision Trees",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2019/425300a132/1fHkFnNqR6o",
"parentPublication": {
"id": "proceedings/bracis/2019/4253/0",
"title": "2019 8th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006028",
"title": "Adapted Tree Boosting for Transfer Learning",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006028/1hJrKUE27yU",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "17D45VtKipR",
"title": "2017 IEEE 3rd International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing, (HPSC) and IEEE International Conference on Intelligent Data and Security (IDS)",
"acronym": "bigdatasecurity-hpsc-ids",
"groupId": "1813447",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "17D45XeKgqx",
"doi": "10.1109/BigDataSecurity.2017.27",
"title": "A Taxi Gap Prediction Method via Double Ensemble Gradient Boosting Decision Tree",
"normalizedTitle": "A Taxi Gap Prediction Method via Double Ensemble Gradient Boosting Decision Tree",
"abstract": "Predicting the gap between taxi demand and supply in taxi booking apps is completely new and important but challenging. However, manually mining gap rule for different conditions may become impractical because of massive and sparse taxi data. Existing works unilaterally consider demand or supply, used only few simple features and verified by little data, but not predict the gap value. Meanwhile, none of them dealing with missing values. In this paper, we introduce a Double Ensemble Gradient Boosting Decision Tree Model(DEGBDT) to predict taxi gap. (1) Our approach specifically considers demand and supply to predict the gap between them. (2) Also, our method provides a greedy feature ranking and selecting method to exploit most reliable feature. (3) To deal with missing value, our model takes the lead in proposing a double ensemble method, which secondarily integrates different Gradient Boosting Decision Tree(GBDT) model at the different data sparse situation. Experiments on real large-scale dataset demonstrate that our approach can effectively predict the taxi gap than state-of-the-art methods, and shows that double ensemble method is efficacious for sparse data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Predicting the gap between taxi demand and supply in taxi booking apps is completely new and important but challenging. However, manually mining gap rule for different conditions may become impractical because of massive and sparse taxi data. Existing works unilaterally consider demand or supply, used only few simple features and verified by little data, but not predict the gap value. Meanwhile, none of them dealing with missing values. In this paper, we introduce a Double Ensemble Gradient Boosting Decision Tree Model(DEGBDT) to predict taxi gap. (1) Our approach specifically considers demand and supply to predict the gap between them. (2) Also, our method provides a greedy feature ranking and selecting method to exploit most reliable feature. (3) To deal with missing value, our model takes the lead in proposing a double ensemble method, which secondarily integrates different Gradient Boosting Decision Tree(GBDT) model at the different data sparse situation. Experiments on real large-scale dataset demonstrate that our approach can effectively predict the taxi gap than state-of-the-art methods, and shows that double ensemble method is efficacious for sparse data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Predicting the gap between taxi demand and supply in taxi booking apps is completely new and important but challenging. However, manually mining gap rule for different conditions may become impractical because of massive and sparse taxi data. Existing works unilaterally consider demand or supply, used only few simple features and verified by little data, but not predict the gap value. Meanwhile, none of them dealing with missing values. In this paper, we introduce a Double Ensemble Gradient Boosting Decision Tree Model(DEGBDT) to predict taxi gap. (1) Our approach specifically considers demand and supply to predict the gap between them. (2) Also, our method provides a greedy feature ranking and selecting method to exploit most reliable feature. (3) To deal with missing value, our model takes the lead in proposing a double ensemble method, which secondarily integrates different Gradient Boosting Decision Tree(GBDT) model at the different data sparse situation. Experiments on real large-scale dataset demonstrate that our approach can effectively predict the taxi gap than state-of-the-art methods, and shows that double ensemble method is efficacious for sparse data.",
"fno": "07980351",
"keywords": [
"Public Transportation",
"Boosting",
"Data Models",
"Decision Trees",
"Predictive Models",
"Training",
"Concrete",
"Taxi Gap",
"Double Ensemble",
"GBDT",
"Data Sparsity"
],
"authors": [
{
"affiliation": null,
"fullName": "Xiao Zhang",
"givenName": "Xiao",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Xiaorong Wang",
"givenName": "Xiaorong",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Wei Chen",
"givenName": "Wei",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jie Tao",
"givenName": "Jie",
"surname": "Tao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Weijing Huang",
"givenName": "Weijing",
"surname": "Huang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Tengjiao Wang",
"givenName": "Tengjiao",
"surname": "Wang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "bigdatasecurity-hpsc-ids",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-05-01T00:00:00",
"pubType": "proceedings",
"pages": "255-260",
"year": "2017",
"issn": null,
"isbn": "978-1-5090-6296-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07980350",
"articleId": "17D45WHONjg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07980352",
"articleId": "17D45XvMcbH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/mass/2017/2324/0/2324a530",
"title": "Predicting Zillow Estimation Error Using Linear Regression and Gradient Boosting",
"doi": null,
"abstractUrl": "/proceedings-article/mass/2017/2324a530/12OmNvTTcfu",
"parentPublication": {
"id": "proceedings/mass/2017/2324/0",
"title": "2017 IEEE 14th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dasc/2013/3381/0/3381a340",
"title": "Adaptive Airport Taxi Dispatch Algorithm Based on PCA-WNN",
"doi": null,
"abstractUrl": "/proceedings-article/dasc/2013/3381a340/12OmNwDj1bL",
"parentPublication": {
"id": "proceedings/dasc/2013/3381/0",
"title": "2013 IEEE International Conference on Dependable, Autonomic and Secure Computing (DASC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smartcity/2015/1893/0/1893a175",
"title": "A Predictive Taxi Dispatching System for Improved User Satisfaction and Taxi Utilization",
"doi": null,
"abstractUrl": "/proceedings-article/smartcity/2015/1893a175/12OmNwMXnv7",
"parentPublication": {
"id": "proceedings/smartcity/2015/1893/0",
"title": "2015 IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2017/1792/0/1792a816",
"title": "Online to Offline Business: Urban Taxi Dispatching with Passenger-Driver Matching Stability",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2017/1792a816/12OmNzyp62R",
"parentPublication": {
"id": "proceedings/icdcs/2017/1792/0",
"title": "2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08258345",
"title": "An online spatio-temporal model for inference and predictions of taxi demand",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08258345/17D45WnnFVk",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lcn/2018/4413/0/08638038",
"title": "Taxi Dispatch Planning via Demand and Destination Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/lcn/2018/08638038/18jXSYKT756",
"parentPublication": {
"id": "proceedings/lcn/2018/4413/0",
"title": "2018 IEEE 43rd Conference on Local Computer Networks (LCN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2021/3902/0/09671688",
"title": "WP-GBDT: An Approach for Winner Prediction using Gradient Boosting Decision Tree",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2021/09671688/1A8h3dwyyNa",
"parentPublication": {
"id": "proceedings/big-data/2021/3902/0",
"title": "2021 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400c145",
"title": "BRIGHT - Drift-Aware Demand Predictions for Taxi Networks (Extended Abstract)",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400c145/1aDSXHTHbXi",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2019/4328/0/09047248",
"title": "Taxi Demand Prediction with LSTM-Based Combination Model",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-bdcloud-socialcom-sustaincom/2019/09047248/1iC6FSJZbPi",
"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/msn/2019/5212/0/521200a176",
"title": "Mobility Pattern-Aware Task Recommendation for Taxi Crowdsourcing Delivery",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2019/521200a176/1j9wlu7MXaU",
"parentPublication": {
"id": "proceedings/msn/2019/5212/0",
"title": "2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1eLylQayFW0",
"title": "2019 IEEE International Conference on Cluster Computing (CLUSTER)",
"acronym": "cluster",
"groupId": "1000095",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1eLymHVQenC",
"doi": "10.1109/CLUSTER.2019.8890990",
"title": "HarpGBDT: Optimizing Gradient Boosting Decision Tree for Parallel Efficiency",
"normalizedTitle": "HarpGBDT: Optimizing Gradient Boosting Decision Tree for Parallel Efficiency",
"abstract": "Gradient Boosting Decision Tree (GBDT) is a widely used machine learning algorithm, whose training involves both irregular computation and random memory access and is challenging for system optimizations. In this paper, we conduct a comprehensive performance analysis of two state-of-the-art systems, XGBoost and LightGBM. They represent two typical parallel implementations for GBDT; one is data parallel and the other one is parallel over features. Substantial thread synchronization overhead, as well as the inefficiency of random memory access, is identified. We propose HarpGBDT, a new GBDT system designed from the perspective of parallel efficiency optimization. Firstly, we adopt a new tree growth method that selects the top K candidates of tree nodes to enable the use of more levels of parallelism without sacrificing the algorithm's accuracy. Secondly, we organize the training data and model data in blocks and propose a block-wise approach as a general model that enables the exploration of various parallelism options. Thirdly, we propose a mixed mode to utilize the advantages of a different mode of parallelism in different phases of training. By changing the configuration of the block size and parallel mode, HarpGBDT is able to attain better parallel efficiency. By extensive experiments on four datasets with different statistical characteristics on the Intel(R) Xeon(R) E5-2699 server, HarpGBDT on average performs 8x faster than XGBoost and 2.6x faster than LightGBM.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Gradient Boosting Decision Tree (GBDT) is a widely used machine learning algorithm, whose training involves both irregular computation and random memory access and is challenging for system optimizations. In this paper, we conduct a comprehensive performance analysis of two state-of-the-art systems, XGBoost and LightGBM. They represent two typical parallel implementations for GBDT; one is data parallel and the other one is parallel over features. Substantial thread synchronization overhead, as well as the inefficiency of random memory access, is identified. We propose HarpGBDT, a new GBDT system designed from the perspective of parallel efficiency optimization. Firstly, we adopt a new tree growth method that selects the top K candidates of tree nodes to enable the use of more levels of parallelism without sacrificing the algorithm's accuracy. Secondly, we organize the training data and model data in blocks and propose a block-wise approach as a general model that enables the exploration of various parallelism options. Thirdly, we propose a mixed mode to utilize the advantages of a different mode of parallelism in different phases of training. By changing the configuration of the block size and parallel mode, HarpGBDT is able to attain better parallel efficiency. By extensive experiments on four datasets with different statistical characteristics on the Intel(R) Xeon(R) E5-2699 server, HarpGBDT on average performs 8x faster than XGBoost and 2.6x faster than LightGBM.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Gradient Boosting Decision Tree (GBDT) is a widely used machine learning algorithm, whose training involves both irregular computation and random memory access and is challenging for system optimizations. In this paper, we conduct a comprehensive performance analysis of two state-of-the-art systems, XGBoost and LightGBM. They represent two typical parallel implementations for GBDT; one is data parallel and the other one is parallel over features. Substantial thread synchronization overhead, as well as the inefficiency of random memory access, is identified. We propose HarpGBDT, a new GBDT system designed from the perspective of parallel efficiency optimization. Firstly, we adopt a new tree growth method that selects the top K candidates of tree nodes to enable the use of more levels of parallelism without sacrificing the algorithm's accuracy. Secondly, we organize the training data and model data in blocks and propose a block-wise approach as a general model that enables the exploration of various parallelism options. Thirdly, we propose a mixed mode to utilize the advantages of a different mode of parallelism in different phases of training. By changing the configuration of the block size and parallel mode, HarpGBDT is able to attain better parallel efficiency. By extensive experiments on four datasets with different statistical characteristics on the Intel(R) Xeon(R) E5-2699 server, HarpGBDT on average performs 8x faster than XGBoost and 2.6x faster than LightGBM.",
"fno": "08890990",
"keywords": [
"Decision Trees",
"Gradient Methods",
"Learning Artificial Intelligence",
"Multi Threading",
"Optimisation",
"Parallel Algorithms",
"Software Performance Evaluation",
"Harp GBDT",
"Machine Learning",
"Random Memory Access",
"System Optimizations",
"Comprehensive Performance Analysis",
"Light GBM",
"Parallel Implementations",
"Thread Synchronization",
"GBDT System",
"Parallel Efficiency Optimization",
"Tree Growth Method",
"Tree Nodes",
"Block Wise Approach",
"Gradient Boosting Decision Tree Optimization",
"XG Boost",
"Parallel Processing",
"Decision Trees",
"Machine Learning Algorithms",
"Training",
"Boosting",
"Data Models",
"Histograms",
"Machine Learning Algorithms",
"Parallel Algorithms",
"Performance Evaluation",
"Multithreading"
],
"authors": [
{
"affiliation": "Indiana University",
"fullName": "Bo Peng",
"givenName": "Bo",
"surname": "Peng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Indiana University",
"fullName": "Langshi Chen",
"givenName": "Langshi",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Indiana University",
"fullName": "Jiayu Li",
"givenName": "Jiayu",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Indiana University",
"fullName": "Miao Jiang",
"givenName": "Miao",
"surname": "Jiang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Indiana University",
"fullName": "Selahattin Akkas",
"givenName": "Selahattin",
"surname": "Akkas",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Intel Corporation",
"fullName": "Egor Smirnov",
"givenName": "Egor",
"surname": "Smirnov",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Intel Corporation",
"fullName": "Ruslan Israfilov",
"givenName": "Ruslan",
"surname": "Israfilov",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Intel Corporation",
"fullName": "Sergey Khekhnev",
"givenName": "Sergey",
"surname": "Khekhnev",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Intel Corporation",
"fullName": "Andrey Nikolaev",
"givenName": "Andrey",
"surname": "Nikolaev",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Indiana University",
"fullName": "Judy Qiu",
"givenName": "Judy",
"surname": "Qiu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cluster",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-09-01T00:00:00",
"pubType": "proceedings",
"pages": "1-11",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-4734-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08891020",
"articleId": "1eLyqm3kwG4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08891019",
"articleId": "1eLypAmr4I0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2017/6543/0/6543a281",
"title": "TencentBoost: A Gradient Boosting Tree System with Parameter Server",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2017/6543a281/12OmNBBhN5a",
"parentPublication": {
"id": "proceedings/icde/2017/6543/0",
"title": "2017 IEEE 33rd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2018/4210/0/421001a153",
"title": "Webshell Detection Based on Random Forest–Gradient Boosting Decision Tree Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2018/421001a153/12OmNqJq4Gk",
"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/ipdps/2018/4368/0/436801a234",
"title": "Efficient Gradient Boosted Decision Tree Training on GPUs",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2018/436801a234/12OmNyRxFkL",
"parentPublication": {
"id": "proceedings/ipdps/2018/4368/0",
"title": "2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdatasecurity-hpsc-ids/2017/6296/0/07980351",
"title": "A Taxi Gap Prediction Method via Double Ensemble Gradient Boosting Decision Tree",
"doi": null,
"abstractUrl": "/proceedings-article/bigdatasecurity-hpsc-ids/2017/07980351/17D45XeKgqx",
"parentPublication": {
"id": "proceedings/bigdatasecurity-hpsc-ids/2017/6296/0",
"title": "2017 IEEE 3rd International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing, (HPSC) and IEEE International Conference on Intelligent Data and Security (IDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2018/9288/0/928800a964",
"title": "An Extension of Gradient Boosted Decision Tree Incorporating Statistical Tests",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2018/928800a964/18jXBLFkN5S",
"parentPublication": {
"id": "proceedings/icdmw/2018/9288/0",
"title": "2018 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2022/8106/0/810600b051",
"title": "Booster: An Accelerator for Gradient Boosting Decision Trees Training and Inference",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2022/810600b051/1F1WdA6siD6",
"parentPublication": {
"id": "proceedings/ipdps/2022/8106/0",
"title": "2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichi/2022/6845/0/684500a669",
"title": "Acute Kidney Injury Prediction with Gradient Boosting Decision Trees enriched with Temporal Features",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2022/684500a669/1GvdIuU0xlC",
"parentPublication": {
"id": "proceedings/ichi/2022/6845/0",
"title": "2022 IEEE 10th International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600a285",
"title": "Pushing the Envelope of Gradient Boosting Forests via Globally-Optimized Oblique Trees",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600a285/1H1mOhfgisw",
"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/td/2019/12/08727750",
"title": "Exploiting GPUs for Efficient Gradient Boosting Decision Tree Training",
"doi": null,
"abstractUrl": "/journal/td/2019/12/08727750/1atT4oDrSJG",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006061",
"title": "Gradient boosting decision trees for cyber security threats detection based on network events logs",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006061/1hJs5EgJpjG",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1fHkEttbVOE",
"title": "2019 8th Brazilian Conference on Intelligent Systems (BRACIS)",
"acronym": "bracis",
"groupId": "1803430",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1fHkFnNqR6o",
"doi": "10.1109/BRACIS.2019.00032",
"title": "Online Local Boosting: Improving Performance in Online Decision Trees",
"normalizedTitle": "Online Local Boosting: Improving Performance in Online Decision Trees",
"abstract": "As more data are produced each day, and faster, data stream mining is growing in importance, making clear the need for algorithms able to fast process these data. Data stream mining algorithms are meant to be solutions to extract knowledge online, specially tailored from continuous data problem. Many of the current algorithms for data stream mining have high processing and memory costs. Often, the higher the predictive performance, the higher these costs. To increase predictive performance without largely increasing memory and time costs, this paper introduces a novel algorithm, named Online Local Boosting (OLBoost), which can be combined into online decision tree algorithms to improve their predictive performance without modifying the structure of the induced decision trees. For such, OLBoost applies a boosting to small separate regions of the instances space. Experimental results presented in this paper show that by using OLBoost the online learning decision tree algorithms can significantly improve their predictive performance. Additionally, it can make smaller trees perform as good or better than larger trees.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As more data are produced each day, and faster, data stream mining is growing in importance, making clear the need for algorithms able to fast process these data. Data stream mining algorithms are meant to be solutions to extract knowledge online, specially tailored from continuous data problem. Many of the current algorithms for data stream mining have high processing and memory costs. Often, the higher the predictive performance, the higher these costs. To increase predictive performance without largely increasing memory and time costs, this paper introduces a novel algorithm, named Online Local Boosting (OLBoost), which can be combined into online decision tree algorithms to improve their predictive performance without modifying the structure of the induced decision trees. For such, OLBoost applies a boosting to small separate regions of the instances space. Experimental results presented in this paper show that by using OLBoost the online learning decision tree algorithms can significantly improve their predictive performance. Additionally, it can make smaller trees perform as good or better than larger trees.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As more data are produced each day, and faster, data stream mining is growing in importance, making clear the need for algorithms able to fast process these data. Data stream mining algorithms are meant to be solutions to extract knowledge online, specially tailored from continuous data problem. Many of the current algorithms for data stream mining have high processing and memory costs. Often, the higher the predictive performance, the higher these costs. To increase predictive performance without largely increasing memory and time costs, this paper introduces a novel algorithm, named Online Local Boosting (OLBoost), which can be combined into online decision tree algorithms to improve their predictive performance without modifying the structure of the induced decision trees. For such, OLBoost applies a boosting to small separate regions of the instances space. Experimental results presented in this paper show that by using OLBoost the online learning decision tree algorithms can significantly improve their predictive performance. Additionally, it can make smaller trees perform as good or better than larger trees.",
"fno": "425300a132",
"keywords": [
"Data Mining",
"Decision Trees",
"Learning Artificial Intelligence",
"Data Stream Mining Algorithms",
"Online Local Boosting",
"OL Boost",
"Induced Decision Trees",
"Online Learning Decision Tree Algorithms",
"Prediction Algorithms",
"Decision Trees",
"Boosting",
"Data Mining",
"Vegetation",
"Proposals",
"Bagging",
"Data Streams Classification Boosting Hoeffding Trees"
],
"authors": [
{
"affiliation": "Comput. Sci. Dept., Londrina State Univ., Londrina, Brazil",
"fullName": "Victor G. Turrisi da Costa",
"givenName": "Victor G.",
"surname": "Turrisi da Costa",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of São Paulo",
"fullName": "Saulo Martiello Mastelini",
"givenName": "Saulo",
"surname": "Martiello Mastelini",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Inst. of Math. & Comput. Sci., Univ. of Sao Paulo, Sao Carlos, Brazil",
"fullName": "André C. Ponce de Leon Ferreira de Carvalho",
"givenName": "André C.",
"surname": "Ponce de Leon Ferreira de Carvalho",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Computer Science DepartmentLondrina State UniversityLondrina, Brazil",
"fullName": "Sylvio Barbon Jr.",
"givenName": "Sylvio",
"surname": "Barbon",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "bracis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-10-01T00:00:00",
"pubType": "proceedings",
"pages": "132-137",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-4253-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "425300a126",
"articleId": "1fHkMDjewaQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "425300a138",
"articleId": "1fHkGTM4U6I",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/fit/2015/9666/0/9666a012",
"title": "Decision Trees Based Classification of Cardiotocograms Using Bagging Approach",
"doi": null,
"abstractUrl": "/proceedings-article/fit/2015/9666a012/12OmNARRYmU",
"parentPublication": {
"id": "proceedings/fit/2015/9666/0",
"title": "2015 13th International Conference on Frontiers of Information Technology (FIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2016/4459/0/4459a388",
"title": "Enhancing Classification of Ecological Momentary Assessment Data Using Bagging and Boosting",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2016/4459a388/12OmNqG0T5l",
"parentPublication": {
"id": "proceedings/ictai/2016/4459/0",
"title": "2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nbis/2012/4779/0/4779a441",
"title": "Empirical Study of Decision Trees and Ensemble Classifiers for Monitoring of Diabetes Patients in Pervasive Healthcare",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2012/4779a441/12OmNqI04EB",
"parentPublication": {
"id": "proceedings/nbis/2012/4779/0",
"title": "2012 15th International Conference on Network-Based Information Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391d056",
"title": "Tracking-by-Segmentation with Online Gradient Boosting Decision Tree",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d056/12OmNx7ov2B",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851d985",
"title": "Online Learning with Bayesian Classification Trees",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851d985/12OmNxWcH4B",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2016/12/07567497",
"title": "Online Bagging and Boosting for Imbalanced Data Streams",
"doi": null,
"abstractUrl": "/journal/tk/2016/12/07567497/13rRUwInuX0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/05/06574846",
"title": "Random Projection Random Discretization Ensembles—Ensembles of Linear Multivariate Decision Trees",
"doi": null,
"abstractUrl": "/journal/tk/2014/05/06574846/13rRUxC0SWA",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2006/08/k1028",
"title": "Orthogonal Decision Trees",
"doi": null,
"abstractUrl": "/journal/tk/2006/08/k1028/13rRUy2YLYT",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08257910",
"title": "Compact multi-class boosted trees",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08257910/17D45W9KVKo",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2018/8023/0/802300a480",
"title": "Making Data Stream Classification Tree-Based Ensembles Lighter",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2018/802300a480/17D45WwsQ82",
"parentPublication": {
"id": "proceedings/bracis/2018/8023/0",
"title": "2018 7th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1hJrHq07uw0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"acronym": "big-data",
"groupId": "1802964",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1hJrKUE27yU",
"doi": "10.1109/BigData47090.2019.9006028",
"title": "Adapted Tree Boosting for Transfer Learning",
"normalizedTitle": "Adapted Tree Boosting for Transfer Learning",
"abstract": "Secure online transaction is an essential task for e-commerce platforms. Alipay, one of the world's leading cashless payment platform, provides the payment service to both merchants and individual customers. The fraud detection models are built to protect the customers, but stronger demands are raised by the new scenes, which are lacking in training data and labels. The proposed model makes a difference by utilizing the data under similar old scenes and the data under a new scene is treated as the target domain to be promoted. Inspired by this real case in Alipay, we view the problem as a transfer learning problem and design a set of revise strategies to transfer the source domain models to the target domain under the framework of gradient boosting tree models. This work provides an option for the cold-start and data-sharing problems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Secure online transaction is an essential task for e-commerce platforms. Alipay, one of the world's leading cashless payment platform, provides the payment service to both merchants and individual customers. The fraud detection models are built to protect the customers, but stronger demands are raised by the new scenes, which are lacking in training data and labels. The proposed model makes a difference by utilizing the data under similar old scenes and the data under a new scene is treated as the target domain to be promoted. Inspired by this real case in Alipay, we view the problem as a transfer learning problem and design a set of revise strategies to transfer the source domain models to the target domain under the framework of gradient boosting tree models. This work provides an option for the cold-start and data-sharing problems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Secure online transaction is an essential task for e-commerce platforms. Alipay, one of the world's leading cashless payment platform, provides the payment service to both merchants and individual customers. The fraud detection models are built to protect the customers, but stronger demands are raised by the new scenes, which are lacking in training data and labels. The proposed model makes a difference by utilizing the data under similar old scenes and the data under a new scene is treated as the target domain to be promoted. Inspired by this real case in Alipay, we view the problem as a transfer learning problem and design a set of revise strategies to transfer the source domain models to the target domain under the framework of gradient boosting tree models. This work provides an option for the cold-start and data-sharing problems.",
"fno": "09006028",
"keywords": [
"Electronic Commerce",
"Fraud",
"Learning Artificial Intelligence",
"Risk Analysis",
"Security Of Data",
"Transaction Processing",
"Trees Mathematics",
"Secure Online Transaction",
"E Commerce Platforms",
"Alipay",
"Payment Service",
"Fraud Detection Models",
"Training Data",
"Target Domain",
"Transfer Learning Problem",
"Source Domain Models",
"Data Sharing Problems",
"Adapted Tree Boosting",
"Adaptation Models",
"Boosting",
"Vegetation",
"Data Models",
"Task Analysis",
"Decision Trees",
"Neural Networks",
"Fraud Detection",
"Transfer Learning",
"Fine Tuning",
"Gradient Boosting Tree"
],
"authors": [
{
"affiliation": "Ant Financial Services Group,Hangzhou,China",
"fullName": "Wenjing Fang",
"givenName": "Wenjing",
"surname": "Fang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Ant Financial Services Group,Hangzhou,China",
"fullName": "Chaochao Chen",
"givenName": "Chaochao",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Ant Financial Services Group,Shanghai,China",
"fullName": "Bowen Song",
"givenName": "Bowen",
"surname": "Song",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Ant Financial Services Group,Hangzhou,China",
"fullName": "Li Wang",
"givenName": "Li",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Ant Financial Services Group,Beijing,China",
"fullName": "Jun Zhou",
"givenName": "Jun",
"surname": "Zhou",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Shanghai Jiao Tong University,Hangzhou,China",
"fullName": "Kenny Q. Zhu",
"givenName": "Kenny Q.",
"surname": "Zhu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "big-data",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-12-01T00:00:00",
"pubType": "proceedings",
"pages": "741-750",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-0858-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09006072",
"articleId": "1hJrQUhMze0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09006088",
"articleId": "1hJrVurXmAo",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icbk/2017/3120/0/3120a264",
"title": "A Transfer Learning Based Boosting Model for Emotion Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icbk/2017/3120a264/12OmNCeK2ig",
"parentPublication": {
"id": "proceedings/icbk/2017/3120/0",
"title": "2017 IEEE International Conference on Big Knowledge (ICBK)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017582",
"title": "Visual Diagnosis of Tree Boosting Methods",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017582/13rRUwj7cph",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2017/09/07592407",
"title": "Learn on Source, Refine on Target: A Model Transfer Learning Framework with Random Forests",
"doi": null,
"abstractUrl": "/journal/tp/2017/09/07592407/13rRUy3gn8L",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdatasecurity-hpsc-ids/2017/6296/0/07980351",
"title": "A Taxi Gap Prediction Method via Double Ensemble Gradient Boosting Decision Tree",
"doi": null,
"abstractUrl": "/proceedings-article/bigdatasecurity-hpsc-ids/2017/07980351/17D45XeKgqx",
"parentPublication": {
"id": "proceedings/bigdatasecurity-hpsc-ids/2017/6296/0",
"title": "2017 IEEE 3rd International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing, (HPSC) and IEEE International Conference on Intelligent Data and Security (IDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2021/0679/0/067900a201",
"title": "DiDA: Iterative Boosting of Disentangled Synthesis and Domain Adaptation",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2021/067900a201/1CATooCX3Vu",
"parentPublication": {
"id": "proceedings/itme/2021/0679/0",
"title": "2021 11th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2019/4734/0/08890990",
"title": "HarpGBDT: Optimizing Gradient Boosting Decision Tree for Parallel Efficiency",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2019/08890990/1eLymHVQenC",
"parentPublication": {
"id": "proceedings/cluster/2019/4734/0",
"title": "2019 IEEE International Conference on Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2019/4253/0/425300a132",
"title": "Online Local Boosting: Improving Performance in Online Decision Trees",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2019/425300a132/1fHkFnNqR6o",
"parentPublication": {
"id": "proceedings/bracis/2019/4253/0",
"title": "2019 8th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aect/2020/4452/0/09194200",
"title": "Tree-Based Bagging and Boosting Algorithms for Proactive Invoice Management",
"doi": null,
"abstractUrl": "/proceedings-article/aect/2020/09194200/1n0Ij2YsOVa",
"parentPublication": {
"id": "proceedings/aect/2020/4452/0",
"title": "2019 International Conference on Advances in the Emerging Computing Technologies (AECT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09377831",
"title": "A Hybrid Machine Learning Framework of Gradient Boosting Decision Tree and Sequence Model for Predicting Escalation in Customer Support",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09377831/1s64jZ37sTC",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900n3819",
"title": "Visualizing Adapted Knowledge in Domain Transfer",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900n3819/1yeJG58uh7q",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1tTtoVK3gYg",
"title": "2021 IEEE 14th Pacific Visualization Symposium (PacificVis)",
"acronym": "pacificvis",
"groupId": "1001657",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1tTtslm0K4g",
"doi": "10.1109/PacificVis52677.2021.00032",
"title": "Investigating the Evolution of Tree Boosting Models with Visual Analytics",
"normalizedTitle": "Investigating the Evolution of Tree Boosting Models with Visual Analytics",
"abstract": "Tree boosting models are widely adopted predictive models and have demonstrated superior performance than other conventional and even deep learning models, especially since the recent release of their parallel and distributed implementations, e.g., XGBoost, LightGMB, and CatBoost. Tree boosting uses a group of sequentially generated weak learners (i.e., decision trees), each learns from the mistakes of its predecessor, to push the model’s decision boundary towards the true boundary. As the number of trees keeps increasing over training, it is important to reveal how the newly-added trees change the predictions of individual data instances, and how the impacts of different data features evolve. To accomplish these goals, in this paper, we introduce a new design of the temporal confusion matrix, providing users with an effective interface to track data instances’ predictions across the tree boosting process. Also, we present an improved visualization to better illustrate and compare the impacts of individual data features (based on their SHAP values) across training iterations. Integrating these components with a tree structure visualization component, we propose a visual analytics system for tree boosting models. Through case studies with domain experts using real-world datasets, we validated the system’s effectiveness.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Tree boosting models are widely adopted predictive models and have demonstrated superior performance than other conventional and even deep learning models, especially since the recent release of their parallel and distributed implementations, e.g., XGBoost, LightGMB, and CatBoost. Tree boosting uses a group of sequentially generated weak learners (i.e., decision trees), each learns from the mistakes of its predecessor, to push the model’s decision boundary towards the true boundary. As the number of trees keeps increasing over training, it is important to reveal how the newly-added trees change the predictions of individual data instances, and how the impacts of different data features evolve. To accomplish these goals, in this paper, we introduce a new design of the temporal confusion matrix, providing users with an effective interface to track data instances’ predictions across the tree boosting process. Also, we present an improved visualization to better illustrate and compare the impacts of individual data features (based on their SHAP values) across training iterations. Integrating these components with a tree structure visualization component, we propose a visual analytics system for tree boosting models. Through case studies with domain experts using real-world datasets, we validated the system’s effectiveness.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Tree boosting models are widely adopted predictive models and have demonstrated superior performance than other conventional and even deep learning models, especially since the recent release of their parallel and distributed implementations, e.g., XGBoost, LightGMB, and CatBoost. Tree boosting uses a group of sequentially generated weak learners (i.e., decision trees), each learns from the mistakes of its predecessor, to push the model’s decision boundary towards the true boundary. As the number of trees keeps increasing over training, it is important to reveal how the newly-added trees change the predictions of individual data instances, and how the impacts of different data features evolve. To accomplish these goals, in this paper, we introduce a new design of the temporal confusion matrix, providing users with an effective interface to track data instances’ predictions across the tree boosting process. Also, we present an improved visualization to better illustrate and compare the impacts of individual data features (based on their SHAP values) across training iterations. Integrating these components with a tree structure visualization component, we propose a visual analytics system for tree boosting models. Through case studies with domain experts using real-world datasets, we validated the system’s effectiveness.",
"fno": "393100a186",
"keywords": [
"Data Visualisation",
"Decision Trees",
"Deep Learning Artificial Intelligence",
"Mathematics Computing",
"Trees Mathematics",
"Visual Analytics",
"Data Instances",
"Tree Structure Visualization Component",
"Tree Boosting Models",
"Predictive Models",
"Deep Learning",
"Decision Trees",
"Data Features",
"SHAP",
"Training",
"Deep Learning",
"Analytical Models",
"Visual Analytics",
"Data Visualization",
"Predictive Models",
"Boosting"
],
"authors": [
{
"affiliation": "Visa Research",
"fullName": "Junpeng Wang",
"givenName": "Junpeng",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Visa Research",
"fullName": "Wei Zhang",
"givenName": "Wei",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Visa Research",
"fullName": "Liang Wang",
"givenName": "Liang",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Visa Research",
"fullName": "Hao Yang",
"givenName": "Hao",
"surname": "Yang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "pacificvis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-04-01T00:00:00",
"pubType": "proceedings",
"pages": "186-195",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-3931-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "393100a181",
"articleId": "1tTtpIPeMtW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "393100a196",
"articleId": "1tTtsrCBB8A",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2015/8391/0/8391d056",
"title": "Tracking-by-Segmentation with Online Gradient Boosting Decision Tree",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d056/12OmNx7ov2B",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017582",
"title": "Visual Diagnosis of Tree Boosting Methods",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017582/13rRUwj7cph",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdatasecurity-hpsc-ids/2017/6296/0/07980351",
"title": "A Taxi Gap Prediction Method via Double Ensemble Gradient Boosting Decision Tree",
"doi": null,
"abstractUrl": "/proceedings-article/bigdatasecurity-hpsc-ids/2017/07980351/17D45XeKgqx",
"parentPublication": {
"id": "proceedings/bigdatasecurity-hpsc-ids/2017/6296/0",
"title": "2017 IEEE 3rd International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing, (HPSC) and IEEE International Conference on Intelligent Data and Security (IDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/02/09759834",
"title": "Latent Gaussian Model Boosting",
"doi": null,
"abstractUrl": "/journal/tp/2023/02/09759834/1CHsy2NPp3G",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600a285",
"title": "Pushing the Envelope of Gradient Boosting Forests via Globally-Optimized Oblique Trees",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600a285/1H1mOhfgisw",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/02/08770154",
"title": "MTBR: Multi-Target Boosting for Regression",
"doi": null,
"abstractUrl": "/journal/tk/2021/02/08770154/1bTQVhE371u",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2019/4253/0/425300a132",
"title": "Online Local Boosting: Improving Performance in Online Decision Trees",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2019/425300a132/1fHkFnNqR6o",
"parentPublication": {
"id": "proceedings/bracis/2019/4253/0",
"title": "2019 8th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2019/4604/0/460400b060",
"title": "Fair Adversarial Gradient Tree Boosting",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2019/460400b060/1h5XOtLSRaw",
"parentPublication": {
"id": "proceedings/icdm/2019/4604/0",
"title": "2019 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006028",
"title": "Adapted Tree Boosting for Transfer Learning",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006028/1hJrKUE27yU",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2023/01/09645204",
"title": "Gradient Boosted Neural Decision Forest",
"doi": null,
"abstractUrl": "/journal/sc/2023/01/09645204/1zc6vCCD5QI",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1uZxqXIabIs",
"title": "2021 2nd International Conference on Computing and Data Science (CDS)",
"acronym": "cds",
"groupId": "1838884",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1uZxuAfIS8E",
"doi": "10.1109/CDS52072.2021.00009",
"title": "Ensemble Learning in Credit Card Fraud Detection Using Boosting Methods",
"normalizedTitle": "Ensemble Learning in Credit Card Fraud Detection Using Boosting Methods",
"abstract": "With the continuous prosperity of the financial market, credit card volume has always been booming these years. The fraud businesses are also raising rapidly. Under this circumstance, fraud detection has become a more and more valuable problem. But the proportion of the fraud is absolutely much lower than the genius transaction, so the imbalance dataset makes this problem much more challenging. In this paper we mainly tell how to cope with the credit card fraud detection problem by using boosting methods and also gave a contribution of the brief comparison between these boosting methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With the continuous prosperity of the financial market, credit card volume has always been booming these years. The fraud businesses are also raising rapidly. Under this circumstance, fraud detection has become a more and more valuable problem. But the proportion of the fraud is absolutely much lower than the genius transaction, so the imbalance dataset makes this problem much more challenging. In this paper we mainly tell how to cope with the credit card fraud detection problem by using boosting methods and also gave a contribution of the brief comparison between these boosting methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With the continuous prosperity of the financial market, credit card volume has always been booming these years. The fraud businesses are also raising rapidly. Under this circumstance, fraud detection has become a more and more valuable problem. But the proportion of the fraud is absolutely much lower than the genius transaction, so the imbalance dataset makes this problem much more challenging. In this paper we mainly tell how to cope with the credit card fraud detection problem by using boosting methods and also gave a contribution of the brief comparison between these boosting methods.",
"fno": "042800a007",
"keywords": [
"Credit Transactions",
"Fraud",
"Learning Artificial Intelligence",
"Security Of Data",
"Ensemble Learning",
"Boosting Methods",
"Continuous Prosperity",
"Financial Market",
"Credit Card Volume",
"Fraud Businesses",
"Valuable Problem",
"Credit Card Fraud Detection Problem",
"Data Science",
"Boosting",
"Credit Cards",
"Decision Trees",
"Business",
"Ensemble Learning",
"Boosting",
"Fraud Detection",
"Credit Card Fraud"
],
"authors": [
{
"affiliation": "School of Economics, Liaoning University,Shenyang,China",
"fullName": "Haonan Feng",
"givenName": "Haonan",
"surname": "Feng",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cds",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-01-01T00:00:00",
"pubType": "proceedings",
"pages": "7-11",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-0428-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "042800a001",
"articleId": "1uZxsjaeqGs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "042800a012",
"articleId": "1uZxAisQpC8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/jcai/2009/3615/0/3615a353",
"title": "Research on Credit Card Fraud Detection Model Based on Distance Sum",
"doi": null,
"abstractUrl": "/proceedings-article/jcai/2009/3615a353/12OmNvUaNq7",
"parentPublication": {
"id": "proceedings/jcai/2009/3615/0",
"title": "2009 International Joint Conference on Artificial Intelligence (JCAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ncm/2009/3769/0/3769a855",
"title": "Behavior-Based Credit Card Fraud Detecting Model",
"doi": null,
"abstractUrl": "/proceedings-article/ncm/2009/3769a855/12OmNxuXcxR",
"parentPublication": {
"id": "proceedings/ncm/2009/3769/0",
"title": "Networked Computing and Advanced Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdicn/2022/8476/0/847600a301",
"title": "Credit Card Fraud Detection using Logistic Regression",
"doi": null,
"abstractUrl": "/proceedings-article/bdicn/2022/847600a301/1CJgBfPY9K8",
"parentPublication": {
"id": "proceedings/bdicn/2022/8476/0",
"title": "2022 International Conference on Big Data, Information and Computer Network (BDICN）",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccict/2022/7224/0/722400a520",
"title": "Review on Credit Card Fraud Detection Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/ccict/2022/722400a520/1HpDXLaTWQU",
"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/ccict/2022/7224/0/722400a056",
"title": "Credit Card Fraud Detection Using Advanced Machine Learning Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/ccict/2022/722400a056/1HpE1wVRa6Y",
"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/sti/2022/9045/0/10103292",
"title": "Fraud Detection of Credit Card using Data Mining Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/sti/2022/10103292/1MBEXoyqKSA",
"parentPublication": {
"id": "proceedings/sti/2022/9045/0",
"title": "2022 4th International Conference on Sustainable Technologies for Industry 4.0 (STI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoias/2019/2662/0/266200a070",
"title": "A Feature Extraction Method for Credit Card Fraud Detection",
"doi": null,
"abstractUrl": "/proceedings-article/icoias/2019/266200a070/1c8Pbgr6GaI",
"parentPublication": {
"id": "proceedings/icoias/2019/2662/0",
"title": "2019 2nd International Conference on Intelligent Autonomous Systems (ICoIAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aike/2019/1488/0/148800a097",
"title": "Dataset Shift Quantification for Credit Card Fraud Detection",
"doi": null,
"abstractUrl": "/proceedings-article/aike/2019/148800a097/1ckrBHJjNHW",
"parentPublication": {
"id": "proceedings/aike/2019/1488/0",
"title": "2019 IEEE Second International Conference on Artificial Intelligence and Knowledge Engineering (AIKE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/sp/2021/02/09382389",
"title": "Credit Card Fraud Is a Computer Security Problem",
"doi": null,
"abstractUrl": "/magazine/sp/2021/02/09382389/1saZTAZ7mhO",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoias/2021/4195/0/419500a246",
"title": "Ensemble Method for Credit Card Fraud Detection",
"doi": null,
"abstractUrl": "/proceedings-article/icoias/2021/419500a246/1wG6gTtdIs0",
"parentPublication": {
"id": "proceedings/icoias/2021/4195/0",
"title": "2021 4th International Conference on Intelligent Autonomous Systems (ICoIAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNCcbEd6",
"title": "2015 13th International Conference on Frontiers of Information Technology (FIT)",
"acronym": "fit",
"groupId": "1800803",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNARRYmU",
"doi": "10.1109/FIT.2015.14",
"title": "Decision Trees Based Classification of Cardiotocograms Using Bagging Approach",
"normalizedTitle": "Decision Trees Based Classification of Cardiotocograms Using Bagging Approach",
"abstract": "Cardiotocography (CTG) is a worldwide method used for recording fetal heart rate and uterine contractions during pregnancy and delivery. The consistent visual assessment of the CTG is not only time consuming but also requires expertise and clinical knowledge of the obstetricians. The inconsistency in visual evaluation can be eliminated by developing clinical decision support systems. During last few decades various data mining and machine learning techniques have been proposed for developing such systems. In present study, bagging approach in combination with three traditional decision trees algorithms (random forest, Reduced Error Pruning Tree (REPTree) and J48) has been applied to identify normal and pathological fetal state using CTG data. Studies show that decision trees algorithms and bagging have separately shown tremendous improvements in the classification of healthy and pathological subjects in medical domain. The parameters of classifiers were optimized before applying on the data sets. The ten folds cross validation is used for examining the robust of the classifiers. The degree of separation was quantified using Precision, Recall and F-Measure. At first full feature space have been analyzed using proposed bagging based decision trees algorithms. Then by using correlation feature selection - subset evaluation (cfs) method, a reduced feature space has been obtained and analyzed using proposed method. The overall classification accuracy of more than 90% has been obtained by the classifiers on the test set when full feature space is used. For all three performance measures, values greater than 0.90 has been achieved with full and reduced feature space. The proposed methodology showed better classification in both full and reduced feature space scenarios.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Cardiotocography (CTG) is a worldwide method used for recording fetal heart rate and uterine contractions during pregnancy and delivery. The consistent visual assessment of the CTG is not only time consuming but also requires expertise and clinical knowledge of the obstetricians. The inconsistency in visual evaluation can be eliminated by developing clinical decision support systems. During last few decades various data mining and machine learning techniques have been proposed for developing such systems. In present study, bagging approach in combination with three traditional decision trees algorithms (random forest, Reduced Error Pruning Tree (REPTree) and J48) has been applied to identify normal and pathological fetal state using CTG data. Studies show that decision trees algorithms and bagging have separately shown tremendous improvements in the classification of healthy and pathological subjects in medical domain. The parameters of classifiers were optimized before applying on the data sets. The ten folds cross validation is used for examining the robust of the classifiers. The degree of separation was quantified using Precision, Recall and F-Measure. At first full feature space have been analyzed using proposed bagging based decision trees algorithms. Then by using correlation feature selection - subset evaluation (cfs) method, a reduced feature space has been obtained and analyzed using proposed method. The overall classification accuracy of more than 90% has been obtained by the classifiers on the test set when full feature space is used. For all three performance measures, values greater than 0.90 has been achieved with full and reduced feature space. The proposed methodology showed better classification in both full and reduced feature space scenarios.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Cardiotocography (CTG) is a worldwide method used for recording fetal heart rate and uterine contractions during pregnancy and delivery. The consistent visual assessment of the CTG is not only time consuming but also requires expertise and clinical knowledge of the obstetricians. The inconsistency in visual evaluation can be eliminated by developing clinical decision support systems. During last few decades various data mining and machine learning techniques have been proposed for developing such systems. In present study, bagging approach in combination with three traditional decision trees algorithms (random forest, Reduced Error Pruning Tree (REPTree) and J48) has been applied to identify normal and pathological fetal state using CTG data. Studies show that decision trees algorithms and bagging have separately shown tremendous improvements in the classification of healthy and pathological subjects in medical domain. The parameters of classifiers were optimized before applying on the data sets. The ten folds cross validation is used for examining the robust of the classifiers. The degree of separation was quantified using Precision, Recall and F-Measure. At first full feature space have been analyzed using proposed bagging based decision trees algorithms. Then by using correlation feature selection - subset evaluation (cfs) method, a reduced feature space has been obtained and analyzed using proposed method. The overall classification accuracy of more than 90% has been obtained by the classifiers on the test set when full feature space is used. For all three performance measures, values greater than 0.90 has been achieved with full and reduced feature space. The proposed methodology showed better classification in both full and reduced feature space scenarios.",
"fno": "9666a012",
"keywords": [
"Bagging",
"Fetal Heart Rate",
"Vegetation",
"Histograms",
"Decision Trees",
"Pathology",
"Classification Algorithms",
"Fetal Heart Rate",
"Bagging",
"Cardiotocography",
"Decision Trees"
],
"authors": [
{
"affiliation": null,
"fullName": "Syed Ahsin Ali Shah",
"givenName": "Syed Ahsin Ali",
"surname": "Shah",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Wajid Aziz",
"givenName": "Wajid",
"surname": "Aziz",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Muhammad Arif",
"givenName": "Muhammad",
"surname": "Arif",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Malik Sajjad A. Nadeem",
"givenName": "Malik Sajjad A.",
"surname": "Nadeem",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "fit",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-12-01T00:00:00",
"pubType": "proceedings",
"pages": "12-17",
"year": "2015",
"issn": null,
"isbn": "978-1-4673-9666-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "9666a006",
"articleId": "12OmNx7ouX5",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "9666a018",
"articleId": "12OmNAS9zy7",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icmla/2009/3926/0/3926a658",
"title": "Bagging Ranking Trees",
"doi": null,
"abstractUrl": "/proceedings-article/icmla/2009/3926a658/12OmNBSBkh5",
"parentPublication": {
"id": "proceedings/icmla/2009/3926/0",
"title": "Machine Learning and Applications, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bife/2009/3705/0/3705a201",
"title": "Design of Chinese Text Categorization Classifier Based on Attribute Bagging",
"doi": null,
"abstractUrl": "/proceedings-article/bife/2009/3705a201/12OmNBlFQZA",
"parentPublication": {
"id": "proceedings/bife/2009/3705/0",
"title": "2009 International Conference on Business Intelligence and Financial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dasc/2009/3929/0/3929a183",
"title": "A Comparative Study of Medical Data Classification Methods Based on Decision Tree and Bagging Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/dasc/2009/3929a183/12OmNx6Pitj",
"parentPublication": {
"id": "proceedings/dasc/2009/3929/0",
"title": "Dependable, Autonomic and Secure Computing, IEEE International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmvit/2017/4993/0/07878645",
"title": "Cardiotocography Analysis Using Conjunction of Machine Learning Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/cmvit/2017/07878645/12OmNx6xHrp",
"parentPublication": {
"id": "proceedings/cmvit/2017/4993/0",
"title": "2017 International Conference on Machine Vision and Information Technology (CMVIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2014/4717/0/06890588",
"title": "An ontological bagging approach for image classification of crowdsourced data",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2014/06890588/12OmNxwENBD",
"parentPublication": {
"id": "proceedings/icmew/2014/4717/0",
"title": "2014 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2014/4761/0/06890259",
"title": "Bagging based metric learning for person re-identification",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2014/06890259/12OmNzSh13K",
"parentPublication": {
"id": "proceedings/icme/2014/4761/0",
"title": "2014 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995462",
"title": "Association rule analysis for fetal heart rate pattern of late FGR",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995462/1JC3ru0znlC",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itca/2019/6494/0/09092449",
"title": "Fetal Heart Baseline Extraction And Classification based on Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/itca/2019/09092449/1jPaXdB6gqQ",
"parentPublication": {
"id": "proceedings/itca/2019/6494/0",
"title": "2019 International Conference on Information Technology and Computer Application (ITCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2020/9429/0/942900a104",
"title": "Periodic Change Detection in Fetal Heart Rate Using Cardiotocograph",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2020/942900a104/1mLMkaCTh1m",
"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/bibm/2020/6215/0/09313143",
"title": "Automatic Classification of Antepartum Cardiotocography Using Fuzzy Clustering and Adaptive Neuro -Fuzzy Inference System",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313143/1qmg23k27n2",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNA0MYZ3",
"title": "2013 27th International Conference on Advanced Information Networking and Applications Workshops",
"acronym": "waina",
"groupId": "1001766",
"volume": "0",
"displayVolume": "0",
"year": "2013",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvSbBxI",
"doi": "10.1109/WAINA.2013.201",
"title": "How to Compare and Interpret Two Learnt Decision Trees from the Same Domain?",
"normalizedTitle": "How to Compare and Interpret Two Learnt Decision Trees from the Same Domain?",
"abstract": "Data mining methods are widely used across many disciplines to identify patterns, rules or associations among huge volumes of data. Decision tree induction such as C4.5 is the most preferred method for classification since it works well on average regardless of the data set being used. The resulting decision tree has explanation capability but problems arise if the data set has been collected at different times or is enlarging and the decision tree induction process has been repeated. The resulting tree will change and the expert is questioning the trustworthy of the result. That brings us to the problem of comparing two decision trees in accordance with its explanation power. In this paper, we present a method how to compare two decision trees and how to interpret the change of the structure and the attributes in the decision tree.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data mining methods are widely used across many disciplines to identify patterns, rules or associations among huge volumes of data. Decision tree induction such as C4.5 is the most preferred method for classification since it works well on average regardless of the data set being used. The resulting decision tree has explanation capability but problems arise if the data set has been collected at different times or is enlarging and the decision tree induction process has been repeated. The resulting tree will change and the expert is questioning the trustworthy of the result. That brings us to the problem of comparing two decision trees in accordance with its explanation power. In this paper, we present a method how to compare two decision trees and how to interpret the change of the structure and the attributes in the decision tree.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data mining methods are widely used across many disciplines to identify patterns, rules or associations among huge volumes of data. Decision tree induction such as C4.5 is the most preferred method for classification since it works well on average regardless of the data set being used. The resulting decision tree has explanation capability but problems arise if the data set has been collected at different times or is enlarging and the decision tree induction process has been repeated. The resulting tree will change and the expert is questioning the trustworthy of the result. That brings us to the problem of comparing two decision trees in accordance with its explanation power. In this paper, we present a method how to compare two decision trees and how to interpret the change of the structure and the attributes in the decision tree.",
"fno": "4952a318",
"keywords": [
"Evaluation",
"Data Mining",
"Decision Trees",
"Comparison Of Decision Trees"
],
"authors": [
{
"affiliation": null,
"fullName": "Petra Perner",
"givenName": "Petra",
"surname": "Perner",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "waina",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2013-03-01T00:00:00",
"pubType": "proceedings",
"pages": "318-322",
"year": "2013",
"issn": null,
"isbn": "978-1-4673-6239-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4952a312",
"articleId": "12OmNAq3hzx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4952a323",
"articleId": "12OmNAhOUJH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cbms/2000/0484/0/04840019",
"title": "Decision Tree's Induction Strategies Evaluated on a Hard Real World Problem",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2000/04840019/12OmNB0nWfl",
"parentPublication": {
"id": "proceedings/cbms/2000/0484/0",
"title": "Proceedings 13th IEEE Symposium on Computer-Based Medical Systems. CBMS 2000",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/picict/2017/6538/0/6538a046",
"title": "Arabic Opinion Mining Using Parallel Decision Trees",
"doi": null,
"abstractUrl": "/proceedings-article/picict/2017/6538a046/12OmNqGRGfS",
"parentPublication": {
"id": "proceedings/picict/2017/6538/0",
"title": "2017 Palestinian International Conference on Information and Communication Technology (PICICT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tai/1990/2084/0/00130432",
"title": "On inducing topologically minimal decision trees",
"doi": null,
"abstractUrl": "/proceedings-article/tai/1990/00130432/12OmNqGitRx",
"parentPublication": {
"id": "proceedings/tai/1990/2084/0",
"title": "Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/citworkshops/2008/3242/0/3242a008",
"title": "A Strategy for Attributes Selection in Cost-Sensitive Decision Trees Induction",
"doi": null,
"abstractUrl": "/proceedings-article/citworkshops/2008/3242a008/12OmNrMHOjr",
"parentPublication": {
"id": "proceedings/citworkshops/2008/3242/0",
"title": "Computer and Information Technology, IEEE 8th International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2000/0909/0/09090028",
"title": "A visualization tool for interactive learning of large decision trees",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2000/09090028/12OmNwCJONU",
"parentPublication": {
"id": "proceedings/ictai/2000/0909/0",
"title": "Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/1999/0456/0/04560287",
"title": "Controlled Flux Results in Stable Decision Trees",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/1999/04560287/12OmNy2rS5F",
"parentPublication": {
"id": "proceedings/ictai/1999/0456/0",
"title": "Proceedings 11th International Conference on Tools with Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2004/02/k0216",
"title": "A Fourier Spectrum-Based Approach to Represent Decision Trees for Mining Data Streams in Mobile Environments",
"doi": null,
"abstractUrl": "/journal/tk/2004/02/k0216/13rRUwgQpqV",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2009/11/ttk2009111505",
"title": "A Dynamic Discretization Approach for Constructing Decision Trees with a Continuous Label",
"doi": null,
"abstractUrl": "/journal/tk/2009/11/ttk2009111505/13rRUx0gefI",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2018/7449/0/744900a401",
"title": "Inducing Readable Oblique Decision Trees",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2018/744900a401/17D45WYQJ7j",
"parentPublication": {
"id": "proceedings/ictai/2018/7449/0",
"title": "2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2019/5584/0/558400a349",
"title": "An Extended Idea about Decision Trees",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2019/558400a349/1jdDNQA7FgQ",
"parentPublication": {
"id": "proceedings/csci/2019/5584/0",
"title": "2019 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyKa5Tm",
"title": "2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI)",
"acronym": "ictai",
"groupId": "1000763",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxdVgKi",
"doi": "10.1109/ICTAI.2017.00140",
"title": "Decision Stream: Cultivating Deep Decision Trees",
"normalizedTitle": "Decision Stream: Cultivating Deep Decision Trees",
"abstract": "Various modifications of decision trees have been extensively used during the past years due to their high efficiency and interpretability. Tree node splitting based on relevant feature selection is a key step of decision tree learning, at the same time being their major shortcoming: the recursive nodes partitioning leads to geometric reduction of data quantity in the leaf nodes, which causes an excessive model complexity and data overfitting. In this paper, we present a novel architecture - a Decision Stream, - aimed to overcome this problem. Instead of building a tree structure during the learning process, we propose merging nodes from different branches based on their similarity that is estimated with two-sample test statistics, which leads to generation of a deep directed acyclic graph of decision rules that can consist of hundreds of levels. To evaluate the proposed solution, we test it on several common machine learning problems-credit scoring, twitter sentiment analysis, aircraft flight control, MNIST and CIFAR image classification, synthetic data classification and regression. Our experimental results reveal that the proposed approach significantly outperforms the standard decision tree learning methods on both regression and classification tasks, yielding a prediction error decrease up to 35%.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Various modifications of decision trees have been extensively used during the past years due to their high efficiency and interpretability. Tree node splitting based on relevant feature selection is a key step of decision tree learning, at the same time being their major shortcoming: the recursive nodes partitioning leads to geometric reduction of data quantity in the leaf nodes, which causes an excessive model complexity and data overfitting. In this paper, we present a novel architecture - a Decision Stream, - aimed to overcome this problem. Instead of building a tree structure during the learning process, we propose merging nodes from different branches based on their similarity that is estimated with two-sample test statistics, which leads to generation of a deep directed acyclic graph of decision rules that can consist of hundreds of levels. To evaluate the proposed solution, we test it on several common machine learning problems-credit scoring, twitter sentiment analysis, aircraft flight control, MNIST and CIFAR image classification, synthetic data classification and regression. Our experimental results reveal that the proposed approach significantly outperforms the standard decision tree learning methods on both regression and classification tasks, yielding a prediction error decrease up to 35%.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Various modifications of decision trees have been extensively used during the past years due to their high efficiency and interpretability. Tree node splitting based on relevant feature selection is a key step of decision tree learning, at the same time being their major shortcoming: the recursive nodes partitioning leads to geometric reduction of data quantity in the leaf nodes, which causes an excessive model complexity and data overfitting. In this paper, we present a novel architecture - a Decision Stream, - aimed to overcome this problem. Instead of building a tree structure during the learning process, we propose merging nodes from different branches based on their similarity that is estimated with two-sample test statistics, which leads to generation of a deep directed acyclic graph of decision rules that can consist of hundreds of levels. To evaluate the proposed solution, we test it on several common machine learning problems-credit scoring, twitter sentiment analysis, aircraft flight control, MNIST and CIFAR image classification, synthetic data classification and regression. Our experimental results reveal that the proposed approach significantly outperforms the standard decision tree learning methods on both regression and classification tasks, yielding a prediction error decrease up to 35%.",
"fno": "387601a905",
"keywords": [
"Decision Trees",
"Directed Graphs",
"Learning Artificial Intelligence",
"Pattern Classification",
"Regression Analysis",
"Trees Mathematics",
"Data Overfitting",
"Decision Stream",
"Tree Structure",
"Learning Process",
"Two Sample Test Statistics",
"Deep Directed Acyclic Graph",
"Decision Rules",
"Synthetic Data Classification",
"Regression",
"Standard Decision Tree",
"Cultivating Deep Decision",
"Decision Trees",
"Interpretability",
"Tree Node Splitting",
"Relevant Feature Selection",
"Decision Tree Learning",
"Recursive Nodes Partitioning",
"Geometric Reduction",
"Data Quantity",
"Leaf Nodes",
"Model Complexity",
"Machine Learning Problems",
"Credit Scoring",
"Decision Trees",
"Merging",
"Training",
"Prediction Algorithms",
"Machine Learning",
"Standards",
"Distributed Databases",
"Decision Tree",
"Data Fusion",
"Two Sample Test Statistic",
"Distributed Machine Learning"
],
"authors": [
{
"affiliation": null,
"fullName": "Dmitry Ignatov",
"givenName": "Dmitry",
"surname": "Ignatov",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Andrey Ignatov",
"givenName": "Andrey",
"surname": "Ignatov",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ictai",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-11-01T00:00:00",
"pubType": "proceedings",
"pages": "905-912",
"year": "2017",
"issn": "2375-0197",
"isbn": "978-1-5386-3876-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "387601a899",
"articleId": "12OmNAlvHLx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "387601a913",
"articleId": "12OmNAXPy2N",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2013/5108/0/5108a330",
"title": "Conformal Prediction Using Decision Trees",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2013/5108a330/12OmNqIQSjQ",
"parentPublication": {
"id": "proceedings/icdm/2013/5108/0",
"title": "2013 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/citworkshops/2008/3242/0/3242a008",
"title": "A Strategy for Attributes Selection in Cost-Sensitive Decision Trees Induction",
"doi": null,
"abstractUrl": "/proceedings-article/citworkshops/2008/3242a008/12OmNrMHOjr",
"parentPublication": {
"id": "proceedings/citworkshops/2008/3242/0",
"title": "Computer and Information Technology, IEEE 8th International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2013/5108/0/5108a320",
"title": "Focal-Test-Based Spatial Decision Tree Learning: A Summary of Results",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2013/5108a320/12OmNvHGryd",
"parentPublication": {
"id": "proceedings/icdm/2013/5108/0",
"title": "2013 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waina/2013/4952/0/4952a318",
"title": "How to Compare and Interpret Two Learnt Decision Trees from the Same Domain?",
"doi": null,
"abstractUrl": "/proceedings-article/waina/2013/4952a318/12OmNvSbBxI",
"parentPublication": {
"id": "proceedings/waina/2013/4952/0",
"title": "2013 27th International Conference on Advanced Information Networking and Applications Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmlc/2003/7865/3/01259745",
"title": "A fuzzy matching method of fuzzy decision trees",
"doi": null,
"abstractUrl": "/proceedings-article/icmlc/2003/01259745/12OmNwogh5K",
"parentPublication": {
"id": "proceedings/icmlc/2003/7865/3",
"title": "Proceedings of the 2003 International Conference on Machine Learning and Cybernetics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2015/8493/0/8493b522",
"title": "Learning Spatial Decision Trees for Land Cover Mapping",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2015/8493b522/12OmNyoAA3T",
"parentPublication": {
"id": "proceedings/icdmw/2015/8493/0",
"title": "2015 IEEE International Conference on Data Mining Workshop (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2017/02/07600471",
"title": "Causal Decision Trees",
"doi": null,
"abstractUrl": "/journal/tk/2017/02/07600471/13rRUEgs2Cw",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/10/07101274",
"title": "Fusing Monotonic Decision Trees",
"doi": null,
"abstractUrl": "/journal/tk/2015/10/07101274/13rRUxcbnCY",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2018/9159/0/08594853",
"title": "Enhancing Very Fast Decision Trees with Local Split-Time Predictions",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2018/08594853/17D45WHONq7",
"parentPublication": {
"id": "proceedings/icdm/2018/9159/0",
"title": "2018 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2018/6100/0/610000b803",
"title": "Deep Decision Trees for Discriminative Dictionary Learning with Adversarial Multi-agent Trajectories",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2018/610000b803/17D45WrVgg5",
"parentPublication": {
"id": "proceedings/cvprw/2018/6100/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx5GU1E",
"title": "Intelligent Information and Database Systems, Asian Conference on",
"acronym": "aciids",
"groupId": "1002816",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzICEPB",
"doi": "10.1109/ACIIDS.2009.24",
"title": "A Structural Sampling Technique for Better Decision Trees",
"normalizedTitle": "A Structural Sampling Technique for Better Decision Trees",
"abstract": "Since data mining problems contain a large amount of data, sampling is a necessity for the success of the task. Decision trees have been developed for prediction, and finding decision trees with smaller error rates has been a major task for their success. This paper suggests a structural sampling technique that is based on a generated decision tree, where the tree is generated based on fast and dirty tree generation algorithm. Experiments with several sample sizes and representative decision tree algorithms showed that the method is more effective with respect to decision tree size and error rate than conventional random sampling method especially for small sample size.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Since data mining problems contain a large amount of data, sampling is a necessity for the success of the task. Decision trees have been developed for prediction, and finding decision trees with smaller error rates has been a major task for their success. This paper suggests a structural sampling technique that is based on a generated decision tree, where the tree is generated based on fast and dirty tree generation algorithm. Experiments with several sample sizes and representative decision tree algorithms showed that the method is more effective with respect to decision tree size and error rate than conventional random sampling method especially for small sample size.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Since data mining problems contain a large amount of data, sampling is a necessity for the success of the task. Decision trees have been developed for prediction, and finding decision trees with smaller error rates has been a major task for their success. This paper suggests a structural sampling technique that is based on a generated decision tree, where the tree is generated based on fast and dirty tree generation algorithm. Experiments with several sample sizes and representative decision tree algorithms showed that the method is more effective with respect to decision tree size and error rate than conventional random sampling method especially for small sample size.",
"fno": "3580a024",
"keywords": [
"Decision Trees",
"Sampling",
"CART",
"C 4 5"
],
"authors": [
{
"affiliation": null,
"fullName": "Hyontai Sug",
"givenName": "Hyontai",
"surname": "Sug",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "aciids",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-04-01T00:00:00",
"pubType": "proceedings",
"pages": "24-27",
"year": "2009",
"issn": null,
"isbn": "978-0-7695-3580-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3580a018",
"articleId": "12OmNBJeyLc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3580a028",
"articleId": "12OmNzGlRHW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/waina/2013/4952/0/4952a318",
"title": "How to Compare and Interpret Two Learnt Decision Trees from the Same Domain?",
"doi": null,
"abstractUrl": "/proceedings-article/waina/2013/4952a318/12OmNvSbBxI",
"parentPublication": {
"id": "proceedings/waina/2013/4952/0",
"title": "2013 27th International Conference on Advanced Information Networking and Applications Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2017/3876/0/387601a905",
"title": "Decision Stream: Cultivating Deep Decision Trees",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2017/387601a905/12OmNxdVgKi",
"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/icde/2009/3545/0/3545a441",
"title": "Decision Trees for Uncertain Data",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2009/3545a441/12OmNy3iFly",
"parentPublication": {
"id": "proceedings/icde/2009/3545/0",
"title": "2009 IEEE 25th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/1999/0456/0/04560091",
"title": "HOT: Heuristics for Oblique Trees",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/1999/04560091/12OmNzUPpzD",
"parentPublication": {
"id": "proceedings/ictai/1999/0456/0",
"title": "Proceedings 11th International Conference on Tools with Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/05/06574846",
"title": "Random Projection Random Discretization Ensembles—Ensembles of Linear Multivariate Decision Trees",
"doi": null,
"abstractUrl": "/journal/tk/2014/05/06574846/13rRUxC0SWA",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08019878",
"title": "TreePOD: Sensitivity-Aware Selection of Pareto-Optimal Decision Trees",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019878/13rRUxYINfl",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/01/ttk2014010108",
"title": "Decision Trees for Mining Data Streams Based on the Gaussian Approximation",
"doi": null,
"abstractUrl": "/journal/tk/2014/01/ttk2014010108/13rRUxYrbMK",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2006/08/k1028",
"title": "Orthogonal Decision Trees",
"doi": null,
"abstractUrl": "/journal/tk/2006/08/k1028/13rRUy2YLYT",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1988/12/e1743",
"title": "Learning from Examples: Generation and Evaluation of Decision Trees for Software Resource Analysis",
"doi": null,
"abstractUrl": "/journal/ts/1988/12/e1743/13rRUypp59e",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2018/7449/0/744900a401",
"title": "Inducing Readable Oblique Decision Trees",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2018/744900a401/17D45WYQJ7j",
"parentPublication": {
"id": "proceedings/ictai/2018/7449/0",
"title": "2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx6g6nT",
"title": "2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"acronym": "bibm",
"groupId": "1001586",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqFrGL8",
"doi": "10.1109/BIBM.2017.8217997",
"title": "TrapRM: Transcriptomic and proteomic rule mining using weighted shortest distance based multiple minimum supports for multi-omics dataset",
"normalizedTitle": "TrapRM: Transcriptomic and proteomic rule mining using weighted shortest distance based multiple minimum supports for multi-omics dataset",
"abstract": "Association rule mining is an important machine learning tool for unveiling critical biological relations between genes from omics data. Previous approaches typically are designed for one single genomic dataset, and most of them use a single minimum support threshold globally. To overcome the above two general limitations, in this work, we present a novel Transcriptomic and Proteomic Rule Mining (TrapRM) method using Weighted Shortest Distance based Multiple Minimum Supports for Multi-Omics Dataset that integrates gene expression, methylation and protein-protein interaction data. To do so, we initially introduce three new thresholds: Weighted Shortest Distance based Multiple Minimum Supports (WSDMS), Weighted Shortest Distance based Multiple Minimum Confidences (WSDMC), and Weighted Shortest Distance based Multiple Minimum Lifts (WSDML). Our algorithm is superior to the related existing algorithms since it generates substantially fewer number of rules and smaller average weighted shortest distance value than the existing methods. Finally, our TrapRM algorithm is useful for extracting the rules that are critical for translational and clinical applications when being applied to drug or disease related multi-omics data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Association rule mining is an important machine learning tool for unveiling critical biological relations between genes from omics data. Previous approaches typically are designed for one single genomic dataset, and most of them use a single minimum support threshold globally. To overcome the above two general limitations, in this work, we present a novel Transcriptomic and Proteomic Rule Mining (TrapRM) method using Weighted Shortest Distance based Multiple Minimum Supports for Multi-Omics Dataset that integrates gene expression, methylation and protein-protein interaction data. To do so, we initially introduce three new thresholds: Weighted Shortest Distance based Multiple Minimum Supports (WSDMS), Weighted Shortest Distance based Multiple Minimum Confidences (WSDMC), and Weighted Shortest Distance based Multiple Minimum Lifts (WSDML). Our algorithm is superior to the related existing algorithms since it generates substantially fewer number of rules and smaller average weighted shortest distance value than the existing methods. Finally, our TrapRM algorithm is useful for extracting the rules that are critical for translational and clinical applications when being applied to drug or disease related multi-omics data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Association rule mining is an important machine learning tool for unveiling critical biological relations between genes from omics data. Previous approaches typically are designed for one single genomic dataset, and most of them use a single minimum support threshold globally. To overcome the above two general limitations, in this work, we present a novel Transcriptomic and Proteomic Rule Mining (TrapRM) method using Weighted Shortest Distance based Multiple Minimum Supports for Multi-Omics Dataset that integrates gene expression, methylation and protein-protein interaction data. To do so, we initially introduce three new thresholds: Weighted Shortest Distance based Multiple Minimum Supports (WSDMS), Weighted Shortest Distance based Multiple Minimum Confidences (WSDMC), and Weighted Shortest Distance based Multiple Minimum Lifts (WSDML). Our algorithm is superior to the related existing algorithms since it generates substantially fewer number of rules and smaller average weighted shortest distance value than the existing methods. Finally, our TrapRM algorithm is useful for extracting the rules that are critical for translational and clinical applications when being applied to drug or disease related multi-omics data.",
"fno": "08217997",
"keywords": [
"Gene Expression",
"Proteins",
"Data Mining",
"Probes",
"Bioinformatics",
"Diseases",
"Multiple Minimum Supports",
"Gene Expression",
"Methylation",
"Protein Protein Interaction",
"Trap RM",
"Limma"
],
"authors": [
{
"affiliation": "Department of Computer Science & Engineering, Aliah University, Newtown, 700156, India",
"fullName": "Saurav Mallik",
"givenName": "Saurav",
"surname": "Mallik",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Center for Precision Health, School of Biomedical Informatics, The University of Texas Health Science Center at Houston, Houston, TX 77030, USA",
"fullName": "Zhongming Zhao",
"givenName": "Zhongming",
"surname": "Zhao",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "bibm",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-11-01T00:00:00",
"pubType": "proceedings",
"pages": "2187-2194",
"year": "2017",
"issn": null,
"isbn": "978-1-5090-3050-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08217996",
"articleId": "12OmNBpmDCJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08217998",
"articleId": "12OmNroij8l",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2014/5669/0/06999146",
"title": "Functional module-centric interpretation of transcriptomic change between human and chimpanzee cerebral cortex",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2014/06999146/12OmNBB0c0M",
"parentPublication": {
"id": "proceedings/bibm/2014/5669/0",
"title": "2014 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcs/2017/3250/0/08035188",
"title": "High Performance Analysis of Omics Data: Experiences at University Magna Graecia of Catanzaro",
"doi": null,
"abstractUrl": "/proceedings-article/hpcs/2017/08035188/12OmNBSSV84",
"parentPublication": {
"id": "proceedings/hpcs/2017/3250/0",
"title": "2017 International Conference on High-Performance Computing & Simulation (HPCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2016/3834/0/3834a013",
"title": "An Ensemble Based in Silico Prediction of Saccharomyces Cerevisiae Proteins under Mitochondrion Organization",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2016/3834a013/12OmNBhHtgy",
"parentPublication": {
"id": "proceedings/bibe/2016/3834/0",
"title": "2016 IEEE 16th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2014/5669/0/06999193",
"title": "Network-constrained forest for regularized omics data classification",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2014/06999193/12OmNrJ11E3",
"parentPublication": {
"id": "proceedings/bibm/2014/5669/0",
"title": "2014 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995707",
"title": "Effective Subject Representation based on Multi-omics Disease Networks using Graph Embedding",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995707/1JC2PJxl9q8",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2020/02/08453848",
"title": "WeCoMXP: Weighted Connectivity Measure Integrating Co-Methylation, Co-Expression and Protein-Protein Interactions for Gene-Module Detection",
"doi": null,
"abstractUrl": "/journal/tb/2020/02/08453848/1iHqtYB3O12",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/09084262",
"title": "Netboost: Boosting-Supported Network Analysis Improves High-Dimensional Omics Prediction in Acute Myeloid Leukemia and Huntington’s Disease",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/09084262/1jtyEZxmynC",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/02/09181464",
"title": "A Novel Graph Topology-Based GO-Similarity Measure for Signature Detection From Multi-Omics Data and its Application to Other Problems",
"doi": null,
"abstractUrl": "/journal/tb/2022/02/09181464/1mK30ek00gw",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/01/09357965",
"title": "Representation Learning for the Clustering of Multi-Omics Data",
"doi": null,
"abstractUrl": "/journal/tb/2022/01/09357965/1rjVNLOlH8c",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/05/09463734",
"title": "DeePROG: Deep Attention-Based Model for Diseased Gene Prognosis by Fusing Multi-Omics Data",
"doi": null,
"abstractUrl": "/journal/tb/2022/05/09463734/1uHceetw3e0",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNrIJqwt",
"title": "2013 IEEE 13th International Conference on Data Mining Workshops (ICDMW)",
"acronym": "icdmw",
"groupId": "1001620",
"volume": "0",
"displayVolume": "0",
"year": "2013",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzxgHD7",
"doi": "10.1109/ICDMW.2013.126",
"title": "On Identifying and Analyzing Significant Nodes in Protein-Protein Interaction Networks",
"normalizedTitle": "On Identifying and Analyzing Significant Nodes in Protein-Protein Interaction Networks",
"abstract": "Network theory has been used for modeling biological data as well as social networks, transportation logistics, business transcripts, and many other types of data sets. Identifying important features/parts of these networks for a multitude of applications is becoming increasingly significant as the need for big data analysis techniques grows. When analyzing a network of protein-protein interactions (PPIs), identifying nodes of significant importance can direct the user toward biologically relevant network features. In this work, we propose that a node of structural importance in a network model can correspond to a biologically vital or significant property. This relationship between topological and biological importance can be seen in/between structurally defined nodes, such as hub nodes and driver nodes, within a network and within clusters. This work proposes data mining approaches for identification and examination of relationships between hub and driver nodes within human, yeast, rat, and mouse PPI networks. Relationships with other types of significant nodes, with direct neighbors, and with the rest of the network were analyzed to determine if the model can be characterized biologically by its structural makeup. We performed numerous tests on structure with a data-driven mentality, looking for properties that were potentially significant on a network level and then comparing those properties to biological significance. Our results showed that identifying and cross-referencing different types of topologically significant nodes can exemplify properties such as transcription factor enrichment, lethality, clustering, and Gene Ontology (GO) enrichment. Mining the biological networks, we discovered a key relationship between network properties and how sparse/dense a network is-a property we described as \"sparseness\". Overall, structurally important nodes were found to have significant biological relevance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Network theory has been used for modeling biological data as well as social networks, transportation logistics, business transcripts, and many other types of data sets. Identifying important features/parts of these networks for a multitude of applications is becoming increasingly significant as the need for big data analysis techniques grows. When analyzing a network of protein-protein interactions (PPIs), identifying nodes of significant importance can direct the user toward biologically relevant network features. In this work, we propose that a node of structural importance in a network model can correspond to a biologically vital or significant property. This relationship between topological and biological importance can be seen in/between structurally defined nodes, such as hub nodes and driver nodes, within a network and within clusters. This work proposes data mining approaches for identification and examination of relationships between hub and driver nodes within human, yeast, rat, and mouse PPI networks. Relationships with other types of significant nodes, with direct neighbors, and with the rest of the network were analyzed to determine if the model can be characterized biologically by its structural makeup. We performed numerous tests on structure with a data-driven mentality, looking for properties that were potentially significant on a network level and then comparing those properties to biological significance. Our results showed that identifying and cross-referencing different types of topologically significant nodes can exemplify properties such as transcription factor enrichment, lethality, clustering, and Gene Ontology (GO) enrichment. Mining the biological networks, we discovered a key relationship between network properties and how sparse/dense a network is-a property we described as \"sparseness\". Overall, structurally important nodes were found to have significant biological relevance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Network theory has been used for modeling biological data as well as social networks, transportation logistics, business transcripts, and many other types of data sets. Identifying important features/parts of these networks for a multitude of applications is becoming increasingly significant as the need for big data analysis techniques grows. When analyzing a network of protein-protein interactions (PPIs), identifying nodes of significant importance can direct the user toward biologically relevant network features. In this work, we propose that a node of structural importance in a network model can correspond to a biologically vital or significant property. This relationship between topological and biological importance can be seen in/between structurally defined nodes, such as hub nodes and driver nodes, within a network and within clusters. This work proposes data mining approaches for identification and examination of relationships between hub and driver nodes within human, yeast, rat, and mouse PPI networks. Relationships with other types of significant nodes, with direct neighbors, and with the rest of the network were analyzed to determine if the model can be characterized biologically by its structural makeup. We performed numerous tests on structure with a data-driven mentality, looking for properties that were potentially significant on a network level and then comparing those properties to biological significance. Our results showed that identifying and cross-referencing different types of topologically significant nodes can exemplify properties such as transcription factor enrichment, lethality, clustering, and Gene Ontology (GO) enrichment. Mining the biological networks, we discovered a key relationship between network properties and how sparse/dense a network is-a property we described as \"sparseness\". Overall, structurally important nodes were found to have significant biological relevance.",
"fno": "3143a343",
"keywords": [
"Proteins",
"Biological System Modeling",
"Analytical Models",
"Databases",
"Educational Institutions",
"Computational Modeling",
"Clustering",
"Protein Protein Interaction Networks",
"Driver Nodes",
"Hub Nodes",
"Network Enrichment",
"Graph Theory"
],
"authors": [
{
"affiliation": null,
"fullName": "Rohan Khazanchi",
"givenName": "Rohan",
"surname": "Khazanchi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Kathryn Dempsey",
"givenName": "Kathryn",
"surname": "Dempsey",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Ishwor Thapa",
"givenName": "Ishwor",
"surname": "Thapa",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Hesham Ali",
"givenName": "Hesham",
"surname": "Ali",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icdmw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2013-12-01T00:00:00",
"pubType": "proceedings",
"pages": "343-348",
"year": "2013",
"issn": null,
"isbn": "978-1-4799-3142-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3143a335",
"articleId": "12OmNBiPRCa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3143a349",
"articleId": "12OmNB8TU3H",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2013/1309/0/06732716",
"title": "Detection of protein complexes in protein interaction networks is improved through network-driven functional homogeneity analysis",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2013/06732716/12OmNASraOB",
"parentPublication": {
"id": "proceedings/bibm/2013/1309/0",
"title": "2013 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2007/0802/0/04221703",
"title": "Labeling network motifs in protein interactomes for protein function prediction",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2007/04221703/12OmNrkBwwp",
"parentPublication": {
"id": "proceedings/icde/2007/0802/0",
"title": "2007 IEEE 23rd International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbrn/2010/4210/0/4210a097",
"title": "Identifying Abnormal Nodes in Protein-Protein Interaction Networks",
"doi": null,
"abstractUrl": "/proceedings-article/sbrn/2010/4210a097/12OmNzw8j40",
"parentPublication": {
"id": "proceedings/sbrn/2010/4210/0",
"title": "Neural Networks, Brazilian Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/02/ttk2014020261",
"title": "Survey: Functional Module Detection from Protein-Protein Interaction Networks",
"doi": null,
"abstractUrl": "/journal/tk/2014/02/ttk2014020261/13rRUIM2VHp",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2017/02/07050327",
"title": "Identifying Spurious Interactions in the Protein-Protein Interaction Networks Using Local Similarity Preserving Embedding",
"doi": null,
"abstractUrl": "/journal/tb/2017/02/07050327/13rRUwI5U6E",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2015/02/06910300",
"title": "Identifying Driver Nodes in the Human Signaling Network Using Structural Controllability Analysis",
"doi": null,
"abstractUrl": "/journal/tb/2015/02/06910300/13rRUxASuEw",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2017/02/07015578",
"title": "Predicting Protein Functions by Using Unbalanced Random Walk Algorithm on Three Biological Networks",
"doi": null,
"abstractUrl": "/journal/tb/2017/02/07015578/13rRUxNW1XZ",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsc/2019/6783/0/08665584",
"title": "Identifying Protein-Protein Interaction Using Tree LSTM and Structured Attention",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2019/08665584/18qcdQQlbiw",
"parentPublication": {
"id": "proceedings/icsc/2019/6783/0",
"title": "2019 IEEE 13th International Conference on Semantic Computing (ICSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/04/09368985",
"title": "Enhancing Cancer Driver Gene Prediction by Protein-Protein Interaction Network",
"doi": null,
"abstractUrl": "/journal/tb/2022/04/09368985/1rFvC8ArppC",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/05/09512473",
"title": "Inferring Gene Co-Expression Networks by Incorporating Prior Protein-Protein Interaction Networks",
"doi": null,
"abstractUrl": "/journal/tb/2022/05/09512473/1w0wwLnnpAc",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "17D45VtKirB",
"title": "2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)",
"acronym": "ictai",
"groupId": "1000763",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "17D45XH89nF",
"doi": "10.1109/ICTAI.2018.00028",
"title": "Identification of Dynamic Parameters for Gene Networks",
"normalizedTitle": "Identification of Dynamic Parameters for Gene Networks",
"abstract": "The study of gene networks allows us to better understand some biological processes such as the adaptation of the organism to a disturbance of the environment. In a discrete modelling framework of gene networks, it has been shown that the Hoare logic can help the modeller to identify the parameters of the model, so that the latter exhibits the observed biological traces. In this paper we present a hybrid modelling of gene networks which pays particular attention to the time spent in each state and we introduce an extension of the Hoare logic in this hybrid framework. The weakest precondition calculus associated with this modified Hoare logic makes it possible to determine the minimal constraints on the dynamic parameters of a gene network from an observed biological trace. These constraints form a continuous CSP that can be solved using the AbSolute continuous solver. The first experimental results show that the obtained solutions are in agreement with the specification of the Hoare triple coming from biological expertise.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The study of gene networks allows us to better understand some biological processes such as the adaptation of the organism to a disturbance of the environment. In a discrete modelling framework of gene networks, it has been shown that the Hoare logic can help the modeller to identify the parameters of the model, so that the latter exhibits the observed biological traces. In this paper we present a hybrid modelling of gene networks which pays particular attention to the time spent in each state and we introduce an extension of the Hoare logic in this hybrid framework. The weakest precondition calculus associated with this modified Hoare logic makes it possible to determine the minimal constraints on the dynamic parameters of a gene network from an observed biological trace. These constraints form a continuous CSP that can be solved using the AbSolute continuous solver. The first experimental results show that the obtained solutions are in agreement with the specification of the Hoare triple coming from biological expertise.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The study of gene networks allows us to better understand some biological processes such as the adaptation of the organism to a disturbance of the environment. In a discrete modelling framework of gene networks, it has been shown that the Hoare logic can help the modeller to identify the parameters of the model, so that the latter exhibits the observed biological traces. In this paper we present a hybrid modelling of gene networks which pays particular attention to the time spent in each state and we introduce an extension of the Hoare logic in this hybrid framework. The weakest precondition calculus associated with this modified Hoare logic makes it possible to determine the minimal constraints on the dynamic parameters of a gene network from an observed biological trace. These constraints form a continuous CSP that can be solved using the AbSolute continuous solver. The first experimental results show that the obtained solutions are in agreement with the specification of the Hoare triple coming from biological expertise.",
"fno": "744900a122",
"keywords": [
"Biology Computing",
"Genetics",
"Process Algebra",
"Gene Network",
"Discrete Modelling Framework",
"Observed Biological Trace",
"Hybrid Modelling",
"Modified Hoare Logic",
"Dynamic Parameters Identification",
"Biological Processes",
"Weakest Precondition Calculus",
"Ab Solute Continuous Solver",
"Hoare Triple",
"Biological System Modeling",
"Multiplexing",
"Adaptation Models",
"Delays",
"Calculus",
"Proteins",
"Genetic Networks",
"Hoare Logic",
"Continuous Constraints"
],
"authors": [
{
"affiliation": null,
"fullName": "Behaegel Jonathan",
"givenName": "Behaegel",
"surname": "Jonathan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Comet Jean-Paul",
"givenName": "Comet",
"surname": "Jean-Paul",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Pelleau Marie",
"givenName": "Pelleau",
"surname": "Marie",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ictai",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-11-01T00:00:00",
"pubType": "proceedings",
"pages": "122-129",
"year": "2018",
"issn": null,
"isbn": "978-1-5386-7449-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "744900a114",
"articleId": "17D45XDIXOY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "744900a130",
"articleId": "17D45WrVg9G",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2013/1309/0/06732709",
"title": "Inferring semantic similarity through correlating information contents of gene ontology terms",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2013/06732709/12OmNBA9oAB",
"parentPublication": {
"id": "proceedings/bibm/2013/1309/0",
"title": "2013 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/jcai/2009/3615/0/3615a501",
"title": "Fuzzy Logical on Boolean Networks as Model of Gene Regulatory Networks",
"doi": null,
"abstractUrl": "/proceedings-article/jcai/2009/3615a501/12OmNC943PR",
"parentPublication": {
"id": "proceedings/jcai/2009/3615/0",
"title": "2009 International Joint Conference on Artificial Intelligence (JCAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imccc/2016/1195/0/07774885",
"title": "A Dynamic Model of Gene Regulation with Reference to Multisource Biological Information",
"doi": null,
"abstractUrl": "/proceedings-article/imccc/2016/07774885/12OmNs59JPN",
"parentPublication": {
"id": "proceedings/imccc/2016/1195/0",
"title": "2016 Sixth International Conference on Instrumentation & Measurement, Computer, Communication and Control (IMCCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2016/4320/0/07945624",
"title": "Assessing gene-disease relationship with multifunctional genes using GO",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2016/07945624/12OmNviZlzH",
"parentPublication": {
"id": "proceedings/aiccsa/2016/4320/0",
"title": "2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2011/1799/0/06120455",
"title": "Identifying Ovarian Cancer Chemotherapy Response Relevant Gene Cliques",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2011/06120455/12OmNx6g6p2",
"parentPublication": {
"id": "proceedings/bibm/2011/1799/0",
"title": "2011 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2016/1611/0/07822803",
"title": "Protein expression data improves gene function prediction",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2016/07822803/12OmNzy7uQ7",
"parentPublication": {
"id": "proceedings/bibm/2016/1611/0",
"title": "2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2014/02/06690102",
"title": "Systematic Approach to Computational Design of Gene Regulatory Networks with Information Processing Capabilities",
"doi": null,
"abstractUrl": "/journal/tb/2014/02/06690102/13rRUwIF6cA",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2020/04/08611189",
"title": "Modified Half-System Based Method for Reverse Engineering of Gene Regulatory Networks",
"doi": null,
"abstractUrl": "/journal/tb/2020/04/08611189/17D45XwUAJy",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/08976083",
"title": "Active Module Identification From Multilayer Weighted Gene Co-Expression Networks: A Continuous Optimization Approach",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/08976083/1h0VUe3pEKk",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/05/09512473",
"title": "Inferring Gene Co-Expression Networks by Incorporating Prior Protein-Protein Interaction Networks",
"doi": null,
"abstractUrl": "/journal/tb/2022/05/09512473/1w0wwLnnpAc",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1fTgF9x78sw",
"title": "2019 IEEE Visualization Conference (VIS)",
"acronym": "vis",
"groupId": "1001944",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1fTgHUjXsHe",
"doi": "10.1109/VISUAL.2019.8933596",
"title": "RuleVis: Constructing Patterns and Rules for Rule-Based Models",
"normalizedTitle": "RuleVis: Constructing Patterns and Rules for Rule-Based Models",
"abstract": "We introduce RuleVis, a web-based application for defining and editing \"correct-by-construction\" executable rules that model biochemical functionality, which can be used to simulate the behavior of protein-protein interaction networks and other complex systems. Rule-based models involve emergent effects based on the interactions between rules, which can vary considerably with regard to the scale of a model, requiring the user to inspect and edit individual rules. RuleVis bridges the graph rewriting and systems biology research communities by providing an external visual representation of salient patterns that experts can use to determine the appropriate level of detail for a particular modeling context. We describe the visualization and interaction features available in RuleVis and provide a detailed example demonstrating how RuleVis can be used to reason about intracellular interactions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We introduce RuleVis, a web-based application for defining and editing \"correct-by-construction\" executable rules that model biochemical functionality, which can be used to simulate the behavior of protein-protein interaction networks and other complex systems. Rule-based models involve emergent effects based on the interactions between rules, which can vary considerably with regard to the scale of a model, requiring the user to inspect and edit individual rules. RuleVis bridges the graph rewriting and systems biology research communities by providing an external visual representation of salient patterns that experts can use to determine the appropriate level of detail for a particular modeling context. We describe the visualization and interaction features available in RuleVis and provide a detailed example demonstrating how RuleVis can be used to reason about intracellular interactions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We introduce RuleVis, a web-based application for defining and editing \"correct-by-construction\" executable rules that model biochemical functionality, which can be used to simulate the behavior of protein-protein interaction networks and other complex systems. Rule-based models involve emergent effects based on the interactions between rules, which can vary considerably with regard to the scale of a model, requiring the user to inspect and edit individual rules. RuleVis bridges the graph rewriting and systems biology research communities by providing an external visual representation of salient patterns that experts can use to determine the appropriate level of detail for a particular modeling context. We describe the visualization and interaction features available in RuleVis and provide a detailed example demonstrating how RuleVis can be used to reason about intracellular interactions.",
"fno": "08933596",
"keywords": [
"Biology Computing",
"Data Visualisation",
"Internet",
"Knowledge Based Systems",
"Proteins",
"Rewriting Systems",
"Protein Protein Interaction Networks",
"Rule Based Models",
"Rule Vis Bridges",
"Graph Rewriting",
"Systems Biology Research Communities",
"Visualization",
"Interaction Features",
"Web Based Application",
"Correct By Construction",
"Biochemical Functionality",
"Intracellular Interactions",
"Visualization",
"Biological System Modeling",
"Data Visualization",
"Computational Modeling",
"Layout",
"Systems Biology",
"Rule Based Modeling",
"Biological Data Visualization"
],
"authors": [
{
"affiliation": "University of California,Department of Computational Media,Santa Cruz",
"fullName": "David Abramov",
"givenName": "David",
"surname": "Abramov",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of California,Department of Computational Media,Santa Cruz",
"fullName": "Jasmine Otto",
"givenName": "Jasmine",
"surname": "Otto",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of California,Department of Computational Media,Santa Cruz",
"fullName": "Mahika Dubey",
"givenName": "Mahika",
"surname": "Dubey",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of California,Department of Computational Media,Santa Cruz",
"fullName": "Cassia Artanegara",
"givenName": "Cassia",
"surname": "Artanegara",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Harvard Medical School,Department of Systems Biology",
"fullName": "Pierre Boutillier",
"givenName": "Pierre",
"surname": "Boutillier",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Harvard Medical School,Department of Systems Biology",
"fullName": "Walter Fontana",
"givenName": "Walter",
"surname": "Fontana",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of California,Department of Computational Media,Santa Cruz",
"fullName": "Angus G. Forbes",
"givenName": "Angus G.",
"surname": "Forbes",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-10-01T00:00:00",
"pubType": "proceedings",
"pages": "191-195",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-4941-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08933544",
"articleId": "1fTgFNhO8SI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08933647",
"articleId": "1fTgH62GEeI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2014/5209/0/5209a100",
"title": "Graph Signatures for Evaluating Network Models",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209a100/12OmNAmmuP0",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2009/4830/0/05255139",
"title": "Computational models in systems biology",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2009/05255139/12OmNBfZSlg",
"parentPublication": {
"id": "proceedings/grc/2009/4830/0",
"title": "2009 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicic/2007/2882/0/28820359",
"title": "Protein-Protein Interaction Prediction based on Association Rules of Protein Functional Regions",
"doi": null,
"abstractUrl": "/proceedings-article/icicic/2007/28820359/12OmNroij2O",
"parentPublication": {
"id": "proceedings/icicic/2007/2882/0",
"title": "2007 Second International Conference on Innovative Computing, Information and Control",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibmw/2010/8303/0/05703936",
"title": "Early stage evolution in metabolic related protein interaction network",
"doi": null,
"abstractUrl": "/proceedings-article/bibmw/2010/05703936/12OmNwekjzM",
"parentPublication": {
"id": "proceedings/bibmw/2010/8303/0",
"title": "2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibmw/2008/2890/0/04686222",
"title": "High-performance computing for drug design",
"doi": null,
"abstractUrl": "/proceedings-article/bibmw/2008/04686222/12OmNzC5SZk",
"parentPublication": {
"id": "proceedings/bibmw/2008/2890/0",
"title": "2008 IEEE International Conference on Bioinformatics and Biomeidcine Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2007/01/n0078",
"title": "Predicting Protein-Protein Interactions from Protein Domains Using a Set Cover Approach",
"doi": null,
"abstractUrl": "/journal/tb/2007/01/n0078/13rRUEgarzT",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017593",
"title": "Dynamic Influence Networks for Rule-Based Models",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017593/13rRUxBa56b",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2011/05/ttb2011051223",
"title": "Designing Logical Rules to Model the Response of Biomolecular Networks with Complex Interactions: An Application to Cancer Modeling",
"doi": null,
"abstractUrl": "/journal/tb/2011/05/ttb2011051223/13rRUxOdD6L",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/04/08306662",
"title": "Local Traces: An Over-Approximation of the Behavior of the Proteins in Rule-Based Models",
"doi": null,
"abstractUrl": "/journal/tb/2018/04/08306662/13rRUy0qnCf",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995095",
"title": "Identifying Temporal Biomarkers of Disease Development through a Thermodynamics-enriched Ensemble Framework",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995095/1JC2zbVd0Lm",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzcPALv",
"title": "2008 IEEE International Conference on Bioinformatics and Biomeidcine Workshops",
"acronym": "bibmw",
"groupId": "1001585",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "1oHlzoQdjYk",
"doi": "10.1109/BIBMW.2008.4686206",
"title": "An integrated database for complex protein structure modeling",
"normalizedTitle": "An integrated database for complex protein structure modeling",
"abstract": "In homology modeling of protein structures, it is typical to find templates through a sequence search against a database of proteins with known structures. In more complicated modeling cases, such as modeling a protein structure in contact with a ligand, sequence information itself may not be enough and more biological information is required for a successful modeling process. SCOP and PFAM are two databases providing protein domain information which can be utilized in complex protein structure modeling. However, due to the manuallycurated nature of both databases, they fail to provide timely coverage of protein sequences existing in the Protein Data Bank (PDB). In this paper, we introduce a new relational database, IDOPS, which integrates sequence and biological information extracted from remediated PDB files and protein domain information generated with HMM profiles of PFAM families. With a carefully designed protocol, this database is updated regularly and the coverage rate of PDB entries is guaranteed to be high.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In homology modeling of protein structures, it is typical to find templates through a sequence search against a database of proteins with known structures. In more complicated modeling cases, such as modeling a protein structure in contact with a ligand, sequence information itself may not be enough and more biological information is required for a successful modeling process. SCOP and PFAM are two databases providing protein domain information which can be utilized in complex protein structure modeling. However, due to the manuallycurated nature of both databases, they fail to provide timely coverage of protein sequences existing in the Protein Data Bank (PDB). In this paper, we introduce a new relational database, IDOPS, which integrates sequence and biological information extracted from remediated PDB files and protein domain information generated with HMM profiles of PFAM families. With a carefully designed protocol, this database is updated regularly and the coverage rate of PDB entries is guaranteed to be high.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In homology modeling of protein structures, it is typical to find templates through a sequence search against a database of proteins with known structures. In more complicated modeling cases, such as modeling a protein structure in contact with a ligand, sequence information itself may not be enough and more biological information is required for a successful modeling process. SCOP and PFAM are two databases providing protein domain information which can be utilized in complex protein structure modeling. However, due to the manuallycurated nature of both databases, they fail to provide timely coverage of protein sequences existing in the Protein Data Bank (PDB). In this paper, we introduce a new relational database, IDOPS, which integrates sequence and biological information extracted from remediated PDB files and protein domain information generated with HMM profiles of PFAM families. With a carefully designed protocol, this database is updated regularly and the coverage rate of PDB entries is guaranteed to be high.",
"fno": "04686206",
"keywords": [
"Information Retrieval",
"Macromolecules",
"Medical Information Systems",
"Proteins",
"Relational Databases",
"Complex Protein Structure Modeling",
"Sequence Search",
"Sequence Information",
"SCOP",
"PFAM",
"Protein Domain Information",
"Protein Data Bank",
"Relational Database",
"Remediated PDB Files",
"Proteins",
"Biological System Modeling",
"Sequences",
"Relational Databases",
"Predictive Models",
"Hidden Markov Models",
"Protocols",
"Spine",
"Cancer",
"Data Mining"
],
"authors": [
{
"affiliation": "Fox Chase Cancer Center, USA",
"fullName": "Qiang Wang",
"givenName": null,
"surname": "Qiang Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Fox Chase Cancer Center, USA",
"fullName": "Roland L. Dunbrack Jr.",
"givenName": "Roland L.",
"surname": "Dunbrack",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "bibmw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-11-01T00:00:00",
"pubType": "proceedings",
"pages": "33-40",
"year": "2008",
"issn": null,
"isbn": "978-1-4244-2890-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04686222",
"articleId": "12OmNzC5SZk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04686227",
"articleId": "1wMJ0vwz160",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icccnt/2013/3926/0/06726753",
"title": "Bioinformatics: Protein structure prediction",
"doi": null,
"abstractUrl": "/proceedings-article/icccnt/2013/06726753/12OmNA0vnYl",
"parentPublication": {
"id": "proceedings/icccnt/2013/3926/0",
"title": "2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2012/4357/0/06399667",
"title": "Using protein-domain information for multiple sequence alignment",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2012/06399667/12OmNqBbI2a",
"parentPublication": {
"id": "proceedings/bibe/2012/4357/0",
"title": "2012 IEEE 12th International Conference on Bioinformatics & Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccabs/2011/4851/0/261",
"title": "Poster: PRDDs: A Protein Residue Distance & Angle Distribution Database for Secondary Structures",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2011/261/12OmNvq5jxl",
"parentPublication": {
"id": "proceedings/iccabs/2011/4851/0",
"title": "2011 IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdcloud-socialcom-sustaincom/2016/3936/0/3936a607",
"title": "Coarse-Grained Contact Potential Helps Improve Fold Recognition Sensitivity in Template-Based Protein Structure Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/bdcloud-socialcom-sustaincom/2016/3936a607/12OmNxGSmdq",
"parentPublication": {
"id": "proceedings/bdcloud-socialcom-sustaincom/2016/3936/0",
"title": "2016 IEEE International Conferences on Big Data and Cloud Computing (BDCloud), Social Computing and Networking (SocialCom), Sustainable Computing and Communications (SustainCom) (BDCloud-SocialCom-SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2012/2621/0/06327430",
"title": "Enhancing Protein Domain Detection Using Domain Co-occurrence and Domain Exclusion",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2012/06327430/12OmNzCF4VT",
"parentPublication": {
"id": "proceedings/dexa/2012/2621/0",
"title": "2012 23rd International Workshop on Database and Expert Systems Applications (DEXA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2001/06/x6021",
"title": "Automatic Pattern Embedding in Protein Structure Models",
"doi": null,
"abstractUrl": "/magazine/ex/2001/06/x6021/13rRUx0Pqu3",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2017/02/07229304",
"title": "Discovering Protein-DNA Binding Cores by Aligned Pattern Clustering",
"doi": null,
"abstractUrl": "/journal/tb/2017/02/07229304/13rRUygT7lk",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09994883",
"title": "Evaluating template-based and template-free protein-peptide complex structure prediction using AlphaFold2",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09994883/1JC1VFrz5rG",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995562",
"title": "S-PDB: Analysis and Classification of SARS-CoV-2 Spike Protein Structures",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995562/1JC3vGAkMzC",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2020/9274/0/927400a308",
"title": "Fusion of BLAST and Ensemble of Classifiers for Protein Secondary Structure Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2020/927400a308/1p2VzIqeWd2",
"parentPublication": {
"id": "proceedings/sibgrapi/2020/9274/0",
"title": "2020 33rd SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxzMnTW",
"title": "2015 26th International Workshop on Database and Expert Systems Applications (DEXA)",
"acronym": "dexa",
"groupId": "1000180",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNB8kHX7",
"doi": "10.1109/DEXA.2015.29",
"title": "A Hybrid Possibilistic Algorithm for Biclustering: Application to Microarray Data Analysis",
"normalizedTitle": "A Hybrid Possibilistic Algorithm for Biclustering: Application to Microarray Data Analysis",
"abstract": "A attractive way to perform biclustering of genes and conditions is to adopt the notion of fuzzy sets, which is useful for discovering overlapping biclusters. Fuzzy clustering is well known as a robust and efficient way to reduce computation cost to obtain the better results. However, this approach is not explored very well. In this paper, we propose a new algorithm called, Refine Bicluster for biclustering of microarray data using the fuzzy approach. This algorithm adopts the strategy of one bicluster at a time, assigning to each data matrix element, i.e. each gene and for each condition, a membership to bicluster. The biclustering problem, in where one would maximize the size of the bicluster and minimize the residual, is faced as the optimization of a proper functional. Applied on continuous synthetic datasets, our algorithm outperforms other biclustering algorithms for microarray data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A attractive way to perform biclustering of genes and conditions is to adopt the notion of fuzzy sets, which is useful for discovering overlapping biclusters. Fuzzy clustering is well known as a robust and efficient way to reduce computation cost to obtain the better results. However, this approach is not explored very well. In this paper, we propose a new algorithm called, Refine Bicluster for biclustering of microarray data using the fuzzy approach. This algorithm adopts the strategy of one bicluster at a time, assigning to each data matrix element, i.e. each gene and for each condition, a membership to bicluster. The biclustering problem, in where one would maximize the size of the bicluster and minimize the residual, is faced as the optimization of a proper functional. Applied on continuous synthetic datasets, our algorithm outperforms other biclustering algorithms for microarray data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A attractive way to perform biclustering of genes and conditions is to adopt the notion of fuzzy sets, which is useful for discovering overlapping biclusters. Fuzzy clustering is well known as a robust and efficient way to reduce computation cost to obtain the better results. However, this approach is not explored very well. In this paper, we propose a new algorithm called, Refine Bicluster for biclustering of microarray data using the fuzzy approach. This algorithm adopts the strategy of one bicluster at a time, assigning to each data matrix element, i.e. each gene and for each condition, a membership to bicluster. The biclustering problem, in where one would maximize the size of the bicluster and minimize the residual, is faced as the optimization of a proper functional. Applied on continuous synthetic datasets, our algorithm outperforms other biclustering algorithms for microarray data.",
"fno": "07406268",
"keywords": [
"Clustering Algorithms",
"Algorithm Design And Analysis",
"Linear Programming",
"Gene Expression",
"Phase Change Materials",
"Fuzzy Sets",
"Electrical Engineering",
"Microarray Data",
"Biclustering",
"Fuzzy Strategy"
],
"authors": [
{
"affiliation": null,
"fullName": "Haifa Ben Saber",
"givenName": "Haifa Ben",
"surname": "Saber",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Mourad Elloumi",
"givenName": "Mourad",
"surname": "Elloumi",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "dexa",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-09-01T00:00:00",
"pubType": "proceedings",
"pages": "48-52",
"year": "2015",
"issn": "1529-4188",
"isbn": "978-1-4673-7581-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07406267",
"articleId": "12OmNzyGH7L",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07406269",
"articleId": "12OmNyPQ4BL",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2009/3545/0/3545b219",
"title": "Exploiting Domain Knowledge to Improve Biological Significance of Biclusters with Key Missing Genes",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2009/3545b219/12OmNBhZ4r9",
"parentPublication": {
"id": "proceedings/icde/2009/3545/0",
"title": "2009 IEEE 25th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2010/4257/0/4257a779",
"title": "FDCluster: Mining Frequent Closed Discriminative Bicluster without Candidate Maintenance in Multiple Microarray Datasets",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2010/4257a779/12OmNBr4eGo",
"parentPublication": {
"id": "proceedings/icdmw/2010/4257/0",
"title": "2010 IEEE International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2006/2727/0/27270110",
"title": "Quick Hierarchical Biclustering on Microarray Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2006/27270110/12OmNqOffAg",
"parentPublication": {
"id": "proceedings/bibe/2006/2727/0",
"title": "2006 IEEE Symposium on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2011/0372/0/06122635",
"title": "Online MOACO biclustering of microarray data",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2011/06122635/12OmNvDqsAg",
"parentPublication": {
"id": "proceedings/grc/2011/0372/0",
"title": "2011 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2015/8493/0/8493a132",
"title": "An Enumerative Biclustering Algorithm for DNA Microarray Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2015/8493a132/12OmNwwuE2j",
"parentPublication": {
"id": "proceedings/icdmw/2015/8493/0",
"title": "2015 IEEE International Conference on Data Mining Workshop (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccicc/2016/3846/0/07862071",
"title": "Ensemble cuckoo search biclustering of the gene expression data",
"doi": null,
"abstractUrl": "/proceedings-article/iccicc/2016/07862071/12OmNxWLTwv",
"parentPublication": {
"id": "proceedings/iccicc/2016/3846/0",
"title": "2016 IEEE 15th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibmw/2010/8303/0/05703807",
"title": "Geometric biclustering analysis of DNA microarray data based on hypergraph partitioning",
"doi": null,
"abstractUrl": "/proceedings-article/bibmw/2010/05703807/12OmNyUWR4V",
"parentPublication": {
"id": "proceedings/bibmw/2010/8303/0",
"title": "2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2009/4830/0/05255086",
"title": "Multi-objective ant colony optimization biclustering of microarray data",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2009/05255086/12OmNzmLxFZ",
"parentPublication": {
"id": "proceedings/grc/2009/4830/0",
"title": "2009 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2018/8023/0/802300a546",
"title": "A Study of Biclustering Coherence Measures for Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2018/802300a546/17D45XeKgpT",
"parentPublication": {
"id": "proceedings/bracis/2018/8023/0",
"title": "2018 7th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/09036923",
"title": "POPBic: Pathway-Based Order Preserving Biclustering Algorithm Towards the Analysis of Gene Expression Data",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/09036923/1igMLivS7cY",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvDI3MW",
"title": "2013 IEEE International Conference on Data Mining (ICDM)",
"acronym": "icdm",
"groupId": "1000179",
"volume": "0",
"displayVolume": "0",
"year": "2013",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNB9t6mz",
"doi": "10.1109/ICDM.2013.36",
"title": "Discovering Non-redundant Overlapping Biclusters on Gene Expression Data",
"normalizedTitle": "Discovering Non-redundant Overlapping Biclusters on Gene Expression Data",
"abstract": "Given a gene expression data matrix where each cell is the expression level of a gene under a certain condition, biclustering is the problem of searching for a subset of genes that co regulate and co express only under a subset of conditions. As some genes can belong to different functional categories, searching for non-redundant overlapping biclusters is an important problem in biclustering. However, most recent algorithms can only either produce disjoint biclusters or redundant biclusters with significant overlap. In other words, these algorithms do not allow users to specify the maximum overlap between the biclusters. In this paper, we propose a novel algorithm which can generate K overlapping biclusters where the maximum overlap between them is below a predefined threshold. Unlike the other approaches which often generate all biclusters at once, our algorithm produces the biclusters sequentially, where each newly generated bicluster is guaranteed to be different from the previous ones but can still overlap with them. The experiments on real datasets confirm that different meaningful overlapping biclusters are successfully discovered. Besides, under the same constraints, our algorithm returns much larger and higher-quality biclusters compared to those of the other state-of-the art algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Given a gene expression data matrix where each cell is the expression level of a gene under a certain condition, biclustering is the problem of searching for a subset of genes that co regulate and co express only under a subset of conditions. As some genes can belong to different functional categories, searching for non-redundant overlapping biclusters is an important problem in biclustering. However, most recent algorithms can only either produce disjoint biclusters or redundant biclusters with significant overlap. In other words, these algorithms do not allow users to specify the maximum overlap between the biclusters. In this paper, we propose a novel algorithm which can generate K overlapping biclusters where the maximum overlap between them is below a predefined threshold. Unlike the other approaches which often generate all biclusters at once, our algorithm produces the biclusters sequentially, where each newly generated bicluster is guaranteed to be different from the previous ones but can still overlap with them. The experiments on real datasets confirm that different meaningful overlapping biclusters are successfully discovered. Besides, under the same constraints, our algorithm returns much larger and higher-quality biclusters compared to those of the other state-of-the art algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Given a gene expression data matrix where each cell is the expression level of a gene under a certain condition, biclustering is the problem of searching for a subset of genes that co regulate and co express only under a subset of conditions. As some genes can belong to different functional categories, searching for non-redundant overlapping biclusters is an important problem in biclustering. However, most recent algorithms can only either produce disjoint biclusters or redundant biclusters with significant overlap. In other words, these algorithms do not allow users to specify the maximum overlap between the biclusters. In this paper, we propose a novel algorithm which can generate K overlapping biclusters where the maximum overlap between them is below a predefined threshold. Unlike the other approaches which often generate all biclusters at once, our algorithm produces the biclusters sequentially, where each newly generated bicluster is guaranteed to be different from the previous ones but can still overlap with them. The experiments on real datasets confirm that different meaningful overlapping biclusters are successfully discovered. Besides, under the same constraints, our algorithm returns much larger and higher-quality biclusters compared to those of the other state-of-the art algorithms.",
"fno": "5108a747",
"keywords": [
"Clustering Algorithms",
"Gene Expression",
"Complexity Theory",
"Search Problems",
"Biological System Modeling",
"Coherence",
"Gene Expression Data",
"Non Redundant Overlapping Biclustering"
],
"authors": [
{
"affiliation": null,
"fullName": "Duy Tin Truong",
"givenName": "Duy Tin",
"surname": "Truong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Roberto Battiti",
"givenName": "Roberto",
"surname": "Battiti",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Mauro Brunato",
"givenName": "Mauro",
"surname": "Brunato",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icdm",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2013-12-01T00:00:00",
"pubType": "proceedings",
"pages": "747-756",
"year": "2013",
"issn": "1550-4786",
"isbn": "978-0-7695-5108-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "5108a737",
"articleId": "12OmNzw8j9m",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "5108a757",
"articleId": "12OmNwDAC7V",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bibe/2007/1509/0/04375656",
"title": "Rough Overlapping Biclustering of Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2007/04375656/12OmNC943E9",
"parentPublication": {
"id": "proceedings/bibe/2007/1509/0",
"title": "7th IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2004/2173/0/21730283",
"title": "Mining Deterministic Biclusters in Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2004/21730283/12OmNvD8Rta",
"parentPublication": {
"id": "proceedings/bibe/2004/2173/0",
"title": "Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'04)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2012/2621/0/06327427",
"title": "Evolutionary Biclustering Algorithm of Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2012/06327427/12OmNvjgWY0",
"parentPublication": {
"id": "proceedings/dexa/2012/2621/0",
"title": "2012 23rd International Workshop on Database and Expert Systems Applications (DEXA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2012/4905/0/4905b056",
"title": "Exclusive Row Biclustering for Gene Expression Using a Combinatorial Auction Approach",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2012/4905b056/12OmNx8fib4",
"parentPublication": {
"id": "proceedings/icdm/2012/4905/0",
"title": "2012 IEEE 12th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/biotechno/2008/3191/0/3191a131",
"title": "RN-Cluster: Discovering Coherent Biclusters Which is Robust to Noise",
"doi": null,
"abstractUrl": "/proceedings-article/biotechno/2008/3191a131/12OmNy7yEfy",
"parentPublication": {
"id": "proceedings/biotechno/2008/3191/0",
"title": "International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isda/2009/3872/0/3872b239",
"title": "An Overlapping Control",
"doi": null,
"abstractUrl": "/proceedings-article/isda/2009/3872b239/12OmNyRg4ro",
"parentPublication": {
"id": "proceedings/isda/2009/3872/0",
"title": "Intelligent Systems Design and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2012/4925/0/4925a131",
"title": "Biclustering of High-throughput Gene Expression Data with Bicluster Miner",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2012/4925a131/12OmNynJMT9",
"parentPublication": {
"id": "proceedings/icdmw/2012/4925/0",
"title": "2012 IEEE 12th International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2010/01/ttb2010010153",
"title": "Identification of Regulatory Modules in Time Series Gene Expression Data Using a Linear Time Biclustering Algorithm",
"doi": null,
"abstractUrl": "/journal/tb/2010/01/ttb2010010153/13rRUNvyadj",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2012/02/ttb2012020560",
"title": "Parallelized Evolutionary Learning for Detection of Biclusters in Gene Expression Data",
"doi": null,
"abstractUrl": "/journal/tb/2012/02/ttb2012020560/13rRUx0xPtP",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/09036923",
"title": "POPBic: Pathway-Based Order Preserving Biclustering Algorithm Towards the Analysis of Gene Expression Data",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/09036923/1igMLivS7cY",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvkYx7I",
"title": "2009 IEEE 25th International Conference on Data Engineering",
"acronym": "icde",
"groupId": "1000178",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBhZ4r9",
"doi": "10.1109/ICDE.2009.205",
"title": "Exploiting Domain Knowledge to Improve Biological Significance of Biclusters with Key Missing Genes",
"normalizedTitle": "Exploiting Domain Knowledge to Improve Biological Significance of Biclusters with Key Missing Genes",
"abstract": "In an era of increasingly complex biological datasets, one of the key steps in gene functional analysis comes from clustering genes based on co-expression. Biclustering algorithms can identify gene clusters with local co-expressed patterns, which are more likely to define genes functioning together than global clustering methods. However, these algorithms are not effective in uncovering gene regulatory networks because the mined biclusters lack genes that may be critical in the function but may not be co-expressed with the clustered genes. In this paper, we introduce a biclustering method called SKeleton Biclustering (SKB), which builds high quality biclusters from microarray data, creates relationships among the biclustered genes based on Gene Ontology annotations, and identifies genes that are missing in the biclusters. SKB thus defines inter-bicluster and intra-bicluster functional relationships. The delineation of functional relationships and incorporation of such missing genes may help biologists to discover biological processes that are important in a given study and provides clues for how the processes may be functioning together. Experimental results show that, with SKB, the biological significance of the biclusters is considerably improved.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In an era of increasingly complex biological datasets, one of the key steps in gene functional analysis comes from clustering genes based on co-expression. Biclustering algorithms can identify gene clusters with local co-expressed patterns, which are more likely to define genes functioning together than global clustering methods. However, these algorithms are not effective in uncovering gene regulatory networks because the mined biclusters lack genes that may be critical in the function but may not be co-expressed with the clustered genes. In this paper, we introduce a biclustering method called SKeleton Biclustering (SKB), which builds high quality biclusters from microarray data, creates relationships among the biclustered genes based on Gene Ontology annotations, and identifies genes that are missing in the biclusters. SKB thus defines inter-bicluster and intra-bicluster functional relationships. The delineation of functional relationships and incorporation of such missing genes may help biologists to discover biological processes that are important in a given study and provides clues for how the processes may be functioning together. Experimental results show that, with SKB, the biological significance of the biclusters is considerably improved.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In an era of increasingly complex biological datasets, one of the key steps in gene functional analysis comes from clustering genes based on co-expression. Biclustering algorithms can identify gene clusters with local co-expressed patterns, which are more likely to define genes functioning together than global clustering methods. However, these algorithms are not effective in uncovering gene regulatory networks because the mined biclusters lack genes that may be critical in the function but may not be co-expressed with the clustered genes. In this paper, we introduce a biclustering method called SKeleton Biclustering (SKB), which builds high quality biclusters from microarray data, creates relationships among the biclustered genes based on Gene Ontology annotations, and identifies genes that are missing in the biclusters. SKB thus defines inter-bicluster and intra-bicluster functional relationships. The delineation of functional relationships and incorporation of such missing genes may help biologists to discover biological processes that are important in a given study and provides clues for how the processes may be functioning together. Experimental results show that, with SKB, the biological significance of the biclusters is considerably improved.",
"fno": "3545b219",
"keywords": [
"Clustering Gene Expression Gene Ontology"
],
"authors": [
{
"affiliation": null,
"fullName": "Jin Chen",
"givenName": "Jin",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Liping Ji",
"givenName": "Liping",
"surname": "Ji",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Wynne Hsu",
"givenName": "Wynne",
"surname": "Hsu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Kian-Lee Tan",
"givenName": "Kian-Lee",
"surname": "Tan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Seung Y. Rhee",
"givenName": "Seung Y.",
"surname": "Rhee",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icde",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-03-01T00:00:00",
"pubType": "proceedings",
"pages": "1219-1222",
"year": "2009",
"issn": "1084-4627",
"isbn": "978-0-7695-3545-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3545b215",
"articleId": "12OmNA0vnV4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3545b223",
"articleId": "12OmNAs2tpZ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/dexa/2015/7581/0/07406268",
"title": "A Hybrid Possibilistic Algorithm for Biclustering: Application to Microarray Data Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2015/07406268/12OmNB8kHX7",
"parentPublication": {
"id": "proceedings/dexa/2015/7581/0",
"title": "2015 26th International Workshop on Database and Expert Systems Applications (DEXA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2013/5108/0/5108a747",
"title": "Discovering Non-redundant Overlapping Biclusters on Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2013/5108a747/12OmNB9t6mz",
"parentPublication": {
"id": "proceedings/icdm/2013/5108/0",
"title": "2013 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2004/2173/0/21730283",
"title": "Mining Deterministic Biclusters in Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2004/21730283/12OmNvD8Rta",
"parentPublication": {
"id": "proceedings/bibe/2004/2173/0",
"title": "Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'04)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aina/2018/2195/0/219501b003",
"title": "NBF: An FCA-Based Algorithm to Identify Negative Correlation Biclusters of DNA Microarray Data",
"doi": null,
"abstractUrl": "/proceedings-article/aina/2018/219501b003/12OmNwGIcvk",
"parentPublication": {
"id": "proceedings/aina/2018/2195/0",
"title": "2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/biotechno/2008/3191/0/3191a131",
"title": "RN-Cluster: Discovering Coherent Biclusters Which is Robust to Noise",
"doi": null,
"abstractUrl": "/proceedings-article/biotechno/2008/3191a131/12OmNy7yEfy",
"parentPublication": {
"id": "proceedings/biotechno/2008/3191/0",
"title": "International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdcat/2016/5081/0/07943383",
"title": "An Efficient Weighted Biclustering Algorithm for Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/pdcat/2016/07943383/12OmNzuZUAN",
"parentPublication": {
"id": "proceedings/pdcat/2016/5081/0",
"title": "2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2012/02/ttb2012020560",
"title": "Parallelized Evolutionary Learning for Detection of Biclusters in Gene Expression Data",
"doi": null,
"abstractUrl": "/journal/tb/2012/02/ttb2012020560/13rRUx0xPtP",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017581",
"title": "BiDots: Visual Exploration of Weighted Biclusters",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017581/13rRUxASuAA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2018/8023/0/802300a546",
"title": "A Study of Biclustering Coherence Measures for Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2018/802300a546/17D45XeKgpT",
"parentPublication": {
"id": "proceedings/bracis/2018/8023/0",
"title": "2018 7th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/09036923",
"title": "POPBic: Pathway-Based Order Preserving Biclustering Algorithm Towards the Analysis of Gene Expression Data",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/09036923/1igMLivS7cY",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx7ouMq",
"title": "2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)",
"acronym": "aina",
"groupId": "1000008",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwGIcvk",
"doi": "10.1109/AINA.2018.00146",
"title": "NBF: An FCA-Based Algorithm to Identify Negative Correlation Biclusters of DNA Microarray Data",
"normalizedTitle": "NBF: An FCA-Based Algorithm to Identify Negative Correlation Biclusters of DNA Microarray Data",
"abstract": "Biclustering is a popular technique to study gene expression data, especially to identify functionally related groups of genes under subsets of conditions. Nevertheless, most of the existing biclustering algorithms only focus on the positive correlations of genes. However, recent research shows that groups of biologically significant genes may exhibit negative correlations. Thus, we need a novel way to efficiently unveil such a type of correlations. We introduce, in this paper, a new algorithm, called the Negative Bicluster Finder (NBF). The sighting features of the NBF stands in its ability to discover the biclusters of negative correlations using the theoretical results provided by the Formal Concept Analysis. Exhaust experiments are carried out on three real-life datasets to assess the performance of the NBF. Our results prove the NBF's ability to statistically and biologically identify significant biclusters.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Biclustering is a popular technique to study gene expression data, especially to identify functionally related groups of genes under subsets of conditions. Nevertheless, most of the existing biclustering algorithms only focus on the positive correlations of genes. However, recent research shows that groups of biologically significant genes may exhibit negative correlations. Thus, we need a novel way to efficiently unveil such a type of correlations. We introduce, in this paper, a new algorithm, called the Negative Bicluster Finder (NBF). The sighting features of the NBF stands in its ability to discover the biclusters of negative correlations using the theoretical results provided by the Formal Concept Analysis. Exhaust experiments are carried out on three real-life datasets to assess the performance of the NBF. Our results prove the NBF's ability to statistically and biologically identify significant biclusters.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Biclustering is a popular technique to study gene expression data, especially to identify functionally related groups of genes under subsets of conditions. Nevertheless, most of the existing biclustering algorithms only focus on the positive correlations of genes. However, recent research shows that groups of biologically significant genes may exhibit negative correlations. Thus, we need a novel way to efficiently unveil such a type of correlations. We introduce, in this paper, a new algorithm, called the Negative Bicluster Finder (NBF). The sighting features of the NBF stands in its ability to discover the biclusters of negative correlations using the theoretical results provided by the Formal Concept Analysis. Exhaust experiments are carried out on three real-life datasets to assess the performance of the NBF. Our results prove the NBF's ability to statistically and biologically identify significant biclusters.",
"fno": "219501b003",
"keywords": [
"Bioinformatics",
"Formal Concept Analysis",
"Genetics",
"Lab On A Chip",
"Pattern Clustering",
"FCA Based Algorithm",
"Negative Correlation Biclusters",
"DNA Microarray Data",
"Gene Expression Data",
"Biologically Significant Genes",
"Biclustering Algorithms",
"NBF",
"Negative Bicluster Finder",
"Formal Concept Analysis",
"Correlation",
"Gene Expression",
"Data Mining",
"DNA",
"Stability Analysis",
"Electronic Mail",
"Biclustering",
"Data Mining",
"DNA Microarray",
"Formal Concept Analysis Negative Correlations"
],
"authors": [
{
"affiliation": null,
"fullName": "Amina Houari",
"givenName": "Amina",
"surname": "Houari",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Wassim Ayadi",
"givenName": "Wassim",
"surname": "Ayadi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Sadok Ben Yahia",
"givenName": "Sadok",
"surname": "Ben Yahia",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "aina",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-05-01T00:00:00",
"pubType": "proceedings",
"pages": "1003-1010",
"year": "2018",
"issn": "2332-5658",
"isbn": "978-1-5386-2195-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "219501a996",
"articleId": "12OmNzDvSlQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "219501b011",
"articleId": "12OmNBqv2iH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2013/5108/0/5108a747",
"title": "Discovering Non-redundant Overlapping Biclusters on Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2013/5108a747/12OmNB9t6mz",
"parentPublication": {
"id": "proceedings/icdm/2013/5108/0",
"title": "2013 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2009/3545/0/3545b219",
"title": "Exploiting Domain Knowledge to Improve Biological Significance of Biclusters with Key Missing Genes",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2009/3545b219/12OmNBhZ4r9",
"parentPublication": {
"id": "proceedings/icde/2009/3545/0",
"title": "2009 IEEE 25th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2011/0982/0/06059852",
"title": "Improving the Biological Relevance of Biclustering for Microarray Data in Using Ensemble Methods",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2011/06059852/12OmNCvumRb",
"parentPublication": {
"id": "proceedings/dexa/2011/0982/0",
"title": "2011 22nd International Workshop on Database and Expert Systems Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2004/2173/0/21730283",
"title": "Mining Deterministic Biclusters in Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2004/21730283/12OmNvD8Rta",
"parentPublication": {
"id": "proceedings/bibe/2004/2173/0",
"title": "Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'04)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2015/8493/0/8493a132",
"title": "An Enumerative Biclustering Algorithm for DNA Microarray Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2015/8493a132/12OmNwwuE2j",
"parentPublication": {
"id": "proceedings/icdmw/2015/8493/0",
"title": "2015 IEEE International Conference on Data Mining Workshop (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/biotechno/2008/3191/0/3191a131",
"title": "RN-Cluster: Discovering Coherent Biclusters Which is Robust to Noise",
"doi": null,
"abstractUrl": "/proceedings-article/biotechno/2008/3191a131/12OmNy7yEfy",
"parentPublication": {
"id": "proceedings/biotechno/2008/3191/0",
"title": "International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2012/4676/0/4676a625",
"title": "Parallel Hybrid Metaheuristic for Multi-objective Biclustering in Microarray Data",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2012/4676a625/12OmNzCWG0t",
"parentPublication": {
"id": "proceedings/ipdpsw/2012/4676/0",
"title": "2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2009/4830/0/05255086",
"title": "Multi-objective ant colony optimization biclustering of microarray data",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2009/05255086/12OmNzmLxFZ",
"parentPublication": {
"id": "proceedings/grc/2009/4830/0",
"title": "2009 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2012/02/ttb2012020560",
"title": "Parallelized Evolutionary Learning for Detection of Biclusters in Gene Expression Data",
"doi": null,
"abstractUrl": "/journal/tb/2012/02/ttb2012020560/13rRUx0xPtP",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017581",
"title": "BiDots: Visual Exploration of Weighted Biclusters",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017581/13rRUxASuAA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNCcKQAe",
"title": "2016 IEEE 15th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)",
"acronym": "iccicc",
"groupId": "1000097",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxWLTwv",
"doi": "10.1109/ICCI-CC.2016.7862071",
"title": "Ensemble cuckoo search biclustering of the gene expression data",
"normalizedTitle": "Ensemble cuckoo search biclustering of the gene expression data",
"abstract": "Many biclustering algorithms have been proposed in analyzing the gene expression data and ensemble biclustering methods can improve performance of the biclustering algorithm. We propose a new method of obtaining a variety of constituent biclusters which use different quality measures of bicluster. To demonstrate the efficiency of our methods, experiment on six real gene expression data shows the diversity and biological significance of the biclusters obtained by our methods are higher than that of the compared methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Many biclustering algorithms have been proposed in analyzing the gene expression data and ensemble biclustering methods can improve performance of the biclustering algorithm. We propose a new method of obtaining a variety of constituent biclusters which use different quality measures of bicluster. To demonstrate the efficiency of our methods, experiment on six real gene expression data shows the diversity and biological significance of the biclusters obtained by our methods are higher than that of the compared methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Many biclustering algorithms have been proposed in analyzing the gene expression data and ensemble biclustering methods can improve performance of the biclustering algorithm. We propose a new method of obtaining a variety of constituent biclusters which use different quality measures of bicluster. To demonstrate the efficiency of our methods, experiment on six real gene expression data shows the diversity and biological significance of the biclusters obtained by our methods are higher than that of the compared methods.",
"fno": "07862071",
"keywords": [
"Gene Expression",
"Algorithm Design And Analysis",
"Cost Function",
"Computational Modeling",
"Computer Science",
"Computers",
"Gene Expression Data",
"Biclustering",
"Ensemble",
"Cuckoo Search"
],
"authors": [
{
"affiliation": "School of Computer Science and Engineering and school of computer and software, University of Electronic Science and Technology of China and Huaiyin Institute of Technology, Chengdu, Sichuan, 611731, P. R. China",
"fullName": "Lu Yin",
"givenName": "Lu",
"surname": "Yin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Computer Science and Engineering, School of Information and Software Engineering and Provincial Key Laboratory for Computer Information Processing Technology, University of Electronic Science and Technology of China and Soochow University, No.4, Section 2, North JianShe Road, ChengDu, SiChuan, 610054 P. R. China and Suzhou, Jiangsu, 215006, P. R. China",
"fullName": "Yongguo Liu",
"givenName": "Yongguo",
"surname": "Liu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccicc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-08-01T00:00:00",
"pubType": "proceedings",
"pages": "419-422",
"year": "2016",
"issn": null,
"isbn": "978-1-5090-3846-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07862070",
"articleId": "12OmNzEVS1l",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07862072",
"articleId": "12OmNzuZUAv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2010/8306/0/05706583",
"title": "An ensemble method for querying gene expression compendia with experimental lists",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2010/05706583/12OmNqBtiVh",
"parentPublication": {
"id": "proceedings/bibm/2010/8306/0",
"title": "2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2017/2407/0/2407a318",
"title": "A Comparison of Hierarchical Biclustering Ensemble Methods",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2017/2407a318/12OmNsd6voo",
"parentPublication": {
"id": "proceedings/bracis/2017/2407/0",
"title": "2017 Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2012/2621/0/06327427",
"title": "Evolutionary Biclustering Algorithm of Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2012/06327427/12OmNvjgWY0",
"parentPublication": {
"id": "proceedings/dexa/2012/2621/0",
"title": "2012 23rd International Workshop on Database and Expert Systems Applications (DEXA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/socpar/2009/3879/0/3879a001",
"title": "BiSim: A Simple and Efficient Biclustering Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/socpar/2009/3879a001/12OmNx7ov2q",
"parentPublication": {
"id": "proceedings/socpar/2009/3879/0",
"title": "Soft Computing and Pattern Recognition, International Conference of",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2012/4925/0/4925a131",
"title": "Biclustering of High-throughput Gene Expression Data with Bicluster Miner",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2012/4925a131/12OmNynJMT9",
"parentPublication": {
"id": "proceedings/icdmw/2012/4925/0",
"title": "2012 IEEE 12th International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdcat/2016/5081/0/07943383",
"title": "An Efficient Weighted Biclustering Algorithm for Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/pdcat/2016/07943383/12OmNzuZUAN",
"parentPublication": {
"id": "proceedings/pdcat/2016/5081/0",
"title": "2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2006/05/k0590",
"title": "Biclustering of Expression Data with Evolutionary Computation",
"doi": null,
"abstractUrl": "/journal/tk/2006/05/k0590/13rRUIIVlkD",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2018/8023/0/802300a546",
"title": "A Study of Biclustering Coherence Measures for Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2018/802300a546/17D45XeKgpT",
"parentPublication": {
"id": "proceedings/bracis/2018/8023/0",
"title": "2018 7th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/09036923",
"title": "POPBic: Pathway-Based Order Preserving Biclustering Algorithm Towards the Analysis of Gene Expression Data",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/09036923/1igMLivS7cY",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/02/09187559",
"title": "Row and Column Structure-Based Biclustering for Gene Expression Data",
"doi": null,
"abstractUrl": "/journal/tb/2022/02/09187559/1mVFjzRRRaU",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNB8Cj8b",
"title": "International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies",
"acronym": "biotechno",
"groupId": "1001800",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNy7yEfy",
"doi": "10.1109/BIOTECHNO.2008.8",
"title": "RN-Cluster: Discovering Coherent Biclusters Which is Robust to Noise",
"normalizedTitle": "RN-Cluster: Discovering Coherent Biclusters Which is Robust to Noise",
"abstract": "A bicluster is a subset of genes that show similar behavior within a subset of conditions. Biclustering algorithm is a useful tool to uncover groups of genes involved in the same cellular process and groups of conditions which take place in this process. We are proposing a polynomial time algorithm to identify functionally highly correlated biclusters. Our algorithm identifies 1) the gene set that follows additive, multiplicative, and combined patterns simultaneously that allow high level of noise, 2) the multiple, possibly overlapped, and diverse gene sets, 3) biclusters with negatively correlated as well as positively correlated gene set simultaneously, and 4) gene sets whose functional association is strongly high. We validated the level of functional association of our method, and compared with current methods using GO.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A bicluster is a subset of genes that show similar behavior within a subset of conditions. Biclustering algorithm is a useful tool to uncover groups of genes involved in the same cellular process and groups of conditions which take place in this process. We are proposing a polynomial time algorithm to identify functionally highly correlated biclusters. Our algorithm identifies 1) the gene set that follows additive, multiplicative, and combined patterns simultaneously that allow high level of noise, 2) the multiple, possibly overlapped, and diverse gene sets, 3) biclusters with negatively correlated as well as positively correlated gene set simultaneously, and 4) gene sets whose functional association is strongly high. We validated the level of functional association of our method, and compared with current methods using GO.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A bicluster is a subset of genes that show similar behavior within a subset of conditions. Biclustering algorithm is a useful tool to uncover groups of genes involved in the same cellular process and groups of conditions which take place in this process. We are proposing a polynomial time algorithm to identify functionally highly correlated biclusters. Our algorithm identifies 1) the gene set that follows additive, multiplicative, and combined patterns simultaneously that allow high level of noise, 2) the multiple, possibly overlapped, and diverse gene sets, 3) biclusters with negatively correlated as well as positively correlated gene set simultaneously, and 4) gene sets whose functional association is strongly high. We validated the level of functional association of our method, and compared with current methods using GO.",
"fno": "3191a131",
"keywords": [
"Knowledge Discovery",
"Data Mining",
"Biclustering",
"Co Clustering",
"Gene Expression Data Analysis",
"Microarray Analysis",
"Noise"
],
"authors": [
{
"affiliation": null,
"fullName": "Jaegyoon Ahn",
"givenName": "Jaegyoon",
"surname": "Ahn",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Youngmi Yoon",
"givenName": "Youngmi",
"surname": "Yoon",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Sanghyun Park",
"givenName": "Sanghyun",
"surname": "Park",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "biotechno",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-06-01T00:00:00",
"pubType": "proceedings",
"pages": "131-136",
"year": "2008",
"issn": null,
"isbn": "978-0-7695-3191-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3191a125",
"articleId": "12OmNwswg7k",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3191a137",
"articleId": "12OmNxWcHm2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2013/5108/0/5108a747",
"title": "Discovering Non-redundant Overlapping Biclusters on Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2013/5108a747/12OmNB9t6mz",
"parentPublication": {
"id": "proceedings/icdm/2013/5108/0",
"title": "2013 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2009/3545/0/3545b219",
"title": "Exploiting Domain Knowledge to Improve Biological Significance of Biclusters with Key Missing Genes",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2009/3545b219/12OmNBhZ4r9",
"parentPublication": {
"id": "proceedings/icde/2009/3545/0",
"title": "2009 IEEE 25th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csb/2004/2194/0/21940182",
"title": "Biclustering in Gene Expression Data by Tendency",
"doi": null,
"abstractUrl": "/proceedings-article/csb/2004/21940182/12OmNCfAPGO",
"parentPublication": {
"id": "proceedings/csb/2004/2194/0",
"title": "Proceedings. 2004 IEEE Computational Systems Bioinformatics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2011/4409/0/4409b075",
"title": "FTCluster: Efficient Mining Fault-Tolerant Biclusters in Microarray Dataset",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2011/4409b075/12OmNqIhFM5",
"parentPublication": {
"id": "proceedings/icdmw/2011/4409/0",
"title": "2011 IEEE 11th International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109c728",
"title": "Biclustering of Expression Microarray Data with Topic Models",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109c728/12OmNvEhg42",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icime/2009/3595/0/3595a629",
"title": "CPB: A Model for Biclustering",
"doi": null,
"abstractUrl": "/proceedings-article/icime/2009/3595a629/12OmNwtWfQ5",
"parentPublication": {
"id": "proceedings/icime/2009/3595/0",
"title": "Information Management and Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/socpar/2009/3879/0/3879a001",
"title": "BiSim: A Simple and Efficient Biclustering Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/socpar/2009/3879a001/12OmNx7ov2q",
"parentPublication": {
"id": "proceedings/socpar/2009/3879/0",
"title": "Soft Computing and Pattern Recognition, International Conference of",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcse/2009/3570/2/3570b041",
"title": "An Efficiency and Fast Algorithm Based on Gene Expressing Data Biclustering",
"doi": null,
"abstractUrl": "/proceedings-article/wcse/2009/3570b041/12OmNzsJ7BJ",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2006/05/k0590",
"title": "Biclustering of Expression Data with Evolutionary Computation",
"doi": null,
"abstractUrl": "/journal/tk/2006/05/k0590/13rRUIIVlkD",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2011/04/ttk2011040568",
"title": "Finding Correlated Biclusters from Gene Expression Data",
"doi": null,
"abstractUrl": "/journal/tk/2011/04/ttk2011040568/13rRUILLkvM",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "17D45VtKirs",
"title": "2018 7th Brazilian Conference on Intelligent Systems (BRACIS)",
"acronym": "bracis",
"groupId": "1803430",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "17D45XeKgpT",
"doi": "10.1109/BRACIS.2018.00100",
"title": "A Study of Biclustering Coherence Measures for Gene Expression Data",
"normalizedTitle": "A Study of Biclustering Coherence Measures for Gene Expression Data",
"abstract": "Biclustering algorithms have become one of the main tools for the analysis of gene expression data. They allow the identification of local patterns defined by subsets of genes and subsets of samples, which cannot be detected by traditional clustering algorithms. However, although useful, biclustering is a NP-hard problem. Therefore, the majority of biclustering algorithms look for biclusters optimizing a pre-established coherence measure. In the last 20 years, several heuristics and measures have been published for biclustering. However, most of these publications do not provide an extensive comparison of bicluster coherence measures on practical scenarios. To deal with this problem, this paper analyze the behavior of 15 bicluster coherence measures and external evaluation regarding 9 algorithms from the literature on gene expression datasets. According to the experimental results, there is no clear relation between these measures and assessment using information from gene ontology.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Biclustering algorithms have become one of the main tools for the analysis of gene expression data. They allow the identification of local patterns defined by subsets of genes and subsets of samples, which cannot be detected by traditional clustering algorithms. However, although useful, biclustering is a NP-hard problem. Therefore, the majority of biclustering algorithms look for biclusters optimizing a pre-established coherence measure. In the last 20 years, several heuristics and measures have been published for biclustering. However, most of these publications do not provide an extensive comparison of bicluster coherence measures on practical scenarios. To deal with this problem, this paper analyze the behavior of 15 bicluster coherence measures and external evaluation regarding 9 algorithms from the literature on gene expression datasets. According to the experimental results, there is no clear relation between these measures and assessment using information from gene ontology.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Biclustering algorithms have become one of the main tools for the analysis of gene expression data. They allow the identification of local patterns defined by subsets of genes and subsets of samples, which cannot be detected by traditional clustering algorithms. However, although useful, biclustering is a NP-hard problem. Therefore, the majority of biclustering algorithms look for biclusters optimizing a pre-established coherence measure. In the last 20 years, several heuristics and measures have been published for biclustering. However, most of these publications do not provide an extensive comparison of bicluster coherence measures on practical scenarios. To deal with this problem, this paper analyze the behavior of 15 bicluster coherence measures and external evaluation regarding 9 algorithms from the literature on gene expression datasets. According to the experimental results, there is no clear relation between these measures and assessment using information from gene ontology.",
"fno": "802300a546",
"keywords": [
"Bioinformatics",
"Biology Computing",
"Computational Complexity",
"Genetics",
"Ontologies Artificial Intelligence",
"Pattern Clustering",
"Biclustering Coherence Measures",
"Gene Expression Data",
"Biclustering Algorithms",
"Traditional Clustering Algorithms",
"Pre Established Coherence Measure",
"Gene Expression Datasets",
"Assessment Using Information",
"Bicluster Coherence Measures",
"Coherence",
"Correlation",
"Gene Expression",
"Clustering Algorithms",
"Ontologies",
"Software Algorithms",
"Biclustering",
"Bicluster Measure",
"Coherence Measure",
"Gene Expression Data"
],
"authors": [
{
"affiliation": "Inst. of Math. & Comput. Sci., Univ. of Sao Paulo, Sao Carlos, Brazil",
"fullName": "Victor A. Padilha",
"givenName": "Victor A.",
"surname": "Padilha",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Inst. of Math. & Comput. Sci., Univ. of Sao Paulo, Sao Carlos, Brazil",
"fullName": "Andre C.P.L.F. de Carvalho",
"givenName": "Andre C.P.L.F.",
"surname": "de Carvalho",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "bracis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-10-01T00:00:00",
"pubType": "proceedings",
"pages": "546-551",
"year": "2018",
"issn": null,
"isbn": "978-1-5386-8023-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "802300a540",
"articleId": "17D45Wuc356",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "802300a552",
"articleId": "17D45VObpRl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/dexa/2015/7581/0/07406268",
"title": "A Hybrid Possibilistic Algorithm for Biclustering: Application to Microarray Data Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2015/07406268/12OmNB8kHX7",
"parentPublication": {
"id": "proceedings/dexa/2015/7581/0",
"title": "2015 26th International Workshop on Database and Expert Systems Applications (DEXA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2013/5108/0/5108a747",
"title": "Discovering Non-redundant Overlapping Biclusters on Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2013/5108a747/12OmNB9t6mz",
"parentPublication": {
"id": "proceedings/icdm/2013/5108/0",
"title": "2013 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csb/2004/2194/0/21940436",
"title": "Gene Ontology Friendly Biclustering of Expression Profiles",
"doi": null,
"abstractUrl": "/proceedings-article/csb/2004/21940436/12OmNrJiCSA",
"parentPublication": {
"id": "proceedings/csb/2004/2194/0",
"title": "Proceedings. 2004 IEEE Computational Systems Bioinformatics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2012/4905/0/4905b056",
"title": "Exclusive Row Biclustering for Gene Expression Using a Combinatorial Auction Approach",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2012/4905b056/12OmNx8fib4",
"parentPublication": {
"id": "proceedings/icdm/2012/4905/0",
"title": "2012 IEEE 12th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccicc/2016/3846/0/07862071",
"title": "Ensemble cuckoo search biclustering of the gene expression data",
"doi": null,
"abstractUrl": "/proceedings-article/iccicc/2016/07862071/12OmNxWLTwv",
"parentPublication": {
"id": "proceedings/iccicc/2016/3846/0",
"title": "2016 IEEE 15th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcasia/2005/2486/0/24860627",
"title": "Biclustering of Gene Expression Data by Simulated Annealing",
"doi": null,
"abstractUrl": "/proceedings-article/hpcasia/2005/24860627/12OmNxecRUi",
"parentPublication": {
"id": "proceedings/hpcasia/2005/2486/0",
"title": "Proceedings. Eighth International Conference on High-Performance Computing in Asia-Pacific Region",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2012/4925/0/4925a131",
"title": "Biclustering of High-throughput Gene Expression Data with Bicluster Miner",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2012/4925a131/12OmNynJMT9",
"parentPublication": {
"id": "proceedings/icdmw/2012/4925/0",
"title": "2012 IEEE 12th International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdcat/2016/5081/0/07943383",
"title": "An Efficient Weighted Biclustering Algorithm for Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/pdcat/2016/07943383/12OmNzuZUAN",
"parentPublication": {
"id": "proceedings/pdcat/2016/5081/0",
"title": "2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/09036923",
"title": "POPBic: Pathway-Based Order Preserving Biclustering Algorithm Towards the Analysis of Gene Expression Data",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/09036923/1igMLivS7cY",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/02/09187559",
"title": "Row and Column Structure-Based Biclustering for Gene Expression Data",
"doi": null,
"abstractUrl": "/journal/tb/2022/02/09187559/1mVFjzRRRaU",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzuZUzm",
"title": "2016 Nicograph International (NicoInt)",
"acronym": "nicoint",
"groupId": "1814784",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAY79m0",
"doi": "10.1109/NicoInt.2016.27",
"title": "Parent-Child Product Design Based on Dynamic Programming about Family Child Left Behind",
"normalizedTitle": "Parent-Child Product Design Based on Dynamic Programming about Family Child Left Behind",
"abstract": "To investigate staying home parent-child product interaction methods which across the space. DTW speech recognition algorithm collects speech characteristics of children left behind which match database information. Then, the method issue the appropriate action to soothe children's products. From the speech recognition perspective, the article proposed the point of parent-child product program design based on dynamic programming about family child left behind.",
"abstracts": [
{
"abstractType": "Regular",
"content": "To investigate staying home parent-child product interaction methods which across the space. DTW speech recognition algorithm collects speech characteristics of children left behind which match database information. Then, the method issue the appropriate action to soothe children's products. From the speech recognition perspective, the article proposed the point of parent-child product program design based on dynamic programming about family child left behind.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "To investigate staying home parent-child product interaction methods which across the space. DTW speech recognition algorithm collects speech characteristics of children left behind which match database information. Then, the method issue the appropriate action to soothe children's products. From the speech recognition perspective, the article proposed the point of parent-child product program design based on dynamic programming about family child left behind.",
"fno": "2305a134",
"keywords": [
"Speech Recognition",
"Speech",
"Databases",
"Product Design",
"Dynamic Programming",
"Sociology",
"Statistics"
],
"authors": [
{
"affiliation": null,
"fullName": "Qian Sun",
"givenName": "Qian",
"surname": "Sun",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Run Fang",
"givenName": "Run",
"surname": "Fang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Si Liu",
"givenName": "Si",
"surname": "Liu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "nicoint",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-07-01T00:00:00",
"pubType": "proceedings",
"pages": "134-134",
"year": "2016",
"issn": null,
"isbn": "978-1-5090-2305-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "2305a132",
"articleId": "12OmNBV9I9W",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "2305a135",
"articleId": "12OmNAnuTkv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/big-data/2016/9005/0/07840750",
"title": "Deep parallelization of parallel FP-growth using parent-child MapReduce",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2016/07840750/12OmNvxsSRS",
"parentPublication": {
"id": "proceedings/big-data/2016/9005/0",
"title": "2016 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2013/5009/0/5009a043",
"title": "A Study of Parent-Child Play in a Multiplayer Competitive Educational Game",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2013/5009a043/12OmNy4r3Rw",
"parentPublication": {
"id": "proceedings/icalt/2013/5009/0",
"title": "2013 IEEE 13th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2018/5488/0/08621488",
"title": "Detecting Novel Structural Variants In Genomes By Leveraging Parent-Child Relatedness",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2018/08621488/17D45WrVg3I",
"parentPublication": {
"id": "proceedings/bibm/2018/5488/0",
"title": "2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2021/3176/0/09666983",
"title": "Body Gesture and Head Movement Analyses in Dyadic Parent-Child Interaction as Indicators of Relationship",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2021/09666983/1A6Bpr603hm",
"parentPublication": {
"id": "proceedings/fg/2021/3176/0",
"title": "2021 16th IEEE International Conference on Automatic Face and Gesture Recognition (FG 2021)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlbdbi/2021/1790/0/179000a771",
"title": "Parent-Child Separation Alarm Based on NRF24L01 and 51 Microcontroller",
"doi": null,
"abstractUrl": "/proceedings-article/mlbdbi/2021/179000a771/1BQiDpjBRTO",
"parentPublication": {
"id": "proceedings/mlbdbi/2021/1790/0",
"title": "2021 3rd International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/5555/01/09784429",
"title": "Dyadic Affect in Parent-child Multi-modal Interaction: Introducing the DAMI-P2C Dataset and its Preliminary Analysis",
"doi": null,
"abstractUrl": "/journal/ta/5555/01/09784429/1DQLzlxCW6A",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmss/2022/9685/0/968500a127",
"title": "Study on the Correlation between Growth Environment and Mental Health of Left behind Children",
"doi": null,
"abstractUrl": "/proceedings-article/icmss/2022/968500a127/1F8z4odi78Q",
"parentPublication": {
"id": "proceedings/icmss/2022/9685/0",
"title": "2022 International Conference on Management Engineering, Software Engineering and Service Sciences (ICMSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icekim/2022/1666/0/166600a476",
"title": "Research on the Structural Relationship Between Parent-Child Relationship and the Usage of Smartphone, Academic Procrastination and Self-Esteem Based on Structural Equation Model Under the Background of Big Data",
"doi": null,
"abstractUrl": "/proceedings-article/icekim/2022/166600a476/1KpBzZ6zaVy",
"parentPublication": {
"id": "proceedings/icekim/2022/1666/0",
"title": "2022 3rd International Conference on Education, Knowledge and Information Management (ICEKIM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmeim/2020/9623/0/962300a446",
"title": "A Longitudinal Content Analysis on the Media Images of Left-behind Children in China",
"doi": null,
"abstractUrl": "/proceedings-article/icmeim/2020/962300a446/1syvpSgTMkw",
"parentPublication": {
"id": "proceedings/icmeim/2020/9623/0",
"title": "2020 International Conference on Modern Education and Information Management (ICMEIM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icekim/2021/6834/0/683400a947",
"title": "Research on the Effect of Sports Participation in Promoting the Sense of Belonging of Rural Left-behind Children from the Perspective of Health Dividend Based on SPSS Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icekim/2021/683400a947/1vmLEHlnvMI",
"parentPublication": {
"id": "proceedings/icekim/2021/6834/0",
"title": "2021 2nd International Conference on Education, Knowledge and Information Management (ICEKIM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyjLoSc",
"title": "2015 IEEE Frontiers in Education Conference (FIE)",
"acronym": "fie",
"groupId": "1000297",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAkWve1",
"doi": "10.1109/FIE.2015.7344359",
"title": "First in the family: A comparison of first-generation and non-first-generation engineering college students",
"normalizedTitle": "First in the family: A comparison of first-generation and non-first-generation engineering college students",
"abstract": "This study investigates first-generation and non-first-generation engineering undergraduates' math/science identities, subject-related interests, and career plans. First-generation students are an understudied, but growing population. Understanding how these self-beliefs and background factors affect students' engineering choice can help widen pathways into engineering which continues to be defined as “pale and male.” Additionally, identity has predictive value for practical outcomes like engineering choice in college. The data for this study comes from the nationally representative Sustainability and Gender in Engineering (SaGE) survey completed by 6,772 college students who enrolled in first-year English courses at 2- and 4-year colleges across the U.S. Data were analyzed using t-test and chi-square tests for linear and dichotomous outcomes respectively. Our results show differences in first-generation students' identities, interests, performance/ competence beliefs, and family support for science. These differences can serve as a stepping stone towards understanding the trajectories of first-generation college students in engineering. By understanding underrepresented students' identities, performance, and backgrounds, specific strategies can be developed to support these students in our engineering programs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This study investigates first-generation and non-first-generation engineering undergraduates' math/science identities, subject-related interests, and career plans. First-generation students are an understudied, but growing population. Understanding how these self-beliefs and background factors affect students' engineering choice can help widen pathways into engineering which continues to be defined as “pale and male.” Additionally, identity has predictive value for practical outcomes like engineering choice in college. The data for this study comes from the nationally representative Sustainability and Gender in Engineering (SaGE) survey completed by 6,772 college students who enrolled in first-year English courses at 2- and 4-year colleges across the U.S. Data were analyzed using t-test and chi-square tests for linear and dichotomous outcomes respectively. Our results show differences in first-generation students' identities, interests, performance/ competence beliefs, and family support for science. These differences can serve as a stepping stone towards understanding the trajectories of first-generation college students in engineering. By understanding underrepresented students' identities, performance, and backgrounds, specific strategies can be developed to support these students in our engineering programs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This study investigates first-generation and non-first-generation engineering undergraduates' math/science identities, subject-related interests, and career plans. First-generation students are an understudied, but growing population. Understanding how these self-beliefs and background factors affect students' engineering choice can help widen pathways into engineering which continues to be defined as “pale and male.” Additionally, identity has predictive value for practical outcomes like engineering choice in college. The data for this study comes from the nationally representative Sustainability and Gender in Engineering (SaGE) survey completed by 6,772 college students who enrolled in first-year English courses at 2- and 4-year colleges across the U.S. Data were analyzed using t-test and chi-square tests for linear and dichotomous outcomes respectively. Our results show differences in first-generation students' identities, interests, performance/ competence beliefs, and family support for science. These differences can serve as a stepping stone towards understanding the trajectories of first-generation college students in engineering. By understanding underrepresented students' identities, performance, and backgrounds, specific strategies can be developed to support these students in our engineering programs.",
"fno": "07344359",
"keywords": [
"Engineering Profession",
"Education",
"Sociology",
"Statistics",
"Cultural Differences",
"Face",
"Family Support",
"First Generation College Student",
"Identity",
"Career Plans"
],
"authors": [
{
"affiliation": "School of Engineering Education, Purdue University West Lafayette, Indiana 47907",
"fullName": "Dina Verdin",
"givenName": "Dina",
"surname": "Verdin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Engineering Education, Purdue University West Lafayette, Indiana 47907",
"fullName": "Allison Godwin",
"givenName": "Allison",
"surname": "Godwin",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "fie",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-10-01T00:00:00",
"pubType": "proceedings",
"pages": "1-8",
"year": "2015",
"issn": null,
"isbn": "978-1-4799-8454-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07344358",
"articleId": "12OmNqHItzW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07344360",
"articleId": "12OmNwbLVti",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/fie/2013/5261/0/06685118",
"title": "First-generation engineering transfer students: A qualitative study of social and cultural capital",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2013/06685118/12OmNAqU4VE",
"parentPublication": {
"id": "proceedings/fie/2013/5261/0",
"title": "2013 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2015/8454/0/07344119",
"title": "Engineering self-efficacy, interactions with faculty, and other forms of capital for underrepresented engineering students",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2015/07344119/12OmNBcAGKG",
"parentPublication": {
"id": "proceedings/fie/2015/8454/0",
"title": "2015 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2017/5920/0/08190644",
"title": "Social and latent identities that contribute to diverse students' belongingness in engineering",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2017/08190644/12OmNvH7fjZ",
"parentPublication": {
"id": "proceedings/fie/2017/5920/0",
"title": "2017 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2014/3922/0/07044268",
"title": "First generation college students' access to engineering social capital: Towards developing a richer understanding of important alters",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2014/07044268/12OmNzIl3EK",
"parentPublication": {
"id": "proceedings/fie/2014/3922/0",
"title": "2014 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2017/5920/0/08190616",
"title": "Testing for measurement invariance in engineering identity constructs for first-generation college students",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2017/08190616/12OmNzl3WXh",
"parentPublication": {
"id": "proceedings/fie/2017/5920/0",
"title": "2017 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2018/1174/0/08658878",
"title": "Understanding how First-Generation College Students’ Out-of-School Experiences, Physics and STEM Identities Relate to Engineering Possible Selves and Certainty of Career Path",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2018/08658878/18j9oRFCmic",
"parentPublication": {
"id": "proceedings/fie/2018/1174/0",
"title": "2018 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmeim/2020/9623/0/962300a645",
"title": "A Study on Impact of College Students' Mobile Phone Addictions on Their Self-identities",
"doi": null,
"abstractUrl": "/proceedings-article/icmeim/2020/962300a645/1syvo7qiAQE",
"parentPublication": {
"id": "proceedings/icmeim/2020/9623/0",
"title": "2020 International Conference on Modern Education and Information Management (ICMEIM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2021/3851/0/09637157",
"title": "Confidence in Pursuing Engineering: How First-Generation College Students' Subject-Related Role Identities Supports their Major Choice",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2021/09637157/1zuvOEFYh0c",
"parentPublication": {
"id": "proceedings/fie/2021/3851/0",
"title": "2021 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2021/3851/0/09637191",
"title": "Understanding How Family Influences and Support Students' Certainty of Engineering Major",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2021/09637191/1zuw3Aor1te",
"parentPublication": {
"id": "proceedings/fie/2021/3851/0",
"title": "2021 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2021/3851/0/09637472",
"title": "Navigating and reconciling identity interference and values conflicts associated with our engineering identities: A conceptual framework",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2021/09637472/1zuwpClTIC4",
"parentPublication": {
"id": "proceedings/fie/2021/3851/0",
"title": "2021 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1cJ6WsGCn96",
"title": "2018 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"acronym": "vast",
"groupId": "1001630",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "1cJ6Xt2YBRS",
"doi": "10.1109/VAST.2018.8802465",
"title": "VAST Challenge 2018: Suspense at the Wildlife Preserve",
"normalizedTitle": "VAST Challenge 2018: Suspense at the Wildlife Preserve",
"abstract": "The 2018 VAST Challenge returns to the (fictional) city of Mistford and the Boonsong Lekagul Wildlife Preserve to pose three MiniChallenges surrounding the nefarious Kasios Furniture Company and the fate of the Rose-Crested Blue Pipit. For Mini-Challenge 1, participants performed classification on a collection of bird song recordings to help experts understand the changing population dynamics within the preserve. Mini-Challenge 2 introduced new hydrology evidence in a spatiotemporal challenge, asking participants to trace the transmission of various chemicals through the preserve's waterways. In Mini-Challenge 3, participants took their analysis global, examining suspicious connections in Kasios' international business dealings in a massive graph challenge.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The 2018 VAST Challenge returns to the (fictional) city of Mistford and the Boonsong Lekagul Wildlife Preserve to pose three MiniChallenges surrounding the nefarious Kasios Furniture Company and the fate of the Rose-Crested Blue Pipit. For Mini-Challenge 1, participants performed classification on a collection of bird song recordings to help experts understand the changing population dynamics within the preserve. Mini-Challenge 2 introduced new hydrology evidence in a spatiotemporal challenge, asking participants to trace the transmission of various chemicals through the preserve's waterways. In Mini-Challenge 3, participants took their analysis global, examining suspicious connections in Kasios' international business dealings in a massive graph challenge.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The 2018 VAST Challenge returns to the (fictional) city of Mistford and the Boonsong Lekagul Wildlife Preserve to pose three MiniChallenges surrounding the nefarious Kasios Furniture Company and the fate of the Rose-Crested Blue Pipit. For Mini-Challenge 1, participants performed classification on a collection of bird song recordings to help experts understand the changing population dynamics within the preserve. Mini-Challenge 2 introduced new hydrology evidence in a spatiotemporal challenge, asking participants to trace the transmission of various chemicals through the preserve's waterways. In Mini-Challenge 3, participants took their analysis global, examining suspicious connections in Kasios' international business dealings in a massive graph challenge.",
"fno": "08802465",
"keywords": [
"Acoustic Signal Processing",
"Biology Computing",
"Signal Classification",
"Zoology",
"2018 VAST Challenge",
"Boonsong Lekagul Wildlife Preserve",
"Rose Crested Blue Pipit",
"Bird Song Recordings",
"Spatiotemporal Challenge",
"Kasios Furniture Company",
"Hydrology Evidence",
"Companies",
"Birds",
"Visual Analytics",
"Wildlife",
"Chemicals",
"Sociology",
"Statistics"
],
"authors": [
{
"affiliation": "Smith College",
"fullName": "R. Jordan Crouser",
"givenName": "R. Jordan",
"surname": "Crouser",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Pacific Northwest National Laboratory",
"fullName": "Kristin Cook",
"givenName": "Kristin",
"surname": "Cook",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Massachusetts Amherst",
"fullName": "John Fallon",
"givenName": "John",
"surname": "Fallon",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Pacific Northwest National Laboratory",
"fullName": "Jereme Haack",
"givenName": "Jereme",
"surname": "Haack",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Air Force Research Laboratory",
"fullName": "Kristen Liggett",
"givenName": "Kristen",
"surname": "Liggett",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Pacific Northwest National Laboratory",
"fullName": "Mark Whiting",
"givenName": "Mark",
"surname": "Whiting",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "MIT Lincoln Laboratory",
"fullName": "Diane Staheli",
"givenName": "Diane",
"surname": "Staheli",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vast",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-10-01T00:00:00",
"pubType": "proceedings",
"pages": "84-89",
"year": "2018",
"issn": null,
"isbn": "978-1-5386-6861-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08802415",
"articleId": "1cJ6WDNOqXK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08802505",
"articleId": "1cJ6XdjnhO8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2017/3163/0/08585503",
"title": "VAST Challenge 2017: Mystery at the Wildlife Preserve",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585503/17D45WHONqn",
"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/08585729",
"title": "Interactive Visual Analysis of Traffic Patterns: Ecological Impact within a Nature Preserve (VAST Challenge 2017)",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585729/17D45WYQJa8",
"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/08585552",
"title": "Visual Analysis for Wildlife Preserve based on Muti-systems",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585552/17D45XDIXQa",
"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/08585648",
"title": "Visual Analysis to Explore Mystery at Wildlife Preserve",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585648/17D45XDIXRy",
"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"
},
{
"id": "proceedings/vast/2018/6861/0/08802500",
"title": "Interactive Classification Using Spectrograms and Audio Glyphs",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2018/08802500/1cJ6WHuB7NK",
"parentPublication": {
"id": "proceedings/vast/2018/6861/0",
"title": "2018 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2018/6861/0/08802430",
"title": "Using Tableau to Discover the Effect of Chemical Release at Wildlife Preserve",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2018/08802430/1cJ6WzSPNCw",
"parentPublication": {
"id": "proceedings/vast/2018/6861/0",
"title": "2018 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2018/6861/0/08802505",
"title": "VAST Challenge 2018: Mini-Challenge 1 Award: Applied Visual Data Science",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2018/08802505/1cJ6XdjnhO8",
"parentPublication": {
"id": "proceedings/vast/2018/6861/0",
"title": "2018 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2018/6861/0/08802504",
"title": "Unearthing the X-Streams: Visualizing Water Contamination : VAST Mini-Challenge 2 Honorable Mention: Clarity of Narrative",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2018/08802504/1cJ6XoDlitG",
"parentPublication": {
"id": "proceedings/vast/2018/6861/0",
"title": "2018 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBUAvV8",
"title": "2014 IEEE International Conference on Data Mining Workshop (ICDMW)",
"acronym": "icdmw",
"groupId": "1001620",
"volume": "0",
"displayVolume": "0",
"year": "2014",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNCm7BFu",
"doi": "10.1109/ICDMW.2014.50",
"title": "RQL: A SQL-Like Query Language for Discovering Meaningful Rules",
"normalizedTitle": "RQL: A SQL-Like Query Language for Discovering Meaningful Rules",
"abstract": "The Rule Query Language (RQL) is an SQL-like pattern mining language that extends and generalizes functional dependencies to new and unexpected rules. It brings to the data analysts' desktop a convenient tool to discover logical implications between attributes of the database. Such implications may reveal data quality problems or surprising correlations between attributes over some part of the database. The computation of RQL queries is based on a query rewriting technique that pushes as much processing as possible to the underlying DBMS. This contribution is an attempt to bridge the gap between pattern mining and databases and facilitates the use of data mining techniques by SQL-aware analysts and students.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The Rule Query Language (RQL) is an SQL-like pattern mining language that extends and generalizes functional dependencies to new and unexpected rules. It brings to the data analysts' desktop a convenient tool to discover logical implications between attributes of the database. Such implications may reveal data quality problems or surprising correlations between attributes over some part of the database. The computation of RQL queries is based on a query rewriting technique that pushes as much processing as possible to the underlying DBMS. This contribution is an attempt to bridge the gap between pattern mining and databases and facilitates the use of data mining techniques by SQL-aware analysts and students.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The Rule Query Language (RQL) is an SQL-like pattern mining language that extends and generalizes functional dependencies to new and unexpected rules. It brings to the data analysts' desktop a convenient tool to discover logical implications between attributes of the database. Such implications may reveal data quality problems or surprising correlations between attributes over some part of the database. The computation of RQL queries is based on a query rewriting technique that pushes as much processing as possible to the underlying DBMS. This contribution is an attempt to bridge the gap between pattern mining and databases and facilitates the use of data mining techniques by SQL-aware analysts and students.",
"fno": "4274b203",
"keywords": [
"Data Mining",
"Remuneration",
"Database Languages",
"Education",
"Conferences",
"Query Processing"
],
"authors": [
{
"affiliation": null,
"fullName": "Brice Chardin",
"givenName": "Brice",
"surname": "Chardin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Emmanuel Coquery",
"givenName": "Emmanuel",
"surname": "Coquery",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Marie Pailloux",
"givenName": "Marie",
"surname": "Pailloux",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jean-Marc Petit",
"givenName": "Jean-Marc",
"surname": "Petit",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icdmw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2014-12-01T00:00:00",
"pubType": "proceedings",
"pages": "1203-1206",
"year": "2014",
"issn": null,
"isbn": "978-1-4799-4274-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4274b199",
"articleId": "12OmNySG3Tn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4274b207",
"articleId": "12OmNwqft1R",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccit/2008/3407/2/04682388",
"title": "Cost Evaluation on the SPARQL-to-SQL Translation System Model",
"doi": null,
"abstractUrl": "/proceedings-article/iccit/2008/04682388/12OmNAP1YZz",
"parentPublication": {
"id": "proceedings/iccit/2008/3407/2",
"title": "Convergence Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/1995/6910/0/69100025",
"title": "Set-oriented mining for association rules in relational databases",
"doi": null,
"abstractUrl": "/proceedings-article/icde/1995/69100025/12OmNBhpS8E",
"parentPublication": {
"id": "proceedings/icde/1995/6910/0",
"title": "Proceedings of the Eleventh International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsit/2008/3308/0/3308a553",
"title": "Application of Parallelism SQL in Fuzzy Relational Databases",
"doi": null,
"abstractUrl": "/proceedings-article/iccsit/2008/3308a553/12OmNqIQS4s",
"parentPublication": {
"id": "proceedings/iccsit/2008/3308/0",
"title": "2008 International Conference on Computer Science and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2015/7964/0/07113403",
"title": "The XDa-TA system for automated grading of SQL query assignments",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2015/07113403/12OmNyKJiDs",
"parentPublication": {
"id": "proceedings/icde/2015/7964/0",
"title": "2015 IEEE 31st International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/1986/0655/0/07266225",
"title": "Do semantically equivalent SQL queries perform differently?",
"doi": null,
"abstractUrl": "/proceedings-article/icde/1986/07266225/12OmNykCcfp",
"parentPublication": {
"id": "proceedings/icde/1986/0655/0",
"title": "1986 IEEE Second International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/1994/01/k0086",
"title": "Spatial SQL: A Query and Presentation Language",
"doi": null,
"abstractUrl": "/journal/tk/1994/01/k0086/13rRUwInv4J",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2009/04/mcs2009040012",
"title": "SQL in the Clouds",
"doi": null,
"abstractUrl": "/magazine/cs/2009/04/mcs2009040012/13rRUwj7cnw",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/1993/03/k0451",
"title": "RQL: A Recursive Query Language",
"doi": null,
"abstractUrl": "/journal/tk/1993/03/k0451/13rRUxD9gXX",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1985/04/01702016",
"title": "Translating SQL Into Relational Algebra: Optimization, Semantics, and Equivalence of SQL Queries",
"doi": null,
"abstractUrl": "/journal/ts/1985/04/01702016/13rRUxlgxXZ",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09378136",
"title": "Translation of Array-Based Loops to Spark SQL",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09378136/1s64kA7L8e4",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNrIJqwt",
"title": "2013 IEEE 13th International Conference on Data Mining Workshops (ICDMW)",
"acronym": "icdmw",
"groupId": "1001620",
"volume": "0",
"displayVolume": "0",
"year": "2013",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqBtiSr",
"doi": "10.1109/ICDMW.2013.124",
"title": "Demonstrating Interactive Multi-resolution Large Graph Exploration",
"normalizedTitle": "Demonstrating Interactive Multi-resolution Large Graph Exploration",
"abstract": "We present a scalable, interactive graph visualization system to support multi-resolution exploration of million-node graphs in real time. By adapting a state-of-the-art graph algorithm, called Slash & Burn, our prototype system generates a multi-resolution view of graphs with up to 69 million edges under a few seconds. We are experimenting with interaction techniques that help users interactively explore this overview and drill down into details. While many visualization systems for million-node graphs require dedicated servers to process the graphs, our prototype runs on a commodity laptop computer. We aim to handle graphs that are at least an order of magnitude (100M edges) larger than what current systems can support. We demonstrate our system's usage, benefits, and scalability using two large graphs: a Live Journal friendship network with 69 million edges, and a related-movies network from Rotten Tomatoes with 200K edges.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a scalable, interactive graph visualization system to support multi-resolution exploration of million-node graphs in real time. By adapting a state-of-the-art graph algorithm, called Slash & Burn, our prototype system generates a multi-resolution view of graphs with up to 69 million edges under a few seconds. We are experimenting with interaction techniques that help users interactively explore this overview and drill down into details. While many visualization systems for million-node graphs require dedicated servers to process the graphs, our prototype runs on a commodity laptop computer. We aim to handle graphs that are at least an order of magnitude (100M edges) larger than what current systems can support. We demonstrate our system's usage, benefits, and scalability using two large graphs: a Live Journal friendship network with 69 million edges, and a related-movies network from Rotten Tomatoes with 200K edges.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a scalable, interactive graph visualization system to support multi-resolution exploration of million-node graphs in real time. By adapting a state-of-the-art graph algorithm, called Slash & Burn, our prototype system generates a multi-resolution view of graphs with up to 69 million edges under a few seconds. We are experimenting with interaction techniques that help users interactively explore this overview and drill down into details. While many visualization systems for million-node graphs require dedicated servers to process the graphs, our prototype runs on a commodity laptop computer. We aim to handle graphs that are at least an order of magnitude (100M edges) larger than what current systems can support. We demonstrate our system's usage, benefits, and scalability using two large graphs: a Live Journal friendship network with 69 million edges, and a related-movies network from Rotten Tomatoes with 200K edges.",
"fno": "3143b097",
"keywords": [
"Motion Pictures",
"Visualization",
"Prototypes",
"Data Mining",
"Real Time Systems",
"Conferences",
"Computers",
"Graph Decomposition",
"Interactive Graph Visualization",
"Multi Resolution",
"Hubs And Spokes"
],
"authors": [
{
"affiliation": null,
"fullName": "Zhiyuan Lin",
"givenName": "Zhiyuan",
"surname": "Lin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Nan Cao",
"givenName": "Nan",
"surname": "Cao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Hanghang Tong",
"givenName": "Hanghang",
"surname": "Tong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Fei Wang",
"givenName": "Fei",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "U. Kang",
"givenName": "U.",
"surname": "Kang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Duen Horng Polo Chau",
"givenName": "Duen Horng Polo",
"surname": "Chau",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icdmw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2013-12-01T00:00:00",
"pubType": "proceedings",
"pages": "1097-1100",
"year": "2013",
"issn": null,
"isbn": "978-1-4799-3142-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3143b093",
"articleId": "12OmNzkuKBB",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3143b101",
"articleId": "12OmNs0TKHT",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/big-data/2014/5666/0/07004353",
"title": "Towards scalable graph computation on mobile devices",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2014/07004353/12OmNBQkwXr",
"parentPublication": {
"id": "proceedings/big-data/2014/5666/0",
"title": "2014 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asap/2012/4768/0/4768a008",
"title": "A Reconfigurable Computing Approach for Efficient and Scalable Parallel Graph Exploration",
"doi": null,
"abstractUrl": "/proceedings-article/asap/2012/4768a008/12OmNvonIP4",
"parentPublication": {
"id": "proceedings/asap/2012/4768/0",
"title": "2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nbis/2014/4224/0/4224a318",
"title": "Frequent-Pattern Based Facet Extraction from Graph Data",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2014/4224a318/12OmNvq5jB2",
"parentPublication": {
"id": "proceedings/nbis/2014/4224/0",
"title": "2014 17th International Conference on Network-Based Information Systems (NBiS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2010/7559/0/75590027",
"title": "Scalable Graph Exploration on Multicore Processors",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2010/75590027/12OmNwGIcAQ",
"parentPublication": {
"id": "proceedings/sc/2010/7559/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hipc/2012/2372/0/06507498",
"title": "Scalable performance of ScaleGraph for large scale graph analysis",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/2012/06507498/12OmNyPQ4OY",
"parentPublication": {
"id": "proceedings/hipc/2012/2372/0",
"title": "20th Annual International Conference on High Performance Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2016/5910/0/07836656",
"title": "Knowledge Graph Constraints for Multi-label Graph Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2016/07836656/12OmNyQGRYV",
"parentPublication": {
"id": "proceedings/icdmw/2016/5910/0",
"title": "2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2014/5666/0/07004278",
"title": "MAGE: Matching approximate patterns in richly-attributed graphs",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2014/07004278/12OmNyeECxb",
"parentPublication": {
"id": "proceedings/big-data/2014/5666/0",
"title": "2014 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbk/2018/9125/0/912500a001",
"title": "Graph Embedding Based Query Construction Over Knowledge Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/icbk/2018/912500a001/17D45Xh13sL",
"parentPublication": {
"id": "proceedings/icbk/2018/9125/0",
"title": "2018 IEEE International Conference on Big Knowledge (ICBK)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09895199",
"title": "Outlining and Filling: Hierarchical Query Graph Generation for Answering Complex Questions Over Knowledge Graphs",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09895199/1GNpapAirJu",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400c044",
"title": "Demonstrating Spindra: A Geographic Knowledge Graph Management System",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400c044/1aDT417LC4o",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBOll8c",
"title": "2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"acronym": "asonam",
"groupId": "1002866",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyqzM2z",
"doi": "10.1145/2808797.2810061",
"title": "Query-based graph cuboid outlier detection",
"normalizedTitle": "Query-based graph cuboid outlier detection",
"abstract": "Various projections or views of a heterogeneous information network can be modeled using the graph OLAP (On-line Analytical Processing) framework for effective decision making. Detecting anomalous projections of the network can help the analysts identify regions of interest from the graph specific to the projection attribute. While most previous studies on outlier detection in graphs deal with outlier nodes, edges or subgraphs, we are the first to propose detection of graph cuboid outliers. Further we perform this detection in a query sensitive way. Given a general subgraph query on a heterogeneous network, we study the problem of finding outlier cuboids from the graph OLAP lattice. A Graph Cuboid Outlier (GCOutlier) is a cuboid with exceptionally high density of matches for the query. The GCOutlier detection task is clearly challenging because: (1) finding matches for the query (subgraph isomorphism) is NP-hard; (2) number of matches for the query can be very high; and (3) number of cuboids can be large. We provide an approximate solution to the problem by computing only a fraction of the total matches originating from a select set of candidate nodes and including a select set of edges, chosen smartly. We perform extensive experiments on synthetic datasets to showcase the execution time versus accuracy trade-off. Experiments on real datasets like Four Area and Delicious containing thousands of nodes reveal interesting GCOutliers.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Various projections or views of a heterogeneous information network can be modeled using the graph OLAP (On-line Analytical Processing) framework for effective decision making. Detecting anomalous projections of the network can help the analysts identify regions of interest from the graph specific to the projection attribute. While most previous studies on outlier detection in graphs deal with outlier nodes, edges or subgraphs, we are the first to propose detection of graph cuboid outliers. Further we perform this detection in a query sensitive way. Given a general subgraph query on a heterogeneous network, we study the problem of finding outlier cuboids from the graph OLAP lattice. A Graph Cuboid Outlier (GCOutlier) is a cuboid with exceptionally high density of matches for the query. The GCOutlier detection task is clearly challenging because: (1) finding matches for the query (subgraph isomorphism) is NP-hard; (2) number of matches for the query can be very high; and (3) number of cuboids can be large. We provide an approximate solution to the problem by computing only a fraction of the total matches originating from a select set of candidate nodes and including a select set of edges, chosen smartly. We perform extensive experiments on synthetic datasets to showcase the execution time versus accuracy trade-off. Experiments on real datasets like Four Area and Delicious containing thousands of nodes reveal interesting GCOutliers.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Various projections or views of a heterogeneous information network can be modeled using the graph OLAP (On-line Analytical Processing) framework for effective decision making. Detecting anomalous projections of the network can help the analysts identify regions of interest from the graph specific to the projection attribute. While most previous studies on outlier detection in graphs deal with outlier nodes, edges or subgraphs, we are the first to propose detection of graph cuboid outliers. Further we perform this detection in a query sensitive way. Given a general subgraph query on a heterogeneous network, we study the problem of finding outlier cuboids from the graph OLAP lattice. A Graph Cuboid Outlier (GCOutlier) is a cuboid with exceptionally high density of matches for the query. The GCOutlier detection task is clearly challenging because: (1) finding matches for the query (subgraph isomorphism) is NP-hard; (2) number of matches for the query can be very high; and (3) number of cuboids can be large. We provide an approximate solution to the problem by computing only a fraction of the total matches originating from a select set of candidate nodes and including a select set of edges, chosen smartly. We perform extensive experiments on synthetic datasets to showcase the execution time versus accuracy trade-off. Experiments on real datasets like Four Area and Delicious containing thousands of nodes reveal interesting GCOutliers.",
"fno": "07403619",
"keywords": [
"Lattices",
"Heterogeneous Networks",
"Organizations",
"Image Edge Detection",
"Yttrium",
"Data Mining",
"Information Retrieval",
"Information Networks",
"Graph OLAP",
"Outlier Detection",
"Graph Projection Outliers",
"Graph Cuboid Outliers"
],
"authors": [
{
"affiliation": "International Institute of Information Technology, Hyderabad",
"fullName": "Ayushi Dalmia",
"givenName": "Ayushi",
"surname": "Dalmia",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "International Institute of Information Technology, Hyderabad",
"fullName": "Manish Gupta",
"givenName": "Manish",
"surname": "Gupta",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "International Institute of Information Technology, Hyderabad",
"fullName": "Vasudeva Varma",
"givenName": "Vasudeva",
"surname": "Varma",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "asonam",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-08-01T00:00:00",
"pubType": "proceedings",
"pages": "705-712",
"year": "2015",
"issn": null,
"isbn": "978-1-4503-3854-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07403618",
"articleId": "12OmNCbU2RA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07403620",
"articleId": "12OmNy2rS4g",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2011/8959/0/05767885",
"title": "Outlier detection in graph streams",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2011/05767885/12OmNBA9oC3",
"parentPublication": {
"id": "proceedings/icde/2011/8959/0",
"title": "2011 IEEE 27th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2009/3735/1/3735a475",
"title": "Framework of Clustering-Based Outlier Detection",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/3735a475/12OmNBqMDxV",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/1",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2016/4320/0/07945629",
"title": "Semi-supervised outlier detection via bipartite graph clustering",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2016/07945629/12OmNBubOVT",
"parentPublication": {
"id": "proceedings/aiccsa/2016/4320/0",
"title": "2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscc/2013/3755/0/06754923",
"title": "Dynamic query path selection from lattice of cuboids using memory hierarchy",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2013/06754923/12OmNCcKQip",
"parentPublication": {
"id": "proceedings/iscc/2013/3755/0",
"title": "2013 IEEE Symposium on Computers and Communications (ISCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2016/5910/0/07836651",
"title": "Query-Based Evolutionary Graph Cuboid Outlier Detection",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2016/07836651/12OmNqJHFqU",
"parentPublication": {
"id": "proceedings/icdmw/2016/5910/0",
"title": "2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2004/2128/3/212830430",
"title": "Outlier Detection Using k-Nearest Neighbour Graph",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2004/212830430/12OmNvjyxB9",
"parentPublication": {
"id": "proceedings/icpr/2004/2128/3",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlds/2017/3446/0/3446a068",
"title": "INGC: Graph Clustering & Outlier Detection Algorithm Using Label Propagation",
"doi": null,
"abstractUrl": "/proceedings-article/mlds/2017/3446a068/12OmNwDACsl",
"parentPublication": {
"id": "proceedings/mlds/2017/3446/0",
"title": "2017 International Conference on Machine learning and Data Science (MLDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2009/3735/5/3735e259",
"title": "Efficient Outlier Detection Algorithm for Heterogeneous Data Streams",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/3735e259/12OmNwt5sog",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/5",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1988/0878/0/00028331",
"title": "3D cuboid scene understanding by a mixed cognitive graph and log-complex mapping paradigm",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1988/00028331/12OmNy5R3re",
"parentPublication": {
"id": "proceedings/icpr/1988/0878/0",
"title": "9th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2017/02/07593255",
"title": "Efficient Pattern-Based Aggregation on Sequence Data",
"doi": null,
"abstractUrl": "/journal/tk/2017/02/07593255/13rRUwInvBv",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1BrAyMVuURG",
"title": "2021 IEEE Fourth International Conference on Artificial Intelligence and Knowledge Engineering (AIKE)",
"acronym": "aike",
"groupId": "1828385",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1BrAzAZZMti",
"doi": "10.1109/AIKE52691.2021.00025",
"title": "QLiG: Query Like a Graph For Subgraph Matching",
"normalizedTitle": "QLiG: Query Like a Graph For Subgraph Matching",
"abstract": "A graph is a natural and flexible modeling approach to represent entities and relationships between them in the real world. A Knowledge Graph (KG) is a specialized graph with formal and structured representations of facts, relationships, annotated with semantic descriptions. Subgraph matching is one of the fundamental graph problems to identify relationships, interactions, and activities of interest within a large graph. A query specification is a collection of abstract components, operations, and constraints to express a pattern. The specification can be implemented in different ways based on the underlying data model. Various graph query specifications have been developed over the years that has led to the development of different open-sourced and vendor-specific query languages. Such specifications are modeled as an extension of relational algebra used in relational query languages such as SQL. Such approaches do not inherently support graph queries. There is a need to represent graph queries in terms of graph-based components to expedite the query construction by non-database experts. We present a graph-based query approach QLiG (pronounced cleeg), to perform subgraph matching in a Labeled Property Graph (LPG). QLiG provides required expressivity to represent a query graph in a natural way using high-level concepts such as path, structure, and constraints. We present the query specification, salient features, and a real-world use case to show functional examples.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A graph is a natural and flexible modeling approach to represent entities and relationships between them in the real world. A Knowledge Graph (KG) is a specialized graph with formal and structured representations of facts, relationships, annotated with semantic descriptions. Subgraph matching is one of the fundamental graph problems to identify relationships, interactions, and activities of interest within a large graph. A query specification is a collection of abstract components, operations, and constraints to express a pattern. The specification can be implemented in different ways based on the underlying data model. Various graph query specifications have been developed over the years that has led to the development of different open-sourced and vendor-specific query languages. Such specifications are modeled as an extension of relational algebra used in relational query languages such as SQL. Such approaches do not inherently support graph queries. There is a need to represent graph queries in terms of graph-based components to expedite the query construction by non-database experts. We present a graph-based query approach QLiG (pronounced cleeg), to perform subgraph matching in a Labeled Property Graph (LPG). QLiG provides required expressivity to represent a query graph in a natural way using high-level concepts such as path, structure, and constraints. We present the query specification, salient features, and a real-world use case to show functional examples.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A graph is a natural and flexible modeling approach to represent entities and relationships between them in the real world. A Knowledge Graph (KG) is a specialized graph with formal and structured representations of facts, relationships, annotated with semantic descriptions. Subgraph matching is one of the fundamental graph problems to identify relationships, interactions, and activities of interest within a large graph. A query specification is a collection of abstract components, operations, and constraints to express a pattern. The specification can be implemented in different ways based on the underlying data model. Various graph query specifications have been developed over the years that has led to the development of different open-sourced and vendor-specific query languages. Such specifications are modeled as an extension of relational algebra used in relational query languages such as SQL. Such approaches do not inherently support graph queries. There is a need to represent graph queries in terms of graph-based components to expedite the query construction by non-database experts. We present a graph-based query approach QLiG (pronounced cleeg), to perform subgraph matching in a Labeled Property Graph (LPG). QLiG provides required expressivity to represent a query graph in a natural way using high-level concepts such as path, structure, and constraints. We present the query specification, salient features, and a real-world use case to show functional examples.",
"fno": "373600a121",
"keywords": [
"Data Models",
"Graph Theory",
"Query Languages",
"Query Processing",
"Relational Algebra",
"SQL",
"Subgraph Matching",
"Labeled Property Graph",
"Query Graph",
"Query Specification",
"Natural Approach",
"Flexible Modeling Approach",
"Knowledge Graph",
"Specialized Graph",
"Fundamental Graph Problems",
"Underlying Data Model",
"Graph Query Specifications",
"Vendor Specific Query Languages",
"Relational Query Languages",
"Graph Queries",
"Graph Based Components",
"Query Construction",
"Graph Based Query Approach Q Li G",
"Knowledge Engineering",
"Algebra",
"Conferences",
"Semantics",
"Data Models",
"Database Languages",
"Property Graph",
"Graph Query",
"Query Specification",
"Subgraph Matching"
],
"authors": [
{
"affiliation": "Pacific Northwest National Laboratory,Richland,WA,USA, 99352",
"fullName": "Sumit Purohit",
"givenName": "Sumit",
"surname": "Purohit",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Pacific Northwest National Laboratory,Richland,WA,USA, 99352",
"fullName": "Patrick Mackey",
"givenName": "Patrick",
"surname": "Mackey",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Pacific Northwest National Laboratory,Richland,WA,USA, 99352",
"fullName": "Jeremy D Zucker",
"givenName": "Jeremy D",
"surname": "Zucker",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Pacific Northwest National Laboratory,Richland,WA,USA, 99352",
"fullName": "Ankur Bohra",
"givenName": "Ankur",
"surname": "Bohra",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Pacific Northwest National Laboratory,Richland,WA,USA, 99352",
"fullName": "Rahul D Deshmukh",
"givenName": "Rahul D",
"surname": "Deshmukh",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Pacific Northwest National Laboratory,Richland,WA,USA, 99352",
"fullName": "George Chin",
"givenName": "George",
"surname": "Chin",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "aike",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-12-01T00:00:00",
"pubType": "proceedings",
"pages": "121-128",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-3736-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "373600a113",
"articleId": "1BrAzKGUAPS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "373600a129",
"articleId": "1BrAAH2CdC8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/big-data/2015/9926/0/07364122",
"title": "Towards a subgraph/supergraph cached query-graph index",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2015/07364122/12OmNBOllsS",
"parentPublication": {
"id": "proceedings/big-data/2015/9926/0",
"title": "2015 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2015/7964/0/07113411",
"title": "DaVinci: Data-driven visual interface construction for subgraph search in graph databases",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2015/07113411/12OmNwHQB6n",
"parentPublication": {
"id": "proceedings/icde/2015/7964/0",
"title": "2015 IEEE 31st International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdew/2013/5303/0/06547452",
"title": "SuReQL: A subgraph match based relational model for large graphs",
"doi": null,
"abstractUrl": "/proceedings-article/icdew/2013/06547452/12OmNx6g6dO",
"parentPublication": {
"id": "proceedings/icdew/2013/5303/0",
"title": "2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2009/3545/0/3545a393",
"title": "Continuous Subgraph Pattern Search over Graph Streams",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2009/3545a393/12OmNyPQ4yV",
"parentPublication": {
"id": "proceedings/icde/2009/3545/0",
"title": "2009 IEEE 25th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2016/2020/0/07498410",
"title": "Structure-preserving subgraph query services",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2016/07498410/12OmNzRHORv",
"parentPublication": {
"id": "proceedings/icde/2016/2020/0",
"title": "2016 IEEE 32nd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2014/04/06583915",
"title": "Towards Efficient Authenticated Subgraph Query Service in Outsourced Graph Databases",
"doi": null,
"abstractUrl": "/journal/sc/2014/04/06583915/13rRUILtJiS",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2018/5520/0/552000b815",
"title": "Answering Natural Language Questions by Subgraph Matching over Knowledge Graphs (Extended Abstract)",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2018/552000b815/14Fq0WBJQHx",
"parentPublication": {
"id": "proceedings/icde/2018/5520/0",
"title": "2018 IEEE 34th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2018/5035/0/08622519",
"title": "Distributed Top-k Subgraph Matching in A Big Graph",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2018/08622519/17D45XdBRRq",
"parentPublication": {
"id": "proceedings/big-data/2018/5035/0",
"title": "2018 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2022/0883/0/088300a245",
"title": "Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2022/088300a245/1FwFqmSJYAw",
"parentPublication": {
"id": "proceedings/icde/2022/0883/0",
"title": "2022 IEEE 38th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400a220",
"title": "Scaling Up Subgraph Query Processing with Efficient Subgraph Matching",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400a220/1aDSWRCnFEA",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1sET4vIEs1O",
"title": "2021 IEEE/ACM 43rd International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)",
"acronym": "icse-companion",
"groupId": null,
"volume": "0",
"displayVolume": null,
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1sET7DNJQ4M",
"doi": "10.1109/ICSE-Companion52605.2021.00129",
"title": "Interactive Graph Exploration for Comprehension of Static Analysis Results",
"normalizedTitle": "Interactive Graph Exploration for Comprehension of Static Analysis Results",
"abstract": "Static analysis results can be overwhelming depending on their complexity and the total number of results. Interactive graph visualization can help engineers explore the connections between different code entities while visually supporting insights about the code's behaviour. In our doctoral research, we aim to investigate how a graphical model of a program and its analysis results can support the engineer's understanding. We expect that a graphical interface can ease the diagnose of faults and reduce the cognitive load required to comprehend reported control and data flows present in the codebase.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Static analysis results can be overwhelming depending on their complexity and the total number of results. Interactive graph visualization can help engineers explore the connections between different code entities while visually supporting insights about the code's behaviour. In our doctoral research, we aim to investigate how a graphical model of a program and its analysis results can support the engineer's understanding. We expect that a graphical interface can ease the diagnose of faults and reduce the cognitive load required to comprehend reported control and data flows present in the codebase.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Static analysis results can be overwhelming depending on their complexity and the total number of results. Interactive graph visualization can help engineers explore the connections between different code entities while visually supporting insights about the code's behaviour. In our doctoral research, we aim to investigate how a graphical model of a program and its analysis results can support the engineer's understanding. We expect that a graphical interface can ease the diagnose of faults and reduce the cognitive load required to comprehend reported control and data flows present in the codebase.",
"fno": "121900a284",
"keywords": [
"Cognition",
"Data Visualisation",
"Graph Theory",
"Program Diagnostics",
"Different Code Entities",
"Interactive Graph Exploration",
"Static Analysis Results",
"Overwhelming Depending",
"Interactive Graph Visualization",
"Graphical Models",
"Data Visualization",
"Static Analysis",
"Medical Services",
"Complexity Theory",
"Software Engineering"
],
"authors": [
{
"affiliation": "University of Waterloo",
"fullName": "Rafael Toledo",
"givenName": "Rafael",
"surname": "Toledo",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icse-companion",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-05-01T00:00:00",
"pubType": "proceedings",
"pages": "284-286",
"year": "2021",
"issn": "2574-1926",
"isbn": "978-1-6654-1219-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "121900a281",
"articleId": "1sET7CGtIl2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "121900a287",
"articleId": "1sET7EMLB2E",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/vissoft/2013/1457/0/06650549",
"title": "IMMV: An interactive multi-matrix visualization for program comprehension",
"doi": null,
"abstractUrl": "/proceedings-article/vissoft/2013/06650549/12OmNwp74CC",
"parentPublication": {
"id": "proceedings/vissoft/2013/1457/0",
"title": "2013 First IEEE Working Conference on Software Visualization (VISSOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ecrts/2012/2032/0/06257571",
"title": "Hardness Results for Static Priority Real-Time Scheduling",
"doi": null,
"abstractUrl": "/proceedings-article/ecrts/2012/06257571/12OmNxETaab",
"parentPublication": {
"id": "proceedings/ecrts/2012/2032/0",
"title": "24th Euromicro Conference on Real-Time Systems (ECRTS 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2013/4989/0/4989b738",
"title": "Universality of the Local Marginal Polytope",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2013/4989b738/12OmNzdoMpm",
"parentPublication": {
"id": "proceedings/cvpr/2013/4989/0",
"title": "2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2018/5638/0/563801a395",
"title": "[Journal First] Model Comprehension for Security Risk Assessment: An Empirical Comparison of Tabular vs. Graphical Representations",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2018/563801a395/13l5NXXgd11",
"parentPublication": {
"id": "proceedings/icse/2018/5638/0",
"title": "2018 IEEE/ACM 40th International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2018/7449/0/744900a733",
"title": "Sum-of-Products with Default Values: Algorithms and Complexity Results",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2018/744900a733/17D45WwsQ8v",
"parentPublication": {
"id": "proceedings/ictai/2018/7449/0",
"title": "2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsc/2019/6783/0/08665509",
"title": "From Physician Queries to Logical Forms for Efficient Exploration of Patient Data",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2019/08665509/18qcejvxIGs",
"parentPublication": {
"id": "proceedings/icsc/2019/6783/0",
"title": "2019 IEEE 13th International Conference on Semantic Computing (ICSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichi/2022/6845/0/684500a575",
"title": "From Undergraduate to Doctoral Health Informatics Training: A Data Focus",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2022/684500a575/1GvdqXVXUAg",
"parentPublication": {
"id": "proceedings/ichi/2022/6845/0",
"title": "2022 IEEE 10th International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigmm/2019/5527/0/552700a309",
"title": "TraV: An Interactive Exploration System for Massive Trajectory Data",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2019/552700a309/1fHjKj4gCBi",
"parentPublication": {
"id": "proceedings/bigmm/2019/5527/0",
"title": "2019 IEEE Fifth International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issre/2019/4982/0/498200a323",
"title": "How Do Developers Act on Static Analysis Alerts? An Empirical Study of Coverity Usage",
"doi": null,
"abstractUrl": "/proceedings-article/issre/2019/498200a323/1hrLcDPKrtK",
"parentPublication": {
"id": "proceedings/issre/2019/4982/0",
"title": "2019 IEEE 30th International Symposium on Software Reliability Engineering (ISSRE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2021/0296/0/029600a524",
"title": "Program Comprehension and Code Complexity Metrics: An fMRI Study",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2021/029600a524/1sEXoau8ks8",
"parentPublication": {
"id": "proceedings/icse/2021/0296/0/",
"title": "2021 IEEE/ACM 43rd International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxH9X7w",
"title": "Information Visualization, IEEE Symposium on",
"acronym": "ieee-infovis",
"groupId": "1000371",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNA1mbbA",
"doi": "10.1109/INFVIS.2005.1532151",
"title": "Visualization of graphs with associated timeseries data",
"normalizedTitle": "Visualization of graphs with associated timeseries data",
"abstract": "The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a visual property (e.g. color) of the vertex, along with sliders or some such mechanism to animate the graph for other timepoints. Alternatively, data from all the timepoints can be overlaid simultaneously by embedding small charts into graph vertices. These graph visualizations may also be linked to other visualizations (e.g., parallel co-ordinates) using brushing and linking. This paper describes a study performed to evaluate and rank graph+timeseries visualization options based on users' performance time and accuracy of responses on predefined tasks. The results suggest that overlaying data on graph vertices one timepoint at a time may lead to more accurate performance for tasks involving analysis of a graph at a single timepoint, and comparisons between graph vertices for two distinct timepoints. Overlaying data simultaneously for all the timepoints on graph vertices may lead to more accurate and faster performance for tasks involving searching for outlier vertices displaying different behavior than the rest of the graph vertices for all timepoints. Single views have advantage over multiple views on tasks that require topological information. Also, the number of attributes displayed on nodes has a non trivial influence on accuracy of responses, whereas the number of visualizations affect the performance time.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a visual property (e.g. color) of the vertex, along with sliders or some such mechanism to animate the graph for other timepoints. Alternatively, data from all the timepoints can be overlaid simultaneously by embedding small charts into graph vertices. These graph visualizations may also be linked to other visualizations (e.g., parallel co-ordinates) using brushing and linking. This paper describes a study performed to evaluate and rank graph+timeseries visualization options based on users' performance time and accuracy of responses on predefined tasks. The results suggest that overlaying data on graph vertices one timepoint at a time may lead to more accurate performance for tasks involving analysis of a graph at a single timepoint, and comparisons between graph vertices for two distinct timepoints. Overlaying data simultaneously for all the timepoints on graph vertices may lead to more accurate and faster performance for tasks involving searching for outlier vertices displaying different behavior than the rest of the graph vertices for all timepoints. Single views have advantage over multiple views on tasks that require topological information. Also, the number of attributes displayed on nodes has a non trivial influence on accuracy of responses, whereas the number of visualizations affect the performance time.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a visual property (e.g. color) of the vertex, along with sliders or some such mechanism to animate the graph for other timepoints. Alternatively, data from all the timepoints can be overlaid simultaneously by embedding small charts into graph vertices. These graph visualizations may also be linked to other visualizations (e.g., parallel co-ordinates) using brushing and linking. This paper describes a study performed to evaluate and rank graph+timeseries visualization options based on users' performance time and accuracy of responses on predefined tasks. The results suggest that overlaying data on graph vertices one timepoint at a time may lead to more accurate performance for tasks involving analysis of a graph at a single timepoint, and comparisons between graph vertices for two distinct timepoints. Overlaying data simultaneously for all the timepoints on graph vertices may lead to more accurate and faster performance for tasks involving searching for outlier vertices displaying different behavior than the rest of the graph vertices for all timepoints. Single views have advantage over multiple views on tasks that require topological information. Also, the number of attributes displayed on nodes has a non trivial influence on accuracy of responses, whereas the number of visualizations affect the performance time.",
"fno": "01532151",
"keywords": [
"Data Visualisation",
"Computer Animation",
"Computational Geometry",
"Graph Theory",
"Time Series",
"Graph Visualization",
"Graph Analysis",
"Time Series Data Overlay",
"Graph Vertex",
"Visual Property Manipulation",
"Graph Animation",
"Topological Information",
"Time Series Data Analysis",
"Data Visualization",
"Multidimensional Systems",
"Data Analysis",
"Bioinformatics",
"Joining Processes",
"Computer Science",
"Time Series Analysis",
"Mechanical Factors",
"Color",
"Animation"
],
"authors": [
{
"affiliation": "Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA",
"fullName": "Purvi Saraiya",
"givenName": null,
"surname": "Purvi Saraiya",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA",
"fullName": "P. Lee",
"givenName": "P.",
"surname": "Lee",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA",
"fullName": "C. North",
"givenName": "C.",
"surname": "North",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ieee-infovis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-01-01T00:00:00",
"pubType": "proceedings",
"pages": "225,226,227,228,229,230,231,232",
"year": "2005",
"issn": "1522-404X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "27900014",
"articleId": "12OmNxUdv6H",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "27900015",
"articleId": "12OmNzWOBdM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/sbgames/2015/8843/0/8843a070",
"title": "GameVis: Game Data Visualization for the Web",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2015/8843a070/12OmNAoUTcZ",
"parentPublication": {
"id": "proceedings/sbgames/2015/8843/0",
"title": "2015 14th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/candar/2013/2796/0/06726878",
"title": "On Oriented Diameter of Star Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/candar/2013/06726878/12OmNBl6EI1",
"parentPublication": {
"id": "proceedings/candar/2013/2796/0",
"title": "2013 First International Symposium on Computing and Networking - Across Practical Development and Theoretical Research (CANDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdatasecurity-hpsc-ids/2016/2403/0/07502276",
"title": "A Novel Approach to Predictive Graphs Using Big Data",
"doi": null,
"abstractUrl": "/proceedings-article/bigdatasecurity-hpsc-ids/2016/07502276/12OmNrYCXFR",
"parentPublication": {
"id": "proceedings/bigdatasecurity-hpsc-ids/2016/2403/0",
"title": "2016 IEEE 2nd International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing (HPSC) and IEEE International Conference on Intelligent Data and Security (IDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900030",
"title": "Visualization of Graphs with Associated Timeseries Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900030/12OmNwDj0YL",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2013/5049/0/5049a051",
"title": "Radial Layered Matrix Visualization of Dynamic Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2013/5049a051/12OmNxHJ9om",
"parentPublication": {
"id": "proceedings/iv/2013/5049/0",
"title": "2013 17th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/infvis/2005/9464/0/01532151",
"title": "Visualization of graphs with associated timeseries data",
"doi": null,
"abstractUrl": "/proceedings-article/infvis/2005/01532151/12OmNy7Qfnd",
"parentPublication": {
"id": "proceedings/infvis/2005/9464/0",
"title": "IEEE Symposium on Information Visualization (InfoVis 05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061164",
"title": "behaviorism: a framework for dynamic data visualization",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061164/13rRUEgs2to",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/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": "trans/tg/2015/09/07061477",
"title": "Learning Visualizations by Analogy: Promoting Visual Literacy through Visualization Morphing",
"doi": null,
"abstractUrl": "/journal/tg/2015/09/07061477/13rRUxlgxTm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a248",
"title": "Time-Aligned Edge Plots for Dynamic Graph Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a248/1rSR9vG2u4w",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyYm2wE",
"title": "2014 International Conference on Information Visualization Theory and Applications (IVAPP)",
"acronym": "ivapp",
"groupId": "1806905",
"volume": "0",
"displayVolume": "0",
"year": "2014",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBdru8w",
"doi": "",
"title": "Hardware-accelerated attribute mapping for interactive visualization of complex 3D trajectories",
"normalizedTitle": "Hardware-accelerated attribute mapping for interactive visualization of complex 3D trajectories",
"abstract": "The visualization of 3D trajectories of moving objects and related attributes in 3D virtual environments represents a fundamental functionality in various visualization domains. Interactive rendering and visual analytics of such attributed trajectories involves both conceptual questions as well as technical challenges. Specifically, the mapping of trajectory attributes to rendering primitives and appearance represents a challenging task in the case of large data sets of high geometric complexity. There are various visualization approaches and rendering techniques considering specific aspects of these mappings to facilitate visualization and analysis of this kind of data. To solve the underlying general mapping problem efficiently, we developed an approach that uses and combines diverse types of visualizations, rather than being tailored to a specific use case. This paper describes an interactive rendering system for the visualization of 3D trajectories that enables the combinations of different mappings as well as their dynamic configuration at runtime. A fully hardware-accelerated implementation enables the processing of large sets of attributed 3D trajectories in real-time.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The visualization of 3D trajectories of moving objects and related attributes in 3D virtual environments represents a fundamental functionality in various visualization domains. Interactive rendering and visual analytics of such attributed trajectories involves both conceptual questions as well as technical challenges. Specifically, the mapping of trajectory attributes to rendering primitives and appearance represents a challenging task in the case of large data sets of high geometric complexity. There are various visualization approaches and rendering techniques considering specific aspects of these mappings to facilitate visualization and analysis of this kind of data. To solve the underlying general mapping problem efficiently, we developed an approach that uses and combines diverse types of visualizations, rather than being tailored to a specific use case. This paper describes an interactive rendering system for the visualization of 3D trajectories that enables the combinations of different mappings as well as their dynamic configuration at runtime. A fully hardware-accelerated implementation enables the processing of large sets of attributed 3D trajectories in real-time.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The visualization of 3D trajectories of moving objects and related attributes in 3D virtual environments represents a fundamental functionality in various visualization domains. Interactive rendering and visual analytics of such attributed trajectories involves both conceptual questions as well as technical challenges. Specifically, the mapping of trajectory attributes to rendering primitives and appearance represents a challenging task in the case of large data sets of high geometric complexity. There are various visualization approaches and rendering techniques considering specific aspects of these mappings to facilitate visualization and analysis of this kind of data. To solve the underlying general mapping problem efficiently, we developed an approach that uses and combines diverse types of visualizations, rather than being tailored to a specific use case. This paper describes an interactive rendering system for the visualization of 3D trajectories that enables the combinations of different mappings as well as their dynamic configuration at runtime. A fully hardware-accelerated implementation enables the processing of large sets of attributed 3D trajectories in real-time.",
"fno": "07294450",
"keywords": [
"Data Visualization",
"Rendering Computer Graphics",
"Visualization",
"Trajectory",
"Geometry",
"Graphics Processing Units",
"Image Color Analysis",
"3 D Attributed Trajectories",
"Real Time Rendering",
"Attribute Mapping"
],
"authors": [
{
"affiliation": "Hasso-Plattner-Institut, University of Potsdam, Germany",
"fullName": "Stefan Buschmann",
"givenName": "Stefan",
"surname": "Buschmann",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Hasso-Plattner-Institut, University of Potsdam, Germany",
"fullName": "Matthias Trapp",
"givenName": "Matthias",
"surname": "Trapp",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Hasso-Plattner-Institut, University of Potsdam, Germany",
"fullName": "Patrick Lühne",
"givenName": "Patrick",
"surname": "Lühne",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Hasso-Plattner-Institut, University of Potsdam, Germany",
"fullName": "Jürgen Döllner",
"givenName": "Jürgen",
"surname": "Döllner",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ivapp",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2014-01-01T00:00:00",
"pubType": "proceedings",
"pages": "356-363",
"year": "2014",
"issn": null,
"isbn": "978-9-8975-8132-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07294449",
"articleId": "12OmNBiygAi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07294451",
"articleId": "12OmNx7G5Vb",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/dagstuhl/1997/0503/0/05030151",
"title": "Visualization of Complex Physical Phenomena and Mathematical Objects in Virtual Environment",
"doi": null,
"abstractUrl": "/proceedings-article/dagstuhl/1997/05030151/12OmNAWYKJc",
"parentPublication": {
"id": "proceedings/dagstuhl/1997/0503/0",
"title": "Dagstuhl '97 - Scientific Visualization Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532827",
"title": "Hardware-accelerated 3D visualization of mass spectrometry data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532827/12OmNCbU35C",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2014/4677/0/4677a174",
"title": "Real-Time Animated Visualization of Massive Air-Traffic Trajectories",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2014/4677a174/12OmNwF0BTG",
"parentPublication": {
"id": "proceedings/cw/2014/4677/0",
"title": "2014 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2005/9462/0/01532859",
"title": "Visualization with stylized line primitives",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2005/01532859/12OmNxAlzZw",
"parentPublication": {
"id": "proceedings/vis/2005/9462/0",
"title": "IEEE Visualization 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122565",
"title": "Stacking-Based Visualization of Trajectory Attribute Data",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122565/13rRUxASuhy",
"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": "trans/tg/2023/01/09905624",
"title": "On-Tube Attribute Visualization for Multivariate Trajectory Data",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09905624/1H2l6ksKN5S",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805455",
"title": "Accelerated Monte Carlo Rendering of Finite-Time Lyapunov Exponents",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805455/1cG4y9tZbPO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2019/9226/0/922600a212",
"title": "Visual Analysis of Ligand Trajectories in Molecular Dynamics",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2019/922600a212/1cMF88klX8c",
"parentPublication": {
"id": "proceedings/pacificvis/2019/9226/0",
"title": "2019 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09216549",
"title": "Advanced Rendering of Line Data with Ambient Occlusion and Transparency",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09216549/1nJsKPg3YJy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzSh1ba",
"title": "Network and System Security, International Conference on",
"acronym": "nss",
"groupId": "1002944",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBpEeJc",
"doi": "10.1109/NSS.2009.23",
"title": "Extended K-Anonymity Models Against Attribute Disclosure",
"normalizedTitle": "Extended K-Anonymity Models Against Attribute Disclosure",
"abstract": "P-sensitive k-anonymity model has been recently defined as a sophistication of k-anonymity. This new property requires that there be at least p distinct values for each sensitive attribute within the records sharing a combination of key attributes. However, as shown in this paper, it may not protect sensitive information in some way. In this paper, we empirically investigate two enhanced k-anonymity models. Instead of publishing original specific sensitive attributes, the new models publish the categories that the sensitive values belong to. We propose a top-down approach to implement two enhanced models and show in the comprehensive experimental evaluations that the two new introduced models are practical in terms of effectiveness and efficiency.",
"abstracts": [
{
"abstractType": "Regular",
"content": "P-sensitive k-anonymity model has been recently defined as a sophistication of k-anonymity. This new property requires that there be at least p distinct values for each sensitive attribute within the records sharing a combination of key attributes. However, as shown in this paper, it may not protect sensitive information in some way. In this paper, we empirically investigate two enhanced k-anonymity models. Instead of publishing original specific sensitive attributes, the new models publish the categories that the sensitive values belong to. We propose a top-down approach to implement two enhanced models and show in the comprehensive experimental evaluations that the two new introduced models are practical in terms of effectiveness and efficiency.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "P-sensitive k-anonymity model has been recently defined as a sophistication of k-anonymity. This new property requires that there be at least p distinct values for each sensitive attribute within the records sharing a combination of key attributes. However, as shown in this paper, it may not protect sensitive information in some way. In this paper, we empirically investigate two enhanced k-anonymity models. Instead of publishing original specific sensitive attributes, the new models publish the categories that the sensitive values belong to. We propose a top-down approach to implement two enhanced models and show in the comprehensive experimental evaluations that the two new introduced models are practical in terms of effectiveness and efficiency.",
"fno": "3838a130",
"keywords": [
"Security Of Data",
"Extended K Anonymity Models",
"Attribute Disclosure",
"P Sensitive K Anonymity Model",
"Sensitive Information",
"Top Down Approach",
"Specific Sensitive Attributes",
"Joining Processes",
"Mathematical Model",
"Protection",
"Mathematics",
"Computer Networks",
"Data Security",
"Information Security"
],
"authors": [
{
"affiliation": "Dept. of Math. & Comput., Univ. of Southern Queensland, Toowoomba, QLD, Australia",
"fullName": "Xiaoxun Sun",
"givenName": "Xiaoxun",
"surname": "Sun",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Math. & Comput., Univ. of Southern Queensland, Toowoomba, QLD, Australia",
"fullName": "Hua Wang",
"givenName": "Hua",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Math. & Comput., Univ. of Southern Queensland, Toowoomba, QLD, Australia",
"fullName": "Lili Sun",
"givenName": "Lili",
"surname": "Sun",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "nss",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-10-01T00:00:00",
"pubType": "proceedings",
"pages": "130-136",
"year": "2009",
"issn": null,
"isbn": "978-1-4244-5087-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3838a018",
"articleId": "12OmNCcbE5l",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3838a024",
"articleId": "12OmNwHhp39",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2007/0802/0/04221659",
"title": "t-Closeness: Privacy Beyond k-Anonymity and l-Diversity",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2007/04221659/12OmNAkWvrr",
"parentPublication": {
"id": "proceedings/icde/2007/0802/0",
"title": "2007 IEEE 23rd International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2008/2357/0/04594650",
"title": "(p+, α)-sensitive k-anonymity: A new enhanced privacy protection model",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2008/04594650/12OmNBCZnRR",
"parentPublication": {
"id": "proceedings/cit/2008/2357/0",
"title": "2008 8th IEEE International Conference on Computer and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2012/4858/0/4858a768",
"title": "A New K-anonymity Algorithm towards Multiple Sensitive Attributes",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2012/4858a768/12OmNBQC8bj",
"parentPublication": {
"id": "proceedings/cit/2012/4858/0",
"title": "Computer and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icebe/2009/3842/0/3842a199",
"title": "Achieving P-Sensitive K-Anonymity via Anatomy",
"doi": null,
"abstractUrl": "/proceedings-article/icebe/2009/3842a199/12OmNvB9Fyo",
"parentPublication": {
"id": "proceedings/icebe/2009/3842/0",
"title": "2009 IEEE International Conference on e-Business Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2013/1282/0/06740431",
"title": "(k, ε)-Anonymity: An anonymity model for thwarting similarity attack",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2013/06740431/12OmNxWLTuq",
"parentPublication": {
"id": "proceedings/grc/2013/1282/0",
"title": "2013 IEEE International Conference on Granular Computing (GrC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ares/2008/3102/0/3102a990",
"title": "A Critique of k-Anonymity and Some of Its Enhancements",
"doi": null,
"abstractUrl": "/proceedings-article/ares/2008/3102a990/12OmNzCF4WT",
"parentPublication": {
"id": "proceedings/ares/2008/3102/0",
"title": "2008 Third International Conference on Availability, Reliability and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdew/2006/2571/0/25710094",
"title": "Privacy Protection: p-Sensitive k-Anonymity Property",
"doi": null,
"abstractUrl": "/proceedings-article/icdew/2006/25710094/12OmNzd7c3a",
"parentPublication": {
"id": "proceedings/icdew/2006/2571/0",
"title": "22nd International Conference on Data Engineering Workshops (ICDEW'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbd/2015/8537/0/8537a234",
"title": "A Personalized Extended (a, k)-Anonymity Model",
"doi": null,
"abstractUrl": "/proceedings-article/cbd/2015/8537a234/12OmNzdoN8h",
"parentPublication": {
"id": "proceedings/cbd/2015/8537/0",
"title": "2015 Third International Conference on Advanced Cloud and Big Data (CBD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gcis/2012/3072/0/06449523",
"title": "N-SA K-anonymity Model: A Model Exclusive of Tuple Suppression Technique",
"doi": null,
"abstractUrl": "/proceedings-article/gcis/2012/06449523/12OmNzvz6Ox",
"parentPublication": {
"id": "proceedings/gcis/2012/3072/0",
"title": "2012 Third Global Congress on Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2009/08/ttk2009081104",
"title": "Multirelational k-Anonymity",
"doi": null,
"abstractUrl": "/journal/tk/2009/08/ttk2009081104/13rRUIJuxvD",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqG0SWf",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"acronym": "pacificvis",
"groupId": "1001657",
"volume": "0",
"displayVolume": "0",
"year": "2014",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNC8uRAg",
"doi": "10.1109/PacificVis.2014.22",
"title": "Bridging the Gap of Network Management and Anomaly Detection through Interactive Visualization",
"normalizedTitle": "Bridging the Gap of Network Management and Anomaly Detection through Interactive Visualization",
"abstract": "Large-scale networks have become increasingly challenging to manage. It is vital for a system administrator or network manager to be able to analyze the vast amount of log data in order to detect suspicious behaviors or patterns, possibly due to malicious users/applications or faulty devices. While an intrusion detection system (IDS) log can provide a large number of warnings, exactly which alarms are true while the others are false, and more importantly what are the underlying causes are still difficult to know. To bridge the gap between network log and anomaly discovery, we design and implement a visualization tool that combines multiple commodity visualizations with minimum learning curve. While each individual view is well understood, the effects of such views in analyzing network anomalies are not well studied. Since each visualization technique has advantages as well as limitations in addressing a particular task, we show that these views, when combined and linked together, may provide an effective and lightweight network anomaly analysis tool. The web-based open platform may simplify network administration as well as promote collaborative analysis among researchers.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Large-scale networks have become increasingly challenging to manage. It is vital for a system administrator or network manager to be able to analyze the vast amount of log data in order to detect suspicious behaviors or patterns, possibly due to malicious users/applications or faulty devices. While an intrusion detection system (IDS) log can provide a large number of warnings, exactly which alarms are true while the others are false, and more importantly what are the underlying causes are still difficult to know. To bridge the gap between network log and anomaly discovery, we design and implement a visualization tool that combines multiple commodity visualizations with minimum learning curve. While each individual view is well understood, the effects of such views in analyzing network anomalies are not well studied. Since each visualization technique has advantages as well as limitations in addressing a particular task, we show that these views, when combined and linked together, may provide an effective and lightweight network anomaly analysis tool. The web-based open platform may simplify network administration as well as promote collaborative analysis among researchers.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Large-scale networks have become increasingly challenging to manage. It is vital for a system administrator or network manager to be able to analyze the vast amount of log data in order to detect suspicious behaviors or patterns, possibly due to malicious users/applications or faulty devices. While an intrusion detection system (IDS) log can provide a large number of warnings, exactly which alarms are true while the others are false, and more importantly what are the underlying causes are still difficult to know. To bridge the gap between network log and anomaly discovery, we design and implement a visualization tool that combines multiple commodity visualizations with minimum learning curve. While each individual view is well understood, the effects of such views in analyzing network anomalies are not well studied. Since each visualization technique has advantages as well as limitations in addressing a particular task, we show that these views, when combined and linked together, may provide an effective and lightweight network anomaly analysis tool. The web-based open platform may simplify network administration as well as promote collaborative analysis among researchers.",
"fno": "2874a253",
"keywords": [
"Data Visualization",
"Servers",
"Joining Processes",
"Market Research",
"Image Color Analysis",
"Visualization",
"Security",
"Network Anomaly Visualization"
],
"authors": [
{
"affiliation": null,
"fullName": "Tao Zhang",
"givenName": null,
"surname": "Tao Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Qi Liao",
"givenName": null,
"surname": "Qi Liao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Lei Shi",
"givenName": null,
"surname": "Lei Shi",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "pacificvis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2014-03-01T00:00:00",
"pubType": "proceedings",
"pages": "253-257",
"year": "2014",
"issn": null,
"isbn": "978-1-4799-2874-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "2874a248",
"articleId": "12OmNyo1nU9",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "2874a258",
"articleId": "12OmNBTawfH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ares/2008/3102/0/3102a610",
"title": "Histogram Matrix: Log File Visualization for Anomaly Detection",
"doi": null,
"abstractUrl": "/proceedings-article/ares/2008/3102a610/12OmNAKM027",
"parentPublication": {
"id": "proceedings/ares/2008/3102/0",
"title": "2008 Third International Conference on Availability, Reliability and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2014/6227/0/07042520",
"title": "StretchPlot: Interactive visualization of multi-dimensional trajectory data",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042520/12OmNzBOhTb",
"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/2017/03/mcg2017030096",
"title": "Apply or Die: On the Role and Assessment of Application Papers in Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2017/03/mcg2017030096/13rRUwbJCZj",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/07/08356097",
"title": "Bridging Text Visualization and Mining: A Task-Driven Survey",
"doi": null,
"abstractUrl": "/journal/tg/2019/07/08356097/13rRUwbs1SC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192685",
"title": "CiteRivers: Visual Analytics of Citation Patterns",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192685/13rRUwd9CG5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/10/08078198",
"title": "Cartogram Visualization for Bivariate Geo-Statistical Data",
"doi": null,
"abstractUrl": "/journal/tg/2018/10/08078198/13rRUx0xPZE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/08/06674295",
"title": "Dynamic Network Visualization withExtended Massive Sequence Views",
"doi": null,
"abstractUrl": "/journal/tg/2014/08/06674295/13rRUx0xPZz",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mass/2018/5580/0/558000a548",
"title": "Iterative Anomaly Detection Algorithm Based on Time Series Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/mass/2018/558000a548/17D45Xbl4NP",
"parentPublication": {
"id": "proceedings/mass/2018/5580/0",
"title": "2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2022/9744/0/974400a048",
"title": "A Dilated Transformer Network for Time Series Anomaly Detection",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2022/974400a048/1MrG3iJPeJG",
"parentPublication": {
"id": "proceedings/ictai/2022/9744/0",
"title": "2022 IEEE 34th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2019/1746/0/09028592",
"title": "Graduated Life Explore: An Interactive Visualization Tool to Explore the Comprehensive Benefits of a Timely Graduation",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2019/09028592/1iffwVNgtna",
"parentPublication": {
"id": "proceedings/fie/2019/1746/0",
"title": "2019 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyQYtf2",
"title": "2017 International Conference on 3D Vision (3DV)",
"acronym": "3dv",
"groupId": "1800494",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNs0C9Os",
"doi": "10.1109/3DV.2017.00078",
"title": "Cross-Modal Attribute Transfer for Rescaling 3D Models",
"normalizedTitle": "Cross-Modal Attribute Transfer for Rescaling 3D Models",
"abstract": "We present an algorithm for transferring physical attributes between webpages and 3D shapes. We crawl product catalogues and other webpages with structured metadata containing physical attributes such as dimensions and weights. Then we transfer physical attributes between shapes and real-world objects using a joint embedding of images and 3D shapes and a view-based weighting and aspect ratio filtering scheme for instance-level linking of 3D models and real-world counterpart objects. We evaluate our approach on a large-scale dataset of unscaled 3D models, and show that we outperform prior work on rescaling 3D models that considers only category-level size priors.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present an algorithm for transferring physical attributes between webpages and 3D shapes. We crawl product catalogues and other webpages with structured metadata containing physical attributes such as dimensions and weights. Then we transfer physical attributes between shapes and real-world objects using a joint embedding of images and 3D shapes and a view-based weighting and aspect ratio filtering scheme for instance-level linking of 3D models and real-world counterpart objects. We evaluate our approach on a large-scale dataset of unscaled 3D models, and show that we outperform prior work on rescaling 3D models that considers only category-level size priors.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present an algorithm for transferring physical attributes between webpages and 3D shapes. We crawl product catalogues and other webpages with structured metadata containing physical attributes such as dimensions and weights. Then we transfer physical attributes between shapes and real-world objects using a joint embedding of images and 3D shapes and a view-based weighting and aspect ratio filtering scheme for instance-level linking of 3D models and real-world counterpart objects. We evaluate our approach on a large-scale dataset of unscaled 3D models, and show that we outperform prior work on rescaling 3D models that considers only category-level size priors.",
"fno": "261001a640",
"keywords": [
"Data Analysis",
"Meta Data",
"Rescaling 3 D Models",
"Physical Attributes",
"Webpages",
"Real World Counterpart Objects",
"Unscaled 3 D Models",
"Cross Modal Attribute Transfer",
"View Based Weighting",
"Aspect Ratio Filtering Scheme",
"Three Dimensional Displays",
"Solid Modeling",
"Shape",
"Data Models",
"Joining Processes",
"Computational Modeling",
"Atmospheric Modeling",
"3 D Models",
"Metric Size Prediction",
"Cross Modal Attribute Transfer"
],
"authors": [
{
"affiliation": null,
"fullName": "Lin Shao",
"givenName": "Lin",
"surname": "Shao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Angel X. Chang",
"givenName": "Angel X.",
"surname": "Chang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Hao Su",
"givenName": "Hao",
"surname": "Su",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Manolis Savva",
"givenName": "Manolis",
"surname": "Savva",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Leonidas Guibas",
"givenName": "Leonidas",
"surname": "Guibas",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "3dv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-10-01T00:00:00",
"pubType": "proceedings",
"pages": "640-648",
"year": "2017",
"issn": "2475-7888",
"isbn": "978-1-5386-2610-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "261001a630",
"articleId": "12OmNxwncfo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "261001a649",
"articleId": "12OmNrNh0Qj",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/3dv/2017/2610/0/261001a402",
"title": "3D Shape Induction from 2D Views of Multiple Objects",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2017/261001a402/12OmNBLdKOR",
"parentPublication": {
"id": "proceedings/3dv/2017/2610/0",
"title": "2017 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2014/7000/1/7000a543",
"title": "Hashing Cross-Modal Manifold for Scalable Sketch-Based 3D Model Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2014/7000a543/12OmNBh8gVD",
"parentPublication": {
"id": "proceedings/3dv/2014/7000/2",
"title": "2014 2nd International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2018/07/07970176",
"title": "Joint Semantic and Latent Attribute Modelling for Cross-Class Transfer Learning",
"doi": null,
"abstractUrl": "/journal/tp/2018/07/07970176/13rRUxZ0o2R",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545228",
"title": "2D-to-3D Facial Expression Transfer",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545228/17D45XtvpbK",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200f610",
"title": "Scene Synthesis via Uncertainty-Driven Attribute Synchronization",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200f610/1BmFoAFYs7K",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aipr/2022/7729/0/10092199",
"title": "Adversarial Barrel! An Evaluation of 3D Physical Adversarial Attacks",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2022/10092199/1MepJf4XY3e",
"parentPublication": {
"id": "proceedings/aipr/2022/7729/0",
"title": "2022 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2019/5023/0/502300c797",
"title": "A Refined 3D Pose Dataset for Fine-Grained Object Categories",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2019/502300c797/1i5mJJVu6Uo",
"parentPublication": {
"id": "proceedings/iccvw/2019/5023/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2020/1331/0/09102925",
"title": "Cross-Modal Guidance Network For Sketch-Based 3d Shape Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2020/09102925/1kwqTrDSXF6",
"parentPublication": {
"id": "proceedings/icme/2020/1331/0",
"title": "2020 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900d141",
"title": "Cross-Modal Center Loss for 3D Cross-Modal Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900d141/1yeJANS7HfG",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900e586",
"title": "From Points to Multi-Object 3D Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900e586/1yeK9lg0XXG",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNC17hWl",
"title": "IEEE Symposium on Information Visualization (InfoVis 05)",
"acronym": "infvis",
"groupId": "1000371",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNy7Qfnd",
"doi": "10.1109/INFVIS.2005.1532151",
"title": "Visualization of graphs with associated timeseries data",
"normalizedTitle": "Visualization of graphs with associated timeseries data",
"abstract": "The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a visual property (e.g. color) of the vertex, along with sliders or some such mechanism to animate the graph for other timepoints. Alternatively, data from all the timepoints can be overlaid simultaneously by embedding small charts into graph vertices. These graph visualizations may also be linked to other visualizations (e.g., parallel co-ordinates) using brushing and linking. This paper describes a study performed to evaluate and rank graph+timeseries visualization options based on users' performance time and accuracy of responses on predefined tasks. The results suggest that overlaying data on graph vertices one timepoint at a time may lead to more accurate performance for tasks involving analysis of a graph at a single timepoint, and comparisons between graph vertices for two distinct timepoints. Overlaying data simultaneously for all the timepoints on graph vertices may lead to more accurate and faster performance for tasks involving searching for outlier vertices displaying different behavior than the rest of the graph vertices for all timepoints. Single views have advantage over multiple views on tasks that require topological information. Also, the number of attributes displayed on nodes has a non trivial influence on accuracy of responses, whereas the number of visualizations affect the performance time.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a visual property (e.g. color) of the vertex, along with sliders or some such mechanism to animate the graph for other timepoints. Alternatively, data from all the timepoints can be overlaid simultaneously by embedding small charts into graph vertices. These graph visualizations may also be linked to other visualizations (e.g., parallel co-ordinates) using brushing and linking. This paper describes a study performed to evaluate and rank graph+timeseries visualization options based on users' performance time and accuracy of responses on predefined tasks. The results suggest that overlaying data on graph vertices one timepoint at a time may lead to more accurate performance for tasks involving analysis of a graph at a single timepoint, and comparisons between graph vertices for two distinct timepoints. Overlaying data simultaneously for all the timepoints on graph vertices may lead to more accurate and faster performance for tasks involving searching for outlier vertices displaying different behavior than the rest of the graph vertices for all timepoints. Single views have advantage over multiple views on tasks that require topological information. Also, the number of attributes displayed on nodes has a non trivial influence on accuracy of responses, whereas the number of visualizations affect the performance time.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a visual property (e.g. color) of the vertex, along with sliders or some such mechanism to animate the graph for other timepoints. Alternatively, data from all the timepoints can be overlaid simultaneously by embedding small charts into graph vertices. These graph visualizations may also be linked to other visualizations (e.g., parallel co-ordinates) using brushing and linking. This paper describes a study performed to evaluate and rank graph+timeseries visualization options based on users' performance time and accuracy of responses on predefined tasks. The results suggest that overlaying data on graph vertices one timepoint at a time may lead to more accurate performance for tasks involving analysis of a graph at a single timepoint, and comparisons between graph vertices for two distinct timepoints. Overlaying data simultaneously for all the timepoints on graph vertices may lead to more accurate and faster performance for tasks involving searching for outlier vertices displaying different behavior than the rest of the graph vertices for all timepoints. Single views have advantage over multiple views on tasks that require topological information. Also, the number of attributes displayed on nodes has a non trivial influence on accuracy of responses, whereas the number of visualizations affect the performance time.",
"fno": "01532151",
"keywords": [
"Data Visualisation",
"Computer Animation",
"Computational Geometry",
"Graph Theory",
"Time Series",
"Graph Visualization",
"Graph Analysis",
"Time Series Data Overlay",
"Graph Vertex",
"Visual Property Manipulation",
"Graph Animation",
"Topological Information",
"Time Series Data Analysis",
"Data Visualization",
"Multidimensional Systems",
"Data Analysis",
"Bioinformatics",
"Joining Processes",
"Computer Science",
"Time Series Analysis",
"Mechanical Factors",
"Color",
"Animation"
],
"authors": [
{
"affiliation": "Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA",
"fullName": "Purvi Saraiya",
"givenName": null,
"surname": "Purvi Saraiya",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA",
"fullName": "P. Lee",
"givenName": "P.",
"surname": "Lee",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA",
"fullName": "C. North",
"givenName": "C.",
"surname": "North",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "infvis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-01-01T00:00:00",
"pubType": "proceedings",
"pages": "225,226,227,228,229,230,231,232",
"year": "2005",
"issn": "1522-404X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01532150",
"articleId": "12OmNs59JIW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01532152",
"articleId": "12OmNx8Ouqw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2005/2790/0/01532151",
"title": "Visualization of graphs with associated timeseries data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/01532151/12OmNA1mbbA",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2015/8843/0/8843a070",
"title": "GameVis: Game Data Visualization for the Web",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2015/8843a070/12OmNAoUTcZ",
"parentPublication": {
"id": "proceedings/sbgames/2015/8843/0",
"title": "2015 14th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/2000/6478/0/00885676",
"title": "Creating reusable visualizations with the Relational Visualization Notation",
"doi": null,
"abstractUrl": "/proceedings-article/visual/2000/00885676/12OmNBNM8TL",
"parentPublication": {
"id": "proceedings/visual/2000/6478/0",
"title": "Proceedings Visualization 2000. VIS 2000",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/candar/2013/2796/0/06726878",
"title": "On Oriented Diameter of Star Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/candar/2013/06726878/12OmNBl6EI1",
"parentPublication": {
"id": "proceedings/candar/2013/2796/0",
"title": "2013 First International Symposium on Computing and Networking - Across Practical Development and Theoretical Research (CANDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdatasecurity-hpsc-ids/2016/2403/0/07502276",
"title": "A Novel Approach to Predictive Graphs Using Big Data",
"doi": null,
"abstractUrl": "/proceedings-article/bigdatasecurity-hpsc-ids/2016/07502276/12OmNrYCXFR",
"parentPublication": {
"id": "proceedings/bigdatasecurity-hpsc-ids/2016/2403/0",
"title": "2016 IEEE 2nd International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing (HPSC) and IEEE International Conference on Intelligent Data and Security (IDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900030",
"title": "Visualization of Graphs with Associated Timeseries Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900030/12OmNwDj0YL",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2012/2719/0/06337156",
"title": "Finding What Changes for Two Graphs Constructed from Different Time Intervals",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2012/06337156/12OmNzAoi0P",
"parentPublication": {
"id": "proceedings/iiai-aai/2012/2719/0",
"title": "2012 IIAI International Conference on Advanced Applied Informatics (IIAIAAI 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061164",
"title": "behaviorism: a framework for dynamic data visualization",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061164/13rRUEgs2to",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/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": "proceedings/iv/2020/9134/0/913400a248",
"title": "Time-Aligned Edge Plots for Dynamic Graph Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a248/1rSR9vG2u4w",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyoSbiB",
"title": "2016 European Intelligence and Security Informatics Conference (EISIC)",
"acronym": "eisic",
"groupId": "1800545",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyQYtcg",
"doi": "10.1109/EISIC.2016.016",
"title": "Providing Extensibility to Threat Modelling in Cloud-COVER’s Underlying Analysis Model",
"normalizedTitle": "Providing Extensibility to Threat Modelling in Cloud-COVER’s Underlying Analysis Model",
"abstract": "Cloud-COVER is a threat modelling tool allowing users to analyse the way in which threats propagate within their cloud computing deployment. We present extensibility features which allow users to input their own threats, attributes, and connection permissions to Cloud-COVER. This allows users toshift the perspective of the tool to one which better suits their circumstances. By modelling their deployments using different viewpoints, users can ensure a more thorough threat modelling process and can identify threats which might not be identified using Cloud-COVER's default mode. We present examples of how extensibility can be applied to each of three inputs, and how users need to think about the interaction of attributes and permissions to make good use of this feature.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Cloud-COVER is a threat modelling tool allowing users to analyse the way in which threats propagate within their cloud computing deployment. We present extensibility features which allow users to input their own threats, attributes, and connection permissions to Cloud-COVER. This allows users toshift the perspective of the tool to one which better suits their circumstances. By modelling their deployments using different viewpoints, users can ensure a more thorough threat modelling process and can identify threats which might not be identified using Cloud-COVER's default mode. We present examples of how extensibility can be applied to each of three inputs, and how users need to think about the interaction of attributes and permissions to make good use of this feature.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Cloud-COVER is a threat modelling tool allowing users to analyse the way in which threats propagate within their cloud computing deployment. We present extensibility features which allow users to input their own threats, attributes, and connection permissions to Cloud-COVER. This allows users toshift the perspective of the tool to one which better suits their circumstances. By modelling their deployments using different viewpoints, users can ensure a more thorough threat modelling process and can identify threats which might not be identified using Cloud-COVER's default mode. We present examples of how extensibility can be applied to each of three inputs, and how users need to think about the interaction of attributes and permissions to make good use of this feature.",
"fno": "07870189",
"keywords": [
"Cloud Computing",
"Data Analysis",
"Security Of Data",
"Extensibility",
"Threat Modelling",
"Cloud COVER",
"Analysis Model",
"Cloud Computing Deployment",
"Cloud Computing",
"Computational Modeling",
"Data Security",
"Cost Accounting",
"Analytical Models",
"Joining Processes"
],
"authors": [
{
"affiliation": null,
"fullName": "Mustafa Aydin",
"givenName": "Mustafa",
"surname": "Aydin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jeremy Jacob",
"givenName": "Jeremy",
"surname": "Jacob",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "eisic",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-08-01T00:00:00",
"pubType": "proceedings",
"pages": "45-51",
"year": "2016",
"issn": null,
"isbn": "978-1-5090-2857-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07870188",
"articleId": "12OmNwHhoLn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07870190",
"articleId": "12OmNxZ2Gkz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/sose/2016/2253/0/2253a066",
"title": "Threat Modeling for Services in Cloud",
"doi": null,
"abstractUrl": "/proceedings-article/sose/2016/2253a066/12OmNAYXWES",
"parentPublication": {
"id": "proceedings/sose/2016/2253/0",
"title": "2016 IEEE Symposium on Service-Oriented System Engineering (SOSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/espre/2015/0107/0/07330163",
"title": "Modelling secure cloud systems based on system requirements",
"doi": null,
"abstractUrl": "/proceedings-article/espre/2015/07330163/12OmNBTJIO0",
"parentPublication": {
"id": "proceedings/espre/2015/0107/0",
"title": "2015 IEEE 2nd Workshop on Evolving Security and Privacy Requirements Engineering (ESPRE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ic2e/2018/5008/0/500801a278",
"title": "Threat Modeling and Analysis for the Cloud Ecosystem",
"doi": null,
"abstractUrl": "/proceedings-article/ic2e/2018/500801a278/12OmNrAMET3",
"parentPublication": {
"id": "proceedings/ic2e/2018/5008/0",
"title": "2018 IEEE International Conference on Cloud Engineering (IC2E)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cia/2015/7771/0/07400864",
"title": "A Framework for Optimizing Resource Allocation in Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/cia/2015/07400864/12OmNvAAtle",
"parentPublication": {
"id": "proceedings/cia/2015/7771/0",
"title": "2015 3rd International Conference on Computer, Information and Application (CIA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cec/2011/4535/0/4535a145",
"title": "Computer Aided Threat Identification",
"doi": null,
"abstractUrl": "/proceedings-article/cec/2011/4535a145/12OmNwdbVdL",
"parentPublication": {
"id": "proceedings/cec/2011/4535/0",
"title": "2011 IEEE 13th Conference on Commerce and Enterprise Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2016/5670/0/5670f200",
"title": "Connectivity is Ubiquitous, But is It Beneficial? A Numerical Approach to Assess Individuals' Valuations of Smart Home Systems",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670f200/12OmNxGAL5E",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/2013/02/tcc2013020158",
"title": "Dynamic Cloud Pricing for Revenue Maximization",
"doi": null,
"abstractUrl": "/journal/cc/2013/02/tcc2013020158/13rRUwhpBSe",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2023/02/09973285",
"title": "Data Privacy Threat Modelling for Autonomous Systems: A Survey From the GDPR's Perspective",
"doi": null,
"abstractUrl": "/journal/bd/2023/02/09973285/1IUAunZjMyI",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icws/2020/8786/0/878600a159",
"title": "Multi-Agent Deep Reinforcement Learning Based Pricing Strategy for Competing Cloud Platforms in the Evolutionary Market",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2020/878600a159/1pLJGf6jBPG",
"parentPublication": {
"id": "proceedings/icws/2020/8786/0",
"title": "2020 IEEE International Conference on Web Services (ICWS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdatase/2020/1114/0/111400a122",
"title": "A Threat Modelling Approach to Analyze and Mitigate Botnet Attacks in Smart Home Use Case",
"doi": null,
"abstractUrl": "/proceedings-article/bigdatase/2020/111400a122/1r3p8nmZo6k",
"parentPublication": {
"id": "proceedings/bigdatase/2020/1114/0",
"title": "2020 IEEE 14th International Conference on Big Data Science and Engineering (BigDataSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1BmEezmpGrm",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"acronym": "iccv",
"groupId": "1000149",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1BmKKdEwsda",
"doi": "10.1109/ICCV48922.2021.01193",
"title": "Learning Attribute-driven Disentangled Representations for Interactive Fashion Retrieval",
"normalizedTitle": "Learning Attribute-driven Disentangled Representations for Interactive Fashion Retrieval",
"abstract": "Interactive retrieval for online fashion shopping provides the ability to change image retrieval results according to the user feedback. One common problem in interactive retrieval is that a specific user interaction (e.g., changing the color of a T-shirt) causes other aspects to change inadvertently (e.g., the retrieved item has a sleeve type different than the query). This is a consequence of existing methods learning visual representations that are semantically entangled in the embedding space, which limits the controllability of the retrieved results. We propose to leverage on the semantics of visual attributes to train convolutional networks that learn attribute-specific subspaces for each attribute to obtain disentangled representations. Thus operations, such as swapping out a particular attribute value for another, impact the attribute at hand and leave others untouched. We show that our model can be tailored to deal with different retrieval tasks while maintaining its disentanglement property. We obtain state-of-the-art performance on three interactive fashion retrieval tasks: attribute manipulation retrieval, conditional similarity retrieval, and outfit complementary item retrieval. Code and models are publicly available<sup>1</sup>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Interactive retrieval for online fashion shopping provides the ability to change image retrieval results according to the user feedback. One common problem in interactive retrieval is that a specific user interaction (e.g., changing the color of a T-shirt) causes other aspects to change inadvertently (e.g., the retrieved item has a sleeve type different than the query). This is a consequence of existing methods learning visual representations that are semantically entangled in the embedding space, which limits the controllability of the retrieved results. We propose to leverage on the semantics of visual attributes to train convolutional networks that learn attribute-specific subspaces for each attribute to obtain disentangled representations. Thus operations, such as swapping out a particular attribute value for another, impact the attribute at hand and leave others untouched. We show that our model can be tailored to deal with different retrieval tasks while maintaining its disentanglement property. We obtain state-of-the-art performance on three interactive fashion retrieval tasks: attribute manipulation retrieval, conditional similarity retrieval, and outfit complementary item retrieval. Code and models are publicly available<sup>1</sup>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Interactive retrieval for online fashion shopping provides the ability to change image retrieval results according to the user feedback. One common problem in interactive retrieval is that a specific user interaction (e.g., changing the color of a T-shirt) causes other aspects to change inadvertently (e.g., the retrieved item has a sleeve type different than the query). This is a consequence of existing methods learning visual representations that are semantically entangled in the embedding space, which limits the controllability of the retrieved results. We propose to leverage on the semantics of visual attributes to train convolutional networks that learn attribute-specific subspaces for each attribute to obtain disentangled representations. Thus operations, such as swapping out a particular attribute value for another, impact the attribute at hand and leave others untouched. We show that our model can be tailored to deal with different retrieval tasks while maintaining its disentanglement property. We obtain state-of-the-art performance on three interactive fashion retrieval tasks: attribute manipulation retrieval, conditional similarity retrieval, and outfit complementary item retrieval. Code and models are publicly available1.",
"fno": "281200m2127",
"keywords": [
"Convolutional Codes",
"Visualization",
"Computer Vision",
"Image Color Analysis",
"Computational Modeling",
"Semantics",
"Image Retrieval",
"Image And Video Retrieval",
"Representation Learning",
"Vision Applications And Systems"
],
"authors": [
{
"affiliation": "Aalto University",
"fullName": "Yuxin Hou",
"givenName": "Yuxin",
"surname": "Hou",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Amazon",
"fullName": "Eleonora Vig",
"givenName": "Eleonora",
"surname": "Vig",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Amazon",
"fullName": "Michael Donoser",
"givenName": "Michael",
"surname": "Donoser",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Amazon",
"fullName": "Loris Bazzani",
"givenName": "Loris",
"surname": "Bazzani",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-10-01T00:00:00",
"pubType": "proceedings",
"pages": "12127-12137",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-2812-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "281200m2116",
"articleId": "1BmFVyYu2vC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "281200m2138",
"articleId": "1BmIN4kBgJ2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2015/8391/0/8391b062",
"title": "Cross-Domain Image Retrieval with a Dual Attribute-Aware Ranking Network",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391b062/12OmNAXPy4Q",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2018/4886/0/488601a557",
"title": "Learning Disentangled Multimodal Representations for the Fashion Domain",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2018/488601a557/12OmNCwCLoW",
"parentPublication": {
"id": "proceedings/wacv/2018/4886/0",
"title": "2018 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2018/4886/0/488601b671",
"title": "Efficient Multi-attribute Similarity Learning Towards Attribute-Based Fashion Search",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2018/488601b671/12OmNyRg4fV",
"parentPublication": {
"id": "proceedings/wacv/2018/4886/0",
"title": "2018 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457g156",
"title": "Memory-Augmented Attribute Manipulation Networks for Interactive Fashion Search",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457g156/12OmNzXFoGR",
"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/2018/6420/0/642000h708",
"title": "Learning Attribute Representations with Localization for Flexible Fashion Search",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000h708/17D45WXIkDT",
"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/281200m2096",
"title": "Face Image Retrieval with Attribute Manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200m2096/1BmLms5zisU",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2022/8739/0/873900c282",
"title": "DAtRNet: Disentangling Fashion Attribute Embedding for Substitute Item Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2022/873900c282/1G56eIEh1NC",
"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/icme/2022/8563/0/09859953",
"title": "Attribute-Guided Fashion Image Retrieval by Iterative Similarity Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2022/09859953/1G9DQNOnfsQ",
"parentPublication": {
"id": "proceedings/icme/2022/8563/0",
"title": "2022 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2022/9062/0/09955640",
"title": "Convolutional Attribute Mask with Two-step Attention for Fashion Image Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09955640/1IHpgX3wSIM",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300k0540",
"title": "Attribute Manipulation Generative Adversarial Networks for Fashion Images",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300k0540/1hVloNEYY8w",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqH9hnp",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAL3BbY",
"doi": "10.1109/CVPR.2016.569",
"title": "Trace Quotient Meets Sparsity: A Method for Learning Low Dimensional Image Representations",
"normalizedTitle": "Trace Quotient Meets Sparsity: A Method for Learning Low Dimensional Image Representations",
"abstract": "This paper presents an algorithm that allows to learn low dimensional representations of images in an unsupervised manner. The core idea is to combine two criteria that play important roles in unsupervised representation learning, namely sparsity and trace quotient. The former is known to be a convenient tool to identify underlying factors, and the latter is known as a disentanglement of underlying discriminative factors. In this work, we develop a generic cost function for learning jointly a sparsifying dictionary and a dimensionality reduction transformation. It leads to several counterparts of classic low dimensional representation methods, such as Principal Component Analysis, Local Linear Embedding, and Laplacian Eigenmap. Our proposed optimisation algorithm leverages the efficiency of geometric optimisation on Riemannian manifolds and a closed form solution to the elastic net problem.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents an algorithm that allows to learn low dimensional representations of images in an unsupervised manner. The core idea is to combine two criteria that play important roles in unsupervised representation learning, namely sparsity and trace quotient. The former is known to be a convenient tool to identify underlying factors, and the latter is known as a disentanglement of underlying discriminative factors. In this work, we develop a generic cost function for learning jointly a sparsifying dictionary and a dimensionality reduction transformation. It leads to several counterparts of classic low dimensional representation methods, such as Principal Component Analysis, Local Linear Embedding, and Laplacian Eigenmap. Our proposed optimisation algorithm leverages the efficiency of geometric optimisation on Riemannian manifolds and a closed form solution to the elastic net problem.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents an algorithm that allows to learn low dimensional representations of images in an unsupervised manner. The core idea is to combine two criteria that play important roles in unsupervised representation learning, namely sparsity and trace quotient. The former is known to be a convenient tool to identify underlying factors, and the latter is known as a disentanglement of underlying discriminative factors. In this work, we develop a generic cost function for learning jointly a sparsifying dictionary and a dimensionality reduction transformation. It leads to several counterparts of classic low dimensional representation methods, such as Principal Component Analysis, Local Linear Embedding, and Laplacian Eigenmap. Our proposed optimisation algorithm leverages the efficiency of geometric optimisation on Riemannian manifolds and a closed form solution to the elastic net problem.",
"fno": "8851f268",
"keywords": [
"Dictionaries",
"Principal Component Analysis",
"Manifolds",
"Cost Function",
"Unsupervised Learning",
"Encoding"
],
"authors": [
{
"affiliation": null,
"fullName": "Xian Wei",
"givenName": "Xian",
"surname": "Wei",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Hao Shen",
"givenName": "Hao",
"surname": "Shen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Martin Kleinsteuber",
"givenName": "Martin",
"surname": "Kleinsteuber",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-06-01T00:00:00",
"pubType": "proceedings",
"pages": "5268-5277",
"year": "2016",
"issn": "1063-6919",
"isbn": "978-1-4673-8851-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "8851f258",
"articleId": "12OmNzC5Tix",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "8851f278",
"articleId": "12OmNAkniVh",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccvw/2017/1034/0/1034b784",
"title": "Learning Robust Representations for Computer Vision",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034b784/12OmNBZHij0",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032e345",
"title": "Unsupervised Learning from Video to Detect Foreground Objects in Single Images",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032e345/12OmNrJRPf6",
"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/8391a325",
"title": "Naive Bayes Super-Resolution Forest",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391a325/12OmNwHQB49",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aipr/2012/4558/0/06528190",
"title": "Unsupervised land cover classification in multispectral imagery with sparse representations on learned dictionaries",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2012/06528190/12OmNx4yvw0",
"parentPublication": {
"id": "proceedings/aipr/2012/4558/0",
"title": "2012 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209b597",
"title": "Discriminative Partition Sparsity Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209b597/12OmNxGSmiM",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457a673",
"title": "Additive Component Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457a673/12OmNzaQobD",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/12/07118213",
"title": "Unsupervised Ranking of Multi-Attribute Objects Based on Principal Curves",
"doi": null,
"abstractUrl": "/journal/tk/2015/12/07118213/13rRUNvyali",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2020/12/08731748",
"title": "Trace Quotient with Sparsity Priors for Learning Low Dimensional Image Representations",
"doi": null,
"abstractUrl": "/journal/tp/2020/12/08731748/1aCbDncNZqE",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2020/01/08854126",
"title": "Decision Making in IoT Environment through Unsupervised Learning",
"doi": null,
"abstractUrl": "/magazine/ex/2020/01/08854126/1dM2heQRhQc",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09543512",
"title": "Unsupervised Dimensionality Reduction Based on Fusing Multiple Clustering Results",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09543512/1x4UGJ56Qpy",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1EVihIUabss",
"title": "2021 Ninth International Conference on Advanced Cloud and Big Data (CBD)",
"acronym": "cbd",
"groupId": "1803748",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1EViof2Z1vy",
"doi": "10.1109/CBD54617.2021.00025",
"title": "Label Enhancement with Sample Correlations via Low-dimensional Feature Representation",
"normalizedTitle": "Label Enhancement with Sample Correlations via Low-dimensional Feature Representation",
"abstract": "In this paper we propose a novel label enhancement (LE) algorithm called Label Enhancement with sample correlations via Low-dimensional Feature Representation (LE-LFR) in order to solve the problem that many training sets cannot use label distribution learning (LDL) algorithms because they only contain logical labels rather than label distributions. Unlike most existing two-stage methods, LE-LFR method is a one-stage method and the sample correlations are mined comprehensively. In detail, we obtain the low-dimensional feature representation via a manifold learning process firstly and then we get the label distribution during the intermediate procedure via the label propagation process. The sample correlation both in the label space and low-dimensional feature space is considered during the process. Finally, the enhanced maximum entropy model is established as objective function, and the predicted label distribution is obtained. By using the rich label information in low-dimensional feature space obtained in the first step and the label distribution information estimated in the second step, the enhanced maximum entropy prediction model is trained through gradient descent iterative optimization, and the label distribution prediction parameters with higher accuracy are obtained. Experimental results on fourteen real-world datasets show superior advantages of LE-LFR against several existing LE algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper we propose a novel label enhancement (LE) algorithm called Label Enhancement with sample correlations via Low-dimensional Feature Representation (LE-LFR) in order to solve the problem that many training sets cannot use label distribution learning (LDL) algorithms because they only contain logical labels rather than label distributions. Unlike most existing two-stage methods, LE-LFR method is a one-stage method and the sample correlations are mined comprehensively. In detail, we obtain the low-dimensional feature representation via a manifold learning process firstly and then we get the label distribution during the intermediate procedure via the label propagation process. The sample correlation both in the label space and low-dimensional feature space is considered during the process. Finally, the enhanced maximum entropy model is established as objective function, and the predicted label distribution is obtained. By using the rich label information in low-dimensional feature space obtained in the first step and the label distribution information estimated in the second step, the enhanced maximum entropy prediction model is trained through gradient descent iterative optimization, and the label distribution prediction parameters with higher accuracy are obtained. Experimental results on fourteen real-world datasets show superior advantages of LE-LFR against several existing LE algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper we propose a novel label enhancement (LE) algorithm called Label Enhancement with sample correlations via Low-dimensional Feature Representation (LE-LFR) in order to solve the problem that many training sets cannot use label distribution learning (LDL) algorithms because they only contain logical labels rather than label distributions. Unlike most existing two-stage methods, LE-LFR method is a one-stage method and the sample correlations are mined comprehensively. In detail, we obtain the low-dimensional feature representation via a manifold learning process firstly and then we get the label distribution during the intermediate procedure via the label propagation process. The sample correlation both in the label space and low-dimensional feature space is considered during the process. Finally, the enhanced maximum entropy model is established as objective function, and the predicted label distribution is obtained. By using the rich label information in low-dimensional feature space obtained in the first step and the label distribution information estimated in the second step, the enhanced maximum entropy prediction model is trained through gradient descent iterative optimization, and the label distribution prediction parameters with higher accuracy are obtained. Experimental results on fourteen real-world datasets show superior advantages of LE-LFR against several existing LE algorithms.",
"fno": "074500a095",
"keywords": [
"Feature Extraction",
"Gradient Methods",
"Iterative Methods",
"Learning Artificial Intelligence",
"Maximum Entropy Methods",
"Label Distribution Information",
"Label Distribution Prediction Parameters",
"Sample Correlation",
"Low Dimensional Feature Representation",
"Label Enhancement Algorithm",
"Label Distribution Learning Algorithms",
"Logical Labels",
"LE LFR Method",
"Label Propagation Process",
"Maximum Entropy Prediction Model",
"Gradient Descent Iterative Optimization",
"Training",
"Manifolds",
"Correlation",
"Predictive Models",
"Prediction Algorithms",
"Linear Programming",
"Entropy",
"Label Enhancement",
"Label Distribution Learning",
"Manifold Learning"
],
"authors": [
{
"affiliation": "Nanjing Normal University,School of Computer and Electronic Information,Nanjing,China",
"fullName": "Xiaoqian Zeng",
"givenName": "Xiaoqian",
"surname": "Zeng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Nanjing Normal University,School of Computer and Electronic Information,Nanjing,China",
"fullName": "Zhen Xu",
"givenName": "Zhen",
"surname": "Xu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Nanjing Normal University,School of Computer and Electronic Information,Nanjing,China",
"fullName": "Chao Tan",
"givenName": "Chao",
"surname": "Tan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Nanjing Normal University,School of Computer and Electronic Information,Nanjing,China",
"fullName": "Genlin Ji",
"givenName": "Genlin",
"surname": "Ji",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cbd",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-03-01T00:00:00",
"pubType": "proceedings",
"pages": "95-100",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-0745-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "074500a089",
"articleId": "1EViq6HXkxq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "074500a101",
"articleId": "1EVimqd9dJu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icbk/2021/3858/0/385800a086",
"title": "Label Distribution Learning by Exploiting Feature-Label Correlations Locally",
"doi": null,
"abstractUrl": "/proceedings-article/icbk/2021/385800a086/1A9X0B14xnq",
"parentPublication": {
"id": "proceedings/icbk/2021/3858/0",
"title": "2021 IEEE International Conference on Big Knowledge (ICBK)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/05/09875104",
"title": "Variational Label Enhancement",
"doi": null,
"abstractUrl": "/journal/tp/2023/05/09875104/1GlbUwSqmLS",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbd/2022/0971/0/097100a116",
"title": "Label Enhancement with Sample Correlation via Sparse Representation",
"doi": null,
"abstractUrl": "/proceedings-article/cbd/2022/097100a116/1KdZhjYjh0Q",
"parentPublication": {
"id": "proceedings/cbd/2022/0971/0",
"title": "2022 Tenth International Conference on Advanced Cloud and Big Data (CBD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/04/08847453",
"title": "Label Distribution Learning with Label Correlations on Local Samples",
"doi": null,
"abstractUrl": "/journal/tk/2021/04/08847453/1dApRY59TMY",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/04/08868206",
"title": "Label Enhancement for Label Distribution Learning",
"doi": null,
"abstractUrl": "/journal/tk/2021/04/08868206/1e7BW64F2nK",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/11/09340009",
"title": "A Novel Probabilistic Label Enhancement Algorithm for Multi-Label Distribution Learning",
"doi": null,
"abstractUrl": "/journal/tk/2022/11/09340009/1qL4SZMuLKM",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/01/09404874",
"title": "Generalized Label Enhancement With Sample Correlations",
"doi": null,
"abstractUrl": "/journal/tk/2023/01/09404874/1sNm45kvOU0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbd/2020/2313/0/231300a096",
"title": "Label Enhancement Manifold Learning Algorithm for Multi-label Image Classification",
"doi": null,
"abstractUrl": "/proceedings-article/cbd/2020/231300a096/1sZ38nVv3A4",
"parentPublication": {
"id": "proceedings/cbd/2020/2313/0",
"title": "2020 Eighth International Conference on Advanced Cloud and Big Data (CBD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/02/09465741",
"title": "Fast Label Enhancement for Label Distribution Learning",
"doi": null,
"abstractUrl": "/journal/tk/2023/02/09465741/1uIR9VwB7Xy",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/02/09468338",
"title": "Label Enhancement by Maintaining Positive and Negative Label Relation",
"doi": null,
"abstractUrl": "/journal/tk/2023/02/09468338/1uPuMklY24g",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1G55WEFExd6",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"acronym": "cvprw",
"groupId": "1001809",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1G56lOg6kww",
"doi": "10.1109/CVPRW56347.2022.00534",
"title": "Analysis of Temporal Tensor Datasets on Product Grassmann Manifold",
"normalizedTitle": "Analysis of Temporal Tensor Datasets on Product Grassmann Manifold",
"abstract": "Growing abundance of multi-dimensional data creates a need for efficient data exploration and analysis. In this paper, we address this need by tackling the task of tensor dataset visualization and clustering, as tensors are a natural form of multi-dimensional data. Previous work has shown that representing individual tensor modes via respective linear subspaces and unifying them on the product Grassmann manifold (PGM) is an effective and memory-efficient way of representation. However, such representation may lead to loss of valuable temporal information. To address this issue, we model temporal tensor modes with a Hankel-like matrix, preserving sequence information and encoding it with a linear subspace, fully compatible with PGM. Unifying regular tensor modes and Hankel-like representation of regular tensor modes then enriches representation on the PGM, with minimal increase in computational complexity. By relying on geodesic distance on the manifold, we facilitate analysis of multi-dimensional datasets in two ways: 1) by enabling straightforward visualizations using algorithms such as t-SNE; and 2) by fostering clustering of data using distance- or similarity-based methods such as spectral clustering. We evaluate our approach on hand gesture and action recognition datasets as exemplars of temporal tensor datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Growing abundance of multi-dimensional data creates a need for efficient data exploration and analysis. In this paper, we address this need by tackling the task of tensor dataset visualization and clustering, as tensors are a natural form of multi-dimensional data. Previous work has shown that representing individual tensor modes via respective linear subspaces and unifying them on the product Grassmann manifold (PGM) is an effective and memory-efficient way of representation. However, such representation may lead to loss of valuable temporal information. To address this issue, we model temporal tensor modes with a Hankel-like matrix, preserving sequence information and encoding it with a linear subspace, fully compatible with PGM. Unifying regular tensor modes and Hankel-like representation of regular tensor modes then enriches representation on the PGM, with minimal increase in computational complexity. By relying on geodesic distance on the manifold, we facilitate analysis of multi-dimensional datasets in two ways: 1) by enabling straightforward visualizations using algorithms such as t-SNE; and 2) by fostering clustering of data using distance- or similarity-based methods such as spectral clustering. We evaluate our approach on hand gesture and action recognition datasets as exemplars of temporal tensor datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Growing abundance of multi-dimensional data creates a need for efficient data exploration and analysis. In this paper, we address this need by tackling the task of tensor dataset visualization and clustering, as tensors are a natural form of multi-dimensional data. Previous work has shown that representing individual tensor modes via respective linear subspaces and unifying them on the product Grassmann manifold (PGM) is an effective and memory-efficient way of representation. However, such representation may lead to loss of valuable temporal information. To address this issue, we model temporal tensor modes with a Hankel-like matrix, preserving sequence information and encoding it with a linear subspace, fully compatible with PGM. Unifying regular tensor modes and Hankel-like representation of regular tensor modes then enriches representation on the PGM, with minimal increase in computational complexity. By relying on geodesic distance on the manifold, we facilitate analysis of multi-dimensional datasets in two ways: 1) by enabling straightforward visualizations using algorithms such as t-SNE; and 2) by fostering clustering of data using distance- or similarity-based methods such as spectral clustering. We evaluate our approach on hand gesture and action recognition datasets as exemplars of temporal tensor datasets.",
"fno": "873900e868",
"keywords": [
"Approximation Theory",
"Computational Complexity",
"Data Mining",
"Data Visualisation",
"Feature Extraction",
"Gesture Recognition",
"Image Motion Analysis",
"Pattern Clustering",
"Tensors",
"Temporal Tensor Datasets",
"Product Grassmann Manifold",
"Growing Abundance",
"Multidimensional Data",
"Efficient Data Exploration",
"Tensor Dataset Visualization",
"Individual Tensor Modes",
"Respective Linear Subspaces",
"PGM",
"Effective Memory Efficient",
"Valuable Temporal Information",
"Model Temporal Tensor Modes",
"Linear Subspace",
"Unifying Regular Tensor Modes",
"Multidimensional Datasets",
"Hand Gesture",
"Action Recognition Datasets",
"Manifolds",
"Measurement",
"Geometry",
"Tensors",
"Data Visualization",
"Pattern Recognition",
"Gyroscopes"
],
"authors": [
{
"affiliation": "University of Tsukuba,Tsukuba,Japan",
"fullName": "Bojan Batalo",
"givenName": "Bojan",
"surname": "Batalo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "AIST,Tokyo,Japan",
"fullName": "Lincon S. Souza",
"givenName": "Lincon S.",
"surname": "Souza",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "AIST,Tsukuba,Japan",
"fullName": "Bernardo B. Gatto",
"givenName": "Bernardo B.",
"surname": "Gatto",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Tsukuba,Tsukuba,Japan",
"fullName": "Naoya Sogi",
"givenName": "Naoya",
"surname": "Sogi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Tsukuba,Tsukuba,Japan",
"fullName": "Kazuhiro Fukui",
"givenName": "Kazuhiro",
"surname": "Fukui",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvprw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-06-01T00:00:00",
"pubType": "proceedings",
"pages": "4868-4876",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-8739-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "873900e859",
"articleId": "1G55Z2l2yA0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "873900e877",
"articleId": "1G56zX0txJu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2002/7498/0/7498zheng",
"title": "Volume Deformation For Tensor Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498zheng/12OmNxA3YXe",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660070",
"title": "Topological Structures of 3D Tensor Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660070/12OmNxeusY2",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/03/07286850",
"title": "Feature Surfaces in Symmetric Tensor Fields Based on Eigenvalue Manifold",
"doi": null,
"abstractUrl": "/journal/tg/2016/03/07286850/13rRUwhpBE8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2016/03/07182334",
"title": "Heterogeneous Tensor Decomposition for Clustering via Manifold Optimization",
"doi": null,
"abstractUrl": "/journal/tp/2016/03/07182334/13rRUygT7u3",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2021/3902/0/09671938",
"title": "Tensor-based Complementary Product Recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2021/09671938/1A8gUWHDH4A",
"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/5555/01/09968173",
"title": "Sparse Tensor-Based Multiscale Representation for Point Cloud Geometry Compression",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/09968173/1IKD7VXXRhm",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2023/02/09976292",
"title": "Neighbor Graph Based Tensor Recovery For Accurate Internet Anomaly Detection",
"doi": null,
"abstractUrl": "/journal/td/2023/02/09976292/1IWfOVkYBBS",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/08/09354598",
"title": "Low Rank Tensor Completion With Poisson Observations",
"doi": null,
"abstractUrl": "/journal/tp/2022/08/09354598/1reXhJWVBqE",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2020/9234/0/923400a135",
"title": "Tensor Network for Image Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2020/923400a135/1uGXYZ0LK7K",
"parentPublication": {
"id": "proceedings/icdh/2020/9234/0",
"title": "2020 8th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2021/3864/0/09428291",
"title": "Multi-View Learning Via Low-Rank Tensor Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2021/09428291/1uilUJj7nQQ",
"parentPublication": {
"id": "proceedings/icme/2021/3864/0",
"title": "2021 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAYoKmv",
"title": "2008 IEEE 24th International Conference on Data Engineering Workshop",
"acronym": "icdew",
"groupId": "1001384",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNASraR9",
"doi": "10.1109/ICDEW.2008.4498313",
"title": "Skyline-join in distributed databases",
"normalizedTitle": "Skyline-join in distributed databases",
"abstract": "The database research community has recently recognized the usefulness of skyline query. As an extension of existing database operator, the skyline query is valuable for multi-criteria decision making. However, current research tends to assume that the skyline operator is applied to one table which is not true for many applications on Web databases. In Web databases, tables are distributed in different sites, and a skyline query may involve attributes of multiple tables. In this paper, we address the problem of processing skyline queries on multiple tables in a distributed environment. We call the new operator skyline-join, as it is a hybrid of skyline and join operations. We propose two efficient approaches to process skyline-join queries which can significantly reduce the communication cost and processing time. Experiments are conducted and results show that our approaches are efficient for distributed skyline-join queries.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The database research community has recently recognized the usefulness of skyline query. As an extension of existing database operator, the skyline query is valuable for multi-criteria decision making. However, current research tends to assume that the skyline operator is applied to one table which is not true for many applications on Web databases. In Web databases, tables are distributed in different sites, and a skyline query may involve attributes of multiple tables. In this paper, we address the problem of processing skyline queries on multiple tables in a distributed environment. We call the new operator skyline-join, as it is a hybrid of skyline and join operations. We propose two efficient approaches to process skyline-join queries which can significantly reduce the communication cost and processing time. Experiments are conducted and results show that our approaches are efficient for distributed skyline-join queries.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The database research community has recently recognized the usefulness of skyline query. As an extension of existing database operator, the skyline query is valuable for multi-criteria decision making. However, current research tends to assume that the skyline operator is applied to one table which is not true for many applications on Web databases. In Web databases, tables are distributed in different sites, and a skyline query may involve attributes of multiple tables. In this paper, we address the problem of processing skyline queries on multiple tables in a distributed environment. We call the new operator skyline-join, as it is a hybrid of skyline and join operations. We propose two efficient approaches to process skyline-join queries which can significantly reduce the communication cost and processing time. Experiments are conducted and results show that our approaches are efficient for distributed skyline-join queries.",
"fno": "04498313",
"keywords": [
"Distributed Databases",
"Query Processing",
"Skyline Join Query Operator",
"Distributed Database",
"Multicriteria Decision Making",
"Web Database",
"Database Table",
"Distributed Databases",
"Iterative Algorithms",
"Sorting",
"Decision Making",
"Query Processing",
"Sun",
"Computer Science",
"Distributed Computing",
"Costs",
"Educational Institutions"
],
"authors": [
{
"affiliation": "Department of Computer Science and Technology, Harbin Institute of Technology, China",
"fullName": "Dalie Sun",
"givenName": "Dalie",
"surname": "Sun",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Computing, National University of Singapore, Singapore",
"fullName": "Sai Wu",
"givenName": null,
"surname": "Sai Wu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science and Technology, Harbin Institute of Technology, China",
"fullName": "Jianzhong Li",
"givenName": null,
"surname": "Jianzhong Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Computing, National University of Singapore, Singapore",
"fullName": "Anthony K. H. Tung",
"givenName": "Anthony K. H.",
"surname": "Tung",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icdew",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-04-01T00:00:00",
"pubType": "proceedings",
"pages": "",
"year": "2008",
"issn": null,
"isbn": "978-1-4244-2161-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04498323",
"articleId": "12OmNzcxZp8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04498324",
"articleId": "12OmNvSKNC2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/compsac/2013/4986/0/4986a084",
"title": "Parallelizing Probabilistic Streaming Skyline Operator in Cloud Computing Environments",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2013/4986a084/12OmNApcuBS",
"parentPublication": {
"id": "proceedings/compsac/2013/4986/0",
"title": "2013 IEEE 37th Annual Computer Software and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2010/4059/0/4059a149",
"title": "Efficient and Progressive Algorithms for Distributed Skyline Queries over Uncertain Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2010/4059a149/12OmNs0kyD1",
"parentPublication": {
"id": "proceedings/icdcs/2010/4059/0",
"title": "2010 IEEE 30th International Conference on Distributed Computing Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2017/6543/0/6543a099",
"title": "K-Dominant Skyline Join Queries: Extending the Join Paradigm to K-Dominant Skylines",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2017/6543a099/12OmNyUFg2g",
"parentPublication": {
"id": "proceedings/icde/2017/6543/0",
"title": "2017 IEEE 33rd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2013/4909/0/06544891",
"title": "Layered processing of skyline-window-join (SWJ) queries using iteration-fabric",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2013/06544891/12OmNyugyR4",
"parentPublication": {
"id": "proceedings/icde/2013/4909/0",
"title": "2013 29th IEEE International Conference on Data Engineering (ICDE 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2007/0802/0/04221782",
"title": "The Multi-Relational Skyline Operator",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2007/04221782/12OmNzIUg38",
"parentPublication": {
"id": "proceedings/icde/2007/0802/0",
"title": "2007 IEEE 23rd International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wisa/2010/4193/0/4193a003",
"title": "Location-Dependent Skyline Query Processing in Mobile Databases",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2010/4193a003/12OmNzsrwcO",
"parentPublication": {
"id": "proceedings/wisa/2010/4193/0",
"title": "Web Information Systems and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2013/04/ttk2013040945",
"title": "U-Skyline: A New Skyline Query for Uncertain Databases",
"doi": null,
"abstractUrl": "/journal/tk/2013/04/ttk2013040945/13rRUwIF6lv",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2000/06/k0920",
"title": "Exploiting Spatial Indexes for Semijoin-Based Join Processing in Distributed Spatial Databases",
"doi": null,
"abstractUrl": "/journal/tk/2000/06/k0920/13rRUwghd9n",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2011/02/ttk2011020204",
"title": "Constrained Skyline Query Processing against Distributed Data Sites",
"doi": null,
"abstractUrl": "/journal/tk/2011/02/ttk2011020204/13rRUxBa5nE",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2020/07/08663344",
"title": "Top-<italic>k</italic> Dominating Queries on Skyline Groups",
"doi": null,
"abstractUrl": "/journal/tk/2020/07/08663344/18exlaKcvHq",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyQYteR",
"title": "2010 International Conference on Information Science and Applications",
"acronym": "icisa",
"groupId": "1800053",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNC0guzl",
"doi": "10.1109/ICISA.2010.5480364",
"title": "Extended k-dominant Skyline in High Dimensional Space",
"normalizedTitle": "Extended k-dominant Skyline in High Dimensional Space",
"abstract": "Skyline queries have recently attracted a lot of attention for its intuitive query formulation. However, it retrieves too many objects, especially for high-dimensional data. To solve this problem, k-dominant skyline queries have been introduced recently, which can reduce the number of retrieved objects by relaxing the definition of dominance. However, sometimes, a k- dominant skyline query retrieves too few objects to analyze. In this paper, we extend the notion of k-domination by defining extended k-dominant skyline, which retrieves neither too many nor too few objects. We then develop a novel algorithm for extended k-dominant skyline computation. Our extensive evaluation results validate the effectiveness and efficiency of the proposed algorithm on both real-life and synthetic datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Skyline queries have recently attracted a lot of attention for its intuitive query formulation. However, it retrieves too many objects, especially for high-dimensional data. To solve this problem, k-dominant skyline queries have been introduced recently, which can reduce the number of retrieved objects by relaxing the definition of dominance. However, sometimes, a k- dominant skyline query retrieves too few objects to analyze. In this paper, we extend the notion of k-domination by defining extended k-dominant skyline, which retrieves neither too many nor too few objects. We then develop a novel algorithm for extended k-dominant skyline computation. Our extensive evaluation results validate the effectiveness and efficiency of the proposed algorithm on both real-life and synthetic datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Skyline queries have recently attracted a lot of attention for its intuitive query formulation. However, it retrieves too many objects, especially for high-dimensional data. To solve this problem, k-dominant skyline queries have been introduced recently, which can reduce the number of retrieved objects by relaxing the definition of dominance. However, sometimes, a k- dominant skyline query retrieves too few objects to analyze. In this paper, we extend the notion of k-domination by defining extended k-dominant skyline, which retrieves neither too many nor too few objects. We then develop a novel algorithm for extended k-dominant skyline computation. Our extensive evaluation results validate the effectiveness and efficiency of the proposed algorithm on both real-life and synthetic datasets.",
"fno": "05480364",
"keywords": [
"Performance Evaluation",
"Query Formulation",
"High Dimensional Space",
"Query Formulation",
"K Dominant Skyline Query",
"Extended K Dominant Skyline Computation",
"Visual Databases",
"Information Retrieval",
"Information Systems",
"Data Visualization",
"Decision Making"
],
"authors": [
{
"affiliation": null,
"fullName": "Md. Anisuzzaman Siddique",
"givenName": "Md. Anisuzzaman",
"surname": "Siddique",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yasuhiko Morimoto",
"givenName": "Yasuhiko",
"surname": "Morimoto",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icisa",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-04-01T00:00:00",
"pubType": "proceedings",
"pages": "1-8",
"year": "2010",
"issn": "2162-9048",
"isbn": "978-1-4244-5942-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05480577",
"articleId": "12OmNzBOhBG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05480261",
"articleId": "12OmNyywxyS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/his/2009/3745/3/3745c289",
"title": "Efficient k-Dominant Skyline Processing in Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/his/2009/3745c289/12OmNB0FxhC",
"parentPublication": {
"id": "proceedings/his/2009/3745/3",
"title": "Hybrid Intelligent Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2016/4320/0/07945620",
"title": "Imperfect top-k skyline query with confidence level",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2016/07945620/12OmNvrvj8d",
"parentPublication": {
"id": "proceedings/aiccsa/2016/4320/0",
"title": "2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2017/6543/0/6543a099",
"title": "K-Dominant Skyline Join Queries: Extending the Join Paradigm to K-Dominant Skylines",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2017/6543a099/12OmNyUFg2g",
"parentPublication": {
"id": "proceedings/icde/2017/6543/0",
"title": "2017 IEEE 33rd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2012/4893/0/4893a188",
"title": "Multicore Based Spatialk-dominant Skyline Computation",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2012/4893a188/12OmNz5apHT",
"parentPublication": {
"id": "proceedings/icnc/2012/4893/0",
"title": "2012 Third International Conference on Networking and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dbkda/2010/3981/0/3981a107",
"title": "Efficient Maintenance of k-Dominant Skyline for Frequently Updated Database",
"doi": null,
"abstractUrl": "/proceedings-article/dbkda/2010/3981a107/12OmNzUgcXD",
"parentPublication": {
"id": "proceedings/dbkda/2010/3981/0",
"title": "Advances in Databases, First International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2007/0802/0/04221657",
"title": "Selecting Stars: The k Most Representative Skyline Operator",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2007/04221657/12OmNzYwc9b",
"parentPublication": {
"id": "proceedings/icde/2007/0802/0",
"title": "2007 IEEE 23rd International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2016/08/07439850",
"title": "Discovering the Z_$k$_Z Representative Skyline Over a Sliding Window",
"doi": null,
"abstractUrl": "/journal/tk/2016/08/07439850/13rRUwI5U8n",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08019873",
"title": "SkyLens: Visual Analysis of Skyline on Multi-Dimensional Data",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019873/13rRUygT7n3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2020/07/08663344",
"title": "Top-<italic>k</italic> Dominating Queries on Skyline Groups",
"doi": null,
"abstractUrl": "/journal/tk/2020/07/08663344/18exlaKcvHq",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0/205800b556",
"title": "Parallel k-Dominant Skyline Queries over Uncertain Data Streams with Capability Index",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2019/205800b556/1dPotl3hySs",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0",
"title": "2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNro0Iak",
"title": "Conference, International Asia-Pacific Web",
"acronym": "apweb",
"groupId": "1800048",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNC17hTE",
"doi": "10.1109/APWeb.2010.34",
"title": "Skyline Minimum Vector",
"normalizedTitle": "Skyline Minimum Vector",
"abstract": "The skyline queries are often used in several recommendation applications. Most existing related works have focused on skyline computation in many multidimensional data. However, these works do not consider an interesting query generated from non-skyline point. In this paper, we propose a new query, called skyline minimum vector which finds the minimum vector for making a non-skyline point into a skyline. The skyline minimum vector means the minimum cost for becoming a skyline. We use the Manhattan distance between skyline and query point in order to evaluate the cost. Also, we propose basic algorithm and optimized algorithm for getting skyline minimum vector. The proposed query will be very useful in many decision-making applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The skyline queries are often used in several recommendation applications. Most existing related works have focused on skyline computation in many multidimensional data. However, these works do not consider an interesting query generated from non-skyline point. In this paper, we propose a new query, called skyline minimum vector which finds the minimum vector for making a non-skyline point into a skyline. The skyline minimum vector means the minimum cost for becoming a skyline. We use the Manhattan distance between skyline and query point in order to evaluate the cost. Also, we propose basic algorithm and optimized algorithm for getting skyline minimum vector. The proposed query will be very useful in many decision-making applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The skyline queries are often used in several recommendation applications. Most existing related works have focused on skyline computation in many multidimensional data. However, these works do not consider an interesting query generated from non-skyline point. In this paper, we propose a new query, called skyline minimum vector which finds the minimum vector for making a non-skyline point into a skyline. The skyline minimum vector means the minimum cost for becoming a skyline. We use the Manhattan distance between skyline and query point in order to evaluate the cost. Also, we propose basic algorithm and optimized algorithm for getting skyline minimum vector. The proposed query will be very useful in many decision-making applications.",
"fno": "4012a358",
"keywords": [
"Skyline Queries",
"Multidimensional Data",
"Skyline Minimum Vector"
],
"authors": [
{
"affiliation": null,
"fullName": "Su Min Jang",
"givenName": "Su Min",
"surname": "Jang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Choon Seo Park",
"givenName": "Choon Seo",
"surname": "Park",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jae Soo Yoo",
"givenName": "Jae Soo",
"surname": "Yoo",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "apweb",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-04-01T00:00:00",
"pubType": "proceedings",
"pages": "358-360",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4012-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4012a355",
"articleId": "12OmNBrlPxu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4012a361",
"articleId": "12OmNx19k0x",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/nswctc/2009/3610/1/3610a391",
"title": "Location-Based Skyline Queries in Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/nswctc/2009/3610a391/12OmNAY79eN",
"parentPublication": {
"id": "proceedings/nswctc/2009/3610/1",
"title": "Networks Security, Wireless Communications and Trusted Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2009/3545/0/3545b036",
"title": "Online Interval Skyline Queries on Time Series",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2009/3545b036/12OmNqBbHF6",
"parentPublication": {
"id": "proceedings/icde/2009/3545/0",
"title": "2009 IEEE 25th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2012/4893/0/4893a215",
"title": "Skyline Queries for Spatial Objects: A Method for Selecting Spatial Objects Based on Surrounding Environments",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2012/4893a215/12OmNvnwVlP",
"parentPublication": {
"id": "proceedings/icnc/2012/4893/0",
"title": "2012 Third International Conference on Networking and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2009/3545/0/3545a553",
"title": "Flexible XML Querying Using Skyline Semantics",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2009/3545a553/12OmNweBUGo",
"parentPublication": {
"id": "proceedings/icde/2009/3545/0",
"title": "2009 IEEE 25th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mvhi/2010/4009/0/4009a499",
"title": "Privacy-Preserving Skyline Queries in LBS",
"doi": null,
"abstractUrl": "/proceedings-article/mvhi/2010/4009a499/12OmNxGj9YR",
"parentPublication": {
"id": "proceedings/mvhi/2010/4009/0",
"title": "Machine Vision and Human-machine Interface, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csa/2008/3428/0/3428a353",
"title": "Processing Continuous Skyline Queries in Road Networks",
"doi": null,
"abstractUrl": "/proceedings-article/csa/2008/3428a353/12OmNyfdOYq",
"parentPublication": {
"id": "proceedings/csa/2008/3428/0",
"title": "2008 International Symposium on Computer Science and its Applications (CSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2012/4893/0/4893a188",
"title": "Multicore Based Spatialk-dominant Skyline Computation",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2012/4893a188/12OmNz5apHT",
"parentPublication": {
"id": "proceedings/icnc/2012/4893/0",
"title": "2012 Third International Conference on Networking and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2013/04/ttk2013040835",
"title": "Range-Based Skyline Queries in Mobile Environments",
"doi": null,
"abstractUrl": "/journal/tk/2013/04/ttk2013040835/13rRUNvgziV",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2010/12/ttk2010121694",
"title": "Efficient Routing of Subspace Skyline Queries over Highly Distributed Data",
"doi": null,
"abstractUrl": "/journal/tk/2010/12/ttk2010121694/13rRUwInuWM",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2011/07/ttk2011070991",
"title": "Flexible and Efficient Resolution of Skyline Query Size Constraints",
"doi": null,
"abstractUrl": "/journal/tk/2011/07/ttk2011070991/13rRUxOdD8A",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1lgopc2L9Ha",
"title": "Computer Science and Software Engineering, International Conference on",
"acronym": "csse",
"groupId": "1002553",
"volume": "4",
"displayVolume": "4",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqOwQJ3",
"doi": "10.1109/CSSE.2008.682",
"title": "QBSQ: A Quad-Tree Based Algorithm for Skyline Query",
"normalizedTitle": "QBSQ: A Quad-Tree Based Algorithm for Skyline Query",
"abstract": "Skyline has been proposed as an important operation for multi-criteria decision making, data mining and visualization, and user preference queries. In this paper, we systematically explore a Quad-tree based approach for computing skyline points which contributes to a better performance than traditional ones for skyline queries. Based on this approach, we present a novel algorithm QBSQ for finding the set of global skyline points. QBSQ partitions data points dynamically by means of the configuration characters of Quad-tree, and then deletes points dominated by other(s) while constructing the tree. The amount of work for domination checking is minimized and the efficiency of our algorithm is thus improved. Extensive experiments prove the efficiency and the scalability of QBSQ algorithm.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Skyline has been proposed as an important operation for multi-criteria decision making, data mining and visualization, and user preference queries. In this paper, we systematically explore a Quad-tree based approach for computing skyline points which contributes to a better performance than traditional ones for skyline queries. Based on this approach, we present a novel algorithm QBSQ for finding the set of global skyline points. QBSQ partitions data points dynamically by means of the configuration characters of Quad-tree, and then deletes points dominated by other(s) while constructing the tree. The amount of work for domination checking is minimized and the efficiency of our algorithm is thus improved. Extensive experiments prove the efficiency and the scalability of QBSQ algorithm.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Skyline has been proposed as an important operation for multi-criteria decision making, data mining and visualization, and user preference queries. In this paper, we systematically explore a Quad-tree based approach for computing skyline points which contributes to a better performance than traditional ones for skyline queries. Based on this approach, we present a novel algorithm QBSQ for finding the set of global skyline points. QBSQ partitions data points dynamically by means of the configuration characters of Quad-tree, and then deletes points dominated by other(s) while constructing the tree. The amount of work for domination checking is minimized and the efficiency of our algorithm is thus improved. Extensive experiments prove the efficiency and the scalability of QBSQ algorithm.",
"fno": "3336g435",
"keywords": [
"Data Mining",
"Skyline",
"Decision Making",
"Algorithm"
],
"authors": [
{
"affiliation": null,
"fullName": "Ma Zhixin",
"givenName": "Ma",
"surname": "Zhixin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Sheng Lijun",
"givenName": "Sheng",
"surname": "Lijun",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Xu Yusheng",
"givenName": "Xu",
"surname": "Yusheng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Li Lian",
"givenName": "Li",
"surname": "Lian",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "csse",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-12-01T00:00:00",
"pubType": "proceedings",
"pages": "435-437",
"year": "2008",
"issn": null,
"isbn": "978-0-7695-3336-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3336g431",
"articleId": "12OmNqHqSn1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3336g438",
"articleId": "12OmNqIzh6T",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/apweb/2010/4012/0/4012a358",
"title": "Skyline Minimum Vector",
"doi": null,
"abstractUrl": "/proceedings-article/apweb/2010/4012a358/12OmNC17hTE",
"parentPublication": {
"id": "proceedings/apweb/2010/4012/0",
"title": "Conference, International Asia-Pacific Web",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msn/2009/3935/0/3935a017",
"title": "Progressive Skyline Query Processing in Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2009/3935a017/12OmNxG1yCz",
"parentPublication": {
"id": "proceedings/msn/2009/3935/0",
"title": "2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2012/4893/0/4893a137",
"title": "A Spatial Skyline Query for a Group of Users Having Different Positions",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2012/4893a137/12OmNy87QwX",
"parentPublication": {
"id": "proceedings/icnc/2012/4893/0",
"title": "2012 Third International Conference on Networking and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csa/2008/3428/0/3428a353",
"title": "Processing Continuous Skyline Queries in Road Networks",
"doi": null,
"abstractUrl": "/proceedings-article/csa/2008/3428a353/12OmNyfdOYq",
"parentPublication": {
"id": "proceedings/csa/2008/3428/0",
"title": "2008 International Symposium on Computer Science and its Applications (CSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isorcw/2012/4669/0/4669a087",
"title": "Skyline Query Processing on Interval Uncertain Data",
"doi": null,
"abstractUrl": "/proceedings-article/isorcw/2012/4669a087/12OmNzT7OxK",
"parentPublication": {
"id": "proceedings/isorcw/2012/4669/0",
"title": "2012 IEEE 15th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iita/2009/3859/1/3859a593",
"title": "QBHSQ: A Quad-tree Based Algorithm for High-dimension Skyline Query",
"doi": null,
"abstractUrl": "/proceedings-article/iita/2009/3859a593/12OmNzdoMV1",
"parentPublication": {
"id": "proceedings/iita/2009/3859/1",
"title": "2009 Third International Symposium on Intelligent Information Technology Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wisa/2010/4193/0/4193a003",
"title": "Location-Dependent Skyline Query Processing in Mobile Databases",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2010/4193a003/12OmNzsrwcO",
"parentPublication": {
"id": "proceedings/wisa/2010/4193/0",
"title": "Web Information Systems and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2011/02/ttk2011020204",
"title": "Constrained Skyline Query Processing against Distributed Data Sites",
"doi": null,
"abstractUrl": "/journal/tk/2011/02/ttk2011020204/13rRUxBa5nE",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2011/07/ttk2011070991",
"title": "Flexible and Efficient Resolution of Skyline Query Size Constraints",
"doi": null,
"abstractUrl": "/journal/tk/2011/07/ttk2011070991/13rRUxOdD8A",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2020/07/08663344",
"title": "Top-<italic>k</italic> Dominating Queries on Skyline Groups",
"doi": null,
"abstractUrl": "/journal/tk/2020/07/08663344/18exlaKcvHq",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzn3957",
"title": "2017 IEEE 33rd International Conference on Data Engineering (ICDE)",
"acronym": "icde",
"groupId": "1000178",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyUFg2g",
"doi": "10.1109/ICDE.2017.49",
"title": "K-Dominant Skyline Join Queries: Extending the Join Paradigm to K-Dominant Skylines",
"normalizedTitle": "K-Dominant Skyline Join Queries: Extending the Join Paradigm to K-Dominant Skylines",
"abstract": "Skyline queries enable multi-criteria optimization by filtering objects that are worse in all the attributes of interest than another object. To handle the large answer set of skyline queries in high-dimensional datasets, the concept of k-dominance was proposed where an object is said to dominate another object if it is better in at least k attributes. However, many practical applications, such as flights having multiple stopovers, require that the preferences are applied on a joined relation. In this paper, we extend the k-dominant skyline queries to work on joined relations. We name such queries KSJQ (k-dominant skyline join queries). We show how pre-processing the base relations helps in making such queries efficient. We also extend the query to handle cases where the skyline preference is on aggregated values in the joined relation (such as total cost of the multiple legs of the flight). In addition, we devise efficient algorithms to choose the value of k based on the desired cardinality of the skyline set. Experiments demonstrate the efficiency and scalability of our algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Skyline queries enable multi-criteria optimization by filtering objects that are worse in all the attributes of interest than another object. To handle the large answer set of skyline queries in high-dimensional datasets, the concept of k-dominance was proposed where an object is said to dominate another object if it is better in at least k attributes. However, many practical applications, such as flights having multiple stopovers, require that the preferences are applied on a joined relation. In this paper, we extend the k-dominant skyline queries to work on joined relations. We name such queries KSJQ (k-dominant skyline join queries). We show how pre-processing the base relations helps in making such queries efficient. We also extend the query to handle cases where the skyline preference is on aggregated values in the joined relation (such as total cost of the multiple legs of the flight). In addition, we devise efficient algorithms to choose the value of k based on the desired cardinality of the skyline set. Experiments demonstrate the efficiency and scalability of our algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Skyline queries enable multi-criteria optimization by filtering objects that are worse in all the attributes of interest than another object. To handle the large answer set of skyline queries in high-dimensional datasets, the concept of k-dominance was proposed where an object is said to dominate another object if it is better in at least k attributes. However, many practical applications, such as flights having multiple stopovers, require that the preferences are applied on a joined relation. In this paper, we extend the k-dominant skyline queries to work on joined relations. We name such queries KSJQ (k-dominant skyline join queries). We show how pre-processing the base relations helps in making such queries efficient. We also extend the query to handle cases where the skyline preference is on aggregated values in the joined relation (such as total cost of the multiple legs of the flight). In addition, we devise efficient algorithms to choose the value of k based on the desired cardinality of the skyline set. Experiments demonstrate the efficiency and scalability of our algorithms.",
"fno": "6543a099",
"keywords": [
"Urban Areas",
"Aggregates",
"Optimization",
"Legged Locomotion",
"Conferences",
"Data Engineering",
"Computer Science"
],
"authors": [
{
"affiliation": null,
"fullName": "Anuradha Awasthi",
"givenName": "Anuradha",
"surname": "Awasthi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Arnab Bhattacharya",
"givenName": "Arnab",
"surname": "Bhattacharya",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Sanchit Gupta",
"givenName": "Sanchit",
"surname": "Gupta",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Ujjwal Kumar Singh",
"givenName": "Ujjwal Kumar",
"surname": "Singh",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icde",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-04-01T00:00:00",
"pubType": "proceedings",
"pages": "99-102",
"year": "2017",
"issn": "2375-026X",
"isbn": "978-1-5090-6543-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "6543a095",
"articleId": "12OmNzTppzz",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "6543a103",
"articleId": "12OmNALUoya",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdew/2008/2161/0/04498313",
"title": "Skyline-join in distributed databases",
"doi": null,
"abstractUrl": "/proceedings-article/icdew/2008/04498313/12OmNASraR9",
"parentPublication": {
"id": "proceedings/icdew/2008/2161/0",
"title": "2008 IEEE 24th International Conference on Data Engineering Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/his/2009/3745/3/3745c289",
"title": "Efficient k-Dominant Skyline Processing in Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/his/2009/3745c289/12OmNB0FxhC",
"parentPublication": {
"id": "proceedings/his/2009/3745/3",
"title": "Hybrid Intelligent Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisa/2010/5942/0/05480364",
"title": "Extended k-dominant Skyline in High Dimensional Space",
"doi": null,
"abstractUrl": "/proceedings-article/icisa/2010/05480364/12OmNC0guzl",
"parentPublication": {
"id": "proceedings/icisa/2010/5942/0",
"title": "2010 International Conference on Information Science and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2012/4893/0/4893a188",
"title": "Multicore Based Spatialk-dominant Skyline Computation",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2012/4893a188/12OmNz5apHT",
"parentPublication": {
"id": "proceedings/icnc/2012/4893/0",
"title": "2012 Third International Conference on Networking and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dbkda/2010/3981/0/3981a107",
"title": "Efficient Maintenance of k-Dominant Skyline for Frequently Updated Database",
"doi": null,
"abstractUrl": "/proceedings-article/dbkda/2010/3981a107/12OmNzUgcXD",
"parentPublication": {
"id": "proceedings/dbkda/2010/3981/0",
"title": "Advances in Databases, First International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08019873",
"title": "SkyLens: Visual Analysis of Skyline on Multi-Dimensional Data",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019873/13rRUygT7n3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2018/5520/0/552000a653",
"title": "Skyline Diagram: Finding the Voronoi Counterpart for Skyline Queries",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2018/552000a653/14Fq0VFPGar",
"parentPublication": {
"id": "proceedings/icde/2018/5520/0",
"title": "2018 IEEE 34th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2020/07/08663344",
"title": "Top-<italic>k</italic> Dominating Queries on Skyline Groups",
"doi": null,
"abstractUrl": "/journal/tk/2020/07/08663344/18exlaKcvHq",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0/205800b556",
"title": "Parallel k-Dominant Skyline Queries over Uncertain Data Streams with Capability Index",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2019/205800b556/1dPotl3hySs",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0",
"title": "2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101829",
"title": "CSQ System: A System to Support Constrained Skyline Queries on Transportation Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101829/1kaMBxXuzra",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1aDSOMTGCIw",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"acronym": "icde",
"groupId": "1000178",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1aDT2u6GCxq",
"doi": "10.1109/ICDE.2019.00251",
"title": "Efficient Parallel Skyline Query Processing for High-Dimensional Data",
"normalizedTitle": "Efficient Parallel Skyline Query Processing for High-Dimensional Data",
"abstract": "Given a set of multidimensional data points, skyline queries retrieve those points that are not dominated by any other points in the set. Due to the ubiquitous use of skyline queries, such as in preference-based query answering and decision making, and the large amount of data that these queries have to deal with, enabling their scalable processing is of critical importance. However, there are several outstanding challenges that have not been well addressed. More specifically, in this paper, we are tackling the data straggler and data skew challenges introduced by distributed skyline query processing, as well as the ensuing high computation cost of merging skyline candidates. We thus introduce a new efficient three-phase approach for large scale processing of skyline queries. In the first preprocessing phase, the data is partitioned along the Z-order curve. We utilize a novel data partitioning approach that formulates data partitioning as an optimization problem to minimize the size of intermediate data. In the second phase, each compute node partitions the input data points into disjoint subsets, and then performs the skyline computation on each subset to produce skyline candidates in parallel. In the final phase, we build an index and employ an efficient algorithm to merge the generated skyline candidates. Extensive experiments demonstrate that the proposed skyline algorithm achieves more than one order of magnitude enhancement in performance compared to existing state-of-the-art approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Given a set of multidimensional data points, skyline queries retrieve those points that are not dominated by any other points in the set. Due to the ubiquitous use of skyline queries, such as in preference-based query answering and decision making, and the large amount of data that these queries have to deal with, enabling their scalable processing is of critical importance. However, there are several outstanding challenges that have not been well addressed. More specifically, in this paper, we are tackling the data straggler and data skew challenges introduced by distributed skyline query processing, as well as the ensuing high computation cost of merging skyline candidates. We thus introduce a new efficient three-phase approach for large scale processing of skyline queries. In the first preprocessing phase, the data is partitioned along the Z-order curve. We utilize a novel data partitioning approach that formulates data partitioning as an optimization problem to minimize the size of intermediate data. In the second phase, each compute node partitions the input data points into disjoint subsets, and then performs the skyline computation on each subset to produce skyline candidates in parallel. In the final phase, we build an index and employ an efficient algorithm to merge the generated skyline candidates. Extensive experiments demonstrate that the proposed skyline algorithm achieves more than one order of magnitude enhancement in performance compared to existing state-of-the-art approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Given a set of multidimensional data points, skyline queries retrieve those points that are not dominated by any other points in the set. Due to the ubiquitous use of skyline queries, such as in preference-based query answering and decision making, and the large amount of data that these queries have to deal with, enabling their scalable processing is of critical importance. However, there are several outstanding challenges that have not been well addressed. More specifically, in this paper, we are tackling the data straggler and data skew challenges introduced by distributed skyline query processing, as well as the ensuing high computation cost of merging skyline candidates. We thus introduce a new efficient three-phase approach for large scale processing of skyline queries. In the first preprocessing phase, the data is partitioned along the Z-order curve. We utilize a novel data partitioning approach that formulates data partitioning as an optimization problem to minimize the size of intermediate data. In the second phase, each compute node partitions the input data points into disjoint subsets, and then performs the skyline computation on each subset to produce skyline candidates in parallel. In the final phase, we build an index and employ an efficient algorithm to merge the generated skyline candidates. Extensive experiments demonstrate that the proposed skyline algorithm achieves more than one order of magnitude enhancement in performance compared to existing state-of-the-art approaches.",
"fno": "747400c113",
"keywords": [
"Data Handling",
"Indexing",
"Parallel Processing",
"Query Processing",
"High Dimensional Data",
"Multidimensional Data Points",
"Skyline Queries",
"Preference Based Query Answering",
"Scalable Processing",
"Data Straggler",
"Distributed Skyline Query Processing",
"Intermediate Data",
"Input Data Points",
"Skyline Computation",
"Skyline Algorithm",
"Parallel Skyline Query Processing",
"Data Partitioning Approach",
"Query Processing",
"Distributed Databases",
"Partitioning Algorithms",
"Merging",
"Task Analysis",
"Runtime",
"Indexes",
"Parallel Computation",
"Skyline Query",
"Big Data"
],
"authors": [
{
"affiliation": "Ant Financial",
"fullName": "Mingjie Tang",
"givenName": "Mingjie",
"surname": "Tang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Purdue University",
"fullName": "Yongyang Yu",
"givenName": "Yongyang",
"surname": "Yu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Purdue University",
"fullName": "Walid G. Aref",
"givenName": "Walid G.",
"surname": "Aref",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Qatar University",
"fullName": "Qutaibah M. Malluhi",
"givenName": "Qutaibah M.",
"surname": "Malluhi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Qatar Computing Research Institute",
"fullName": "Mourad Ouzzani",
"givenName": "Mourad",
"surname": "Ouzzani",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icde",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-04-01T00:00:00",
"pubType": "proceedings",
"pages": "2113-2114",
"year": "2019",
"issn": null,
"isbn": "978-1-5386-7474-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "747400c111",
"articleId": "1aDSTXST9fO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "747400c115",
"articleId": "1aDSSW0i5lC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cgc/2012/3027/0/06382907",
"title": "A Partitioned-Based Method of Convex Skyline for Efficient Processing Top-k Queries",
"doi": null,
"abstractUrl": "/proceedings-article/cgc/2012/06382907/12OmNzDvShi",
"parentPublication": {
"id": "proceedings/cgc/2012/3027/0",
"title": "2012 International Conference on Cloud and Green Computing (CGC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccbd/2014/6621/0/6621a095",
"title": "Parallel Dynamic Skyline Query Using MapReduce",
"doi": null,
"abstractUrl": "/proceedings-article/ccbd/2014/6621a095/12OmNzmclu0",
"parentPublication": {
"id": "proceedings/ccbd/2014/6621/0",
"title": "2014 International Conference on Cloud Computing and Big Data (CCBD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wisa/2010/4193/0/4193a003",
"title": "Location-Dependent Skyline Query Processing in Mobile Databases",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2010/4193a003/12OmNzsrwcO",
"parentPublication": {
"id": "proceedings/wisa/2010/4193/0",
"title": "Web Information Systems and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2013/11/ttk2013112521",
"title": "Efficient Skyline Computation on Big Data",
"doi": null,
"abstractUrl": "/journal/tk/2013/11/ttk2013112521/13rRUEgs2tL",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/11/06750729",
"title": "Caching Support for Skyline Query Processing with Partially Ordered Domains",
"doi": null,
"abstractUrl": "/journal/tk/2014/11/06750729/13rRUIIVlkO",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2013/04/ttk2013040945",
"title": "U-Skyline: A New Skyline Query for Uncertain Databases",
"doi": null,
"abstractUrl": "/journal/tk/2013/04/ttk2013040945/13rRUwIF6lv",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2013/04/ttk2013040850",
"title": "Skyline Processing on Distributed Vertical Decompositions",
"doi": null,
"abstractUrl": "/journal/tk/2013/04/ttk2013040850/13rRUwInvJI",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2011/02/ttk2011020204",
"title": "Constrained Skyline Query Processing against Distributed Data Sites",
"doi": null,
"abstractUrl": "/journal/tk/2011/02/ttk2011020204/13rRUxBa5nE",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2016/07/07219441",
"title": "Efficient Parallel Skyline Evaluation Using MapReduce",
"doi": null,
"abstractUrl": "/journal/td/2016/07/07219441/13rRUzp02o2",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2018/10/08302507",
"title": "Efficient Parallel Skyline Query Processing for High-Dimensional Data",
"doi": null,
"abstractUrl": "/journal/tk/2018/10/08302507/13xI8AOXccT",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1cdOxIkMVna",
"title": "2017 5th Intl Conf on Applied Computing and Information Technology/4th Intl Conf on Computational Science/Intelligence and Applied Informatics/2nd Intl Conf on Big Data, Cloud Computing, Data Science (ACIT-CSII-BCD)",
"acronym": "acit-csii-bcd",
"groupId": "1810566",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "1cdOzUO9HIk",
"doi": "10.1109/ACIT-CSII-BCD.2017.35",
"title": "Computing Skyline Using Taxicab Geometry",
"normalizedTitle": "Computing Skyline Using Taxicab Geometry",
"abstract": "Skyline computation is relevant in multi-criteria decision making where the criteria are inversely proportional to each other. Skyline is generally computed using dominance analysis and applicable in a situation where shortest distance is computed with respect to a point of importance. In real life scenarios different cost parameters are obviously high for the points which are designated as \"important\" where as users search for the points which are generally of low cost. These types of inverse conditions are managed in skyline computation. Existing research works majorly apply shortest distance calculation for searching the points of importance and it is assumed that the points are connected without any obstructions. However in practical cases this assumption is often wrong as different obstacles or barriers exist between the points or places. In this research work we use Taxicab distance calculation to consider the presence of obstacles and apply it to compute skyline of geographically dispersed data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Skyline computation is relevant in multi-criteria decision making where the criteria are inversely proportional to each other. Skyline is generally computed using dominance analysis and applicable in a situation where shortest distance is computed with respect to a point of importance. In real life scenarios different cost parameters are obviously high for the points which are designated as \"important\" where as users search for the points which are generally of low cost. These types of inverse conditions are managed in skyline computation. Existing research works majorly apply shortest distance calculation for searching the points of importance and it is assumed that the points are connected without any obstructions. However in practical cases this assumption is often wrong as different obstacles or barriers exist between the points or places. In this research work we use Taxicab distance calculation to consider the presence of obstacles and apply it to compute skyline of geographically dispersed data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Skyline computation is relevant in multi-criteria decision making where the criteria are inversely proportional to each other. Skyline is generally computed using dominance analysis and applicable in a situation where shortest distance is computed with respect to a point of importance. In real life scenarios different cost parameters are obviously high for the points which are designated as \"important\" where as users search for the points which are generally of low cost. These types of inverse conditions are managed in skyline computation. Existing research works majorly apply shortest distance calculation for searching the points of importance and it is assumed that the points are connected without any obstructions. However in practical cases this assumption is often wrong as different obstacles or barriers exist between the points or places. In this research work we use Taxicab distance calculation to consider the presence of obstacles and apply it to compute skyline of geographically dispersed data.",
"fno": "3302a007",
"keywords": [
"Decision Making",
"Geometry",
"Transportation",
"Users Search",
"Inverse Conditions",
"Skyline Computation",
"Shortest Distance Calculation",
"Dominance Analysis",
"Taxicab Geometry",
"Multicriteria Decision Making",
"Cost Parameters",
"Taxicab Distance Calculation",
"Geographically Dispersed Data",
"Geometry",
"Decision Making",
"Urban Areas",
"Complexity Theory",
"Coordinate Measuring Machines",
"Google",
"Databases",
"Skyline",
"Taxicab",
"Dominance Analysis",
"Shortest Distance Calculation",
"Obstacle"
],
"authors": [
{
"affiliation": null,
"fullName": "Partha Ghosh",
"givenName": "Partha",
"surname": "Ghosh",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Takaaki Goto",
"givenName": "Takaaki",
"surname": "Goto",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Soumya Sen",
"givenName": "Soumya",
"surname": "Sen",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "acit-csii-bcd",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-07-01T00:00:00",
"pubType": "proceedings",
"pages": "7-12",
"year": "2017",
"issn": null,
"isbn": "978-1-5386-3302-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3302z024",
"articleId": "1cdOAian9lu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3302a019",
"articleId": "1cdOAeEEOA0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icebe/2008/3395/0/3395a155",
"title": "Constrained Skyline Computing over Data Streams",
"doi": null,
"abstractUrl": "/proceedings-article/icebe/2008/3395a155/12OmNAkWvxE",
"parentPublication": {
"id": "proceedings/icebe/2008/3395/0",
"title": "2008 IEEE International Conference on e-Business Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2012/2621/0/06327412",
"title": "Making Recommendations Using Location-Based Skyline Queries",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2012/06327412/12OmNAo45R2",
"parentPublication": {
"id": "proceedings/dexa/2012/2621/0",
"title": "2012 23rd International Workshop on Database and Expert Systems Applications (DEXA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2009/3545/0/3545a892",
"title": "Distance-Based Representative Skyline",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2009/3545a892/12OmNqBtj0T",
"parentPublication": {
"id": "proceedings/icde/2009/3545/0",
"title": "2009 IEEE 25th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icccnt/2012/9999/0/06396049",
"title": "Spatial boolean skyline boundary queries in road networks",
"doi": null,
"abstractUrl": "/proceedings-article/icccnt/2012/06396049/12OmNxFsmuH",
"parentPublication": {
"id": "proceedings/icccnt/2012/9999/0",
"title": "2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wisa/2014/5726/0/07057982",
"title": "Geometry-Based Spatial Skyline Query in Wireless Sensor Network",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2014/07057982/12OmNyRg4rb",
"parentPublication": {
"id": "proceedings/wisa/2014/5726/0",
"title": "2014 11th Web Information System and Application Conference (WISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2017/6543/0/6543a099",
"title": "K-Dominant Skyline Join Queries: Extending the Join Paradigm to K-Dominant Skylines",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2017/6543a099/12OmNyUFg2g",
"parentPublication": {
"id": "proceedings/icde/2017/6543/0",
"title": "2017 IEEE 33rd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csa/2008/3428/0/3428a353",
"title": "Processing Continuous Skyline Queries in Road Networks",
"doi": null,
"abstractUrl": "/proceedings-article/csa/2008/3428a353/12OmNyfdOYq",
"parentPublication": {
"id": "proceedings/csa/2008/3428/0",
"title": "2008 International Symposium on Computer Science and its Applications (CSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccbd/2014/6621/0/6621a095",
"title": "Parallel Dynamic Skyline Query Using MapReduce",
"doi": null,
"abstractUrl": "/proceedings-article/ccbd/2014/6621a095/12OmNzmclu0",
"parentPublication": {
"id": "proceedings/ccbd/2014/6621/0",
"title": "2014 International Conference on Cloud Computing and Big Data (CCBD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08019873",
"title": "SkyLens: Visual Analysis of Skyline on Multi-Dimensional Data",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019873/13rRUygT7n3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101829",
"title": "CSQ System: A System to Support Constrained Skyline Queries on Transportation Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101829/1kaMBxXuzra",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1uHhezZYHrW",
"title": "2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)",
"acronym": "wi-iat",
"groupId": "1001411",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1uHhgYXYNLa",
"doi": "10.1109/WIIAT50758.2020.00043",
"title": "Morph-Skyline: Virtual Ontology-Based Data Access for Skyline Queries",
"normalizedTitle": "Morph-Skyline: Virtual Ontology-Based Data Access for Skyline Queries",
"abstract": "Skyline queries are being used in decision-making applications to help stakeholders find the set of data that satisfies certain criteria, whose weight may not be assigned beforehand. Given the wide availability of heterogeneous datasets that are being published following Open Data initiatives, combining skyline queries with query processing approaches such as Ontology-Based Data Access (OBDA), may help stakeholders to improve their decisions exploiting and integrating multiple and heterogeneous data sources. In this paper, we address the problem of evaluating SPARQL skyline queries over an OBDA approach. Our approach implements two different techniques: rewriting skyline queries into SPARQL 1.0 and then translating to SQL, or translating them directly into queries that can be evaluated by the relational database. Our experimental results suggest that the execution time can be reduced by up two orders of magnitude in comparison to current approaches scaling up to larger datasets while identifying precisely the skyline set.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Skyline queries are being used in decision-making applications to help stakeholders find the set of data that satisfies certain criteria, whose weight may not be assigned beforehand. Given the wide availability of heterogeneous datasets that are being published following Open Data initiatives, combining skyline queries with query processing approaches such as Ontology-Based Data Access (OBDA), may help stakeholders to improve their decisions exploiting and integrating multiple and heterogeneous data sources. In this paper, we address the problem of evaluating SPARQL skyline queries over an OBDA approach. Our approach implements two different techniques: rewriting skyline queries into SPARQL 1.0 and then translating to SQL, or translating them directly into queries that can be evaluated by the relational database. Our experimental results suggest that the execution time can be reduced by up two orders of magnitude in comparison to current approaches scaling up to larger datasets while identifying precisely the skyline set.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Skyline queries are being used in decision-making applications to help stakeholders find the set of data that satisfies certain criteria, whose weight may not be assigned beforehand. Given the wide availability of heterogeneous datasets that are being published following Open Data initiatives, combining skyline queries with query processing approaches such as Ontology-Based Data Access (OBDA), may help stakeholders to improve their decisions exploiting and integrating multiple and heterogeneous data sources. In this paper, we address the problem of evaluating SPARQL skyline queries over an OBDA approach. Our approach implements two different techniques: rewriting skyline queries into SPARQL 1.0 and then translating to SQL, or translating them directly into queries that can be evaluated by the relational database. Our experimental results suggest that the execution time can be reduced by up two orders of magnitude in comparison to current approaches scaling up to larger datasets while identifying precisely the skyline set.",
"fno": "192400a299",
"keywords": [
"Ontologies Artificial Intelligence",
"Query Processing",
"Relational Databases",
"SQL",
"Skyline Set",
"SPARQL Skyline Queries",
"Heterogeneous Data Sources",
"Multiple Data Sources",
"Query Processing Approaches",
"Open Data Initiatives",
"Virtual Ontology Based Data Access",
"Morph Skyline",
"Query Processing",
"Decision Making",
"Relational Databases",
"Stakeholders",
"Intelligent Agents",
"Open Data",
"Skyline",
"OBDA",
"Query Translation",
"R 2 RML"
],
"authors": [
{
"affiliation": "Computer Science and Information Technology Universidad Simón Bolívar,Caracas,Venezuela",
"fullName": "Marlene Goncalves",
"givenName": "Marlene",
"surname": "Goncalves",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Ontology Engineering Group Universidad Politécnica de Madrid,Boadilla del Monte,Madrid",
"fullName": "David Chaves-Fraga",
"givenName": "David",
"surname": "Chaves-Fraga",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Ontology Engineering Group Universidad Politécnica de Madrid,Boadilla del Monte,Madrid",
"fullName": "Oscar Corcho",
"givenName": "Oscar",
"surname": "Corcho",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "wi-iat",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-12-01T00:00:00",
"pubType": "proceedings",
"pages": "299-307",
"year": "2020",
"issn": null,
"isbn": "978-1-6654-1924-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "192400a291",
"articleId": "1uHhsgpAuDC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "192400a308",
"articleId": "1uHhfFAMrQs",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/nswctc/2009/3610/1/3610a391",
"title": "Location-Based Skyline Queries in Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/nswctc/2009/3610a391/12OmNAY79eN",
"parentPublication": {
"id": "proceedings/nswctc/2009/3610/1",
"title": "Networks Security, Wireless Communications and Trusted Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2017/6543/0/6543a633",
"title": "Secure Skyline Queries on Cloud Platform",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2017/6543a633/12OmNrIaem2",
"parentPublication": {
"id": "proceedings/icde/2017/6543/0",
"title": "2017 IEEE 33rd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2013/04/ttk2013040835",
"title": "Range-Based Skyline Queries in Mobile Environments",
"doi": null,
"abstractUrl": "/journal/tk/2013/04/ttk2013040835/13rRUNvgziV",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2006/12/k1645",
"title": "Continuous Skyline Queries for Moving Objects",
"doi": null,
"abstractUrl": "/journal/tk/2006/12/k1645/13rRUwI5TRo",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2009/03/ttk2009030351",
"title": "Efficient Processing of Metric Skyline Queries",
"doi": null,
"abstractUrl": "/journal/tk/2009/03/ttk2009030351/13rRUyueghx",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2018/5520/0/552000a653",
"title": "Skyline Diagram: Finding the Voronoi Counterpart for Skyline Queries",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2018/552000a653/14Fq0VFPGar",
"parentPublication": {
"id": "proceedings/icde/2018/5520/0",
"title": "2018 IEEE 34th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2020/07/08663344",
"title": "Top-<italic>k</italic> Dominating Queries on Skyline Groups",
"doi": null,
"abstractUrl": "/journal/tk/2020/07/08663344/18exlaKcvHq",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/05/09714833",
"title": "ProbSky: Efficient Computation of Probabilistic Skyline Queries Over Distributed Data",
"doi": null,
"abstractUrl": "/journal/tk/2023/05/09714833/1B2CRAQcvok",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/01/08742624",
"title": "Skyline Diagram: Efficient Space Partitioning for Skyline Queries",
"doi": null,
"abstractUrl": "/journal/tk/2021/01/08742624/1b154W6R2oM",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2020/1485/0/148500a251",
"title": "Secure Spatio-textual Skyline Queries on Cloud Platform",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-bdcloud-socialcom-sustaincom/2020/148500a251/1ua4NHBWde8",
"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"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAWH9tM",
"title": "2017 IEEE Security and Privacy Workshops (SPW)",
"acronym": "spw",
"groupId": "1801671",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyRPgz6",
"doi": "10.1109/SPW.2017.9",
"title": "Using Gaussian Mixture Models to Detect Outliers in Seasonal Univariate Network Traffic",
"normalizedTitle": "Using Gaussian Mixture Models to Detect Outliers in Seasonal Univariate Network Traffic",
"abstract": "This article presents an algorithm to detect outliers in seasonal, univariate network traffic data using Gaussian Mixture Models (GMMs). Additionally we show that this methodology can easily be implemented in a big data scenario and delivers the required information to a security analyst in an efficient manner. The unsupervised clustering algorithm GMM, is modified such that all data points in a set are labelled as either outliers or normal data points. In this article, the algorithm is only evaluated on time series data obtained from network traffic, however it can easily be modified to be used for other types of seasonal univariate big data sets. Detecting outliers in network traffic data occurs in two stages. First, GMMs are built for training data in each time bin of seasonal time series data. Outliers or anomalies are detected and removed in this training data set by examining the probability associated with each data point. Second, GMMs are rebuilt after outliers are removed in historical or training data and the re-computed GMMs are used to detect outliers in test data. Results are compared to traditional methods of outlier detection which usually treat all data from a set as coming from a single probability density function.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article presents an algorithm to detect outliers in seasonal, univariate network traffic data using Gaussian Mixture Models (GMMs). Additionally we show that this methodology can easily be implemented in a big data scenario and delivers the required information to a security analyst in an efficient manner. The unsupervised clustering algorithm GMM, is modified such that all data points in a set are labelled as either outliers or normal data points. In this article, the algorithm is only evaluated on time series data obtained from network traffic, however it can easily be modified to be used for other types of seasonal univariate big data sets. Detecting outliers in network traffic data occurs in two stages. First, GMMs are built for training data in each time bin of seasonal time series data. Outliers or anomalies are detected and removed in this training data set by examining the probability associated with each data point. Second, GMMs are rebuilt after outliers are removed in historical or training data and the re-computed GMMs are used to detect outliers in test data. Results are compared to traditional methods of outlier detection which usually treat all data from a set as coming from a single probability density function.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article presents an algorithm to detect outliers in seasonal, univariate network traffic data using Gaussian Mixture Models (GMMs). Additionally we show that this methodology can easily be implemented in a big data scenario and delivers the required information to a security analyst in an efficient manner. The unsupervised clustering algorithm GMM, is modified such that all data points in a set are labelled as either outliers or normal data points. In this article, the algorithm is only evaluated on time series data obtained from network traffic, however it can easily be modified to be used for other types of seasonal univariate big data sets. Detecting outliers in network traffic data occurs in two stages. First, GMMs are built for training data in each time bin of seasonal time series data. Outliers or anomalies are detected and removed in this training data set by examining the probability associated with each data point. Second, GMMs are rebuilt after outliers are removed in historical or training data and the re-computed GMMs are used to detect outliers in test data. Results are compared to traditional methods of outlier detection which usually treat all data from a set as coming from a single probability density function.",
"fno": "1968a229",
"keywords": [
"Big Data",
"Gaussian Processes",
"Mixture Models",
"Pattern Clustering",
"Probability",
"Security Of Data",
"Time Series",
"Big Data Scenario",
"Data Point",
"Normal Data Points",
"Seasonal Univariate Big Data Sets",
"GM Ms",
"Seasonal Time Series Data",
"Training Data Set",
"Test Data",
"Seasonal Network Traffic Data",
"Univariate Network Traffic Data",
"Unsupervised Clustering Algorithm",
"Outliers Detection",
"Gaussian Mixture Models",
"Probability Density Function",
"Security Analyst",
"Anomalies Detection",
"Time Series Analysis",
"Anomaly Detection",
"Probability Density Function",
"Gaussian Mixture Model",
"Clustering Algorithms",
"Algorithm Design And Analysis",
"Gaussian Mixtures",
"Network Traffic",
"Outlier Detection"
],
"authors": [
{
"affiliation": null,
"fullName": "Aarthi Reddy",
"givenName": "Aarthi",
"surname": "Reddy",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Meredith Ordway-West",
"givenName": "Meredith",
"surname": "Ordway-West",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Melissa Lee",
"givenName": "Melissa",
"surname": "Lee",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Matt Dugan",
"givenName": "Matt",
"surname": "Dugan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Joshua Whitney",
"givenName": "Joshua",
"surname": "Whitney",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Ronen Kahana",
"givenName": "Ronen",
"surname": "Kahana",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Brad Ford",
"givenName": "Brad",
"surname": "Ford",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Johan Muedsam",
"givenName": "Johan",
"surname": "Muedsam",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Austin Henslee",
"givenName": "Austin",
"surname": "Henslee",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Max Rao",
"givenName": "Max",
"surname": "Rao",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "spw",
"isOpenAccess": true,
"showRecommendedArticles": true,
"showBuyMe": false,
"hasPdf": true,
"pubDate": "2017-05-01T00:00:00",
"pubType": "proceedings",
"pages": "229-234",
"year": "2017",
"issn": null,
"isbn": "978-1-5386-1968-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "1968a223",
"articleId": "12OmNyL0TPe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "1968a235",
"articleId": "12OmNvBIROb",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icapr/2009/3520/0/3520a095",
"title": "Efficient Learning of Finite Mixture Densities Using Mutual Information",
"doi": null,
"abstractUrl": "/proceedings-article/icapr/2009/3520a095/12OmNA0vo1p",
"parentPublication": {
"id": "proceedings/icapr/2009/3520/0",
"title": "Advances in Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2016/5473/0/07838000",
"title": "Gaussian Component Based Index for GMMs",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2016/07838000/12OmNAlvHTi",
"parentPublication": {
"id": "proceedings/icdm/2016/5473/0",
"title": "2016 IEEE 16th International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icinis/2009/3852/0/3852a323",
"title": "Player Detection Algorithm Based on Gaussian Mixture Models Background Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/icinis/2009/3852a323/12OmNCd2rFh",
"parentPublication": {
"id": "proceedings/icinis/2009/3852/0",
"title": "Intelligent Networks and Intelligent Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-icess/2009/3738/0/3738a110",
"title": "A Hybrid System with Hidden Markov Models and Gaussian Mixture Models for Myocardial Infarction Classification with 12-Lead ECGs",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-icess/2009/3738a110/12OmNxWcHns",
"parentPublication": {
"id": "proceedings/hpcc-icess/2009/3738/0",
"title": "High Performance Computing and Communication & IEEE International Conference on Embedded Software and Systems, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2011/09/ttk2011091406",
"title": "Laplacian Regularized Gaussian Mixture Model for Data Clustering",
"doi": null,
"abstractUrl": "/journal/tk/2011/09/ttk2011091406/13rRUxBa5xB",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08019881",
"title": "Visualizing Big Data Outliers Through Distributed Aggregation",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019881/13rRUxD9h5e",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2018/9288/0/928800a779",
"title": "Detecting Outliers in Streaming Time Series Data from ARM Distributed Sensors",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2018/928800a779/18jXI4hmXMk",
"parentPublication": {
"id": "proceedings/icdmw/2018/9288/0",
"title": "2018 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903677",
"title": "GRay: Ray Casting for Visualization and Interactive Data Exploration of Gaussian Mixture Models",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903677/1GZoj8mhSPS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020738",
"title": "Outlier Detection Based on Stacked Autoencoder and Gaussian Mixture Model",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020738/1KfREOhq1ag",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2019/1838/0/183800a025",
"title": "Direct Fitting of Gaussian Mixture Models",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2019/183800a025/1cMGuFJMJna",
"parentPublication": {
"id": "proceedings/crv/2019/1838/0",
"title": "2019 16th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNy314bv",
"title": "2016 5th Brazilian Conference on Intelligent Systems (BRACIS)",
"acronym": "bracis",
"groupId": "1803430",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzTYBWj",
"doi": "10.1109/BRACIS.2016.084",
"title": "Shrinkage k-Means: A Clustering Algorithm Based on the James-Stein Estimator",
"normalizedTitle": "Shrinkage k-Means: A Clustering Algorithm Based on the James-Stein Estimator",
"abstract": "In this work, we propose Shrinkage k-means (Sk-means), a novel variant of k-means based on the James-Stein estimator for the mean of a multivariate normal given a single sample point. We evaluate Sk-means on both synthetic and real-world data. The proposed method outperformed standard clustering methods and also the existing method based on k-means which uses the James-Stein estimator. Results also suggest that Sk-means is robust to outliers.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this work, we propose Shrinkage k-means (Sk-means), a novel variant of k-means based on the James-Stein estimator for the mean of a multivariate normal given a single sample point. We evaluate Sk-means on both synthetic and real-world data. The proposed method outperformed standard clustering methods and also the existing method based on k-means which uses the James-Stein estimator. Results also suggest that Sk-means is robust to outliers.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this work, we propose Shrinkage k-means (Sk-means), a novel variant of k-means based on the James-Stein estimator for the mean of a multivariate normal given a single sample point. We evaluate Sk-means on both synthetic and real-world data. The proposed method outperformed standard clustering methods and also the existing method based on k-means which uses the James-Stein estimator. Results also suggest that Sk-means is robust to outliers.",
"fno": "07839625",
"keywords": [
"Pattern Clustering",
"Statistical Analysis",
"Shrinkage K Means",
"Real World Data",
"Synthetic Data",
"Multivariate Normal",
"Sk Means",
"James Stein Estimator",
"Clustering Algorithm",
"Maximum Likelihood Estimation",
"Covariance Matrices",
"Robustness",
"Clustering Algorithms",
"Standards",
"Partitioning Algorithms",
"Gaussian Distribution"
],
"authors": [
{
"affiliation": "Dept. of Comput. Sci., Fed. Univ. of Ceara, Fortaleza, Brazil",
"fullName": "Filipe F.R. Damasceno",
"givenName": "Filipe F.R.",
"surname": "Damasceno",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci., Fed. Univ. of Ceara, Fortaleza, Brazil",
"fullName": "Marcelo B.A. Veras",
"givenName": "Marcelo B.A.",
"surname": "Veras",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci., Fed. Univ. of Ceara, Fortaleza, Brazil",
"fullName": "Diego P.P. Mesquita",
"givenName": "Diego P.P.",
"surname": "Mesquita",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci., Fed. Univ. of Ceara, Fortaleza, Brazil",
"fullName": "João P.P. Gomes",
"givenName": "João P.P.",
"surname": "Gomes",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci., Fed. Univ. of Ceara, Fortaleza, Brazil",
"fullName": "Carlos E.F. de Brito",
"givenName": "Carlos E.F.",
"surname": "de Brito",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "bracis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-10-01T00:00:00",
"pubType": "proceedings",
"pages": "433-437",
"year": "2016",
"issn": null,
"isbn": "978-1-5090-3566-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07839624",
"articleId": "12OmNqHItFW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07839626",
"articleId": "12OmNBInLjc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2012/2216/0/06460753",
"title": "k-MLE for mixtures of generalized Gaussians",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460753/12OmNAgY7oe",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asap/1991/9237/0/00238901",
"title": "A systolic algorithm for the triangular Stein equation",
"doi": null,
"abstractUrl": "/proceedings-article/asap/1991/00238901/12OmNvo67FY",
"parentPublication": {
"id": "proceedings/asap/1991/9237/0",
"title": "Proceedings of the International Conference on Application Specific Array Processors",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2014/6572/0/6572a251",
"title": "k-Intervals: A New Extension of the k-Means Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2014/6572a251/12OmNwLfMzr",
"parentPublication": {
"id": "proceedings/ictai/2014/6572/0",
"title": "2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdcloud-socialcom-sustaincom/2016/3936/0/3936a242",
"title": "K*-Means: An Effective and Efficient K-Means Clustering Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/bdcloud-socialcom-sustaincom/2016/3936a242/12OmNxwENGN",
"parentPublication": {
"id": "proceedings/bdcloud-socialcom-sustaincom/2016/3936/0",
"title": "2016 IEEE International Conferences on Big Data and Cloud Computing (BDCloud), Social Computing and Networking (SocialCom), Sustainable Computing and Communications (SustainCom) (BDCloud-SocialCom-SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2017/1600/0/1600a133",
"title": "DPLK-Means: A Novel Differential Privacy K-Means Mechanism",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2017/1600a133/12OmNz61dHb",
"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/icde/2018/5520/0/552000b224",
"title": "Reuse-Centric K-Means Configuration",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2018/552000b224/14Fq0ZNiFeu",
"parentPublication": {
"id": "proceedings/icde/2018/5520/0",
"title": "2018 IEEE 34th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dasc-picom-datacom-cyberscitech/2017/1956/0/08328527",
"title": "CENTAURUS: A Cloud Service for K-Means Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/dasc-picom-datacom-cyberscitech/2017/08328527/17D45WHONlg",
"parentPublication": {
"id": "proceedings/dasc-picom-datacom-cyberscitech/2017/1956/0",
"title": "2017 IEEE 15th Intl Conf on Dependable, Autonomic and Secure Computing, 15th Intl Conf on Pervasive Intelligence and Computing, 3rd Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbk/2018/9125/0/912500a322",
"title": "The k-Means Forest Classifier for High Dimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/icbk/2018/912500a322/17D45Xh13q7",
"parentPublication": {
"id": "proceedings/icbk/2018/9125/0",
"title": "2018 IEEE International Conference on Big Knowledge (ICBK)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2020/9360/0/09150696",
"title": "C-SURE: Shrinkage Estimator and Prototype Classifier for Complex-Valued Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09150696/1lPHzoGQREY",
"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/icpr/2021/8808/0/09412131",
"title": "Wasserstein k-means with sparse simplex projection",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412131/1tmhZJPqSvC",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNz2TCu5",
"title": "2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining",
"acronym": "asonam",
"groupId": "1002866",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzWfoVr",
"doi": "10.1109/ASONAM.2012.91",
"title": "Outskewer: Using Skewness to Spot Outliers in Samples and Time Series",
"normalizedTitle": "Outskewer: Using Skewness to Spot Outliers in Samples and Time Series",
"abstract": "Finding outliers in datasets is a classical problem of high interest for (dynamic) social network analysis. However, most methods rely on assumptions which are rarely met in practice, such as prior knowledge of some outliers or about normal behavior. We propose here Out skewer, a new approach based on the notion of skewness (a measure of the symmetry of a distribution) and its evolution when extremal values are removed one by one. Our method is easy to set up, it requires no prior knowledge on the system, and it may be used on-line. We illustrate its performance on two data sets representative of many use-cases: evolution of ego-centered views of the internet topology, and logs of queries entered into a search engine.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Finding outliers in datasets is a classical problem of high interest for (dynamic) social network analysis. However, most methods rely on assumptions which are rarely met in practice, such as prior knowledge of some outliers or about normal behavior. We propose here Out skewer, a new approach based on the notion of skewness (a measure of the symmetry of a distribution) and its evolution when extremal values are removed one by one. Our method is easy to set up, it requires no prior knowledge on the system, and it may be used on-line. We illustrate its performance on two data sets representative of many use-cases: evolution of ego-centered views of the internet topology, and logs of queries entered into a search engine.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Finding outliers in datasets is a classical problem of high interest for (dynamic) social network analysis. However, most methods rely on assumptions which are rarely met in practice, such as prior knowledge of some outliers or about normal behavior. We propose here Out skewer, a new approach based on the notion of skewness (a measure of the symmetry of a distribution) and its evolution when extremal values are removed one by one. Our method is easy to set up, it requires no prior knowledge on the system, and it may be used on-line. We illustrate its performance on two data sets representative of many use-cases: evolution of ego-centered views of the internet topology, and logs of queries entered into a search engine.",
"fno": "4799a527",
"keywords": [
"Time Series Analysis",
"Data Models",
"Gaussian Distribution",
"Social Network Services",
"Reliability",
"Distributed Databases",
"Market Research",
"Complex Networks",
"Outlier",
"Anomaly Detection",
"Skewness",
"Time Series",
"Internet Topology",
"Peer To Peer"
],
"authors": [
{
"affiliation": "LIP6, Univ. Pierre et Marie Curie, Paris, France",
"fullName": "S. Heymann",
"givenName": "S.",
"surname": "Heymann",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "LIP6, Univ. Pierre et Marie Curie, Paris, France",
"fullName": "M. Latapy",
"givenName": "M.",
"surname": "Latapy",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "LIP6, Univ. Pierre et Marie Curie, Paris, France",
"fullName": "C. Magnien",
"givenName": "C.",
"surname": "Magnien",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "asonam",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-08-01T00:00:00",
"pubType": "proceedings",
"pages": "527-534",
"year": "2012",
"issn": null,
"isbn": "978-1-4673-2497-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4799a522",
"articleId": "12OmNButpX3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4799a535",
"articleId": "12OmNz61d0u",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2008/1836/0/04497638",
"title": "SPOT: A System for Detecting Projected Outliers From High-dimensional Data Streams",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2008/04497638/12OmNroijht",
"parentPublication": {
"id": "proceedings/icde/2008/1836/0",
"title": "2008 IEEE 24th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsap/2010/3960/0/3960a130",
"title": "Single Channel Inverse Filtering of Room Impulse Response by Maximizing Skewness of LP Residual",
"doi": null,
"abstractUrl": "/proceedings-article/icsap/2010/3960a130/12OmNvUsonL",
"parentPublication": {
"id": "proceedings/icsap/2010/3960/0",
"title": "Signal Acquisition and Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdew/2006/2571/0/2571x121",
"title": "Unsupervised Outlier Detection in Time Series Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdew/2006/2571x121/12OmNxX3urN",
"parentPublication": {
"id": "proceedings/icdew/2006/2571/0",
"title": "22nd International Conference on Data Engineering Workshops (ICDEW'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mdm/2018/4133/0/413301a125",
"title": "Outlier Detection for Multidimensional Time Series Using Deep Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/mdm/2018/413301a125/12OmNy5R3uk",
"parentPublication": {
"id": "proceedings/mdm/2018/4133/0",
"title": "2018 19th IEEE International Conference on Mobile Data Management (MDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spw/2017/1968/0/1968a229",
"title": "Using Gaussian Mixture Models to Detect Outliers in Seasonal Univariate Network Traffic",
"doi": null,
"abstractUrl": "/proceedings-article/spw/2017/1968a229/12OmNyRPgz6",
"parentPublication": {
"id": "proceedings/spw/2017/1968/0",
"title": "2017 IEEE Security and Privacy Workshops (SPW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2006/04/k0482",
"title": "A Unifying Framework for Detecting Outliers and Change Points from Time Series",
"doi": null,
"abstractUrl": "/journal/tk/2006/04/k0482/13rRUwhpBOg",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/03/ttg2013030470",
"title": "TimeSeer: Scagnostics for High-Dimensional Time Series",
"doi": null,
"abstractUrl": "/journal/tg/2013/03/ttg2013030470/13rRUxYrbMd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2018/9288/0/928800a779",
"title": "Detecting Outliers in Streaming Time Series Data from ARM Distributed Sensors",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2018/928800a779/18jXI4hmXMk",
"parentPublication": {
"id": "proceedings/icdmw/2018/9288/0",
"title": "2018 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2018/6861/0/08802502",
"title": "Time Series Projection to Highlight Trends and Outliers",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2018/08802502/1cJ6YgVgISI",
"parentPublication": {
"id": "proceedings/vast/2018/6861/0",
"title": "2018 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2020/8316/0/831600a152",
"title": "Mining Text Outliers in Document Directories",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2020/831600a152/1r54xOY5g8U",
"parentPublication": {
"id": "proceedings/icdm/2020/8316/0",
"title": "2020 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBpVPQZ",
"title": "2017 Brazilian Conference on Intelligent Systems (BRACIS)",
"acronym": "bracis",
"groupId": "1803430",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzlD9Ei",
"doi": "10.1109/BRACIS.2017.54",
"title": "Online Detection of Outliers in Clusters of Continuous Data Streaming",
"normalizedTitle": "Online Detection of Outliers in Clusters of Continuous Data Streaming",
"abstract": "The proposal behind this article is the treatment and detection of outliers in the online phase of the data stream clustering algorithms. The main contribution of our proposal is the use of an auxiliary memory for storing the new stream objects that have not been inserted into any micro-cluster of the clustering model, as they do not hold sufficient similarity. From time to time, the auxiliary memory is verified, clustering their objects together, validating the micro-clusters formed by inliers and inserting them into the model. All the remaining objects that have not been validated are kept in the auxiliary memory until they become valid or obsolete. Then, obsolete objects are removed from it. This paper also proposes CluStreamOD, an improvement of the CluStream clustering algorithm, which deals with outliers using the proposed approach. The performed experiments show the effectiveness of CluStreamOD in detecting and dealing online with outliers from the stream, when compared to CluStream, and the potentiality of the proposed approach to be used in other micro-cluster based data stream algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The proposal behind this article is the treatment and detection of outliers in the online phase of the data stream clustering algorithms. The main contribution of our proposal is the use of an auxiliary memory for storing the new stream objects that have not been inserted into any micro-cluster of the clustering model, as they do not hold sufficient similarity. From time to time, the auxiliary memory is verified, clustering their objects together, validating the micro-clusters formed by inliers and inserting them into the model. All the remaining objects that have not been validated are kept in the auxiliary memory until they become valid or obsolete. Then, obsolete objects are removed from it. This paper also proposes CluStreamOD, an improvement of the CluStream clustering algorithm, which deals with outliers using the proposed approach. The performed experiments show the effectiveness of CluStreamOD in detecting and dealing online with outliers from the stream, when compared to CluStream, and the potentiality of the proposed approach to be used in other micro-cluster based data stream algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The proposal behind this article is the treatment and detection of outliers in the online phase of the data stream clustering algorithms. The main contribution of our proposal is the use of an auxiliary memory for storing the new stream objects that have not been inserted into any micro-cluster of the clustering model, as they do not hold sufficient similarity. From time to time, the auxiliary memory is verified, clustering their objects together, validating the micro-clusters formed by inliers and inserting them into the model. All the remaining objects that have not been validated are kept in the auxiliary memory until they become valid or obsolete. Then, obsolete objects are removed from it. This paper also proposes CluStreamOD, an improvement of the CluStream clustering algorithm, which deals with outliers using the proposed approach. The performed experiments show the effectiveness of CluStreamOD in detecting and dealing online with outliers from the stream, when compared to CluStream, and the potentiality of the proposed approach to be used in other micro-cluster based data stream algorithms.",
"fno": "2407a324",
"keywords": [
"Data Mining",
"Pattern Clustering",
"Online Phase",
"Data Stream Clustering Algorithms",
"Auxiliary Memory",
"Stream Objects",
"Clustering Model",
"Remaining Objects",
"Obsolete Objects",
"Clu Stream Clustering Algorithm",
"Microcluster Based Data Stream Algorithms",
"Online Detection",
"Continuous Data Streaming",
"Clustering Algorithms",
"Algorithm Design And Analysis",
"Proposals",
"Electronic Mail",
"Dispersion",
"Anomaly Detection",
"Clustering",
"Outlier",
"Data Stream"
],
"authors": [
{
"affiliation": "Departamento de Informática, Univ. Federal de Viçosa - UFV, Viçosa, Brazil",
"fullName": "Mariana A. Pereira",
"givenName": "Mariana A.",
"surname": "Pereira",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Faculdade de Computação, Univ. Federal de Uberlândia-UFU, Uberlandia, Brazil",
"fullName": "Elaine R. Faria",
"givenName": "Elaine R.",
"surname": "Faria",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Instituto de Ciências Exatas e Tecnológicas, Univ. Federal de Viçosa - UFV, Rio Paranaiba, Brazil",
"fullName": "Murilo C. Naldi",
"givenName": "Murilo C.",
"surname": "Naldi",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "bracis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-10-01T00:00:00",
"pubType": "proceedings",
"pages": "324-329",
"year": "2017",
"issn": null,
"isbn": "978-1-5386-2407-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "2407a318",
"articleId": "12OmNsd6voo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "2407a330",
"articleId": "12OmNApLGKQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/fskd/2009/3735/5/3735e248",
"title": "Density-Based Data Streams Clustering over Sliding Windows",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/3735e248/12OmNAq3hL0",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/5",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2008/3496/1/3496a906",
"title": "DFCM: Density Based Approach to Identify Outliers and to Get Efficient Clusters in Fuzzy Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2008/3496a906/12OmNvpw7f0",
"parentPublication": {
"id": "proceedings/wi-iat/2008/3496/1",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2016/5910/0/07836645",
"title": "Scalable Online-Offline Stream Clustering in Apache Spark",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2016/07836645/12OmNwnYG0N",
"parentPublication": {
"id": "proceedings/icdmw/2016/5910/0",
"title": "2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spw/2017/1968/0/1968a229",
"title": "Using Gaussian Mixture Models to Detect Outliers in Seasonal Univariate Network Traffic",
"doi": null,
"abstractUrl": "/proceedings-article/spw/2017/1968a229/12OmNyRPgz6",
"parentPublication": {
"id": "proceedings/spw/2017/1968/0",
"title": "2017 IEEE Security and Privacy Workshops (SPW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2017/4283/0/4283a430",
"title": "An Efficient Hybrid-Clustream Algorithm for Stream Mining",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2017/4283a430/12OmNyrIau4",
"parentPublication": {
"id": "proceedings/sitis/2017/4283/0",
"title": "2017 13th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mue/2008/3134/0/3134a429",
"title": "Detecting Clusters and Outliers for Multi-dimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/mue/2008/3134a429/12OmNyugyV2",
"parentPublication": {
"id": "proceedings/mue/2008/3134/0",
"title": "Multimedia and Ubiquitous Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bcgin/2012/4854/0/4854a526",
"title": "An Improved Online Stream Data Clustering Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/bcgin/2012/4854a526/12OmNyv7mfS",
"parentPublication": {
"id": "proceedings/bcgin/2012/4854/0",
"title": "2012 Second International Conference on Business Computing and Global Informatization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2011/8959/0/05767923",
"title": "Continuous monitoring of distance-based outliers over data streams",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2011/05767923/12OmNzX6ctm",
"parentPublication": {
"id": "proceedings/icde/2011/8959/0",
"title": "2011 IEEE 27th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2017/12/08016602",
"title": "Feature Grouping-Based Outlier Detection Upon Streaming Trajectories",
"doi": null,
"abstractUrl": "/journal/tk/2017/12/08016602/13rRUxBJhnh",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2018/9385/0/938500a574",
"title": "Outliers Detection in One Dimensional Meteorological Data Stream",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2018/938500a574/19RSvCJ9nFK",
"parentPublication": {
"id": "proceedings/sitis/2018/9385/0",
"title": "2018 14th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "17D45VtKiqp",
"title": "2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)",
"acronym": "synasc",
"groupId": "1001577",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "17D45WLdYPS",
"doi": "10.1109/SYNASC.2017.00052",
"title": "Outliers Detection in Analysis of Cognitive Emotion Regulation Questionnaire for Teenagers",
"normalizedTitle": "Outliers Detection in Analysis of Cognitive Emotion Regulation Questionnaire for Teenagers",
"abstract": "The paper presents an approach of outliers detection methods for a data set from psychology field. Outliers detection in a data set is important because it may be that a minority of these patients has very different patterns of responses across the individual items. It is important to properly identify these patients, as their patterns may represent major interesting differences. In such case, the total scores are not informative since they are comparable across patients. Instead, it is the exact pattern of responses across items that will provide researchers with much richer and precise results for each individual. The analyzed data set consists of collected data for 240 patient's answer to an instrument used to measure the specific cognitive emotion regulation strategies used in response to the experience of threatening or stressful life events (the cognitive emotion regulation questionnaire). In our data set, the data type is discrete dichotomous data. In our experiments, according to our data type and dimension's data set, we have selected as outliers detection method density based: one class SVM with non-linear kernel and isolation forest algorithm.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The paper presents an approach of outliers detection methods for a data set from psychology field. Outliers detection in a data set is important because it may be that a minority of these patients has very different patterns of responses across the individual items. It is important to properly identify these patients, as their patterns may represent major interesting differences. In such case, the total scores are not informative since they are comparable across patients. Instead, it is the exact pattern of responses across items that will provide researchers with much richer and precise results for each individual. The analyzed data set consists of collected data for 240 patient's answer to an instrument used to measure the specific cognitive emotion regulation strategies used in response to the experience of threatening or stressful life events (the cognitive emotion regulation questionnaire). In our data set, the data type is discrete dichotomous data. In our experiments, according to our data type and dimension's data set, we have selected as outliers detection method density based: one class SVM with non-linear kernel and isolation forest algorithm.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The paper presents an approach of outliers detection methods for a data set from psychology field. Outliers detection in a data set is important because it may be that a minority of these patients has very different patterns of responses across the individual items. It is important to properly identify these patients, as their patterns may represent major interesting differences. In such case, the total scores are not informative since they are comparable across patients. Instead, it is the exact pattern of responses across items that will provide researchers with much richer and precise results for each individual. The analyzed data set consists of collected data for 240 patient's answer to an instrument used to measure the specific cognitive emotion regulation strategies used in response to the experience of threatening or stressful life events (the cognitive emotion regulation questionnaire). In our data set, the data type is discrete dichotomous data. In our experiments, according to our data type and dimension's data set, we have selected as outliers detection method density based: one class SVM with non-linear kernel and isolation forest algorithm.",
"fno": "262600a279",
"keywords": [
"Cognition",
"Pattern Clustering",
"Psychology",
"Support Vector Machines",
"Outliers Detection Methods",
"Discrete Dichotomous Data",
"Patients",
"Cognitive Emotion Regulation Strategies",
"Teenagers",
"Psychology Field",
"SVM",
"Nonlinear Kernel",
"Isolation Forest Algorithm",
"Anomaly Detection",
"Support Vector Machines",
"Forestry",
"Sociology",
"Statistics",
"Frequency Measurement",
"Distributed Databases",
"Dichotomous Data",
"Ensity Based Outliers Detection",
"Functional Emotions",
"Dysfunctional Emotions"
],
"authors": [
{
"affiliation": null,
"fullName": "Adriana Mihaela Coroiu",
"givenName": "Adriana Mihaela",
"surname": "Coroiu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "synasc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-09-01T00:00:00",
"pubType": "proceedings",
"pages": "279-283",
"year": "2017",
"issn": null,
"isbn": "978-1-5386-2626-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "262600a275",
"articleId": "17D45W1Oa3q",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "262600a284",
"articleId": "17D45Wc1IKR",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/2014/2504/0/2504c388",
"title": "Fast Regulation Service Provision via Aggregation of Thermostatically Controlled Loads",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2014/2504c388/12OmNAYoKkj",
"parentPublication": {
"id": "proceedings/hicss/2014/2504/0",
"title": "2014 47th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spw/2017/1968/0/1968a229",
"title": "Using Gaussian Mixture Models to Detect Outliers in Seasonal Univariate Network Traffic",
"doi": null,
"abstractUrl": "/proceedings-article/spw/2017/1968a229/12OmNyRPgz6",
"parentPublication": {
"id": "proceedings/spw/2017/1968/0",
"title": "2017 IEEE Security and Privacy Workshops (SPW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2014/4143/3/4143c373",
"title": "Intelligent Regulation Support System for Multimodal Traffic",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2014/4143c373/12OmNzDehay",
"parentPublication": {
"id": "proceedings/wi-iat/2014/4143/3",
"title": "2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08019881",
"title": "Visualizing Big Data Outliers Through Distributed Aggregation",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019881/13rRUxD9h5e",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2018/9385/0/938500a574",
"title": "Outliers Detection in One Dimensional Meteorological Data Stream",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2018/938500a574/19RSvCJ9nFK",
"parentPublication": {
"id": "proceedings/sitis/2018/9385/0",
"title": "2018 14th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2021/3902/0/09671460",
"title": "A GPU Algorithm for Detecting Contextual Outliers in Multiple Concurrent Data Streams",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2021/09671460/1A8hz7FXDSU",
"parentPublication": {
"id": "proceedings/big-data/2021/3902/0",
"title": "2021 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006232",
"title": "TsOutlier: Explaining Outliers with Uniform Profiles over IoT Data",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006232/1hJsmA8qLYc",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2019/4328/0/09047347",
"title": "Improve the Detection of Clustered Outliers via Outlier Score Propagation",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-bdcloud-socialcom-sustaincom/2019/09047347/1iC6EmH59S0",
"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/icdm/2020/8316/0/831600a372",
"title": "LP-Explain: Local Pictorial Explanation for Outliers",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2020/831600a372/1r54AqoaifC",
"parentPublication": {
"id": "proceedings/icdm/2020/8316/0",
"title": "2020 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nana/2021/4158/0/415800a236",
"title": "A Method for Fast Outlier Detection in High Dimensional Database Log",
"doi": null,
"abstractUrl": "/proceedings-article/nana/2021/415800a236/1zdPHS0ifMQ",
"parentPublication": {
"id": "proceedings/nana/2021/4158/0",
"title": "2021 International Conference on Networking and Network Applications (NaNA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1cdOxIkMVna",
"title": "2017 5th Intl Conf on Applied Computing and Information Technology/4th Intl Conf on Computational Science/Intelligence and Applied Informatics/2nd Intl Conf on Big Data, Cloud Computing, Data Science (ACIT-CSII-BCD)",
"acronym": "acit-csii-bcd",
"groupId": "1810566",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "1cdOABXKFMs",
"doi": "10.1109/ACIT-CSII-BCD.2017.45",
"title": "Intrusion Detection System Based on Gaussian Mixture Model Using Hadoop Framework",
"normalizedTitle": "Intrusion Detection System Based on Gaussian Mixture Model Using Hadoop Framework",
"abstract": "The traditional intrusion detection system is to match the rule base and network packets one by one, and then detect the abnormal behavior. When the amount of network data increases, the detection efficiency is significantly reduced, and even faces a huge challenge that it cannot be immediately detected. Hadoop framework is a great choice in dealing with big data. Hadoop can not only store huge data, but also speed up the data processing. In this paper, we propose a distributed Gaussian mixture model based on Hadoop framework. We use a two-step MapReduce process to implement this algorithm. And then, we deploy the Hadoop framework in the virtual machine to verify the efficiency of the algorithm. The results show that, this algorithm has a good performance in reducing the consumption of time.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The traditional intrusion detection system is to match the rule base and network packets one by one, and then detect the abnormal behavior. When the amount of network data increases, the detection efficiency is significantly reduced, and even faces a huge challenge that it cannot be immediately detected. Hadoop framework is a great choice in dealing with big data. Hadoop can not only store huge data, but also speed up the data processing. In this paper, we propose a distributed Gaussian mixture model based on Hadoop framework. We use a two-step MapReduce process to implement this algorithm. And then, we deploy the Hadoop framework in the virtual machine to verify the efficiency of the algorithm. The results show that, this algorithm has a good performance in reducing the consumption of time.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The traditional intrusion detection system is to match the rule base and network packets one by one, and then detect the abnormal behavior. When the amount of network data increases, the detection efficiency is significantly reduced, and even faces a huge challenge that it cannot be immediately detected. Hadoop framework is a great choice in dealing with big data. Hadoop can not only store huge data, but also speed up the data processing. In this paper, we propose a distributed Gaussian mixture model based on Hadoop framework. We use a two-step MapReduce process to implement this algorithm. And then, we deploy the Hadoop framework in the virtual machine to verify the efficiency of the algorithm. The results show that, this algorithm has a good performance in reducing the consumption of time.",
"fno": "3302a125",
"keywords": [
"Big Data",
"Data Handling",
"Gaussian Processes",
"Knowledge Based Systems",
"Mixture Models",
"Parallel Processing",
"Security Of Data",
"Hadoop Framework",
"Big Data",
"Data Processing",
"Distributed Gaussian Mixture Model",
"Network Packets",
"Intrusion Detection System",
"Rule Base Packets",
"Map Reduce Process",
"Intrusion Detection",
"Clustering Algorithms",
"Covariance Matrices",
"Gaussian Mixture Model",
"Gaussian Distribution",
"Intrusion Detection System",
"Hadoop",
"Map Reduce",
"Gaussiam Mixture Model"
],
"authors": [
{
"affiliation": null,
"fullName": "Zhijian Wang",
"givenName": "Zhijian",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yanqin Zhu",
"givenName": "Yanqin",
"surname": "Zhu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "acit-csii-bcd",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-07-01T00:00:00",
"pubType": "proceedings",
"pages": "125-130",
"year": "2017",
"issn": null,
"isbn": "978-1-5386-3302-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3302a119",
"articleId": "1cdOAXl3O5G",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3302a135",
"articleId": "1cdOyJi310k",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2016/5473/0/07838000",
"title": "Gaussian Component Based Index for GMMs",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2016/07838000/12OmNAlvHTi",
"parentPublication": {
"id": "proceedings/icdm/2016/5473/0",
"title": "2016 IEEE 16th International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2010/4257/0/4257a499",
"title": "A Privacy Preserving Framework for Gaussian Mixture Models",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2010/4257a499/12OmNvA1hmA",
"parentPublication": {
"id": "proceedings/icdmw/2010/4257/0",
"title": "2010 IEEE International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2016/3906/0/3906a587",
"title": "Maximum Gaussian Mixture Model for Classification",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2016/3906a587/12OmNwBT1mL",
"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": "proceedings/iccit/2008/3407/1/3407b162",
"title": "Anomaly Intrusion Detection System Using Gaussian Mixture Model",
"doi": null,
"abstractUrl": "/proceedings-article/iccit/2008/3407b162/12OmNwErpKz",
"parentPublication": {
"id": "iccit/2008/3407/1",
"title": "Convergence Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2017/3581/0/3581a704",
"title": "A Comparison Between Different Gaussian-Based Mixture Models",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2017/3581a704/12OmNwLOYWp",
"parentPublication": {
"id": "proceedings/aiccsa/2017/3581/0",
"title": "2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iri/2018/2659/0/265901a300",
"title": "Speaker Verification Using Adapted Bounded Gaussian Mixture Model",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2018/265901a300/12OmNxeutgm",
"parentPublication": {
"id": "proceedings/iri/2018/2659/0",
"title": "2018 IEEE International Conference on Information Reuse and Integration (IRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/biotechno/2008/3191/0/3191a094",
"title": "sBGMM: A Stratified Beta-Gaussian Mixture Model for Clustering Genes with Multiple Data Sources",
"doi": null,
"abstractUrl": "/proceedings-article/biotechno/2008/3191a094/12OmNzcPA7r",
"parentPublication": {
"id": "proceedings/biotechno/2008/3191/0",
"title": "International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2017/11/07938761",
"title": "A Fully-Pipelined Hardware Design for Gaussian Mixture Models",
"doi": null,
"abstractUrl": "/journal/tc/2017/11/07938761/13rRUxjQyoA",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2019/02/08125179",
"title": "Constructing Pathway-Based Priors within a Gaussian Mixture Model for Bayesian Regression and Classification",
"doi": null,
"abstractUrl": "/journal/tb/2019/02/08125179/13rRUxlgyag",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNrMHOd6",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"acronym": "hicss",
"groupId": "1000730",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwCJOY2",
"doi": "10.1109/HICSS.2016.156",
"title": "A Purpose-Based Typology for Systemic Features Enabling Value Co-Creation in Consumer Information Systems",
"normalizedTitle": "A Purpose-Based Typology for Systemic Features Enabling Value Co-Creation in Consumer Information Systems",
"abstract": "Value co-creation enabled by consumers' use of information systems is a challenging topic which requires more explicit definitions for use of academics and managers. Systemic features are digital services enabling co-creation of value, not being products or services to be paid for, but assisting as consumer-supporting capabilities between different contexts. In order to gain better insight for systemic features within information systems, we collected empirical data from 23 firms in the high-tech sector and analyzed the systemic features. Systemic features were classified and prioritized by a research group. The created purpose-based typology enhances the understanding on why and how value is co-created with customers. We contribute both to systems and business research by suggesting a purpose-based typology defining different purpose-based constructs for systemic features enabling co-creation of value. We also discuss implications for managing and organizing value within the firm and contribution to organization science and theory of the firm.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Value co-creation enabled by consumers' use of information systems is a challenging topic which requires more explicit definitions for use of academics and managers. Systemic features are digital services enabling co-creation of value, not being products or services to be paid for, but assisting as consumer-supporting capabilities between different contexts. In order to gain better insight for systemic features within information systems, we collected empirical data from 23 firms in the high-tech sector and analyzed the systemic features. Systemic features were classified and prioritized by a research group. The created purpose-based typology enhances the understanding on why and how value is co-created with customers. We contribute both to systems and business research by suggesting a purpose-based typology defining different purpose-based constructs for systemic features enabling co-creation of value. We also discuss implications for managing and organizing value within the firm and contribution to organization science and theory of the firm.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Value co-creation enabled by consumers' use of information systems is a challenging topic which requires more explicit definitions for use of academics and managers. Systemic features are digital services enabling co-creation of value, not being products or services to be paid for, but assisting as consumer-supporting capabilities between different contexts. In order to gain better insight for systemic features within information systems, we collected empirical data from 23 firms in the high-tech sector and analyzed the systemic features. Systemic features were classified and prioritized by a research group. The created purpose-based typology enhances the understanding on why and how value is co-created with customers. We contribute both to systems and business research by suggesting a purpose-based typology defining different purpose-based constructs for systemic features enabling co-creation of value. We also discuss implications for managing and organizing value within the firm and contribution to organization science and theory of the firm.",
"fno": "5670b226",
"keywords": [
"Context",
"Ecosystems",
"Information Systems",
"Organizations",
"Guidelines",
"Buildings",
"Consumer Information Systems",
"Systemic Features",
"Value Co Creation",
"Systemic Value",
"Typology",
"Theory Building"
],
"authors": [
{
"affiliation": null,
"fullName": "Karri Mikkonen",
"givenName": "Karri",
"surname": "Mikkonen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jose Teixeira",
"givenName": "Jose",
"surname": "Teixeira",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Mikko Pynnönen",
"givenName": "Mikko",
"surname": "Pynnönen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Kari Korpela",
"givenName": "Kari",
"surname": "Korpela",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jukka Hallikas",
"givenName": "Jukka",
"surname": "Hallikas",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "hicss",
"isOpenAccess": true,
"showRecommendedArticles": true,
"showBuyMe": false,
"hasPdf": true,
"pubDate": "2016-01-01T00:00:00",
"pubType": "proceedings",
"pages": "1226-1235",
"year": "2016",
"issn": "1530-1605",
"isbn": "978-0-7695-5670-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "5670b225",
"articleId": "12OmNB7LvH6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "5670b236",
"articleId": "12OmNwdbVbN",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/2016/5670/0/5670f167",
"title": "The Inter-Organizational Dynamics of a Platform Ecosystem: Exploring Stakeholder Boundaries",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670f167/12OmNA14A82",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2015/7367/0/7367e681",
"title": "Digital Competence: A Multi-dimensional Conceptualization and a Typology in an SME Context",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2015/7367e681/12OmNAY79dY",
"parentPublication": {
"id": "proceedings/hicss/2015/7367/0",
"title": "2015 48th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ares/2016/0990/0/0990a177",
"title": "Towards a Systemic Approach for Information Security Risk Management",
"doi": null,
"abstractUrl": "/proceedings-article/ares/2016/0990a177/12OmNBRbkqR",
"parentPublication": {
"id": "proceedings/ares/2016/0990/0",
"title": "2016 11th International Conference on Availability, Reliability and Security (ARES )",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2016/5670/0/5670b266",
"title": "Value Co-Creation and Co-Destruction in an IS Artifact: Contradictions of Geocaching",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670b266/12OmNviHK6i",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2016/5670/0/5670a287",
"title": "IT-Based Value Co-Creation: A Literature Review and Directions for Future Research",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670a287/12OmNx6xHtQ",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiaiaai/2014/4174/0/06913276",
"title": "Transformation of Public Libraries: Co-creation of Values at Multipurpose Community Learning Centers",
"doi": null,
"abstractUrl": "/proceedings-article/iiaiaai/2014/06913276/12OmNx965wf",
"parentPublication": {
"id": "proceedings/iiaiaai/2014/4174/0",
"title": "2014 IIAI 3rd International Conference on Advanced Applied Informatics (IIAIAAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcoss/2013/5041/0/5041a351",
"title": "A Systemic Approach for IoT Security",
"doi": null,
"abstractUrl": "/proceedings-article/dcoss/2013/5041a351/12OmNxYtu81",
"parentPublication": {
"id": "proceedings/dcoss/2013/5041/0",
"title": "2013 IEEE International Conference on Distributed Computing in Sensor Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbi/2014/5779/1/5779a191",
"title": "Linking a Service Innovation-Based Framework to Business Model Design",
"doi": null,
"abstractUrl": "/proceedings-article/cbi/2014/5779a191/12OmNz5apAx",
"parentPublication": {
"id": "cbi/2014/5779/1",
"title": "2014 IEEE 16th Conference on Business Informatics (CBI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2014/2504/0/2504b278",
"title": "Reconciling Resource Integration and Value Propositions -- The Dynamics of Value Co-creation",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2014/2504b278/12OmNzVoBQr",
"parentPublication": {
"id": "proceedings/hicss/2014/2504/0",
"title": "2014 47th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbi/2017/3035/1/3035a349",
"title": "Enterprise Architecture for Digital Transformation",
"doi": null,
"abstractUrl": "/proceedings-article/cbi/2017/3035a349/12OmNzzfToK",
"parentPublication": {
"id": "cbi/2017/3035/1",
"title": "2017 IEEE 19th Conference on Business Informatics (CBI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwl8GHX",
"title": "2007 IEEE Symposium on Visual Analytics Science and Technology",
"acronym": "vast",
"groupId": "1001630",
"volume": "0",
"displayVolume": "0",
"year": "2007",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxYL5gU",
"doi": "10.1109/VAST.2007.4389028",
"title": "From Tasks to Tools: A Field Study in Collaborative Visual Analytics",
"normalizedTitle": "From Tasks to Tools: A Field Study in Collaborative Visual Analytics",
"abstract": "This poster presents an exploratory field study of a VAST 2007 contest entry. We applied Cognitive Task Analysis (CTA), grounded theory (GT), and Activity Theory (AT), to analysis of field notes and interviews from participants. Our results are described in the context of activity theory and sensemaking, two theoretical perspectives that we have found to be particularly useful in understanding analytic tasks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This poster presents an exploratory field study of a VAST 2007 contest entry. We applied Cognitive Task Analysis (CTA), grounded theory (GT), and Activity Theory (AT), to analysis of field notes and interviews from participants. Our results are described in the context of activity theory and sensemaking, two theoretical perspectives that we have found to be particularly useful in understanding analytic tasks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This poster presents an exploratory field study of a VAST 2007 contest entry. We applied Cognitive Task Analysis (CTA), grounded theory (GT), and Activity Theory (AT), to analysis of field notes and interviews from participants. Our results are described in the context of activity theory and sensemaking, two theoretical perspectives that we have found to be particularly useful in understanding analytic tasks.",
"fno": "04389028",
"keywords": [],
"authors": [
{
"affiliation": "Simon Fraser University, SIAT; University of British Columbia, MAGIC. email: dhal@sfu.ca",
"fullName": "Daniel Ha",
"givenName": "Daniel",
"surname": "Ha",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Simon Fraser University, SIAT; University of British Columbia, MAGIC",
"fullName": "Minjung Kim",
"givenName": "Minjung",
"surname": "Kim",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Simon Fraser University, SIAT; University of British Columbia, MAGIC",
"fullName": "Andrew Wade",
"givenName": "Andrew",
"surname": "Wade",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Simon Fraser University, SIAT; University of British Columbia, MAGIC",
"fullName": "William O. Chao",
"givenName": "William O.",
"surname": "Chao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Simon Fraser University, SIAT; University of British Columbia, MAGIC",
"fullName": "Kevin Ho",
"givenName": "Kevin",
"surname": "Ho",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Simon Fraser University, SIAT; University of British Columbia, MAGIC",
"fullName": "Linda Kaastra",
"givenName": "Linda",
"surname": "Kaastra",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Simon Fraser University, SIAT; University of British Columbia, MAGIC",
"fullName": "Brian Fisher",
"givenName": "Brian",
"surname": "Fisher",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Simon Fraser University, SIAT; University of British Columbia, MAGIC",
"fullName": "John Dill",
"givenName": "John",
"surname": "Dill",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vast",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2007-10-01T00:00:00",
"pubType": "proceedings",
"pages": "223-224",
"year": "2007",
"issn": null,
"isbn": "978-1-4244-1659-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04389027",
"articleId": "12OmNynJMPC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04389030",
"articleId": "12OmNxWLTv6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/c5/2006/2563/0/25630120",
"title": "New Collaborative Tools",
"doi": null,
"abstractUrl": "/proceedings-article/c5/2006/25630120/12OmNAWH9J5",
"parentPublication": {
"id": "proceedings/c5/2006/2563/0",
"title": "2006 4th International Conference on Creating, Connecting and Collaborating through Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/1999/0001/1/00011018",
"title": "Knowledge Work as Collaborative Work: A Situated Activity Theory View",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1999/00011018/12OmNCzsKEd",
"parentPublication": {
"id": "proceedings/hicss/1999/0001/1",
"title": "Proceedings of the 32nd Annual Hawaii International Conference on Systems Sciences. 1999. HICSS-32. Abstracts and CD-ROM of Full Papers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2007/1659/0/04389011",
"title": "Design Considerations for Collaborative Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2007/04389011/12OmNvqW6XW",
"parentPublication": {
"id": "proceedings/vast/2007/1659/0",
"title": "2007 IEEE Symposium on Visual Analytics Science and Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icce/2002/1509/0/15090668",
"title": "Collaborative Second Language Writing: An Activity Analysis of Web Conferencing",
"doi": null,
"abstractUrl": "/proceedings-article/icce/2002/15090668/12OmNx8wTgJ",
"parentPublication": {
"id": "proceedings/icce/2002/1509/0",
"title": "Computers in Education, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsym/2016/3438/0/07858556",
"title": "On the Design of Multi-User Streaming Feedback System for Application of Cooperative Learning",
"doi": null,
"abstractUrl": "/proceedings-article/compsym/2016/07858556/12OmNyqRnn7",
"parentPublication": {
"id": "proceedings/compsym/2016/3438/0",
"title": "2016 International Computer Symposium (ICS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/t4e/2015/9509/0/9509a031",
"title": "Analytics Using Activity Trackers in the Field of Education",
"doi": null,
"abstractUrl": "/proceedings-article/t4e/2015/9509a031/12OmNzYwcbI",
"parentPublication": {
"id": "proceedings/t4e/2015/9509/0",
"title": "2015 IEEE Seventh International Conference on Technology for Education (T4E)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08019880",
"title": "Beyond Tasks: An Activity Typology for Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019880/13rRUwdrdSD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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/2021/02/09229116",
"title": "Uplift: A Tangible and Immersive Tabletop System for Casual Collaborative Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09229116/1o3nxDL2TGU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percom-workshops/2021/0424/0/09431008",
"title": "TAP: A Transformer based Activity Prediction Exploiting Temporal Relations in Collaborative Tasks",
"doi": null,
"abstractUrl": "/proceedings-article/percom-workshops/2021/09431008/1tROOI2N19S",
"parentPublication": {
"id": "proceedings/percom-workshops/2021/0424/0",
"title": "2021 IEEE International Conference on Pervasive Computing and Communications Workshops and other Affiliated Events (PerCom Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "18j8XijMg2k",
"title": "2018 IEEE Frontiers in Education Conference (FIE)",
"acronym": "fie",
"groupId": "1000297",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "18j9bCxcE4U",
"doi": "10.1109/FIE.2018.8659260",
"title": "The WREASN Typology of Student Involvement Activities",
"normalizedTitle": "The WREASN Typology of Student Involvement Activities",
"abstract": "This Research Work in Progress paper presents a typology for categorizing undergraduate extra-curricular activities. We observed that the all of the activities listed on a corpus of student resumes could be fully described by defining two levels of identifiers, the first of which describes the type of activity while the second is a descriptor of the activity. As a proof of concept, the typology was applied to resumes of participants in a program that serves underrepresented students studying engineering at a large public R1 institution. Simple descriptive findings are reported, and potential future applications are discussed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This Research Work in Progress paper presents a typology for categorizing undergraduate extra-curricular activities. We observed that the all of the activities listed on a corpus of student resumes could be fully described by defining two levels of identifiers, the first of which describes the type of activity while the second is a descriptor of the activity. As a proof of concept, the typology was applied to resumes of participants in a program that serves underrepresented students studying engineering at a large public R1 institution. Simple descriptive findings are reported, and potential future applications are discussed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This Research Work in Progress paper presents a typology for categorizing undergraduate extra-curricular activities. We observed that the all of the activities listed on a corpus of student resumes could be fully described by defining two levels of identifiers, the first of which describes the type of activity while the second is a descriptor of the activity. As a proof of concept, the typology was applied to resumes of participants in a program that serves underrepresented students studying engineering at a large public R1 institution. Simple descriptive findings are reported, and potential future applications are discussed.",
"fno": "08659260",
"keywords": [
"Educational Courses",
"Educational Institutions",
"Engineering Education",
"WREASN Typology",
"Student Resumes",
"Undergraduate Extra Curricular Activities",
"Public R 1 Institution",
"Organizations",
"Resumes",
"Education",
"Sociology",
"Statistics",
"Standards Organizations",
"Co Curricular Activities",
"Extra Curricular Activities",
"Typology"
],
"authors": [
{
"affiliation": "Retention & Academic Support College of Engineering, University of Michigan, Ann Arbor, MI",
"fullName": "R. M. Mwenesi",
"givenName": "R. M.",
"surname": "Mwenesi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Information, University of Michigan, Ann Arbor, MI",
"fullName": "E. Brennan-Wydra",
"givenName": "E.",
"surname": "Brennan-Wydra",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Center for Engineering Diversity & Outreach, University of Michigan, Ann Arbor, MI",
"fullName": "C. Sanchez",
"givenName": "C.",
"surname": "Sanchez",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Center for Engineering Diversity & Outreach, University of Michigan, Ann Arbor, MI",
"fullName": "M. Ellis",
"givenName": "M.",
"surname": "Ellis",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Retention & Academic Support College of Engineering, University of Michigan, Ann Arbor, MI",
"fullName": "D. Koch",
"givenName": "D.",
"surname": "Koch",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "STEM Program Development; Women in Science & Eng., University of Michigan, Ann Arbor, MI",
"fullName": "C. S. Davis",
"givenName": "C. S.",
"surname": "Davis",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Materials Science & Engineering, University of Michigan, Ann Arbor, MI",
"fullName": "J. M. Millunchick",
"givenName": "J. M.",
"surname": "Millunchick",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "fie",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-10-01T00:00:00",
"pubType": "proceedings",
"pages": "1-3",
"year": "2018",
"issn": null,
"isbn": "978-1-5386-1174-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08658384",
"articleId": "18j91on3gUo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08658959",
"articleId": "18j9kEeLXK8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/big-data/2016/9005/0/07841091",
"title": "CareerMapper: An automated resume evaluation tool",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2016/07841091/12OmNBlXs9V",
"parentPublication": {
"id": "proceedings/big-data/2016/9005/0",
"title": "2016 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2015/7367/0/7367e844",
"title": "Students' and Parents' Attitudes towards Online Privacy: An International Study",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2015/7367e844/12OmNrAMEWf",
"parentPublication": {
"id": "proceedings/hicss/2015/7367/0",
"title": "2015 48th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2016/8985/0/8985a552",
"title": "A Framework to Surrogate the Postgraduate Education with Public Data",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2016/8985a552/12OmNwcCIMq",
"parentPublication": {
"id": "proceedings/iiai-aai/2016/8985/0",
"title": "2016 5th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwesep/2016/1851/0/1851a057",
"title": "Open Source Resume (OSR): A Visualization Tool for Presenting OSS Biographies of Developers",
"doi": null,
"abstractUrl": "/proceedings-article/iwesep/2016/1851a057/12OmNzYwc1Q",
"parentPublication": {
"id": "proceedings/iwesep/2016/1851/0",
"title": "2016 7th International Workshop on Empirical Software Engineering in Practice (IWESEP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cedem/2017/6718/0/08046287",
"title": "The Main and Spillover Effects of Online Deliberation: Changes in Opinions, Informational Media Use and Political Activities",
"doi": null,
"abstractUrl": "/proceedings-article/cedem/2017/08046287/12OmNzzP5AD",
"parentPublication": {
"id": "proceedings/cedem/2017/6718/0",
"title": "2017 Conference for E-Democracy and Open Government (CeDEM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08019880",
"title": "Beyond Tasks: An Activity Typology for Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019880/13rRUwdrdSD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2019/1746/0/09028556",
"title": "Senioritis From the Student’s Perspective",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2019/09028556/1ifffscZpJu",
"parentPublication": {
"id": "proceedings/fie/2019/1746/0",
"title": "2019 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2020/7445/0/09150343",
"title": "PDCunplugged: A Free Repository of Unplugged Parallel Distributed Computing Activities",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2020/09150343/1lPGD4m69ig",
"parentPublication": {
"id": "proceedings/ipdpsw/2020/7445/0",
"title": "2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2020/7303/0/730300a196",
"title": "Developing Predictors for Student Involvement in Generic Competency Development Activities in Smart Learning Environment",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2020/730300a196/1nkDouJIJWg",
"parentPublication": {
"id": "proceedings/compsac/2020/7303/0",
"title": "2020 IEEE 44th Annual Computers, Software, and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2021/3851/0/09637407",
"title": "Design the Future Activities (DFA): Typology of Content for Case Studies",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2021/09637407/1zuwuEq9DLG",
"parentPublication": {
"id": "proceedings/fie/2021/3851/0",
"title": "2021 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1yXuCJ40piw",
"title": "2021 Conference on Research in Equitable and Sustained Participation in Engineering, Computing, and Technology (RESPECT)",
"acronym": "respect",
"groupId": "1809604",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1yXuJUyAgak",
"doi": "10.1109/RESPECT51740.2021.9620553",
"title": "A Typology of Models for Integrating Computational Thinking in Science (CT+S)",
"normalizedTitle": "A Typology of Models for Integrating Computational Thinking in Science (CT+S)",
"abstract": "In order to expand opportunities to learn computer science (CS), there is a growing push for inclusion of CS concepts and practices, such as computational thinking (CT), in required subjects like science. Integrated, transdisciplinary (CS/CT+X) approaches have shown promise for broadening access to CS and CT learning opportunities, addressing potential self-selection bias associated with elective CS coursework and afterschool programs, and promoting a more expansive and authentic contextualization of CS work. Emerging research also points to pedagogical strategies that can transcend simply broadening access, by also working to confront barriers to equitable and inclusive engagement in CS. Yet, approaches to integration vary widely, and there is little consensus on whether and how different models for CS and CT integration contribute to desired outcomes. There has also been little theory development that can ground systematic examination of the affordances and tradeoffs of different models. Toward that end, we propose a typology through which to examine CT integration in science (CT +S). The purpose of delineating a typology of CT+S integration is to encourage instantiation, implementation, and inspection of different models for integration, and to promote shared understanding among learning designers, researchers, and practitioners working at the intersection of CT and science. For each model in the typology, we characterize how CT+S integration is accomplished, the ways in which CT learning supports science learning, and the affordances and tensions for equity and inclusion that may arise upon implementation in science classrooms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In order to expand opportunities to learn computer science (CS), there is a growing push for inclusion of CS concepts and practices, such as computational thinking (CT), in required subjects like science. Integrated, transdisciplinary (CS/CT+X) approaches have shown promise for broadening access to CS and CT learning opportunities, addressing potential self-selection bias associated with elective CS coursework and afterschool programs, and promoting a more expansive and authentic contextualization of CS work. Emerging research also points to pedagogical strategies that can transcend simply broadening access, by also working to confront barriers to equitable and inclusive engagement in CS. Yet, approaches to integration vary widely, and there is little consensus on whether and how different models for CS and CT integration contribute to desired outcomes. There has also been little theory development that can ground systematic examination of the affordances and tradeoffs of different models. Toward that end, we propose a typology through which to examine CT integration in science (CT +S). The purpose of delineating a typology of CT+S integration is to encourage instantiation, implementation, and inspection of different models for integration, and to promote shared understanding among learning designers, researchers, and practitioners working at the intersection of CT and science. For each model in the typology, we characterize how CT+S integration is accomplished, the ways in which CT learning supports science learning, and the affordances and tensions for equity and inclusion that may arise upon implementation in science classrooms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In order to expand opportunities to learn computer science (CS), there is a growing push for inclusion of CS concepts and practices, such as computational thinking (CT), in required subjects like science. Integrated, transdisciplinary (CS/CT+X) approaches have shown promise for broadening access to CS and CT learning opportunities, addressing potential self-selection bias associated with elective CS coursework and afterschool programs, and promoting a more expansive and authentic contextualization of CS work. Emerging research also points to pedagogical strategies that can transcend simply broadening access, by also working to confront barriers to equitable and inclusive engagement in CS. Yet, approaches to integration vary widely, and there is little consensus on whether and how different models for CS and CT integration contribute to desired outcomes. There has also been little theory development that can ground systematic examination of the affordances and tradeoffs of different models. Toward that end, we propose a typology through which to examine CT integration in science (CT +S). The purpose of delineating a typology of CT+S integration is to encourage instantiation, implementation, and inspection of different models for integration, and to promote shared understanding among learning designers, researchers, and practitioners working at the intersection of CT and science. For each model in the typology, we characterize how CT+S integration is accomplished, the ways in which CT learning supports science learning, and the affordances and tensions for equity and inclusion that may arise upon implementation in science classrooms.",
"fno": "09620553",
"keywords": [
"Computer Science Education",
"Educational Courses",
"Typology",
"CT S",
"Science Learning",
"Science Classrooms",
"Computer Science",
"Transdisciplinary Approaches",
"CT Learning Opportunities",
"Afterschool Programs",
"Equitable Engagement",
"Inclusive Engagement",
"Computational Thinking In Science",
"Self Selection Bias",
"Elective CS Coursework",
"Pedagogical Strategies",
"Systematic Examination",
"Computer Science",
"Electric Potential",
"Systematics",
"Computational Modeling",
"Affordances",
"Tools",
"Inspection",
"Equity And Inclusion In Computing",
"Computational Thinking",
"Transdisciplinary CT X Curriculum Models"
],
"authors": [
{
"affiliation": "University of California, Berkeley,Lawrence Hall of Science,Berkeley,CA,USA",
"fullName": "Ari Krakowski",
"givenName": "Ari",
"surname": "Krakowski",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of California, Berkeley,Lawrence Hall of Science,Berkeley,CA,USA",
"fullName": "Eric Greenwald",
"givenName": "Eric",
"surname": "Greenwald",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Pennsylvania,Graduate School of Education,Philadelphia,PA,USA",
"fullName": "Meghan Comstock",
"givenName": "Meghan",
"surname": "Comstock",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of California, Berkeley,Lawrence Hall of Science,Berkeley,CA,USA",
"fullName": "Natalie Roman",
"givenName": "Natalie",
"surname": "Roman",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Lake Washington School District,Redmond,WA,USA",
"fullName": "Jacob Duke",
"givenName": "Jacob",
"surname": "Duke",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "respect",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-05-01T00:00:00",
"pubType": "proceedings",
"pages": "1-6",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-4905-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09620605",
"articleId": "1yXuGZ849DG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09620635",
"articleId": "1yXuKBHTD6o",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/fie/2015/8454/0/07344063",
"title": "DISSECT: Exploring the relationship between computational thinking and English literature in K-12 curricula",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2015/07344063/12OmNqHItuP",
"parentPublication": {
"id": "proceedings/fie/2015/8454/0",
"title": "2015 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2015/8454/0/07344239",
"title": "Computational thinking and impacts on K-12 science education",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2015/07344239/12OmNqNosdx",
"parentPublication": {
"id": "proceedings/fie/2015/8454/0",
"title": "2015 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2012/1353/0/06462487",
"title": "Work in progress: Teaching computational thinking in middle and high school",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2012/06462487/12OmNqyUUuN",
"parentPublication": {
"id": "proceedings/fie/2012/1353/0",
"title": "2012 Frontiers in Education Conference Proceedings",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2010/6261/0/05673139",
"title": "Integrating Mathematical Thinking, Abstract Thinking, and Computational Thinking",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2010/05673139/12OmNzJbQZA",
"parentPublication": {
"id": "proceedings/fie/2010/6261/0",
"title": "2010 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2022/11/09928309",
"title": "Project moveSMART: When Physical Education Meets Computational Thinking in Elementary Classrooms",
"doi": null,
"abstractUrl": "/magazine/co/2022/11/09928309/1HJuJfg537a",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mass/2022/7180/0/718000a710",
"title": "Integrating Computer Science and Physical Education in Elementary Schools with Data Science Learning Modules Using Wearable Microcontrollers",
"doi": null,
"abstractUrl": "/proceedings-article/mass/2022/718000a710/1JeEe6LVcAM",
"parentPublication": {
"id": "proceedings/mass/2022/7180/0",
"title": "2022 IEEE 19th International Conference on Mobile Ad Hoc and Smart Systems (MASS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/respect/2020/7172/1/09272439",
"title": "Rural Research-to-Practice Partnerships Integrating Computer Science K-8",
"doi": null,
"abstractUrl": "/proceedings-article/respect/2020/09272439/1phRVHOR3l6",
"parentPublication": {
"id": "proceedings/respect/2020/7172/1",
"title": "2020 Research on Equity and Sustained Participation in Engineering, Computing, and Technology (RESPECT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/respect/2020/7172/1/09272488",
"title": "Supporting Teachers to Integrate Computational Thinking Equitably",
"doi": null,
"abstractUrl": "/proceedings-article/respect/2020/09272488/1phRWioyruw",
"parentPublication": {
"id": "proceedings/respect/2020/7172/1",
"title": "2020 Research on Equity and Sustained Participation in Engineering, Computing, and Technology (RESPECT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/respect/2020/7172/1/09272483",
"title": "Examining Teacher Perspectives on Computational Thinking in K-12 Classrooms",
"doi": null,
"abstractUrl": "/proceedings-article/respect/2020/09272483/1phRXw3dNWE",
"parentPublication": {
"id": "proceedings/respect/2020/7172/1",
"title": "2020 Research on Equity and Sustained Participation in Engineering, Computing, and Technology (RESPECT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/respect/2021/4905/0/09620608",
"title": "Computational thinking in elementary classrooms: Using classroom dialogue to measure equitable participation",
"doi": null,
"abstractUrl": "/proceedings-article/respect/2021/09620608/1yXuHtZw9sA",
"parentPublication": {
"id": "proceedings/respect/2021/4905/0",
"title": "2021 Conference on Research in Equitable and Sustained Participation in Engineering, Computing, and Technology (RESPECT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwCJOY5",
"title": "2015 IEEE International Conference on Big Data (Big Data)",
"acronym": "big-data",
"groupId": "1802964",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBtCCDh",
"doi": "10.1109/BigData.2015.7363993",
"title": "Forecast UPC-level FMCG demand, Part I: Exploratory analysis and visualization",
"normalizedTitle": "Forecast UPC-level FMCG demand, Part I: Exploratory analysis and visualization",
"abstract": "We are interested in forecasting a large collection of FMCG demand time series. As the demand of FMCG exists in a hierarchy (from manufacturers to distributors to retailers), the bottom level of the hierarchy may contain thousands or even millions of time series. Producing aggregate consistent forecasts while utilizing the unique features from each time series thus become a technical challenge. To achieve better forecasting results, exploratory analysis is often necessary to obtain insights on the underlying demand generating mechanism for each time series. Exploratory analysis aims at discovering those so-called \"exogenous factors\", such as price, demand of the complementary/substitutive goods and calendar events, which can help explain some of the demand fluctuation. During forecast accuracy evaluation, outlier detection is also important; a single anomalous time series can contribute much to the overall error. However, in a big data (such as retailing scanner data) enabled environment, exploratory analysis and visualization need much attention, because of the non-scalable nature of the existing methods. Scalability is essential for exogenous factor selection and outlier detection in big time series data. In Part I of this two-part paper, we introduce some exploratory analytics and visualization methods (from not scalable to very scalable) for big retailing time series. Forecasting of the hierarchical FMCG demand is addressed in Part II.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We are interested in forecasting a large collection of FMCG demand time series. As the demand of FMCG exists in a hierarchy (from manufacturers to distributors to retailers), the bottom level of the hierarchy may contain thousands or even millions of time series. Producing aggregate consistent forecasts while utilizing the unique features from each time series thus become a technical challenge. To achieve better forecasting results, exploratory analysis is often necessary to obtain insights on the underlying demand generating mechanism for each time series. Exploratory analysis aims at discovering those so-called \"exogenous factors\", such as price, demand of the complementary/substitutive goods and calendar events, which can help explain some of the demand fluctuation. During forecast accuracy evaluation, outlier detection is also important; a single anomalous time series can contribute much to the overall error. However, in a big data (such as retailing scanner data) enabled environment, exploratory analysis and visualization need much attention, because of the non-scalable nature of the existing methods. Scalability is essential for exogenous factor selection and outlier detection in big time series data. In Part I of this two-part paper, we introduce some exploratory analytics and visualization methods (from not scalable to very scalable) for big retailing time series. Forecasting of the hierarchical FMCG demand is addressed in Part II.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We are interested in forecasting a large collection of FMCG demand time series. As the demand of FMCG exists in a hierarchy (from manufacturers to distributors to retailers), the bottom level of the hierarchy may contain thousands or even millions of time series. Producing aggregate consistent forecasts while utilizing the unique features from each time series thus become a technical challenge. To achieve better forecasting results, exploratory analysis is often necessary to obtain insights on the underlying demand generating mechanism for each time series. Exploratory analysis aims at discovering those so-called \"exogenous factors\", such as price, demand of the complementary/substitutive goods and calendar events, which can help explain some of the demand fluctuation. During forecast accuracy evaluation, outlier detection is also important; a single anomalous time series can contribute much to the overall error. However, in a big data (such as retailing scanner data) enabled environment, exploratory analysis and visualization need much attention, because of the non-scalable nature of the existing methods. Scalability is essential for exogenous factor selection and outlier detection in big time series data. In Part I of this two-part paper, we introduce some exploratory analytics and visualization methods (from not scalable to very scalable) for big retailing time series. Forecasting of the hierarchical FMCG demand is addressed in Part II.",
"fno": "07363993",
"keywords": [
"Time Series Analysis",
"Forecasting",
"Data Visualization",
"Indexes",
"Big Data",
"Predictive Models",
"Aggregates",
"Visualization",
"FMCG",
"Forecasting",
"Hierarchical Reconciliation"
],
"authors": [
{
"affiliation": "Singapore Institute of Manufacturing Technology (SIMTech) Agency for Science, Technology and Research (A∗STAR) Singapore, Singapore",
"fullName": "Dazhi Yang",
"givenName": "Dazhi",
"surname": "Yang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Singapore Institute of Manufacturing Technology (SIMTech) Agency for Science, Technology and Research (A∗STAR) Singapore, Singapore",
"fullName": "Gary S. W. Goh",
"givenName": "Gary S. W.",
"surname": "Goh",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Singapore Institute of Manufacturing Technology (SIMTech) Agency for Science, Technology and Research (A∗STAR) Singapore, Singapore",
"fullName": "Chi Xu",
"givenName": "Chi",
"surname": "Xu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Singapore Institute of Manufacturing Technology (SIMTech) Agency for Science, Technology and Research (A∗STAR) Singapore, Singapore",
"fullName": "Allan N. Zhang",
"givenName": "Allan N.",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Antuit Singapore, Singapore",
"fullName": "Orkan Akcan",
"givenName": "Orkan",
"surname": "Akcan",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "big-data",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-10-01T00:00:00",
"pubType": "proceedings",
"pages": "2106-2112",
"year": "2015",
"issn": null,
"isbn": "978-1-4799-9926-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07363992",
"articleId": "12OmNx4Q6NE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07363994",
"articleId": "12OmNyL0TED",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/wkdd/2009/3543/0/3543a308",
"title": "The Forecast of Power Demand Cycle Turning Points Based on ARMA",
"doi": null,
"abstractUrl": "/proceedings-article/wkdd/2009/3543a308/12OmNvTBBcp",
"parentPublication": {
"id": "proceedings/wkdd/2009/3543/0",
"title": "2009 Second International Workshop on Knowledge Discovery and Data Mining. WKDD 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ncm/2008/3322/2/3322b050",
"title": "A Fuzzy Time Series Model to Forecast the BDI",
"doi": null,
"abstractUrl": "/proceedings-article/ncm/2008/3322b050/12OmNwLOYTw",
"parentPublication": {
"id": "proceedings/ncm/2008/3322/2",
"title": "Networked Computing and Advanced Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icebe/2013/5111/0/5111a230",
"title": "Simulated Annealing Sales Combining Forecast in FMCG",
"doi": null,
"abstractUrl": "/proceedings-article/icebe/2013/5111a230/12OmNxwncG9",
"parentPublication": {
"id": "proceedings/icebe/2013/5111/0",
"title": "2013 IEEE 10th International Conference on e-Business Engineering (ICEBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2015/9926/0/07363994",
"title": "Forecast UPC-level FMCG demand, Part II: Hierarchical reconciliation",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2015/07363994/12OmNyL0TED",
"parentPublication": {
"id": "proceedings/big-data/2015/9926/0",
"title": "2015 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2016/9005/0/07841053",
"title": "Forecast UPC-level FMCG demand, Part III: Grouped reconciliation",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2016/07841053/12OmNzcPAAr",
"parentPublication": {
"id": "proceedings/big-data/2016/9005/0",
"title": "2016 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2018/5035/0/08622029",
"title": "Forecast UPC-Level FMCG Demand, Part IV: Statistical Ensemble",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2018/08622029/17D45VTRoDs",
"parentPublication": {
"id": "proceedings/big-data/2018/5035/0",
"title": "2018 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2009/3735/3/05358957",
"title": "Combination Forecasting of Fuzzy Forecast",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/05358957/17D45XeKgog",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/3",
"title": "2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2022/5099/0/509900a378",
"title": "A Large-Scale Ensemble Learning Framework for Demand Forecasting",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2022/509900a378/1KpCvF3seVa",
"parentPublication": {
"id": "proceedings/icdm/2022/5099/0",
"title": "2022 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2021/2463/0/246300a218",
"title": "A Novel Dynamic Demand Forecasting Model for Resilient Supply Chains using Machine Learning",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2021/246300a218/1wLcmehUYco",
"parentPublication": {
"id": "proceedings/compsac/2021/2463/0",
"title": "2021 IEEE 45th Annual Computers, Software, and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iri/2021/3875/0/387500a402",
"title": "Emerging Trends Demand Forecast using Dynamic Time Warping",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2021/387500a402/1yBG8Fe6HrW",
"parentPublication": {
"id": "proceedings/iri/2021/3875/0",
"title": "2021 IEEE 22nd International Conference on Information Reuse and Integration for Data Science (IRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNynsbD8",
"title": "2012 SC Companion: High Performance Computing, Networking, Storage and Analysis (SCC)",
"acronym": "scc",
"groupId": "1802397",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqBbHWg",
"doi": "10.1109/SC.Companion.2012.69",
"title": "Exploratory Climate Data Visualization and Analysis Using DV3D and UVCDAT",
"normalizedTitle": "Exploratory Climate Data Visualization and Analysis Using DV3D and UVCDAT",
"abstract": "Earth system scientists are being inundated by an explosion of data generated by ever-increasing resolution in both global models and remote sensors. Advanced tools for accessing, analyzing, and visualizing very large and complex climate data are required to maintain rapid progress in Earth system research. To meet this need, NASA, in collaboration with the Ultra-scale Visualization Climate Data Analysis Tools (UVCDAT) consortium, is developing exploratory climate data analysis and visualization tools which provide data analysis capabilities for the Earth System Grid (ESG). This paper describes DV3D, a UV-CDAT package that enables exploratory analysis of climate simulation and observation datasets. DV3D provides user-friendly interfaces for visualization and analysis of climate data at a level appropriate for scientists. It features workflow interfaces, interactive 4D data exploration, hyperwall and stereo visualization, automated provenance generation, and parallel task execution. DV3D's integration with CDAT's climate data management system (CDMS) and other climate data analysis tools provides a wide range of high performance climate data analysis operations. DV3D expands the scientists' toolbox by incorporating a suite of rich new exploratory visualization and analysis methods for addressing the complexity of climate datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Earth system scientists are being inundated by an explosion of data generated by ever-increasing resolution in both global models and remote sensors. Advanced tools for accessing, analyzing, and visualizing very large and complex climate data are required to maintain rapid progress in Earth system research. To meet this need, NASA, in collaboration with the Ultra-scale Visualization Climate Data Analysis Tools (UVCDAT) consortium, is developing exploratory climate data analysis and visualization tools which provide data analysis capabilities for the Earth System Grid (ESG). This paper describes DV3D, a UV-CDAT package that enables exploratory analysis of climate simulation and observation datasets. DV3D provides user-friendly interfaces for visualization and analysis of climate data at a level appropriate for scientists. It features workflow interfaces, interactive 4D data exploration, hyperwall and stereo visualization, automated provenance generation, and parallel task execution. DV3D's integration with CDAT's climate data management system (CDMS) and other climate data analysis tools provides a wide range of high performance climate data analysis operations. DV3D expands the scientists' toolbox by incorporating a suite of rich new exploratory visualization and analysis methods for addressing the complexity of climate datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Earth system scientists are being inundated by an explosion of data generated by ever-increasing resolution in both global models and remote sensors. Advanced tools for accessing, analyzing, and visualizing very large and complex climate data are required to maintain rapid progress in Earth system research. To meet this need, NASA, in collaboration with the Ultra-scale Visualization Climate Data Analysis Tools (UVCDAT) consortium, is developing exploratory climate data analysis and visualization tools which provide data analysis capabilities for the Earth System Grid (ESG). This paper describes DV3D, a UV-CDAT package that enables exploratory analysis of climate simulation and observation datasets. DV3D provides user-friendly interfaces for visualization and analysis of climate data at a level appropriate for scientists. It features workflow interfaces, interactive 4D data exploration, hyperwall and stereo visualization, automated provenance generation, and parallel task execution. DV3D's integration with CDAT's climate data management system (CDMS) and other climate data analysis tools provides a wide range of high performance climate data analysis operations. DV3D expands the scientists' toolbox by incorporating a suite of rich new exploratory visualization and analysis methods for addressing the complexity of climate datasets.",
"fno": "06495851",
"keywords": [
"Climatology",
"Data Visualisation",
"Earth",
"Geophysics Computing",
"Human Computer Interaction",
"Interactive Systems",
"Software Packages",
"User Interfaces",
"Climate Data Visualization",
"Climate Data Analysis",
"DV 3 D",
"Global Models",
"Remote Sensors",
"Climate Data Accessing",
"Earth System Research",
"NASA",
"Ultrascale Visualization Climate Data Analysis Tool Consortium",
"Earth System Grid",
"ESG",
"UV CDAT Package",
"User Friendly Interfaces",
"Workflow Interfaces",
"Interactive 4 D Data Exploration",
"Hyperwall",
"Stereo Visualization",
"Automated Provenance Generation",
"Parallel Task Execution",
"Climate Data Management System",
"CDMS",
"Climate",
"Visualization",
"Analysis",
"Simulation"
],
"authors": [
{
"affiliation": null,
"fullName": "Thomas P. Maxwell",
"givenName": "Thomas P.",
"surname": "Maxwell",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "scc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-11-01T00:00:00",
"pubType": "proceedings",
"pages": "483-487",
"year": "2012",
"issn": null,
"isbn": "978-1-4673-6218-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06495850",
"articleId": "12OmNzcPAl7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06495852",
"articleId": "12OmNwoPtrg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icmla/2008/3495/0/3495a388",
"title": "Mapping Uncharted Waters: Exploratory Analysis, Visualization, and Clustering of Oceanographic Data",
"doi": null,
"abstractUrl": "/proceedings-article/icmla/2008/3495a388/12OmNAio72I",
"parentPublication": {
"id": "proceedings/icmla/2008/3495/0",
"title": "2008 Seventh International Conference on Machine Learning and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2009/3902/0/3902a254",
"title": "The Flexible Climate Data Analysis Tools (CDAT) for Multi-model Climate Simulation Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2009/3902a254/12OmNvAAtql",
"parentPublication": {
"id": "proceedings/icdmw/2009/3902/0",
"title": "2009 IEEE International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2010/7846/0/05571316",
"title": "Evaluating Climate Visualization: An Information Visualization Approach",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2010/05571316/12OmNwbukeD",
"parentPublication": {
"id": "proceedings/iv/2010/7846/0",
"title": "2010 14th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sccompanion/2012/4956/0/4956a483",
"title": "Exploratory Climate Data Visualization and Analysis Using DV3D and UVCDAT",
"doi": null,
"abstractUrl": "/proceedings-article/sccompanion/2012/4956a483/12OmNwtn3BU",
"parentPublication": {
"id": "proceedings/sccompanion/2012/4956/0",
"title": "2012 SC Companion: High Performance Computing, Networking Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2011/0868/0/06004058",
"title": "Information Visualization in Climate Research",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2011/06004058/12OmNyO8tVC",
"parentPublication": {
"id": "proceedings/iv/2011/0868/0",
"title": "2011 15th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2010/7559/0/75590030",
"title": "An Adaptive Framework for Simulation and Online Remote Visualization of Critical Climate Applications in Resource-constrained Environments",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2010/75590030/12OmNzn38Vt",
"parentPublication": {
"id": "proceedings/sc/2010/7559/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2008/02/tth2008020130",
"title": "Using Haptics to Convey Cause-and-Effect Relations in Climate Visualization",
"doi": null,
"abstractUrl": "/journal/th/2008/02/tth2008020130/13rRUwIF6dX",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/09/07061479",
"title": "Bridging Theory with Practice: An Exploratory Study of Visualization Use and Design for Climate Model Comparison",
"doi": null,
"abstractUrl": "/journal/tg/2015/09/07061479/13rRUyfbwqL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/01/09325141",
"title": "Visualization of Climate Change",
"doi": null,
"abstractUrl": "/magazine/cg/2021/01/09325141/1qnQSeB3gME",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/01/09325132",
"title": "Visualization of Climate Science Simulation Data",
"doi": null,
"abstractUrl": "/magazine/cg/2021/01/09325132/1qnQT22F5zq",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNC3XhhD",
"title": "2014 IEEE 30th International Conference on Data Engineering (ICDE)",
"acronym": "icde",
"groupId": "1000178",
"volume": "0",
"displayVolume": "0",
"year": "2014",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwvDQxA",
"doi": "10.1109/ICDE.2014.6816747",
"title": "iCoDA: Interactive and exploratory data completeness analysis",
"normalizedTitle": "iCoDA: Interactive and exploratory data completeness analysis",
"abstract": "The completeness of data is vital to data quality. In this demo, we present iCoDA, a system that supports interactive, exploratory data completeness analysis. iCoDA provides algorithms and tools to generate tableau patterns that concisely summarize the incomplete data under various configuration settings. During the demo, the audience can use iCoDA to interactively explore the tableau patterns generated from incomplete data, with the flexibility of filtering and navigating through different granularity of these patterns. iCoDA supports various visualization methods to the audience for the display of tableau patterns. Overall, we will demonstrate that iCoDA provides sophisticated analysis of data completeness.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The completeness of data is vital to data quality. In this demo, we present iCoDA, a system that supports interactive, exploratory data completeness analysis. iCoDA provides algorithms and tools to generate tableau patterns that concisely summarize the incomplete data under various configuration settings. During the demo, the audience can use iCoDA to interactively explore the tableau patterns generated from incomplete data, with the flexibility of filtering and navigating through different granularity of these patterns. iCoDA supports various visualization methods to the audience for the display of tableau patterns. Overall, we will demonstrate that iCoDA provides sophisticated analysis of data completeness.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The completeness of data is vital to data quality. In this demo, we present iCoDA, a system that supports interactive, exploratory data completeness analysis. iCoDA provides algorithms and tools to generate tableau patterns that concisely summarize the incomplete data under various configuration settings. During the demo, the audience can use iCoDA to interactively explore the tableau patterns generated from incomplete data, with the flexibility of filtering and navigating through different granularity of these patterns. iCoDA supports various visualization methods to the audience for the display of tableau patterns. Overall, we will demonstrate that iCoDA provides sophisticated analysis of data completeness.",
"fno": "06816747",
"keywords": [
"Data Visualization",
"Monitoring",
"Detectors",
"Roads",
"Temperature Sensors",
"Loss Measurement",
"Image Color Analysis",
"Pattern Visualization",
"Data Completeness",
"Graph Tableau Discovery",
"Exploratory Pattern Analysis"
],
"authors": [
{
"affiliation": "Department of Computer Science, Stevens Institute of Technology, Hoboken, NJ 07030, USA",
"fullName": "Ruilin Liu",
"givenName": "Ruilin",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science, Stevens Institute of Technology, Hoboken, NJ 07030, USA",
"fullName": "Guan Wang",
"givenName": "Guan",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science, Stevens Institute of Technology, Hoboken, NJ 07030, USA",
"fullName": "Wendy Hui Wang",
"givenName": "Wendy Hui",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "AT&T Shannon Labs, 33 Thomas Street, New York 10017, USA",
"fullName": "Flip Korn",
"givenName": "Flip",
"surname": "Korn",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icde",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2014-03-01T00:00:00",
"pubType": "proceedings",
"pages": "1226-1229",
"year": "2014",
"issn": null,
"isbn": "978-1-4799-2555-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06816746",
"articleId": "12OmNy1SFNd",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06816748",
"articleId": "12OmNxisR0C",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2011/0868/0/06004059",
"title": "Exploratory Visualization for Weather Data Verification",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2011/06004059/12OmNAYXWEh",
"parentPublication": {
"id": "proceedings/iv/2011/0868/0",
"title": "2011 15th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etvis/2016/4731/0/07851162",
"title": "Saccadelenses: interactive exploratory filtering of eye tracking trajectories",
"doi": null,
"abstractUrl": "/proceedings-article/etvis/2016/07851162/12OmNAq3hKc",
"parentPublication": {
"id": "proceedings/etvis/2016/4731/0",
"title": "2016 IEEE Second Workshop on Eye Tracking and Visualization (ETVIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2016/9005/0/07841089",
"title": "Big data application in job trend analysis",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2016/07841089/12OmNvTBB0l",
"parentPublication": {
"id": "proceedings/big-data/2016/9005/0",
"title": "2016 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2011/0868/0/06004043",
"title": "Exploratory to Presentation Visualization, and Everything In-between: Providing Flexibility in Aesthetics, Interactions and Visual Layering",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2011/06004043/12OmNwNeYw0",
"parentPublication": {
"id": "proceedings/iv/2011/0868/0",
"title": "2011 15th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2001/1195/0/11950671",
"title": "Interactive Visualization Method for Exploratory Data Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2001/11950671/12OmNylKAXR",
"parentPublication": {
"id": "proceedings/iv/2001/1195/0",
"title": "Proceedings Fifth International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2012/4905/0/4905a359",
"title": "Understanding Data Completeness in Network Monitoring Systems",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2012/4905a359/12OmNzsJ7Br",
"parentPublication": {
"id": "proceedings/icdm/2012/4905/0",
"title": "2012 IEEE 12th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017577",
"title": "The Interactive Visualization Gap in Initial Exploratory Data Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017577/13rRUxC0SWe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06876022",
"title": "The Effects of Interactive Latency on Exploratory Visual Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06876022/13rRUxYINfd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2017/3163/0/08585564",
"title": "Interactive Visual Analytics Application for Spatiotemporal Movement Data VAST Challenge 2017 Mini-Challenge 1: Award for Actionable and Detailed Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585564/17D45VsBU7R",
"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/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"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1KfQshha0dW",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"acronym": "big-data",
"groupId": "10020192",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1KfR1XU5jZS",
"doi": "10.1109/BigData55660.2022.10020453",
"title": "Learning on Health Fairness and Environmental Justice via Interactive Visualization",
"normalizedTitle": "Learning on Health Fairness and Environmental Justice via Interactive Visualization",
"abstract": "This paper introduces an interactive visualization interface with a machine learning consensus analysis that enables the researchers to explore the impact of atmospheric and socioeconomic factors on COVID-19 clinical severity by employing multiple Recurrent Graph Neural Networks. We designed and implemented a visualization interface that leverages coordinated multi-views to support exploratory and predictive analysis of hospitalizations and other socio-geographic variables at multiple dimensions, simultaneously. By harnessing the strength of geometric deep learning, we build a consensus machine learning model to include knowledge from county-level records and investigate the complex interrelationships between global infectious disease, environment, and social justice. Additionally, we make use of unique NASA satellite-based observations which are not broadly used in the context of climate justice applications. Our current interactive interface focus on three US states (California, Pennsylvania, and Texas) to demonstrate its scientific value and presented three case studies to make qualitative evaluations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper introduces an interactive visualization interface with a machine learning consensus analysis that enables the researchers to explore the impact of atmospheric and socioeconomic factors on COVID-19 clinical severity by employing multiple Recurrent Graph Neural Networks. We designed and implemented a visualization interface that leverages coordinated multi-views to support exploratory and predictive analysis of hospitalizations and other socio-geographic variables at multiple dimensions, simultaneously. By harnessing the strength of geometric deep learning, we build a consensus machine learning model to include knowledge from county-level records and investigate the complex interrelationships between global infectious disease, environment, and social justice. Additionally, we make use of unique NASA satellite-based observations which are not broadly used in the context of climate justice applications. Our current interactive interface focus on three US states (California, Pennsylvania, and Texas) to demonstrate its scientific value and presented three case studies to make qualitative evaluations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper introduces an interactive visualization interface with a machine learning consensus analysis that enables the researchers to explore the impact of atmospheric and socioeconomic factors on COVID-19 clinical severity by employing multiple Recurrent Graph Neural Networks. We designed and implemented a visualization interface that leverages coordinated multi-views to support exploratory and predictive analysis of hospitalizations and other socio-geographic variables at multiple dimensions, simultaneously. By harnessing the strength of geometric deep learning, we build a consensus machine learning model to include knowledge from county-level records and investigate the complex interrelationships between global infectious disease, environment, and social justice. Additionally, we make use of unique NASA satellite-based observations which are not broadly used in the context of climate justice applications. Our current interactive interface focus on three US states (California, Pennsylvania, and Texas) to demonstrate its scientific value and presented three case studies to make qualitative evaluations.",
"fno": "10020453",
"keywords": [
"Data Visualisation",
"Deep Learning Artificial Intelligence",
"Diseases",
"Graph Neural Networks",
"Medical Information Systems",
"Recurrent Neural Nets",
"Social Aspects Of Automation",
"Climate Justice Applications",
"COVID 19 Clinical Severity",
"Environmental Justice",
"Geometric Deep Learning",
"Global Infectious Disease",
"Health Fairness",
"Interactive Visualization Interface",
"Machine Learning Consensus Analysis",
"Multiple Recurrent Graph Neural Networks",
"NASA Satellite Based Observations",
"Socioeconomic Factors",
"COVID 19",
"Visualization",
"Pandemics",
"Infectious Diseases",
"NASA",
"Data Visualization",
"Big Data",
"Coronavirus Severity",
"Interactive Visualization",
"Multivariate Visualization"
],
"authors": [
{
"affiliation": "University of North Carolina at Charlotte,Department of Computer Science,Charlotte,United States",
"fullName": "Abdullah-Al-Raihan Nayeem",
"givenName": "Abdullah-Al-Raihan",
"surname": "Nayeem",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "California Institute of Technology,Jet Propulsion Laboratory,Pasadena,United States",
"fullName": "Ignacio Segovia-Dominguez",
"givenName": "Ignacio",
"surname": "Segovia-Dominguez",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "California Institute of Technology,Jet Propulsion Laboratory,Pasadena,United States",
"fullName": "Huikyo Lee",
"givenName": "Huikyo",
"surname": "Lee",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Utah State University,Department of Computer Science,Logan,United States",
"fullName": "Dongyun Han",
"givenName": "Dongyun",
"surname": "Han",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Temple University,Department of Computer and Information Sciences,Philadelphia,United States",
"fullName": "Yuzhou Chen",
"givenName": "Yuzhou",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The University of Texas at Dallas,Department of Mathematical Sciences,Dallas,United States",
"fullName": "Zhiwei Zhen",
"givenName": "Zhiwei",
"surname": "Zhen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The University of Texas at Dallas,Department of Mathematical Sciences,Dallas,United States",
"fullName": "Yulia Gel",
"givenName": "Yulia",
"surname": "Gel",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of North Carolina at Charlotte,Department of Computer Science,Charlotte,United States",
"fullName": "Isaac Cho",
"givenName": "Isaac",
"surname": "Cho",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "big-data",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-12-01T00:00:00",
"pubType": "proceedings",
"pages": "784-791",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-8045-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "10021094",
"articleId": "1KfRpj5FcTm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10020796",
"articleId": "1KfS7nvfhe0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/big-data/2021/3902/0/09671810",
"title": "Characterizing Disease Spreading via Visibility Graph Embedding",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2021/09671810/1A8gPHJcyf6",
"parentPublication": {
"id": "proceedings/big-data/2021/3902/0",
"title": "2021 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2022/9519/0/951900a330",
"title": "Investigating the Process of Teaching the Creation of Interactive Art in a Collaborative Virtual Environmental Context",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2022/951900a330/1FUU6YclSW4",
"parentPublication": {
"id": "proceedings/icalt/2022/9519/0",
"title": "2022 International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mdm/2022/5176/0/517600a222",
"title": "PhyloView: A System to Visualize the Ecology of Infectious Diseases Using Phylogenetic Data",
"doi": null,
"abstractUrl": "/proceedings-article/mdm/2022/517600a222/1G89F0advDq",
"parentPublication": {
"id": "proceedings/mdm/2022/5176/0",
"title": "2022 23rd IEEE International Conference on Mobile Data Management (MDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2022/9755/0/975500a195",
"title": "FunPhysics: A Gamification-Based Web Platform for Interactive Teaching and Learning",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2022/975500a195/1GU76wcM5fa",
"parentPublication": {
"id": "proceedings/iiai-aai/2022/9755/0",
"title": "2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2023/01/09992069",
"title": "A Multiscale Geospatial Dataset and an Interactive Visualization Dashboard for Computational Epidemiology and Open Scientific Research",
"doi": null,
"abstractUrl": "/magazine/cg/2023/01/09992069/1JevM7t9fHO",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a593",
"title": "Interactive Data Driven Visualization for COVID-19 with Trends, Analytics and Forecasting",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a593/1rSR8XpoVtC",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2020/1056/0/09381414",
"title": "COVID19 Tracking: An Interactive Tracking, Visualizing and Analyzing Platform",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2020/09381414/1semJrthKWk",
"parentPublication": {
"id": "proceedings/asonam/2020/1056/0",
"title": "2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2021/4057/0/405700a675",
"title": "The Pickrick Protests: An Interactive Geo AR Experience",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2021/405700a675/1tnXKRWZwGY",
"parentPublication": {
"id": "proceedings/vrw/2021/4057/0",
"title": "2021 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2021/9184/0/918400c665",
"title": "CoWiz: Interactive Covid-19 Visualization Based On Multilayer Network Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2021/918400c665/1uGXlcKY6zK",
"parentPublication": {
"id": "proceedings/icde/2021/9184/0",
"title": "2021 IEEE 37th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis4good/2021/1366/0/136600a006",
"title": "Local, Interactive, and Actionable: a Pandemic Behavioral Nudge",
"doi": null,
"abstractUrl": "/proceedings-article/vis4good/2021/136600a006/1yNiRp7QI9O",
"parentPublication": {
"id": "proceedings/vis4good/2021/1366/0",
"title": "2021 IEEE Workshop on Visualization for Social Good (VIS4Good)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1E2weOclERO",
"title": "2022 IEEE 15th Pacific Visualization Symposium (PacificVis)",
"acronym": "pacificvis",
"groupId": "1001657",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1E2wmSIym52",
"doi": "10.1109/PacificVis53943.2022.00032",
"title": "Visual Analytics of Multiple Network Ranking Based on Structural Similarity",
"normalizedTitle": "Visual Analytics of Multiple Network Ranking Based on Structural Similarity",
"abstract": "Ranking the node importance in complex networks has been widely applied for different purposes, such as web search, resource allocation, and network security. However, existing node ranking methods are almost single network ranking using only one relationship, or aggregate the node ranking scores on multiple networks with equal weight, which are insufficient to construct reasonable multiple network rankings, since the association information among multiple networks is largely ignored. Thus, we propose a multiple network visualization framework by fusing multiple networks to obtain credible node ranking scores. After measuring the scores of nodes in each single network by the classic PageRank, a network weight self-adjustment model based on structural similarities between pair-wise networks is designed to strengthen the common features of multiple networks or their distinct characteristics. Then, a combined score for each node is computed by a weighted sum of its individual ranking scores on multiple networks. Besides, we provide a set of visualization and interaction interfaces, enabling users to intuitively explore, optimize and compare the multiple network rankings. Case studies on real datasets show that our system is flexible to adapt to different application scenarios, and users can successfully solve multiple network ranking tasks efficiently.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Ranking the node importance in complex networks has been widely applied for different purposes, such as web search, resource allocation, and network security. However, existing node ranking methods are almost single network ranking using only one relationship, or aggregate the node ranking scores on multiple networks with equal weight, which are insufficient to construct reasonable multiple network rankings, since the association information among multiple networks is largely ignored. Thus, we propose a multiple network visualization framework by fusing multiple networks to obtain credible node ranking scores. After measuring the scores of nodes in each single network by the classic PageRank, a network weight self-adjustment model based on structural similarities between pair-wise networks is designed to strengthen the common features of multiple networks or their distinct characteristics. Then, a combined score for each node is computed by a weighted sum of its individual ranking scores on multiple networks. Besides, we provide a set of visualization and interaction interfaces, enabling users to intuitively explore, optimize and compare the multiple network rankings. Case studies on real datasets show that our system is flexible to adapt to different application scenarios, and users can successfully solve multiple network ranking tasks efficiently.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Ranking the node importance in complex networks has been widely applied for different purposes, such as web search, resource allocation, and network security. However, existing node ranking methods are almost single network ranking using only one relationship, or aggregate the node ranking scores on multiple networks with equal weight, which are insufficient to construct reasonable multiple network rankings, since the association information among multiple networks is largely ignored. Thus, we propose a multiple network visualization framework by fusing multiple networks to obtain credible node ranking scores. After measuring the scores of nodes in each single network by the classic PageRank, a network weight self-adjustment model based on structural similarities between pair-wise networks is designed to strengthen the common features of multiple networks or their distinct characteristics. Then, a combined score for each node is computed by a weighted sum of its individual ranking scores on multiple networks. Besides, we provide a set of visualization and interaction interfaces, enabling users to intuitively explore, optimize and compare the multiple network rankings. Case studies on real datasets show that our system is flexible to adapt to different application scenarios, and users can successfully solve multiple network ranking tasks efficiently.",
"fno": "233500a196",
"keywords": [
"Complex Networks",
"Data Analysis",
"Data Visualisation",
"Search Engines",
"Complex Networks",
"Network Visualization",
"Pair Wise Networks",
"Network Ranking",
"Network Weight Self Adjustment",
"Node Ranking Scores",
"Visual Analytics",
"Structural Similarity",
"Node Importance Ranking",
"Association Information",
"Page Rank",
"Weighted Sum",
"Interaction Interfaces",
"Weight Measurement",
"Visual Analytics",
"Computational Modeling",
"Aggregates",
"Complex Networks",
"Network Security",
"Resource Management",
"Multiple Networks",
"Node Ranking",
"Visualization",
"Structural Similarity"
],
"authors": [
{
"affiliation": "School of Information, Zhejiang University of Finance and Economics,Hangzhou,China",
"fullName": "Aosheng Cheng",
"givenName": "Aosheng",
"surname": "Cheng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Information, Zhejiang University of Finance and Economics,Hangzhou,China",
"fullName": "Yulong Yin",
"givenName": "Yulong",
"surname": "Yin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Information, Zhejiang University of Finance and Economics,Hangzhou,China",
"fullName": "Zhenyu Yan",
"givenName": "Zhenyu",
"surname": "Yan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Media and Design, Hangzhou Dianzi University,Hangzhou,China",
"fullName": "Yuhua Liu",
"givenName": "Yuhua",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Information, Zhejiang University of Finance and Economics,Hangzhou,China",
"fullName": "Zhiguang Zhou",
"givenName": "Zhiguang",
"surname": "Zhou",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "pacificvis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-04-01T00:00:00",
"pubType": "proceedings",
"pages": "196-200",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-2335-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [
{
"id": "1E2wmNpzgkg",
"name": "ppacificvis202223350-09787858s1-mm_233500a196.zip",
"size": "31.5 MB",
"location": "https://www.computer.org/csdl/api/v1/extra/ppacificvis202223350-09787858s1-mm_233500a196.zip",
"__typename": "WebExtraType"
}
],
"adjacentArticles": {
"previous": {
"fno": "233500a191",
"articleId": "1E2wjUwAwZq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "233500a201",
"articleId": "1E2wlzvzyQE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"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/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": "trans/tg/2018/01/08019863",
"title": "Podium: Ranking Data Using Mixed-Initiative Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019863/13rRUwwaKtd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2017/3163/0/08585733",
"title": "QSAnglyzer: Visual Analytics for Prismatic Analysis of Question Answering System Evaluations",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585733/17D45VsBU7S",
"parentPublication": {
"id": "proceedings/vast/2017/3163/0",
"title": "2017 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2018/9194/0/08534019",
"title": "Multiple Workspaces in Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2018/08534019/17D45W9KVIu",
"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/vis/2022/8812/0/881200a065",
"title": "FairFuse: Interactive Visual Support for Fair Consensus Ranking",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a065/1J6haP1jUt2",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/06/08891840",
"title": "Understanding Failure Mode Effect Analysis Data Using Interactive Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2019/06/08891840/1eIcadfWnYs",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09216512",
"title": "Auditing the Sensitivity of Graph-based Ranking with Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09216512/1nJsHwdIuqc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-dss-smartcity/2020/7649/0/764900a847",
"title": "Importance ranking method of multiple attributes of network nodes",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-dss-smartcity/2020/764900a847/1t7mZo0FinK",
"parentPublication": {
"id": "proceedings/hpcc-dss-smartcity/2020/7649/0",
"title": "2020 IEEE 22nd International Conference on High Performance Computing and Communications; IEEE 18th International Conference on Smart City; IEEE 6th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/05/09490333",
"title": "A Visual Analytics Approach for Structural Differences Among Graphs via Deep Learning",
"doi": null,
"abstractUrl": "/magazine/cg/2021/05/09490333/1vmGUJFABLW",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx8wTfL",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBhZ4li",
"doi": "10.1109/ICPR.2008.4761187",
"title": "Interactive labeling of facial action units",
"normalizedTitle": "Interactive labeling of facial action units",
"abstract": "For many computer vision problems, it is very important to produce the ground truth data. Manual data labeling is labor-intensive and prone to the human errors, whereas fully automatic data labeling is not feasible and reliable. In this paper, we propose an interactive labeling technique for efficient and accurate data labeling. Constructed on a Bayesian network (BN), the automatic image labeler produces an initial labeling of the image. A human then examines the initial labeling and makes minor corrections. The human corrections and the image measurements are then integrated by the BN framework to produce a refined labeling. We demonstrate the capability of this technique on labeling facial action units.",
"abstracts": [
{
"abstractType": "Regular",
"content": "For many computer vision problems, it is very important to produce the ground truth data. Manual data labeling is labor-intensive and prone to the human errors, whereas fully automatic data labeling is not feasible and reliable. In this paper, we propose an interactive labeling technique for efficient and accurate data labeling. Constructed on a Bayesian network (BN), the automatic image labeler produces an initial labeling of the image. A human then examines the initial labeling and makes minor corrections. The human corrections and the image measurements are then integrated by the BN framework to produce a refined labeling. We demonstrate the capability of this technique on labeling facial action units.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "For many computer vision problems, it is very important to produce the ground truth data. Manual data labeling is labor-intensive and prone to the human errors, whereas fully automatic data labeling is not feasible and reliable. In this paper, we propose an interactive labeling technique for efficient and accurate data labeling. Constructed on a Bayesian network (BN), the automatic image labeler produces an initial labeling of the image. A human then examines the initial labeling and makes minor corrections. The human corrections and the image measurements are then integrated by the BN framework to produce a refined labeling. We demonstrate the capability of this technique on labeling facial action units.",
"fno": "04761187",
"keywords": [
"Belief Networks",
"Computer Vision",
"Face Recognition",
"Facial Action Units",
"Computer Vision",
"Manual Data Labeling",
"Interactive Labeling Technique",
"Bayesian Network",
"Image Measurements",
"Labeling",
"Gold",
"Humans",
"Face Recognition",
"Computer Vision",
"Face Detection",
"Training Data",
"Computer Errors",
"Machine Learning",
"Learning Systems"
],
"authors": [
{
"affiliation": "Rensselaer Polytechnic Institute, USA",
"fullName": "Lei Zhang",
"givenName": null,
"surname": "Lei Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Rensselaer Polytechnic Institute, USA",
"fullName": "Yan Tong",
"givenName": "Yan",
"surname": "Tong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Rensselaer Polytechnic Institute, USA",
"fullName": "Qiang Ji",
"givenName": null,
"surname": "Qiang Ji",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-12-01T00:00:00",
"pubType": "proceedings",
"pages": "",
"year": "2008",
"issn": "1051-4651",
"isbn": "978-1-4244-2174-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04761186",
"articleId": "12OmNzGlRzk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04761188",
"articleId": "12OmNvqmUDC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/acii/2013/5048/0/5048a055",
"title": "Active Labeling of Facial Feature Points",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2013/5048a055/12OmNAY79pE",
"parentPublication": {
"id": "proceedings/acii/2013/5048/0",
"title": "2013 Humaine Association Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209e696",
"title": "Pain Intensity Evaluation through Facial Action Units",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209e696/12OmNBiygvZ",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2016/1437/0/1437b460",
"title": "A Framework for Joint Estimation and Guided Annotation of Facial Action Unit Intensity",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2016/1437b460/12OmNBqv2bq",
"parentPublication": {
"id": "proceedings/cvprw/2016/1437/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2012/4905/0/4905a858",
"title": "Self-Taught Active Learning from Crowds",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2012/4905a858/12OmNvAiSbD",
"parentPublication": {
"id": "proceedings/icdm/2012/4905/0",
"title": "2012 IEEE 12th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2009/3992/0/05206670",
"title": "Automatic facial landmark labeling with minimal supervision",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206670/12OmNy4r3Yb",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iih-msp/2008/3278/0/3278a867",
"title": "Shallow Semantic Parsing for Lexical Units in Chinese FrameNet",
"doi": null,
"abstractUrl": "/proceedings-article/iih-msp/2008/3278a867/12OmNzd7bLW",
"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/acii/2017/0563/0/08273630",
"title": "Facial action units detection under pose variations using deep regions learning",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2017/08273630/12OmNzyp5Vw",
"parentPublication": {
"id": "proceedings/acii/2017/0563/0",
"title": "2017 Seventh International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600u0385",
"title": "Knowledge-Driven Self-Supervised Representation Learning for Facial Action Unit Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600u0385/1H0N9SVAntK",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2020/3079/0/307900a559",
"title": "Exploring Multidimensional Measurements for Pain Evaluation using Facial Action Units",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2020/307900a559/1kecIHJxfP2",
"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/icvrv/2019/4752/0/09212953",
"title": "Pose-Independent Facial Action Units Recognition with Attention Enhanced Residual Mapping",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2019/09212953/1nHRUIsW7F6",
"parentPublication": {
"id": "proceedings/icvrv/2019/4752/0",
"title": "2019 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNCbCrVT",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "2014",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxT56C7",
"doi": "10.1109/CVPR.2014.34",
"title": "Beyond Comparing Image Pairs: Setwise Active Learning for Relative Attributes",
"normalizedTitle": "Beyond Comparing Image Pairs: Setwise Active Learning for Relative Attributes",
"abstract": "It is useful to automatically compare images based on their visual properties -- to predict which image is brighter, more feminine, more blurry, etc. However, comparative models are inherently more costly to train than their classification counterparts. Manually labeling all pairwise comparisons is intractable, so which pairs should a human supervisor compare? We explore active learning strategies for training relative attribute ranking functions, with the goal of requesting human comparisons only where they are most informative. We introduce a novel criterion that requests a partial ordering for a set of examples that minimizes the total rank margin in attribute space, subject to a visual diversity constraint. The setwise criterion helps amortize effort by identifying mutually informative comparisons, and the diversity requirement safeguards against requests a human viewer will find ambiguous. We develop an efficient strategy to search for sets that meet this criterion. On three challenging datasets and experiments with \"live\" online annotators, the proposed method outperforms both traditional passive learning as well as existing active rank learning methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "It is useful to automatically compare images based on their visual properties -- to predict which image is brighter, more feminine, more blurry, etc. However, comparative models are inherently more costly to train than their classification counterparts. Manually labeling all pairwise comparisons is intractable, so which pairs should a human supervisor compare? We explore active learning strategies for training relative attribute ranking functions, with the goal of requesting human comparisons only where they are most informative. We introduce a novel criterion that requests a partial ordering for a set of examples that minimizes the total rank margin in attribute space, subject to a visual diversity constraint. The setwise criterion helps amortize effort by identifying mutually informative comparisons, and the diversity requirement safeguards against requests a human viewer will find ambiguous. We develop an efficient strategy to search for sets that meet this criterion. On three challenging datasets and experiments with \"live\" online annotators, the proposed method outperforms both traditional passive learning as well as existing active rank learning methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "It is useful to automatically compare images based on their visual properties -- to predict which image is brighter, more feminine, more blurry, etc. However, comparative models are inherently more costly to train than their classification counterparts. Manually labeling all pairwise comparisons is intractable, so which pairs should a human supervisor compare? We explore active learning strategies for training relative attribute ranking functions, with the goal of requesting human comparisons only where they are most informative. We introduce a novel criterion that requests a partial ordering for a set of examples that minimizes the total rank margin in attribute space, subject to a visual diversity constraint. The setwise criterion helps amortize effort by identifying mutually informative comparisons, and the diversity requirement safeguards against requests a human viewer will find ambiguous. We develop an efficient strategy to search for sets that meet this criterion. On three challenging datasets and experiments with \"live\" online annotators, the proposed method outperforms both traditional passive learning as well as existing active rank learning methods.",
"fno": "5118a208",
"keywords": [
"Training",
"Visualization",
"Labeling",
"Learning Systems",
"Uncertainty",
"Space Exploration",
"Vectors",
"Diversity",
"Active Learning",
"Relative Attributes",
"Visual Attributes",
"Relative",
"Visual",
"Attributes",
"Active",
"Learning",
"Rank",
"Ranking",
"Diverse"
],
"authors": [
{
"affiliation": null,
"fullName": "Lucy Liang",
"givenName": "Lucy",
"surname": "Liang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Kristen Grauman",
"givenName": "Kristen",
"surname": "Grauman",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2014-06-01T00:00:00",
"pubType": "proceedings",
"pages": "208-215",
"year": "2014",
"issn": "1063-6919",
"isbn": "978-1-4799-5118-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "5118a200",
"articleId": "12OmNB06l73",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "5118a216",
"articleId": "12OmNAle6nQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2007/1016/0/04284733",
"title": "Beyond Accuracy: Typicality Ranking for Video Annotation",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2007/04284733/12OmNAH5dmN",
"parentPublication": {
"id": "proceedings/icme/2007/1016/0",
"title": "2007 International Conference on Multimedia & Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mcsoc/2016/3531/0/3531a281",
"title": "Why Comparing System-Level MPSoC Mapping Approaches is Difficult: A Case Study",
"doi": null,
"abstractUrl": "/proceedings-article/mcsoc/2016/3531a281/12OmNvAiSwa",
"parentPublication": {
"id": "proceedings/mcsoc/2016/3531/0",
"title": "2016 IEEE 10th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2016/7258/0/07552987",
"title": "Reducing manual labeling in singing voice detection: An active learning approach",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2016/07552987/12OmNvD8RvJ",
"parentPublication": {
"id": "proceedings/icme/2016/7258/0",
"title": "2016 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209a637",
"title": "Graph Kernel Encoding Substituents' Relative Positioning",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209a637/12OmNwK7ocC",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlsid/2015/6658/0/6658a129",
"title": "Effects of Nondeterminism in Hardware and Software Simulation with Thread Mapping",
"doi": null,
"abstractUrl": "/proceedings-article/vlsid/2015/6658a129/12OmNx7ouNJ",
"parentPublication": {
"id": "proceedings/vlsid/2015/6658/0",
"title": "2015 28th International Conference on VLSI Design (VLSID)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2013/5053/0/06475008",
"title": "Relative ranking of facial attractiveness",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2013/06475008/12OmNzIUfSN",
"parentPublication": {
"id": "proceedings/wacv/2013/5053/0",
"title": "Applications of Computer Vision, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2013/4999/0/06628691",
"title": "A Stream-Based Semi-supervised Active Learning Approach for Document Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2013/06628691/12OmNzaQoce",
"parentPublication": {
"id": "proceedings/icdar/2013/4999/0",
"title": "2013 12th International Conference on Document Analysis and Recognition (ICDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2017/6067/0/08019412",
"title": "Multi-label active learning with low-rank mapping for image classification",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2017/08019412/12OmNzn38XO",
"parentPublication": {
"id": "proceedings/icme/2017/6067/0",
"title": "2017 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/12/07172547",
"title": "Active Learning from Relative Comparisons",
"doi": null,
"abstractUrl": "/journal/tk/2015/12/07172547/13rRUIJuxpX",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2019/3293/0/329300a708",
"title": "Thinking Outside the Pool: Active Training Image Creation for Relative Attributes",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300a708/1gyrg3unqKI",
"parentPublication": {
"id": "proceedings/cvpr/2019/3293/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwCJOY5",
"title": "2015 IEEE International Conference on Big Data (Big Data)",
"acronym": "big-data",
"groupId": "1802964",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyoSb9g",
"doi": "10.1109/BigData.2015.7363766",
"title": "Hybrid active learning for non-stationary streaming data with asynchronous labeling",
"normalizedTitle": "Hybrid active learning for non-stationary streaming data with asynchronous labeling",
"abstract": "Active learning enables supervised classifiers to learn using fewer labeled samples, by actively selecting samples for human labeling. Most Active Learning approaches can be categorized as pool-based or stream-based. Pool-based strategies select instances to be labeled from the available pool of unlabeled data, by evaluating each instance, whereas stream-based strategies examine every instance in the incoming stream of unlabeled data and decide sequentially whether they want that instance to be labeled or not. Stream-based strategies enable the ability to adapt the classifier model more quickly as the incoming data changes, while pool-based strategies often exhibit better learning rates. In this paper, we propose a framework and method for Hybrid Active Learning that integrates pool-based and stream-based strategies to harvest the benefits of both, in a streaming data classification scenario where concept drift may be prevalent, and labeling is asynchronous. In addition, we propose (i) prioritized aggregation of selection to combine selected instances for labeling from the pool-based and stream-based strategies, and (ii) batch period adaptation to dynamically change the triggering pattern of the pool-based strategy based upon the detection of concept drift.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Active learning enables supervised classifiers to learn using fewer labeled samples, by actively selecting samples for human labeling. Most Active Learning approaches can be categorized as pool-based or stream-based. Pool-based strategies select instances to be labeled from the available pool of unlabeled data, by evaluating each instance, whereas stream-based strategies examine every instance in the incoming stream of unlabeled data and decide sequentially whether they want that instance to be labeled or not. Stream-based strategies enable the ability to adapt the classifier model more quickly as the incoming data changes, while pool-based strategies often exhibit better learning rates. In this paper, we propose a framework and method for Hybrid Active Learning that integrates pool-based and stream-based strategies to harvest the benefits of both, in a streaming data classification scenario where concept drift may be prevalent, and labeling is asynchronous. In addition, we propose (i) prioritized aggregation of selection to combine selected instances for labeling from the pool-based and stream-based strategies, and (ii) batch period adaptation to dynamically change the triggering pattern of the pool-based strategy based upon the detection of concept drift.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Active learning enables supervised classifiers to learn using fewer labeled samples, by actively selecting samples for human labeling. Most Active Learning approaches can be categorized as pool-based or stream-based. Pool-based strategies select instances to be labeled from the available pool of unlabeled data, by evaluating each instance, whereas stream-based strategies examine every instance in the incoming stream of unlabeled data and decide sequentially whether they want that instance to be labeled or not. Stream-based strategies enable the ability to adapt the classifier model more quickly as the incoming data changes, while pool-based strategies often exhibit better learning rates. In this paper, we propose a framework and method for Hybrid Active Learning that integrates pool-based and stream-based strategies to harvest the benefits of both, in a streaming data classification scenario where concept drift may be prevalent, and labeling is asynchronous. In addition, we propose (i) prioritized aggregation of selection to combine selected instances for labeling from the pool-based and stream-based strategies, and (ii) batch period adaptation to dynamically change the triggering pattern of the pool-based strategy based upon the detection of concept drift.",
"fno": "07363766",
"keywords": [
"Labeling",
"Data Models",
"Uncertainty",
"Big Data",
"Streaming Media",
"Training",
"Real Time Systems",
"Big Data",
"Supervised Classification",
"Active Learning",
"Lambda Architecture"
],
"authors": [
{
"affiliation": "Palo Alto Research Center, 800 Phillips Road, Webster, New York, USA",
"fullName": "Hyunjoo Kim",
"givenName": "Hyunjoo",
"surname": "Kim",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Palo Alto Research Center, 800 Phillips Road, Webster, New York, USA",
"fullName": "Sriganesh Madhvanath",
"givenName": "Sriganesh",
"surname": "Madhvanath",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Palo Alto Research Center, 800 Phillips Road, Webster, New York, USA",
"fullName": "Tong Sun",
"givenName": "Tong",
"surname": "Sun",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "big-data",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-10-01T00:00:00",
"pubType": "proceedings",
"pages": "287-292",
"year": "2015",
"issn": null,
"isbn": "978-1-4799-9926-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07363765",
"articleId": "12OmNqGRGf3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07363767",
"articleId": "12OmNxvwoS6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bracis/2015/0016/0/0016a062",
"title": "Selectively Inhibiting Learning Bias for Active Sampling",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2015/0016a062/12OmNBqMDrN",
"parentPublication": {
"id": "proceedings/bracis/2015/0016/0",
"title": "2015 Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2010/4257/0/4257a843",
"title": "Change with Delayed Labeling: When is it Detectable?",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2010/4257a843/12OmNqIzgXj",
"parentPublication": {
"id": "proceedings/icdmw/2010/4257/0",
"title": "2010 IEEE International Conference on Data Mining Workshops",
"__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/icat/2013/0431/0/06684046",
"title": "Selecting samples for labeling in unbalanced streaming data environments",
"doi": null,
"abstractUrl": "/proceedings-article/icat/2013/06684046/12OmNxjjElq",
"parentPublication": {
"id": "proceedings/icat/2013/0431/0",
"title": "2013 XXIV International Conference on Information, Communication and Automation Technologies (ICAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gpc-workshops/2008/3177/0/3177a329",
"title": "Access Control and Labeling Scheme for Dynamic XML Data",
"doi": null,
"abstractUrl": "/proceedings-article/gpc-workshops/2008/3177a329/12OmNzcPAvS",
"parentPublication": {
"id": "proceedings/gpc-workshops/2008/3177/0",
"title": "GPC Workshops - 2008 3rd International Conference on Grid and Pervasive Computing Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08019851",
"title": "Comparing Visual-Interactive Labeling with Active Learning: An Experimental Study",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019851/13rRUxBrGh7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08257916",
"title": "Big active learning",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08257916/17D45VWpMzw",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbd/2022/0745/0/074500a176",
"title": "Pool-Based Sequential Active Learning For Regression Based on Incremental Cluster Center Selection",
"doi": null,
"abstractUrl": "/proceedings-article/cbd/2022/074500a176/1EVinkIsv5K",
"parentPublication": {
"id": "proceedings/cbd/2022/0745/0",
"title": "2021 Ninth International Conference on Advanced Cloud and Big Data (CBD)",
"__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/cvprw/2020/9360/0/09151048",
"title": "Towards Fine-grained Sampling for Active Learning in Object Detection",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09151048/1lPHiKuP95u",
"parentPublication": {
"id": "proceedings/cvprw/2020/9360/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1hJrHq07uw0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"acronym": "big-data",
"groupId": "1802964",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1hJsmY3hhte",
"doi": "10.1109/BigData47090.2019.9006224",
"title": "Active Learning Strategies for Hierarchical Labeling Microtasks",
"normalizedTitle": "Active Learning Strategies for Hierarchical Labeling Microtasks",
"abstract": "This paper reports the result of a preliminary experiment on active learning strategies for the hierarchical labeling microtasks. A typical example of hierarchical labeling microtask consists of a set of labeling tasks for partitions of a large image; starting from the whole image, the workers choose to give a label or divide it into smaller ones. This paper shows the result of an experiment to compare several strategies for active learning in the setting. The result suggests that the difference in the strategies affects the performance in the early stage.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper reports the result of a preliminary experiment on active learning strategies for the hierarchical labeling microtasks. A typical example of hierarchical labeling microtask consists of a set of labeling tasks for partitions of a large image; starting from the whole image, the workers choose to give a label or divide it into smaller ones. This paper shows the result of an experiment to compare several strategies for active learning in the setting. The result suggests that the difference in the strategies affects the performance in the early stage.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper reports the result of a preliminary experiment on active learning strategies for the hierarchical labeling microtasks. A typical example of hierarchical labeling microtask consists of a set of labeling tasks for partitions of a large image; starting from the whole image, the workers choose to give a label or divide it into smaller ones. This paper shows the result of an experiment to compare several strategies for active learning in the setting. The result suggests that the difference in the strategies affects the performance in the early stage.",
"fno": "09006224",
"keywords": [
"Image Processing",
"Learning Artificial Intelligence",
"User Interfaces",
"Hierarchical Labeling Microtask",
"Labeling Tasks",
"Active Learning Strategies",
"Image Partition",
"Labeling",
"Task Analysis",
"Buildings",
"Crowdsourcing",
"Uncertainty",
"Media",
"Computational Modeling",
"Active Learning",
"User Interface",
"Hierarchical Labeling Microasks"
],
"authors": [
{
"affiliation": "University of Tsukuba,College of Media Arts, Science and Technology,Japan",
"fullName": "Kousuke Uo",
"givenName": "Kousuke",
"surname": "Uo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Tsukuba,Graduate School of Library, Information and Media Studies,Japan",
"fullName": "Masaki Kobayashi",
"givenName": "Masaki",
"surname": "Kobayashi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Tsukuba,Faculty of Library, Information and Media Science,Japan",
"fullName": "Masaki Matsubara",
"givenName": "Masaki",
"surname": "Matsubara",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Information and Systems University of Tsukuba,Faculty of Engineering,Japan",
"fullName": "Yukino Baba",
"givenName": "Yukino",
"surname": "Baba",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Tsukuba,Faculty of Library, Information and Media Science,Japan",
"fullName": "Atsuyuki Morishima",
"givenName": "Atsuyuki",
"surname": "Morishima",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "big-data",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-12-01T00:00:00",
"pubType": "proceedings",
"pages": "4647-4650",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-0858-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09005561",
"articleId": "1hJsoWhRzhK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09006437",
"articleId": "1hJsaq0cyn6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bracis/2015/0016/0/0016a062",
"title": "Selectively Inhibiting Learning Bias for Active Sampling",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2015/0016a062/12OmNBqMDrN",
"parentPublication": {
"id": "proceedings/bracis/2015/0016/0",
"title": "2015 Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2012/4905/0/4905a858",
"title": "Self-Taught Active Learning from Crowds",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2012/4905a858/12OmNvAiSbD",
"parentPublication": {
"id": "proceedings/icdm/2012/4905/0",
"title": "2012 IEEE 12th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2016/7258/0/07552987",
"title": "Reducing manual labeling in singing voice detection: An active learning approach",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2016/07552987/12OmNvD8RvJ",
"parentPublication": {
"id": "proceedings/icme/2016/7258/0",
"title": "2016 IEEE International Conference on Multimedia and Expo (ICME)",
"__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": "proceedings/percom/2016/8779/0/07456524",
"title": "Active learning enabled activity recognition",
"doi": null,
"abstractUrl": "/proceedings-article/percom/2016/07456524/12OmNzmtWEn",
"parentPublication": {
"id": "proceedings/percom/2016/8779/0",
"title": "2016 IEEE International Conference on Pervasive Computing and Communications (PerCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08019851",
"title": "Comparing Visual-Interactive Labeling with Active Learning: An Experimental Study",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019851/13rRUxBrGh7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08257916",
"title": "Big active learning",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08257916/17D45VWpMzw",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2022/06/09881795",
"title": "Machine Learning From Crowds Using Candidate Set-Based Labeling",
"doi": null,
"abstractUrl": "/magazine/ex/2022/06/09881795/1Gv92p7fJLi",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2019/07/07835129",
"title": "Majority Voting and Pairing with Multiple Noisy Labeling",
"doi": null,
"abstractUrl": "/journal/tk/2019/07/07835129/1aAwKi4sCQM",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09378021",
"title": "Virtual Adversarial Active Learning",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09378021/1s64vNHNnk4",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1zxKTw5zuLK",
"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)",
"acronym": "ispa-bdcloud-socialcom-sustaincom",
"groupId": "1805944",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1zxKYRTw9Fu",
"doi": "10.1109/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00018",
"title": "SLAMVis: An Interactive Visualization Approach for Smart Labeling on Multidimensional Data",
"normalizedTitle": "SLAMVis: An Interactive Visualization Approach for Smart Labeling on Multidimensional Data",
"abstract": "Multidimensional data is widely applied in various machine learning tasks such as regression, classification and pattern recognition. Their labels are significant, especially in supervised learning tasks. Considering the difficulties encountered in the actual situations including the lack of labeled data, low-quality labeled data, and expensive generation of labels, we propose a novel smart labeling method named SLAMVis, which combines active learning and visual interactive labeling, to obtain effective models and labels through an iterative labeling process. The algorithms are tightly integrated with an interactive visual interface, which is composed of multiple coordinated contextual views. Based on the pattern recognition algorithm combining SOINN and K-means, we also introduce a new query strategy to recommend informative candidate instances. Through quantitative experiments and example usage scenarios, we demonstrate the effectiveness of SLAMVis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multidimensional data is widely applied in various machine learning tasks such as regression, classification and pattern recognition. Their labels are significant, especially in supervised learning tasks. Considering the difficulties encountered in the actual situations including the lack of labeled data, low-quality labeled data, and expensive generation of labels, we propose a novel smart labeling method named SLAMVis, which combines active learning and visual interactive labeling, to obtain effective models and labels through an iterative labeling process. The algorithms are tightly integrated with an interactive visual interface, which is composed of multiple coordinated contextual views. Based on the pattern recognition algorithm combining SOINN and K-means, we also introduce a new query strategy to recommend informative candidate instances. Through quantitative experiments and example usage scenarios, we demonstrate the effectiveness of SLAMVis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multidimensional data is widely applied in various machine learning tasks such as regression, classification and pattern recognition. Their labels are significant, especially in supervised learning tasks. Considering the difficulties encountered in the actual situations including the lack of labeled data, low-quality labeled data, and expensive generation of labels, we propose a novel smart labeling method named SLAMVis, which combines active learning and visual interactive labeling, to obtain effective models and labels through an iterative labeling process. The algorithms are tightly integrated with an interactive visual interface, which is composed of multiple coordinated contextual views. Based on the pattern recognition algorithm combining SOINN and K-means, we also introduce a new query strategy to recommend informative candidate instances. Through quantitative experiments and example usage scenarios, we demonstrate the effectiveness of SLAMVis.",
"fno": "357400a019",
"keywords": [
"Data Visualisation",
"Interactive Systems",
"Query Processing",
"Supervised Learning",
"User Interfaces",
"SLAM Vis",
"Interactive Visualization",
"Multidimensional Data",
"Supervised Learning",
"Smart Labeling",
"Active Learning",
"Visual Interactive Labeling",
"Interactive Visual Interface",
"Pattern Recognition",
"SOINN",
"K Means",
"Query Strategy",
"Visualization",
"Supervised Learning",
"Data Visualization",
"Machine Learning",
"Data Models",
"Pattern Recognition",
"Labeling",
"Multidimensional Data",
"Active Learning",
"Interactive Labeling",
"Visual Analytics"
],
"authors": [
{
"affiliation": "Shanghai Jiao Tong University,Department of Computer Science,Shanghai,China",
"fullName": "Aijuan Qian",
"givenName": "Aijuan",
"surname": "Qian",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Shanghai Jiao Tong University,Department of Computer Science,Shanghai,China",
"fullName": "Chenlu Li",
"givenName": "Chenlu",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Shanghai Jiao Tong University,Department of Computer Science,Shanghai,China",
"fullName": "Xiaoju Dong",
"givenName": "Xiaoju",
"surname": "Dong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Shanghai Jiao Tong University,Department of Computer Science,Shanghai,China",
"fullName": "Shengtao Chen",
"givenName": "Shengtao",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Shanghai Jiao Tong University,Department of Computer Science,Shanghai,China",
"fullName": "Yanling Zhang",
"givenName": "Yanling",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Shanghai Jiao Tong University,School of Software,Shanghai,China",
"fullName": "Guoqiang Li",
"givenName": "Guoqiang",
"surname": "Li",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ispa-bdcloud-socialcom-sustaincom",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-09-01T00:00:00",
"pubType": "proceedings",
"pages": "19-26",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-3574-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "357400a011",
"articleId": "1zxKWU9S920",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "357400a027",
"articleId": "1zxLhuQM20U",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2011/0394/0/05995380",
"title": "Learning structured prediction models for interactive image labeling",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995380/12OmNvnOwvE",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2009/3895/0/3895a428",
"title": "Semi-Supervised Sequence Labeling with Self-Learned Features",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2009/3895a428/12OmNy49sPM",
"parentPublication": {
"id": "proceedings/icdm/2009/3895/0",
"title": "2009 Ninth IEEE International Conference on Data Mining",
"__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/tp/2016/06/07243351",
"title": "Co-Labeling for Multi-View Weakly Labeled Learning",
"doi": null,
"abstractUrl": "/journal/tp/2016/06/07243351/13rRUwhHcS3",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08019851",
"title": "Comparing Visual-Interactive Labeling with Active Learning: An Experimental Study",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08019851/13rRUxBrGh7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/02/06823124",
"title": "Imbalanced Multiple Noisy Labeling",
"doi": null,
"abstractUrl": "/journal/tk/2015/02/06823124/13rRUxjQyvQ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200i403",
"title": "Learning Rare Category Classifiers on a Tight Labeling Budget",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200i403/1BmEJeSGQne",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2019/6868/0/09073511",
"title": "SAVIZ: Interactive Exploration and Visualization of Situation Labeling Classifiers over Crisis Social Media Data",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2019/09073511/1jjAehCyd4A",
"parentPublication": {
"id": "proceedings/asonam/2019/6868/0",
"title": "2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2020/7445/0/09150365",
"title": "Multiperspective Automotive Labeling",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2020/09150365/1lPGDgRiFws",
"parentPublication": {
"id": "proceedings/ipdpsw/2020/7445/0",
"title": "2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vizsec/2019/3876/0/09161489",
"title": "A Study on Labeling Network Hostile Behavior with Intelligent Interactive Tools",
"doi": null,
"abstractUrl": "/proceedings-article/vizsec/2019/09161489/1m6hHyKHgC4",
"parentPublication": {
"id": "proceedings/vizsec/2019/3876/0",
"title": "2019 IEEE Symposium on Visualization for Cyber Security (VizSec)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNviZlhK",
"title": "2008 Seventh Mexican International Conference on Artificial Intelligence",
"acronym": "micai",
"groupId": "1001744",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwGIcCa",
"doi": "10.1109/MICAI.2008.31",
"title": "Classic Chinese Automatic Question Answering System Based on Pragmatics Information",
"normalizedTitle": "Classic Chinese Automatic Question Answering System Based on Pragmatics Information",
"abstract": "In this paper, we propose a practical question answering system for the \"Analects of Confucius\" based on the pragmatics information. The \"Analects of Confucius\" is a classic Chinese literature by the Confucian during the Warring States Period (476 B.C-221 B.C ). But the literature can not be categorized by topics and it has comprehensive meanings, not only the literal meanings and explicitly communicated meanings of the passages, but also deeper meanings and implicitly communicated meanings (Here, we call the deep meaning and implicitly communicated meaning as pragmatics information). Therefore we constructed a QA system, which aims to help understanding the ''Analects of Confucius'' correctly. According to the experiments, the pragmatics information based retrieval results are more accurate than the results based on the interpretations in modern language.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we propose a practical question answering system for the \"Analects of Confucius\" based on the pragmatics information. The \"Analects of Confucius\" is a classic Chinese literature by the Confucian during the Warring States Period (476 B.C-221 B.C ). But the literature can not be categorized by topics and it has comprehensive meanings, not only the literal meanings and explicitly communicated meanings of the passages, but also deeper meanings and implicitly communicated meanings (Here, we call the deep meaning and implicitly communicated meaning as pragmatics information). Therefore we constructed a QA system, which aims to help understanding the ''Analects of Confucius'' correctly. According to the experiments, the pragmatics information based retrieval results are more accurate than the results based on the interpretations in modern language.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we propose a practical question answering system for the \"Analects of Confucius\" based on the pragmatics information. The \"Analects of Confucius\" is a classic Chinese literature by the Confucian during the Warring States Period (476 B.C-221 B.C ). But the literature can not be categorized by topics and it has comprehensive meanings, not only the literal meanings and explicitly communicated meanings of the passages, but also deeper meanings and implicitly communicated meanings (Here, we call the deep meaning and implicitly communicated meaning as pragmatics information). Therefore we constructed a QA system, which aims to help understanding the ''Analects of Confucius'' correctly. According to the experiments, the pragmatics information based retrieval results are more accurate than the results based on the interpretations in modern language.",
"fno": "3441a058",
"keywords": [
"Pragmatics",
"Pragmatics Information",
"QA System",
"Analects Of Confucius"
],
"authors": [
{
"affiliation": null,
"fullName": "Ye Yang",
"givenName": "Ye",
"surname": "Yang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Peilin Jiang",
"givenName": "Peilin",
"surname": "Jiang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Fuji Ren",
"givenName": "Fuji",
"surname": "Ren",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Seiji Tsuchiya",
"givenName": "Seiji",
"surname": "Tsuchiya",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "micai",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-10-01T00:00:00",
"pubType": "proceedings",
"pages": "58-64",
"year": "2008",
"issn": null,
"isbn": "978-0-7695-3441-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3441a053",
"articleId": "12OmNBU1jHS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3441a065",
"articleId": "12OmNx6g6qG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cis/2009/3931/1/3931a079",
"title": "Research on Answer Extraction Method for Domain Question Answering System(QA)",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2009/3931a079/12OmNBVIUsc",
"parentPublication": {
"id": "proceedings/cis/2009/3931/1",
"title": "2009 International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/t4e/2012/4759/0/4759a245",
"title": "IPedagogy: Question Answering System Based on Web Information Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/t4e/2012/4759a245/12OmNC3FGhP",
"parentPublication": {
"id": "proceedings/t4e/2012/4759/0",
"title": "2012 IEEE Fourth International Conference on Technology for Education",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/society/2013/4998/0/4998a001",
"title": "Question and Answering Made Interactive: An Exploration of Interactions in Social QA",
"doi": null,
"abstractUrl": "/proceedings-article/society/2013/4998a001/12OmNCcbE4d",
"parentPublication": {
"id": "proceedings/society/2013/4998/0",
"title": "International Conference on Social Intelligence and Technology (SOCIETY)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aici/2010/4225/1/4225a350",
"title": "A Chinese Question Answering System Using Web Service on Restricted Domain",
"doi": null,
"abstractUrl": "/proceedings-article/aici/2010/4225a350/12OmNvlxJz4",
"parentPublication": {
"id": "proceedings/aici/2010/4225/1",
"title": "Artificial Intelligence and Computational Intelligence, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibmw/2009/5121/0/05332084",
"title": "Evaluating the weighted-keyword model to improve clinical question answering",
"doi": null,
"abstractUrl": "/proceedings-article/bibmw/2009/05332084/12OmNwDACai",
"parentPublication": {
"id": "proceedings/bibmw/2009/5121/0",
"title": "2009 IEEE International Conference on Bioinformatics and Biomedicine Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2012/4637/0/4637a573",
"title": "Question Answering System Based on Web",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2012/4637a573/12OmNxGALb3",
"parentPublication": {
"id": "proceedings/icicta/2012/4637/0",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ncm/2008/3322/2/3322b365",
"title": "Design of Question Answering System with Automated Question Generation",
"doi": null,
"abstractUrl": "/proceedings-article/ncm/2008/3322b365/12OmNyGbIij",
"parentPublication": {
"id": "proceedings/ncm/2008/3322/2",
"title": "Networked Computing and Advanced Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wgec/2009/3899/0/3899a217",
"title": "Study and Implementation of Chinese Intelligent Question Answering System Based on Restricted Domain",
"doi": null,
"abstractUrl": "/proceedings-article/wgec/2009/3899a217/12OmNzUPput",
"parentPublication": {
"id": "proceedings/wgec/2009/3899/0",
"title": "Genetic and Evolutionary Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hotweb/2006/0595/0/04178382",
"title": "Measurement and Modeling of A Web-based Question Answering System",
"doi": null,
"abstractUrl": "/proceedings-article/hotweb/2006/04178382/12OmNzVXNRd",
"parentPublication": {
"id": "proceedings/hotweb/2006/0595/0",
"title": "2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsc/2012/4859/0/4859a146",
"title": "Exploiting Distributional Semantic Models in Question Answering",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2012/4859a146/12OmNzdoMUF",
"parentPublication": {
"id": "proceedings/icsc/2012/4859/0",
"title": "2012 IEEE Sixth International Conference on Semantic Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqJ8taQ",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"acronym": "vast",
"groupId": "1001630",
"volume": "0",
"displayVolume": "0",
"year": "2014",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxFJXsT",
"doi": "10.1109/VAST.2014.7042548",
"title": "Integrated visual analytics tool for heterogeneous text data",
"normalizedTitle": "Integrated visual analytics tool for heterogeneous text data",
"abstract": "Our self-developed java-based visual analytic tool reads a variety of different text data sources and extracts important keywords, relations and events from them using ontology and natural language processing methods. Finally it provides an integrated and interactive search interface to users to facilitate their effective and efficient investigation for the large and complex data set.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Our self-developed java-based visual analytic tool reads a variety of different text data sources and extracts important keywords, relations and events from them using ontology and natural language processing methods. Finally it provides an integrated and interactive search interface to users to facilitate their effective and efficient investigation for the large and complex data set.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Our self-developed java-based visual analytic tool reads a variety of different text data sources and extracts important keywords, relations and events from them using ontology and natural language processing methods. Finally it provides an integrated and interactive search interface to users to facilitate their effective and efficient investigation for the large and complex data set.",
"fno": "07042548",
"keywords": [
"Ontologies",
"Visual Analytics",
"Data Visualization",
"Analytical Models",
"Organizations",
"Data Models",
"Natural Language Processing",
"VAST 2014",
"Mini Challenge 1",
"Visual Analytics",
"Ontology Modeling"
],
"authors": [
{
"affiliation": "Hong Kong Applied Science and Technology Research Institute",
"fullName": "Jihyoun Park",
"givenName": "Jihyoun",
"surname": "Park",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vast",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2014-10-01T00:00:00",
"pubType": "proceedings",
"pages": "325-326",
"year": "2014",
"issn": null,
"isbn": "978-1-4799-6227-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07042547",
"articleId": "12OmNxWuigd",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07042549",
"articleId": "12OmNBuL1cI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"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": "proceedings/hicss/2016/5670/0/5670b426",
"title": "Introduction to the Minitrack on Interactive Visual Decision Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670b426/12OmNzWfoUn",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408a101",
"title": "SolarMap: Multifaceted Visual Analytics for Topic Exploration",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408a101/12OmNzw8j1t",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__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": "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/cs/2013/03/mcs2013030072",
"title": "Thematic Patterns in Georeferenced Tweets through Space-Time Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cs/2013/03/mcs2013030072/13rRUx0ge9R",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2017/3163/0/08585669",
"title": "Warning, Bias May Occur: A Proposed Approach to Detecting Cognitive Bias in Interactive Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585669/17D45X0yjSw",
"parentPublication": {
"id": "proceedings/vast/2017/3163/0",
"title": "2017 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__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/vast/2010/9488/0/05651204",
"title": "VisWorks text and network visual analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2010/05651204/1eof34V7mPS",
"parentPublication": {
"id": "proceedings/vast/2010/9488/0",
"title": "2010 IEEE Symposium on Visual Analytics Science and Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/02/08999535",
"title": "CLEVis: A Semantic Driven Visual Analytics System for Community Level Events",
"doi": null,
"abstractUrl": "/magazine/cg/2021/02/08999535/1hpPHFkOXCg",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvTjZWA",
"title": "2016 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops)",
"acronym": "percomw",
"groupId": "1000552",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxecS2l",
"doi": "10.1109/PERCOMW.2016.7457127",
"title": "Integrating quality of information with pragmatic assistance",
"normalizedTitle": "Integrating quality of information with pragmatic assistance",
"abstract": "In this work, we propose a framework for resolving ambiguity in user-generated natural language queries. We use pragmatics to formalize the refinement of an incoming query into possible interpretations which we call a response graph. Each of the possible interpretations are assigned likelihoods of being correct by the pragmatics framework, as well as Quality of Information (QoI) scores that quantify how useful we expect the response to be. We discuss two schemes for traversing the response graph and determining the querent's intended meaning, an up-front one-shot algorithm (\"static\") and an iterative runtime algorithm (\"dynamic\"). We analyze the performance of these two schemes by presenting data from simulated conversations between a querent and system using randomly generated response graphs. We show that both schemes are able to achieve a significant reduction in the cost to retrieve the desired information, allowing such a system to make more intelligent decisions about how to handle and respond to natural language queries.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this work, we propose a framework for resolving ambiguity in user-generated natural language queries. We use pragmatics to formalize the refinement of an incoming query into possible interpretations which we call a response graph. Each of the possible interpretations are assigned likelihoods of being correct by the pragmatics framework, as well as Quality of Information (QoI) scores that quantify how useful we expect the response to be. We discuss two schemes for traversing the response graph and determining the querent's intended meaning, an up-front one-shot algorithm (\"static\") and an iterative runtime algorithm (\"dynamic\"). We analyze the performance of these two schemes by presenting data from simulated conversations between a querent and system using randomly generated response graphs. We show that both schemes are able to achieve a significant reduction in the cost to retrieve the desired information, allowing such a system to make more intelligent decisions about how to handle and respond to natural language queries.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this work, we propose a framework for resolving ambiguity in user-generated natural language queries. We use pragmatics to formalize the refinement of an incoming query into possible interpretations which we call a response graph. Each of the possible interpretations are assigned likelihoods of being correct by the pragmatics framework, as well as Quality of Information (QoI) scores that quantify how useful we expect the response to be. We discuss two schemes for traversing the response graph and determining the querent's intended meaning, an up-front one-shot algorithm (\"static\") and an iterative runtime algorithm (\"dynamic\"). We analyze the performance of these two schemes by presenting data from simulated conversations between a querent and system using randomly generated response graphs. We show that both schemes are able to achieve a significant reduction in the cost to retrieve the desired information, allowing such a system to make more intelligent decisions about how to handle and respond to natural language queries.",
"fno": "07457127",
"keywords": [
"Pragmatics",
"Natural Languages",
"Context",
"Heuristic Algorithms",
"Uncertainty",
"Government",
"Measurement"
],
"authors": [
{
"affiliation": "Pennsylvania State University",
"fullName": "James Edwards",
"givenName": "James",
"surname": "Edwards",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "U.S. Army Research Laboratory",
"fullName": "Taylor Cassidy",
"givenName": "Taylor",
"surname": "Cassidy",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "IBM T.J. Watson Research Center",
"fullName": "Geeth de Mel",
"givenName": "Geeth",
"surname": "de Mel",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Pennsylvania State University",
"fullName": "Thomas F. La Porta",
"givenName": "Thomas F. La",
"surname": "Porta",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "percomw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-03-01T00:00:00",
"pubType": "proceedings",
"pages": "1-7",
"year": "2016",
"issn": null,
"isbn": "978-1-5090-1941-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07457126",
"articleId": "12OmNvA1h9Q",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07457128",
"articleId": "12OmNqJ8tqi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/aire/2014/6355/0/06894849",
"title": "Pragmatic ambiguity detection in natural language requirements",
"doi": null,
"abstractUrl": "/proceedings-article/aire/2014/06894849/12OmNAlvHT3",
"parentPublication": {
"id": "proceedings/aire/2014/6355/0",
"title": "2014 IEEE 1st International Workshop on Artificial Intelligence for Requirements Engineering (AIRE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rtss/2012/3098/0/06424815",
"title": "Quality of Information Based Data Selection and Transmission in Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/rtss/2012/06424815/12OmNrGb2jE",
"parentPublication": {
"id": "proceedings/rtss/2012/3098/0",
"title": "2012 IEEE 33rd Real-Time Systems Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iotdi/2017/4966/0/4966a279",
"title": "Demo Abstract: On-Demand Information Retrieval from Videos Using Deep Learning in Wireless Networks",
"doi": null,
"abstractUrl": "/proceedings-article/iotdi/2017/4966a279/12OmNrJAdYV",
"parentPublication": {
"id": "proceedings/iotdi/2017/4966/0",
"title": "2017 IEEE/ACM Second International Conference on Internet-of-Things Design and Implementation (IoTDI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2011/1799/0/06120501",
"title": "Toward a Cooperative Natural Language Query Interface for Biological Databases",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2011/06120501/12OmNviZlID",
"parentPublication": {
"id": "proceedings/bibm/2011/1799/0",
"title": "2011 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/micai/2008/3441/0/3441a058",
"title": "Classic Chinese Automatic Question Answering System Based on Pragmatics Information",
"doi": null,
"abstractUrl": "/proceedings-article/micai/2008/3441a058/12OmNwGIcCa",
"parentPublication": {
"id": "proceedings/micai/2008/3441/0",
"title": "2008 Seventh Mexican International Conference on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2016/4571/0/4571a099",
"title": "Exploiting Video Quality Information in Rate Adaptation for HTTP-Based Video Streaming",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2016/4571a099/12OmNz6iOfn",
"parentPublication": {
"id": "proceedings/ism/2016/4571/0",
"title": "2016 IEEE International Symposium on Multimedia (ISM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percom-workshops/2017/4338/0/07917645",
"title": "A natural language query interface for searching personal information on smartwatches",
"doi": null,
"abstractUrl": "/proceedings-article/percom-workshops/2017/07917645/19wAMPZYXHq",
"parentPublication": {
"id": "proceedings/percom-workshops/2017/4338/0",
"title": "2017 IEEE International Conference on Pervasive Computing and Communications: Workshops (PerCom Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgo/2022/0584/0/09741262",
"title": "Enabling Near Real-Time NLU-Driven Natural Language Programming through Dynamic Grammar Graph-Based Translation",
"doi": null,
"abstractUrl": "/proceedings-article/cgo/2022/09741262/1C8FNAXyT9m",
"parentPublication": {
"id": "proceedings/cgo/2022/0584/0",
"title": "2022 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400c129",
"title": "Optimizing Quality for Probabilistic Skyline Computation and Probabilistic Similarity Search (Extended Abstract)",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400c129/1aDT0LrLHeo",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/chase/2019/2239/0/223900a079",
"title": "Pragmatic Characteristics of Security Conversations: An Exploratory Linguistic Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/chase/2019/223900a079/1cTIDQJkWaY",
"parentPublication": {
"id": "proceedings/chase/2019/2239/0",
"title": "2019 IEEE/ACM 12th International Workshop on Cooperative and Human Aspects of Software Engineering (CHASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1cTICaJ3mjm",
"title": "2019 IEEE/ACM 12th International Workshop on Cooperative and Human Aspects of Software Engineering (CHASE)",
"acronym": "chase",
"groupId": "1002764",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1cTIDQJkWaY",
"doi": "10.1109/CHASE.2019.00026",
"title": "Pragmatic Characteristics of Security Conversations: An Exploratory Linguistic Analysis",
"normalizedTitle": "Pragmatic Characteristics of Security Conversations: An Exploratory Linguistic Analysis",
"abstract": "Experts suggest that engineering secure software requires a defensive mindset to be ingrained in developer culture, which could be reflected in conversation. But what does a conversation about software security in a real project look like? Linguists analyze a wide array of characteristics: lexical, syntactic, semantic, and pragmatic. Pragmatics focus on identifying the style and tone of the author's language. If security requires a different mindset, then perhaps this would be reflected in the conversations' pragmatics. Our goal is to characterize the pragmatic features of conversations about security so that developers can be more informed about communication strategies regarding security concerns. We collected and annotated a corpus of conversations from 415,041 bug reports in the Chromium project. We examined five linguistic metrics related to pragmatics: formality, informativeness, implicature, politeness, and uncertainty. Our initial exploration into these data show that pragmatics plays a role, however small, in security conversations. These results indicate that the area of linguistic analysis shows promise in automatically identifying effective security communication strategies.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Experts suggest that engineering secure software requires a defensive mindset to be ingrained in developer culture, which could be reflected in conversation. But what does a conversation about software security in a real project look like? Linguists analyze a wide array of characteristics: lexical, syntactic, semantic, and pragmatic. Pragmatics focus on identifying the style and tone of the author's language. If security requires a different mindset, then perhaps this would be reflected in the conversations' pragmatics. Our goal is to characterize the pragmatic features of conversations about security so that developers can be more informed about communication strategies regarding security concerns. We collected and annotated a corpus of conversations from 415,041 bug reports in the Chromium project. We examined five linguistic metrics related to pragmatics: formality, informativeness, implicature, politeness, and uncertainty. Our initial exploration into these data show that pragmatics plays a role, however small, in security conversations. These results indicate that the area of linguistic analysis shows promise in automatically identifying effective security communication strategies.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Experts suggest that engineering secure software requires a defensive mindset to be ingrained in developer culture, which could be reflected in conversation. But what does a conversation about software security in a real project look like? Linguists analyze a wide array of characteristics: lexical, syntactic, semantic, and pragmatic. Pragmatics focus on identifying the style and tone of the author's language. If security requires a different mindset, then perhaps this would be reflected in the conversations' pragmatics. Our goal is to characterize the pragmatic features of conversations about security so that developers can be more informed about communication strategies regarding security concerns. We collected and annotated a corpus of conversations from 415,041 bug reports in the Chromium project. We examined five linguistic metrics related to pragmatics: formality, informativeness, implicature, politeness, and uncertainty. Our initial exploration into these data show that pragmatics plays a role, however small, in security conversations. These results indicate that the area of linguistic analysis shows promise in automatically identifying effective security communication strategies.",
"fno": "223900a079",
"keywords": [
"Computational Linguistics",
"Formal Logic",
"Program Debugging",
"Security Of Data",
"Software Metrics",
"Exploratory Linguistic Analysis",
"Security Communication Strategies",
"Linguistic Metrics",
"Software Security",
"Defensive Mindset",
"Security Conversations",
"Pragmatic Characteristics",
"Security",
"Computer Bugs",
"Pragmatics",
"Measurement",
"Uncertainty",
"Software Engineering",
"Security",
"Discourse",
"Natural Language Processing"
],
"authors": [
{
"affiliation": "Rochester Institute of Technology",
"fullName": "Benjamin S. Meyers",
"givenName": "Benjamin S.",
"surname": "Meyers",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Rochester Institute of Technology",
"fullName": "Nuthan Munaiah",
"givenName": "Nuthan",
"surname": "Munaiah",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Rochester Institute of Technology",
"fullName": "Andrew Meneely",
"givenName": "Andrew",
"surname": "Meneely",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Boston College",
"fullName": "Emily Prud'hommeaux",
"givenName": "Emily",
"surname": "Prud'hommeaux",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "chase",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-05-01T00:00:00",
"pubType": "proceedings",
"pages": "79-82",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-2239-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "223900a071",
"articleId": "1cTICMgVI2s",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "223900a083",
"articleId": "1cTICCNDDUY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdar/2017/3586/1/3586a262",
"title": "Academic Community Explorer (ACE) for Syntactic, Semantic and Pragmatic Document Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2017/3586a262/12OmNAle6mT",
"parentPublication": {
"id": "proceedings/icdar/2017/3586/1",
"title": "2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2017/3681/0/3681a388",
"title": "Identifying Security Requirements Based on Linguistic Analysis and Machine Learning",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2017/3681a388/12OmNC4eSDh",
"parentPublication": {
"id": "proceedings/apsec/2017/3681/0",
"title": "2017 24th Asia-Pacific Software Engineering Conference (APSEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wetice/2012/4717/0/4717a444",
"title": "An Ontological Model for Representing Pragmatic Aspects of Collaborative Problem Solving",
"doi": null,
"abstractUrl": "/proceedings-article/wetice/2012/4717a444/12OmNCmpcPv",
"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": "proceedings/asonam/2016/2846/0/07752318",
"title": "Mimicry in online conversations: An exploratory study of linguistic analysis techniques",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2016/07752318/12OmNqBbHFc",
"parentPublication": {
"id": "proceedings/asonam/2016/2846/0",
"title": "2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percomw/2016/1941/0/07457127",
"title": "Integrating quality of information with pragmatic assistance",
"doi": null,
"abstractUrl": "/proceedings-article/percomw/2016/07457127/12OmNxecS2l",
"parentPublication": {
"id": "proceedings/percomw/2016/1941/0",
"title": "2016 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spw/2017/1968/0/1968a080",
"title": "Writing Parsers Like it is 2017",
"doi": null,
"abstractUrl": "/proceedings-article/spw/2017/1968a080/12OmNyS6REc",
"parentPublication": {
"id": "proceedings/spw/2017/1968/0",
"title": "2017 IEEE Security and Privacy Workshops (SPW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/edcc/2016/1582/0/1582a037",
"title": "Software Metrics and Security Vulnerabilities: Dataset and Exploratory Study",
"doi": null,
"abstractUrl": "/proceedings-article/edcc/2016/1582a037/12OmNzC5TpB",
"parentPublication": {
"id": "proceedings/edcc/2016/1582/0",
"title": "2016 12th European Dependable Computing Conference (EDCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spw/2016/3690/0/5829a126",
"title": "Caradoc: A Pragmatic Approach to PDF Parsing and Validation",
"doi": null,
"abstractUrl": "/proceedings-article/spw/2016/5829a126/12OmNzvz6Dw",
"parentPublication": {
"id": "proceedings/spw/2016/3690/0",
"title": "2016 IEEE Security and Privacy Workshops (SPW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/03/09130035",
"title": "How Does Refactoring Impact Security When Improving Quality? A Security-Aware Refactoring Approach",
"doi": null,
"abstractUrl": "/journal/ts/2022/03/09130035/1l59oymq44E",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-companion/2021/1219/0/121900a099",
"title": "Scalable Call Graph Constructor for Maven",
"doi": null,
"abstractUrl": "/proceedings-article/icse-companion/2021/121900a099/1sET629XZaE",
"parentPublication": {
"id": "proceedings/icse-companion/2021/1219/0/",
"title": "2021 IEEE/ACM 43rd International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNy5hRd6",
"title": "Proceedings. DFMA 05. First International Conference on Distributed Frameworks for Multimedia Applications",
"acronym": "dfma",
"groupId": "1001024",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwDSdII",
"doi": "10.1109/DFMA.2005.45",
"title": "Real-Time Treatment Planning Optimisation for Brachytherapy",
"normalizedTitle": "Real-Time Treatment Planning Optimisation for Brachytherapy",
"abstract": "In this paper, we present an integrated system for real-time dose distribution calculation and treatment planning optimisation for brachytherapy of prostate cancer, with a special emphasis on the visual integration of the dosimetry and target images obtained from the open magnetic resonance system. This system involves a fast method to calculate dose distributions of multiple concurrent radioactive sources, based on the combination of elements from a database of pre-calculated dose distribution maps for single sources, combined linearly to provide the final dose distribution map. Simulated annealing, in conjunction with the inverse planning method, is used to determine the source dwell times at pre-selected locations in order to optimally irradiate the tumour while preserving the surrounding healthy tissues. This algorithm, implemented in FORTRAN, is integrated into a computer-assisted treatment planning tool, written in JAVA, using the runtime class and RMI API of Java. The whole system is now under clinical testing at the Geneva University Hospital.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present an integrated system for real-time dose distribution calculation and treatment planning optimisation for brachytherapy of prostate cancer, with a special emphasis on the visual integration of the dosimetry and target images obtained from the open magnetic resonance system. This system involves a fast method to calculate dose distributions of multiple concurrent radioactive sources, based on the combination of elements from a database of pre-calculated dose distribution maps for single sources, combined linearly to provide the final dose distribution map. Simulated annealing, in conjunction with the inverse planning method, is used to determine the source dwell times at pre-selected locations in order to optimally irradiate the tumour while preserving the surrounding healthy tissues. This algorithm, implemented in FORTRAN, is integrated into a computer-assisted treatment planning tool, written in JAVA, using the runtime class and RMI API of Java. The whole system is now under clinical testing at the Geneva University Hospital.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present an integrated system for real-time dose distribution calculation and treatment planning optimisation for brachytherapy of prostate cancer, with a special emphasis on the visual integration of the dosimetry and target images obtained from the open magnetic resonance system. This system involves a fast method to calculate dose distributions of multiple concurrent radioactive sources, based on the combination of elements from a database of pre-calculated dose distribution maps for single sources, combined linearly to provide the final dose distribution map. Simulated annealing, in conjunction with the inverse planning method, is used to determine the source dwell times at pre-selected locations in order to optimally irradiate the tumour while preserving the surrounding healthy tissues. This algorithm, implemented in FORTRAN, is integrated into a computer-assisted treatment planning tool, written in JAVA, using the runtime class and RMI API of Java. The whole system is now under clinical testing at the Geneva University Hospital.",
"fno": "22730303",
"keywords": [
"Medical Imaging",
"Brachytherapy",
"Image Guided Treatment",
"Computer Assisted Intervention"
],
"authors": [
{
"affiliation": "Swiss Federal Institute of Technology Lausanne (EPFL), Switzerland",
"fullName": "Simon Chatelain",
"givenName": "Simon",
"surname": "Chatelain",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Swiss Federal Institute of Technology Lausanne (EPFL), Switzerland",
"fullName": "Jean-Philippe Thiran",
"givenName": "Jean-Philippe",
"surname": "Thiran",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Swiss Federal Institute of Technology Lausanne (EPFL), Switzerland",
"fullName": "Valery-Olivier Zilio",
"givenName": "Valery-Olivier",
"surname": "Zilio",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Swiss Federal Institute of Technology Lausanne (EPFL), Switzerland",
"fullName": "Marc-Olivier Bettler",
"givenName": "Marc-Olivier",
"surname": "Bettler",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Swiss Federal Institute of Technology Lausanne (EPFL), Switzerland; Paul Scherrer Institute, Switzerland",
"fullName": "O. P. Joneja",
"givenName": "O. P.",
"surname": "Joneja",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Swiss Federal Institute of Technology Lausanne (EPFL), Switzerland; Paul Scherrer Institute, Switzerland",
"fullName": "Rakesh Chawla",
"givenName": "Rakesh",
"surname": "Chawla",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Geneva University Hospital, Switzerland",
"fullName": "Youri Popowski",
"givenName": "Youri",
"surname": "Popowski",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "dfma",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-02-01T00:00:00",
"pubType": "proceedings",
"pages": "303-307",
"year": "2005",
"issn": null,
"isbn": "0-7695-2273-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "22730295",
"articleId": "12OmNwtWfUR",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "22730310",
"articleId": "12OmNvEhg1Q",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icci/2007/1327/0/04341913",
"title": "Software tool for Breast Cancer Brachytherapy Planning using VTK",
"doi": null,
"abstractUrl": "/proceedings-article/icci/2007/04341913/12OmNBSBk4u",
"parentPublication": {
"id": "proceedings/icci/2007/1327/0",
"title": "6th IEEE International Conference on Cognitive Informatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccabs/2012/1320/0/06182630",
"title": "Volume matching with application in medical treatment planning",
"doi": null,
"abstractUrl": "/proceedings-article/iccabs/2012/06182630/12OmNC2fGAk",
"parentPublication": {
"id": "proceedings/iccabs/2012/1320/0",
"title": "2012 IEEE 2nd International Conference on Computational Advances in Bio and medical Sciences (ICCABS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1997/8183/2/81832132",
"title": "Fourier-Based Dose Calculation in Radiation Brachytherapy",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81832132/12OmNqJHFBo",
"parentPublication": {
"id": "proceedings/icip/1997/8183/2",
"title": "Proceedings of International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/1993/3752/0/00263008",
"title": "Remote afterloading brachytherapy: human factors in a partially automated treatment system",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/1993/00263008/12OmNvAAtCk",
"parentPublication": {
"id": "proceedings/cbms/1993/3752/0",
"title": "Proceedings of the Sixth Annual 1993 IEEE Symposium Computer-Based Medical Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/1994/6256/0/00316002",
"title": "Towards automated brachytherapy film implant labeling using statistical pattern recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/1994/00316002/12OmNxX3uEl",
"parentPublication": {
"id": "proceedings/cbms/1994/6256/0",
"title": "Proceedings of IEEE Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vbc/1990/2039/0/00109295",
"title": "Volume rendering in radiation treatment planning",
"doi": null,
"abstractUrl": "/proceedings-article/vbc/1990/00109295/12OmNylsZFM",
"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/bibe/2010/4083/0/4083a203",
"title": "Modular Software Design for Brachytherapy Image-Guided Robotic Systems",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2010/4083a203/12OmNzlD9DT",
"parentPublication": {
"id": "proceedings/bibe/2010/4083/0",
"title": "2010 IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/case/2012/0430/0/06386483",
"title": "Initial experiments toward automated robotic implantation of skew-line needle arrangements for HDR brachytherapy",
"doi": null,
"abstractUrl": "/proceedings-article/case/2012/06386483/12OmNzy7uQS",
"parentPublication": {
"id": "proceedings/case/2012/0430/0",
"title": "2012 IEEE International Conference on Automation Science and Engineering (CASE 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017652",
"title": "Understanding the Relationship Between Interactive Optimisation and Visual Analytics in the Context of Prostate Brachytherapy",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017652/13rRUwgQpDy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2018/7744/0/774400a323",
"title": "Validation of Deformable Dose Accumulation for Cervical Cancer Interstitial Brachytherapy",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2018/774400a323/17D45Xbl4NM",
"parentPublication": {
"id": "proceedings/itme/2018/7744/0",
"title": "2018 9th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx8Ounz",
"title": "2010 IEEE Haptics Symposium (Formerly known as Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems)",
"acronym": "haptics",
"groupId": "1000312",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyQYttN",
"doi": "10.1109/HAPTIC.2010.5444612",
"title": "Haptic system design for MRI-guided needle based prostate brachytherapy",
"normalizedTitle": "Haptic system design for MRI-guided needle based prostate brachytherapy",
"abstract": "This paper presents the design of a haptic system for prostate needle brachytherapy under magnetic resonance imaging (MRI) guidance. This haptic system consists of some recently developed MRI-compatible mechatronic devices, including a fiber optic force sensor and a piezoelectric motor actuated needle driver mounted on a specifically designed 3-axis linear stage. We first propose the teleoperation framework with system architecture, infrastructure and control algorithm for the master-slave haptic interface. Then we introduce some novel sensors and actuators for MRI-compatible mechatronic devices of this haptic system. We developed the force sensor which provides in-vivo measurement of needle insertion forces to render proprioception associated with the brachytherapy procedure. We discuss the sensing principle of the optical sensor which enables two degrees-of-freedom (DOF) torque measurement and one DOF force measurement. The second apparatus of this system is a high precision 3-axis linear stage actuated by piezoelectric motors and position sensed by optical linear and rotary encoders and all of them have proved good magnetic compatibility. The needle driver can simultaneously provide needle cannula rotation and stylet translation motion while the cannula translation is engendered by the stage. The independent rotation and translation motion of the cannula and stylet can increase the targeting accuracy while minimize the tissue deformation and damage. The master-slave haptic system is capable of positioning needle and sensing insertion forces thus increasing the operation autonomy, accuracy and reducing the operation time.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents the design of a haptic system for prostate needle brachytherapy under magnetic resonance imaging (MRI) guidance. This haptic system consists of some recently developed MRI-compatible mechatronic devices, including a fiber optic force sensor and a piezoelectric motor actuated needle driver mounted on a specifically designed 3-axis linear stage. We first propose the teleoperation framework with system architecture, infrastructure and control algorithm for the master-slave haptic interface. Then we introduce some novel sensors and actuators for MRI-compatible mechatronic devices of this haptic system. We developed the force sensor which provides in-vivo measurement of needle insertion forces to render proprioception associated with the brachytherapy procedure. We discuss the sensing principle of the optical sensor which enables two degrees-of-freedom (DOF) torque measurement and one DOF force measurement. The second apparatus of this system is a high precision 3-axis linear stage actuated by piezoelectric motors and position sensed by optical linear and rotary encoders and all of them have proved good magnetic compatibility. The needle driver can simultaneously provide needle cannula rotation and stylet translation motion while the cannula translation is engendered by the stage. The independent rotation and translation motion of the cannula and stylet can increase the targeting accuracy while minimize the tissue deformation and damage. The master-slave haptic system is capable of positioning needle and sensing insertion forces thus increasing the operation autonomy, accuracy and reducing the operation time.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents the design of a haptic system for prostate needle brachytherapy under magnetic resonance imaging (MRI) guidance. This haptic system consists of some recently developed MRI-compatible mechatronic devices, including a fiber optic force sensor and a piezoelectric motor actuated needle driver mounted on a specifically designed 3-axis linear stage. We first propose the teleoperation framework with system architecture, infrastructure and control algorithm for the master-slave haptic interface. Then we introduce some novel sensors and actuators for MRI-compatible mechatronic devices of this haptic system. We developed the force sensor which provides in-vivo measurement of needle insertion forces to render proprioception associated with the brachytherapy procedure. We discuss the sensing principle of the optical sensor which enables two degrees-of-freedom (DOF) torque measurement and one DOF force measurement. The second apparatus of this system is a high precision 3-axis linear stage actuated by piezoelectric motors and position sensed by optical linear and rotary encoders and all of them have proved good magnetic compatibility. The needle driver can simultaneously provide needle cannula rotation and stylet translation motion while the cannula translation is engendered by the stage. The independent rotation and translation motion of the cannula and stylet can increase the targeting accuracy while minimize the tissue deformation and damage. The master-slave haptic system is capable of positioning needle and sensing insertion forces thus increasing the operation autonomy, accuracy and reducing the operation time.",
"fno": "05444612",
"keywords": [
"Biological Tissues",
"Biomedical MRI",
"Biomedical Optical Imaging",
"Brachytherapy",
"Fibre Optic Sensors",
"Force Sensors",
"Haptic Interfaces",
"Mechatronics",
"Medical Computing",
"Needles",
"Piezoelectric Motors",
"Haptic System Design",
"MRI Guided Needle",
"Prostate Brachytherapy",
"Magnetic Resonance Imaging Guidance",
"Mechatronic Devices",
"Fiber Optic Force Sensor",
"Piezoelectric Motor",
"Needle Driver",
"3 Axis Linear Stage",
"Teleoperation Framework",
"Master Slave Haptic Interface",
"Needle Insertion Forces",
"Proprioception",
"Sensing Principle",
"DOF Torque Measurement",
"DOF Force Measurement",
"Needle Cannula Rotation",
"Stylet Translation Motion",
"Tissue Deformation",
"Tissue Damage",
"Master Slave Haptic System",
"Haptic Interfaces",
"Needles",
"Brachytherapy",
"Magnetic Resonance Imaging",
"Mechatronics",
"Force Sensors",
"Master Slave",
"Force Measurement",
"Optical Sensors",
"Optical Fibers",
"Optical Force Sensor",
"MRI Compatible",
"Haptic Feedback",
"Needle Driver",
"Prostate Needle Brachytherapy"
],
"authors": [
{
"affiliation": "Automation and Interventional Medicine (AIM) Laboratory in the Department of Mechanical Engineering, Worcester Polytechnic Institute, MA, USA",
"fullName": "Hao Su",
"givenName": "Hao",
"surname": "Su",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Automation and Interventional Medicine (AIM) Laboratory in the Department of Mechanical Engineering, Worcester Polytechnic Institute, MA, USA",
"fullName": "Weijian Shang",
"givenName": null,
"surname": "Weijian Shang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Automation and Interventional Medicine (AIM) Laboratory in the Department of Mechanical Engineering, Worcester Polytechnic Institute, MA, USA",
"fullName": "Gregory A. Cole",
"givenName": "Gregory A.",
"surname": "Cole",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Automation and Interventional Medicine (AIM) Laboratory in the Department of Mechanical Engineering, Worcester Polytechnic Institute, MA, USA",
"fullName": "Kevin Harrington",
"givenName": "Kevin",
"surname": "Harrington",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Automation and Interventional Medicine (AIM) Laboratory in the Department of Mechanical Engineering, Worcester Polytechnic Institute, MA, USA",
"fullName": "Gregory S. Fischer",
"givenName": "Gregory S.",
"surname": "Fischer",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "haptics",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-03-01T00:00:00",
"pubType": "proceedings",
"pages": "",
"year": "2010",
"issn": "2324-7347",
"isbn": "978-1-4244-6821-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05444615",
"articleId": "12OmNqHItwc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05444613",
"articleId": "12OmNyyO8KO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bibe/2015/7983/0/07367697",
"title": "A mathematical model of a novel automated medical device for needle insertions",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2015/07367697/12OmNBkP3zY",
"parentPublication": {
"id": "proceedings/bibe/2015/7983/0",
"title": "2015 IEEE 15th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2015/1727/0/07223388",
"title": "Preliminary evaluation of a virtual needle insertion training system",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2015/07223388/12OmNCdk2Jm",
"parentPublication": {
"id": "proceedings/vr/2015/1727/0",
"title": "2015 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2002/1489/0/14890344",
"title": "Simulated Interactive Needle Insertion",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2002/14890344/12OmNyKa5Y6",
"parentPublication": {
"id": "proceedings/haptics/2002/1489/0",
"title": "Haptic Interfaces for Virtual Environment and Teleoperator Systems, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2008/2005/0/04479920",
"title": "Assessment of Vibrotactile Feedback in a Needle-Insertion Task using a Surgical Robot",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2008/04479920/12OmNyOq4T4",
"parentPublication": {
"id": "proceedings/haptics/2008/2005/0",
"title": "IEEE Haptics Symposium 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2010/4083/0/4083a203",
"title": "Modular Software Design for Brachytherapy Image-Guided Robotic Systems",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2010/4083a203/12OmNzlD9DT",
"parentPublication": {
"id": "proceedings/bibe/2010/4083/0",
"title": "2010 IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/case/2012/0430/0/06386483",
"title": "Initial experiments toward automated robotic implantation of skew-line needle arrangements for HDR brachytherapy",
"doi": null,
"abstractUrl": "/proceedings-article/case/2012/06386483/12OmNzy7uQS",
"parentPublication": {
"id": "proceedings/case/2012/0430/0",
"title": "2012 IEEE International Conference on Automation Science and Engineering (CASE 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2011/03/tth2011030188",
"title": "Haptic Simulator for Prostate Brachytherapy with Simulated Needle and Probe Interaction",
"doi": null,
"abstractUrl": "/journal/th/2011/03/tth2011030188/13rRUILtJr3",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017652",
"title": "Understanding the Relationship Between Interactive Optimisation and Visual Analytics in the Context of Prostate Brachytherapy",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017652/13rRUwgQpDy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2011/03/tth2011030155",
"title": "Perception and Action in Teleoperated Needle Insertion",
"doi": null,
"abstractUrl": "/journal/th/2011/03/tth2011030155/13rRUyoPSPf",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/03/08948290",
"title": "Surgical Navigation System for Low-Dose-Rate Brachytherapy Based on Mixed Reality",
"doi": null,
"abstractUrl": "/magazine/cg/2021/03/08948290/1geNLto4KGs",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAIMOaS",
"title": "2010 IEEE International Conference on Bioinformatics and Bioengineering",
"acronym": "bibe",
"groupId": "1000075",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzlD9DT",
"doi": "10.1109/BIBE.2010.40",
"title": "Modular Software Design for Brachytherapy Image-Guided Robotic Systems",
"normalizedTitle": "Modular Software Design for Brachytherapy Image-Guided Robotic Systems",
"abstract": "— Modular software design is a technique that increase reusability and portability of software composed from separate parts, called modules. We have designed and developed a reusable integrated software solution for robotic prostate brachytherapy procedure. The application is capable of concurrent handling of all aspects of the image-guided brachytherapy procedure: ultrasound image acquisition, anatomic delineation, target modeling, dosimetry planning and analysis, seed delivery, and visualization of all surgerical steps involved in the procedure. Based on force feedback and visual feedback, the control module of the application is capable of controlling the robotic system (i.e. motions of the ultrasound probe and the needles), supervising the flow of the procedure via built-in strategies for emergency handling and recovery, collision avoidance, manual takeover (if necessary), needle tracking and real-time dose updates. The implementation of the developed software solution to the two brachytherapy robotic systems has been presented.",
"abstracts": [
{
"abstractType": "Regular",
"content": "— Modular software design is a technique that increase reusability and portability of software composed from separate parts, called modules. We have designed and developed a reusable integrated software solution for robotic prostate brachytherapy procedure. The application is capable of concurrent handling of all aspects of the image-guided brachytherapy procedure: ultrasound image acquisition, anatomic delineation, target modeling, dosimetry planning and analysis, seed delivery, and visualization of all surgerical steps involved in the procedure. Based on force feedback and visual feedback, the control module of the application is capable of controlling the robotic system (i.e. motions of the ultrasound probe and the needles), supervising the flow of the procedure via built-in strategies for emergency handling and recovery, collision avoidance, manual takeover (if necessary), needle tracking and real-time dose updates. The implementation of the developed software solution to the two brachytherapy robotic systems has been presented.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "— Modular software design is a technique that increase reusability and portability of software composed from separate parts, called modules. We have designed and developed a reusable integrated software solution for robotic prostate brachytherapy procedure. The application is capable of concurrent handling of all aspects of the image-guided brachytherapy procedure: ultrasound image acquisition, anatomic delineation, target modeling, dosimetry planning and analysis, seed delivery, and visualization of all surgerical steps involved in the procedure. Based on force feedback and visual feedback, the control module of the application is capable of controlling the robotic system (i.e. motions of the ultrasound probe and the needles), supervising the flow of the procedure via built-in strategies for emergency handling and recovery, collision avoidance, manual takeover (if necessary), needle tracking and real-time dose updates. The implementation of the developed software solution to the two brachytherapy robotic systems has been presented.",
"fno": "4083a203",
"keywords": [
"Software Design",
"Medical Robot Control",
"Brachytherapy Robot",
"Robotic Surgery"
],
"authors": [
{
"affiliation": null,
"fullName": "Ivan Buzurovic",
"givenName": "Ivan",
"surname": "Buzurovic",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Tarun K. Podder",
"givenName": "Tarun K.",
"surname": "Podder",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Lei Fu",
"givenName": "Lei",
"surname": "Fu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yan Yu",
"givenName": "Yan",
"surname": "Yu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "bibe",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-05-01T00:00:00",
"pubType": "proceedings",
"pages": "203-208",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4083-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4083a197",
"articleId": "12OmNzUxO4v",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4083a209",
"articleId": "12OmNCfSqKC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bibe/2010/4083/0/4083a209",
"title": "Multichannel Robot for Image-Guided Brachytherapy",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2010/4083a209/12OmNCfSqKC",
"parentPublication": {
"id": "proceedings/bibe/2010/4083/0",
"title": "2010 IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2007/1509/0/04375566",
"title": "A Robotic System for Real-time Tumor Manipulation During Image guided Breast Biopsy",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2007/04375566/12OmNxdDFME",
"parentPublication": {
"id": "proceedings/bibe/2007/1509/0",
"title": "7th IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2010/6821/0/05444612",
"title": "Haptic system design for MRI-guided needle based prostate brachytherapy",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2010/05444612/12OmNyQYttN",
"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": "proceedings/at-equal/2009/3753/0/3753a015",
"title": "Robotic Surgery: Past Results and Current Developments",
"doi": null,
"abstractUrl": "/proceedings-article/at-equal/2009/3753a015/12OmNylsZVI",
"parentPublication": {
"id": "proceedings/at-equal/2009/3753/0",
"title": "Advanced Technologies for Enhanced Quality of Life",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2017/1324/0/132401a444",
"title": "Towards a Modular, Customizable Robotic System for Needle-Based Image-Guided Interventions: Preliminary Designs, Implementation, and Testing",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2017/132401a444/12OmNzC5TqB",
"parentPublication": {
"id": "proceedings/bibe/2017/1324/0",
"title": "2017 IEEE 17th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/case/2012/0430/0/06386483",
"title": "Initial experiments toward automated robotic implantation of skew-line needle arrangements for HDR brachytherapy",
"doi": null,
"abstractUrl": "/proceedings-article/case/2012/06386483/12OmNzy7uQS",
"parentPublication": {
"id": "proceedings/case/2012/0430/0",
"title": "2012 IEEE International Conference on Automation Science and Engineering (CASE 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2011/03/tth2011030188",
"title": "Haptic Simulator for Prostate Brachytherapy with Simulated Needle and Probe Interaction",
"doi": null,
"abstractUrl": "/journal/th/2011/03/tth2011030188/13rRUILtJr3",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995677",
"title": "Explainability-guided Mathematical Model-Based Segmentation of Transrectal Ultrasound Images for Prostate Brachytherapy",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995677/1JC2XzbSjhS",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995143",
"title": "OCT-guided Robotic Subretinal Needle Injections: A Deep Learning-Based Registration Approach",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995143/1JC3h3JCZ8s",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/03/08948290",
"title": "Surgical Navigation System for Low-Dose-Rate Brachytherapy Based on Mixed Reality",
"doi": null,
"abstractUrl": "/magazine/cg/2021/03/08948290/1geNLto4KGs",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzlUKD1",
"title": "2012 IEEE International Conference on Automation Science and Engineering (CASE 2012)",
"acronym": "case",
"groupId": "1001095",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzy7uQS",
"doi": "10.1109/CoASE.2012.6386483",
"title": "Initial experiments toward automated robotic implantation of skew-line needle arrangements for HDR brachytherapy",
"normalizedTitle": "Initial experiments toward automated robotic implantation of skew-line needle arrangements for HDR brachytherapy",
"abstract": "Automation seeks to improve the reliability and quality of processes. This study aims to automate high dose rate brachytherapy (HDR-BT), a radiation therapy that places radioactive sources at the site of the tumor using needles. Although HDR-BT has a high rate of clinical success in curing prostate cancer, it also has several side effects related to needle and dose trauma. A new planning algorithm from previous work optimizes needle arrangements using skew-lines (non-parallel, non-intersecting lines). This paper presents initial experiments towards an automated system for implanting skew-line needle arrangements computed from a planning system. We describe the interface, calibration and integration of the robotic hardware with the planning system, and present experiments using our robotic system to implant needles into anatomically-correct tissue phantoms. Results suggest that this system can achieve HDR-BT treatment objectives with reduced trauma to organs and low demands on operator skill, thus making the procedure more reliable and repeatable. In the future, we believe that robotic HDR-BT will improve overall treatment quality with reduced dependence on physician skill.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Automation seeks to improve the reliability and quality of processes. This study aims to automate high dose rate brachytherapy (HDR-BT), a radiation therapy that places radioactive sources at the site of the tumor using needles. Although HDR-BT has a high rate of clinical success in curing prostate cancer, it also has several side effects related to needle and dose trauma. A new planning algorithm from previous work optimizes needle arrangements using skew-lines (non-parallel, non-intersecting lines). This paper presents initial experiments towards an automated system for implanting skew-line needle arrangements computed from a planning system. We describe the interface, calibration and integration of the robotic hardware with the planning system, and present experiments using our robotic system to implant needles into anatomically-correct tissue phantoms. Results suggest that this system can achieve HDR-BT treatment objectives with reduced trauma to organs and low demands on operator skill, thus making the procedure more reliable and repeatable. In the future, we believe that robotic HDR-BT will improve overall treatment quality with reduced dependence on physician skill.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Automation seeks to improve the reliability and quality of processes. This study aims to automate high dose rate brachytherapy (HDR-BT), a radiation therapy that places radioactive sources at the site of the tumor using needles. Although HDR-BT has a high rate of clinical success in curing prostate cancer, it also has several side effects related to needle and dose trauma. A new planning algorithm from previous work optimizes needle arrangements using skew-lines (non-parallel, non-intersecting lines). This paper presents initial experiments towards an automated system for implanting skew-line needle arrangements computed from a planning system. We describe the interface, calibration and integration of the robotic hardware with the planning system, and present experiments using our robotic system to implant needles into anatomically-correct tissue phantoms. Results suggest that this system can achieve HDR-BT treatment objectives with reduced trauma to organs and low demands on operator skill, thus making the procedure more reliable and repeatable. In the future, we believe that robotic HDR-BT will improve overall treatment quality with reduced dependence on physician skill.",
"fno": "06386483",
"keywords": [
"Brachytherapy",
"Cancer",
"Dosimetry",
"Injuries",
"Medical Robotics",
"Needles",
"Phantoms",
"Prosthetics",
"Radioactive Sources",
"Tumours",
"User Interfaces",
"Automated Robotic Implantation",
"HDR Brachytherapy",
"Automate High Dose Rate Brachytherapy",
"Radiation Therapy",
"Radioactive Sources",
"Tumor",
"Clinical Success Rate",
"Prostate Cancer",
"Dose Trauma",
"Planning Algorithm",
"Nonparallel Nonintersecting Skew Line Needle Implantation",
"Robotic Hardware Integration",
"Robotic Hardware Calibration",
"Anatomically Correct Tissue Phantoms",
"Organs",
"Robotic HDR BT Treatment Quality Improvement",
"Physician Skill",
"Robotic Hardware Interface",
"Needles",
"Phantoms",
"Planning",
"Implants",
"Brachytherapy",
"Robot Kinematics"
],
"authors": [
{
"affiliation": null,
"fullName": "Animesh Garg",
"givenName": "Animesh",
"surname": "Garg",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Timmy Siauw",
"givenName": "Timmy",
"surname": "Siauw",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Dmitry Berenson",
"givenName": "Dmitry",
"surname": "Berenson",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Adam Cunha",
"givenName": "Adam",
"surname": "Cunha",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "I-Chow Hsu",
"givenName": "I-Chow",
"surname": "Hsu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jean Pouliot",
"givenName": "Jean",
"surname": "Pouliot",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Dan Stoianovici",
"givenName": "Dan",
"surname": "Stoianovici",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Ken Goldberg",
"givenName": "Ken",
"surname": "Goldberg",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "case",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-08-01T00:00:00",
"pubType": "proceedings",
"pages": "26-33",
"year": "2012",
"issn": "2161-8070",
"isbn": "978-1-4673-0430-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06386482",
"articleId": "12OmNqIzh3s",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06386484",
"articleId": "12OmNrJ11y1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icmens/2003/1947/0/19470032",
"title": "On The Design of an Electronic Mosquito: Design and Analysis of the Micro-Needle",
"doi": null,
"abstractUrl": "/proceedings-article/icmens/2003/19470032/12OmNAS9zrp",
"parentPublication": {
"id": "proceedings/icmens/2003/1947/0",
"title": "MEMS, NANO, and Smart Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2015/7983/0/07367697",
"title": "A mathematical model of a novel automated medical device for needle insertions",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2015/07367697/12OmNBkP3zY",
"parentPublication": {
"id": "proceedings/bibe/2015/7983/0",
"title": "2015 IEEE 15th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2010/6821/0/05444612",
"title": "Haptic system design for MRI-guided needle based prostate brachytherapy",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2010/05444612/12OmNyQYttN",
"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": "proceedings/bibe/2017/1324/0/132401a444",
"title": "Towards a Modular, Customizable Robotic System for Needle-Based Image-Guided Interventions: Preliminary Designs, Implementation, and Testing",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2017/132401a444/12OmNzC5TqB",
"parentPublication": {
"id": "proceedings/bibe/2017/1324/0",
"title": "2017 IEEE 17th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2010/4083/0/4083a203",
"title": "Modular Software Design for Brachytherapy Image-Guided Robotic Systems",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2010/4083a203/12OmNzlD9DT",
"parentPublication": {
"id": "proceedings/bibe/2010/4083/0",
"title": "2010 IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2011/03/tth2011030188",
"title": "Haptic Simulator for Prostate Brachytherapy with Simulated Needle and Probe Interaction",
"doi": null,
"abstractUrl": "/journal/th/2011/03/tth2011030188/13rRUILtJr3",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2014/04/06909076",
"title": "Teleoperation of Steerable Flexible Needles by Combining Kinesthetic and Vibratory Feedback",
"doi": null,
"abstractUrl": "/journal/th/2014/04/06909076/13rRUxASuhN",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995143",
"title": "OCT-guided Robotic Subretinal Needle Injections: A Deep Learning-Based Registration Approach",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995143/1JC3h3JCZ8s",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/03/08948290",
"title": "Surgical Navigation System for Low-Dose-Rate Brachytherapy Based on Mixed Reality",
"doi": null,
"abstractUrl": "/magazine/cg/2021/03/08948290/1geNLto4KGs",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aemcse/2021/1596/0/159600b254",
"title": "Design and Analysis of Finishing and Detection Device for Knitting Needle",
"doi": null,
"abstractUrl": "/proceedings-article/aemcse/2021/159600b254/1wcdjEp1NHa",
"parentPublication": {
"id": "proceedings/aemcse/2021/1596/0",
"title": "2021 4th International Conference on Advanced Electronic Materials, Computers and Software Engineering (AEMCSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1JC1F8KcINO",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"acronym": "bibm",
"groupId": "9994793",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1JC2XzbSjhS",
"doi": "10.1109/BIBM55620.2022.9995677",
"title": "Explainability-guided Mathematical Model-Based Segmentation of Transrectal Ultrasound Images for Prostate Brachytherapy",
"normalizedTitle": "Explainability-guided Mathematical Model-Based Segmentation of Transrectal Ultrasound Images for Prostate Brachytherapy",
"abstract": "Accurate segmentation of the prostate is important to image-guided prostate biopsy and brachytherapy treatment planning. However, the incompleteness of prostate boundary increases the challenges in the automatic ultrasound prostate segmentation task. In this work, an automatic coarse-to-fine framework for prostate segmentation was developed and tested. Our framework has four metrics: first, it combines the ability of deep learning model to automatically locate the prostate and integrates the characteristics of principal curve that can automatically fit the data center for refinement. Second, to well balance the accuracy and efficiency of our method, we proposed an intelligent determination of the data radius algorithm-based modified polygon tracking method. Third, we modified the traditional quantum evolution network by adding the numerous-operator scheme and global optimum search scheme for ensuring population diversity and achieving the optimal model parameters. Fourth, we found a suitable mathematical function expressed by the parameters of the machine learning model to smooth the contour of the prostate. Results on the multiple datasets demonstrate that our method has good segmentation performance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Accurate segmentation of the prostate is important to image-guided prostate biopsy and brachytherapy treatment planning. However, the incompleteness of prostate boundary increases the challenges in the automatic ultrasound prostate segmentation task. In this work, an automatic coarse-to-fine framework for prostate segmentation was developed and tested. Our framework has four metrics: first, it combines the ability of deep learning model to automatically locate the prostate and integrates the characteristics of principal curve that can automatically fit the data center for refinement. Second, to well balance the accuracy and efficiency of our method, we proposed an intelligent determination of the data radius algorithm-based modified polygon tracking method. Third, we modified the traditional quantum evolution network by adding the numerous-operator scheme and global optimum search scheme for ensuring population diversity and achieving the optimal model parameters. Fourth, we found a suitable mathematical function expressed by the parameters of the machine learning model to smooth the contour of the prostate. Results on the multiple datasets demonstrate that our method has good segmentation performance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Accurate segmentation of the prostate is important to image-guided prostate biopsy and brachytherapy treatment planning. However, the incompleteness of prostate boundary increases the challenges in the automatic ultrasound prostate segmentation task. In this work, an automatic coarse-to-fine framework for prostate segmentation was developed and tested. Our framework has four metrics: first, it combines the ability of deep learning model to automatically locate the prostate and integrates the characteristics of principal curve that can automatically fit the data center for refinement. Second, to well balance the accuracy and efficiency of our method, we proposed an intelligent determination of the data radius algorithm-based modified polygon tracking method. Third, we modified the traditional quantum evolution network by adding the numerous-operator scheme and global optimum search scheme for ensuring population diversity and achieving the optimal model parameters. Fourth, we found a suitable mathematical function expressed by the parameters of the machine learning model to smooth the contour of the prostate. Results on the multiple datasets demonstrate that our method has good segmentation performance.",
"fno": "09995677",
"keywords": [
"Biological Organs",
"Biomedical Ultrasonics",
"Brachytherapy",
"Cancer",
"Diagnostic Radiography",
"Image Segmentation",
"Learning Artificial Intelligence",
"Medical Image Processing",
"Optimisation",
"Automatic Ultrasound Prostate Segmentation Task",
"Brachytherapy Treatment Planning",
"Coarse To Fine Framework",
"Data Radius Algorithm Based",
"Deep Learning Model",
"Explainability Guided Mathematical Model Based Segmentation",
"Good Segmentation Performance",
"Image Guided Prostate Biopsy",
"Machine Learning Model",
"Optimal Model Parameters",
"Prostate Boundary",
"Prostate Brachytherapy",
"Transrectal Ultrasound Images",
"Measurement",
"Image Segmentation",
"Technological Innovation",
"Ultrasonic Imaging",
"Biological System Modeling",
"Mathematical Models",
"Brachytherapy",
"Ultrasound Prostate Segmentation",
"Modified Polygon Tracking Method",
"Improved Quantum Evolution Network",
"A Suitable Mathematical Function"
],
"authors": [
{
"affiliation": "Soochow University,School of Future Science and Engineering,Department of Radiation Oncology,UT Southwestern Medical Center,Suzhou,TX,China",
"fullName": "Tao Peng",
"givenName": "Tao",
"surname": "Peng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Jiangsu Province Hospital of Chinese Medicine,Department of Ultrasound,Nanjing,Jiangsu,China",
"fullName": "Yiyun Wu",
"givenName": "Yiyun",
"surname": "Wu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Tsinghua University Affiliated Beijing Tsinghua,Changgung Hospital,Department of Ultrasound,Beijing,China",
"fullName": "Jing Zhao",
"givenName": "Jing",
"surname": "Zhao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "the Second Affiliated Hospital of Soochow University,Department of Radiology,Suzhou,Jiangsu,China",
"fullName": "Bo Zhang",
"givenName": "Bo",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Soochow University,School of Future Science and Engineering,Department of Computer Science and Technology,Suzhou,China",
"fullName": "Jin Wang",
"givenName": "Jin",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The Hong Kong Polytechnic University,Department of Health Technology and Informatics,Hong Kong,China",
"fullName": "Jing Cai",
"givenName": "Jing",
"surname": "Cai",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "bibm",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-12-01T00:00:00",
"pubType": "proceedings",
"pages": "1126-1131",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-6819-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09995173",
"articleId": "1JC28XuvGo0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09995264",
"articleId": "1JC2C8UeJvW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cbms/1995/7117/0/71170094",
"title": "Prostate Ultrasound Image Analysis: Localization of Cancer Lesions to Assist Biopsy",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/1995/71170094/12OmNC4wtti",
"parentPublication": {
"id": "proceedings/cbms/1995/7117/0",
"title": "Proceedings Eighth IEEE Symposium on Computer-Based Medical Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2004/8484/3/01326595",
"title": "Segmentation of prostate contours from ultrasound images",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326595/12OmNrH1PD8",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/3",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2013/1053/0/06627785",
"title": "A virtual reality simulator combining a learning environment and clinical case database for image-guided prostate biopsy",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2013/06627785/12OmNviZlyr",
"parentPublication": {
"id": "proceedings/cbms/2013/1053/0",
"title": "2013 IEEE 26th International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2001/1004/0/10040433",
"title": "Statistically Optimized Biopsy Strategy for the Diagnosis of Prostate Cancer",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2001/10040433/12OmNwkhTel",
"parentPublication": {
"id": "proceedings/cbms/2001/1004/0",
"title": "Proceedings 14th IEEE Symposium on Computer-Based Medical Systems. CBMS 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2010/6821/0/05444612",
"title": "Haptic system design for MRI-guided needle based prostate brachytherapy",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2010/05444612/12OmNyQYttN",
"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": "proceedings/aipr/2004/2250/0/22500145",
"title": "Top-Down Approach to Segmentation of Prostate Boundaries in Ultrasound Images",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2004/22500145/12OmNzd7brR",
"parentPublication": {
"id": "proceedings/aipr/2004/2250/0",
"title": "33rd Applied Imagery Pattern Recognition Workshop (AIPR'04)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2010/4083/0/4083a203",
"title": "Modular Software Design for Brachytherapy Image-Guided Robotic Systems",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2010/4083a203/12OmNzlD9DT",
"parentPublication": {
"id": "proceedings/bibe/2010/4083/0",
"title": "2010 IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/case/2012/0430/0/06386483",
"title": "Initial experiments toward automated robotic implantation of skew-line needle arrangements for HDR brachytherapy",
"doi": null,
"abstractUrl": "/proceedings-article/case/2012/06386483/12OmNzy7uQS",
"parentPublication": {
"id": "proceedings/case/2012/0430/0",
"title": "2012 IEEE International Conference on Automation Science and Engineering (CASE 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2011/03/tth2011030188",
"title": "Haptic Simulator for Prostate Brachytherapy with Simulated Needle and Probe Interaction",
"doi": null,
"abstractUrl": "/journal/th/2011/03/tth2011030188/13rRUILtJr3",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017652",
"title": "Understanding the Relationship Between Interactive Optimisation and Visual Analytics in the Context of Prostate Brachytherapy",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017652/13rRUwgQpDy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNCdk2Zr",
"title": "2015 IEEE Symposium on Visualization for Cyber Security (VizSec)",
"acronym": "vizsec",
"groupId": "1810104",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAGepXg",
"doi": "10.1109/VIZSEC.2015.7312770",
"title": "Discovery of rating fraud with real-time streaming visual analytics",
"normalizedTitle": "Discovery of rating fraud with real-time streaming visual analytics",
"abstract": "The rating fraud in online e-commerce stores targets at receiving large revenues through boosting the popularity of selected items with fake ratings. The challenges of detecting rating frauds come from discovering small scale abnormal activities in a large amount of data and detecting frauds in a time-critical manner from online rating streams. This paper presents a real-time visual analytics system that consists of two essential components: a server for automatically handling data streams and a visual analytics interface for performing interactive analysis. Based on the features of rating frauds, we present a detection solution which balances computationally expensive algorithms and interactive analysis between the server and analysts. Specifically, our detection system filters data through performing an initial suspicion level detection on the server, and analysts can combine different statistical analysis of the user / item matrix through a co-mapped singular value decomposition (SVD) diagram, re-ordered matrix representation, and the temporal view. We demonstrate our approach with case studies of different fraud scenarios and show that rating frauds can be effectively detected.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The rating fraud in online e-commerce stores targets at receiving large revenues through boosting the popularity of selected items with fake ratings. The challenges of detecting rating frauds come from discovering small scale abnormal activities in a large amount of data and detecting frauds in a time-critical manner from online rating streams. This paper presents a real-time visual analytics system that consists of two essential components: a server for automatically handling data streams and a visual analytics interface for performing interactive analysis. Based on the features of rating frauds, we present a detection solution which balances computationally expensive algorithms and interactive analysis between the server and analysts. Specifically, our detection system filters data through performing an initial suspicion level detection on the server, and analysts can combine different statistical analysis of the user / item matrix through a co-mapped singular value decomposition (SVD) diagram, re-ordered matrix representation, and the temporal view. We demonstrate our approach with case studies of different fraud scenarios and show that rating frauds can be effectively detected.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The rating fraud in online e-commerce stores targets at receiving large revenues through boosting the popularity of selected items with fake ratings. The challenges of detecting rating frauds come from discovering small scale abnormal activities in a large amount of data and detecting frauds in a time-critical manner from online rating streams. This paper presents a real-time visual analytics system that consists of two essential components: a server for automatically handling data streams and a visual analytics interface for performing interactive analysis. Based on the features of rating frauds, we present a detection solution which balances computationally expensive algorithms and interactive analysis between the server and analysts. Specifically, our detection system filters data through performing an initial suspicion level detection on the server, and analysts can combine different statistical analysis of the user / item matrix through a co-mapped singular value decomposition (SVD) diagram, re-ordered matrix representation, and the temporal view. We demonstrate our approach with case studies of different fraud scenarios and show that rating frauds can be effectively detected.",
"fno": "07312770",
"keywords": [
"Servers",
"Data Visualization",
"Visual Analytics",
"Real Time Systems",
"Matrix Decomposition",
"Layout",
"Image Color Analysis",
"Streaming Visualization",
"Rating Fraud",
"Fraud Detection",
"Security Visualization"
],
"authors": [
{
"affiliation": "University of North Carolina at Charlotte",
"fullName": "Kodzo Webga",
"givenName": "Kodzo",
"surname": "Webga",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of North Carolina at Charlotte",
"fullName": "Aidong Lu",
"givenName": "Aidong",
"surname": "Lu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vizsec",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-10-01T00:00:00",
"pubType": "proceedings",
"pages": "1-8",
"year": "2015",
"issn": null,
"isbn": "978-1-4673-7599-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07312769",
"articleId": "12OmNwl8GGy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07312771",
"articleId": "12OmNAWH9Ev",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/smartcomp/2016/0898/0/07501694",
"title": "Health Care Fraud Detection with Community Detection Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/smartcomp/2016/07501694/12OmNAXxWZr",
"parentPublication": {
"id": "proceedings/smartcomp/2016/0898/0",
"title": "2016 IEEE International Conference on Smart Computing (SMARTCOMP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2009/3733/0/3733a197",
"title": "A Visualization Approach for Frauds Detection in Financial Market",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2009/3733a197/12OmNvnOwqz",
"parentPublication": {
"id": "proceedings/iv/2009/3733/0",
"title": "2009 13th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccac/2017/1939/0/1939a186",
"title": "Fraud Data Analytics Tools and Techniques in Big Data Era",
"doi": null,
"abstractUrl": "/proceedings-article/iccac/2017/1939a186/12OmNwJybOC",
"parentPublication": {
"id": "proceedings/iccac/2017/1939/0",
"title": "2017 International Conference on Cloud and Autonomic Computing (ICCAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csnt/2011/4437/0/4437a323",
"title": "A Framework for Discovering Internal Financial Fraud Using Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/csnt/2011/4437a323/12OmNzlUKOt",
"parentPublication": {
"id": "proceedings/csnt/2011/4437/0",
"title": "Communication Systems and Network Technologies, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/01/06807765",
"title": "Discovery of Ranking Fraud for Mobile Apps",
"doi": null,
"abstractUrl": "/journal/tk/2015/01/06807765/13rRUwbs21l",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/04/ttg2011040440",
"title": "Forecasting Hotspots—A Predictive Analytics Approach",
"doi": null,
"abstractUrl": "/journal/tg/2011/04/ttg2011040440/13rRUwdrdSv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2021/0969/0/09686920",
"title": "Trajectory-based Modeling for Fraud Detection and Analytics: Foundation and Design",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2021/09686920/1AsbcVv3yOA",
"parentPublication": {
"id": "proceedings/aiccsa/2021/0969/0",
"title": "2021 IEEE/ACS 18th International Conference on Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/06/10081495",
"title": "FraudAuditor: A Visual Analytics Approach for Collusive Fraud in Health Insurance",
"doi": null,
"abstractUrl": "/journal/tg/2023/06/10081495/1LRbQCd2D7O",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a336",
"title": "VaBank: Visual Analytics for Banking Transactions",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a336/1rSRewueIso",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2021/3335/0/333500a136",
"title": "Inspecting the Process of Bank Credit Rating via Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2021/333500a136/1yXuf8Wv06A",
"parentPublication": {
"id": "proceedings/vis/2021/3335/0",
"title": "2021 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNykCcdo",
"title": "2018 IEEE Pacific Visualization Symposium (PacificVis)",
"acronym": "pacificvis",
"groupId": "1001657",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBpVPS1",
"doi": "10.1109/PacificVis.2018.00028",
"title": "Visual Analytics for Networked-Guarantee Loans Risk Management",
"normalizedTitle": "Visual Analytics for Networked-Guarantee Loans Risk Management",
"abstract": "Groups of enterprises can guarantee each other and form complex networks in order to try to obtain loans from banks. Monitoring the financial status of a network, and preventing or reducing systematic risk in case of a crisis, is an area of great concern for the regulatory commission and for the banks. We set the ultimate goal of developing a visual analytic approach and tool for risk dissolving and decision-making. We have consolidated four main analysis tasks conducted by financial experts: i) Multi-faceted Default Risk Visualization, whereby a hybrid representation is devised to predict the default risk and an interface developed to visualize key indicators; ii) Risk Guarantee Patterns Discovery. We follow the Shneiderman mantra guidance for designing interactive visualization applications, whereby an interactive risk guarantee community detection and a motif detection based risk guarantee pattern discovery approach are described; iii) Network Evolution and Retrospective, whereby animation is used to help users to understand the guarantee dynamic; iv) Risk Communication Analysis. The temporal diffusion path analysis can be useful for the government and banks to monitor the spread of the default status. It also provides insight for taking precautionary measures to prevent and dissolve systematic financial risk. We implement the system with case studies using real-world bank loan data. Two financial experts are consulted to endorse the developed tool. To the best of our knowledge, this is the first visual analytics tool developed to explore networked-guarantee loan risks in a systematic manner.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Groups of enterprises can guarantee each other and form complex networks in order to try to obtain loans from banks. Monitoring the financial status of a network, and preventing or reducing systematic risk in case of a crisis, is an area of great concern for the regulatory commission and for the banks. We set the ultimate goal of developing a visual analytic approach and tool for risk dissolving and decision-making. We have consolidated four main analysis tasks conducted by financial experts: i) Multi-faceted Default Risk Visualization, whereby a hybrid representation is devised to predict the default risk and an interface developed to visualize key indicators; ii) Risk Guarantee Patterns Discovery. We follow the Shneiderman mantra guidance for designing interactive visualization applications, whereby an interactive risk guarantee community detection and a motif detection based risk guarantee pattern discovery approach are described; iii) Network Evolution and Retrospective, whereby animation is used to help users to understand the guarantee dynamic; iv) Risk Communication Analysis. The temporal diffusion path analysis can be useful for the government and banks to monitor the spread of the default status. It also provides insight for taking precautionary measures to prevent and dissolve systematic financial risk. We implement the system with case studies using real-world bank loan data. Two financial experts are consulted to endorse the developed tool. To the best of our knowledge, this is the first visual analytics tool developed to explore networked-guarantee loan risks in a systematic manner.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Groups of enterprises can guarantee each other and form complex networks in order to try to obtain loans from banks. Monitoring the financial status of a network, and preventing or reducing systematic risk in case of a crisis, is an area of great concern for the regulatory commission and for the banks. We set the ultimate goal of developing a visual analytic approach and tool for risk dissolving and decision-making. We have consolidated four main analysis tasks conducted by financial experts: i) Multi-faceted Default Risk Visualization, whereby a hybrid representation is devised to predict the default risk and an interface developed to visualize key indicators; ii) Risk Guarantee Patterns Discovery. We follow the Shneiderman mantra guidance for designing interactive visualization applications, whereby an interactive risk guarantee community detection and a motif detection based risk guarantee pattern discovery approach are described; iii) Network Evolution and Retrospective, whereby animation is used to help users to understand the guarantee dynamic; iv) Risk Communication Analysis. The temporal diffusion path analysis can be useful for the government and banks to monitor the spread of the default status. It also provides insight for taking precautionary measures to prevent and dissolve systematic financial risk. We implement the system with case studies using real-world bank loan data. Two financial experts are consulted to endorse the developed tool. To the best of our knowledge, this is the first visual analytics tool developed to explore networked-guarantee loan risks in a systematic manner.",
"fno": "142401a160",
"keywords": [
"Bank Data Processing",
"Data Analysis",
"Data Visualisation",
"Decision Making",
"Risk Management",
"Networked Guarantee Loans Risk Management",
"Financial Status",
"Regulatory Commission",
"Visual Analytic Approach",
"Risk Dissolving",
"Decision Making",
"Financial Experts",
"Default Risk Visualization",
"Shneiderman Mantra Guidance",
"Interactive Visualization Applications",
"Interactive Risk Guarantee Community Detection",
"Guarantee Pattern Discovery Approach",
"Network Evolution",
"Temporal Diffusion Path Analysis",
"Systematic Financial Risk",
"Real World Bank Loan Data",
"Visual Analytics Tool",
"Loan Risks",
"Complex Networks",
"Task Analysis",
"Visual Analytics",
"Tools",
"Data Visualization",
"Monitoring",
"Systematics",
"Risk Management",
"H 5 2 User Interfaces User Interfaces Graphical User Interfaces GUI",
"H 5 M Information Interfaces And Presentation Miscellaneous"
],
"authors": [
{
"affiliation": null,
"fullName": "Zhibin Niu",
"givenName": "Zhibin",
"surname": "Niu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Dawei Cheng",
"givenName": "Dawei",
"surname": "Cheng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Liqing Zhang",
"givenName": "Liqing",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jiawan Zhang",
"givenName": "Jiawan",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "pacificvis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-04-01T00:00:00",
"pubType": "proceedings",
"pages": "160-169",
"year": "2018",
"issn": "2165-8773",
"isbn": "978-1-5386-1424-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "142401a150",
"articleId": "12OmNym2c5B",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "142401a170",
"articleId": "12OmNAlNiGd",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icicta/2010/4077/2/4077c644",
"title": "Measurement of Liquidity Risk in Commercial Banks: Using High-Order ES Based on Peaks over Thresholds Model",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2010/4077c644/12OmNAo45Sy",
"parentPublication": {
"id": "proceedings/icicta/2010/4077/2",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sccompanion/2012/4956/0/4956b312",
"title": "Data Challenges in High-Performance Risk Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/sccompanion/2012/4956b312/12OmNBa2iCG",
"parentPublication": {
"id": "proceedings/sccompanion/2012/4956/0",
"title": "2012 SC Companion: High Performance Computing, Networking Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bife/2012/4750/0/4750a242",
"title": "Farmer's Credit Decision Model based on Risk Guarantee Fund",
"doi": null,
"abstractUrl": "/proceedings-article/bife/2012/4750a242/12OmNwlHSW7",
"parentPublication": {
"id": "proceedings/bife/2012/4750/0",
"title": "2012 Fifth International Conference on Business Intelligence and Financial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eisic/2017/2385/0/2385a107",
"title": "Customs Risk Analysis through the ConTraffic Visual Analytics Tool",
"doi": null,
"abstractUrl": "/proceedings-article/eisic/2017/2385a107/12OmNy50g5n",
"parentPublication": {
"id": "proceedings/eisic/2017/2385/0",
"title": "2017 European Intelligence and Security Informatics Conference (EISIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cso/2009/3605/2/3605c540",
"title": "Mechanism of Credit Guarantee Pricing in Finance Trade",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2009/3605c540/12OmNyrIasT",
"parentPublication": {
"id": "proceedings/cso/2009/3605/2",
"title": "2009 International Joint Conference on Computational Sciences and Optimization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmecg/2012/4853/0/4853a388",
"title": "Risk Assessment on Agricultural Products Logistics Financial Based on FAHP",
"doi": null,
"abstractUrl": "/proceedings-article/icmecg/2012/4853a388/12OmNzdoMtN",
"parentPublication": {
"id": "proceedings/icmecg/2012/4853/0",
"title": "Management of e-Commerce and e-Government, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545474",
"title": "Prediction Defaults for Networked-guarantee Loans",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545474/17D45VVho3p",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/06/09743296",
"title": "Regulating Systemic Crises: Stemming the Contagion Risk in Networked-Loans Through Deep Graph Learning",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09743296/1C1XU51sRO0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2020/8009/0/800900a084",
"title": "iConViz: Interactive Visual Exploration of the Default Contagion Risk of Networked-Guarantee Loans",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2020/800900a084/1q7jvCEjsxG",
"parentPublication": {
"id": "proceedings/vast/2020/8009/0",
"title": "2020 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2021/3335/0/333500a136",
"title": "Inspecting the Process of Bank Credit Rating via Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2021/333500a136/1yXuf8Wv06A",
"parentPublication": {
"id": "proceedings/vis/2021/3335/0",
"title": "2021 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvpNIpw",
"title": "2015 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"acronym": "vast",
"groupId": "1001630",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNCxtyJT",
"doi": "10.1109/VAST.2015.7347678",
"title": "Visual Analytics for fraud detection and monitoring",
"normalizedTitle": "Visual Analytics for fraud detection and monitoring",
"abstract": "One of the primary concerns of financial institutions is to guarantee security and legitimacy in their services. Being able to detect and avoid fraudulent schemes also enhances the credibility of these institutions. Currently, fraud detection approaches still lack Visual Analytics techniques. We propose a Visual Analytics process that tackles the main challenges in the area of fraud detection.",
"abstracts": [
{
"abstractType": "Regular",
"content": "One of the primary concerns of financial institutions is to guarantee security and legitimacy in their services. Being able to detect and avoid fraudulent schemes also enhances the credibility of these institutions. Currently, fraud detection approaches still lack Visual Analytics techniques. We propose a Visual Analytics process that tackles the main challenges in the area of fraud detection.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "One of the primary concerns of financial institutions is to guarantee security and legitimacy in their services. Being able to detect and avoid fraudulent schemes also enhances the credibility of these institutions. Currently, fraud detection approaches still lack Visual Analytics techniques. We propose a Visual Analytics process that tackles the main challenges in the area of fraud detection.",
"fno": "07347678",
"keywords": [
"Business And Finance Visualization",
"Visual Knowledge Discovery",
"Time Series Data"
],
"authors": [
{
"affiliation": "Vienna University of Technology, Austria",
"fullName": "Roger A. Leite",
"givenName": "Roger A.",
"surname": "Leite",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Vienna University of Technology, Austria",
"fullName": "Theresia Gschwandtner",
"givenName": "Theresia",
"surname": "Gschwandtner",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Vienna University of Technology, Austria",
"fullName": "Silvia Miksch",
"givenName": "Silvia",
"surname": "Miksch",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Erste Group IT, USA",
"fullName": "Erich Gstrein",
"givenName": "Erich",
"surname": "Gstrein",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Erste Group IT, USA",
"fullName": "Johannes Kuntner",
"givenName": "Johannes",
"surname": "Kuntner",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vast",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-10-01T00:00:00",
"pubType": "proceedings",
"pages": "201-202",
"year": "2015",
"issn": null,
"isbn": "978-1-4673-9783-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07347677",
"articleId": "12OmNAT0mSh",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07347679",
"articleId": "12OmNyKJiqF",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ares/2006/2567/0/25670904",
"title": "Offline Internet Banking Fraud Detection",
"doi": null,
"abstractUrl": "/proceedings-article/ares/2006/25670904/12OmNrYCXZR",
"parentPublication": {
"id": "proceedings/ares/2006/2567/0",
"title": "First International Conference on Availability, Reliability and Security (ARES'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2016/2846/0/07752336",
"title": "Graph analytics for healthcare fraud risk estimation",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2016/07752336/12OmNz4SOvm",
"parentPublication": {
"id": "proceedings/asonam/2016/2846/0",
"title": "2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2015/7367/0/7367a918",
"title": "Guilt-by-Constellation: Fraud Detection by Suspicious Clique Memberships",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2015/7367a918/12OmNzcPAyy",
"parentPublication": {
"id": "proceedings/hicss/2015/7367/0",
"title": "2015 48th Hawaii International Conference on System Sciences (HICSS)",
"__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": "proceedings/icdm/2018/9159/0/08594881",
"title": "Deep Structure Learning for Fraud Detection",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2018/08594881/17D45WZZ7H2",
"parentPublication": {
"id": "proceedings/icdm/2018/9159/0",
"title": "2018 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dasc-picom-datacom-cyberscitech/2018/7518/0/751800a100",
"title": "Fraud Risk Monitoring System for E-Banking Transactions",
"doi": null,
"abstractUrl": "/proceedings-article/dasc-picom-datacom-cyberscitech/2018/751800a100/17D45Xtvpe6",
"parentPublication": {
"id": "proceedings/dasc-picom-datacom-cyberscitech/2018/7518/0",
"title": "2018 IEEE 16th Intl Conf on Dependable, Autonomic and Secure Computing, 16th Intl Conf on Pervasive Intelligence and Computing, 4th Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2021/1658/0/165800a750",
"title": "Cost-sensitive Heterogeneous Integration for Credit Card Fraud Detection",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2021/165800a750/1BBz8kG8iGI",
"parentPublication": {
"id": "proceedings/trustcom/2021/1658/0",
"title": "2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccsb/2022/3188/0/318800a107",
"title": "A high performance fraud detection strategy prediction model",
"doi": null,
"abstractUrl": "/proceedings-article/ccsb/2022/318800a107/1LHcTe4EE5G",
"parentPublication": {
"id": "proceedings/ccsb/2022/3188/0",
"title": "2022 2nd International Conference on Computer Science and Blockchain (CCSB)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/06/10081495",
"title": "FraudAuditor: A Visual Analytics Approach for Collusive Fraud in Health Insurance",
"doi": null,
"abstractUrl": "/journal/tg/2023/06/10081495/1LRbQCd2D7O",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/springsim/2020/370/0/09185476",
"title": "On the Comparative Study of Prediction Accuracy for Credit Card Fraud Detection wWith Imbalanced Classifications",
"doi": null,
"abstractUrl": "/proceedings-article/springsim/2020/09185476/1mP631QnIty",
"parentPublication": {
"id": "proceedings/springsim/2020/370/0",
"title": "2020 Spring Simulation Conference (SpringSim)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzl3WWi",
"title": "2012 32nd International Conference on Distributed Computing Systems Workshops",
"acronym": "icdcsw",
"groupId": "1000212",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvSbBpn",
"doi": "10.1109/ICDCSW.2012.11",
"title": "Anonymizing Network Traces with Temporal Pseudonym Consistency",
"normalizedTitle": "Anonymizing Network Traces with Temporal Pseudonym Consistency",
"abstract": "The need for network traces has always been a critical element for the success of network, and network security, research. However, the plethora of privacy, legal and policy issues has often prevented access to collected traces. This has created the need for developing anonymization methods and tools to protect the privacy of the released traces while preserving utility in the data. A key dilemma in anonymizing network traces is whether to preserve IP pseudonym consistency, i.e., whether the same IP address is replaced by the same pseudo IP. On one hand, globally-consistent prefix-preserving IP address anonymization is subject to various privacy attacks. On the other hand, many usages of the trace data require some levels of consistency. We solve this dilemma by observing that a better privacy-utility tradeoff can be obtained by maintaining temporal pseudonym consistency. That is, we divide flows into buckets based on temporal closeness, and anonymize the flows within each bucket separately such that pseudonym consistency is maintained within each bucket, but broken across buckets. We present a new anonymization method based on these insights. Furthermore, our experimental results show that our method provides the needed privacy protections with little adverse effects on the utility of the trace.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The need for network traces has always been a critical element for the success of network, and network security, research. However, the plethora of privacy, legal and policy issues has often prevented access to collected traces. This has created the need for developing anonymization methods and tools to protect the privacy of the released traces while preserving utility in the data. A key dilemma in anonymizing network traces is whether to preserve IP pseudonym consistency, i.e., whether the same IP address is replaced by the same pseudo IP. On one hand, globally-consistent prefix-preserving IP address anonymization is subject to various privacy attacks. On the other hand, many usages of the trace data require some levels of consistency. We solve this dilemma by observing that a better privacy-utility tradeoff can be obtained by maintaining temporal pseudonym consistency. That is, we divide flows into buckets based on temporal closeness, and anonymize the flows within each bucket separately such that pseudonym consistency is maintained within each bucket, but broken across buckets. We present a new anonymization method based on these insights. Furthermore, our experimental results show that our method provides the needed privacy protections with little adverse effects on the utility of the trace.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The need for network traces has always been a critical element for the success of network, and network security, research. However, the plethora of privacy, legal and policy issues has often prevented access to collected traces. This has created the need for developing anonymization methods and tools to protect the privacy of the released traces while preserving utility in the data. A key dilemma in anonymizing network traces is whether to preserve IP pseudonym consistency, i.e., whether the same IP address is replaced by the same pseudo IP. On one hand, globally-consistent prefix-preserving IP address anonymization is subject to various privacy attacks. On the other hand, many usages of the trace data require some levels of consistency. We solve this dilemma by observing that a better privacy-utility tradeoff can be obtained by maintaining temporal pseudonym consistency. That is, we divide flows into buckets based on temporal closeness, and anonymize the flows within each bucket separately such that pseudonym consistency is maintained within each bucket, but broken across buckets. We present a new anonymization method based on these insights. Furthermore, our experimental results show that our method provides the needed privacy protections with little adverse effects on the utility of the trace.",
"fno": "4686a622",
"keywords": [
"IP Networks",
"Privacy",
"Internet",
"Security",
"Data Privacy",
"Protocols",
"Network Topology"
],
"authors": [
{
"affiliation": null,
"fullName": "Wahbeh Qardaji",
"givenName": "Wahbeh",
"surname": "Qardaji",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Ninghui Li",
"givenName": "Ninghui",
"surname": "Li",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icdcsw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-06-01T00:00:00",
"pubType": "proceedings",
"pages": "622-633",
"year": "2012",
"issn": "1545-0678",
"isbn": "978-1-4673-1423-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4686a617",
"articleId": "12OmNyr8YwB",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4686a634",
"articleId": "12OmNs0kyGu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/euros&p/2017/5762/0/07961985",
"title": "Privacy-Preserving User-Auditable Pseudonym Systems",
"doi": null,
"abstractUrl": "/proceedings-article/euros&p/2017/07961985/12OmNAnuTAd",
"parentPublication": {
"id": "proceedings/euros&p/2017/5762/0",
"title": "2017 IEEE European Symposium on Security and Privacy (EuroS&P)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ares/2013/5008/0/5008a615",
"title": "Privacy-Preserving Publishing of Pseudonym-Based Trajectory Location Data Set",
"doi": null,
"abstractUrl": "/proceedings-article/ares/2013/5008a615/12OmNClQ0sw",
"parentPublication": {
"id": "proceedings/ares/2013/5008/0",
"title": "2013 International Conference on Availability, Reliability and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percomw/2013/5075/0/06529496",
"title": "Protecting location privacy with k-confusing paths based on dynamic pseudonyms",
"doi": null,
"abstractUrl": "/proceedings-article/percomw/2013/06529496/12OmNxecS1r",
"parentPublication": {
"id": "proceedings/percomw/2013/5075/0",
"title": "2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bwcca/2014/4173/0/4173a253",
"title": "Pseudonym-Based Cryptography and Its Application in Vehicular Ad Hoc Networks",
"doi": null,
"abstractUrl": "/proceedings-article/bwcca/2014/4173a253/12OmNyKJibZ",
"parentPublication": {
"id": "proceedings/bwcca/2014/4173/0",
"title": "2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cicsyn/2009/3743/0/3743a420",
"title": "Pseudonym Based Mechanism for Sustaining Privacy in VANETs",
"doi": null,
"abstractUrl": "/proceedings-article/cicsyn/2009/3743a420/12OmNzBwGFc",
"parentPublication": {
"id": "proceedings/cicsyn/2009/3743/0",
"title": "Computational Intelligence, Communication Systems and Networks, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/inds/2014/5178/0/5178a070",
"title": "S2SI: A Practical Pseudonym Changing Strategy for Location Privacy in VANETs",
"doi": null,
"abstractUrl": "/proceedings-article/inds/2014/5178a070/12OmNzC5SNL",
"parentPublication": {
"id": "proceedings/inds/2014/5178/0",
"title": "2014 International Conference on Advanced Networking Distributed Systems and Applications (INDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-dss-smartcity-dependsys/2021/9457/0/945700a456",
"title": "Distributed pseudonym mechanism based on Consortium Blockchain",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-dss-smartcity-dependsys/2021/945700a456/1DNDiUaocc8",
"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": "proceedings/pst/2022/7398/0/09851963",
"title": "A Feistel Network-based Prefix-Preserving Anonymization Approach, Applied To Network Traces",
"doi": null,
"abstractUrl": "/proceedings-article/pst/2022/09851963/1FWmkH2x05i",
"parentPublication": {
"id": "proceedings/pst/2022/7398/0",
"title": "2022 19th Annual International Conference on Privacy, Security & Trust (PST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2019/06/08884663",
"title": "Synthesizing Privacy Preserving Traces: Enhancing Plausibility With Social Networks",
"doi": null,
"abstractUrl": "/journal/nt/2019/06/08884663/1euQzHEi1Us",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nana/2019/2629/0/262900a070",
"title": "Pseudonym Changing for Vehicles in VANETs: A Game-Theoretic Analysis Based Approach",
"doi": null,
"abstractUrl": "/proceedings-article/nana/2019/262900a070/1i2o7a0sBby",
"parentPublication": {
"id": "proceedings/nana/2019/2629/0",
"title": "2019 International Conference on Networking and Network Applications (NaNA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.