László Hajdu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
László Hajdu has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Miklós Krész
University of Szeged
7 shared publications - András Bóta
Embedded Intelligent Systems Lab, Department of Computer Science, Electrical and Space Engineering, Luleå University of Technology, 97187, Luleå, Sweden.
4 shared publications - Alireza Khani
Department of Civil, Environmental, and Geo- Engineering, University of Minnesota, Minneapolis, MN
2 shared publications - Aleksandar Tošić
University of Primorska
1 shared publication - Anders Q. Nyrud
Norwegian University of Life Sciences, Faculty of Environmental Sciences and Natural Resource Management, Høgskoleveien 12, 1433, Ås, Norway
1 shared publication - Andrej Brodnik
Faculty of Computer and Information Science, University of Ljubljana, 1000 Ljubljana, Slovenia
1 shared publication
Latest Publications
- 30 October 2024
- Published by University of Maribor
- p. 61-64
A Data-Driven Approach for the Analysis of Ridership Fluctuations in Transit Systems
This study focuses on identifying critical components within urban public transportation networks, particularly in the context of fluc-tuating demand and potential pandemic scenarios. By employing advanced agent-based simulations, we analyzed passenger interac-tions and ridership patterns across the San Francisco Bay Area’s transit system. Key findings reveal specific transit stops and routes that are highly sensitive to changes in demand, often serving as bottlenecks or high-risk areas for the spread of infectious diseases.
- 30 October 2024
- Published by University of Maribor
- p. 61-64
A Data-Driven Approach for the Analysis of Ridership Fluctuations in Transit Systems
This study focuses on identifying critical components within urban public transportation networks, particularly in the context of fluc-tuating demand and potential pandemic scenarios. By employing advanced agent-based simulations, we analyzed passenger interac-tions and ridership patterns across the San Francisco Bay Area’s transit system. Key findings reveal specific transit stops and routes that are highly sensitive to changes in demand, often serving as bottlenecks or high-risk areas for the spread of infectious diseases.
- 9 May 2022
- Published by University of Szeged
Network based data oriented methods for application driven problems
Networks are amazing. If you think about it, some of them can be found in almost every single aspect of our life from sociological, financial and biological processes to the human body. Even considering entities that are not necessarily connected to each other in a natural sense, can be connected based on real life properties, creating a whole new aspect to express knowledge. A network as a structure implies not only interesting and complex mathematical questions, but the possibility to extract hidden and additional information from real life data. The data that is one of the most valuable resources of this century. The different activities of the society and the underlying processes produces a huge amount of data, which can be available for us due to the technological knowledge and tools we have nowadays. Nevertheless, the data without the contained knowledge does not represent value, thus the main focus in the last decade is to generate or extract information and knowledge from the data. Consequently, data analytics and science, as well as data-driven methodologies have become leading research fields both in scientific and industrial areas. In this dissertation, the author introduces efficient algorithms to solve application oriented optimization and data analysis tasks built on network science based models. The main idea is to connect these problems along graph based approaches, from virus modelling on an existing system through understanding the spreading mechanism of an infection/influence and maximize or minimize the effect, to financial applications, such as fraud detection or cost optimization in a case of employee rostering.
- 9 May 2022
- Published by University of Szeged
Network based data oriented methods for application driven problems
Networks are amazing. If you think about it, some of them can be found in almost every single aspect of our life from sociological, financial and biological processes to the human body. Even considering entities that are not necessarily connected to each other in a natural sense, can be connected based on real life properties, creating a whole new aspect to express knowledge. A network as a structure implies not only interesting and complex mathematical questions, but the possibility to extract hidden and additional information from real life data. The data that is one of the most valuable resources of this century. The different activities of the society and the underlying processes produces a huge amount of data, which can be available for us due to the technological knowledge and tools we have nowadays. Nevertheless, the data without the contained knowledge does not represent value, thus the main focus in the last decade is to generate or extract information and knowledge from the data. Consequently, data analytics and science, as well as data-driven methodologies have become leading research fields both in scientific and industrial areas. In this dissertation, the author introduces efficient algorithms to solve application oriented optimization and data analysis tasks built on network science based models. The main idea is to connect these problems along graph based approaches, from virus modelling on an existing system through understanding the spreading mechanism of an infection/influence and maximize or minimize the effect, to financial applications, such as fraud detection or cost optimization in a case of employee rostering.
- Open Access
- 18 February 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (4) , 2147
Privacy-Aware and Secure Decentralized Air Quality Monitoring
Indoor Air Quality monitoring is a major asset to improving quality of life and building management. Today, the evolution of embedded technologies allows the implementation of such monitoring on the edge of the network. However, several concerns need to be addressed related to data security and privacy, routing and sink placement optimization, protection from external monitoring, and distributed data mining. In this paper, we describe an integrated framework that features distributed storage, blockchain-based Role-based Access Control, onion routing, routing and sink placement optimization, and distributed data mining to answer these concerns. We describe the organization of our contribution and show its relevance with simulations and experiments over a set of use cases.
- 18 February 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (4) , 2147
Open AccessPrivacy-Aware and Secure Decentralized Air Quality Monitoring
Indoor Air Quality monitoring is a major asset to improving quality of life and building management. Today, the evolution of embedded technologies allows the implementation of such monitoring on the edge of the network. However, several concerns need to be addressed related to data security and privacy, routing and sink placement optimization, protection from external monitoring, and distributed data mining. In this paper, we describe an integrated framework that features distributed storage, blockchain-based Role-based Access Control, onion routing, routing and sink placement optimization, and distributed data mining to answer these concerns. We describe the organization of our contribution and show its relevance with simulations and experiments over a set of use cases.
- Open Access
- 3 October 2021
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 11 (1) , 1-11
Evaluating the role of community detection in improving influence maximization heuristics
Both community detection and influence maximization are well-researched fields of network science. Here, we investigate how several popular community detection algorithms can be used as part of a heuristic approach to influence maximization. The heuristic is based on the community value, a node-based metric defined on the outputs of overlapping community detection algorithms. This metric is used to select nodes as high influence candidates for expanding the set of influential nodes. Our aim in this paper is twofold. First, we evaluate the performance of eight frequently used overlapping community detection algorithms on this specific task to show how much improvement can be gained compared to the originally proposed method of Kempe et al. Second, selecting the community detection algorithm(s) with the best performance, we propose a variant of the influence maximization heuristic with significantly reduced runtime, at the cost of slightly reduced quality of the output. We use both artificial benchmarks and real-life networks to evaluate the performance of our approach.
- 3 October 2021
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 11 (1) , 1-11
Open AccessEvaluating the role of community detection in improving influence maximization heuristics
Both community detection and influence maximization are well-researched fields of network science. Here, we investigate how several popular community detection algorithms can be used as part of a heuristic approach to influence maximization. The heuristic is based on the community value, a node-based metric defined on the outputs of overlapping community detection algorithms. This metric is used to select nodes as high influence candidates for expanding the set of influential nodes. Our aim in this paper is twofold. First, we evaluate the performance of eight frequently used overlapping community detection algorithms on this specific task to show how much improvement can be gained compared to the originally proposed method of Kempe et al. Second, selecting the community detection algorithm(s) with the best performance, we propose a variant of the influence maximization heuristic with significantly reduced runtime, at the cost of slightly reduced quality of the output. We use both artificial benchmarks and real-life networks to evaluate the performance of our approach.
- Open Access
- 1 October 2020
- Published by Walter de Gruyter GmbH in Business Systems Research Journal
- Vol. 11 (2) , 86-98
Improving Mental Wellbeing in Organizations with Targeted Psychosocial Interventions
Background: Mental wellbeing of employees is crucial for successful organizations. Psychosocial interventions that target highly contagious individuals (i.e., individuals that can ‘transmit’ their wellbeing to others) could efficiently improve overall wellbeing in the workplace. Objectives: Using the magnitudes of effects observed in existing studies on psychosocial interventions and the contagion of mental wellbeing, we aimed to examine how the wellbeing of a group (based on WHO-5 Well-Being Index scores) changes if interventions are provided to highly contagious people instead of randomly selected individuals. Methods/Approach: Based on the data on mental wellbeing of 414 nursing home employees, we created a social network that includes individual levels of wellbeing and the strength of the connection between people. Simulation-based influence-maximization was used on the network and interventions were interventions were provided to either contagious or randomly selected individuals. Results: Overall, mental wellbeing of the group increased slightly more when individuals had received a simulated psychosocial intervention in order of contagiousness compared to the cases in which interventions were provided to randomly selected individuals. Conclusions: Selectively targeting highly contagious individuals could be an efficient approach to improving wellbeing in organizations, especially in social contexts, where the contagion of mental wellbeing is likelier.
- 1 October 2020
- Published by Walter de Gruyter GmbH in Business Systems Research Journal
- Vol. 11 (2) , 86-98
Open AccessImproving Mental Wellbeing in Organizations with Targeted Psychosocial Interventions
Background: Mental wellbeing of employees is crucial for successful organizations. Psychosocial interventions that target highly contagious individuals (i.e., individuals that can ‘transmit’ their wellbeing to others) could efficiently improve overall wellbeing in the workplace. Objectives: Using the magnitudes of effects observed in existing studies on psychosocial interventions and the contagion of mental wellbeing, we aimed to examine how the wellbeing of a group (based on WHO-5 Well-Being Index scores) changes if interventions are provided to highly contagious people instead of randomly selected individuals. Methods/Approach: Based on the data on mental wellbeing of 414 nursing home employees, we created a social network that includes individual levels of wellbeing and the strength of the connection between people. Simulation-based influence-maximization was used on the network and interventions were interventions were provided to either contagious or randomly selected individuals. Results: Overall, mental wellbeing of the group increased slightly more when individuals had received a simulated psychosocial intervention in order of contagiousness compared to the cases in which interventions were provided to randomly selected individuals. Conclusions: Selectively targeting highly contagious individuals could be an efficient approach to improving wellbeing in organizations, especially in social contexts, where the contagion of mental wellbeing is likelier.
- 19 August 2020
- Published by University of Szeged in Acta Cybernetica
- Vol. 24 (4) , 643-661
Graph Coloring based Heuristic for Crew Rostering
In the last years personnel cost became a huge factor in the financial management of many companies and institutions.The firms are obligated to employ their workers in accordance with the law prescribing labour rules. The companies can save costs with minimizing the differences between the real and the expected worktimes. Crew rostering is assigning the workers to the previously determined shifts, which has been widely studied in the literature. In this paper, a mathematical model of the problem is presented and a two-phase graph coloring method for the crew rostering problem is introduced. Our method has been tested on artificially generated and real life input data. The results of the new algorithm have been compared to the solutions of the integer programming model for moderate-sized problems instances.
- 19 August 2020
- Published by University of Szeged in Acta Cybernetica
- Vol. 24 (4) , 643-661
Graph Coloring based Heuristic for Crew Rostering
In the last years personnel cost became a huge factor in the financial management of many companies and institutions.The firms are obligated to employ their workers in accordance with the law prescribing labour rules. The companies can save costs with minimizing the differences between the real and the expected worktimes. Crew rostering is assigning the workers to the previously determined shifts, which has been widely studied in the literature. In this paper, a mathematical model of the problem is presented and a two-phase graph coloring method for the crew rostering problem is introduced. Our method has been tested on artificially generated and real life input data. The results of the new algorithm have been compared to the solutions of the integer programming model for moderate-sized problems instances.
- 18 August 2020
- Published by Springer Nature
- p. 145-157
Temporal Network Analytics for Fraud Detection in the Banking Sector
- 18 August 2020
- Published by Springer Nature
- p. 145-157
Temporal Network Analytics for Fraud Detection in the Banking Sector
- Open Access
- 20 August 2019
- Published by Springer Nature in Networks and Spatial Economics
- Vol. 20 (1) , 209-231
Discovering the Hidden Community Structure of Public Transportation Networks
- 20 August 2019
- Published by Springer Nature in Networks and Spatial Economics
- Vol. 20 (1) , 209-231
Open AccessDiscovering the Hidden Community Structure of Public Transportation Networks
- Open Access
Discovering the hidden community structure of public transportation networks
Advances in public transit modeling and smart card technologies can reveal detailed contact patterns of passengers. A natural way to represent such contact patterns is in the form of networks. In this paper we utilize known contact patterns from a public transit assignment model in a major metropolitan city, and propose the development of two novel network structures, each of which elucidate certain aspects of passenger travel behavior. We first propose the development of a transfer network, which can reveal passenger groups that travel together on a given day. Second, we propose the development of a community network, which is derived from the transfer network, and captures the similarity of travel patterns among passengers. We then explore the application of each of these network structures to identify the most frequently used travel paths, i.e., routes and transfers, in the public transit system, and model epidemic spreading risk among passengers of a public transit network, respectively. In the latter our conclusions reinforce previous observations, that routes crossing or connecting to the city center in the morning and afternoon peak hours are the most "dangerous" during an outbreak.
Open AccessDiscovering the hidden community structure of public transportation networks
Advances in public transit modeling and smart card technologies can reveal detailed contact patterns of passengers. A natural way to represent such contact patterns is in the form of networks. In this paper we utilize known contact patterns from a public transit assignment model in a major metropolitan city, and propose the development of two novel network structures, each of which elucidate certain aspects of passenger travel behavior. We first propose the development of a transfer network, which can reveal passenger groups that travel together on a given day. Second, we propose the development of a community network, which is derived from the transfer network, and captures the similarity of travel patterns among passengers. We then explore the application of each of these network structures to identify the most frequently used travel paths, i.e., routes and transfers, in the public transit system, and model epidemic spreading risk among passengers of a public transit network, respectively. In the latter our conclusions reinforce previous observations, that routes crossing or connecting to the city center in the morning and afternoon peak hours are the most "dangerous" during an outbreak.
- Open Access
- 26 September 2018
- Published by Polish Information Processing Society PTI in Annals of Computer Science and Information Systems
- Vol. 15, 237-243
Community based influence maximization in the Independent Cascade Model
- 26 September 2018
- Published by Polish Information Processing Society PTI in Annals of Computer Science and Information Systems
- Vol. 15, 237-243
Open AccessCommunity based influence maximization in the Independent Cascade Model