International Journal of Graph Computing最新文献

Algorithms for Workflow Satisfiability Problem with User-independent Constraints 具有用户独立约束的工作流可满足性问题的算法

International Journal of Graph Computing Pub Date : 2020-03-01 DOI: 10.35708/gc1868-126722

G. Gutin

引用次数: 0

A Framework for Exploration and Visualization of SPARQL Endpoint Information SPARQL端点信息的探索和可视化框架

International Journal of Graph Computing Pub Date : 2020-03-01 DOI: 10.35708/gc1868-126723

Maria Krommyda

{"title":"A Framework for Exploration and Visualization of SPARQL Endpoint Information","authors":"Maria Krommyda","doi":"10.35708/gc1868-126723","DOIUrl":"https://doi.org/10.35708/gc1868-126723","url":null,"abstract":"Widely accepted standards, such as the Resource Description Framework, have provided unified ways for data provision aiming to facilitate the exchange of information between machines. \u0000This information became of interest to a wider audience due to its volume and variety but the available formats are posing significant challenges to users with limited knowledge of the Semantic Web. \u0000The SPARQL query language alleviates this barrier by facilitating the exploration of this information and many data providers have created dedicated SPARQL endpoints for their data.\u0000Many efforts have been dedicated to the development of systems that will provide access and support the exploration of these endpoints in a semantically correct and user friendly way.\u0000The main challenge of such approaches is the diversity of the information contained in the endpoints, which renders holistic or schema specific solutions obsolete. \u0000We present here an integrated platform that supports the users to the querying, exploration and visualization of information contained in SPARQL endpoints. \u0000The platform handles each query result independently based only on its characteristics, offering an endpoint and data schema agnostic solution. \u0000This is achieved through a Decision Support System, developed based on a knowledge base containing information experimentally collected from many endpoints, that allows us to provide case-specific visualization strategies for SPARQL query results based exclusively on features extracted from the result.","PeriodicalId":121183,"journal":{"name":"International Journal of Graph Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115155642","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Dynamic Diverse Summarisation in Heterogeneous Graph Streams: a Comparison between Thesaurus/Ontology-based and Embeddings-based Approaches 异构图流中的动态多样化摘要：基于词库/本体和基于嵌入的方法之间的比较

International Journal of Graph Computing Pub Date : 2020-03-01 DOI: 10.35708/gc1868-126724

Niki Pavlopoulou

{"title":"Dynamic Diverse Summarisation in Heterogeneous Graph Streams: a Comparison between Thesaurus/Ontology-based and Embeddings-based Approaches","authors":"Niki Pavlopoulou","doi":"10.35708/gc1868-126724","DOIUrl":"https://doi.org/10.35708/gc1868-126724","url":null,"abstract":"Nowadays, there is a lot of attention drawn in smart environments, like Smart Cities and Internet of Things. These environments generate data streams that could be represented as graphs, which can be analysed in real-time to satisfy user or application needs. The challenges involved in these environments, ranging from the dynamism, heterogeneity, continuity, and high-volume of these real-world graph streams\u0000create new requirements for graph processing algorithms. We propose\u0000a dynamic graph stream summarisation system with the use of embeddings that provides expressive graphs while ensuring high usability and limited resource usage. In this paper, we examine the performance comparison between our embeddings-based approach and an existing thesaurus/ontology-based approach (FACES) that we adapted in a dynamic environment with the use of windows and data fusion. Both\u0000approaches use conceptual clustering and top-k scoring that can result\u0000in expressive, dynamic graph summaries with limited resources. Evaluations show that sending top-k fused diverse summaries, results in 34%\u0000to 92% reduction of forwarded messages and redundancy-awareness with\u0000an F-score ranging from 0.80 to 0.95 depending on the k compared to\u0000sending all the available information without top-k scoring. Also, the\u0000summaries' quality follows the agreement of ideal summaries determined\u0000by human judges. The summarisation approaches come with the expense\u0000of reduced system performance. The thesaurus/ontology-based approach\u0000proved 6 times more latency-heavy and 3 times more memory-heavy compared to the most expensive embeddings-based approach while having\u0000lower throughput but provided slightly better quality summaries.","PeriodicalId":121183,"journal":{"name":"International Journal of Graph Computing","volume":"318 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141228274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

The Leaf Function of Graphs Associated with Penrose Tilings 与Penrose平铺相关的图的叶函数

International Journal of Graph Computing Pub Date : 2020-03-01 DOI: 10.35708/gc1868-126721

Carole Porrier

引用次数: 0