Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
5.8
3.1
Journals
Information
Special Issues
Feature Papers in Information in 2024–2025
share announcement

Feature Papers in Information in 2024–2025

A special issue of Information (ISSN 2078-2489). This special issue belongs to the section "Information Systems".

Deadline for manuscript submissions: 1 December 2024 | Viewed by 481

Special Issue Editor

Prof. Dr. Willy Susilo

E-Mail Website
Guest Editor
School of Computer Science and Software Engineering, University of Wollongong, Northfields Avenue, Wollongong, NSW 2522, Australia
Interests: cryptography; computer security; design of signature schemes
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

As Editor-in-Chief of Information, we are pleased to announce the Special Issue entitled "Feature Papers in Information in 2023–2024". This Special Issue will collect high-quality papers from Editorial Board Members and leading researchers invited by the Editorial Office. Both original research articles and comprehensive review papers are welcome. All topics related to information technologies in various fields and applications are welcome.

Prof. Dr. Willy Susilo
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Information is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • information theory and methodology
  • information intelligence
  • information processes
  • information applications
  • information and communications technology

Related Special Issue

Published Papers (1 paper)

Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

16 pages, 2490 KiB  
Article
Constructing Semantic Summaries Using Embeddings
by Georgia Eirini Trouli, Nikos Papadakis and Haridimos Kondylakis
Information 2024, 15(4), 238; https://doi.org/10.3390/info15040238 - 20 Apr 2024
Viewed by 361
Abstract
The increase in the size and complexity of large knowledge graphs now available online has resulted in the emergence of many approaches focusing on enabling the quick exploration of the content of those data sources. Structural non-quotient semantic summaries have been proposed in [...] Read more.
The increase in the size and complexity of large knowledge graphs now available online has resulted in the emergence of many approaches focusing on enabling the quick exploration of the content of those data sources. Structural non-quotient semantic summaries have been proposed in this direction that involve first selecting the most important nodes and then linking them, trying to extract the most useful subgraph out of the original graph. However, the current state of the art systems use costly centrality measures for identifying the most important nodes, whereas even costlier procedures have been devised for linking the selected nodes. In this paper, we address both those deficiencies by first exploiting embeddings for node selection, and then by meticulously selecting approximate algorithms for node linking. Experiments performed over two real-world big KGs demonstrate that the summaries constructed using our method enjoy better quality. Specifically, the coverage scores obtained were 0.8, 0.81, and 0.81 for DBpedia v3.9 and 0.94 for Wikidata dump 2018, across 20%, 25%, and 30% summary sizes, respectively. Additionally, our method can compute orders of magnitude faster than the state of the art. Full article
(This article belongs to the Special Issue Feature Papers in Information in 2024–2025)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-1
Back to TopTop