复杂共现网络的超图建模与可视化

Q2 Mathematics

Electronic Notes in Discrete Mathematics Pub Date : 2018-12-01 DOI:10.1016/j.endm.2018.11.011

X. Ouvrard , J.M. Le Goff , S. Marchand-Maillet

{"title":"复杂共现网络的超图建模与可视化","authors":"X. Ouvrard , J.M. Le Goff , S. Marchand-Maillet","doi":"10.1016/j.endm.2018.11.011","DOIUrl":null,"url":null,"abstract":"<div><p>Finding inherent or processed links within a dataset allows to discover potential knowledge. The main contribution of this article is to define a global framework that enables optimal knowledge discovery by visually rendering co-occurences (i.e. groups of linked data instances attached to a metadata reference) – either inherently present or processed – from a dataset as facets. Hypergraphs are well suited for modeling co-occurences since they support multi-adicity whereas graphs only support pairwise relationships. This article introduces an efficient navigation between different facets of an information space based on hypergraph modelisation and visualisation.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.11.011","citationCount":"5","resultStr":"{\"title\":\"Hypergraph Modeling and Visualisation of Complex Co-occurence Networks\",\"authors\":\"X. Ouvrard , J.M. Le Goff , S. Marchand-Maillet\",\"doi\":\"10.1016/j.endm.2018.11.011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Finding inherent or processed links within a dataset allows to discover potential knowledge. The main contribution of this article is to define a global framework that enables optimal knowledge discovery by visually rendering co-occurences (i.e. groups of linked data instances attached to a metadata reference) – either inherently present or processed – from a dataset as facets. Hypergraphs are well suited for modeling co-occurences since they support multi-adicity whereas graphs only support pairwise relationships. This article introduces an efficient navigation between different facets of an information space based on hypergraph modelisation and visualisation.</p></div>\",\"PeriodicalId\":35408,\"journal\":{\"name\":\"Electronic Notes in Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.endm.2018.11.011\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571065318302063\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318302063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 5

摘要

在数据集中查找固有的或经过处理的链接可以发现潜在的知识。本文的主要贡献是定义了一个全局框架，通过可视化地呈现来自数据集的共现(即附加到元数据引用的链接数据实例组)——无论是固有的还是经过处理的——来实现最佳的知识发现。超图非常适合于共现建模，因为它们支持多重性，而图只支持成对关系。本文介绍了基于超图建模和可视化的信息空间的不同方面之间的有效导航。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Hypergraph Modeling and Visualisation of Complex Co-occurence Networks

Finding inherent or processed links within a dataset allows to discover potential knowledge. The main contribution of this article is to define a global framework that enables optimal knowledge discovery by visually rendering co-occurences (i.e. groups of linked data instances attached to a metadata reference) – either inherently present or processed – from a dataset as facets. Hypergraphs are well suited for modeling co-occurences since they support multi-adicity whereas graphs only support pairwise relationships. This article introduces an efficient navigation between different facets of an information space based on hypergraph modelisation and visualisation.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.30

自引率

0.00%

发文量

期刊介绍： Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.