Cookies
O website necessita de alguns cookies e outros recursos semelhantes para funcionar. Caso o permita, o INESC TEC irá utilizar cookies para recolher dados sobre as suas visitas, contribuindo, assim, para estatísticas agregadas que permitem melhorar o nosso serviço. Ver mais
Aceitar Rejeitar
  • Menu
Publicações

Publicações por HumanISE

2023

Semi-supervised and ensemble learning to predict work-related stress

Autores
Rodrigues, F; Correia, H;

Publicação
JOURNAL OF INTELLIGENT INFORMATION SYSTEMS

Abstract
Stress is a common feeling in people's day-to-day life, especially at work, being the cause of several health problems and absenteeism. Despite the difficulty in identifying it properly, several studies have established a correlation between stress and perceivable human features. The problem of detecting stress has attracted significant attention in the last decade. It has been mainly addressed through the analysis of physiological signals in the execution of specific tasks in controlled environments. Taking advantage of technological advances that allow to collect stress-related data in a non-invasive way, the goal of this work is to provide an alternative approach to detect stress in the workplace without requiring specific controlled conditions. To this end, a video-based plethysmography application that analyses the person's face and retrieves several physiological signals in a non-invasive way was used. Moreover, in an initial phase, additional information that complements and labels the physiological data was obtained through a brief questionnaire answered by the participants. The data collection pilot took place over a period of two months, having involved 28 volunteers. Several stress detection models were developed; the best trained model achieved an accuracy of 86.8% and a F1 score of 87% on a binary stress/non-stress prediction.

2023

Vol. 3 (2023): Artigos dos alunos da edição 2023 do Mestrado em Negócio Eletrónico e alunos Erasmus

Autores
Azevedo, A; Sousa Pinto, A; Curado Malta, M;

Publicação

Abstract
A terceira edição dos Cadernos de Investigação do Mestrado em Negócio Eletrónico (MNE) testemunha o contínuo amadurecimento deste ciclo de estudos como polo de reflexão académica e científica. Este volume reúne 21 artigos de jovens investigadores que, sob orientação de docentes-investigadores, exploram os fenómenos mais relevantes que moldam o atual panorama do negócio eletrónico.

2023

Dia do Investigador CEOS.PP | DICEOS23 - Livro de Resumos

Autores
Lopes, C; Braga, I; Vieira, I; Malta, M; Carvalho, P;

Publicação

Abstract
O Centro de Estudos Organizacionais e Sociais do Politécnico do Porto (CEOS.PP) juntou-se à iniciativa anual da Comissão Europeia - "Noite Europeia dos Investigadores" – lançada em 2005 - com o Dia do Investigador CEOS [DICEOS23]. O objetivo deste evento, que decorreu no dia 29 de setembro de 2023, foi o de divulgar o trabalho desenvolvido pelos investigadores do CEOS.PP, um momento que contou com um conjunto de atividades para criar sinergias entre os investigadores deste centro de investigação e abrir caminhos para o futuro.

2023

P-TACOS: A Parallel Tabu Search Algorithm for Coalition Structure Generation

Autores
Sarkar, S; Malta, MC; Biswas, TK; Buchala, DK; Dutta, A;

Publicação
2023 IEEE INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY, WI-IAT

Abstract
The optimal Coalition Structure Generation (CSG) problem for a given set of agents finds a partition of the agent set that maximises social welfare. The CSG problem is an NP-hard optimisation problem, where the search space grows exponentially. The exact and approximation algorithms focus on finding an optimal solution or a solution within a known bound from the optimum. However, as the number of agents increases linearly, the search space increases exponentially and a practical option here is to use heuristic algorithms. Heuristic algorithms are suitable for solving the optimisation problems because of their less computational complexity. TACOS is a heuristic method for the CSG problem that finds high-quality solutions quickly using a neighbourhood search performed with a memory. However, some of the neighbourhood searches by TACOS can be performed simultaneously. Therefore, this paper proposes a parallel version of the TACOS algorithm (P-TACOS) for the CSG problem, intending to find a better solution than TACOS. We evaluated P-TACOS using eight (8) benchmark data distributions. Results show that P-TACOS achieves better results for all eight (8) data distributions. P-TACOS achieves the highest gain, 74.23%, for the Chisquare distribution and the lowest gain, 0.01%, for the Normal distribution. We also examine how often P-TACOS generates better results than TACOS. In the best case, it generates better results for 92.30% of the time (for the Rayleigh and Agent-based Normal distributions), and in the worst case, 38.46% of the time (for the Weibull distribution).

2023

STC plus K: a Semi-global triangular and degree centrality method to identify influential spreaders in complex networks

Autores
Sadhu, S; Namtirtha, A; Malta, MC; Dutta, A;

Publicação
2023 IEEE INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY, WI-IAT

Abstract
Influential spreaders contribute substantially to managing and optimizing any spreading process in a network. Influential spreaders are nodes that hold importance within the network. Identifying them is a challenging task. Some encysting methods for such identification include local-structure-based, global-structure-based, semi-global-structure-based, and hybrid-structure-based methods. Semi-global structure-based methods show significant potential in identifying influential nodes in different network structures. However, existing semi-global structure-based methods often identify nodes from the network's periphery, where nodes are loosely connected, and their collective influence in spreading processes is minimal. This paper presents a novel method called Semi-global triangular and degree centrality (STC + K) to overcome this limitation by considering a node's degree, the number of triangles, and the third hop of neighbourhood connectivity information. The proposed novel method outperforms the existing noteworthy indexing methods regarding ranking performance. The experimental results show better performance, as indicated by two performance metrics: recognition rate and improvement percentage. By virtue of the fact that the empirically set free parameters are absent, our method eliminates the need for time-consuming preprocessing to select optimal parameter values for ranking nodes in large networks.

2023

Cooperatives and the Use of Artificial Intelligence: A Critical View

Autores
Ramos, ME; Azevedo, A; Meira, D; Malta, MC;

Publicação
SUSTAINABILITY

Abstract
Digital Transformation (DT) has become an important issue for organisations. It is proven that DT fuels Digital Innovation in organisations. It is well-known that technologies and practices such as distributed ledger technologies, open source, analytics, big data, and artificial intelligence (AI) enhance DT. Among those technologies, AI provides tools to support decision-making and automatically decide. Cooperatives are organisations with a mutualistic scope and are characterised by having participatory cooperative governance due to the principle of democratic control by the members. In a context where DT is here to stay, where the dematerialisation of processes can bring significant advantages to any organisation, this article presents a critical reflection on the dangers of using AI technologies in cooperatives. We base this reflection on the Portuguese cooperative code. We emphasise that this code is not very different from the ones of other countries worldwide as they are all based on the Statement of Cooperative Identity defined by the International Cooperative Alliance. We understand that we cannot stop the entry of AI technologies into the cooperatives. Therefore, we present a framework for using AI technologies in cooperatives to avoid damaging the principles and values of this type of organisations.

  • 139
  • 700