Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Interest
Topics
Details

Details

  • Name

    Fernando Silva
  • Cluster

    Computer Science
  • Role

    Research Coordinator
  • Since

    01st January 2009
009
Publications

2020

FOCAS: Penalising friendly citations to improve author ranking

Authors
Silva, J; Aparicio, D; Ribeiro, P; Silva, F;

Publication
Proceedings of the ACM Symposium on Applied Computing

Abstract
Scientific impact is commonly associated with the number of citations received. However, an author can easily boost his own citation count by (i) publishing articles that cite his own previous work (self-citations), (ii) having co-authors citing his work (co-author citations), or (iii) exchanging citations with authors from other research groups (reciprocated citations). Even though these friendly citations inflate an author's perceived scientific impact, author ranking algorithms do not normally address them. They, at most, remove self-citations. Here we present Friends-Only Citations AnalySer (FOCAS), a method that identifies friendly citations and reduces their negative effect in author ranking algorithms. FOCAS combines the author citation network with the co-authorship network in order to measure author proximity and penalises citations between friendly authors. FOCAS is general and can be regarded as an independent module applied while running (any) PageRank-like author ranking algorithm. FOCAS can be tuned to use three different criteria, namely authors' distance, citation frequency, and citation recency, or combinations of these. We evaluate and compare FOCAS against eight state-of-the-art author ranking algorithms. We compare their rankings with a ground-truth of best paper awards. We test our hypothesis on a citation and co-authorship network comprised of seven Information Retrieval top-conferences. We observed that FOCAS improved author rankings by 25% on average and, in one case, leads to a gain of 46%. © 2020 ACM.

2020

Jay: Adaptive Computation Offloading for Hybrid Cloud Environments

Authors
Silva, JMA; Marques, ERB; Lopes, LMB; Silva, FMA;

Publication
2020 Fifth International Conference on Fog and Mobile Edge Computing (FMEC)

Abstract

2019

Temporal network alignment via GoT-WAVE

Authors
Aparicio, D; Ribeiro, P; Milenkovic, T; Silva, F;

Publication
Bioinformatics

Abstract

2019

Iris: Secure reliable live-streaming with opportunistic mobile edge cloud offloading

Authors
Martins, R; Correia, ME; Antunes, L; Silva, F;

Publication
Future Generation Computer Systems

Abstract
The ever-increasing demand for higher quality live streams is driving the need for better networking infrastructures, specially when disseminating content over highly congested areas, such as stadiums, concerts and museums. Traditional approaches to handle this type of scenario relies on a combination of cellular data, through 4G distributed antenna arrays (DAS), with a high count of WiFi (802.11) access points. This obvious requires a substantial upfront cost for equipment, planning and deployment. Recently, new efforts have been introduced to securely leverage the capabilities of wireless multipath, including WiFi multicast, 4G, and device-to-device communications. In order to solve these issues, we propose an approach that lessens the requirements imposed on the wireless infrastructures while potentially expanding wireless coverage through the crowd-sourcing of mobile devices. In order to achieve this, we propose a novel pervasive approach that combines secure distributed systems, WiFi multicast, erasure coding, source coding and opportunistic offloading that makes use of hyperlocal mobile edge clouds. We empirically show that our solution is able to offer a 11 fold reduction on the infrastructural WiFi bandwidth usage without having to modify any existing software or firmware stacks while ensuring stream integrity, authorization and authentication. © 2019 Elsevier B.V.

2019

Feature-enriched author ranking in incomplete networks

Authors
Silva, J; Aparício, D; Silva, F;

Publication
Applied Network Science

Abstract
Evaluating scientists based on their scientific production is a controversial topic. Nevertheless, bibliometrics and algorithmic approaches can assist traditional peer review in numerous tasks, such as attributing research grants, deciding scientific committees, or choosing faculty promotions. Traditional bibliometrics rank individual entities (e.g., researchers, journals, faculties) without looking at the whole data (i.e., the whole network). Network algorithms, such as PageRank, have been used to measure node importance in a network, and have been applied to author ranking. However, traditional PageRank only uses network topology and ignores relevant features of scientific collaborations. Multiple extensions of PageRank have been proposed, more suited for author ranking. These methods enrich the network with information about the author’s productivity or the venue and year of the publication/citation. Most state-of-the-art (STOA) feature-enriched methods either ignore or do not combine effectively this information. Furthermore, STOA algorithms typically disregard that the full network is not known for most real-world cases.Here we describe OTARIOS, an author ranking method recently developed by us, which combines multiple publication/citation criteria (i.e., features) to evaluate authors. OTARIOS divides the original network into two subnetworks, insiders and outsiders, which is an adequate representation of citation networks with missing information. We evaluate OTARIOS on a set of five real networks, each with publications in distinct areas of Computer Science, and compare it against STOA methods. When matching OTARIOS’ produced ranking with a ground-truth ranking (comprised of best paper award nominations), we observe that OTARIOS is >30% more accurate than traditional PageRank (i.e., topology based method) and >20% more accurate than STOA (i.e., competing feature enriched methods). We obtain the best results when OTARIOS considers (i) the author’s publication volume and publication recency, (ii) how recently the author’s work is being cited by outsiders, and (iii) how recently the author’s work is being cited by insiders and how individual he is. Our results showcase (a) the importance of efficiently combining relevant features and (b) how to adequately perform author ranking in incomplete networks. © 2019, The Author(s).

Supervised
thesis

2019

Scheduling Computations Over High Churn Networks of Mobile Devices

Author
Joaquim Magalhães Esteves da Silva

Institution
UP-FCUP

2019

Network Comparison and Node Ranking in Complex Networks

Author
David Oliveira Aparício

Institution
UP-FCUP

2019

Network Analysis for Research Interests Discovery

Author
Jorge Miguel Barros da Silva

Institution
UP-FCUP

2018

A Middleware for Mobile Edge-Cloud Applications

Author
João Filipe Rodrigues

Institution
UP-FCUP

2018

Temporal Research Interests Discovery Using Co-Occurrence Keywords Networks

Author
Pedro Cardoso Belém

Institution
UP-FCUP